/home/abui...RC/zposv.f(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

πŸ’– NAME πŸ’–

Okay bestie, this is the Library Functions Manual page for zposv.f(3) β€” specifically the file at /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zposv.f. It's LAPACK 3.12.0, and it's here to solve a complex Hermitian positive definite linear system like the main character it is. πŸ’…

✨ SYNOPSIS ✨

Functions/Subroutines

subroutine ZPOSV (uplo, n, nrhs, a, lda, b, ldb, info)
     ZPOSV computes the solution to system of linear equations A * X = B
    for PO matrices

🧚 Function/Subroutine Documentation 🧚

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

ZPOSV computes the solution to system of linear equations A * X = B for PO matrices. 🫢

🌸 Purpose 🌸

Okay so ZPOSV computes the solution to a complex system of linear equations:

A * X = B,

where A is an N-by-N Hermitian positive definite matrix and X and B are N-by-NRHS matrices. ✨

The Cholesky decomposition is used to factor A as:

  • 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 a lower triangular matrix. The factored form of A is then used to solve the system of equations A * X = B. πŸŽ€

πŸŽ€ 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 number of linear equations, i.e., the order of the matrix A. N >= 0.
  • NRHS β€” NRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
  • A β€” A is COMPLEX*16 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).
  • B β€” B is COMPLEX*16 array, dimension (LDB,NRHS). On entry, the N-by-NRHS right hand side matrix B. On exit, if INFO = 0, the N-by-NRHS solution matrix X.
  • LDB β€” LDB is INTEGER. The leading dimension of the array B. LDB >= 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 of A is not positive, so the factorization could not be completed, and the solution has not been computed.

πŸ‘‘ Author πŸ‘‘

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

πŸ“Œ Definition at line 129 of file zposv.f. πŸ“Œ

Literally line 129 of zposv.f, bestie. That's where the definition lives. πŸ“

πŸ¦‹ Author πŸ¦‹

Generated automatically by Doxygen for LAPACK from the source code.


πŸ’œ That's the whole page, bestie β€” LAPACK Version 3.12.0, footer path /home/abui...RC/zposv.f(3). No date on this footer, so no invented date, just pure LAPACK energy. Mwah! πŸ’…

πŸ“¦ where this page comes from