SRC/cpotrs.f(3)

✨ SRC/cpotrs.f ✨

okay bestie, gather round, because this is the cpotrs.f manpage from the LAPACK library manual and it's lowkey iconic πŸ’… (the manual name is LAPACK, fr β€” we're in the Library Functions Manual, section 3)


πŸ¦‹ SYNOPSIS πŸ¦‹

Functions/Subroutines

  • subroutine cpotrs (uplo, n, nrhs, a, lda, b, ldb, info) β€” CPOTRS

🌸 Function/Subroutine Documentation 🌸

subroutine cpotrs (character uplo, integer n, integer nrhs, complex,
    dimension( lda, * ) a, integer lda, complex, dimension( ldb, * ) b,
    integer ldb, integer info)

CPOTRS β€” say it with me, bestie πŸŽ€

πŸ’– Purpose πŸ’–

k so here's the tea β˜• β€” CPOTRS solves a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF. that's it, that's the whole vibe. it takes the factorization your girl CPOTRF already did and actually solves the thing. slay πŸ’…

🌈 Parameters 🌈

  • UPLO β€” UPLO is CHARACTER*1. it tells you which triangle of A is stored, and there are exactly two moods:
    • = 'U': Upper triangle of A is stored;
    • = 'L': Lower triangle of A is stored.
  • N β€” N is INTEGER. the order of the matrix A. the rules are simple: N >= 0. no cap 🫢
  • NRHS β€” NRHS is INTEGER. the number of right hand sides, i.e., the number of columns of the matrix B. and yes, NRHS >= 0 β€” that constraint is literally non-negotiable ✨
  • A β€” A is COMPLEX array, dimension (LDA,N). this is the triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H, as computed by CPOTRF. it's giving "hand me the factorized version, I'll take it from here" πŸ‘‘
  • LDA β€” LDA is INTEGER. the leading dimension of the array A. and the boundary is LDA >= max(1,N). respect it πŸ’€
  • B β€” B is COMPLEX array, dimension (LDB,NRHS). on entry, the right hand side matrix B. on exit, the solution matrix X. so it's a glow-up situation β€” same array, new identity, main character energy 🌟
  • LDB β€” LDB is INTEGER. the leading dimension of the array B. fun little rule: LDB >= max(1,N) πŸŽ€
  • INFO β€” INFO is INTEGER. the vibe check at the end:
    • = 0: successful exit ✨
    • < 0: if INFO = -i, the i-th argument had an illegal value πŸ™ˆ

πŸ’œ Author πŸ’œ

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.
Definition at line 109 of file cpotrs.f. πŸ“

🧚 Author 🧚

Generated automatically by Doxygen for LAPACK from the source code. (yes bestie, a robot wrote the manpage, the algorithm wrote the math, and I'm just here making it cute 🫢)


k that's the whole page, no gatekeeping πŸ’– LAPACK, Version 3.12.0, SRC/cpotrs.f(3) β€” go solve something, icon πŸŒΈπŸ¦‹πŸ’…

πŸ“¦ where this page comes from