.TH "hprfs" 3 "Version 3.12.0" "LAPACK" \" -*- nroff -*-
.ad l
.nh
.SH NAME
hprfs \- {hp,sp}rfs: iterative refinement
.SH SYNOPSIS
.br
.PP
.SS "Functions"

.in +1c
.ti -1c
.RI "subroutine \fBchprfs\fP (uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)"
.br
.RI "\fBCHPRFS\fP "
.ti -1c
.RI "subroutine \fBcsprfs\fP (uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)"
.br
.RI "\fBCSPRFS\fP "
.ti -1c
.RI "subroutine \fBdsprfs\fP (uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)"
.br
.RI "\fBDSPRFS\fP "
.ti -1c
.RI "subroutine \fBssprfs\fP (uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)"
.br
.RI "\fBSSPRFS\fP "
.ti -1c
.RI "subroutine \fBzhprfs\fP (uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)"
.br
.RI "\fBZHPRFS\fP "
.ti -1c
.RI "subroutine \fBzsprfs\fP (uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)"
.br
.RI "\fBZSPRFS\fP "
.in -1c
.SH "Detailed Description"
.PP 

.SH "Function Documentation"
.PP 
.SS "subroutine chprfs (character uplo, integer n, integer nrhs, complex, dimension( * ) ap, complex, dimension( * ) afp, integer, dimension( * ) ipiv, complex, dimension( ldb, * ) b, integer ldb, complex, dimension( ldx, * ) x, integer ldx, real, dimension( * ) ferr, real, dimension( * ) berr, complex, dimension( * ) work, real, dimension( * ) rwork, integer info)"

.PP
\fBCHPRFS\fP  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!> CHPRFS improves the computed solution to a system of linear
!> equations when the coefficient matrix is Hermitian indefinite
!> and packed, and provides error bounds and backward error estimates
!> for the solution\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
!>          UPLO is CHARACTER*1
!>          = 'U':  Upper triangle of A is stored;
!>          = 'L':  Lower triangle of A is stored\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>          The order of the matrix A\&.  N >= 0\&.
!> 
.fi
.PP
.br
\fINRHS\fP 
.PP
.nf
!>          NRHS is INTEGER
!>          The number of right hand sides, i\&.e\&., the number of columns
!>          of the matrices B and X\&.  NRHS >= 0\&.
!> 
.fi
.PP
.br
\fIAP\fP 
.PP
.nf
!>          AP is COMPLEX array, dimension (N*(N+1)/2)
!>          The upper or lower triangle of the Hermitian matrix A, packed
!>          columnwise in a linear array\&.  The j-th column of A is stored
!>          in the array AP as follows:
!>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
!>          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n\&.
!> 
.fi
.PP
.br
\fIAFP\fP 
.PP
.nf
!>          AFP is COMPLEX array, dimension (N*(N+1)/2)
!>          The factored form of the matrix A\&.  AFP contains the block
!>          diagonal matrix D and the multipliers used to obtain the
!>          factor U or L from the factorization A = U*D*U**H or
!>          A = L*D*L**H as computed by CHPTRF, stored as a packed
!>          triangular matrix\&.
!> 
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
!>          IPIV is INTEGER array, dimension (N)
!>          Details of the interchanges and the block structure of D
!>          as determined by CHPTRF\&.
!> 
.fi
.PP
.br
\fIB\fP 
.PP
.nf
!>          B is COMPLEX array, dimension (LDB,NRHS)
!>          The right hand side matrix B\&.
!> 
.fi
.PP
.br
\fILDB\fP 
.PP
.nf
!>          LDB is INTEGER
!>          The leading dimension of the array B\&.  LDB >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIX\fP 
.PP
.nf
!>          X is COMPLEX array, dimension (LDX,NRHS)
!>          On entry, the solution matrix X, as computed by CHPTRS\&.
!>          On exit, the improved solution matrix X\&.
!> 
.fi
.PP
.br
\fILDX\fP 
.PP
.nf
!>          LDX is INTEGER
!>          The leading dimension of the array X\&.  LDX >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIFERR\fP 
.PP
.nf
!>          FERR is REAL array, dimension (NRHS)
!>          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\&.
!> 
.fi
.PP
.br
\fIBERR\fP 
.PP
.nf
!>          BERR is REAL array, dimension (NRHS)
!>          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)\&.
!> 
.fi
.PP
.br
\fIWORK\fP 
.PP
.nf
!>          WORK is COMPLEX array, dimension (2*N)
!> 
.fi
.PP
.br
\fIRWORK\fP 
.PP
.nf
!>          RWORK is REAL array, dimension (N)
!> 
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
.fi
.PP
 
