CSYRFS(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

CSYRFS(3) β€” Library Functions Manual πŸ’…

okay bestie, this is the CSYRFS page from the LAPACK universe, and it's giving β€œsymmetric indefinite solver aftercare” energy. No cap. πŸ¦‹


NAME 🌸

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/csyrfs.f

That's the file path, exactly. Iconic. πŸ’–

SYNOPSIS ✨

Functions/Subroutines πŸ¦‹

subroutine CSYRFS (uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x,
    ldx, ferr, berr, work, rwork, info)

CSYRFS β€” that's the subroutine. πŸŽ€

Function/Subroutine Documentation πŸŽ€

subroutine CSYRFS (character uplo, integer n, integer nrhs, complex,
    dimension( lda, * ) a, integer lda, complex, dimension( ldaf, * ) af,
    integer ldaf, integer, dimension( * ) ipiv, complex, dimension( ldb, * )
    b, integer ldb, complex, dimension( ldx, * ) x, integer ldx, real,
    dimension( * ) ferr, real, dimension( * ) berr, complex, dimension( * )
    work, real, dimension( * ) rwork, integer info)

CSYRFS again, but now with all the types and dimensions laid out. Slay. πŸ’…

Purpose: πŸ’‘

Lowkey the whole point: CSYRFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and it provides error bounds and backward error estimates for the solution. That's the tea. πŸ’–

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 matrix A. N >= 0.
  • NRHS β€” NRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
  • A β€” A is COMPLEX array, dimension (LDA,N). The symmetric matrix A. If UPLO = 'U', the leading N-by-N upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading N-by-N lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • AF β€” AF is COMPLEX array, dimension (LDAF,N). The factored form of the matrix A. AF contains the block diagonal matrix D and the multipliers used to obtain the factor U or L from the factorization A = U*D*U**T or A = L*D*L**T as computed by CSYTRF.
  • LDAF β€” LDAF is INTEGER. The leading dimension of the array AF. LDAF >= max(1,N).
  • IPIV β€” IPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure of D as determined by CSYTRF.
  • B β€” B is COMPLEX array, dimension (LDB,NRHS). The right hand side matrix B.
  • LDB β€” LDB is INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • X β€” X is COMPLEX array, dimension (LDX,NRHS). On entry, the solution matrix X, as computed by CSYTRS. On exit, the improved solution matrix X.
  • LDX β€” LDX is INTEGER. The leading dimension of the array X. LDX >= max(1,N).
  • FERR β€” FERR is REAL array, dimension (NRHS). The estimated forward error bound for each solution vector X(j) (the j-th column of the solution matrix X). If XTRUE is the true solution corresponding to X(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 in X(j). The estimate is as reliable as the estimate for RCOND, 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 vector X(j) (i.e., the smallest relative change in any element of A or B that makes X(j) an exact solution).
  • WORK β€” WORK is COMPLEX array, dimension (2*N).
  • RWORK β€” RWORK is REAL 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. Periodt. πŸ’€

Author πŸ‘‘

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition at line 190 of file csyrfs.f. πŸ’€

Author 🫢

Generated automatically by Doxygen for LAPACK from the source code.


Sign-off: LAPACK Version 3.12.0, source path /home/abui...RC/csyrfs.f(3) β€” bye bestie, go improve that solution πŸ’…βœ¨

πŸ“¦ where this page comes from