SRC/chetrf_aa.f(3)
πΈ NAME πΈ
SRC/chetrf_aa.f β bestie, this is the Library Functions Manual page for SRC/chetrf_aa.f(3), and it's all about the CHETRF_AA subroutine. π«Ά
β¨ SYNOPSIS β¨
Functions/Subroutines
subroutine chetrf_aa (uplo, n, a, lda, ipiv, work, lwork, info)β literally theCHETRF_AAsubroutine, no cap.
π Function/Subroutine Documentation π
subroutine chetrf_aa
subroutine chetrf_aa (character uplo, integer n, complex, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, complex, dimension( * ) work, integer lwork, integer info)
CHETRF_AA β¨
π Purpose π
Okay so CHETRF_AA computes the factorization of a complex hermitian matrix A using the Aasen's algorithm. The form of the factorization is:
A = U**H*T*U or A = L*T*L**H
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is a hermitian tridiagonal matrix.
This is the blocked version of the algorithm, calling Level 3 BLAS. Periodt. π₯
π Parameters π
UPLO
UPLO is CHARACTER*1
= 'U': Upper triangle ofAis stored;= 'L': Lower triangle ofAis stored.
N
N is INTEGER
The order of the matrix A. N >= 0.
A
A is COMPLEX array, dimension (LDA,N)
On entry, the hermitian 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.
On exit, the tridiagonal matrix is stored in the diagonals and the subdiagonals of A just below (or above) the diagonals, and L is stored below (or above) the subdiagonals, when UPLO is 'L' (or 'U').
LDA
LDA is INTEGER
The leading dimension of the array A. LDA >= max(1,N).
IPIV
IPIV is INTEGER array, 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 column IPIV(k).
WORK
WORK is COMPLEX array, dimension (MAX(1,LWORK))
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK
LWORK is INTEGER
The length of WORK. LWORK >= 1, if N <= 1, and LWORK >= 2*N, otherwise. For optimum performance LWORK >= N*(1+NB), where NB is the optimal blocksize, returned by ILAENV.
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
INFO is INTEGER
= 0: successful exit< 0: ifINFO = -i, thei-th argument had an illegal value.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 133 of file chetrf_aa.f.
π¦ Author π¦
Generated automatically by Doxygen for LAPACK from the source code.
bye bestie π«Ά this page is SRC/chetrf_aa.f(3), LAPACK Version 3.12.0, and that's literally the sign-off. πβ¨π
π¦ 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