Refines the solution of a system of linear equations with a packed complex Hermitian matrix and estimates the solution error.
FORTRAN 77:
call chprfs( uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info )
call zhprfs( uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info )
FORTRAN 95:
call hprfs( ap, afp, ipiv, b, x [,uplo] [,ferr] [,berr] [,info] )
C:
lapack_int LAPACKE_chprfs( int matrix_order, char uplo, lapack_int n, lapack_int nrhs, const lapack_complex_float* ap, const lapack_complex_float* afp, const lapack_int* ipiv, const lapack_complex_float* b, lapack_int ldb, lapack_complex_float* x, lapack_int ldx, float* ferr, float* berr );
lapack_int LAPACKE_zhprfs( int matrix_order, char uplo, lapack_int n, lapack_int nrhs, const lapack_complex_double* ap, const lapack_complex_double* afp, const lapack_int* ipiv, const lapack_complex_double* b, lapack_int ldb, lapack_complex_double* x, lapack_int ldx, double* ferr, double* berr );
The routine performs an iterative refinement of the solution to a system of linear equations A*X = B with a packed complex Hermitian matrix A, with multiple right-hand sides. For each computed solution vector x, the routine computes the component-wise backward error β. This error is the smallest relative perturbation in elements of A and b such that x is the exact solution of the perturbed system:
|δaij| ≤ β|aij|, |δbi| ≤ β|bi| such that (A + δA)x = (b + δb).
Finally, the routine estimates the component-wise forward error in the computed solution ||x - xe||∞/||x||∞ (here xe is the exact solution).
Before calling this routine:
The data types are given for the Fortran interface. A <datatype> placeholder, if present, is used for the C interface data types in the C interface section above. See C Interface Conventions for the C interface principal conventions and type definitions.
uplo |
CHARACTER*1. Must be 'U' or 'L'. If uplo = 'U', the upper triangle of A is stored. If uplo = 'L', the lower triangle of A is stored. |
n |
INTEGER. The order of the matrix A; n ≥ 0. |
nrhs |
INTEGER. The number of right-hand sides; nrhs ≥ 0. |
ap,afp,b,x,work |
COMPLEX for chprfs DOUBLE COMPLEX for zhprfs. Arrays: ap(*) contains the original packed matrix A, as supplied to ?hptrf. afp(*) contains the factored packed matrix A, as returned by ?hptrf. b(ldb,*) contains the right-hand side matrix B. x(ldx,*) contains the solution matrix X. work(*) is a workspace array. The dimension of arrays ap and afp must be at least max(1,n(n+1)/2); the second dimension of b and x must be at least max(1,nrhs); the dimension of work must be at least max(1, 2*n). |
ldb |
INTEGER. The leading dimension of b; ldb ≥ max(1, n). |
ldx |
INTEGER. The leading dimension of x; ldx ≥ max(1, n). |
ipiv |
INTEGER. Array, DIMENSION at least max(1, n). The ipiv array, as returned by ?hptrf. |
rwork |
REAL for chprfs DOUBLE PRECISION for zhprfs. Workspace array, DIMENSION at least max(1, n). |
x |
The refined solution matrix X. |
ferr, berr |
REAL for chprfs. DOUBLE PRECISION for zhprfs. Arrays, DIMENSION at least max(1,nrhs). Contain the component-wise forward and backward errors, respectively, for each solution vector. |
info |
INTEGER. If info = 0, the execution is successful. If info = -i, the i-th parameter had an illegal value. |
Routines in Fortran 95 interface have fewer arguments in the calling sequence than their FORTRAN 77 counterparts. For general conventions applied to skip redundant or reconstructible arguments, see Fortran 95 Interface Conventions.
Specific details for the routine hprfs interface are as follows:
ap |
Holds the array A of size (n*(n+1)/2). |
afp |
Holds the array AF of size (n*(n+1)/2). |
ipiv |
Holds the vector of length n. |
b |
Holds the matrix B of size (n,nrhs). |
x |
Holds the matrix X of size (n,nrhs). |
ferr |
Holds the vector of length (nrhs). |
berr |
Holds the vector of length (nrhs). |
uplo |
Must be 'U' or 'L'. The default value is 'U'. |
The bounds returned in ferr are not rigorous, but in practice they almost always overestimate the actual error.
For each right-hand side, computation of the backward error involves a minimum of 16n2 operations. In addition, each step of iterative refinement involves 24n2 operations; the number of iterations may range from 1 to 5.
Estimating the forward error involves solving a number of systems of linear equations A*x = b; the number is usually 4 or 5 and never more than 11. Each solution requires approximately 8n2 floating-point operations.