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 matrix A. N >= 0.
  • NRHS β€” INTEGER. The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
  • A β€” COMPLEX*16 array, dimension (LDA,N). The original N-by-N matrix A.
  • LDA β€” INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • AF β€” COMPLEX*16 array, dimension (LDAF,N). The factors L and U from the factorization A = P*L*U as computed by ZGETRF.
  • LDAF β€” INTEGER. The leading dimension of the array AF. LDAF >= max(1,N).
  • IPIV β€” INTEGER array, dimension (N). The pivot indices from ZGETRF; for 1<=i<=N, row i of the matrix was interchanged with row IPIV(i).
  • B β€” COMPLEX*16 array, dimension (LDB,NRHS). The right hand side matrix B.
  • LDB β€” INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • X β€” COMPLEX*16 array, dimension (LDX,NRHS). On entry, the solution matrix X, as computed by ZGETRS. On exit, the improved solution matrix X.
  • LDX β€” INTEGER. The leading dimension of the array X. LDX >= max(1,N).
  • FERR β€” DOUBLE PRECISION 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. Not me loving a reliable little error bound. 😭
  • BERR β€” DOUBLE PRECISION 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 β€” COMPLEX*16 array, dimension (2*N).
  • RWORK β€” DOUBLE PRECISION array, 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