sytf2_rook#
Functions
-
void ssytf2_rook(const char *uplo, const INT n, f32 *restrict A, const INT lda, INT *restrict ipiv, INT *info)#
SSYTF2_ROOK computes the factorization of a real symmetric matrix A using the bounded Bunch-Kaufman (“rook”) diagonal pivoting method:
A = U*D*U**T or A = L*D*L**T
This is the unblocked version of the algorithm, calling Level 2 BLAS.
Parameters
inuplo= ‘U’: Upper triangular = ‘L’: Lower triangular
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.
inldaThe leading dimension of A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and block structure.
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
> 0: if info = k, D(k,k) is exactly zero.
void ssytf2_rook(
const char* uplo,
const INT n,
f32* restrict A,
const INT lda,
INT* restrict ipiv,
INT* info
);
Functions
-
void dsytf2_rook(const char *uplo, const INT n, f64 *restrict A, const INT lda, INT *restrict ipiv, INT *info)#
DSYTF2_ROOK computes the factorization of a real symmetric matrix A using the bounded Bunch-Kaufman (“rook”) diagonal pivoting method:
A = U*D*U**T or A = L*D*L**T
This is the unblocked version of the algorithm, calling Level 2 BLAS.
Parameters
inuplo= ‘U’: Upper triangular = ‘L’: Lower triangular
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.
inldaThe leading dimension of A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and block structure.
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
> 0: if info = k, D(k,k) is exactly zero.
void dsytf2_rook(
const char* uplo,
const INT n,
f64* restrict A,
const INT lda,
INT* restrict ipiv,
INT* info
);
Functions
-
void csytf2_rook(const char *uplo, const INT n, c64 *restrict A, const INT lda, INT *restrict ipiv, INT *info)#
CSYTF2_ROOK computes the factorization of a complex symmetric matrix A using the bounded Bunch-Kaufman (“rook”) diagonal pivoting method:
A = U*D*U**T or A = L*D*L**T
This is the unblocked version of the algorithm, calling Level 2 BLAS.
Parameters
inuplo= ‘U’: Upper triangular = ‘L’: Lower triangular
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.
inldaThe leading dimension of A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and block structure.
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
> 0: if info = k, D(k,k) is exactly zero.
void csytf2_rook(
const char* uplo,
const INT n,
c64* restrict A,
const INT lda,
INT* restrict ipiv,
INT* info
);
Functions
-
void zsytf2_rook(const char *uplo, const INT n, c128 *restrict A, const INT lda, INT *restrict ipiv, INT *info)#
ZSYTF2_ROOK computes the factorization of a complex symmetric matrix A using the bounded Bunch-Kaufman (“rook”) diagonal pivoting method:
A = U*D*U**T or A = L*D*L**T
This is the unblocked version of the algorithm, calling Level 2 BLAS.
Parameters
inuplo= ‘U’: Upper triangular = ‘L’: Lower triangular
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.
inldaThe leading dimension of A. lda >= max(1, n).
outipivInteger array, dimension (n). Details of the interchanges and block structure.
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
> 0: if info = k, D(k,k) is exactly zero.
void zsytf2_rook(
const char* uplo,
const INT n,
c128* restrict A,
const INT lda,
INT* restrict ipiv,
INT* info
);