.RE
.PP
\fBInternal Parameters:\fP
.RS 4

.PP
.nf
!>  ITMAX is the maximum number of steps of iterative refinement\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB178\fP of file \fBchprfs\&.f\fP\&.
.SS "subroutine csprfs (character uplo, integer n, integer nrhs, complex, dimension( * ) ap, complex, dimension( * ) afp, integer, dimension( * ) ipiv, complex, dimension( ldb, * ) b, integer ldb, complex, dimension( ldx, * ) x, integer ldx, real, dimension( * ) ferr, real, dimension( * ) berr, complex, dimension( * ) work, real, dimension( * ) rwork, integer info)"

.PP
\fBCSPRFS\fP  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!> CSPRFS improves the computed solution to a system of linear
!> equations when the coefficient matrix is symmetric indefinite
!> and packed, and provides error bounds and backward error estimates
!> for the solution\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
!>          UPLO is CHARACTER*1
!>          = 'U':  Upper triangle of A is stored;
!>          = 'L':  Lower triangle of A is stored\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>          The order of the matrix A\&.  N >= 0\&.
!> 
.fi
.PP
.br
\fINRHS\fP 
.PP
.nf
!>          NRHS is INTEGER
!>          The number of right hand sides, i\&.e\&., the number of columns
!>          of the matrices B and X\&.  NRHS >= 0\&.
!> 
.fi
.PP
.br
\fIAP\fP 
.PP
.nf
!>          AP is COMPLEX array, dimension (N*(N+1)/2)
!>          The upper or lower triangle of the symmetric matrix A, packed
!>          columnwise in a linear array\&.  The j-th column of A is stored
!>          in the array AP as follows:
!>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
!>          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n\&.
!> 
.fi
.PP
.br
\fIAFP\fP 
.PP
.nf
!>          AFP is COMPLEX array, dimension (N*(N+1)/2)
!>          The factored form of the matrix A\&.  AFP contains the block
!>          diagonal matrix D and the multipliers used to obtain the
!>          factor U or L from the factorization A = U*D*U**T or
!>          A = L*D*L**T as computed by CSPTRF, stored as a packed
!>          triangular matrix\&.
!> 
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
!>          IPIV is INTEGER array, dimension (N)
!>          Details of the interchanges and the block structure of D
!>          as determined by CSPTRF\&.
!> 
.fi
.PP
.br
\fIB\fP 
.PP
.nf
!>          B is COMPLEX array, dimension (LDB,NRHS)
!>          The right hand side matrix B\&.
!> 
.fi
.PP
.br
\fILDB\fP 
.PP
.nf
!>          LDB is INTEGER
!>          The leading dimension of the array B\&.  LDB >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIX\fP 
.PP
.nf
!>          X is COMPLEX array, dimension (LDX,NRHS)
!>          On entry, the solution matrix X, as computed by CSPTRS\&.
!>          On exit, the improved solution matrix X\&.
!> 
.fi
.PP
.br
\fILDX\fP 
.PP
.nf
!>          LDX is INTEGER
!>          The leading dimension of the array X\&.  LDX >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIFERR\fP 
.PP
.nf
!>          FERR is REAL array, dimension (NRHS)
!>          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\&.
!> 
.fi
.PP
.br
\fIBERR\fP 
.PP
.nf
!>          BERR is REAL array, dimension (NRHS)
!>          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)\&.
!> 
.fi
.PP
.br
\fIWORK\fP 
.PP
.nf
!>          WORK is COMPLEX array, dimension (2*N)
!> 
.fi
.PP
.br
\fIRWORK\fP 
.PP
.nf
!>          RWORK is REAL array, dimension (N)
!> 
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
.fi
.PP
 
