TESTING/LIN/ctrt05.f(3)

πŸ“¦
version 3.12.1 Β· 3 versions
, in arch rolling

✨ TESTING/LIN/ctrt05.f(3) ✨

okay so bestie, this is the TESTING/LIN/ctrt05.f page from the Library Functions Manual, and it’s literally all about a subroutine called ctrt05. stay with me, it’s giving numerical linear algebra but make it cute. πŸ’–


πŸŽ€ NAME πŸŽ€

TESTING/LIN/ctrt05.f β€” the manual page for this routine, no cap.


🌸 SYNOPSIS 🌸

πŸ¦‹ Functions/Subroutines πŸ¦‹

       subroutine ctrt05 (uplo, trans, diag, n, nrhs, a, lda, b, ldb, x, ldx,
           xact, ldxact, ferr, berr, reslts)

CTRT05 is the main character here. πŸ’…


✨ Function/Subroutine Documentation ✨

   subroutine ctrt05 (character uplo, character trans, character diag, integer
       n, integer nrhs, complex, dimension( lda, * ) a, integer lda, complex,
       dimension( ldb, * ) b, integer ldb, complex, dimension( ldx, * ) x,
       integer ldx, complex, dimension( ldxact, * ) xact, integer ldxact, real,
       dimension( * ) ferr, real, dimension( * ) berr, real, dimension( * )
       reslts)

also known as CTRT05, because apparently one name wasn’t enough. iconic. πŸ‘‘

πŸ’« Purpose πŸ’«

okay so the whole vibe: CTRT05 tests the error bounds from iterative refinement for the computed solution to a system of equations A*X = B, where A is a triangular n by n matrix. 🧚

the receipts are:

RESLTS(1) = test of the error bound
          = norm(X - XACT) / ( norm(X) * FERR )

a large value is returned if this ratio is not less than one. so yeah, if it’s big, that’s the universe telling you something. 😭

and:

RESLTS(2) = residual from the iterative refinement routine
          = the maximum of BERR / ( (n+1)*EPS + (*) ), where
            (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i )

that +abs(b) spacing is exactly what the page says, bestie β€” we don’t β€œfix” the icon’s formatting. 🫢

🌸 Parameters 🌸

  • UPLO β€” CHARACTER*1. Specifies whether the matrix A is upper or lower triangular. = 'U': Upper triangular; = 'L': Lower triangular. πŸ’…
  • TRANS β€” CHARACTER*1. Specifies the form of the system of equations. = 'N': A * X = B (No transpose); = 'T': A'* X = B (Transpose); = 'C': A'* X = B (Conjugate transpose = Transpose). ✨
  • DIAG β€” CHARACTER*1. Specifies whether or not the matrix A is unit triangular. = 'N': Non-unit triangular; = 'U': Unit triangular. πŸŽ€
  • N β€” INTEGER. The number of rows of the matrices X, B, and XACT, and the order of the matrix A. N >= 0. πŸ¦‹
  • NRHS β€” INTEGER. The number of columns of the matrices X, B, and XACT. NRHS >= 0. 🌸
  • A β€” COMPLEX array, dimension (LDA,N). The triangular matrix A. If UPLO = 'U', the leading n by n upper triangular part of the array A contains the upper triangular matrix, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading n by n lower triangular part of the array A contains the lower triangular matrix, and the strictly upper triangular part of A is not referenced. If DIAG = 'U', the diagonal elements of A are also not referenced and are assumed to be 1. πŸ’–
  • LDA β€” INTEGER. The leading dimension of the array A. LDA >= max(1,N). πŸ”₯
  • B β€” COMPLEX array, dimension (LDB,NRHS). The right hand side vectors for the system of linear equations. 🌈
  • LDB β€” INTEGER. The leading dimension of the array B. LDB >= max(1,N). ⭐
  • X β€” COMPLEX array, dimension (LDX,NRHS). The computed solution vectors. Each vector is stored as a column of the matrix X. πŸ’œ
  • LDX β€” INTEGER. The leading dimension of the array X. LDX >= max(1,N). 🫢
  • XACT β€” COMPLEX array, dimension (LDX,NRHS). The exact solution vectors. Each vector is stored as a column of the matrix XACT. (yes, it says LDX here β€” we’re keeping it exactly as the page says. πŸ‘€)
  • LDXACT β€” INTEGER. The leading dimension of the array XACT. LDXACT >= max(1,N). 🧚
  • FERR β€” REAL array, dimension (NRHS). The estimated forward error bounds for each solution vector X. If XTRUE is the true solution, FERR bounds the magnitude of the largest entry in (X - XTRUE) divided by the magnitude of the largest entry in X. 🌸
  • BERR β€” REAL array, dimension (NRHS). The componentwise relative backward error of each solution vector (i.e., the smallest relative change in any entry of A or B that makes X an exact solution). πŸ’–
  • RESLTS β€” REAL array, dimension (2). The maximum over the NRHS solution vectors of the ratios:
RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR )
RESLTS(2) = BERR / ( (n+1)*EPS + (*) )

πŸ‘‘ Author πŸ‘‘

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition at line 180 of file ctrt05.f. πŸ“Œ


🌈 Author 🌈

Generated automatically by Doxygen for LAPACK from the source code. the bot did its thing. πŸ€–βœ¨


okay bye bestie πŸ’– this cutie came from TESTING/LIN/ctrt05.f(3) and the footer is giving LAPACK Version 3.12.0 β€” slay, periodt. πŸŽ€

πŸ“¦ where this page comes from