Developer Reference for Intel® oneAPI Math Kernel Library for C
?hprfs
Refines the solution of a system of linear equations with a packed complex Hermitian coefficient matrix and estimates the solution error.
Syntax
lapack_int LAPACKE_chprfs ( intmatrix_layout , charuplo , lapack_intn , lapack_intnrhs , const lapack_complex_float*ap , const lapack_complex_float*afp , const lapack_int*ipiv , const lapack_complex_float*b , lapack_intldb , lapack_complex_float*x , lapack_intldx , float*ferr , float*berr );
lapack_int LAPACKE_zhprfs ( intmatrix_layout , charuplo , lapack_intn , lapack_intnrhs , const lapack_complex_double*ap , const lapack_complex_double*afp , const lapack_int*ipiv , const lapack_complex_double*b , lapack_intldb , lapack_complex_double*x , lapack_intldx , double*ferr , double*berr );
Include Files
mkl.h
Description
chprfs zhprfs hprfs
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 \(\beta\) . This error is the smallest relative perturbation in elements of A and b such that x is the exact solution of the perturbed system:
\(|\delta a_{ij}| \leq \beta|a_{ij}|, |\delta b_{i}| \leq \beta|b_{i}|\) such that \((A + \delta A)x = (b + \delta b)\) .
Finally, the routine estimates the component-wise forward error in the computed solution \(||x - x_{e}||_{\infty}/||x||_{\infty}\) (here x_{e} is the exact solution).
Before calling this routine:
Input Parameters
matrix_layout
Specifies whether matrix storage layout is row major ( LAPACK_ROW_MAJOR ) or column major ( LAPACK_COL_MAJOR ).
uplo
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
The order of the matrix A ; n ≥ 0.
nrhs
The number of right-hand sides; nrhs ≥ 0.
ap , afp , b , x , work
Arrays:
ap(size *) max(1, n(n+1)/2) contains the original packed matrix A , as supplied to GUID-AB9F4FEF-B046-405E-A1DD-101856C265CE.xml#GUID-AB9F4FEF-B046-405E-A1DD-101856C265CE .
afp(size *) max(1, n(n+1)/2) contains the factored packed matrix A , as returned by GUID-AB9F4FEF-B046-405E-A1DD-101856C265CE.xml#GUID-AB9F4FEF-B046-405E-A1DD-101856C265CE .
b(size ldb by *) of size max(1, ldb * nrhs ) for column major layout and max(1, ldb * n ) for row major layout contains the right-hand side matrix B .
x(size ldx by *) of size max(1, ldx * nrhs ) for column major layout and max(1, ldx * n ) for row major layout contains the solution matrix X .
ldb
The leading dimension of b ; ldb≥ max(1, n)ldb ≥ max(1, n ) for column major layout and ldb ≥ nrhs for row major layout .
ldx
The leading dimension of x ; ldx≥ max(1, n)ldx ≥ max(1, n ) for column major layout and ldx ≥ nrhs for row major layout .
ipiv
Array, size at least max(1, n) . The ipiv array, as returned by ?hptrf (Computes the Bunch-Kaufman factorization of a complex Hermitian matrix using packed storage.) .
rwork
Workspace array, size at least max(1, n) .
Output Parameters
x
The refined solution matrix X .
ferr , berr
Arrays, size at least max(1,nrhs) . Contain the component-wise forward and backward errors, respectively, for each solution vector.
Return Values
This function returns a value info .
If info = 0 , the execution is successful.
If info = -i , parameter i had an illegal value.
LAPACK 95 Interface Notes
There exist FORTRAN 77 and FORTRAN 95 interfaces for this routine. See the Intel® oneMKL Fortran Developer Reference for details.
Application Notes
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 \(16n^{2}\) operations. In addition, each step of iterative refinement involves \(24n^{2}\) 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 \(8n^{2}\) floating-point operations.
The real counterpart of this routine is ?ssprfs (Refines the solution of a system of linear equations with a packed symmetric coefficient matrix and estimates the solution error.) / ?dsprfs (Refines the solution of a system of linear equations with a packed symmetric coefficient matrix and estimates the solution error.) .