1ZPPRFS(1) LAPACK routine (version 3.2) ZPPRFS(1)
2
6 ZPPRFS - improves the computed solution to a system of linear equations
7 when the coefficient matrix is Hermitian positive definite and packed,
8 and provides error bounds and backward error estimates for the solution
9
11 SUBROUTINE ZPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR, BERR,
12 WORK, RWORK, INFO )
13 CHARACTER UPLO
15 INTEGER INFO, LDB, LDX, N, NRHS
17 DOUBLE PRECISION BERR( * ), FERR( * ), RWORK( * )
19 COMPLEX*16 AFP( * ), AP( * ), B( LDB, * ), WORK( * ), X( LDX, *
21 )
22
24 ZPPRFS improves the computed solution to a system of linear equations
25 when the coefficient matrix is Hermitian positive definite and packed,
26 and provides error bounds and backward error estimates for the solu‐
27 tion.
28
30 UPLO (input) CHARACTER*1
31 = 'U': Upper triangle of A is stored;
32 = 'L': Lower triangle of A is stored.
33 N (input) INTEGER
35 The order of the matrix A. N >= 0.
36 NRHS (input) INTEGER
38 The number of right hand sides, i.e., the number of columns of
39 the matrices B and X. NRHS >= 0.
40 AP (input) COMPLEX*16 array, dimension (N*(N+1)/2)
42 The upper or lower triangle of the Hermitian matrix A, packed
43 columnwise in a linear array. The j-th column of A is stored
44 in the array AP as follows: if UPLO = 'U', AP(i + (j-1)*j/2) =
45 A(i,j) for 1<=i<=j; if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) =
46 A(i,j) for j<=i<=n.
47 AFP (input) COMPLEX*16 array, dimension (N*(N+1)/2)
49 The triangular factor U or L from the Cholesky factorization A
50 = U**H*U or A = L*L**H, as computed by DPPTRF/ZPPTRF, packed
51 columnwise in a linear array in the same format as A (see AP).
52 B (input) COMPLEX*16 array, dimension (LDB,NRHS)
54 The right hand side matrix B.
55 LDB (input) INTEGER
57 The leading dimension of the array B. LDB >= max(1,N).
58 X (input/output) COMPLEX*16 array, dimension (LDX,NRHS)
60 On entry, the solution matrix X, as computed by ZPPTRS. On
61 exit, the improved solution matrix X.
62 LDX (input) INTEGER
64 The leading dimension of the array X. LDX >= max(1,N).
65 FERR (output) DOUBLE PRECISION array, dimension (NRHS)
67 The estimated forward error bound for each solution vector X(j)
68 (the j-th column of the solution matrix X). If XTRUE is the
69 true solution corresponding to X(j), FERR(j) is an estimated
70 upper bound for the magnitude of the largest element in (X(j) -
71 XTRUE) divided by the magnitude of the largest element in X(j).
72 The estimate is as reliable as the estimate for RCOND, and is
73 almost always a slight overestimate of the true error.
74 BERR (output) DOUBLE PRECISION array, dimension (NRHS)
76 The componentwise relative backward error of each solution vec‐
77 tor X(j) (i.e., the smallest relative change in any element of
78 A or B that makes X(j) an exact solution).
79 WORK (workspace) COMPLEX*16 array, dimension (2*N)
81 RWORK (workspace) DOUBLE PRECISION array, dimension (N)
83 INFO (output) INTEGER
85 = 0: successful exit
86 < 0: if INFO = -i, the i-th argument had an illegal value
87
89 ITMAX is the maximum number of steps of iterative refinement.
90 LAPACK routine (version 3.2) November 2008 ZPPRFS(1)