SRC/zgerfs.f(3)
π NAME π
SRC/zgerfs.f β yes bestie, that's the page title, and this is from the Library Functions Manual. It's giving LAPACK Fortran subroutine realness, and we're gonna get through every single detail together. π«Ά
β¨ SYNOPSIS β¨
π§ Functions/Subroutines π§
subroutine zgerfs (trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x,
ldx, ferr, berr, work, rwork, info)
ZGERFS β that's the subroutine's name, and yes it's iconic. π
π¦ Function/Subroutine Documentation π¦
subroutine zgerfs (character trans, integer n, integer nrhs, complex*16,
dimension( lda, * ) a, integer lda, complex*16, dimension( ldaf, * ) af,
integer ldaf, integer, dimension( * ) ipiv, complex*16, dimension( ldb,
* ) b, integer ldb, complex*16, dimension( ldx, * ) x, integer ldx,
double precision, dimension( * ) ferr, double precision, dimension( * )
berr, complex*16, dimension( * ) work, double precision, dimension( * )
rwork, integer info)
ZGERFS β okay so this is the full signature, and it ate. π
π Purpose π
Okay so ZGERFS improves the computed solution to a system of linear equations and gives you error bounds and backward error estimates for that solution. It's literally the glow-up pass for your solution, bestie. β¨
πΈ 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)
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βCOMPLEX*16array, dimension(LDA,N). The originalN-by-NmatrixA.LDAβINTEGER. The leading dimension of the arrayA.LDA >= max(1,N).AFβCOMPLEX*16array, dimension(LDAF,N). The factorsLandUfrom the factorizationA = P*L*Uas computed byZGETRF.LDAFβINTEGER. The leading dimension of the arrayAF.LDAF >= max(1,N).IPIVβINTEGERarray, dimension(N). The pivot indices fromZGETRF; for1<=i<=N, rowiof the matrix was interchanged with rowIPIV(i).BβCOMPLEX*16array, dimension(LDB,NRHS). The right hand side matrixB.LDBβINTEGER. The leading dimension of the arrayB.LDB >= max(1,N).XβCOMPLEX*16array, dimension(LDX,NRHS). On entry, the solution matrixX, as computed byZGETRS. 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. Not me loving a reliable little error bound. π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βCOMPLEX*16array, dimension(2*N).RWORKβDOUBLE PRECISIONarray, dimension(N).INFOβINTEGER:= 0: successful exit< 0: if INFO = -i, the i-th argument had an illegal value
π₯ Internal Parameters π₯
ITMAXβ the maximum number of steps of iterative refinement. That's it, no cap. π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Definition at line 184 of file zgerfs.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
Okay bye bestie! π The footer energy is LAPACK Version 3.12.0, source SRC/zgerfs.f(3), and the date slot isn't printed on this page β that's the whole sign-off, 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