sgtrfs - improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
SUBROUTINE SGTRFS( TRANSA, N, NRHS, LOW, DIAG, UP, LOWF, DIAGF, * UPF1, UPF2, IPIVOT, B, LDB, X, LDX, FERR, BERR, WORK, WORK2, * INFO) CHARACTER * 1 TRANSA INTEGER N, NRHS, LDB, LDX, INFO INTEGER IPIVOT(*), WORK2(*) REAL LOW(*), DIAG(*), UP(*), LOWF(*), DIAGF(*), UPF1(*), UPF2(*), B(LDB,*), X(LDX,*), FERR(*), BERR(*), WORK(*)
SUBROUTINE SGTRFS_64( TRANSA, N, NRHS, LOW, DIAG, UP, LOWF, DIAGF, * UPF1, UPF2, IPIVOT, B, LDB, X, LDX, FERR, BERR, WORK, WORK2, * INFO) CHARACTER * 1 TRANSA INTEGER*8 N, NRHS, LDB, LDX, INFO INTEGER*8 IPIVOT(*), WORK2(*) REAL LOW(*), DIAG(*), UP(*), LOWF(*), DIAGF(*), UPF1(*), UPF2(*), B(LDB,*), X(LDX,*), FERR(*), BERR(*), WORK(*)
SUBROUTINE GTRFS( [TRANSA], [N], [NRHS], LOW, DIAG, UP, LOWF, DIAGF, * UPF1, UPF2, IPIVOT, B, [LDB], X, [LDX], FERR, BERR, [WORK], * [WORK2], [INFO]) CHARACTER(LEN=1) :: TRANSA INTEGER :: N, NRHS, LDB, LDX, INFO INTEGER, DIMENSION(:) :: IPIVOT, WORK2 REAL, DIMENSION(:) :: LOW, DIAG, UP, LOWF, DIAGF, UPF1, UPF2, FERR, BERR, WORK REAL, DIMENSION(:,:) :: B, X
SUBROUTINE GTRFS_64( [TRANSA], [N], [NRHS], LOW, DIAG, UP, LOWF, * DIAGF, UPF1, UPF2, IPIVOT, B, [LDB], X, [LDX], FERR, BERR, [WORK], * [WORK2], [INFO]) CHARACTER(LEN=1) :: TRANSA INTEGER(8) :: N, NRHS, LDB, LDX, INFO INTEGER(8), DIMENSION(:) :: IPIVOT, WORK2 REAL, DIMENSION(:) :: LOW, DIAG, UP, LOWF, DIAGF, UPF1, UPF2, FERR, BERR, WORK REAL, DIMENSION(:,:) :: B, X
#include <sunperf.h>
void sgtrfs(char transa, int n, int nrhs, float *low, float *diag, float *up, float *lowf, float *diagf, float *upf1, float *upf2, int *ipivot, float *b, int ldb, float *x, int ldx, float *ferr, float *berr, int *info);
void sgtrfs_64(char transa, long n, long nrhs, float *low, float *diag, float *up, float *lowf, float *diagf, float *upf1, float *upf2, long *ipivot, float *b, long ldb, float *x, long ldx, float *ferr, float *berr, long *info);
sgtrfs improves the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution.
= 'N': A * X = B (No transpose)
= 'T': A**T * X = B (Transpose)
= 'C': A**H * X = B (Conjugate transpose = Transpose)
IPIVOT(i)
will always be either
i or i+1; IPIVOT(i)
= i indicates a row interchange was not
required.
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.
X(j)
(i.e., the smallest relative change in
any element of A or B that makes X(j)
an exact solution).
dimension(3*N)
dimension(N)
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value