Scroll to navigation

CPTRFS(1) LAPACK routine (version 3.2) CPTRFS(1)

NAME

CPTRFS - improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution

SYNOPSIS

UPLO, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )

CHARACTER UPLO INTEGER INFO, LDB, LDX, N, NRHS REAL BERR( * ), D( * ), DF( * ), FERR( * ), RWORK( * ) COMPLEX B( LDB, * ), E( * ), EF( * ), WORK( * ), X( LDX, * )

PURPOSE

CPTRFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution.

ARGUMENTS

Specifies whether the superdiagonal or the subdiagonal of the tridiagonal matrix A is stored and the form of the factorization:
= 'U': E is the superdiagonal of A, and A = U**H*D*U;
= 'L': E is the subdiagonal of A, and A = L*D*L**H. (The two forms are equivalent if A is real.)
The order of the matrix A. N >= 0.
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
The n real diagonal elements of the tridiagonal matrix A.
The (n-1) off-diagonal elements of the tridiagonal matrix A (see UPLO).
The n diagonal elements of the diagonal matrix D from the factorization computed by CPTTRF.
The (n-1) off-diagonal elements of the unit bidiagonal factor U or L from the factorization computed by CPTTRF (see UPLO).
The right hand side matrix B.
The leading dimension of the array B. LDB >= max(1,N).
On entry, the solution matrix X, as computed by CPTTRS. On exit, the improved solution matrix X.
The leading dimension of the array X. LDX >= max(1,N).
The 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 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).
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value

PARAMETERS

ITMAX is the maximum number of steps of iterative refinement.

November 2008 LAPACK routine (version 3.2)