SRC/chesv_aa_2stage.f(3)
π SRC/chesv_aa_2stage.f(3) π
okay so bestie, this page comes from the Library Functions Manual, and it's lowkey iconic: one Fortran subroutine, all the linear algebra details, and zero boring allowed. We're keeping every flag, number, and footnote, fr fr. π«Ά
π NAME π
SRC/chesv_aa_2stage.f
β¨ SYNOPSIS β¨
πΈ Functions/Subroutines πΈ
subroutine chesv_aa_2stage (uplo, n, nrhs, a, lda, tb, ltb, ipiv, ipiv2,
b, ldb, work, lwork, info)
CHESV_AA_2STAGE computes the solution to system of linear equations A * X = B for HE matrices β that's the whole vibe. β¨
π οΈ Function/Subroutine Documentation π οΈ
subroutine chesv_aa_2stage (character uplo, integer n, integer nrhs,
complex, dimension( lda, * ) a, integer lda, complex, dimension( * ) tb,
integer ltb, integer, dimension( * ) ipiv, integer, dimension( * )
ipiv2, complex, dimension( ldb, * ) b, integer ldb, complex, dimension(
* ) work, integer lwork, integer info)
CHESV_AA_2STAGE computes the solution to system of linear equations A * X = B for HE matrices (yes, again β it's the subroutine's whole personality). π
π Purpose π
ok so CHESV_AA_2STAGE computes the solution to a complex system of linear equations
A * X = B,
where A is an N-by-N Hermitian matrix and X and B are N-by-NRHS matrices. No cap.
Aasen's 2-stage algorithm is used to factor A as
A = U**H * T * U, if UPLO = 'U', or
A = L * T * L**H, if UPLO = 'L',
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is Hermitian and band. The matrix T is then LU-factored with partial pivoting. The factored form of A is then used to solve the system of equations A * X = B.
This is the blocked version of the algorithm, calling Level 3 BLAS. π₯
π Parameters π
UPLOβUPLOisCHARACTER*1= 'U': Upper triangle ofAis stored;= 'L': Lower triangle ofAis stored.
NβNisINTEGER- The order of the matrix
A. N >= 0.
- The order of the matrix
NRHSβNRHSisINTEGER- 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
AβAisCOMPLEX array, dimension (LDA,N)- On entry, the hermitian matrix
A. 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. - On exit,
Lis stored below (or above) the subdiagonal blocks, whenUPLOis'L'(or'U').
- On entry, the hermitian matrix
LDAβLDAisINTEGER- The leading dimension of the array
A. LDA >= max(1,N).
- The leading dimension of the array
TBβTBisCOMPLEX array, dimension (MAX(1,LTB))- On exit, details of the LU factorization of the band matrix.
LTBβLTBisINTEGER- The size of the array
TB. LTB >= MAX(1,4*N), internally used to selectNBsuch thatLTB >= (3*NB+1)*N.- If
LTB = -1, then a workspace query is assumed; the routine only calculates the optimal size ofLTB, returns this value as the first entry ofTB, and no error message related toLTBis issued byXERBLA.
- The size of the array
IPIVβIPIVisINTEGER array, dimension (N)- On exit, it contains the details of the interchanges, i.e., the row and column
kofAwere interchanged with the row and columnIPIV(k).
- On exit, it contains the details of the interchanges, i.e., the row and column
IPIV2βIPIV2isINTEGER array, dimension (N)- On exit, it contains the details of the interchanges, i.e., the row and column
kofTwere interchanged with the row and columnIPIV(k).
- On exit, it contains the details of the interchanges, i.e., the row and column
BβBisCOMPLEX array, dimension (LDB,NRHS)- On entry, the right hand side matrix
B. - On exit, the solution matrix
X.
- On entry, the right hand side matrix
LDBβLDBisINTEGER- The leading dimension of the array
B. LDB >= max(1,N).
- The leading dimension of the array
WORKβWORKisCOMPLEX workspace of size (MAX(1,LWORK))- On exit, if
INFO = 0,WORK(1)returns the optimalLWORK.
- On exit, if
LWORKβLWORKisINTEGER- The size of
WORK. LWORK >= MAX(1,N), internally used to selectNBsuch thatLWORK >= N*NB.- If
LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of theWORKarray, returns this value as the first entry of theWORKarray, and no error message related toLWORKis issued byXERBLA.
- The size of
INFOβINFOisINTEGER= 0: successful exit< 0: ifINFO = -i, thei-th argument had an illegal value.> 0: ifINFO = i, band LU factorization failed oni-th column
π Author π
Univ. of TennesseeUniv. of California BerkeleyUniv. of Colorado DenverNAG Ltd.
π Definition π
Definition at line 184 of file chesv_aa_2stage.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
π and that's the whole page, bestie! The footer energy is LAPACK Version 3.12.0, and the source page is SRC/chesv_aa_2stage.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