DSYRFS(3)
DSYRFS(3) π
okay bestie, welcome to the Library Functions Manual page for DSYRFS(3) β literally the glow-up routine for symmetric indefinite linear systems. No cap, it's giving main character energy. β¨
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dsyrfs.f β yup, that's the source file for DSYRFS, bestie. This is the Library Functions Manual entry for DSYRFS(3). π«Ά
π SYNOPSIS π
π¦ Functions/Subroutines π¦
subroutine DSYRFS (uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x,
ldx, ferr, berr, work, iwork, info)
DSYRFS
π Function/Subroutine Documentation π
Here's the full signature, character for character, because we respect the code:
subroutine DSYRFS (character uplo, integer n, integer nrhs, double
precision, dimension( lda, * ) a, integer lda, double precision,
dimension( ldaf, * ) af, integer ldaf, integer, dimension( * ) ipiv,
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)
DSYRFS
π Purpose π
DSYRFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution. It's literally "I made your solve better and also brought receipts" energy. π
πΈ Parameters πΈ
UPLOβ isCHARACTER*1;= 'U': upper triangle ofAis stored;= 'L': lower triangle ofAis stored. Choose your fighter. βNβ isINTEGER; the order of the matrixA.N >= 0.NRHSβ isINTEGER; the number of right hand sides, i.e., the number of columns of the matricesBandX.NRHS >= 0.Aβ isDOUBLE PRECISION array, dimension (LDA,N); the symmetric matrixA. IfUPLO = 'U', the leadingN-by-Nupper triangular part ofAcontains the upper triangular part of the matrixA, and the strictly lower triangular part ofAis not referenced. IfUPLO = 'L', the leadingN-by-Nlower triangular part ofAcontains the lower triangular part of the matrixA, and the strictly upper triangular part ofAis not referenced. Respect the triangle, bestie. π«ΆLDAβ isINTEGER; the leading dimension of the arrayA.LDA >= max(1,N).AFβ isDOUBLE PRECISION array, dimension (LDAF,N); the factored form of the matrixA.AFcontains the block diagonal matrixDand the multipliers used to obtain the factorUorLfrom the factorizationA = U*D*U**TorA = L*D*L**Tas computed byDSYTRF. Iconic factorization behavior. πLDAFβ isINTEGER; the leading dimension of the arrayAF.LDAF >= max(1,N).IPIVβ isINTEGER array, dimension (N); details of the interchanges and the block structure ofDas determined byDSYTRF.Bβ isDOUBLE PRECISION array, dimension (LDB,NRHS); the right hand side matrixB.LDBβ isINTEGER; the leading dimension of the arrayB.LDB >= max(1,N).Xβ isDOUBLE PRECISION array, dimension (LDX,NRHS); on entry, the solution matrixX, as computed byDSYTRS; on exit, the improved solution matrixX. The glow-up happens in place, periodt. πLDXβ isINTEGER; the leading dimension of the arrayX.LDX >= max(1,N).FERRβ isDOUBLE PRECISION array, 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. So it's not being shady β it's just cautious. πBERRβ isDOUBLE PRECISION 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β isDOUBLE PRECISION array, dimension (3*N).IWORKβ isINTEGER array, dimension (N).INFOβ isINTEGER;= 0: successful exit;< 0: ifINFO = -i, thei-th argument had an illegal value. Bestie, negativeINFOmeans something in the argument list is sus. π
π§ Internal Parameters π§
ITMAX is the maximum number of steps of iterative refinement. It's the "one more little tweak" budget, iykyk. β¨
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 189 of file dsyrfs.f.
π§ Author π§
Generated automatically by Doxygen for LAPACK from the source code.
kisses, LAPACK Version 3.12.0 π β source: /home/abui...RC/dsyrfs.f(3) π
π¦ 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