TESTING/LIN/dppt05.f(3)
π TESTING/LIN/dppt05.f π
okay so bestie, welcome to the TESTING/LIN/dppt05.f page from the Library Functions Manual. This is the LAPACK testing corner, and we're about to vibe-check one very specific subroutine. No cap.
πΈ NAME πΈ
TESTING/LIN/dppt05.f β that's the name, that's the whole name, and yes it's giving "file path as a name" energy. π
β¨ SYNOPSIS β¨
π§ Functions/Subroutines π§
subroutine dppt05 (uplo, n, nrhs, ap, b, ldb, x, ldx, xact, ldxact,
ferr, berr, reslts)
DPPT05 β the icon itself.
π¦ Function/Subroutine Documentation π¦
subroutine dppt05 (character uplo, integer n, integer nrhs, double precision, dimension( * ) ap, double precision, dimension( ldb, * ) b, integer ldb, double precision, dimension( ldx, * ) x, integer ldx, double precision, dimension( ldxact, * ) xact, integer ldxact, double precision, dimension( * ) ferr, double precision, dimension( * ) berr, double precision, dimension( * ) reslts)
DPPT05
π Purpose π
DPPT05 is literally testing the error bounds from iterative refinement for the computed solution to a system of equations A*X = B, where A is a symmetric matrix in packed storage format. Obsessed with the specificity.
The result formulas are exactly this, and we do not mess with them:
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 / ( (n+1)*EPS + (*) ), where
(*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i )
π Parameters π
UPLO
UPLOisCHARACTER*1β says whether the upper or lower triangular part of the symmetric matrixAis stored.'U': upper triangular.'L': lower triangular.
N
NisINTEGERβ the number of rows of the matricesX,B, andXACT, and the order of the matrixA.N >= 0.
NRHS
NRHSisINTEGERβ the number of columns of the matricesX,B, andXACT.NRHS >= 0.
AP
APisDOUBLE PRECISION array, dimension (N*(N+1)/2)β the upper or lower triangle of the symmetric matrixA, packed columnwise in a linear array. The j-th column ofAis stored in the arrayAPas follows:
if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n.
B
BisDOUBLE PRECISION array, dimension (LDB,NRHS)β the right hand side vectors for the system of linear equations. Very "solve me" of it.
LDB
LDBisINTEGERβ the leading dimension of the arrayB.LDB >= max(1,N).
X
XisDOUBLE PRECISION array, dimension (LDX,NRHS)β the computed solution vectors. Each vector is stored as a column of the matrixX.
LDX
LDXisINTEGERβ the leading dimension of the arrayX.LDX >= max(1,N).
XACT
XACTisDOUBLE PRECISION array, dimension (LDX,NRHS)β the exact solution vectors. Each vector is stored as a column of the matrixXACT.
LDXACT
LDXACTisINTEGERβ the leading dimension of the arrayXACT.LDXACT >= max(1,N).
FERR
FERRisDOUBLE 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
BERRisDOUBLE 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
RESLTSisDOUBLE PRECISION 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 line154of filedppt05.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
mwah π that's the whole page, bestie: LAPACK Version 3.12.0, page tag TESTING/LIN/dppt05.f(3). The original footer doesn't hand me a separate date line, so I'm not inventing one β keeping it 100. π«Ά
π¦ 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