ctprfs (l)  Linux Man Pages
ctprfs: provides error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
Command to display ctprfs
manual in Linux: $ man l ctprfs
NAME
CTPRFS  provides error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
SYNOPSIS
 SUBROUTINE CTPRFS(

UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX,
FERR, BERR, WORK, RWORK, INFO )

CHARACTER
DIAG, TRANS, UPLO

INTEGER
INFO, LDB, LDX, N, NRHS

REAL
BERR( * ), FERR( * ), RWORK( * )

COMPLEX
AP( * ), B( LDB, * ), WORK( * ), X( LDX, * )
PURPOSE
CTPRFS provides error bounds and backward error estimates for the
solution to a system of linear equations with a triangular packed
coefficient matrix.
The solution matrix X must be computed by CTPTRS or some other
means before entering this routine. CTPRFS does not do iterative
refinement because doing so cannot improve the backward error.
ARGUMENTS
 UPLO (input) CHARACTER*1

= aqUaq: A is upper triangular;
= aqLaq: A is lower triangular.
 TRANS (input) CHARACTER*1

Specifies the form of the system of equations:
= aqNaq: A * X = B (No transpose)
= aqTaq: A**T * X = B (Transpose)
= aqCaq: A**H * X = B (Conjugate transpose)
 DIAG (input) CHARACTER*1

= aqNaq: A is nonunit triangular;
= aqUaq: A is unit triangular.
 N (input) INTEGER

The order of the matrix A. N >= 0.
 NRHS (input) INTEGER

The number of right hand sides, i.e., the number of columns
of the matrices B and X. NRHS >= 0.
 AP (input) COMPLEX array, dimension (N*(N+1)/2)

The upper or lower triangular matrix A, packed columnwise in
a linear array. The jth column of A is stored in the array
AP as follows:
if UPLO = aqUaq, AP(i + (j1)*j/2) = A(i,j) for 1<=i<=j;
if UPLO = aqLaq, AP(i + (j1)*(2nj)/2) = A(i,j) for j<=i<=n.
If DIAG = aqUaq, the diagonal elements of A are not referenced
and are assumed to be 1.
 B (input) COMPLEX array, dimension (LDB,NRHS)

The right hand side matrix B.
 LDB (input) INTEGER

The leading dimension of the array B. LDB >= max(1,N).
 X (input) COMPLEX array, dimension (LDX,NRHS)

The solution matrix X.
 LDX (input) INTEGER

The leading dimension of the array X. LDX >= max(1,N).
 FERR (output) REAL array, dimension (NRHS)

The estimated forward error bound for each solution vector
X(j) (the jth 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.
 BERR (output) 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).
 WORK (workspace) COMPLEX array, dimension (2*N)

 RWORK (workspace) REAL array, dimension (N)

 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
Pages related to ctprfs
 ctprfs (3)
 ctpcon (l)  estimates the reciprocal of the condition number of a packed triangular matrix A, in either the 1norm or the infinitynorm
 ctpmv (l)  performs one of the matrixvector operations x := A*x, or x := Aaq*x, or x := conjg( Aaq )*x,
 ctpsv (l)  solves one of the systems of equations A*x = b, or Aaq*x = b, or conjg( Aaq )*x = b,
 ctptri (l)  computes the inverse of a complex upper or lower triangular matrix A stored in packed format
 ctptrs (l)  solves a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B,
 ctpttf (l)  copies a triangular matrix A from standard packed format (TP) to rectangular full packed format (TF)
 ctpttr (l)  copies a triangular matrix A from standard packed format (TP) to standard full format (TR)