Scroll to navigation

ZPORFS(1) LAPACK routine (version 3.2) ZPORFS(1)

NAME

ZPORFS - improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,

SYNOPSIS

UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )

CHARACTER UPLO INTEGER INFO, LDA, LDAF, LDB, LDX, N, NRHS DOUBLE PRECISION BERR( * ), FERR( * ), RWORK( * ) COMPLEX*16 A( LDA, * ), AF( LDAF, * ), B( LDB, * ), WORK( * ), X( LDX, * )

PURPOSE

ZPORFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite, and provides error bounds and backward error estimates for the solution.

ARGUMENTS

= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
The order of the matrix A. N >= 0.
The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
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.
The leading dimension of the array A. LDA >= max(1,N).
The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H, as computed by ZPOTRF.
The leading dimension of the array AF. LDAF >= max(1,N).
The right hand side matrix B.
The leading dimension of the array B. LDB >= max(1,N).
On entry, the solution matrix X, as computed by ZPOTRS. On exit, the improved solution matrix X.
The leading dimension of the array X. LDX >= max(1,N).
The estimated forward error bound for each solution vector 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.
The componentwise relative backward error of each solution vector X(j) (i.e., the smallest relative change in any element of A or B that makes X(j) an exact solution).
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value

PARAMETERS

ITMAX is the maximum number of steps of iterative refinement.

November 2008 LAPACK routine (version 3.2)