TESTING/LIN/ctrt05.f(3)
β¨ 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 matrixAis 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 matrixAis unit triangular.= 'N':Non-unit triangular;= 'U':Unit triangular. πNβINTEGER. The number of rows of the matricesX,B, andXACT, and the order of the matrixA.N >= 0. π¦NRHSβINTEGER. The number of columns of the matricesX,B, andXACT.NRHS >= 0. πΈAβCOMPLEX array, dimension (LDA,N). The triangular matrixA. IfUPLO = 'U', the leadingnbynupper triangular part of the arrayAcontains the upper triangular matrix, and the strictly lower triangular part ofAis not referenced. IfUPLO = 'L', the leadingnbynlower triangular part of the arrayAcontains the lower triangular matrix, and the strictly upper triangular part ofAis not referenced. IfDIAG = 'U', the diagonal elements ofAare also not referenced and are assumed to be1. πLDAβINTEGER. The leading dimension of the arrayA.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 arrayB.LDB >= max(1,N). βXβCOMPLEX array, dimension (LDX,NRHS). The computed solution vectors. Each vector is stored as a column of the matrixX. πLDXβINTEGER. The leading dimension of the arrayX.LDX >= max(1,N). π«ΆXACTβCOMPLEX array, dimension (LDX,NRHS). The exact solution vectors. Each vector is stored as a column of the matrixXACT. (yes, it saysLDXhere β weβre keeping it exactly as the page says. π)LDXACTβINTEGER. The leading dimension of the arrayXACT.LDXACT >= max(1,N). π§FERRβREAL array, dimension (NRHS). The estimated forward error bounds for each solution vectorX. IfXTRUEis the true solution,FERRbounds the magnitude of the largest entry in(X - XTRUE)divided by the magnitude of the largest entry inX. πΈBERRβREAL array, dimension (NRHS). The componentwise relative backward error of each solution vector (i.e., the smallest relative change in any entry ofAorBthat makesXan exact solution). πRESLTSβREAL array, dimension (2). The maximum over theNRHSsolution 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
- 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