hetrs_3(3)

πŸ’… hetrs_3(3) β€” the {he,sy}trs_3 squad: solve using factor ✨

okay so bestie, welcome to the manual page for hetrs_3 β€” that's the family name, and honestly? she's giving "one name, six iconic sisters." πŸŽ€ This is Library Functions Manual territory, and we're about to meet the whole crew: chetrs_3, csytrs_3, dsytrs_3, ssytrs_3, zhetrs_3, zsytrs_3. Buckle up. πŸ¦‹


🌸 NAME 🌸

hetrs_3 - {he,sy}trs_3: solve using factor

like... that's literally the whole vibe. solve. using. factor. periodt. πŸ’…


✨ SYNOPSIS ✨

🫢 Functions

  • subroutine chetrs_3 (uplo, n, nrhs, a, lda, e, ipiv, b, ldb, info) β€” CHETRS_3
  • subroutine csytrs_3 (uplo, n, nrhs, a, lda, e, ipiv, b, ldb, info) β€” CSYTRS_3
  • subroutine dsytrs_3 (uplo, n, nrhs, a, lda, e, ipiv, b, ldb, info) β€” DSYTRS_3
  • subroutine ssytrs_3 (uplo, n, nrhs, a, lda, e, ipiv, b, ldb, info) β€” SSYTRS_3
  • subroutine zhetrs_3 (uplo, n, nrhs, a, lda, e, ipiv, b, ldb, info) β€” ZHETRS_3
  • subroutine zsytrs_3 (uplo, n, nrhs, a, lda, e, ipiv, b, ldb, info) β€” ZSYTRS_3

notice how every single one of them takes the exact same argument list? that's not laziness, that's consistency, and we stan. πŸ‘‘


🧚 Detailed Description 🧚

We're in the Function Documentation section now, and this is where the individual sisters get their moment. Each one has her own Purpose, her own Parameters, her own Author block, her own Contributors, and a Definition at line so you always know where she lives. no gatekeeping here. 🌈


πŸ‘‘ subroutine chetrs_3 πŸ‘‘

subroutine chetrs_3 (character uplo, integer n, integer nrhs, complex,
    dimension( lda, * ) a, integer lda, complex, dimension( * ) e, integer,
    dimension( * ) ipiv, complex, dimension( ldb, * ) b, integer ldb,
    integer info)

CHETRS_3

πŸ’– Purpose:

CHETRS_3 solves a system of linear equations A * X = B with a complex Hermitian matrix A using the factorization computed by CHETRF_RK or CHETRF_BK: fortran A = P*U*D*(U**H)*(P**T) or A = P*L*D*(L**H)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**H (or L**H) is the conjugate of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This algorithm is using Level 3 BLAS.

she's fast, she's blocked, she's Level 3 BLAS. πŸ”₯

🌸 Parameters

  • UPLO β€” UPLO is CHARACTER*1. Tells you whether the factorization deets are stored as an upper or lower triangular matrix:
    • = 'U': Upper triangular, form is A = P*U*D*(U**H)*(P**T);
    • = 'L': Lower triangular, form is A = P*L*D*(L**H)*(P**T).
  • N β€” N is INTEGER. The order of the matrix A. N >= 0. (lowkey don't pass a negative, she will Notice. πŸ™ˆ)
  • NRHS β€” NRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
  • A β€” A is COMPLEX array, dimension (LDA,N). Diagonal of the block diagonal matrix D and factors U or L as computed by CHETRF_RK and CHETRF_BK:
    • a) ONLY diagonal elements of the Hermitian block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D should be provided on entry in array E), and
    • b) If UPLO = 'U': factor U in the superdiagonal part of A. If UPLO = 'L': factor L in the subdiagonal part of A.
