/home/abui...trs_rook.f(3)
π NAME π
bestie, this whole page is literally about /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zhetrs_rook.f β yes that's the actual path, I'm not kidding, it's giving "absolute path main character energy" π and it lives in the Library Functions Manual, section 3. Come get your LAPACK lore π
β¨ SYNOPSIS β¨
π§ Functions/Subroutines
subroutine ZHETRS_ROOK (uplo, n, nrhs, a, lda, ipiv, b, ldb, info)
ZHETRS_ROOK computes the solution to a system of linear equations A * X = B for HE matrices using factorization obtained with one of the bounded diagonal pivoting methods (max 2 interchanges) π₯ no cap, that's the whole vibe.
π Function/Subroutine Documentation π
πΈ subroutine ZHETRS_ROOK
subroutine ZHETRS_ROOK (character uplo, integer n, integer nrhs, complex*16,
dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv,
complex*16, dimension( ldb, * ) b, integer ldb, integer info)
ZHETRS_ROOK computes the solution to a system of linear equations A * X = B for HE matrices using factorization obtained with one of the bounded diagonal pivoting methods (max 2 interchanges) β like I said, iconic behaviour only.
π― Purpose:
!>
!> ZHETRS_ROOK solves a system of linear equations A*X = B with a complex
!> Hermitian matrix A using the factorization A = U*D*U**H or
!> A = L*D*L**H computed by ZHETRF_ROOK.
!>
okay so basically: you give it a factorization somebody else (ZHETRF_ROOK, we π love π her π) already did the hard work for, and she hands you back your solution. team work makes the dream work π«Ά
π¦ Parameters
UPLO
!> 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 = U*D*U**H;
!> = 'L': Lower triangular, form is A = L*D*L**H.
!>
bestie it's one character and it decides everything β 'U' for upper triangular (form is A = U*D*U**H), 'L' for lower triangular (form is A = L*D*L**H). choose wisely, literally π
N
!> N is INTEGER
!> The order of the matrix A. N >= 0.
!>
the order of the matrix A. N >= 0, periodt.
NRHS
!> NRHS is INTEGER
!> The number of right hand sides, i.e., the number of columns
!> of the matrix B. NRHS >= 0.
!>
the number of right hand sides β i.e., the number of columns of the matrix B. NRHS >= 0, fr fr.
A
!> A is COMPLEX*16 array, dimension (LDA,N)
!> The block diagonal matrix D and the multipliers used to
!> obtain the factor U or L as computed by ZHETRF_ROOK.
!>
a COMPLEX*16 array, dimension (LDA,N) β it's the block diagonal matrix D plus the multipliers used to obtain the factor U or L as computed by ZHETRF_ROOK. she's carrying the whole group project ngl π
LDA
!> LDA is INTEGER
!> The leading dimension of the array A. LDA >= max(1,N).
!>
the leading dimension of the array A. LDA >= max(1,N) β don't skip this, the vibe check will fail π
IPIV
!> IPIV is INTEGER array, dimension (N)
!> Details of the interchanges and the block structure of D
!> as determined by ZHETRF_ROOK.
!>
an INTEGER array, dimension (N) β the details of the interchanges and the block structure of D as determined by ZHETRF_ROOK. she knows things π
B
!> B is COMPLEX*16 array, dimension (LDB,NRHS)
!> On entry, the right hand side matrix B.
!> On exit, the solution matrix X.
!>
a COMPLEX*16 array, dimension (LDB,NRHS). on entry it's the right hand side matrix B; on exit it's the solution matrix X. glow-up arc, honestly β¨π¦
LDB
!> LDB is INTEGER
!> The leading dimension of the array B. LDB >= max(1,N).
!>
the leading dimension of the array B. LDB >= max(1,N), same energy, same rules πΈ
INFO
!> INFO is INTEGER
!> = 0: successful exit
!> < 0: if INFO = -i, the i-th argument had an illegal value
!>
the receipts π§Ύ β = 0 means successful exit (slay), < 0 means if INFO = -i, the i-th argument had an illegal value (not slay, go fix it π)
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
the whole squad showed up, we love a collab π
π Contributors:
!>
!> November 2013, Igor Kozachenko,
!> Computer Science Division,
!> University of California, Berkeley
!>
!> September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas,
!> School of Mathematics,
!> University of Manchester
!>
!>
Igor Kozachenko (Computer Science Division, University of California, Berkeley) in November 2013 β and before that, in September 2007, Sven Hammarling, Nicholas J. Higham and Craig Lucas (School of Mathematics, University of Manchester). legends only, no cap ππ₯
π Definition at line 134 of file zhetrs_rook.f. β found her! that's the exact coordinate, iykyk π
β Author β
Generated automatically by Doxygen for LAPACK from the source code. robot wrote this, not a human, but the vibes are immaculate anyway π€π
okay that's the whole page bestie, go forth and solve those complex Hermitian systems π π«Ά
LAPACK Β· Version 3.12.0 Β· /home/abui...trs_rook.f(3) β mwah, see you in section 3, xoxo πβ¨π
π¦ 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