Linux & Unix Commands - Search Man Pages

cgerfs.f(3) LAPACK cgerfs.f(3)NAMEcgerfs.f-SYNOPSISFunctions/Subroutines subroutine cgerfs (TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO) CGERFSFunction/Subroutine Documentation subroutine cgerfs (characterTRANS, integerN, integerNRHS, complex, dimension( lda, * )A, integerLDA, complex, dimension( ldaf, * )AF, integerLDAF, integer, dimension( * )IPIV, complex, dimension( ldb, * )B, integerLDB, complex, dimension( ldx, * )X, integerLDX, real, dimension( * )FERR, real, dimension( * )BERR, complex, dimension( * )WORK, real, dimension( * )RWORK, integerINFO) CGERFS Purpose: CGERFS improves the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution. Parameters: TRANS TRANS is CHARACTER*1 Specifies the form of the system of equations: = 'N': A * X = B (No transpose) = 'T': A**T * X = B (Transpose) = 'C': A**H * X = B (Conjugate transpose) N N is INTEGER The order of the matrix A. N >= 0. NRHS NRHS is INTEGER The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0. A A is COMPLEX array, dimension (LDA,N) The original N-by-N matrix A. LDA LDA is INTEGER The leading dimension of the array A. LDA >= max(1,N). AF AF is COMPLEX array, dimension (LDAF,N) The factors L and U from the factorization A = P*L*U as computed by CGETRF. LDAF LDAF is INTEGER The leading dimension of the array AF. LDAF >= max(1,N). IPIV IPIV is INTEGER array, dimension (N) The pivot indices from CGETRF; for 1<=i<=N, row i of the matrix was interchanged with row IPIV(i). B B is COMPLEX array, dimension (LDB,NRHS) The right hand side matrix B. LDB LDB is INTEGER The leading dimension of the array B. LDB >= max(1,N). X X is COMPLEX array, dimension (LDX,NRHS) On entry, the solution matrix X, as computed by CGETRS. On exit, the improved solution matrix X. LDX LDX is INTEGER The leading dimension of the array X. LDX >= max(1,N). FERR 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. BERR 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). WORK WORK is COMPLEX array, dimension (2*N) RWORK RWORK is REAL array, dimension (N) INFO INFO is INTEGER = 0: successful exit < 0: if INFO =, the i-th argument had an illegal value Internal Parameters: ITMAX is the maximum number of steps of iterative refinement. Author: Univ. of Tennessee Univ. of California Berkeley Univ. of Colorado Denver NAG Ltd. Date: November 2011 Definition at line 186 of file cgerfs.f.-iAuthorGenerated automatically by Doxygen for LAPACK from the source code.Version 3.4.2Tue Sep 25 2012 cgerfs.f(3)

All times are GMT -4. The time now is 01:08 PM.