πŸ’€ real talk: "ONLY diagonal elements" means only. the off-diagonal bits of D live in E, not here. don't mix them up, bestie, it's giving wrong-answer energy.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • E β€” E is COMPLEX array, dimension (N). On entry, contains the superdiagonal (or subdiagonal) elements of the Hermitian block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
    • If UPLO = 'U': E(i) = D(i-1,i),i=2:N, E(1) not referenced;
    • If UPLO = 'L': E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = 'U' or UPLO = 'L' cases. 🫢
  • IPIV β€” IPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure of D as determined by CHETRF_RK or CHETRF_BK.
  • B β€” B is COMPLEX array, dimension (LDB,NRHS). On entry, the right hand side matrix B. On exit, the solution matrix X. ✨ the glow-up is real ✨
  • LDB β€” LDB is INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • INFO β€” INFO is INTEGER:
    • = 0: successful exit πŸŽ‰
    • < 0: if INFO = -i, the i-th argument had an illegal value 😭

πŸŽ€ Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

πŸ’œ Contributors:

June 2017, Igor Kozachenko, Computer Science Division, University of California, Berkeley September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, School of Mathematics, University of Manchester

Definition at line 163 of file chetrs_3.f.


πŸ¦‹ subroutine csytrs_3 πŸ¦‹

subroutine csytrs_3 (character uplo, integer n, integer nrhs, complex,
    dimension( lda, * ) a, integer lda, complex, dimension( * ) e, integer,
    dimension( * ) ipiv, complex, dimension( ldb, * ) b, integer ldb,
    integer info)

CSYTRS_3

πŸ’– Purpose:

CSYTRS_3 solves a system of linear equations A * X = B with a complex symmetric matrix A using the factorization computed by CSYTRF_RK or CSYTRF_BK: fortran A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This algorithm is using Level 3 BLAS.

spot the difference from her sister: symmetric, not Hermitian, and it's U**T/L**T (transpose) instead of U**H/L**H (conjugate). that one letter is doing SO much work. πŸ”

🌸 Parameters

  • UPLO β€” UPLO is CHARACTER*1. Whether the factorization details are stored as an upper or lower triangular matrix:
    • = 'U': Upper triangular, form is A = P*U*D*(U**T)*(P**T);
    • = 'L': Lower triangular, form is A = P*L*D*(L**T)*(P**T).
  • 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 matrix B. NRHS >= 0.
  • A β€” A is COMPLEX array, dimension (LDA,N). Diagonal of the block diagonal matrix D and factors U or L as computed by CSYTRF_RK and CSYTRF_BK:
    • a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D should be provided on entry in array E), and
    • b) If UPLO = 'U': factor U in the superdiagonal part of A. If UPLO = 'L': factor L in the subdiagonal part of A.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • E β€” E is COMPLEX array, dimension (N). On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
    • If UPLO = 'U': E(i) = D(i-1,i),i=2:N, E(1) not referenced;
    • If UPLO = 'L': E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = 'U' or UPLO = 'L' cases.
  • IPIV β€” IPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure of D as determined by CSYTRF_RK or CSYTRF_BK.
  • B β€” B is COMPLEX array, dimension (LDB,NRHS). On entry, the right hand side matrix B. On exit, the solution matrix X. πŸ’«
  • LDB β€” LDB is INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • INFO β€” INFO is INTEGER:
    • = 0: successful exit ✨
    • < 0: if INFO = -i, the i-th argument had an illegal value πŸ’€

πŸŽ€ Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

πŸ’œ Contributors:

June 2017, Igor Kozachenko, Computer Science Division, University of California, Berkeley September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, School of Mathematics, University of Manchester

Definition at line 163 of file csytrs_3.f.


⭐ subroutine dsytrs_3 ⭐

subroutine dsytrs_3 (character uplo, integer n, integer nrhs, double
    precision, dimension( lda, * ) a, integer lda, double precision,
    dimension( * ) e, integer, dimension( * ) ipiv, double precision,
    dimension( ldb, * ) b, integer ldb, integer info)

DSYTRS_3

πŸ’– Purpose:

DSYTRS_3 solves a system of linear equations A * X = B with a real symmetric matrix A using the factorization computed by DSYTRF_RK or DSYTRF_BK: fortran A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This algorithm is using Level 3 BLAS.

real symmetric this time β€” the D prefix means double precision all the way down. no complex numbers invited to this party. πŸ“

