|
|
|
complib/zpprfs(3) -- when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward
|
|
ZPPRFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward error estimates for the solution. |
|
complib/zppsv(3) -- X = B,
|
|
ZPPSV computes the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian positive definite matrix stored in packed format 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.... |
|
|
complib/zppsvx(3) -- compute the solution to a complex system of linear equations A * X = B,
|
|
ZPPSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian positive definite matrix stored in packed format and X and B are N-by-NRHS matrices. Error bounds on the solution and a condition estimate are also provided. |
|
complib/zpptrf(3) -- compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
|
|
ZPPTRF computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format. 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. |
|
complib/zpptri(3) -- compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**
|
|
ZPPTRI computes the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF. |
|
complib/zpptrs(3) -- solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using
|
|
ZPPTRS solves a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF. |
|
complib/zptcon(3) -- compute the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite tridia
|
|
ZPTCON computes the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by ZPTTRF. Norm(inv(A)) is computed by a direct method, and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). |
|
complib/zpteqr(3) -- compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by f
|
|
ZPTEQR computes all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF and then calling ZBDSQR to compute the singular values of the bidiagonal factor. This routine computes the eigenvalues of the positive definite tridiagonal matrix to high relative accuracy. This means that if the eigenvalues range over many orders of magnitude in size, then the small eigenvalues and corresponding eigenvectors will be compute... |
|
complib/zptrfs(3) -- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positiv
|
|
ZPTRFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution. |
|
complib/zptsv(3) -- and X and B are N-by-NRHS matrices
|
|
ZPTSV computes the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices. A is factored as A = L*D*L**H, and the factored form of A is then used to solve the system of equations. |
|
complib/zptsvx(3) -- Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices
|
|
ZPTSVX uses the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices. Error bounds on the solution and a condition estimate are also provided. |
|
complib/zpttrf(3) -- compute the factorization of a complex Hermitian positive definite tridiagonal matrix A
|
|
ZPTTRF computes the factorization of a complex Hermitian positive definite tridiagonal matrix A. If the subdiagonal elements of A are supplied in the array E, the factorization has the form A = L*D*L**H, where D is diagonal and L is unit lower bidiagonal; if the superdiagonal elements of A are supplied, it has the form A = U**H*D*U, where U is unit upper bidiagonal. |
|
complib/zpttrs(3) -- solve a system of linear equations A * X = B with a Hermitian positive definite tridiagonal matrix A using the
|
|
ZPTTRS solves a system of linear equations A * X = B with a Hermitian positive definite tridiagonal matrix A using the factorization A = U**H*D*U or A = L*D*L**H computed by ZPTTRF. |
|
standard/zsource(3) -- selects the source for z-buffering comparisons
|
|
src expects one of two possible values: ZSRC_DEPTH, z-buffering is done by depth comparison (default). ZSRC_COLOR, z-buffering is done by color comparison. |
|
complib/zspcon(3) -- estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric packed matrix A using t
|
|
ZSPCON estimates the reciprocal of the condition number (in the 1-norm) of a complex symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). |