.RE
.PP
\fBInternal Parameters:\fP
.RS 4

.PP
.nf
!>  ITMAX is the maximum number of steps of iterative refinement\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB178\fP of file \fBcsprfs\&.f\fP\&.
.SS "subroutine dsprfs (character uplo, integer n, integer nrhs, double precision, dimension( * ) ap, double precision, dimension( * ) afp, integer, dimension( * ) ipiv, double precision, dimension( ldb, * ) b, integer ldb, double precision, dimension( ldx, * ) x, integer ldx, double precision, dimension( * ) ferr, double precision, dimension( * ) berr, double precision, dimension( * ) work, integer, dimension( * ) iwork, integer info)"

.PP
\fBDSPRFS\fP  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!> DSPRFS improves the computed solution to a system of linear
!> equations when the coefficient matrix is symmetric indefinite
!> and packed, and provides error bounds and backward error estimates
!> for the solution\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
!>          UPLO is CHARACTER*1
!>          = 'U':  Upper triangle of A is stored;
!>          = 'L':  Lower triangle of A is stored\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>          The order of the matrix A\&.  N >= 0\&.
!> 
.fi
.PP
.br
\fINRHS\fP 
.PP
.nf
!>          NRHS is INTEGER
!>          The number of right hand sides, i\&.e\&., the number of columns
!>          of the matrices B and X\&.  NRHS >= 0\&.
!> 
.fi
.PP
.br
\fIAP\fP 
.PP
.nf
!>          AP is DOUBLE PRECISION array, dimension (N*(N+1)/2)
!>          The upper or lower triangle of the symmetric matrix A, packed
!>          columnwise in a linear array\&.  The j-th column of A is stored
!>          in the array AP as follows:
!>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
!>          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n\&.
!> 
.fi
.PP
.br
\fIAFP\fP 
.PP
.nf
!>          AFP is DOUBLE PRECISION array, dimension (N*(N+1)/2)
!>          The factored form of the matrix A\&.  AFP contains the block
!>          diagonal matrix D and the multipliers used to obtain the
!>          factor U or L from the factorization A = U*D*U**T or
!>          A = L*D*L**T as computed by DSPTRF, stored as a packed
!>          triangular matrix\&.
!> 
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
!>          IPIV is INTEGER array, dimension (N)
!>          Details of the interchanges and the block structure of D
!>          as determined by DSPTRF\&.
!> 
.fi
.PP
.br
\fIB\fP 
.PP
.nf
!>          B is DOUBLE PRECISION array, dimension (LDB,NRHS)
!>          The right hand side matrix B\&.
!> 
.fi
.PP
.br
\fILDB\fP 
.PP
.nf
!>          LDB is INTEGER
!>          The leading dimension of the array B\&.  LDB >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIX\fP 
.PP
.nf
!>          X is DOUBLE PRECISION array, dimension (LDX,NRHS)
!>          On entry, the solution matrix X, as computed by DSPTRS\&.
!>          On exit, the improved solution matrix X\&.
!> 
.fi
.PP
.br
\fILDX\fP 
.PP
.nf
!>          LDX is INTEGER
!>          The leading dimension of the array X\&.  LDX >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIFERR\fP 
.PP
.nf
!>          FERR is DOUBLE PRECISION array, dimension (NRHS)
!>          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\&.
!> 
.fi
.PP
.br
\fIBERR\fP 
.PP
.nf
!>          BERR is DOUBLE PRECISION array, dimension (NRHS)
!>          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)\&.
!> 
.fi
.PP
.br
\fIWORK\fP 
.PP
.nf
!>          WORK is DOUBLE PRECISION array, dimension (3*N)
!> 
.fi
.PP
.br
\fIIWORK\fP 
.PP
.nf
!>          IWORK is INTEGER array, dimension (N)
!> 
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
.fi
.PP
 
