TESTING/LIN/sgtt05.f(3)
π SGTT05 β tridiagonal error-bound vibe check, bestie π
okay so this is the manual page for TESTING/LIN/sgtt05.f(3) from the Library Functions Manual, and itβs giving βI test iterative-refinement error bounds for a general tridiagonal matrixβ energy. iconic. letβs get into it β¨
πΈ NAME πΈ
TESTING/LIN/sgtt05.f β yes bestie, thatβs literally the file this whole page is about π«Ά
β¨ SYNOPSIS β¨
Functions/Subroutines
subroutine sgtt05 (trans, n, nrhs, dl, d, du, b, ldb, x, ldx, xact,
ldxact, ferr, berr, reslts)
SGTT05 is the subroutine name, and itβs the main character here π
π«Ά Function/Subroutine Documentation π«Ά
subroutine sgtt05 (character trans, integer n, integer nrhs, real,
dimension( * ) dl, real, dimension( * ) d, real, dimension( * ) du,
real, dimension( ldb, * ) b, integer ldb, real, dimension( ldx, * ) x,
integer ldx, real, dimension( ldxact, * ) xact, integer ldxact, real,
dimension( * ) ferr, real, dimension( * ) berr, real, dimension( * )
reslts)
SGTT05
π Purpose π
okay so SGTT05 tests the error bounds from iterative refinement for the computed solution to a system of equations A*X = B, where A is a general tridiagonal matrix of order n and op(A) = A or A**T, depending on TRANS.
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. no cap, thatβs the whole warning.
RESLTS(2) = residual from the iterative refinement routine
= the maximum of BERR / ( NZ*EPS + (*) ), where
(*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i )
and NZ = max. number of nonzeros in any row of A, plus 1
π Parameters π
π
TRANS
TRANSisCHARACTER*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
NisINTEGER.- The number of rows of the matrices
XandXACT.N >= 0.
π
NRHS
NRHSisINTEGER.- The number of columns of the matrices
XandXACT.NRHS >= 0.
π
DL
DLisREAL array, dimension (N-1).- The
(n-1)sub-diagonal elements ofA.
π
D
DisREAL array, dimension (N).- The diagonal elements of
A.
π
DU
DUisREAL array, dimension (N-1).- The
(n-1)super-diagonal elements ofA.
π
B
BisREAL array, dimension (LDB,NRHS).- The right hand side vectors for the system of linear equations.
π
LDB
LDBisINTEGER.- The leading dimension of the array
B.LDB >= max(1,N).
π
X
XisREAL array, dimension (LDX,NRHS).- The computed solution vectors. Each vector is stored as a column of the matrix
X.
π
LDX
LDXisINTEGER.- The leading dimension of the array
X.LDX >= max(1,N).
π
XACT
XACTisREAL array, dimension (LDX,NRHS).- The exact solution vectors. Each vector is stored as a column of the matrix
XACT.
π
LDXACT
LDXACTisINTEGER.- The leading dimension of the array
XACT.LDXACT >= max(1,N).
π
FERR
FERRisREAL array, dimension (NRHS).- The estimated forward error bounds for each solution vector
X. IfXTRUEis the true solution,FERRbounds the magnitude of the largest entry in(X - XTRUE)divided by the magnitude of the largest entry inX.
π
BERR
BERRisREAL array, dimension (NRHS).- The componentwise relative backward error of each solution vector (i.e., the smallest relative change in any entry of
AorBthat makesXan exact solution).
π
RESLTS
RESLTSisREAL array, dimension (2).- The maximum over the
NRHSsolution vectors of the ratios: RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR )RESLTS(2) = BERR / ( NZ*EPS + (*) )
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Definition at line 163 of file sgtt05.f.
π¦ Author π¦
Generated automatically by Doxygen for LAPACK from the source code.
mwah π β this cutie is from LAPACK Version 3.12.0, for the page TESTING/LIN/sgtt05.f(3). slay and goodbye πβ¨
π¦ 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