SRC/zsyrfs.f(3)
π SRC/zsyrfs.f(3) π
Manual: Library Functions Manual β okay so this is the whole entry for SRC/zsyrfs.f, and itβs literally all about the zsyrfs subroutine. Letβs go, bestie. β¨
πΈ NAME πΈ
SRC/zsyrfs.f
β¨ SYNOPSIS β¨
π Functions/Subroutines
subroutine zsyrfs (uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x,
ldx, ferr, berr, work, rwork, info)
ZSYRFS
π Function/Subroutine Documentation π
subroutine zsyrfs (character uplo, integer n, integer nrhs, complex*16,
dimension( lda, * ) a, integer lda, complex*16, dimension( ldaf, * ) af,
integer ldaf, integer, dimension( * ) ipiv, complex*16, dimension( ldb,
* ) b, integer ldb, complex*16, dimension( ldx, * ) x, integer ldx,
double precision, dimension( * ) ferr, double precision, dimension( * )
berr, complex*16, dimension( * ) work, double precision, dimension( * )
rwork, integer info)
ZSYRFS
π― Purpose
Okay so ZSYRFS 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. Literally thatβs the whole glow-up job. β¨
π§ Parameters
UPLOβUPLO is CHARACTER*1;= 'U': Upper triangle of A is stored;= 'L': Lower triangle of A is stored.π¦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 COMPLEX*16 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.LDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,N).AFβAF is COMPLEX*16 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 byZSYTRF.LDAFβLDAF is INTEGER. The leading dimension of the arrayAF.LDAF >= max(1,N).IPIVβIPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure ofDas determined byZSYTRF.BβB is COMPLEX*16 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 COMPLEX*16 array, dimension (LDX,NRHS). On entry, the solution matrixX, as computed byZSYTRS. On exit, the improved solution matrixX.LDXβLDX is INTEGER. The leading dimension of the arrayX.LDX >= max(1,N).FERRβFERR is DOUBLE PRECISION 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 DOUBLE 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βWORK is COMPLEX*16 array, dimension (2*N).RWORKβRWORK is DOUBLE PRECISION array, dimension (N).INFOβINFO is INTEGER;= 0: successful exit;< 0: if INFO = -i, the i-th argument had an illegal value.
π§ Internal Parameters
ITMAX is the maximum number of steps of iterative refinement. π«Ά
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 190 of file zsyrfs.f.
π Author
Generated automatically by Doxygen for LAPACK from the source code.
Stay slay, bestie π
β this page is from LAPACK Version 3.12.0 and the file tag is SRC/zsyrfs.f(3). Periodt. π
π¦ 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