.RE
.PP
\fBInternal Parameters:\fP
.RS 4

.PP
.nf
!>  ITMAX is the maximum number of steps of iterative refinement\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB177\fP of file \fBdsprfs\&.f\fP\&.
.SS "subroutine ssprfs (character uplo, integer n, integer nrhs, real, dimension( * ) ap, real, dimension( * ) afp, integer, dimension( * ) ipiv, real, dimension( ldb, * ) b, integer ldb, real, dimension( ldx, * ) x, integer ldx, real, dimension( * ) ferr, real, dimension( * ) berr, real, dimension( * ) work, integer, dimension( * ) iwork, integer info)"

.PP
\fBSSPRFS\fP  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!> SSPRFS improves the computed solution to a system of linear
!> equations when the coefficient matrix is symmetric indefinite
!> and packed, and provides error bounds and backward error estimates
!> for the solution\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
!>          UPLO is CHARACTER*1
!>          = 'U':  Upper triangle of A is stored;
!>          = 'L':  Lower triangle of A is stored\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>          The order of the matrix A\&.  N >= 0\&.
!> 
.fi
.PP
.br
\fINRHS\fP 
.PP
.nf
!>          NRHS is INTEGER
!>          The number of right hand sides, i\&.e\&., the number of columns
!>          of the matrices B and X\&.  NRHS >= 0\&.
!> 
.fi
.PP
.br
\fIAP\fP 
.PP
.nf
!>          AP is REAL array, dimension (N*(N+1)/2)
!>          The upper or lower triangle of the symmetric matrix A, packed
!>          columnwise in a linear array\&.  The j-th column of A is stored
!>          in the array AP as follows:
!>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
!>          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n\&.
!> 
.fi
.PP
.br
\fIAFP\fP 
.PP
.nf
!>          AFP is REAL array, dimension (N*(N+1)/2)
!>          The factored form of the matrix A\&.  AFP contains the block
!>          diagonal matrix D and the multipliers used to obtain the
!>          factor U or L from the factorization A = U*D*U**T or
!>          A = L*D*L**T as computed by SSPTRF, stored as a packed
!>          triangular matrix\&.
!> 
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
!>          IPIV is INTEGER array, dimension (N)
!>          Details of the interchanges and the block structure of D
!>          as determined by SSPTRF\&.
!> 
.fi
.PP
.br
\fIB\fP 
.PP
.nf
!>          B is REAL array, dimension (LDB,NRHS)
!>          The right hand side matrix B\&.
!> 
.fi
.PP
.br
\fILDB\fP 
.PP
.nf
!>          LDB is INTEGER
!>          The leading dimension of the array B\&.  LDB >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIX\fP 
.PP
.nf
!>          X is REAL array, dimension (LDX,NRHS)
!>          On entry, the solution matrix X, as computed by SSPTRS\&.
!>          On exit, the improved solution matrix X\&.
!> 
.fi
.PP
.br
\fILDX\fP 
.PP
.nf
!>          LDX is INTEGER
!>          The leading dimension of the array X\&.  LDX >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIFERR\fP 
.PP
.nf
!>          FERR is REAL array, dimension (NRHS)
!>          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\&.
!> 
.fi
.PP
.br
\fIBERR\fP 
.PP
.nf
!>          BERR is REAL array, dimension (NRHS)
!>          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)\&.
!> 
.fi
.PP
.br
\fIWORK\fP 
.PP
.nf
!>          WORK is REAL array, dimension (3*N)
!> 
.fi
.PP
.br
\fIIWORK\fP 
.PP
.nf
!>          IWORK is INTEGER array, dimension (N)
!> 
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
.fi
.PP
 
.RE
.PP
\fBInternal Parameters:\fP
.RS 4

