SRC/strrfs.f(3)
π¦ SRC/strrfs.f(3) β Library Functions Manual π¦
Okay bestie, welcome to the <purple>STRRFS</purple> page. It's giving LAPACK, it's giving triangular error bounds, and it's literally all here. π
πΈ NAME πΈ
SRC/strrfs.f β the source page for the strrfs routine. No cap, that's the name. π«Ά
β¨ SYNOPSIS β¨
π Functions/Subroutines π
subroutine strrfs (uplo, trans, diag, n, nrhs, a, lda, b, ldb, x, ldx,
ferr, berr, work, iwork, info)
STRRFS
π Function/Subroutine Documentation π
subroutine strrfs (character uplo, character trans, character diag, integer
n, integer nrhs, real, dimension( lda, * ) a, integer lda, real,
dimension( ldb, * ) b, integer ldb, real, dimension( ldx, * ) x, integer
ldx, real, dimension( * ) ferr, real, dimension( * ) berr, real,
dimension( * ) work, integer, dimension( * ) iwork, integer info)
STRRFS
π― Purpose π―
STRRFS provides error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix. Basically it's the vibe check for your solve. β¨
The solution matrix X must be computed by STRTRS or some other means before entering this routine. STRRFS does not do iterative refinement because doing so cannot improve the backward error. Periodt. π
π§Έ Parameters π§Έ
UPLOβUPLO is CHARACTER*1. It says which triangle is living its truth:= 'U':Ais upper triangular;= 'L':Ais lower triangular.
TRANSβTRANS is 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βDIAG is CHARACTER*1:= 'N':Ais non-unit triangular;= 'U':Ais unit triangular.
NβN is INTEGER. The order of the matrixA.N >= 0.NRHSβNRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matricesBandX.NRHS >= 0.AβA is REAL array, dimension (LDA,N). The triangular matrixA. IfUPLO = 'U', the leading N-by-N upper triangular part of the arrayAcontains the upper triangular matrix, and the strictly lower triangular part ofAis not referenced. IfUPLO = 'L', the leading N-by-N lower triangular part of the arrayAcontains the lower triangular matrix, and the strictly upper triangular part ofAis not referenced. IfDIAG = 'U', the diagonal elements ofAare also not referenced and are assumed to be1.LDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,N).BβB is REAL array, dimension (LDB,NRHS). The right hand side matrixB.LDBβLDB is INTEGER. The leading dimension of the arrayB.LDB >= max(1,N).XβX is REAL array, dimension (LDX,NRHS). The solution matrixX.LDXβLDX is INTEGER. The leading dimension of the arrayX.LDX >= max(1,N).FERRβFERR is REAL array, dimension (NRHS). The estimated forward error bound for each solution vectorX(j)(the j-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.BERRβBERR is REAL array, 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βWORK is REAL array, dimension (3*N).IWORKβIWORK is INTEGER array, dimension (N).INFOβINFO is INTEGER:= 0: successful exit< 0: ifINFO = -i, the i-th argument had an illegal value
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Definition at line 180 of file strrfs.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/strrfs.f(3), auto-generated by Doxygen from the source code, and signed off with all the footer energy (no separate date printed, so no fake date, periodt). Mwah ππ
π¦ 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