🌸 Parameters

  • UPLO β€” UPLO is CHARACTER*1. Whether the factorization details are stored as an upper or lower triangular matrix:
    • = 'U': Upper triangular, form is A = P*U*D*(U**T)*(P**T);
    • = 'L': Lower triangular, form is A = P*L*D*(L**T)*(P**T).
  • 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 matrix B. NRHS >= 0.
  • A β€” A is ...

(okay bestie, the page literally cuts off right here mid-parameter β€” DSYTRS_3's A description is exactly where this part of the manual runs out of road πŸ’€ hang tight, part 2 picks it right back up 🫢)

A β€” A is a DOUBLE PRECISION array, dimension (LDA,N) β€” she's the main character of this whole situation, ok? She holds the diagonal of the block diagonal matrix D plus the factors U or L, exactly as they were computed by DSYTRF_RK and DSYTRF_BK:

  • a) ONLY the diagonal elements of the symmetric block diagonal matrix D live on the diagonal of A, i.e. D(k,k) = A(k,k); the superdiagonal (or subdiagonal) elements of D should be handed over on entry in array E, bestie, don't forget πŸ’…
  • b) If UPLO = 'U': factor U sits in the superdiagonal part of A. If UPLO = 'L': factor L sits in the subdiagonal part of A.

LDA β€” LDA is INTEGER, the leading dimension of the array A, and the rule is LDA >= max(1,N). No cap, no negotiation πŸ’€

E β€” E is DOUBLE PRECISION array, dimension (N). On entry she contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where:

  • If UPLO = 'U': E(i) = D(i-1,i), i=2:N, and E(1) is not referenced;
  • If UPLO = 'L': E(i) = D(i+1,i), i=1:N-1, and E(N) is not referenced.
NOTE: for a 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both the UPLO = 'U' and the UPLO = 'L' cases. Literally unbothered, she's just vibing there ✨

IPIV β€” IPIV is INTEGER array, dimension (N), and she's carrying all the details of the interchanges and the block structure of D as determined by DSYTRF_RK or DSYTRF_BK. Receipts πŸ”₯

B β€” B is DOUBLE PRECISION array, dimension (LDB,NRHS). On entry, this is the right hand side matrix B. On exit, she's the solution matrix X. Glow-up of the century, honestly πŸ‘‘

LDB β€” LDB is INTEGER, the leading dimension of the array B, and LDB >= max(1,N). Same energy as LDA, we love a consistent queen 🌸

INFO β€” INFO is INTEGER, the little status update at the end of the story:

  • = 0: successful exit, we ate and left no crumbs πŸŽ€
  • < 0: if INFO = -i, the i-th argument had an illegal value. Not cute, someone's getting a talking-to πŸ™ˆ

πŸ‘‘ Author

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

🫢 Contributors

  • June 2017, Igor Kozachenko, Computer Science Division, University of California, Berkeley
  • September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, School of Mathematics, University of Manchester

Definition at line 163 of file dsytrs_3.f.


🌈 subroutine ssytrs_3 (character uplo, integer n, integer nrhs, real, dimension( lda, * ) a, integer lda, real, dimension( * ) e, integer, dimension( * ) ipiv, real, dimension( ldb, * ) b, integer ldb, integer info)

subroutine ssytrs_3 (character uplo, integer n, integer nrhs, real,
    dimension( lda, * ) a, integer lda, real, dimension( * ) e, integer,
    dimension( * ) ipiv, real, dimension( ldb, * ) b, integer ldb, integer
    info)

SSYTRS_3 β€” the single-precision sister. Same chaos, smaller floats πŸ’œ

🎯 Purpose

!> SSYTRS_3 solves a system of linear equations A * X = B with a real symmetric matrix A using the factorization computed by SSYTRF_RK or SSYTRF_BK:

A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T),

where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.

This algorithm is using Level 3 BLAS. Fancy, fast, iconic πŸš€

🧾 Parameters

UPLO β€” UPLO is CHARACTER*1 and she specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = 'U': Upper triangular, form is A = P*U*D*(U**T)*(P**T);
  • = 'L': Lower triangular, form is A = P*L*D*(L**T)*(P**T).

N β€” N is INTEGER, the order of the matrix A, and N >= 0.

