sytrf#
Functions
-
void ssytrf(const char *uplo, const INT n, f32 *restrict A, const INT lda, INT *restrict ipiv, f32 *restrict work, const INT lwork, INT *info)#
SSYTRF computes the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method.
The form of the factorization is
A = U**T*D*U or A = L*D*L**T
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
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 precision array, dimension (lda, n). On entry, the symmetric matrix A. On exit, the block diagonal matrix D and the multipliers used to obtain the factor U or L.
inldaThe leading dimension of the array A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and the block structure of D.
outworkDouble precision array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the optimal lwork.
inlworkThe length of work. lwork >= 1. For best performance lwork >= n*nb, where nb is the block size. If lwork = -1, 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, D(i,i) is exactly zero.
void ssytrf(
const char* uplo,
const INT n,
f32* restrict A,
const INT lda,
INT* restrict ipiv,
f32* restrict work,
const INT lwork,
INT* info
);
Functions
-
void dsytrf(const char *uplo, const INT n, f64 *restrict A, const INT lda, INT *restrict ipiv, f64 *restrict work, const INT lwork, INT *info)#
DSYTRF computes the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method.
The form of the factorization is
A = U**T*D*U or A = L*D*L**T
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
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 precision array, dimension (lda, n). On entry, the symmetric matrix A. On exit, the block diagonal matrix D and the multipliers used to obtain the factor U or L.
inldaThe leading dimension of the array A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and the block structure of D.
outworkDouble precision array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the optimal lwork.
inlworkThe length of work. lwork >= 1. For best performance lwork >= n*nb, where nb is the block size. If lwork = -1, 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, D(i,i) is exactly zero.
void dsytrf(
const char* uplo,
const INT n,
f64* restrict A,
const INT lda,
INT* restrict ipiv,
f64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void csytrf(const char *uplo, const INT n, c64 *restrict A, const INT lda, INT *restrict ipiv, c64 *restrict work, const INT lwork, INT *info)#
CSYTRF computes the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method.
The form of the factorization is
A = U*D*U**T or A = L*D*L**T
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
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 symmetric matrix A. On exit, the block diagonal matrix D and the multipliers used to obtain the factor U or L.
inldaThe leading dimension of the array A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and the block structure of D.
outworkSingle complex array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the optimal lwork.
inlworkThe length of work. lwork >= 1. For best performance lwork >= n*nb, where nb is the block size. If lwork = -1, 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, D(i,i) is exactly zero.
void csytrf(
const char* uplo,
const INT n,
c64* restrict A,
const INT lda,
INT* restrict ipiv,
c64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void zsytrf(const char *uplo, const INT n, c128 *restrict A, const INT lda, INT *restrict ipiv, c128 *restrict work, const INT lwork, INT *info)#
ZSYTRF computes the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method.
The form of the factorization is
A = U*D*U**T or A = L*D*L**T
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
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 symmetric matrix A. On exit, the block diagonal matrix D and the multipliers used to obtain the factor U or L.
inldaThe leading dimension of the array A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and the block structure of D.
outworkDouble complex array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the optimal lwork.
inlworkThe length of work. lwork >= 1. For best performance lwork >= n*nb, where nb is the block size. If lwork = -1, 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, D(i,i) is exactly zero.
void zsytrf(
const char* uplo,
const INT n,
c128* restrict A,
const INT lda,
INT* restrict ipiv,
c128* restrict work,
const INT lwork,
INT* info
);