DPBT05(3)
π DPBT05(3) π
okay so this page is DPBT05(3), and it comes from the Library Functions Manual. bestie, we are about to vibe-check iterative refinement error bounds for a symmetric band matrix, and every single parameter is coming with us. no cap. β¨
πΈ NAME πΈ
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/LIN/dpbt05.f
π SYNOPSIS π
Functions/Subroutines
subroutine DPBT05 (uplo, n, kd, nrhs, ab, ldab, b, ldb, x, ldx, xact,
ldxact, ferr, berr, reslts)
DPBT05
π§ Function/Subroutine Documentation π§
subroutine DPBT05 (character uplo, integer n, integer kd, integer nrhs,
double precision, dimension( ldab, * ) ab, integer ldab, 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)
this is the one and only DPBT05. iconic. π
π― Purpose
DPBT05 tests the error bounds from iterative refinement for the computed solution to a system of equations A*X = B, where A is a symmetric band matrix. yes, we love a structured queen. π«Ά
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(A)*abs(X) +abs(b))_i )
and NZ = max. number of nonzeros in any row of A, plus 1
bestie, if that ratio is not less than one, RESLTS(1) comes back large β that is literally the test. π
π Parameters
UPLOβCHARACTER*1. Specifies whether the upper or lower triangular part of the symmetric matrixAis stored.= 'U': Upper triangularand= 'L': Lower triangular. πNβINTEGER. The number of rows of the matricesX,B, andXACT, and the order of the matrixA.N >= 0. β¨KDβINTEGER. The number of super-diagonals of the matrixAifUPLO = 'U', or the number of sub-diagonals ifUPLO = 'L'.KD >= 0. π«NRHSβINTEGER. The number of columns of the matricesX,B, andXACT.NRHS >= 0. πΈABβDOUBLE PRECISION array, dimension (LDAB,N). The upper or lower triangle of the symmetric band matrixA, stored in the firstKD+1rows of the array. Thej-th column ofAis stored in thej-th column of the arrayABas follows:
if UPLO = 'U', AB(kd+1+i-j,j) = A(i,j) for max(1,j-kd)<=i<=j;
if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=min(n,j+kd).
LDABβINTEGER. The leading dimension of the arrayAB.LDAB >= KD+1. πBβDOUBLE PRECISION 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βDOUBLE PRECISION 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βDOUBLE PRECISION 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 169 of file dpbt05.f.
π¦ Author
Generated automatically by Doxygen for LAPACK from the source code.
okay that is the whole page, bestie π«Ά β LAPACK Version 3.12.0, footer date/path: /home/abui...IN/dpbt05.f(3). go forth and test those error bounds. mwah π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms