SRC/dtprfs.f(3)
πΈ NAME πΈ
Okay so this is SRC/dtprfs.f(3) β the Library Functions Manual page for DTPRFS, and itβs giving βtriangular packed matrix error-bound main character energy.β π
SRC/dtprfs.f β thatβs the name, bestie. Periodt.
β¨ SYNOPSIS β¨
π Functions/Subroutines π
subroutine dtprfs (uplo, trans, diag, n, nrhs, ap, b, ldb, x, ldx, ferr, berr, work, iwork, info)βDTPRFS
π§ Function/Subroutine Documentation π§
π¦ subroutine dtprfs π¦
subroutine dtprfs (character uplo, character trans, character diag, 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( * ) ferr, double
precision, dimension( * ) berr, double precision, dimension( * ) work,
integer, dimension( * ) iwork, integer info)
DTPRFS β iconic, no cap. π
π― Purpose π―
Okay so DTPRFS provides error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix. Itβs giving error-bound royalty, fr fr. π
The solution matrix X must be computed by DTPTRS or some other means before entering this routine. And bestie, DTPRFS does not do iterative refinement because doing so cannot improve the backward error. Thatβs the tea. Periodt.
π¨ Important vibe check: X needs to be ready before you call this routine, and thereβs no iterative-refinement era here because it cannot improve the backward error.
π§Ύ Parameters π§Ύ
Not me being obsessed with a CHARACTER*1 option list, but here we are. π
UPLOβCHARACTER*1= 'U':Ais upper triangular;= 'L':Ais lower triangular.
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)
DIAGβCHARACTER*1= 'N':Ais non-unit triangular;= 'U':Ais unit triangular.
NβINTEGER; the order of the matrixA.N >= 0.NRHSβINTEGER; the number of right hand sides, i.e., the number of columns of the matricesBandX.NRHS >= 0.APβDOUBLE PRECISIONarray, dimension(N*(N+1)/2). The upper or lower triangular matrixA, packed columnwise in a linear array. Thej-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)*(2*n-j)/2) = A(i,j) for j<=i<=n.
If DIAG = 'U', the diagonal elements of A are not referenced and are assumed to be 1.
BβDOUBLE PRECISIONarray, dimension(LDB,NRHS). The right hand side matrixB.LDBβINTEGER; the leading dimension of the arrayB.LDB >= max(1,N).XβDOUBLE PRECISIONarray, dimension(LDX,NRHS). The solution matrixX.LDXβINTEGER; the leading dimension of the arrayX.LDX >= max(1,N).FERRβDOUBLE PRECISIONarray, dimension(NRHS). The estimated forward error bound for each solution vectorX(j)(thej-th column of the solution matrixX). IfXTRUEis the true solution corresponding toX(j),FERR(j)is an estimated upper bound for the magnitude of the largest element in(X(j) - XTRUE)divided by the magnitude of the largest element inX(j). The estimate is as reliable as the estimate forRCOND, and is almost always a slight overestimate of the true error. Highkey important, ngl. π«ΆBERRβDOUBLE PRECISIONarray, dimension(NRHS). The componentwise relative backward error of each solution vectorX(j)(i.e., the smallest relative change in any element ofAorBthat makesX(j)an exact solution).WORKβDOUBLE PRECISIONarray, dimension(3*N).IWORKβINTEGERarray, dimension(N).INFOβINTEGER= 0:successful exit< 0:ifINFO = -i, thei-th argument had an illegal value
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 173 of file dtprfs.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code. π
π Thatβs the whole page, bestie: LAPACK Version 3.12.0, source SRC/dtprfs.f(3). No date in the footer, so no invented date β just the source/version sign-off. Slay and stay triangular. π
π¦ 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