SRC/dgerfs.f(3)
πΈ SRC/dgerfs.f(3) πΈ
okay so bestie, welcome to the SRC/dgerfs.f(3) page from the Library Functions Manual π itβs giving extremely specific linear-algebra energy, and honestly? we respect it.
π NAME π
SRC/dgerfs.f
β¨ SYNOPSIS β¨
π§ Functions/Subroutines π§
subroutine dgerfs (trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x,
ldx, ferr, berr, work, iwork, info)
DGERFS
π Function/Subroutine Documentation π
π« subroutine dgerfs π«
subroutine dgerfs (character trans, integer n, integer nrhs, double
precision, dimension( lda, * ) a, integer lda, double precision,
dimension( ldaf, * ) af, integer ldaf, integer, dimension( * ) ipiv,
double precision, dimension( ldb, * ) b, integer ldb, double precision,
dimension( ldx, * ) x, integer ldx, double precision, dimension( * )
ferr, double precision, dimension( * ) berr, double precision,
dimension( * ) work, integer, dimension( * ) iwork, integer info)
DGERFS
πΈ Purpose πΈ
DGERFS improves the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution. thatβs the whole purpose, and it ate. π
π Parameters π
TRANSβ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 = Transpose)
NβINTEGER. The order of the matrixA.N >= 0.NRHSβINTEGER. The number of right hand sides, i.e., the number of columns of the matricesBandX.NRHS >= 0.AβDOUBLE PRECISIONarray, dimension(LDA,N). The originalN-by-NmatrixA.LDAβINTEGER. The leading dimension of the arrayA.LDA >= max(1,N).AFβDOUBLE PRECISIONarray, dimension(LDAF,N). The factorsLandUfrom the factorizationA = P*L*Uas computed byDGETRF.LDAFβINTEGER. The leading dimension of the arrayAF.LDAF >= max(1,N).IPIVβINTEGERarray, dimension(N). The pivot indices fromDGETRF; for1<=i<=N, rowiof the matrix was interchanged with rowIPIV(i).BβDOUBLE PRECISIONarray, dimension(LDB,NRHS). The right hand side matrixB.LDBβINTEGER. The leading dimension of the arrayB.LDB >= max(1,N).XβDOUBLE PRECISIONarray, dimension(LDX,NRHS). On entry, the solution matrixX, as computed byDGETRS. On exit, the improved solution matrixX.LDXβINTEGER. The leading dimension of the arrayX.LDX >= max(1,N).FERRβDOUBLE PRECISIONarray, dimension(NRHS). The estimated forward error bound for each solution vectorX(j)(thej-th column of the solution matrixX). IfXTRUEis the true solution corresponding toX(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 inX(j). The estimate is as reliable as the estimate forRCOND, and is almost always a slight overestimate of the true error.BERRβDOUBLE PRECISIONarray, dimension(NRHS). The componentwise relative backward error of each solution vectorX(j)(i.e., the smallest relative change in any element ofAorBthat makesX(j)an exact solution).WORKβDOUBLE PRECISIONarray, dimension(3*N).IWORKβINTEGERarray, dimension(N).INFOβINTEGER:= 0: successful exit< 0: ifINFO = -i, thei-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.
Definition at line 183 of file dgerfs.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
π thatβs the whole page, bestie β LAPACK Version 3.12.0, sourced from SRC/dgerfs.f(3). periodt. π
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms