TESTING/LIN/zpbt05.f(3)
okay bestie, this is the TESTING/LIN/zpbt05.f page from the Library Functions Manual π
β¨
β¨ NAME β¨
TESTING/LIN/zpbt05.f
This is the LAPACK testing subroutine page for zpbt05 π
π¦ SYNOPSIS π¦
πΈ Functions/Subroutines πΈ
Functions/Subroutines
subroutine zpbt05 (uplo, n, kd, nrhs, ab, ldab, b, ldb, x, ldx, xact,
ldxact, ferr, berr, reslts)
ZPBT05
π Function/Subroutine Documentation π
subroutine zpbt05 (character uplo, integer n, integer kd, 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)
ZPBT05
π Purpose π
okay so ZPBT05 is the vibe check for the error bounds from iterative refinement for the computed solution to a system of equations A*X = B, where A is a Hermitian band matrix π«Ά
The result ratios are literally these:
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
π Parameters π
π UPLO π
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the Hermitian matrix A is stored.
= 'U': Upper triangular= 'L': Lower triangular
π¦ N π¦
N is INTEGER
The number of rows of the matrices X, B, and XACT, and the order of the matrix A. N >= 0.
π KD π
KD is INTEGER
The number of super-diagonals of the matrix A if UPLO = 'U', or the number of sub-diagonals if UPLO = 'L'. KD >= 0.
πΈ NRHS πΈ
NRHS is INTEGER
The number of columns of the matrices X, B, and XACT. NRHS >= 0.
π AB π
AB is COMPLEX*16 array, dimension (LDAB,N)
The upper or lower triangle of the Hermitian band matrix A, stored in the first KD+1 rows of the array. The j-th column of A is stored in the j-th column of the array AB as 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 π«Ά
LDAB is INTEGER
The leading dimension of the array AB. LDAB >= KD+1.
π₯ B π₯
B is COMPLEX*16 array, dimension (LDB,NRHS)
The right hand side vectors for the system of linear equations.
π LDB π
LDB is INTEGER
The leading dimension of the array B. LDB >= max(1,N).
π X π
X is COMPLEX*16 array, dimension (LDX,NRHS)
The computed solution vectors. Each vector is stored as a column of the matrix X.
β LDX β
LDX is INTEGER
The leading dimension of the array X. LDX >= max(1,N).
π XACT π
XACT is COMPLEX*16 array, dimension (LDX,NRHS)
The exact solution vectors. Each vector is stored as a column of the matrix XACT.
π LDXACT π
LDXACT is INTEGER
The leading dimension of the array XACT. LDXACT >= max(1,N).
π FERR π
FERR is DOUBLE PRECISION array, dimension (NRHS)
The estimated forward error bounds for each solution vector X. If XTRUE is the true solution, FERR bounds the magnitude of the largest entry in (X - XTRUE) divided by the magnitude of the largest entry in X.
π§ BERR π§
BERR is DOUBLE PRECISION array, dimension (NRHS)
The componentwise relative backward error of each solution vector (i.e., the smallest relative change in any entry of A or B that makes X an exact solution).
π RESLTS π
RESLTS is DOUBLE PRECISION array, dimension (2)
The maximum over the NRHS solution 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 zpbt05.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
byeee bestie π β footer vibes: LAPACK, Version 3.12.0, file TESTING/LIN/zpbt05.f(3) β¨
π¦ 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