NRHS β€” NRHS is INTEGER, the number of right hand sides, i.e., the number of columns of the matrix B, and NRHS >= 0.

A β€” A is REAL array, dimension (LDA,N). Diagonal of the block diagonal matrix D and factors U or L as computed by SSYTRF_RK and SSYTRF_BK:

  • a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); the superdiagonal (or subdiagonal) elements of D should be provided on entry in array E, and
  • b) If UPLO = 'U': factor U in the superdiagonal part of A. If UPLO = 'L': factor L in the subdiagonal part of A.

LDA β€” LDA is INTEGER, the leading dimension of the array A, and LDA >= max(1,N).

E β€” E is REAL array, dimension (N). On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where:

  • If UPLO = 'U': E(i) = D(i-1,i), i=2:N, E(1) not referenced;
  • If UPLO = 'L': E(i) = D(i+1,i), i=1:N-1, E(N) not referenced.
NOTE: for 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = 'U' or UPLO = 'L' cases. She said what she said πŸ«₯

IPIV β€” IPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure of D as determined by SSYTRF_RK or SSYTRF_BK.

B β€” B is REAL array, dimension (LDB,NRHS). On entry, the right hand side matrix B. On exit, the solution matrix X. She understood the assignment πŸ’–

LDB β€” LDB is INTEGER, the leading dimension of the array B, and LDB >= max(1,N).

INFO β€” INFO is INTEGER:

  • = 0: successful exit
  • < 0: if INFO = -i, the i-th argument had an illegal value

πŸ‘‘ Author

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

🫢 Contributors

  • June 2017, Igor Kozachenko, Computer Science Division, University of California, Berkeley
  • September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, School of Mathematics, University of Manchester

Definition at line 163 of file ssytrs_3.f.


πŸ¦‹ subroutine zhetrs_3 (character uplo, integer n, integer nrhs, complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension( * ) e, integer, dimension( * ) ipiv, complex*16, dimension( ldb, * ) b, integer ldb, integer info)

subroutine zhetrs_3 (character uplo, integer n, integer nrhs, complex*16,
    dimension( lda, * ) a, integer lda, complex*16, dimension( * ) e,
    integer, dimension( * ) ipiv, complex*16, dimension( ldb, * ) b, integer
    ldb, integer info)

ZHETRS_3 β€” now with complex numbers, because we're extra and we contain multitudes πŸ’…βœ¨

🎯 Purpose

!> ZHETRS_3 solves a system of linear equations A * X = B with a complex Hermitian matrix A using the factorization computed by ZHETRF_RK or ZHETRF_BK:

A = P*U*D*(U**H)*(P**T) or A = P*L*D*(L**H)*(P**T),

where U (or L) is unit upper (or lower) triangular matrix, U**H (or L**H) is the conjugate of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.

This algorithm is using Level 3 BLAS. Conjugate transpose queen, she does it different πŸ’«

🧾 Parameters

UPLO β€” UPLO is CHARACTER*1 and she specifies whether the details of the factorization are stored as an upper or lower triangular matrix:

  • = 'U': Upper triangular, form is A = P*U*D*(U**H)*(P**T);
  • = 'L': Lower triangular, form is A = P*L*D*(L**H)*(P**T).

N β€” N is INTEGER, the order of the matrix A, and N >= 0.

NRHS β€” NRHS is INTEGER, the number of right hand sides, i.e., the number of columns of the matrix B, and NRHS >= 0.

A β€” A is COMPLEX*16 array, dimension (LDA,N). Diagonal of the block diagonal matrix D and factors U or L as computed by ZHETRF_RK and ZHETRF_BK:

  • a) ONLY diagonal elements of the Hermitian block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); the superdiagonal (or subdiagonal) elements of D should be provided on entry in array E, and
  • b) If UPLO = 'U': factor U in the superdiagonal part of A. If UPLO = 'L': factor L in the subdiagonal part of A.

LDA β€” LDA is INTEGER, the leading dimension of the array A, and LDA >= max(1,N).

E β€” E is COMPLEX*16 array, dimension (N). On entry, contains the superdiagonal (or subdiagonal) elements of the Hermitian block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where:

  • If UPLO = 'U': E(i) = D(i-1,i), i=2:N, E(1) not referenced;
  • If UPLO = 'L': E(i) = D(i+1,i), i=1:N-1, E(N) not referenced.
