TESTING/LIN/zgbt05.f(3)
π¦ TESTING/LIN/zgbt05.f π¦
okay so this is the Library Functions Manual entry for TESTING/LIN/zgbt05.f, and it's giving very specific LAPACK test-routine energy π
β¨
π NAME π
TESTING/LIN/zgbt05.f β that's the file name, periodt π
β¨ SYNOPSIS β¨
πΈ Functions/Subroutines πΈ
subroutine zgbt05 (trans, n, kl, ku, nrhs, ab, ldab, b, ldb, x, ldx,
xact, ldxact, ferr, berr, reslts)
ZGBT05
π Function/Subroutine Documentation π
subroutine zgbt05 (character trans, integer n, integer kl, integer ku,
integer nrhs, complex*16, dimension( ldab, * ) ab, integer ldab,
complex*16, dimension( ldb, * ) b, integer ldb, complex*16, dimension(
ldx, * ) x, integer ldx, complex*16, dimension( ldxact, * ) xact,
integer ldxact, double precision, dimension( * ) ferr, double precision,
dimension( * ) berr, double precision, dimension( * ) reslts)
ZGBT05
π Purpose π
okay bestie, ZGBT05 tests the error bounds from iterative refinement for the computed solution to a system of equations op(A)*X = B, where A is a general band matrix of order n with kl subdiagonals and ku superdiagonals and op(A) = A, A**T, or A**H, 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.
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β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 = Transpose)
NβINTEGER. The number of rows of the matricesX,B, andXACT, and the order of the matrixA.N >= 0.KLβINTEGER. The number of subdiagonals within the band ofA.KL >= 0.KUβINTEGER. The number of superdiagonals within the band ofA.KU >= 0.NRHSβINTEGER. The number of columns of the matricesX,B, andXACT.NRHS >= 0.ABβCOMPLEX*16 array, dimension (LDAB,N). The original band matrixA, stored in rows1toKL+KU+1. Thej-th column ofAis stored in thej-th column of the arrayABas follows:
AB(ku+1+i-j,j) = A(i,j) for max(1,j-ku)<=i<=min(n,j+kl)
LDABβINTEGER. The leading dimension of the arrayAB.LDAB >= KL+KU+1.BβCOMPLEX*16 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*16 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*16 array, dimension (LDX,NRHS). The exact solution vectors. Each vector is stored as a column of the matrixXACT.LDXACTβINTEGER. The leading dimension of the arrayXACT.LDXACT >= max(1,N).FERRβDOUBLE PRECISION 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βDOUBLE PRECISION 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βDOUBLE PRECISION array, dimension (2). The maximum over theNRHSsolution 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 174 of file zgbt05.f.
π§ Author π§
Generated automatically by Doxygen for LAPACK from the source code.
later, bestie π β this page came from LAPACK Version 3.12.0 and TESTING/LIN/zgbt05.f(3). The footer didn't hand us a date, so we're not inventing one πβ¨
π¦ 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