hetrf_aa_2stage#
Functions
-
void chetrf_aa_2stage(const char *uplo, const INT n, c64 *restrict A, const INT lda, c64 *restrict TB, const INT ltb, INT *restrict ipiv, INT *restrict ipiv2, c64 *restrict work, const INT lwork, INT *info)#
CHETRF_AA_2STAGE computes the factorization of a f32 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 band matrix with the bandwidth of NB (NB is internally selected and stored in TB[0], and T is LU factorized with partial pivoting).
This is the blocked version of the algorithm, calling Level 3 BLAS.
Parameters
inuplo= ‘U’: Upper triangle of A is stored; = ‘L’: Lower triangle of A is stored.
innThe order of the matrix A. n >= 0.
inoutASingle complex array, dimension (lda, n). On entry, the hermitian matrix A. On exit, L is stored below (or above) the subdiagonal blocks.
inldaThe leading dimension of the array A. lda >= max(1, n).
outTBSingle complex array, dimension (max(1, ltb)). On exit, details of the LU factorization of the band matrix.
inltbThe size of the array TB. ltb >= max(1, 4*n). If ltb = -1, then a workspace query is assumed.
outipivInteger array, dimension (n). On exit, details of the interchanges.
outipiv2Integer array, dimension (n). On exit, details of the interchanges in T.
outworkSingle complex workspace of size (max(1, lwork)).
inlworkThe size of work. lwork >= max(1, n). If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
> 0: if info = i, band LU factorization failed on i-th column
void chetrf_aa_2stage(
const char* uplo,
const INT n,
c64* restrict A,
const INT lda,
c64* restrict TB,
const INT ltb,
INT* restrict ipiv,
INT* restrict ipiv2,
c64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void zhetrf_aa_2stage(const char *uplo, const INT n, c128 *restrict A, const INT lda, c128 *restrict TB, const INT ltb, INT *restrict ipiv, INT *restrict ipiv2, c128 *restrict work, const INT lwork, INT *info)#
ZHETRF_AA_2STAGE computes the factorization of a f64 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 band matrix with the bandwidth of NB (NB is internally selected and stored in TB[0], and T is LU factorized with partial pivoting).
This is the blocked version of the algorithm, calling Level 3 BLAS.
Parameters
inuplo= ‘U’: Upper triangle of A is stored; = ‘L’: Lower triangle of A is stored.
innThe order of the matrix A. n >= 0.
inoutADouble complex array, dimension (lda, n). On entry, the hermitian matrix A. On exit, L is stored below (or above) the subdiagonal blocks.
inldaThe leading dimension of the array A. lda >= max(1, n).
outTBDouble complex array, dimension (max(1, ltb)). On exit, details of the LU factorization of the band matrix.
inltbThe size of the array TB. ltb >= max(1, 4*n). If ltb = -1, then a workspace query is assumed.
outipivInteger array, dimension (n). On exit, details of the interchanges.
outipiv2Integer array, dimension (n). On exit, details of the interchanges in T.
outworkDouble complex workspace of size (max(1, lwork)).
inlworkThe size of work. lwork >= max(1, n). If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
> 0: if info = i, band LU factorization failed on i-th column
void zhetrf_aa_2stage(
const char* uplo,
const INT n,
c128* restrict A,
const INT lda,
c128* restrict TB,
const INT ltb,
INT* restrict ipiv,
INT* restrict ipiv2,
c128* restrict work,
const INT lwork,
INT* info
);