hesv_aa_2stage(3)
π hesv_aa_2stage β the {he,sy}sv_aa_2stage page, aka Aasen, blocked 2-stage π
okay so bestie, this is the hesv_aa_2stage(3) manual β Library Functions Manual energy, and it's giving linear algebra but make it fashion. no cap, it's a whole family of routines and we're gonna meet every single one. π«Ά
β¨ NAME β¨
hesv_aa_2stage β {he,sy}sv_aa_2stage: Aasen, blocked 2-stage. that's the whole name, that's the whole vibe. π
π¦ SYNOPSIS π¦
Functions π
chesv_aa_2stageβ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 matricescsysv_aa_2stageβsubroutine csysv_aa_2stage (uplo, n, nrhs, a, lda, tb, ltb, ipiv, ipiv2, b, ldb, work, lwork, info)CSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matricesdsysv_aa_2stageβsubroutine dsysv_aa_2stage (uplo, n, nrhs, a, lda, tb, ltb, ipiv, ipiv2, b, ldb, work, lwork, info)DSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matricesssysv_aa_2stageβsubroutine ssysv_aa_2stage (uplo, n, nrhs, a, lda, tb, ltb, ipiv, ipiv2, b, ldb, work, lwork, info)SSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matriceszhesv_aa_2stageβsubroutine zhesv_aa_2stage (uplo, n, nrhs, a, lda, tb, ltb, ipiv, ipiv2, b, ldb, work, lwork, info)ZHESV_AA_2STAGE computes the solution to system of linear equations A * X = B for HE matriceszsysv_aa_2stageβsubroutine zsysv_aa_2stage (uplo, n, nrhs, a, lda, tb, ltb, ipiv, ipiv2, b, ldb, work, lwork, info)ZSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matrices
like, six routines, one aesthetic. c/z are the complex girlies, s/d are the real ones, he is Hermitian, sy is symmetric. iykyk π
πΈ Detailed Description πΈ
okay so this section is literally just the doorway β the actual tea gets spilled under Function Documentation below. buckle up, we're going routine by routine, parameter by parameter, and yes we are reading all of them. π
π Function Documentation π
β chesv_aa_2stage β
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. π
π§ Purpose π§
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.
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. (blocked = she ate and left no crumbs, Level 3 BLAS = the good stuff. β¨)
π Parameters π
UPLOβUPLOisCHARACTER*1= 'U': Upper triangle of A is stored;= 'L': Lower triangle of A is stored.
NβNisINTEGERThe order of the matrix A.N >= 0.NRHSβNRHSisINTEGERThe number of right hand sides, i.e., the number of columns of the matrix B.NRHS >= 0.AβAisCOMPLEXarray, dimension(LDA,N)On entry, the hermitian matrix A. IfUPLO = '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. IfUPLO = '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.
On exit, L is stored below (or above) the subdiagonal blocks, when UPLO is 'L' (or 'U'). π¦
LDAβLDAisINTEGERThe leading dimension of the array A.LDA >= max(1,N).TBβTBisCOMPLEXarray, dimension(MAX(1,LTB))On exit, details of the LU factorization of the band matrix.LTBβLTBisINTEGERThe size of the array TB.LTB >= MAX(1,4*N), internally used to select NB such thatLTB >= (3*NB+1)*N.
If LTB = -1, then a workspace query is assumed; the routine only calculates the optimal size of LTB, returns this value as the first entry of TB, and no error message related to LTB is issued by XERBLA. π (yes, the -1 trick β it's the "just tell me how much room i need" move)
IPIVβIPIVisINTEGERarray, dimension(N)On exit, it contains the details of the interchanges, i.e., the row and column k of A were interchanged with the row and columnIPIV(k).IPIV2βIPIV2isINTEGERarray, dimension(N)On exit, it contains the details of the interchanges, i.e., the row and column k of T were interchanged with the row and columnIPIV(k).BβBisCOMPLEXarray, dimension(LDB,NRHS)On entry, the right hand side matrix B.
On exit, the solution matrix X. π (she transforms!!)
LDBβLDBisINTEGERThe leading dimension of the array B.LDB >= max(1,N).WORKβWORKisCOMPLEXworkspace of size(MAX(1,LWORK))On exit, ifINFO = 0,WORK(1)returns the optimalLWORK.LWORKβLWORKisINTEGERThe size of WORK.LWORK >= MAX(1,N), internally used to select NB such thatLWORK >= N*NB.
If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
INFOβINFOisINTEGER= 0: successful exit< 0: ifINFO = -i, the i-th argument had an illegal value.> 0: ifINFO = i, band LU factorization failed on i-th column π
π Author π
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Definition at line 184 of file chesv_aa_2stage.f.
π¦ csysv_aa_2stage π¦
subroutine csysv_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)
CSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matrices. π
π§ Purpose π§
CSYSV_AA_2STAGE computes the solution to a complex system of linear equations
A * X = B,
where A is an N-by-N symmetric matrix and X and B are N-by-NRHS matrices.
Aasen's 2-stage algorithm is used to factor A as
A = U**T * T * U, if UPLO = 'U', or
A = L * T * L**T, if UPLO = 'L',
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is symmetric 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 of A is stored;= 'L': Lower triangle of A is stored.
NβNisINTEGERThe order of the matrix A.N >= 0.NRHSβNRHSisINTEGERThe number of right hand sides, i.e., the number of columns of the matrix B.NRHS >= 0.AβAisCOMPLEXarray, dimension(LDA,N)On entry, the symmetric matrix A. IfUPLO = '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. IfUPLO = '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.
On exit, L is stored below (or above) the subdiagonal blocks, when UPLO is 'L' (or 'U'). π¦
LDAβLDAisINTEGERThe leading dimension of the array A.LDA >= max(1,N).TBβTBisCOMPLEXarray, dimension(LTB)On exit, details of the LU factorization of the band matrix.LTBβLTBisINTEGERThe size of the array TB.LTB >= 4*N, internally used to select NB such thatLTB >= (3*NB+1)*N.
If LTB = -1, then a workspace query is assumed; the routine only calculates the optimal size of LTB, returns this value as the first entry of TB, and no error message related to LTB is issued by XERBLA. π
IPIVβIPIVisINTEGERarray, dimension(N)On exit, it contains the details of the interchanges, i.e., the row and column k of A were interchanged with the row and columnIPIV(k).IPIV2βIPIV2isINTEGERarray, dimension(N)On exit, it contains the details of the interchanges, i.e., the row and column k of T were interchanged with the row and columnIPIV(k).BβBisCOMPLEXarray, dimension(LDB,NRHS)On entry, the right hand side matrix B.
On exit, the solution matrix X. π
LDBβLDBisINTEGERThe leading dimension of the array B.LDB >= max(1,N).WORKβWORKisCOMPLEXworkspace of sizeLWORKLWORKLWORKβ okay soLWORKis anINTEGER, and itβs literally the size ofWORK. For this one,LWORK >= N, and internally itβs used to pickNBsuch thatLWORK >= N*NB. π«Ά
IfLWORK = -1, then a workspace query is assumed, bestie: 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. π
INFOβINTEGER, and hereβs the vibe check:= 0: successful exit β¨< 0: ifINFO = -i, the i-th argument had an illegal value π> 0: ifINFO = i, band LU factorization failed on i-th column π
Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 183 of file csysv_aa_2stage.f.
π dsysv_aa_2stage π
subroutine dsysv_aa_2stage (character uplo, integer n, integer nrhs, double precision, dimension( lda, * ) a, integer lda, double precision, dimension( * ) tb, integer ltb, integer, dimension( * ) ipiv, integer, dimension( * ) ipiv2, double precision, dimension( ldb, * ) b, integer ldb, double precision, dimension( * ) work, integer lwork, integer info)
DSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matrices. π
Purpose
Bestie, DSYSV_AA_2STAGE computes the solution to a real system of linear equations
A * X = B,
where A is an N-by-N symmetric matrix and X and B are N-by-NRHS matrices. π¦
Aasenβs 2-stage algorithm is used to factor A as
A = U**T * T * U, if UPLO = 'U', or
A = L * T * L**T, if UPLO = 'L',
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is symmetric 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βCHARACTER*1.'U'means the upper triangle ofAis stored;'L'means the lower triangle ofAis stored. πNβINTEGER. The order of the matrixA.N >= 0. β¨NRHSβINTEGER. The number of right hand sides, i.e., the number of columns of the matrixB.NRHS >= 0. πAβDOUBLE PRECISIONarray, dimension(LDA,N). On entry, 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. π¦
On exit, L is stored below (or above) the subdiagonal blocks, when UPLO is 'L' (or 'U'). π
LDAβINTEGER. The leading dimension of the arrayA.LDA >= max(1,N). πΈTBβDOUBLE PRECISIONarray, dimension(MAX(1,LTB)). On exit, details of the LU factorization of the band matrix. πLTBβINTEGER. The size of the arrayTB.LTB >= MAX(1,4*N), internally used to selectNBsuch thatLTB >= (3*NB+1)*N. π«Ά
IfLTB = -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. π
IPIVβINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and columnkofAwere interchanged with the row and columnIPIV(k). πIPIV2βINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and columnkofTwere interchanged with the row and columnIPIV(k). πBβDOUBLE PRECISIONarray, dimension(LDB,NRHS). On entry, the right hand side matrixB. On exit, the solution matrixX. πLDBβINTEGER. The leading dimension of the arrayB.LDB >= max(1,N). βWORKβDOUBLE PRECISIONworkspace of size(MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK. π§LWORKβINTEGER. The size ofWORK.LWORK >= MAX(1,N), internally used to selectNBsuch thatLWORK >= N*NB. π
IfLWORK = -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. π
INFOβINTEGER.= 0: successful exit β¨< 0: ifINFO = -i, the i-th argument had an illegal value. π> 0: ifINFO = i, band LU factorization failed on i-th column. π
Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 186 of file dsysv_aa_2stage.f.
π ssysv_aa_2stage π
subroutine ssysv_aa_2stage (character uplo, integer n, integer nrhs, real, dimension( lda, * ) a, integer lda, real, dimension( * ) tb, integer ltb, integer, dimension( * ) ipiv, integer, dimension( * ) ipiv2, real, dimension( ldb, * ) b, integer ldb, real, dimension( * ) work, integer lwork, integer info)
SSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matrices. π
Purpose
SSYSV_AA_2STAGE computes the solution to a real system of linear equations
A * X = B,
where A is an N-by-N symmetric matrix and X and B are N-by-NRHS matrices. πΈ
Aasenβs 2-stage algorithm is used to factor A as
A = U**T * T * U, if UPLO = 'U', or
A = L * T * L**T, if UPLO = 'L',
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is symmetric 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βCHARACTER*1.'U'means the upper triangle ofAis stored;'L'means the lower triangle ofAis stored. πNβINTEGER. The order of the matrixA.N >= 0. β¨NRHSβINTEGER. The number of right hand sides, i.e., the number of columns of the matrixB.NRHS >= 0. πAβREALarray, dimension(LDA,N). On entry, 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. π¦
On exit, L is stored below (or above) the subdiagonal blocks, when UPLO is 'L' (or 'U'). π
LDAβINTEGER. The leading dimension of the arrayA.LDA >= max(1,N). πΈTBβREALarray, dimension(MAX(1,LTB)). On exit, details of the LU factorization of the band matrix. πLTBβINTEGER. The size of the arrayTB.LTB >= MAX(1,4*N), internally used to selectNBsuch thatLTB >= (3*NB+1)*N. π«Ά
IfLTB = -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. π
IPIVβINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and columnkofAwere interchanged with the row and columnIPIV(k). πIPIV2βINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and columnkofTwere interchanged with the row and columnIPIV(k). πBβREALarray, dimension(LDB,NRHS). On entry, the right hand side matrixB. On exit, the solution matrixX. πLDBβINTEGER. The leading dimension of the arrayB.LDB >= max(1,N). βWORKβREALworkspace of size(MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK. π§LWORKβINTEGER. The size ofWORK.LWORK >= MAX(1,N), internally used to selectNBsuch thatLWORK >= N*NB. π
IfLWORK = -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. π
INFOβINFOisINTEGERβ the receipts, basically:= 0: slayed, successful exit π< 0: ifINFO = -i, the i-th argument had an illegal value (someone did NOT read the docs π)> 0: ifINFO = i, band LU factorization failed on i-th column
π Author
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
π Definition
At line 185 of file ssysv_aa_2stage.f.
π¦ subroutine zhesv_aa_2stage
subroutine zhesv_aa_2stage (character uplo, integer n, integer nrhs, complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension( * ) tb, integer ltb, integer, dimension( * ) ipiv, integer, dimension( * ) ipiv2, complex*16, dimension( ldb, * ) b, integer ldb, complex*16, dimension( * ) work, integer lwork, integer info)
ZHESV_AA_2STAGE computes the solution to system of linear equations A * X = B for HE matrices. yes bestie, the Hermitian one, we're in the z era now β¨
π Purpose
okay so ZHESV_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.
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 π₯ (blocked = faster, we love to see it).
β¨ Parameters
UPLOβCHARACTER*1= 'U': upper triangle of A is stored= 'L': lower triangle of A is stored
NβINTEGER. The order of the matrix A.N >= 0.NRHSβINTEGER. The number of right hand sides, i.e., the number of columns of the matrix B.NRHS >= 0.AβCOMPLEX*16array, dimension(LDA,N). On entry, the hermitian matrix A. IfUPLO = '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. IfUPLO = '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.
On exit, L is stored below (or above) the subdiagonal blocks, when UPLO is 'L' (or 'U').
LDAβINTEGER. The leading dimension of the array A.LDA >= max(1,N).TBβCOMPLEX*16array, dimension(MAX(1,LTB)). On exit, details of the LU factorization of the band matrix.LTBβINTEGER. The size of the array TB.LTB >= MAX(1,4*N), internally used to select NB such thatLTB >= (3*NB+1)*N.
If LTB = -1, then a workspace query is assumed; the routine only calculates the optimal size of LTB, returns this value as the first entry of TB, and no error message related to LTB is issued by XERBLA.
IPIVβINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and column k of A were interchanged with the row and columnIPIV(k).IPIV2βINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and column k of T were interchanged with the row and columnIPIV(k).BβCOMPLEX*16array, dimension(LDB,NRHS). On entry, the right hand side matrix B. On exit, the solution matrix X πLDBβINTEGER. The leading dimension of the array B.LDB >= max(1,N).WORKβCOMPLEX*16workspace of size(MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK.LWORKβINTEGER. The size ofWORK.LWORK >= MAX(1,N), internally used to select NB such thatLWORK >= N*NB.
If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
INFOβINTEGER= 0: successful exit< 0: ifINFO = -i, the i-th argument had an illegal value> 0: ifINFO = i, band LU factorization failed on i-th column
π Author
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
π Definition
At line 185 of file zhesv_aa_2stage.f.
πΈ subroutine zsysv_aa_2stage
subroutine zsysv_aa_2stage (character uplo, integer n, integer nrhs, complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension( * ) tb, integer ltb, integer, dimension( * ) ipiv, integer, dimension( * ) ipiv2, complex*16, dimension( ldb, * ) b, integer ldb, complex*16, dimension( * ) work, integer lwork, integer info)
ZSYSV_AA_2STAGE computes the solution to system of linear equations A * X = B for SY matrices. symmetric this time, not hermitian β know the difference bestie, it's giving attention to detail π
π Purpose
okay so ZSYSV_AA_2STAGE computes the solution to a complex system of linear equations
A * X = B,
where A is an N-by-N symmetric matrix and X and B are N-by-NRHS matrices.
Aasen's 2-stage algorithm is used to factor A as
A = U**T * T * U, if UPLO = 'U', or
A = L * T * L**T, if UPLO = 'L',
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is symmetric 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 π₯ (transposes here, conjugates in zhesv β that's the whole vibe difference, iykyk).
β¨ Parameters
UPLOβCHARACTER*1= 'U': upper triangle of A is stored= 'L': lower triangle of A is stored
NβINTEGER. The order of the matrix A.N >= 0.NRHSβINTEGER. The number of right hand sides, i.e., the number of columns of the matrix B.NRHS >= 0.AβCOMPLEX*16array, dimension(LDA,N). On entry, the symmetric matrix A. IfUPLO = '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. IfUPLO = '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.
On exit, L is stored below (or above) the subdiagonal blocks, when UPLO is 'L' (or 'U').
LDAβINTEGER. The leading dimension of the array A.LDA >= max(1,N).TBβCOMPLEX*16array, dimension(LTB). On exit, details of the LU factorization of the band matrix.LTBβINTEGER. The size of the array TB.LTB >= 4*N, internally used to select NB such thatLTB >= (3*NB+1)*N.
If LTB = -1, then a workspace query is assumed; the routine only calculates the optimal size of LTB, returns this value as the first entry of TB, and no error message related to LTB is issued by XERBLA.
IPIVβINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and column k of A were interchanged with the row and columnIPIV(k).IPIV2βINTEGERarray, dimension(N). On exit, it contains the details of the interchanges, i.e., the row and column k of T were interchanged with the row and columnIPIV(k).BβCOMPLEX*16array, dimension(LDB,NRHS). On entry, the right hand side matrix B. On exit, the solution matrix X πLDBβINTEGER. The leading dimension of the array B.LDB >= max(1,N).WORKβCOMPLEX*16workspace of sizeLWORK.LWORKβINTEGER. The size ofWORK.LWORK >= N, internally used to select NB such thatLWORK >= N*NB.
If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
INFOβINTEGER= 0: successful exit< 0: ifINFO = -i, the i-th argument had an illegal value> 0: ifINFO = i, band LU factorization failed on i-th column
π Author
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
π Definition
At line 183 of file zsysv_aa_2stage.f.
π Author
Generated automatically by Doxygen for LAPACK from the source code. (the robots wrote this one, not me, but they ate fr fr π€β¨)
okay that's the whole page bestie, you're officially a hesv_aa_2stage(3) expert π this gorgeousness is LAPACK, Version 3.12.0, and the page tag is hesv_aa_2stage(3) β go forth and solve those systems, mwah ππ¦π
π¦ 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