CPOTRF(3)

🌟 CPOTRF(3) 🌟

okay bestie, welcome to the CPOTRF(3) page — it's living in the Library Functions Manual, and the header/footer path vibe is /home/abui...OP/cpotrf.f(3) (yes, it appears on both sides in the original, lowkey iconic). Anyway, let's get into the whole thing 💖

💅 NAME 💅

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/VARIANTS/cholesky/TOP/cpotrf.f

✨ SYNOPSIS ✨

🎀 Functions/Subroutines 🎀

• subroutine CPOTRF (uplo, n, a, lda, info) — CPOTRF VARIANT: top-looking block version of the algorithm, calling Level 3 BLAS.

🫶 FUNCTION/SUBROUTINE DOCUMENTATION 🫶

subroutine CPOTRF (character uplo, integer n, complex, dimension( lda, * ) a, integer lda, integer info)

CPOTRF VARIANT: top-looking block version of the algorithm, calling Level 3 BLAS.

💖 Purpose 💖

Okay so CPOTRF computes the Cholesky factorization of a complex Hermitian positive definite matrix A ✨

The factorization has the form:

A = U**H * U,  if UPLO = 'U', or
A = L  * L**H,  if UPLO = 'L',

where U is an upper triangular matrix and L is lower triangular.

This is the top-looking block version of the algorithm, calling Level 3 BLAS.

🧚 PARAMETERS 🧚

• UPLO — UPLO is CHARACTER*1
  • = 'U': Upper triangle of A is stored;
  • = 'L': Lower triangle of A is stored.
• N — N is INTEGER; the order of the matrix A. N >= 0.
• A — A is COMPLEX array, dimension (LDA,N). On entry, the Hermitian matrix A. If UPLO = 'U', the leading N-by-N upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading N-by-N lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.

On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H.

• LDA — LDA is INTEGER; the leading dimension of the array A. LDA >= max(1,N).
• INFO — INFO is INTEGER
  • = 0: successful exit
  • < 0: if INFO = -i, the i-th argument had an illegal value
  • > 0: if INFO = i, the leading principal minor of order i is not positive, and the factorization could not be completed.

🌈 Author 🌈

• Univ. of Tennessee
• Univ. of California Berkeley
• Univ. of Colorado Denver
• NAG Ltd.

🌸 Date 🌸

December 2016

📍 Definition at line 101 of file cpotrf.f.

👑 Author 👑

Generated automatically by Doxygen for LAPACK from the source code.

---

okay bestie that's the whole page 💖 it's serving LAPACK Version 3.12.0 energy, dated December 2016, with the footer path /home/abui...OP/cpotrf.f(3) doing its little cameo. periodt ✨