.PP
.nf
!>  ITMAX is the maximum number of steps of iterative refinement\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB177\fP of file \fBssprfs\&.f\fP\&.
.SS "subroutine zhprfs (character uplo, integer n, integer nrhs, complex*16, dimension( * ) ap, complex*16, dimension( * ) afp, integer, dimension( * ) ipiv, complex*16, dimension( ldb, * ) b, integer ldb, complex*16, dimension( ldx, * ) x, integer ldx, double precision, dimension( * ) ferr, double precision, dimension( * ) berr, complex*16, dimension( * ) work, double precision, dimension( * ) rwork, integer info)"

.PP
\fBZHPRFS\fP  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!> ZHPRFS improves the computed solution to a system of linear
!> equations when the coefficient matrix is Hermitian indefinite
!> and packed, and provides error bounds and backward error estimates
!> for the solution\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
!>          UPLO is CHARACTER*1
!>          = 'U':  Upper triangle of A is stored;
!>          = 'L':  Lower triangle of A is stored\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>          The order of the matrix A\&.  N >= 0\&.
!> 
.fi
.PP
.br
\fINRHS\fP 
.PP
.nf
!>          NRHS is INTEGER
!>          The number of right hand sides, i\&.e\&., the number of columns
!>          of the matrices B and X\&.  NRHS >= 0\&.
!> 
.fi
.PP
.br
\fIAP\fP 
.PP
.nf
!>          AP is COMPLEX*16 array, dimension (N*(N+1)/2)
!>          The upper or lower triangle of the Hermitian matrix A, packed
!>          columnwise in a linear array\&.  The j-th column of A is stored
!>          in the array AP as follows:
!>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
!>          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n\&.
!> 
.fi
.PP
.br
\fIAFP\fP 
.PP
.nf
!>          AFP is COMPLEX*16 array, dimension (N*(N+1)/2)
!>          The factored form of the matrix A\&.  AFP contains the block
!>          diagonal matrix D and the multipliers used to obtain the
!>          factor U or L from the factorization A = U*D*U**H or
!>          A = L*D*L**H as computed by ZHPTRF, stored as a packed
!>          triangular matrix\&.
!> 
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
!>          IPIV is INTEGER array, dimension (N)
!>          Details of the interchanges and the block structure of D
!>          as determined by ZHPTRF\&.
!> 
.fi
.PP
.br
\fIB\fP 
.PP
.nf
!>          B is COMPLEX*16 array, dimension (LDB,NRHS)
!>          The right hand side matrix B\&.
!> 
.fi
.PP
.br
\fILDB\fP 
.PP
.nf
!>          LDB is INTEGER
!>          The leading dimension of the array B\&.  LDB >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIX\fP 
.PP
.nf
!>          X is COMPLEX*16 array, dimension (LDX,NRHS)
!>          On entry, the solution matrix X, as computed by ZHPTRS\&.
!>          On exit, the improved solution matrix X\&.
!> 
.fi
.PP
.br
\fILDX\fP 
.PP
.nf
!>          LDX is INTEGER
!>          The leading dimension of the array X\&.  LDX >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIFERR\fP 
.PP
.nf
!>          FERR is DOUBLE PRECISION array, dimension (NRHS)
!>          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\&.
!> 
.fi
.PP
.br
\fIBERR\fP 
.PP
.nf
!>          BERR is DOUBLE PRECISION array, dimension (NRHS)
!>          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)\&.
!> 
.fi
.PP
.br
\fIWORK\fP 
.PP
.nf
!>          WORK is COMPLEX*16 array, dimension (2*N)
!> 
.fi
.PP
.br
\fIRWORK\fP 
.PP
.nf
!>          RWORK is DOUBLE PRECISION array, dimension (N)
!> 
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
.fi
.PP
 
.RE
.PP
\fBInternal Parameters:\fP
.RS 4

