zppsvx - use 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,
SUBROUTINE ZPPSVX( FACT, UPLO, N, NRHS, A, AF, EQUED, SCALE, B, LDB, * X, LDX, RCOND, FERR, BERR, WORK, WORK2, INFO) CHARACTER * 1 FACT, UPLO, EQUED DOUBLE COMPLEX A(*), AF(*), B(LDB,*), X(LDX,*), WORK(*) INTEGER N, NRHS, LDB, LDX, INFO DOUBLE PRECISION RCOND DOUBLE PRECISION SCALE(*), FERR(*), BERR(*), WORK2(*)
SUBROUTINE ZPPSVX_64( FACT, UPLO, N, NRHS, A, AF, EQUED, SCALE, B, * LDB, X, LDX, RCOND, FERR, BERR, WORK, WORK2, INFO) CHARACTER * 1 FACT, UPLO, EQUED DOUBLE COMPLEX A(*), AF(*), B(LDB,*), X(LDX,*), WORK(*) INTEGER*8 N, NRHS, LDB, LDX, INFO DOUBLE PRECISION RCOND DOUBLE PRECISION SCALE(*), FERR(*), BERR(*), WORK2(*)
SUBROUTINE PPSVX( FACT, UPLO, [N], [NRHS], A, AF, EQUED, SCALE, B, * [LDB], X, [LDX], RCOND, FERR, BERR, [WORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: FACT, UPLO, EQUED COMPLEX(8), DIMENSION(:) :: A, AF, WORK COMPLEX(8), DIMENSION(:,:) :: B, X INTEGER :: N, NRHS, LDB, LDX, INFO REAL(8) :: RCOND REAL(8), DIMENSION(:) :: SCALE, FERR, BERR, WORK2
SUBROUTINE PPSVX_64( FACT, UPLO, [N], [NRHS], A, AF, EQUED, SCALE, * B, [LDB], X, [LDX], RCOND, FERR, BERR, [WORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: FACT, UPLO, EQUED COMPLEX(8), DIMENSION(:) :: A, AF, WORK COMPLEX(8), DIMENSION(:,:) :: B, X INTEGER(8) :: N, NRHS, LDB, LDX, INFO REAL(8) :: RCOND REAL(8), DIMENSION(:) :: SCALE, FERR, BERR, WORK2
#include <sunperf.h>
void zppsvx(char fact, char uplo, int n, int nrhs, doublecomplex *a, doublecomplex *af, char equed, double *scale, doublecomplex *b, int ldb, doublecomplex *x, int ldx, double *rcond, double *ferr, double *berr, int *info);
void zppsvx_64(char fact, char uplo, long n, long nrhs, doublecomplex *a, doublecomplex *af, char equed, double *scale, doublecomplex *b, long ldb, doublecomplex *x, long ldx, double *rcond, double *ferr, double *berr, long *info);
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.
The following steps are performed:
1. If FACT = 'E', real scaling factors are computed to equilibrate the system:
diag(S) * A * diag(S) * inv(diag(S)) * X = diag(S) * B
Whether or not the system will be equilibrated depends on the
scaling of the matrix A, but if equilibration is used, A is
overwritten by diag(S)*A*diag(S) and B by diag(S)*B.
2. If FACT = 'N' or 'E', the Cholesky decomposition is used to factor the matrix A (after equilibration if FACT = 'E') as A = U'* U , if UPLO = 'U', or
A = L * L', if UPLO = 'L',
where U is an upper triangular matrix, L is a lower triangular matrix, and ' indicates conjugate transpose.
3. If the leading i-by-i principal minor is not positive definite, then the routine returns with INFO = i. Otherwise, the factored form of A is used to estimate the condition number of the matrix A. If the reciprocal of the condition number is less than machine precision, INFO = N+1 is returned as a warning, but the routine still goes on to solve for X and compute error bounds as described below.
4. The system of equations is solved for X using the factored form of A.
5. Iterative refinement is applied to improve the computed solution matrix and calculate error bounds and backward error estimates for it.
6. If equilibration was used, the matrix X is premultiplied by
diag(S) so that it solves the original system before
equilibration.
= 'E': The matrix A will be equilibrated if necessary, then copied to AF and factored.
= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
A(i,j) for 1 < =i < =j;
if UPLO = 'L', A(i + (j-1)*(2n-j)/2) = A(i,j) for j < =i < =n.
See below for further details. A is not modified if
FACT = 'F' or 'N', or if FACT = 'E' and EQUED = 'N' on exit.
On exit, if FACT = 'E' and EQUED = 'Y', A is overwritten by diag(SCALE)*A*diag(SCALE).
If FACT = 'N', then AF is an output argument and on exit returns the triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H of the original matrix A.
If FACT = 'E', then AF is an output argument and on exit returns the triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H of the equilibrated matrix A (see the description of A for the form of the equilibrated matrix).
= 'Y': Equilibration was done, i.e., A has been replaced by diag(SCALE) * A * diag(SCALE). EQUED is an input argument if FACT = 'F'; otherwise, it is an output argument.
diag(SCALE) * B.
X(j) (the j-th column of the solution matrix X).
If XTRUE is the true solution corresponding to X(j), FERR(j)
is an estimated upper bound for the magnitude of the largest
element in (X(j) - XTRUE) divided by the magnitude of the
largest element in X(j). The estimate is as reliable as
the estimate for RCOND, and is almost always a slight
overestimate of the true error.
X(j) (i.e., the smallest relative change in
any element of A or B that makes X(j) an exact solution).
dimension(2*N)
dimension(N)
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, and i is
< = N: the leading minor of order i of A is not positive definite, so the factorization could not be completed, and the solution has not been computed. RCOND = 0 is returned. = N+1: U is nonsingular, but RCOND is less than machine precision, meaning that the matrix is singular to working precision. Nevertheless, the solution and error bounds are computed because there are a number of situations where the computed solution can be more accurate than the value of RCOND would suggest.
The packed storage scheme is illustrated by the following example when N = 4, UPLO = 'U':
Two-dimensional storage of the Hermitian matrix A:
a11 a12 a13 a14
a22 a23 a24
a33 a34 (aij = conjg(aji))
a44
Packed storage of the upper triangle of A:
A = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]