cgerfs - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
SUBROUTINE CGERFS( TRANSA, N, NRHS, A, LDA, AF, LDAF, IPIVOT, B, * LDB, X, LDX, FERR, BERR, WORK, WORK2, INFO) CHARACTER * 1 TRANSA COMPLEX A(LDA,*), AF(LDAF,*), B(LDB,*), X(LDX,*), WORK(*) INTEGER N, NRHS, LDA, LDAF, LDB, LDX, INFO INTEGER IPIVOT(*) REAL FERR(*), BERR(*), WORK2(*)
SUBROUTINE CGERFS_64( TRANSA, N, NRHS, A, LDA, AF, LDAF, IPIVOT, B, * LDB, X, LDX, FERR, BERR, WORK, WORK2, INFO) CHARACTER * 1 TRANSA COMPLEX A(LDA,*), AF(LDAF,*), B(LDB,*), X(LDX,*), WORK(*) INTEGER*8 N, NRHS, LDA, LDAF, LDB, LDX, INFO INTEGER*8 IPIVOT(*) REAL FERR(*), BERR(*), WORK2(*)
SUBROUTINE GERFS( [TRANSA], [N], [NRHS], A, [LDA], AF, [LDAF], * IPIVOT, B, [LDB], X, [LDX], FERR, BERR, [WORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: TRANSA COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: A, AF, B, X INTEGER :: N, NRHS, LDA, LDAF, LDB, LDX, INFO INTEGER, DIMENSION(:) :: IPIVOT REAL, DIMENSION(:) :: FERR, BERR, WORK2
SUBROUTINE GERFS_64( [TRANSA], [N], [NRHS], A, [LDA], AF, [LDAF], * IPIVOT, B, [LDB], X, [LDX], FERR, BERR, [WORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: TRANSA COMPLEX, DIMENSION(:) :: WORK COMPLEX, DIMENSION(:,:) :: A, AF, B, X INTEGER(8) :: N, NRHS, LDA, LDAF, LDB, LDX, INFO INTEGER(8), DIMENSION(:) :: IPIVOT REAL, DIMENSION(:) :: FERR, BERR, WORK2
#include <sunperf.h>
void cgerfs(char transa, int n, int nrhs, complex *a, int lda, complex *af, int ldaf, int *ipivot, complex *b, int ldb, complex *x, int ldx, float *ferr, float *berr, int *info);
void cgerfs_64(char transa, long n, long nrhs, complex *a, long lda, complex *af, long ldaf, long *ipivot, complex *b, long ldb, complex *x, long ldx, float *ferr, float *berr, long *info);
cgerfs improves the computed solution to a system of linear equations 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)
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(2*N)
dimension(N)
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value