cpocon (l)  Linux Man Pages
cpocon: estimates the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
Command to display cpocon
manual in Linux: $ man l cpocon
NAME
CPOCON  estimates the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
SYNOPSIS
 SUBROUTINE CPOCON(

UPLO, N, A, LDA, ANORM, RCOND, WORK, RWORK,
INFO )

CHARACTER
UPLO

INTEGER
INFO, LDA, N

REAL
ANORM, RCOND

REAL
RWORK( * )

COMPLEX
A( LDA, * ), WORK( * )
PURPOSE
CPOCON estimates the reciprocal of the condition number (in the
1norm) of a complex Hermitian positive definite matrix using the
Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF.
An estimate is obtained for norm(inv(A)), and the reciprocal of the
condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
ARGUMENTS
 UPLO (input) CHARACTER*1

= aqUaq: Upper triangle of A is stored;
= aqLaq: Lower triangle of A is stored.
 N (input) INTEGER

The order of the matrix A. N >= 0.
 A (input) COMPLEX array, dimension (LDA,N)

The triangular factor U or L from the Cholesky factorization
A = U**H*U or A = L*L**H, as computed by CPOTRF.
 LDA (input) INTEGER

The leading dimension of the array A. LDA >= max(1,N).
 ANORM (input) REAL

The 1norm (or infinitynorm) of the Hermitian matrix A.
 RCOND (output) REAL

The reciprocal of the condition number of the matrix A,
computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an
estimate of the 1norm of inv(A) computed in this routine.
 WORK (workspace) COMPLEX array, dimension (2*N)

 RWORK (workspace) REAL array, dimension (N)

 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
Pages related to cpocon
 cpocon (3)
 cpoequ (l)  computes row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the twonorm)
 cpoequb (l)  computes row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the twonorm)
 cporfs (l)  improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
 cporfsx (l)  CPORFSX improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, and provides error bounds and backward error estimates for the solution
 cposv (l)  computes the solution to a complex system of linear equations A * X = B,
 cposvx (l)  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,
 cposvxx (l)  CPOSVXX use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a complex system of linear equations A * X = B, where A is an NbyN symmetric positive definite matrix and X and B are NbyNRHS matrices