.PP
.nf
!>  ITMAX is the maximum number of steps of iterative refinement\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB178\fP of file \fBzhprfs\&.f\fP\&.
.SS "subroutine zsprfs (character uplo, integer n, integer nrhs, complex*16, dimension( * ) ap, complex*16, dimension( * ) afp, integer, dimension( * ) ipiv, complex*16, dimension( ldb, * ) b, integer ldb, complex*16, dimension( ldx, * ) x, integer ldx, double precision, dimension( * ) ferr, double precision, dimension( * ) berr, complex*16, dimension( * ) work, double precision, dimension( * ) rwork, integer info)"

.PP
\fBZSPRFS\fP  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!> ZSPRFS improves the computed solution to a system of linear
!> equations when the coefficient matrix is symmetric indefinite
!> and packed, and provides error bounds and backward error estimates
!> for the solution\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
!>          UPLO is CHARACTER*1
!>          = 'U':  Upper triangle of A is stored;
!>          = 'L':  Lower triangle of A is stored\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>          The order of the matrix A\&.  N >= 0\&.
!> 
.fi
.PP
.br
\fINRHS\fP 
.PP
.nf
!>          NRHS is INTEGER
!>          The number of right hand sides, i\&.e\&., the number of columns
!>          of the matrices B and X\&.  NRHS >= 0\&.
!> 
.fi
.PP
.br
\fIAP\fP 
.PP
.nf
!>          AP is COMPLEX*16 array, dimension (N*(N+1)/2)
!>          The upper or lower triangle of the symmetric matrix A, packed
!>          columnwise in a linear array\&.  The j-th column of A is stored
!>          in the array AP as follows:
!>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
!>          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n\&.
!> 
.fi
.PP
.br
\fIAFP\fP 
.PP
.nf
!>          AFP is COMPLEX*16 array, dimension (N*(N+1)/2)
!>          The factored form of the matrix A\&.  AFP contains the block
!>          diagonal matrix D and the multipliers used to obtain the
!>          factor U or L from the factorization A = U*D*U**T or
!>          A = L*D*L**T as computed by ZSPTRF, stored as a packed
!>          triangular matrix\&.
!> 
.fi
.PP
.br
\fIIPIV\fP 
.PP
.nf
!>          IPIV is INTEGER array, dimension (N)
!>          Details of the interchanges and the block structure of D
!>          as determined by ZSPTRF\&.
!> 
.fi
.PP
.br
\fIB\fP 
.PP
.nf
!>          B is COMPLEX*16 array, dimension (LDB,NRHS)
!>          The right hand side matrix B\&.
!> 
.fi
.PP
.br
\fILDB\fP 
.PP
.nf
!>          LDB is INTEGER
!>          The leading dimension of the array B\&.  LDB >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIX\fP 
.PP
.nf
!>          X is COMPLEX*16 array, dimension (LDX,NRHS)
!>          On entry, the solution matrix X, as computed by ZSPTRS\&.
!>          On exit, the improved solution matrix X\&.
!> 
.fi
.PP
.br
\fILDX\fP 
.PP
.nf
!>          LDX is INTEGER
!>          The leading dimension of the array X\&.  LDX >= max(1,N)\&.
!> 
.fi
.PP
.br
\fIFERR\fP 
.PP
.nf
!>          FERR is DOUBLE PRECISION array, dimension (NRHS)
!>          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\&.
!> 
.fi
.PP
.br
\fIBERR\fP 
.PP
.nf
!>          BERR is DOUBLE PRECISION array, dimension (NRHS)
!>          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)\&.
!> 
.fi
.PP
.br
\fIWORK\fP 
.PP
.nf
!>          WORK is COMPLEX*16 array, dimension (2*N)
!> 
.fi
.PP
.br
\fIRWORK\fP 
.PP
.nf
!>          RWORK is DOUBLE PRECISION array, dimension (N)
!> 
.fi
.PP
.br
\fIINFO\fP 
.PP
.nf
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
.fi
.PP
 
.RE
.PP
\fBInternal Parameters:\fP
.RS 4

.PP
.nf
!>  ITMAX is the maximum number of steps of iterative refinement\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB178\fP of file \fBzsprfs\&.f\fP\&.
.SH "Author"
.PP 
Generated automatically by Doxygen for LAPACK from the source code\&.