NOTE: for 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = 'U' or UPLO = 'L' cases. Same rule, complex girl edition 🧚

IPIV β€” IPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure of D as determined by ZHETRF_RK or ZHETRF_BK.

B β€” B is COMPLEX*16 array, dimension (LDB,NRHS). On entry, the right hand side matrix B. On exit, the solution matrix X. Slay πŸ’…

LDB β€” LDB is INTEGER, the leading dimension of the array B, and LDB >= max(1,N).

INFO β€” INFO is INTEGER:

  • = 0: successful exit
  • < 0: if INFO = -i, the i-th argument had an illegal value

πŸ‘‘ Author

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

🫢 Contributors

okay so this part picks up with the little contributor-comment tail that was chilling right before zsytrs_3, bestie:

           !>
           !>  June 2017,  Igor Kozachenko,
           !>                  Computer Science Division,
           !>                  University of California, Berkeley
           !>
           !>  September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas,
           !>                  School of Mathematics,
           !>                  University of Manchester
           !>
           !>

Definition at line 163 of file zhetrs_3.f.

🫢 zsytrs_3 β€” the symmetric-solve bestie 🫢

   subroutine zsytrs_3 (character uplo, integer n, integer nrhs, complex*16,
       dimension( lda, * ) a, integer lda, complex*16, dimension( * ) e,
       integer, dimension( * ) ipiv, complex*16, dimension( ldb, * ) b, integer
       ldb, integer info)

ZSYTRS_3

✨ Purpose: ✨

okay so ZSYTRS_3 solves a system of linear equations A * X = B with a complex symmetric matrix A using the factorization computed by ZSYTRF_RK or ZSYTRF_BK:

A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T),

where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.

This algorithm is using Level 3 BLAS.

🌸 Parameters 🌸

  • UPLO β€” is CHARACTER*1. Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:
    • = 'U': Upper triangular, form is A = P*U*D*(U**T)*(P**T);
    • = 'L': Lower triangular, form is A = P*L*D*(L**T)*(P**T).
  • N β€” is INTEGER. The order of the matrix A. N >= 0.
  • NRHS β€” is INTEGER. The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
  • A β€” is COMPLEX*16 array, dimension (LDA,N). Diagonal of the block diagonal matrix D and factors U or L as computed by ZSYTRF_RK and ZSYTRF_BK:
    • a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D should be provided on entry in array E), and
    • b) If UPLO = 'U': factor U in the superdiagonal part of A. If UPLO = 'L': factor L in the subdiagonal part of A.
  • LDA β€” is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • E β€” is COMPLEX*16 array, dimension (N). On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
    • If UPLO = 'U': E(i) = D(i-1,i),i=2:N, E(1) not referenced;
    • If UPLO = 'L': E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = 'U' or UPLO = 'L' cases.
  • IPIV β€” is INTEGER array, dimension (N). Details of the interchanges and the block structure of D as determined by ZSYTRF_RK or ZSYTRF_BK.
  • B β€” is COMPLEX*16 array, dimension (LDB,NRHS). On entry, the right hand side matrix B. On exit, the solution matrix X.
  • LDB β€” is INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • INFO β€” is INTEGER.
    • = 0: successful exit
    • < 0: if INFO = -i, the i-th argument had an illegal value

πŸ‘‘ Author πŸ‘‘

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

πŸŽ€ Contributors: πŸŽ€

!>
!>  June 2017,  Igor Kozachenko,
!>                  Computer Science Division,
!>                  University of California, Berkeley
!>
!>  September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas,
!>                  School of Mathematics,
!>                  University of Manchester
!>
!>

Definition at line 163 of file zsytrs_3.f.

πŸͺ„ Author πŸͺ„

Generated automatically by Doxygen for LAPACK from the source code.


source/version check: this page is from LAPACK Version 3.12.0, page hetrs_3(3) β€” and the original footer doesn't give a date, so no invented date, periodt πŸ’–βœ¨

πŸ“¦ where this page comes from