LDL Computation APIs#
HECON#
- group hecon
Functions
-
template<typename T, typename Ta>
void hecon(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, Ta *anorm, Ta *rcond, T *work, integer *info)# HECON estimates the reciprocal of the condition number of a complex Hermitian matrix A.
Purpose:
HECON estimates the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**H;
= ‘L’: Lower triangular, form is A = L*D*L**H.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [in]
A is COMPLEX array, dimension (LDA,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CHETRF.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by CHETRF.
ANORM – [in]
ANORM is REAL
The 1-norm of the original matrix A.
RCOND – [out]
RCOND is REAL
The reciprocal of the condition number of the matrix A, computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an estimate of the 1-norm of inv(A) computed in this routine.
WORK – [out] WORK is COMPLEX array, dimension (2*N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T, typename Ta>
SYCON#
- group sycon
Functions
-
template<typename T>
void sycon(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *anorm, T *rcond, T *work, integer *iwork, integer *info)# SYCON estimates the reciprocal of the condition number of a real symmetric matrix A.
Purpose:
SYCON estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SYTRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF.
ANORM – [in]
ANORM is REAL
The 1-norm of the original matrix A.
RCOND – [out]
RCOND is REAL
The reciprocal of the condition number of the matrix A, computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an estimate of the 1-norm of inv(A) computed in this routine.
WORK – [out] WORK is REAL array, dimension (2*N)
IWORK – [out] IWORK is INTEGER array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRF#
- group sytrf
Functions
-
template<typename T>
void sytrf(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *work, integer *lwork, integer *info)# SYTRF computes the factorization of a real symmetric matrix A
using the Bunch-Kaufman diagonal pivoting method.
Purpose:
SYTRF 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:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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 block diagonal matrix D and the multipliers used to obtain the factor U or L (see below for further details).LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D. If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If UPLO = ‘U’ and IPIV(k) = IPIV(k-1) < 0, then rows and columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k) is a 2-by-2 diagonal block. If UPLO = ‘L’ and IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.WORK – [out]
WORK is REAL array, dimension (MAX(1,LWORK))
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK – [in]
LWORK is INTEGER
The length of WORK. LWORK >=1. For best performance LWORK >= N*NB, where NB is the block size 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 – [out]
INFO is INTEGER
= 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. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
-
template<typename T>
LASYF#
- group lasyf
Functions
-
template<typename T>
void lasyf(char *uplo, integer *n, integer *nb, integer *kb, T *a, integer *lda, integer *ipiv, T *w, integer *ldw, integer *info)# LASYF computes a partial factorization of a real symmetric matrix using the Bunch-Kaufman diagonal pivoting method.
Purpose:
LASYF computes a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method. The partial factorization has the form: A = (I U12) (A11 0 ) ( I 0 ) if UPLO = 'U', or: (0 U22) ( 0 D ) (U12**T U22**T) A = (L11 0) ( D 0 ) (L11**T L21**T) if UPLO = 'L' (L21 I) ( 0 A22) ( 0 I ) where the order of D is at most NB. The actual order is returned in the argument KB, and is either NB or NB-1, or N if N <= NB. SLASYF is an auxiliary routine called by SSYTRF. It uses blocked code (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or A22 (if UPLO = 'L').
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
= ‘U’: Upper triangular
= ‘L’: Lower triangular
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NB – [in]
NB is INTEGER
The maximum number of columns of the matrix A that should be factored. NB should be at least 2 to allow for 2-by-2 pivot blocks.
KB – [out]
KB is INTEGER
The number of columns of A that were actually factored. KB is either NB-1 or NB, or N if N <= NB.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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, A contains details of the partial factorization.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D.
If UPLO = ‘U’:
Only the last KB elements of IPIV are set.
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) = IPIV(k-1) < 0, then rows and columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k) is a 2-by-2 diagonal block.
If UPLO = ‘L’:
Only the first KB elements of IPIV are set.
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.
W – [out] W is REAL array, dimension (LDW,NB)
LDW – [in]
LDW is INTEGER
The leading dimension of the array W. LDW >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
> 0: if INFO = k, D(k,k) is exactly zero. The factorization has been completed, but the block diagonal matrix D is exactly singular.
-
template<typename T>
SYTF2#
- group sytf2
Functions
-
template<typename T>
void sytf2(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, integer *info)# SYTF2 computes the factorization of a real symmetric indefinite matrix, using the diagonal pivoting method.
Purpose:
SYTF2 computes the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method: 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, U**T is the transpose of U, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This is the unblocked version of the algorithm, calling Level 2 BLAS.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
= ‘U’: Upper triangular
= ‘L’: Lower triangular
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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 block diagonal matrix D and the multipliers used to obtain the factor U or L (see below for further details).LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D.
If UPLO = ‘U’:
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) = IPIV(k-1) < 0, then rows and columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k) is a 2-by-2 diagonal block.
If UPLO = ‘L’:
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.
INFO – [out]
INFO is INTEGER
= 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. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
-
template<typename T>
SYTRS#
- group sytrs
Functions
-
template<typename T>
void sytrs(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, integer *ipiv, T *b, integer *ldb, integer *info)# SYTRS solves a system of linear equations A*X = B with a real
symmetric matrix A.
Purpose:
SYTRS solves a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SYTRF.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF.
B – [inout]
B is REAL array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRI#
- group sytri
Functions
-
template<typename T>
void sytri(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *work, integer *info)# SYTRI computes the inverse of a real symmetric indefinite matrix A
using the factorization A = U*D*U**T or A = L*D*L**T computed by SYTRF.
Purpose:
SYTRI computes the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SYTRF.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF.
On exit, if INFO = 0, the (symmetric) inverse of the original matrix. If UPLO = ‘U’, the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced; if UPLO = ‘L’ the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SYTRF.
WORK – [out] WORK is REAL array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.
-
template<typename T>
SYRFS#
- group syrfs
Functions
-
template<typename T>
void syrfs(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, T *af, integer *ldaf, integer *ipiv, T *b, integer *ldb, T *x, integer *ldx, T *ferr, T *berr, T *work, integer *iwork, integer *info)# SYRFS improves the computed solution to a system of linear equations.
Purpose:
SYRFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
The symmetric 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.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
AF – [in]
AF is REAL array, dimension (LDAF,N)
The factored form of the matrix A. AF contains the block diagonal matrix D and the multipliers used to obtain the factor U or L from the factorization A = U*D*U**T or A = L*D*L**T as computed by SSYTRF.
LDAF – [in]
LDAF is INTEGER
The leading dimension of the array AF. LDAF >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF.
B – [in]
B is REAL array, dimension (LDB,NRHS)
The right hand side matrix B.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
X – [inout]
X is REAL array, dimension (LDX,NRHS)
On entry, the solution matrix X, as computed by SSYTRS. On exit, the improved solution matrix X.
LDX – [in]
LDX is INTEGER
The leading dimension of the array X. LDX >= fla_max(1,N).
FERR – [out]
FERR is REAL array, dimension (NRHS)
The estimated forward error bound for each solution vector X(j) (the j-th column of the solution matrix X). If XTRUE is the true solution corresponding to X(j), FERR(j) is an estimated upper bound for the magnitude of the largest element in (X(j) - XTRUE) divided by the magnitude of the largest element in X(j). The estimate is as reliable as the estimate for RCOND, and is almost always a slight overestimate of the true error.
BERR – [out]
BERR is REAL array, dimension (NRHS)
The componentwise relative backward error of each solution vector X(j) (i.e., the smallest relative change in any element of A or B that makes X(j) an exact solution).
WORK – [out] WORK is REAL array, dimension (3*N)
IWORK – [out] IWORK is INTEGER array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYRFSX#
- group syrfsx
Functions
-
template<typename T>
void syrfsx(char *uplo, char *equed, integer *n, integer *nrhs, T *a, integer *lda, T *af, integer *ldaf, integer *ipiv, T *s, T *b, integer *ldb, T *x, integer *ldx, T *rcond, T *berr, integer *n_err_bnds, T *err_bnds_norm, T *err_bnds_comp, integer *nparams, T *params, T *work, integer *iwork, integer *info)# SYRFSX improves the computed solution to a system of linear equations.
Purpose:
SYRFSX improves the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution. In addition to normwise error bound, the code provides maximum componentwise error bound if possible. See comments for ERR_BNDS_NORM and ERR_BNDS_COMP for details of the error bounds. The original system of linear equations may have been equilibrated before calling this routine, as described by arguments EQUED and S below. In this case, the solution and error bounds returned are for the original unequilibrated system.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.EQUED – [in]
EQUED is CHARACTER*1
Specifies the form of equilibration that was done to A before calling this routine. This is needed to compute the solution and error bounds correctly.
= ‘N’: No equilibration
= ‘Y’: Both row and column equilibration, i.e., A has been replaced by diag(S) * A * diag(S). The right hand side B has been changed accordingly.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
The symmetric 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.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
AF – [in]
AF is REAL array, dimension (LDAF,N)
The factored form of the matrix A. AF contains the block diagonal matrix D and the multipliers used to obtain the factor U or L from the factorization A = U*D*U**T or A = L*D*L**T as computed by SSYTRF.
LDAF – [in]
LDAF is INTEGER
The leading dimension of the array AF. LDAF >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF.
S – [inout]
S is REAL array, dimension (N)
The scale factors for A. If EQUED = ‘Y’, A is multiplied on the left and right by diag(S). S is an input argument if FACT = ‘F’; otherwise, S is an output argument. If FACT = ‘F’ and EQUED = ‘Y’, each element of S must be positive. If S is output, each element of S is a power of the radix. If S is input, each element of S should be a power of the radix to ensure a reliable solution and error estimates. Scaling by powers of the radix does not cause rounding errors unless the result underflows or overflows. Rounding errors during scaling lead to refining with a matrix that is not equivalent to the input matrix, producing error estimates that may not be reliable.
B – [in]
B is REAL array, dimension (LDB,NRHS)
The right hand side matrix B.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
X – [inout]
X is REAL array, dimension (LDX,NRHS)
On entry, the solution matrix X, as computed by SGETRS. On exit, the improved solution matrix X.
LDX – [in]
LDX is INTEGER
The leading dimension of the array X. LDX >= fla_max(1,N).
RCOND – [out]
RCOND is REAL
Reciprocal scaled condition number. This is an estimate of the reciprocal Skeel condition number of the matrix A after equilibration (if done). If this is less than the machine precision (in particular, if it is zero), the matrix is singular to working precision. Note that the error may still be small even if this number is very small and the matrix appears ill- conditioned.
BERR – [out]
BERR is REAL array, dimension (NRHS)
Componentwise relative backward error. This is the componentwise relative backward error of each solution vector X(j) (i.e., the smallest relative change in any element of A or B that makes X(j) an exact solution).
N_ERR_BNDS – [in]
N_ERR_BNDS is INTEGER
Number of error bounds to return for each right hand side and each type (normwise or componentwise). See ERR_BNDS_NORM and ERR_BNDS_COMP below.
ERR_BNDS_NORM – [out]
ERR_BNDS_NORM is REAL array, dimension (NRHS, N_ERR_BNDS)
For each right-hand side, this array contains information about various error bounds and condition numbers corresponding to the normwise relative error, which is defined as follows:
Normwise relative error in the ith solution vector:\[ \frac{{max\_j}\ abs(XTRUE(j,i) - X(j,i))}{{max\_j}\ abs(X(j,i))} \]The array is indexed by the type of error information as described below. There currently are up to three pieces of information returned.
The first index in ERR_BNDS_NORM(i,:) corresponds to the ith right-hand side.
The second index in ERR_BNDS_NORM(:,err) contains the following three fields:
err = 1 “Trust/don’t trust” boolean. Trust the answer if the reciprocal condition number is less than the threshold sqrt(n) * slamch(‘Epsilon’).
err = 2 “Guaranteed” error bound: The estimated forward error, almost certainly within a factor of 10 of the true error so long as the next entry is greater than the threshold sqrt(n) * slamch(‘Epsilon’). This error bound should only be trusted if the previous boolean is true.
err = 3 Reciprocal condition number: Estimated normwise reciprocal condition number. Compared with the threshold sqrt(n) * slamch(‘Epsilon’) to determine if the error estimate is “guaranteed”. These reciprocal condition numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some appropriately scaled matrix Z. Let Z = S*A, where S scales each row by a power of the radix so all absolute row sums of Z are approximately 1.
See Lapack Working Note 165 for further details and extra cautions.ERR_BNDS_COMP – [out]
ERR_BNDS_COMP is REAL array, dimension (NRHS, N_ERR_BNDS)
For each right-hand side, this array contains information about various error bounds and condition numbers corresponding to the componentwise relative error, which is defined as follows:
Componentwise relative error in the ith solution vector:\[{max\_j}\ \frac{abs(XTRUE(j,i) - X(j,i))}{abs(X(j,i))} \]The array is indexed by the right-hand side i (on which the componentwise relative error depends), and the type of error information as described below. There currently are up to three pieces of information returned for each right-hand side. If componentwise accuracy is not requested (PARAMS(3) = 0.0), then ERR_BNDS_COMP is not accessed. If N_ERR_BNDS < 3, then at most the first (:,N_ERR_BNDS) entries are returned.
The first index in ERR_BNDS_COMP(i,:) corresponds to the ith right-hand side.
The second index in ERR_BNDS_COMP(:,err) contains the following three fields:
err = 1 “Trust/don’t trust” boolean. Trust the answer if the reciprocal condition number is less than the threshold sqrt(n) * slamch(‘Epsilon’).
err = 2 “Guaranteed” error bound: The estimated forward error, almost certainly within a factor of 10 of the true error so long as the next entry is greater than the threshold sqrt(n) * slamch(‘Epsilon’). This error bound should only be trusted if the previous boolean is true.
err = 3 Reciprocal condition number: Estimated componentwise reciprocal condition number. Compared with the threshold sqrt(n) * slamch(‘Epsilon’) to determine if the error estimate is “guaranteed”. These reciprocal condition numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some appropriately scaled matrix Z. Let Z = S*(A*diag(x)), where x is the solution for the current right-hand side and S scales each row of A*diag(x) by a power of the radix so all absolute row sums of Z are approximately 1.
See Lapack Working Note 165 for further details and extra cautions.NPARAMS – [in]
NPARAMS is INTEGER
Specifies the number of parameters set in PARAMS. If <= 0, the PARAMS array is never referenced and default values are used.
PARAMS – [inout]
PARAMS is REAL array, dimension NPARAMS
Specifies algorithm parameters. If an entry is < 0.0, then that entry will be filled with default value used for that parameter. Only positions up to NPARAMS are accessed; defaults are used for higher-numbered parameters.
PARAMS(LA_LINRX_ITREF_I = 1) : Whether to perform iterative refinement or not.
Default: 1.0
= 0.0: No refinement is performed, and no error bounds are computed.
= 1.0: Use the double-precision refinement algorithm, possibly with doubled-single computations if the compilation environment does not support DOUBLE PRECISION.
(other values are reserved for future use)
PARAMS(LA_LINRX_ITHRESH_I = 2) : Maximum number of residual computations allowed for refinement.
Default: 10
Aggressive: Set to 100 to permit convergence using approximate factorizations or factorizations other than LU. If the factorization uses a technique other than Gaussian elimination, the guarantees in err_bnds_norm and err_bnds_comp may no longer be trustworthy.
PARAMS(LA_LINRX_CWISE_I = 3) : Flag determining if the code will attempt to find a solution with small componentwise relative error in the double-precision algorithm. Positive is true, 0.0 is false.
Default: 1.0 (attempt componentwise convergence)
WORK – [out] WORK is REAL array, dimension (4*N)
IWORK – [out] IWORK is INTEGER array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: Successful exit. The solution to every right-hand side is guaranteed.
< 0: If INFO = -i, the i-th argument had an illegal value
> 0 and <= N: U(INFO,INFO) is exactly zero. The factorization has been completed, but the factor U is exactly singular, so the solution and error bounds could not be computed. RCOND = 0 is returned.
= N+J: The solution corresponding to the Jth right-hand side is not guaranteed. The solutions corresponding to other right- hand sides K with K > J may not be guaranteed as well, but only the first such right-hand side is reported. If a small componentwise error is not requested (PARAMS(3) = 0.0) then the Jth right-hand side is the first with a normwise error bound that is not guaranteed (the smallest J such that ERR_BNDS_NORM(J,1) = 0.0). By default (PARAMS(3) = 1.0) the Jth right-hand side is the first with either a normwise or componentwise error bound that is not guaranteed (the smallest J such that either ERR_BNDS_NORM(J,1) = 0.0 or ERR_BNDS_COMP(J,1) = 0.0). See the definition of ERR_BNDS_NORM(:,1) and ERR_BNDS_COMP(:,1). To get information about all of the right-hand sides check ERR_BNDS_NORM or ERR_BNDS_COMP.
-
template<typename T, typename Ta>
void syrfsx(char *uplo, char *equed, integer *n, integer *nrhs, T *a, integer *lda, T *af, integer *ldaf, integer *ipiv, Ta *s, T *b, integer *ldb, T *x, integer *ldx, Ta *rcond, Ta *berr, integer *n_err_bnds, Ta *err_bnds_norm, Ta *err_bnds_comp, integer *nparams, Ta *params, T *work, Ta *rwork, integer *info)#
-
template<typename T>
SYEQUB#
- group syequb
Functions
-
template<typename T>
void syequb(char *uplo, integer *n, T *a, integer *lda, T *s, T *scond, T *amax, T *work, integer *info)# SYEQUB computes row and column scalings intended to equilibrate a symmetric matrix A.
Purpose:
SYEQUB computes row and column scalings intended to equilibrate a symmetric matrix A (with respect to the Euclidean norm) and reduce its condition number. The scale factors S are computed by the BIN algorithm (see references) so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has a condition number within a factor N of the smallest possible condition number over all possible diagonal scalings.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
The N-by-N symmetric matrix whose scaling factors are to be computed.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
S – [out]
S is REAL array, dimension (N)
If INFO = 0, S contains the scale factors for A.
SCOND – [out]
SCOND is REAL
If INFO = 0, S contains the ratio of the smallest S(i) to the largest S(i). If SCOND >= 0.1 and AMAX is neither too large nor too small, it is not worth scaling by S.
AMAX – [out]
AMAX is REAL
Largest absolute value of any matrix element. If AMAX is very close to overflow or very close to underflow, the matrix should be scaled.
WORK – [out] WORK is REAL array, dimension (2*N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, the i-th diagonal element is nonpositive.
-
template<typename T>
SYCONV#
- group syconv
Functions
-
template<typename T>
void syconv(char *uplo, char *way, integer *n, T *a, integer *lda, integer *ipiv, T *work, integer *info)# SYCONV convert A given by TRF into L and D and vice-versa.
Purpose:
SYCONV convert A given by TRF into L and D and vice-versa. Get Non-diag elements of D (returned in workspace) and apply or reverse permutation done in TRF.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
WAY – [in]
WAY is CHARACTER*1
= ‘C’: Convert
= ‘R’: RevertN – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF.
E – [out]
E is REAL array, dimension (N)
E stores the supdiagonal/subdiagonal of the symmetric 1-by-1 or 2-by-2 block diagonal matrix D in LDLT.
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYCON_3#
- group sycon_3
Functions
-
template<typename T>
void sycon_3(char *uplo, integer *n, T *a, integer *lda, T *e, integer *ipiv, T *anorm, T *rcond, T *work, integer *iwork, integer *info)# SYCON_3 estimates the reciprocal of the condition number of a real symmetric matrix A.
Purpose:
SYCON_3 estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization computed by DSYTRF_RK or DSYTRF_BK: A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). This routine uses BLAS3 solver SSYTRS_3.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:
= ‘U’: Upper triangular, form is A = P*U*D*(U**T)*(P**T);
= ‘L’: Lower triangular, form is A = P*L*D*(L**T)*(P**T).
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
Diagonal of the block diagonal matrix D and factors U or L as computed by SSYTRF_RK and SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D should be provided on entry in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [in]
E is REAL array, dimension (N)
On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where If UPLO = ‘U’: E(i) = D(i-1,i),i=2:N, E(1) not referenced; If UPLO = ‘L’: E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = ‘U’ or UPLO = ‘L’ cases.IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF_RK or SSYTRF_BK.
ANORM – [in]
ANORM is REAL
The 1-norm of the original matrix A.
RCOND – [out]
RCOND is REAL
The reciprocal of the condition number of the matrix A, computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an estimate of the 1-norm of inv(A) computed in this routine.
WORK – [out] WORK is REAL array, dimension (2*N)
IWORK – [out] IWORK is INTEGER array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRI2#
- group sytri2
Functions
-
template<typename T>
void sytri2(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *work, integer *lwork, integer *info)# SYTRI2 computes the inverse of a REAL symmetric indefinite matrix
A using the factorization.
Purpose:
SYTRI2 computes the inverse of a REAL symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SYTRF. SYTRI2 sets the LEADING DIMENSION of the workspace before calling SYTRI2X that actually computes the inverse.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF.
On exit, if INFO = 0, the (symmetric) inverse of the original matrix. If UPLO = ‘U’, the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced; if UPLO = ‘L’ the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SYTRF.
WORK – [out] WORK is REAL array, dimension (N+NB+1)*(NB+3)
LWORK – [in]
LWORK is INTEGER
The dimension of the array WORK. WORK is size >= (N+NB+1)*(NB+3)
If LWORK = -1, then a workspace query is assumed; the routine 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 – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.
-
template<typename T>
SYTRI2X#
- group sytri2x
Functions
-
template<typename T>
void sytri2x(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, float *work, integer *nb, integer *info)# SYTRI2X computes the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SYTRF.
Purpose:
SYTRI2X computes the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SYTRF.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the NNB diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF.
On exit, if INFO = 0, the (symmetric) inverse of the original matrix. If UPLO = ‘U’, the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced; if UPLO = ‘L’ the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the NNB structure of D as determined by SYTRF.
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.
-
template<typename T>
SYTRI_3#
- group sytri_3
Functions
-
template<typename T>
void sytri_3(char *uplo, integer *n, T *a, integer *lda, T *e, integer *ipiv, T *work, integer *lwork, integer *info)# SYTRI_3 computes the inverse of a real symmetric indefinite
matrix A using the factorization computed by SYTRF_RK or SYTRF_BK.
Purpose:
SYTRI_3 computes the inverse of a real symmetric indefinite matrix A using the factorization computed by SYTRF_RK or SYTRF_BK: A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. SYTRI_3 sets the leading dimension of the workspace before calling SYTRI_3X that actually computes the inverse. This is the blocked version of the algorithm, calling Level 3 BLAS.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, diagonal of the block diagonal matrix D and factors U or L as computed by SSYTRF_RK and SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D should be provided on entry in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.
On exit, if INFO = 0, the symmetric inverse of the original matrix.
If UPLO = ‘U’: the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced;
If UPLO = ‘L’: the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [in]
E is REAL array, dimension (N)
On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
If UPLO = ‘U’: E(i) = D(i-1,i),i=2:N, E(1) not referenced;
If UPLO = ‘L’: E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = ‘U’ or UPLO = ‘L’ cases.IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF_RK or SSYTRF_BK.
WORK – [out]
WORK is REAL array, dimension (N+NB+1)*(NB+3).
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK – [in]
LWORK is INTEGER
The length of WORK. LWORK >= (N+NB+1)*(NB+3).
If LDWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of 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 – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.
-
template<typename T>
SYTRI_3X#
- group sytri_3x
Functions
-
template<typename T>
void sytri_3x(char *uplo, integer *n, T *a, integer *lda, T *e, integer *ipiv, T *work, integer *nb, integer *info)# SYTRI_3X computes the inverse of a real symmetric indefinite matrix A.
Purpose:
SYTRI_3X computes the inverse of a real symmetric indefinite matrix A using the factorization computed by SSYTRF_RK or SSYTRF_BK: A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, 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:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, diagonal of the block diagonal matrix D and factors U or L as computed by SYTRF_RK and SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D should be provided on entry in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.
On exit, if INFO = 0, the symmetric inverse of the original matrix.
If UPLO = ‘U’: the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced;
If UPLO = ‘L’: the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [in]
E is REAL array, dimension (N)
On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
If UPLO = ‘U’: E(i) = D(i-1,i), i=2:N, E(1) not referenced;
If UPLO = ‘L’: E(i) = D(i+1,i), i=1:N-1, E(N) not referenced.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = ‘U’ or UPLO = ‘L’ cases.IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF_RK or SSYTRF_BK.
WORK – [out] WORK is REAL array, dimension (N+NB+1,NB+3).
NB – [in]
NB is INTEGER
Block size.
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.
-
template<typename T>
SYTRS2#
- group sytrs2
Functions
-
template<typename T>
void sytrs2(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, integer *ipiv, T *b, integer *ldb, T *work, integer *info)# SYTRS2 solves a system of linear equations A*X = B with a real
symmetric matrix A.
Purpose:
SYTRS2 solves a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF and converted by SSYCONV.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF. Note that A is input / output. This might be counter-intuitive, and one may think that A is input only. A is input / output. This is because, at the start of the subroutine, we permute A in a “better” form and then we permute A back to its original form at the end.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF.
B – [inout]
B is REAL array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
WORK – [out] WORK is REAL array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRS_3#
- group sytrs_3
Functions
-
template<typename T>
void sytrs_3(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, T *e, integer *ipiv, T *b, integer *ldb, integer *info)# SYTRS_3 solves a system of linear equations A * X = B with a real
symmetric matrix A.
Purpose:
SYTRS_3 solves a system of linear equations A * X = B with a real symmetric matrix A using the factorization computed by SSYTRF_RK or SSYTRF_BK: A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This algorithm is using Level 3 BLAS.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix:
= ‘U’: Upper triangular, form is A = P*U*D*(U**T)*(P**T);
= ‘L’: Lower triangular, form is A = P*L*D*(L**T)*(P**T).
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
Diagonal of the block diagonal matrix D and factors U or L as computed by SSYTRF_RK and SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D should be provided on entry in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [in]
E is REAL array, dimension (N)
On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
If UPLO = ‘U’: E(i) = D(i-1,i),i=2:N, E(1) not referenced;
If UPLO = ‘L’: E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is not referenced in both UPLO = ‘U’ or UPLO = ‘L’ cases.IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF_RK or SSYTRF_BK.
B – [inout]
B is REAL array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYSWAPR#
- group syswapr
Functions
-
template<typename T>
void syswapr(char *uplo, integer *n, T *a, integer *lda, integer *i1, integer *i2)# SYSWAPR applies an elementary permutation on the rows and columns of a symmetric matrix.
Purpose:
SYSWAPR applies an elementary permutation on the rows and the columns of a symmetric matrix.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the NB diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF.
On exit, if INFO = 0, the (symmetric) inverse of the original matrix. If UPLO = ‘U’, the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced; if UPLO = ‘L’ the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
I1 – [in]
I1 is INTEGER
Index of the first row to swap
I2 – [in]
I2 is INTEGER
Index of the second row to swap
-
template<typename T>
LA_HERCOND_C#
- group la_hercond_c
Functions
-
template<typename T, typename Ta>
Ta la_hercond_c(char *uplo, integer *n, T *a, integer *lda, T *af, integer *ldaf, integer *ipiv, Ta *c, logical *capply, integer *info, T *work, Ta *rwork)# LA_HERCOND_C computes the infinity norm condition number of op(A)*inv(diag(c)) for Hermitian indefinite matrices.
Purpose:
LA_HERCOND_C computes the infinity norm condition number of op(A) * inv(diag(C)) where C is a REAL vector.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The number of linear equations, i.e., the order of the matrix A. N >= 0.
A – [in] A is COMPLEX array, dimension (LDA,N) On entry, the N-by-N matrix A
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
AF – [in]
AF is COMPLEX array, dimension (LDAF,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CHETRF.
LDAF – [in]
LDAF is INTEGER
The leading dimension of the array AF. LDAF >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by CHETRF.
C – [in]
C is REAL array, dimension (N)
The vector C in the formula op(A) * inv(diag(C)).
CAPPLY – [in]
CAPPLY is LOGICAL
If .TRUE. then access the vector C in the formula above.
INFO – [out]
INFO is INTEGER
= 0: Successful exit.
i > 0: The ith argument is invalid.WORK – [out]
WORK is COMPLEX array, dimension (2*N).
Workspace.
RWORK – [out]
RWORK is REAL array, dimension (N).
Workspace.
-
template<typename T, typename Ta>
LA_HERCOND_X#
- group la_hercond_x
Functions
-
template<typename T, typename Ta>
Ta la_hercond_x(char *uplo, integer *n, T *a, integer *lda, T *af, integer *ldaf, integer *ipiv, T *x, integer *info, T *work, Ta *rwork)# LA_HERCOND_X computes the infinity norm condition number of op(A)*diag(x) for Hermitian indefinite matrices.
Purpose:
LA_HERCOND_X computes the infinity norm condition number of op(A) * diag(X) where X is a COMPLEX vector.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The number of linear equations, i.e., the order of the matrix A. N >= 0.
A – [in]
A is COMPLEX array, dimension (LDA,N)
On entry, the N-by-N matrix A.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
AF – [in]
AF is COMPLEX array, dimension (LDAF,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CHETRF.
LDAF – [in]
LDAF is INTEGER
The leading dimension of the array AF. LDAF >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by CHETRF.
X – [in]
X is COMPLEX array, dimension (N)
The vector X in the formula op(A) * diag(X).
INFO – [out]
INFO is INTEGER
= 0: Successful exit.
i > 0: The ith argument is invalid.WORK – [out]
WORK is COMPLEX array, dimension (2*N).
Workspace.
RWORK – [out]
RWORK is REAL array, dimension (N).
Workspace.
-
template<typename T, typename Ta>
LA_HERFSX_EXTENDED#
- group la_herfsx_extended
Functions
-
template<typename T, typename Ta>
void la_herfsx_extended(integer *prec_type, char *uplo, integer *n, integer *nrhs, T *a, integer *lda, T *af, integer *ldaf, integer *ipiv, logical *colequ, Ta *c, T *b, integer *ldb, T *y, integer *ldy, Ta *berr_out, integer *n_norms, Ta *err_bnds_norm, Ta *err_bnds_comp, T *res, Ta *ayb, T *dy, T *y_tail, Ta *rcond, integer *ithresh, Ta *rthresh, Ta *dz_ub, logical *ignore_cwise, integer *info)# LA_HERFSX_EXTENDED improves the computed solution to a system
of linear equations for Hermitian indefinite matrices by performing
extra-precise iterative refinement and provides error bounds and
backward error estimates for the solution.
Purpose:
LA_HERFSX_EXTENDED improves the computed solution to a system of linear equations by performing extra-precise iterative refinement and provides error bounds and backward error estimates for the solution. This subroutine is called by CHERFSX to perform iterative refinement. In addition to normwise error bound, the code provides maximum componentwise error bound if possible. See comments for ERR_BNDS_NORM and ERR_BNDS_COMP for details of the error bounds. Note that this subroutine is only resonsible for setting the second fields of ERR_BNDS_NORM and ERR_BNDS_COMP.
- Parameters:
PREC_TYPE – [in]
PREC_TYPE is INTEGER
Specifies the intermediate precision to be used in refinement.
The value is defined by ILAPREC(P) where P is a CHARACTER and P
= ‘S’: Single
= ‘D’: Double
= ‘I’: Indigenous
= ‘X’ or ‘E’: ExtraUPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The number of linear equations, i.e., the order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right-hand-sides, i.e., the number of columns of the matrix B.
A – [in]
A is COMPLEX array, dimension (LDA,N)
On entry, the N-by-N matrix A.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
AF – [in]
AF is COMPLEX array, dimension (LDAF,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CHETRF.
LDAF – [in]
LDAF is INTEGER
The leading dimension of the array AF. LDAF >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by CHETRF.
COLEQU – [in]
COLEQU is LOGICAL
If .TRUE. then column equilibration was done to A before calling this routine. This is needed to compute the solution and error bounds correctly.
C – [in]
C is REAL array, dimension (N)
The column scale factors for A. If COLEQU = .FALSE., C is not accessed. If C is input, each element of C should be a power of the radix to ensure a reliable solution and error estimates. Scaling by powers of the radix does not cause rounding errors unless the result underflows or overflows. Rounding errors during scaling lead to refining with a matrix that is not equivalent to the input matrix, producing error estimates that may not be reliable.
B – [in]
B is COMPLEX array, dimension (LDB,NRHS)
The right-hand-side matrix B.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
Y – [inout]
Y is COMPLEX array, dimension (LDY,NRHS)
On entry, the solution matrix X, as computed by CHETRS. On exit, the improved solution matrix Y.
LDY – [in]
LDY is INTEGER
The leading dimension of the array Y. LDY >= fla_max(1,N).
BERR_OUT – [out]
BERR_OUT is REAL array, dimension (NRHS)
On exit, BERR_OUT(j) contains the componentwise relative backward error for right-hand-side j from the formula
fla_max(i) (abs(RES(i)) / (abs(op(A_s))*abs(Y) + abs(B_s))(i))
where abs(Z) is the componentwise absolute value of the matrix or vector Z. This is computed by CLA_LIN_BERR.
N_NORMS – [in]
N_NORMS is INTEGER Determines which error bounds to return (see ERR_BNDS_NORM and ERR_BNDS_COMP).
If N_NORMS >= 1 return normwise error bounds.
If N_NORMS >= 2 return componentwise error bounds.ERR_BNDS_NORM – [inout]
ERR_BNDS_NORM is REAL array, dimension (NRHS, N_ERR_BNDS)
For each right-hand side, this array contains information about various error bounds and condition numbers corresponding to the normwise relative error, which is defined as follows:
Normwise relative error in the ith solution vector:\[ \frac{{max\_j}\ abs(XTRUE(j,i) - X(j,i))}{{max\_j}\ abs(X(j,i))} \]The array is indexed by the type of error information as described below. There currently are up to three pieces of information returned.
The first index in ERR_BNDS_NORM(i,:) corresponds to the ith right-hand side.
The second index in ERR_BNDS_NORM(:,err) contains the following three fields:
err = 1 “Trust/don’t trust” boolean. Trust the answer if the reciprocal condition number is less than the threshold sqrt(n) * slamch(‘Epsilon’).
err = 2 “Guaranteed” error bound: The estimated forward error, almost certainly within a factor of 10 of the true error so long as the next entry is greater than the threshold sqrt(n) * slamch(‘Epsilon’). This error bound should only be trusted if the previous boolean is true.
err = 3 Reciprocal condition number: Estimated normwise reciprocal condition number. Compared with the threshold sqrt(n) * slamch(‘Epsilon’) to determine if the error estimate is “guaranteed”. These reciprocal condition numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some appropriately scaled matrix Z. Let Z = S*A, where S scales each row by a power of the radix so all absolute row sums of Z are approximately 1.
This subroutine is only responsible for setting the second field above.
See Lapack Working Note 165 for further details and extra cautions.
ERR_BNDS_COMP – [inout]
ERR_BNDS_COMP is REAL array, dimension (NRHS, N_ERR_BNDS)
For each right-hand side, this array contains information about various error bounds and condition numbers corresponding to the componentwise relative error, which is defined as follows:
Componentwise relative error in the ith solution vector:\[{max\_j}\ \frac{abs(XTRUE(j,i) - X(j,i))}{abs(X(j,i))} \]The array is indexed by the right-hand side i (on which the componentwise relative error depends), and the type of error information as described below. There currently are up to three pieces of information returned for each right-hand side. If componentwise accuracy is not requested (PARAMS(3) = 0.0), then ERR_BNDS_COMP is not accessed. If N_ERR_BNDS < 3, then at most the first (:,N_ERR_BNDS) entries are returned.
The first index in ERR_BNDS_COMP(i,:) corresponds to the ith right-hand side.
The second index in ERR_BNDS_COMP(:,err) contains the following three fields:
err = 1 “Trust/don’t trust” boolean. Trust the answer if the reciprocal condition number is less than the threshold sqrt(n) * slamch(‘Epsilon’).
err = 2 “Guaranteed” error bound: The estimated forward error, almost certainly within a factor of 10 of the true error so long as the next entry is greater than the threshold sqrt(n) * slamch(‘Epsilon’). This error bound should only be trusted if the previous boolean is true.
err = 3 Reciprocal condition number: Estimated componentwise reciprocal condition number. Compared with the threshold sqrt(n) * slamch(‘Epsilon’) to determine if the error estimate is “guaranteed”. These reciprocal condition numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some appropriately scaled matrix Z. Let Z = S*(A*diag(x)), where x is the solution for the current right-hand side and S scales each row of A*diag(x) by a power of the radix so all absolute row sums of Z are approximately 1.
This subroutine is only responsible for setting the second field above.
See Lapack Working Note 165 for further details and extra cautions.
RES – [in]
RES is COMPLEX array, dimension (N)
Workspace to hold the intermediate residual.
AYB – [in]
AYB is REAL array, dimension (N)
Workspace.
DY – [in]
DY is COMPLEX array, dimension (N)
Workspace to hold the intermediate solution.
Y_TAIL – [in]
Y_TAIL is COMPLEX array, dimension (N)
Workspace to hold the trailing bits of the intermediate solution.
RCOND – [in]
RCOND is REAL
Reciprocal scaled condition number. This is an estimate of the reciprocal Skeel condition number of the matrix A after equilibration (if done). If this is less than the machine precision (in particular, if it is zero), the matrix is singular to working precision. Note that the error may still be small even if this number is very small and the matrix appears ill- conditioned.
ITHRESH – [in]
ITHRESH is INTEGER
The maximum number of residual computations allowed for refinement. The default is 10. For ‘aggressive’ set to 100 to permit convergence using approximate factorizations or factorizations other than LU. If the factorization uses a technique other than Gaussian elimination, the guarantees in ERR_BNDS_NORM and ERR_BNDS_COMP may no longer be trustworthy.
RTHRESH – [in]
RTHRESH is REAL
Determines when to stop refinement if the error estimate stops decreasing. Refinement will stop when the next solution no longer satisfies norm(dx_{i+1}) < RTHRESH * norm(dx_i) where norm(Z) is the infinity norm of Z. RTHRESH satisfies 0 < RTHRESH <= 1. The default value is 0.5. For ‘aggressive’ set to 0.9 to permit convergence on extremely ill-conditioned matrices. See LAWN 165 for more details.
DZ_UB – [in]
DZ_UB is REAL
Determines when to start considering componentwise convergence. Componentwise convergence is only considered after each component of the solution Y is stable, which we definte as the relative change in each component being less than DZ_UB. The default value is 0.25, requiring the first bit to be stable. See LAWN 165 for more details.
IGNORE_CWISE – [in]
IGNORE_CWISE is LOGICAL
If .TRUE. then ignore componentwise convergence. Default value is .FALSE..
INFO – [out]
INFO is INTEGER
= 0: Successful exit.
< 0: if INFO = -i, the ith argument to CLA_HERFSX_EXTENDED had an illegal value
-
template<typename T, typename Ta>
LA_HERPVGRW#
- group la_herpvgrw
Functions
-
template<typename T, typename Ta>
Ta la_herpvgrw(char *uplo, integer *n, integer *info, T *a, integer *lda, T *af, integer *ldaf, integer *ipiv, Ta *work)# LA_HERPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U)
Purpose:
LA_HERPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U). The "max absolute element" norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix A could be poor. This also means that the solution X, estimated condition numbers, and error bounds could be unreliable.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The number of linear equations, i.e., the order of the matrix A. N >= 0.
INFO – [in]
INFO is INTEGER
The value of INFO returned from SSYTRF, .i.e., the pivot in column INFO is exactly 0.
A – [in]
A is COMPLEX array, dimension (LDA,N)
On entry, the N-by-N matrix A.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
AF – [in]
AF is COMPLEX array, dimension (LDAF,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CHETRF.
LDAF – [in]
LDAF is INTEGER
The leading dimension of the array AF. LDAF >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by CHETRF.
WORK – [out] WORK is REAL array, dimension (2*N)
-
template<typename T, typename Ta>
HPCON#
- group hpcon
Functions
-
template<typename T>
void spcon(char *uplo, integer *n, T *ap, integer *ipiv, T *anorm, T *rcond, T *work, integer *iwork, integer *info)# SPCON estimates the reciprocal of the condition number.
Purpose:
SPCON estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
AP – [in]
AP is REAL array, dimension (N*(N+1)/2)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSPTRF, stored as a packed triangular matrix.
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSPTRF.
ANORM – [in]
ANORM is REAL
The 1-norm of the original matrix A.
RCOND – [out]
RCOND is REAL
The reciprocal of the condition number of the matrix A, computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an estimate of the 1-norm of inv(A) computed in this routine.
WORK – [out] WORK is REAL array, dimension (2*N)
IWORK – [out] IWORK is INTEGER array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SPTRF#
- group sptrf
Functions
-
template<typename T>
void sptrf(char *uplo, integer *n, T *ap, integer *ipiv, integer *info)# SPTRF computes the factorization of a real symmetric matrix A.
Purpose:
SPTRF computes the factorization of a real symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method: 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.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
AP – [inout]
AP is REAL array, dimension (N*(N+1)/2)
On entry, the upper or lower triangle of the symmetric matrix A, packed columnwise in a linear array. The j-th column of A is stored in the array AP as follows:
if UPLO = ‘U’, AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
if UPLO = ‘L’, AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n.
On exit, the block diagonal matrix D and the multipliers used to obtain the factor U or L, stored as a packed triangular matrix overwriting A (see below for further details).IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D. If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If UPLO = ‘U’ and IPIV(k) = IPIV(k-1) < 0, then rows and columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k) is a 2-by-2 diagonal block. If UPLO = ‘L’ and IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.INFO – [out]
INFO is INTEGER
= 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. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
-
template<typename T>
SPTRS#
- group sptrs
Functions
-
template<typename T>
void sptrs(char *uplo, integer *n, integer *nrhs, T *ap, integer *ipiv, T *b, integer *ldb, integer *info)# SPTRS solves a system of linear equations A*X = B.
Purpose:
SPTRS solves a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
AP – [in]
AP is REAL array, dimension (N*(N+1)/2)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSPTRF, stored as a packed triangular matrix.
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSPTRF.
B – [inout]
B is REAL array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SPTRI#
- group sptri
Functions
-
template<typename T>
void sptri(char *uplo, integer *n, T *ap, integer *ipiv, T *work, integer *info)# SPTRI computes the inverse of a real symmetric indefinite matrix A.
Purpose:
SPTRI computes the inverse of a real symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by SPTRF.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
AP – [inout]
AP is REAL array, dimension (N*(N+1)/2)
On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSPTRF, stored as a packed triangular matrix.
On exit, if INFO = 0, the (symmetric) inverse of the original matrix, stored as a packed triangular matrix. The j-th column of inv(A) is stored in the array AP as follows:
if UPLO = ‘U’, AP(i + (j-1)*j/2) = inv(A)(i,j) for 1<=i<=j;
if UPLO = ‘L’, AP(i + (j-1)*(2n-j)/2) = inv(A)(i,j) for j<=i<=n.IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SPTRF.
WORK – [out] WORK is REAL array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.
-
template<typename T>
SPRFS#
- group sprfs
Functions
-
template<typename T>
void sprfs(char *uplo, integer *n, integer *nrhs, T *ap, T *afp, integer *ipiv, T *b, integer *ldb, T *x, integer *ldx, T *ferr, T *berr, T *work, integer *iwork, integer *info)# SPRFS improves the computed solution to a system of linear equations
when the coefficient matrix is symmetric indefinite and packed.
Purpose:
SPRFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
AP – [in]
AP is REAL array, dimension (N*(N+1)/2)
The upper or lower triangle of the symmetric matrix A, packed columnwise in a linear array. The j-th column of A is stored in the array AP as follows:
if UPLO = ‘U’, AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
if UPLO = ‘L’, AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n.
AFP – [in]
AFP is REAL array, dimension (N*(N+1)/2)
The factored form of the matrix A. AFP contains the block diagonal matrix D and the multipliers used to obtain the factor U or L from the factorization A = U*D*U**T or A = L*D*L**T as computed by SSPTRF, stored as a packed triangular matrix.
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSPTRF.
B – [in]
B is REAL array, dimension (LDB,NRHS)
The right hand side matrix B.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
X – [inout]
X is REAL array, dimension (LDX,NRHS)
On entry, the solution matrix X, as computed by SSPTRS. On exit, the improved solution matrix X.
LDX – [in]
LDX is INTEGER
The leading dimension of the array X. LDX >= fla_max(1,N).
FERR – [out]
FERR is REAL array, dimension (NRHS)
The estimated forward error bound for each solution vector X(j) (the j-th column of the solution matrix X). If XTRUE is the true solution corresponding to X(j), FERR(j) is an estimated upper bound for the magnitude of the largest element in (X(j) - XTRUE) divided by the magnitude of the largest element in X(j). The estimate is as reliable as the estimate for RCOND, and is almost always a slight overestimate of the true error.
BERR – [out]
BERR is REAL array, dimension (NRHS)
The componentwise relative backward error of each solution vector X(j) (i.e., the smallest relative change in any element of A or B that makes X(j) an exact solution).
WORK – [out] WORK is REAL array, dimension (3*N)
IWORK – [out] IWORK is INTEGER array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
HECON_ROOK#
- group hecon_rook
Functions
-
template<typename T, typename Ta>
void hecon_rook(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, Ta *anorm, Ta *rcond, T *work, integer *info)# HECON_ROOK estimates the reciprocal of the condition number fort HE matrices
using factorization obtained with one of the bounded diagonal pivoting methods (max 2 interchanges)
Purpose:
HECON_ROOK estimates the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF_ROOK. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**H;
= ‘L’: Lower triangular, form is A = L*D*L**H.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [in]
A is COMPLEX array, dimension (LDA,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CHETRF_ROOK.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by CHETRF_ROOK.
ANORM – [in]
ANORM is REAL
The 1-norm of the original matrix A.
RCOND – [out]
RCOND is REAL
The reciprocal of the condition number of the matrix A, computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an estimate of the 1-norm of inv(A) computed in this routine.
WORK – [out] WORK is COMPLEX array, dimension (2*N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T, typename Ta>
SYCON_ROOK#
- group sycon_rook
Functions
-
template<typename T>
void sycon_rook(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *anorm, T *rcond, T *work, integer *iwork, integer *info)# SYCON_ROOK estimates the reciprocal of the condition number of a real symmetric matrix A.
Purpose:
SYCON_ROOK estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF_ROOK. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF_ROOK.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF_ROOK.
ANORM – [in]
ANORM is REAL
The 1-norm of the original matrix A.
RCOND – [out]
RCOND is REAL
The reciprocal of the condition number of the matrix A, computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an estimate of the 1-norm of inv(A) computed in this routine.
WORK – [out] WORK is REAL array, dimension (2*N)
IWORK – [out] IWORK is INTEGER array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRF_HOOK#
- group sytrf_hook
Functions
-
template<typename T>
void sytrf_rook(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *work, integer *lwork, integer *info)# SYTRF_ROOK computes the factorization of a real symmetric matrix A
using the bounded Bunch-Kaufman (“rook”) diagonal pivoting method.
Purpose:
SYTRF_ROOK computes the factorization of a real symmetric matrix A using the bounded Bunch-Kaufman ("rook") 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:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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 block diagonal matrix D and the multipliers used to obtain the factor U or L (see below for further details).LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D.
If UPLO = ‘U’:
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) < 0 and IPIV(k-1) < 0, then rows and columns k and -IPIV(k) were interchanged and rows and columns k-1 and -IPIV(k-1) were inerchaged, D(k-1:k,k-1:k) is a 2-by-2 diagonal block.
If UPLO = ‘L’:
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) < 0 and IPIV(k+1) < 0, then rows and columns k and -IPIV(k) were interchanged and rows and columns k+1 and -IPIV(k+1) were inerchaged, D(k:k+1,k:k+1) is a 2-by-2 diagonal block.
WORK – [out]
WORK is REAL array, dimension (MAX(1,LWORK)).
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK – [in]
LWORK is INTEGER
The length of WORK. LWORK >=1. For best performance LWORK >= N*NB, where NB is the block size 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 – [out]
INFO is INTEGER
= 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. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
-
template<typename T>
LASYF_ROOK#
- group lasyf_rook
Functions
-
template<typename T>
void lasyf_rook(char *uplo, integer *n, integer *nb, integer *kb, T *a, integer *lda, integer *ipiv, T *w, integer *ldw, integer *info)# LASYF_ROOK computes a partial factorization of a real symmetric
matrix using the bounded Bunch-Kaufman (“rook”) diagonal pivoting method.
Purpose:
LASYF_ROOK computes a partial factorization of a real symmetric matrix A using the bounded Bunch-Kaufman ("rook") diagonal pivoting method. The partial factorization has the form: A = (I U12) (A11 0 ) ( I 0 ) if UPLO = 'U', or: (0 U22) ( 0 D ) (U12**T U22**T) A = (L11 0) ( D 0 ) (L11**T L21**T) if UPLO = 'L' (L21 I) ( 0 A22) ( 0 I ) where the order of D is at most NB. The actual order is returned in the argument KB, and is either NB or NB-1, or N if N <= NB. SLASYF_ROOK is an auxiliary routine called by SSYTRF_ROOK. It uses blocked code (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or A22 (if UPLO = 'L').
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
= ‘U’: Upper triangular
= ‘L’: Lower triangular
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NB – [in]
NB is INTEGER
The maximum number of columns of the matrix A that should be factored. NB should be at least 2 to allow for 2-by-2 pivot blocks.
KB – [out]
KB is INTEGER
The number of columns of A that were actually factored. KB is either NB-1 or NB, or N if N <= NB.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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, A contains details of the partial factorization.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D.
If UPLO = ‘U’:
Only the last KB elements of IPIV are set.
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) < 0 and IPIV(k-1) < 0, then rows and columns k and -IPIV(k) were interchanged and rows and columns k-1 and -IPIV(k-1) were inerchaged, D(k-1:k,k-1:k) is a 2-by-2 diagonal block.
If UPLO = ‘L’:
Only the first KB elements of IPIV are set.
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) < 0 and IPIV(k+1) < 0, then rows and columns k and -IPIV(k) were interchanged and rows and columns k+1 and -IPIV(k+1) were inerchaged, D(k:k+1,k:k+1) is a 2-by-2 diagonal block.
W – [out] W is REAL array, dimension (LDW,NB)
LDW – [in]
LDW is INTEGER
The leading dimension of the array W. LDW >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
> 0: if INFO = k, D(k,k) is exactly zero. The factorization has been completed, but the block diagonal matrix D is exactly singular.
-
template<typename T>
SYTF2_ROOK#
- group sytf2_rook
Functions
-
template<typename T>
void sytf2_rook(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, integer *info)# SYTF2_ROOK computes the factorization of a real symmetric indefinite
matrix using the bounded Bunch-Kaufman (“rook”) diagonal pivoting method.
Purpose:
SYTF2_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 where U (or L) is a product of permutation and unit upper (lower) triangular matrices, U**T is the transpose of U, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This is the unblocked version of the algorithm, calling Level 2 BLAS.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
= ‘U’: Upper triangular
= ‘L’: Lower triangular
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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 block diagonal matrix D and the multipliers used to obtain the factor U or L (see below for further details).LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D.
If UPLO = ‘U’:
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) < 0 and IPIV(k-1) < 0, then rows and columns k and -IPIV(k) were interchanged and rows and columns k-1 and -IPIV(k-1) were inerchaged, D(k-1:k,k-1:k) is a 2-by-2 diagonal block.
If UPLO = ‘L’:
If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
If IPIV(k) < 0 and IPIV(k+1) < 0, then rows and columns k and -IPIV(k) were interchanged and rows and columns k+1 and -IPIV(k+1) were inerchaged, D(k:k+1,k:k+1) is a 2-by-2 diagonal block.
INFO – [out]
INFO is INTEGER
= 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. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
-
template<typename T>
SYTRI_ROOK#
- group sytri_rook
Functions
-
template<typename T>
void sytri_rook(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *work, integer *info)# SYTRI_ROOK computes the inverse of a real symmetric matrix A.
Purpose:
SYTRI_ROOK computes the inverse of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF_ROOK.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U*D*U**T;
= ‘L’: Lower triangular, form is A = L*D*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by SSYTRF_ROOK.
On exit, if INFO = 0, the (symmetric) inverse of the original matrix. If UPLO = ‘U’, the upper triangular part of the inverse is formed and the part of A below the diagonal is not referenced; if UPLO = ‘L’ the lower triangular part of the inverse is formed and the part of A above the diagonal is not referenced.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSYTRF_ROOK.
WORK – [out] WORK is REAL array, dimension (N)
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.
-
template<typename T>
SYTRF_RK#
- group sytrf_rk
Functions
-
template<typename T>
void sytrf_rk(char *uplo, integer *n, T *a, integer *lda, T *e, integer *ipiv, T *work, integer *lwork, integer *info)# SYTRF_RK computes the factorization of a real symmetric indefinite matrix
using the bounded Bunch-Kaufman (rook) diagonal pivoting method (BLAS3 blocked algorithm).
Purpose:
SYTRF_RK computes the factorization of a real symmetric matrix A using the bounded Bunch-Kaufman (rook) diagonal pivoting method: A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, 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. For more information see Further Details section.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
= ‘U’: Upper triangular
= ‘L’: Lower triangular
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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, contains:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [out]
E is REAL array, dimension (N)
On exit, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
If UPLO = ‘U’: E(i) = D(i-1,i), i=2:N, E(1) is set to 0;
If UPLO = ‘L’: E(i) = D(i+1,i), i=1:N-1, E(N) is set to 0.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is set to 0 in both UPLO = ‘U’ or UPLO = ‘L’ cases.IPIV – [out]
IPIV is INTEGER array, dimension (N)
IPIV describes the permutation matrix P in the factorization of matrix A as follows. The absolute value of IPIV(k) represents the index of row and column that were interchanged with the k-th row and column. The value of UPLO describes the order in which the interchanges were applied. Also, the sign of IPIV represents the block structure of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks which correspond to 1 or 2 interchanges at each factorization step. For more info see Further Details section.
If UPLO = ‘U’, ( in factorization order, k decreases from N to 1):
a) A single positive entry IPIV(k) > 0 means: D(k,k) is a 1-by-1 diagonal block. If IPIV(k) != k, rows and columns k and IPIV(k) were interchanged in the matrix A(1:N,1:N); If IPIV(k) = k, no interchange occurred.
b) A pair of consecutive negative entries IPIV(k) < 0 and IPIV(k-1) < 0 means: D(k-1:k,k-1:k) is a 2-by-2 diagonal block. (NOTE: negative entries in IPIV appear ONLY in pairs).
1) If -IPIV(k) != k, rows and columns k and -IPIV(k) were interchanged in the matrix A(1:N,1:N). If -IPIV(k) = k, no interchange occurred.
2) If -IPIV(k-1) != k-1, rows and columns k-1 and -IPIV(k-1) were interchanged in the matrix A(1:N,1:N). If -IPIV(k-1) = k-1, no interchange occurred.
c) In both cases a) and b), always ABS( IPIV(k)) <= k.
d) NOTE: Any entry IPIV(k) is always NONZERO on output.
If UPLO = ‘L’, ( in factorization order, k increases from 1 to N):
a) A single positive entry IPIV(k) > 0 means: D(k,k) is a 1-by-1 diagonal block. If IPIV(k) != k, rows and columns k and IPIV(k) were interchanged in the matrix A(1:N,1:N). If IPIV(k) = k, no interchange occurred.
b) A pair of consecutive negative entries IPIV(k) < 0 and IPIV(k+1) < 0 means: D(k:k+1,k:k+1) is a 2-by-2 diagonal block. (NOTE: negative entries in IPIV appear ONLY in pairs).
1) If -IPIV(k) != k, rows and columns k and -IPIV(k) were interchanged in the matrix A(1:N,1:N). If -IPIV(k) = k, no interchange occurred.
2) If -IPIV(k+1) != k+1, rows and columns k-1 and -IPIV(k-1) were interchanged in the matrix A(1:N,1:N). If -IPIV(k+1) = k+1, no interchange occurred.
c) In both cases a) and b), always ABS( IPIV(k)) >= k.
d) NOTE: Any entry IPIV(k) is always NONZERO on output.
WORK – [out]
WORK is REAL array, dimension ( MAX(1,LWORK) ).
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK – [in]
LWORK is INTEGER
The length of WORK. LWORK >=1. For best performance LWORK >= N*NB, where NB is the block size 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 – [out]
INFO is INTEGER
= 0: successful exit
< 0: If INFO = -k, the k-th argument had an illegal value
> 0: If INFO = k, the matrix A is singular, because: If UPLO = ‘U’: column k in the upper triangular part of A contains all zeros. If UPLO = ‘L’: column k in the lower triangular part of A contains all zeros.
Therefore D(k,k) is exactly zero, and superdiagonal elements of column k of U (or subdiagonal elements of column k of L ) are all zeros. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
NOTE: INFO only stores the first occurrence of a singularity, any subsequent occurrence of singularity is not stored in INFO even though the factorization always completes.
-
template<typename T>
LASYF_RK#
- group lasyf_rk
Functions
-
template<typename T>
void lasyf_rk(char *uplo, integer *n, integer *nb, integer *kb, T *a, integer *lda, T *e, integer *ipiv, T *w, integer *ldw, integer *info)# LASYF_RK computes a partial factorization of a real symmetric indefinite
matrix using bounded Bunch-Kaufman (rook) diagonal pivoting method.
Purpose:
LASYF_RK computes a partial factorization of a real symmetric matrix A using the bounded Bunch-Kaufman (rook) diagonal pivoting method. The partial factorization has the form: A = (I U12) (A11 0 ) ( I 0 ) if UPLO = 'U', or: (0 U22) ( 0 D ) (U12**T U22**T) A = (L11 0) ( D 0 ) (L11**T L21**T) if UPLO = 'L', (L21 I) ( 0 A22) ( 0 I ) where the order of D is at most NB. The actual order is returned in the argument KB, and is either NB or NB-1, or N if N <= NB. LASYF_RK is an auxiliary routine called by SSYTRF_RK. It uses blocked code (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or A22 (if UPLO = 'L').
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
= ‘U’: Upper triangular
= ‘L’: Lower triangular
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NB – [in]
NB is INTEGER
The maximum number of columns of the matrix A that should be factored. NB should be at least 2 to allow for 2-by-2 pivot blocks.
KB – [out]
KB is INTEGER
The number of columns of A that were actually factored. KB is either NB-1 or NB, or N if N <= NB.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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, contains:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [out]
E is REAL array, dimension (N)
On exit, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
If UPLO = ‘U’: E(i) = D(i-1,i), i=2:N, E(1) is set to 0;
If UPLO = ‘L’: E(i) = D(i+1,i), i=1:N-1, E(N) is set to 0.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is set to 0 in both UPLO = ‘U’ or UPLO = ‘L’ cases.IPIV – [out]
IPIV is INTEGER array, dimension (N)
IPIV describes the permutation matrix P in the factorization of matrix A as follows. The absolute value of IPIV(k) represents the index of row and column that were interchanged with the k-th row and column. The value of UPLO describes the order in which the interchanges were applied. Also, the sign of IPIV represents the block structure of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks which correspond to 1 or 2 interchanges at each factorization step.
If UPLO = ‘U’, (in factorization order, k decreases from N to 1):
a) A single positive entry IPIV(k) > 0 means: D(k,k) is a 1-by-1 diagonal block. If IPIV(k) != k, rows and columns k and IPIV(k) were interchanged in the submatrix A(1:N,N-KB+1:N); If IPIV(k) = k, no interchange occurred.
b) A pair of consecutive negative entries IPIV(k) < 0 and IPIV(k-1) < 0 means: D(k-1:k,k-1:k) is a 2-by-2 diagonal block. (NOTE: negative entries in IPIV appear ONLY in pairs).
1) If -IPIV(k) != k, rows and columns k and -IPIV(k) were interchanged in the matrix A(1:N,N-KB+1:N). If -IPIV(k) = k, no interchange occurred.
2) If -IPIV(k-1) != k-1, rows and columns k-1 and -IPIV(k-1) were interchanged in the submatrix A(1:N,N-KB+1:N). If -IPIV(k-1) = k-1, no interchange occurred.
c) In both cases a) and b) is always ABS(IPIV(k)) <= k.
d) NOTE: Any entry IPIV(k) is always NONZERO on output.
If UPLO = ‘L’, (in factorization order, k increases from 1 to N):
a) A single positive entry IPIV(k) > 0 means: D(k,k) is a 1-by-1 diagonal block. If IPIV(k) != k, rows and columns k and IPIV(k) were interchanged in the submatrix A(1:N,1:KB). If IPIV(k) = k, no interchange occurred.
b) A pair of consecutive negative entries IPIV(k) < 0 and IPIV(k+1) < 0 means: D(k:k+1,k:k+1) is a 2-by-2 diagonal block. (NOTE: negative entries in IPIV appear ONLY in pairs).
1) If -IPIV(k) != k, rows and columns k and -IPIV(k) were interchanged in the submatrix A(1:N,1:KB). If -IPIV(k) = k, no interchange occurred.
2) If -IPIV(k+1) != k+1, rows and columns k-1 and -IPIV(k-1) were interchanged in the submatrix A(1:N,1:KB). If -IPIV(k+1) = k+1, no interchange occurred.
c) In both cases a) and b) is always ABS(IPIV(k)) >= k.
d) NOTE: Any entry IPIV(k) is always NONZERO on output.
W – [out] W is REAL array, dimension (LDW,NB)
LDW – [in]
LDW is INTEGER
The leading dimension of the array W. LDW >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: If INFO = -k, the k-th argument had an illegal value
> 0: If INFO = k, the matrix A is singular, because:
If UPLO = ‘U’: column k in the upper triangular part of A contains all zeros.
If UPLO = ‘L’: column k in the lower triangular part of A contains all zeros.
Therefore D(k,k) is exactly zero, and superdiagonal elements of column k of U (or subdiagonal elements of column k of L) are all zeros. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
NOTE: INFO only stores the first occurrence of a singularity, any subsequent occurrence of singularity is not stored in INFO even though the factorization always completes.
-
template<typename T>
SYTF2_RK#
- group sytf2_rk
Functions
-
template<typename T>
void sytf2_rk(char *uplo, integer *n, T *a, integer *lda, T *e, integer *ipiv, integer *info)# SYTF2_RK computes the factorization of a real symmetric indefinite
matrix using the bounded Bunch-Kaufman (rook) diagonal pivoting method.
Purpose:
SYTF2_RK computes the factorization of a real symmetric matrix A using the bounded Bunch-Kaufman (rook) diagonal pivoting method: A = P*U*D*(U**T)*(P**T) or A = P*L*D*(L**T)*(P**T), where U (or L) is unit upper (or lower) triangular matrix, U**T (or L**T) is the transpose of U (or L), P is a permutation matrix, P**T is the transpose of P, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This is the unblocked version of the algorithm, calling Level 2 BLAS. For more information see Further Details section.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
= ‘U’: Upper triangular
= ‘L’: Lower triangular
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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, contains:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A.
If UPLO = ‘L’: factor L in the subdiagonal part of A.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [out]
E is REAL array, dimension (N)
On exit, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where If UPLO = ‘U’: E(i) = D(i-1,i), i=2:N, E(1) is set to 0; If UPLO = ‘L’: E(i) = D(i+1,i), i=1:N-1, E(N) is set to 0.
NOTE: For 1-by-1 diagonal block D(k), where 1 <= k <= N, the element E(k) is set to 0 in both UPLO = ‘U’ or UPLO = ‘L’ cases.IPIV – [out]
IPIV is INTEGER array, dimension (N)
IPIV describes the permutation matrix P in the factorization of matrix A as follows. The absolute value of IPIV(k) represents the index of row and column that were interchanged with the k-th row and column. The value of UPLO describes the order in which the interchanges were applied. Also, the sign of IPIV represents the block structure of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks which correspond to 1 or 2 interchanges at each factorization step. For more info see Further Details section.
If UPLO = ‘U’, (in factorization order, k decreases from N to 1):
a) A single positive entry IPIV(k) > 0 means: D(k,k) is a 1-by-1 diagonal block. If IPIV(k) != k, rows and columns k and IPIV(k) were interchanged in the matrix A(1:N,1:N); If IPIV(k) = k, no interchange occurred.
b) A pair of consecutive negative entries IPIV(k) < 0 and IPIV(k-1) < 0 means: D(k-1:k,k-1:k) is a 2-by-2 diagonal block. (NOTE: negative entries in IPIV appear ONLY in pairs).
1) If -IPIV(k) != k, rows and columns k and -IPIV(k) were interchanged in the matrix A(1:N,1:N). If -IPIV(k) = k, no interchange occurred.
2) If -IPIV(k-1) != k-1, rows and columns k-1 and -IPIV(k-1) were interchanged in the matrix A(1:N,1:N). If -IPIV(k-1) = k-1, no interchange occurred.
c) In both cases a) and b), always ABS(IPIV(k)) <= k.
d) NOTE: Any entry IPIV(k) is always NONZERO on output.
If UPLO = ‘L’, (in factorization order, k increases from 1 to N):
a) A single positive entry IPIV(k) > 0 means: D(k,k) is a 1-by-1 diagonal block. If IPIV(k) != k, rows and columns k and IPIV(k) were interchanged in the matrix A(1:N,1:N). If IPIV(k) = k, no interchange occurred.
b) A pair of consecutive negative entries IPIV(k) < 0 and IPIV(k+1) < 0 means: D(k:k+1,k:k+1) is a 2-by-2 diagonal block. (NOTE: negative entries in IPIV appear ONLY in pairs).
1) If -IPIV(k) != k, rows and columns k and -IPIV(k) were interchanged in the matrix A(1:N,1:N). If -IPIV(k) = k, no interchange occurred.
2) If -IPIV(k+1) != k+1, rows and columns k-1 and -IPIV(k-1) were interchanged in the matrix A(1:N,1:N). If -IPIV(k+1) = k+1, no interchange occurred.
c) In both cases a) and b), always ABS(IPIV(k)) >= k.
d) NOTE: Any entry IPIV(k) is always NONZERO on output.
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: If INFO = -k, the k-th argument had an illegal value
> 0: If INFO = k, the matrix A is singular, because:
If UPLO = ‘U’: column k in the upper triangular part of A contains all zeros.
If UPLO = ‘L’: column k in the lower triangular part of A contains all zeros.
Therefore D(k,k) is exactly zero, and superdiagonal elements of column k of U (or subdiagonal elements of column k of L) are all zeros. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
NOTE: INFO only stores the first occurrence of a singularity, any subsequent occurrence of singularity is not stored in INFO even though the factorization always completes.
-
template<typename T>
SYCONVF#
- group syconvf
Functions
-
template<typename T>
void syconvf(char *uplo, char *way, integer *n, T *a, integer *lda, T *e, integer *ipiv, integer *info)# SYCONVF converts the factorization output format.
Purpose:
If parameter WAY = 'C': SYCONVF converts the factorization output format used in SYTRF provided on entry in parameter A into the factorization output format used in SYTRF_RK (or SYTRF_BK) that is stored on exit in parameters A and E. It also coverts in place details of the intechanges stored in IPIV from the format used in SYTRF into the format used in SYTRF_RK (or SYTRF_BK). If parameter WAY = 'R': SYCONVF performs the conversion in reverse direction, i.e. converts the factorization output format used in SYTRF_RK (or SYTRF_BK) provided on entry in parameters A and E into the factorization output format used in SSYTRF that is stored on exit in parameter A. It also coverts in place details of the intechanges stored in IPIV from the format used in SYTRF_RK (or SYTRF_BK) into the format used in SYTRF.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix A.
= ‘U’: Upper triangular
= ‘L’: Lower triangular
WAY – [in]
WAY is CHARACTER*1
= ‘C’: Convert
= ‘R’: RevertN – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
1) If WAY =’C’:
On entry, contains factorization details in format used in SSYTRF:
a) all elements of the symmetric block diagonal matrix D on the diagonal of A and on superdiagonal (or subdiagonal) of A, and
b) If UPLO = ‘U’: multipliers used to obtain factor U in the superdiagonal part of A. If UPLO = ‘L’: multipliers used to obtain factor L in the superdiagonal part of A.
On exit, contains factorization details in format used in SSYTRF_RK or SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A.
If UPLO = ‘L’: factor L in the subdiagonal part of A.
2) If WAY = ‘R’:
On entry, contains factorization details in format used in SSYTRF_RK or SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A.
If UPLO = ‘L’: factor L in the subdiagonal part of A.
On exit, contains factorization details in format used in SSYTRF:
a) all elements of the symmetric block diagonal matrix D on the diagonal of A and on superdiagonal (or subdiagonal) of A, and
b) If UPLO = ‘U’: multipliers used to obtain factor U in the superdiagonal part of A. If UPLO = ‘L’: multipliers used to obtain factor L in the superdiagonal part of A.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [inout]
E is REAL array, dimension (N)
1) If WAY =’C’:
On entry, just a workspace.
On exit, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where If UPLO = ‘U’: E(i) = D(i-1,i), i=2:N, E(1) is set to 0; If UPLO = ‘L’: E(i) = D(i+1,i), i=1:N-1, E(N) is set to 0.
2) If WAY = ‘R’:
On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where If UPLO = ‘U’: E(i) = D(i-1,i),i=2:N, E(1) not referenced; If UPLO = ‘L’: E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
On exit, is not changedIPIV – [inout]
IPIV is INTEGER array, dimension (N)
1) If WAY =’C’:
On entry, details of the interchanges and the block structure of D in the format used in SSYTRF.
On exit, details of the interchanges and the block structure of D in the format used in SSYTRF_RK (or SSYTRF_BK).
1) If WAY =’R’:
On entry, details of the interchanges and the block structure of D in the format used in SSYTRF_RK (or SSYTRF_BK).
On exit, details of the interchanges and the block structure of D in the format used in SSYTRF.INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYCONVF_ROOK#
- group syconvf_rook
Functions
-
template<typename T>
void syconvf_rook(char *uplo, char *way, integer *n, T *a, integer *lda, T *e, integer *ipiv, integer *info)# SYCONVF_ROOK converts the factorization output format.
Purpose:
If parameter WAY = 'C': SSYCONVF_ROOK converts the factorization output format used in SSYTRF_ROOK provided on entry in parameter A into the factorization output format used in SSYTRF_RK (or SSYTRF_BK) that is stored on exit in parameters A and E. IPIV format for SSYTRF_ROOK and SSYTRF_RK (or SSYTRF_BK) is the same and is not converted. If parameter WAY = 'R': SSYCONVF_ROOK performs the conversion in reverse direction, i.e. converts the factorization output format used in SSYTRF_RK (or SSYTRF_BK) provided on entry in parameters A and E into the factorization output format used in SSYTRF_ROOK that is stored on exit in parameter A. IPIV format for SSYTRF_ROOK and SSYTRF_RK (or SSYTRF_BK) is the same and is not converted.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix A.
= ‘U’: Upper triangular
= ‘L’: Lower triangular
WAY – [in]
WAY is CHARACTER*1
= ‘C’: Convert
= ‘R’: RevertN – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
1) If WAY =’C’:
On entry, contains factorization details in format used in SSYTRF_ROOK:
a) all elements of the symmetric block diagonal matrix D on the diagonal of A and on superdiagonal (or subdiagonal) of A, and
b) If UPLO = ‘U’: multipliers used to obtain factor U in the superdiagonal part of A. If UPLO = ‘L’: multipliers used to obtain factor L in the superdiagonal part of A.
On exit, contains factorization details in format used in SSYTRF_RK or SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.
2) If WAY = ‘R’:
On entry, contains factorization details in format used in SSYTRF_RK or SSYTRF_BK:
a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and
b) If UPLO = ‘U’: factor U in the superdiagonal part of A. If UPLO = ‘L’: factor L in the subdiagonal part of A.
On exit, contains factorization details in format used in SSYTRF_ROOK:
a) all elements of the symmetric block diagonal matrix D on the diagonal of A and on superdiagonal (or subdiagonal) of A, and
b) If UPLO = ‘U’: multipliers used to obtain factor U in the superdiagonal part of A. If UPLO = ‘L’: multipliers used to obtain factor L in the superdiagonal part of A.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
E – [inout]
E is REAL array, dimension (N)
1) If WAY =’C’:
On entry, just a workspace.
On exit, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where If UPLO = ‘U’: E(i) = D(i-1,i), i=2:N, E(1) is set to 0; If UPLO = ‘L’: E(i) = D(i+1,i), i=1:N-1, E(N) is set to 0.
2) If WAY = ‘R’:
On entry, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where
If UPLO = ‘U’: E(i) = D(i-1,i),i=2:N, E(1) not referenced;
If UPLO = ‘L’: E(i) = D(i+1,i),i=1:N-1, E(N) not referenced.
On exit, is not changedIPIV – [in]
IPIV is INTEGER array, dimension (N)
On entry, details of the interchanges and the block structure of D as determined:
1) by SSYTRF_ROOK, if WAY =’C’;
2) by SSYTRF_RK (or SSYTRF_BK), if WAY =’R’. The IPIV format is the same for all these routines.
On exit, is not changed.INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRF_AA#
- group sytrf_aa
Functions
-
template<typename T>
void sytrf_aa(char *uplo, integer *n, T *a, integer *lda, integer *ipiv, T *work, integer *lwork, integer *info)# SYTRF_AA computes the factorization of a real symmetric matrix A using the Aasen’s algorithm.
Purpose:
SYTRF_AA computes the factorization of a real symmetric matrix A using the Aasen's algorithm. The form of the factorization is A = U**T*T*U or A = L*T*L**T where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is a symmetric tridiagonal matrix. This is the blocked version of the algorithm, calling Level 3 BLAS.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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 subdiaonals, when UPLO is ‘L’ (or ‘U’).LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
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 – [out]
WORK is REAL array, dimension (MAX(1,LWORK))
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK – [in]
LWORK is INTEGER
The length of WORK. LWORK >= MAX(1,2*N). For optimum performance LWORK >= N*(1+NB), where NB is the optimal blocksize.
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 – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value.
-
template<typename T>
LASYF_AA#
- group lasyf_aa
Functions
-
template<typename T>
void lasyf_aa(char *uplo, integer *j1, integer *m, integer *nb, T *a, integer *lda, integer *ipiv, T *h, integer *ldh, T *work)# LASYF_AA factorizes a panel of a real symmetric matrix A using the Aasen’s algorithm.
Purpose:
LASYF_AA factorizes a panel of a real symmetric matrix A using the Aasen's algorithm. The panel consists of a set of NB rows of A when UPLO is U, or a set of NB columns when UPLO is L. In order to factorize the panel, the Aasen's algorithm requires the last row, or column, of the previous panel. The first row, or column, of A is set to be the first row, or column, of an identity matrix, which is used to factorize the first panel. The resulting J-th row of U, or J-th column of L, is stored in the (J-1)-th row, or column, of A (without the unit diagonals), while the diagonal and subdiagonal of A are overwritten by those of T.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.J1 – [in]
J1 is INTEGER
The location of the first row, or column, of the panel within the submatrix of A, passed to this routine, e.g., when called by SSYTRF_AA, for the first panel, J1 is 1, while for the remaining panels, J1 is 2.
M – [in]
M is INTEGER
The dimension of the submatrix. M >= 0.
NB – [in]
NB is INTEGER
The dimension of the panel to be facotorized.
A – [inout]
A is REAL array, dimension (LDA,M) for
the first panel, while dimension (LDA,M+1) for the remaining panels.
On entry, A contains the last row, or column, of the previous panel, and the trailing submatrix of A to be factorized, except for the first panel, only the panel is passed.
On exit, the leading panel is factorized.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,M).
IPIV – [out]
IPIV is INTEGER array, dimension (M)
Details of the row and column interchanges, the row and column k were interchanged with the row and column IPIV(k).
H – [inout] H is REAL workspace, dimension (LDH,NB).
LDH – [in]
LDH is INTEGER
The leading dimension of the workspace H. LDH >= fla_max(1,M).
WORK – [out] WORK is REAL workspace, dimension (M).
-
template<typename T>
SYTRS_AA#
- group sytrs_aa
Functions
-
template<typename T>
void sytrs_aa(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, integer *ipiv, T *b, integer *ldb, T *work, integer *lwork, integer *info)# SYTRS_AA solves a system of linear equations A*X = B with a real
symmetric matrix A.
Purpose:
SYTRS_AA solves a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U**T*T*U or A = L*T*L**T computed by SYTRF_AA.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U**T*T*U;
= ‘L’: Lower triangular, form is A = L*T*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
Details of factors computed by SSYTRF_AA.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges as computed by SSYTRF_AA.
B – [inout]
B is REAL array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
WORK – [out] WORK is REAL array, dimension (MAX(1,LWORK))
LWORK – [in]
LWORK is INTEGER
The dimension of the array WORK. LWORK >= fla_max(1,3*N-2).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
HETRF_AA#
- group hetrf_aa
HETRF_AA computes the factorization of a complex hermitian matrix A.
/*!
Purpose:
HETRF_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.
- param UPLO:
[in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.- param N:
[in]
N is INTEGER
The order of the matrix A. N >= 0.
- param A:
[inout]
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 subdiaonals, when UPLO is ‘L’ (or ‘U’).- param LDA:
[in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
- param IPIV:
[out]
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).
- param WORK:
[out]
WORK is COMPLEX array, dimension (MAX(1,LWORK))
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
- param LWORK:
[in]
LWORK is INTEGER
The length of WORK. LWORK >= 2*N. For optimum performance LWORK >= N*(1+NB), where NB is the optimal blocksize.
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.- param INFO:
[out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value.
LAHEF_AA#
- group lahef_aa
Functions
-
template<typename T>
void lahef_aa(char *uplo, integer *j1, integer *m, integer *nb, T *a, integer *lda, integer *ipiv, T *h, integer *ldh, T *work)# LAHEF_AA factorizes a panel of a complex hermitian matrix A using the Aasen’s algorithm.
Purpose:
LAHEF_AA factorizes a panel of a complex hermitian matrix A using the Aasen's algorithm. The panel consists of a set of NB rows of A when UPLO is U, or a set of NB columns when UPLO is L. In order to factorize the panel, the Aasen's algorithm requires the last row, or column, of the previous panel. The first row, or column, of A is set to be the first row, or column, of an identity matrix, which is used to factorize the first panel. The resulting J-th row of U, or J-th column of L, is stored in the (J-1)-th row, or column, of A (without the unit diagonals), while the diagonal and subdiagonal of A are overwritten by those of T.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.J1 – [in]
J1 is INTEGER
The location of the first row, or column, of the panel within the submatrix of A, passed to this routine, e.g., when called by CHETRF_AA, for the first panel, J1 is 1, while for the remaining panels, J1 is 2.
M – [in]
M is INTEGER
The dimension of the submatrix. M >= 0.
NB – [in]
NB is INTEGER
The dimension of the panel to be facotorized.
A – [inout]
A is COMPLEX array, dimension (LDA,M) for the first panel, while dimension (LDA,M+1) for the remaining panels.
On entry, A contains the last row, or column, of the previous panel, and the trailing submatrix of A to be factorized, except for the first panel, only the panel is passed.
On exit, the leading panel is factorized.LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [out]
IPIV is INTEGER array, dimension (N)
Details of the row and column interchanges, the row and column k were interchanged with the row and column IPIV(k).
H – [inout] H is COMPLEX workspace, dimension (LDH,NB).
LDH – [in]
LDH is INTEGER
The leading dimension of the workspace H. LDH >= fla_max(1,M).
WORK – [out] WORK is COMPLEX workspace, dimension (M).
-
template<typename T>
HETRS_AA#
- group hetrs_aa
Functions
-
template<typename T>
void hetrs_aa(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, integer *ipiv, T *b, integer *ldb, T *work, integer *lwork, integer *info)# HETRS_AA solves a system of linear equations A*X = B with a complex hermitian matrix A.
Purpose:
HETRS_AA solves a system of linear equations A*X = B with a complex hermitian matrix A using the factorization A = U**H*T*U or A = L*T*L**H computed by HETRF_AA.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U**H*T*U;
= ‘L’: Lower triangular, form is A = L*T*L**H.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
A – [in]
A is COMPLEX array, dimension (LDA,N)
Details of factors computed by CHETRF_AA.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges as computed by CHETRF_AA.
B – [inout]
B is COMPLEX array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
WORK – [out] WORK is COMPLEX array, dimension (MAX(1,LWORK))
LWORK – [in]
LWORK is INTEGER
The dimension of the array WORK. LWORK >= fla_max(1,3*N-2).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
HETRS_AA_2STAGE#
- group hetrs_aa_2stage
Functions
-
template<typename T>
void hetrs_aa_2stage(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, T *tb, integer *ltb, integer *ipiv, integer *ipiv2, T *b, integer *ldb, integer *info)# HETRS_AA_2STAGE solves a system of linear equations A*X = B with a real hermitian matrix A.
Purpose:
HETRS_AA_2STAGE solves a system of linear equations A*X = B with a real hermitian matrix A using the factorization A = U**T*T*U or A = L*T*L**T computed by HETRF_AA_2STAGE.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U**T*T*U;
= ‘L’: Lower triangular, form is A = L*T*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
A – [in]
A is COMPLEX array, dimension (LDA,N)
Details of factors computed by CHETRF_AA_2STAGE.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
TB – [out]
TB is COMPLEX array, dimension (LTB)
Details of factors computed by CHETRF_AA_2STAGE.
LTB – [in]
LTB is INTEGER
The size of the array TB. LTB >= 4*N.
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges as computed by CHETRF_AA_2STAGE.
IPIV2 – [in]
IPIV2 is INTEGER array, dimension (N)
Details of the interchanges as computed by CHETRF_AA_2STAGE.
B – [inout]
B is COMPLEX array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRS_AA_2STAGE#
- group sytrs_aa_2stage
Functions
-
template<typename T>
void sytrs_aa_2stage(char *uplo, integer *n, integer *nrhs, T *a, integer *lda, T *tb, integer *ltb, integer *ipiv, integer *ipiv2, T *b, integer *ldb, integer *info)# SYTRS_AA_2STAGE solves a system of linear equations A*X = B with a real
symmetric matrix A.
Purpose:
SYTRS_AA_2STAGE solves a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U**T*T*U or A = L*T*L**T computed by SYTRF_AA_2STAGE.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
Specifies whether the details of the factorization are stored as an upper or lower triangular matrix.
= ‘U’: Upper triangular, form is A = U**T*T*U;
= ‘L’: Lower triangular, form is A = L*T*L**T.
N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
NRHS – [in]
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
A – [in]
A is REAL array, dimension (LDA,N)
Details of factors computed by SSYTRF_AA_2STAGE.
LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
TB – [out]
TB is REAL array, dimension (LTB)
Details of factors computed by SSYTRF_AA_2STAGE.
LTB – [in]
LTB is INTEGER
The size of the array TB. LTB >= 4*N.
IPIV – [in]
IPIV is INTEGER array, dimension (N)
Details of the interchanges as computed by SSYTRF_AA_2STAGE.
IPIV2 – [in]
IPIV2 is INTEGER array, dimension (N)
Details of the interchanges as computed by SSYTRF_AA_2STAGE.
B – [inout]
B is REAL array, dimension (LDB,NRHS)
On entry, the right hand side matrix B. On exit, the solution matrix X.
LDB – [in]
LDB is INTEGER
The leading dimension of the array B. LDB >= fla_max(1,N).
INFO – [out]
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
-
template<typename T>
SYTRF_AA_2STAGE#
- group sytrf_aa_2stage
Functions
-
template<typename T>
void sytrf_aa_2stage(char *uplo, integer *n, T *a, integer *lda, T *tb, integer *ltb, integer *ipiv, integer *ipiv2, T *work, integer *lwork, integer *info)# SYTRF_AA_2STAGE computes the factorization of a real symmetric matrix A using the Aasen’s algorithm.
Purpose:
SYTRF_AA_2STAGE computes the factorization of a real symmetric matrix A using the Aasen's algorithm. The form of the factorization is A = U**T*T*U or A = L*T*L**T where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and T is a symmetric band matrix with the bandwidth of NB (NB is internally selected and stored in TB( 1), and T is LU factorized with partial pivoting). This is the blocked version of the algorithm, calling Level 3 BLAS.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
A is REAL array, dimension (LDA,N)
On entry, the symmetric 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, L is stored below (or above) the subdiaonal blocks, when UPLO is ‘L’ (or ‘U’).LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
TB – [out]
TB is REAL array, dimension (LTB)
On exit, details of the LU factorization of the band matrix.
LTB – [in]
LTB is INTEGER
The size of the array TB. LTB >= 4*N, internally used to select NB such that LTB >= (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 – [out]
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).
IPIV2 – [out]
IPIV2 is INTEGER array, 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 column IPIV(k).
WORK – [out] WORK is REAL workspace of size LWORK
LWORK – [in]
LWORK is INTEGER The size of WORK. LWORK >= N, internally used to select NB such that LWORK >= 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 – [out]
INFO is INTEGER
= 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
-
template<typename T>
HETRF_AA_2STAGE#
- group hetrf_aa_2stage
Functions
-
template<typename T>
void hetrf_aa_2stage(char *uplo, integer *n, T *a, integer *lda, T *tb, integer *ltb, integer *ipiv, integer *ipiv2, T *work, integer *lwork, integer *info)# HETRF_AA_2STAGE computes the factorization of a real hermitian matrix A.
Purpose:
HETRF_AA_2STAGE computes the factorization of a real hermitian matrix A using the Aasen's algorithm. The form of the factorization is A = U**T*T*U or A = L*T*L**T 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( 1), and T is LU factorized with partial pivoting). This is the blocked version of the algorithm, calling Level 3 BLAS.
- Parameters:
UPLO – [in]
UPLO is CHARACTER*1
= ‘U’: Upper triangle of A is stored;
= ‘L’: Lower triangle of A is stored.N – [in]
N is INTEGER
The order of the matrix A. N >= 0.
A – [inout]
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, L is stored below (or above) the subdiaonal blocks, when UPLO is ‘L’ (or ‘U’).LDA – [in]
LDA is INTEGER
The leading dimension of the array A. LDA >= fla_max(1,N).
TB – [out]
TB is COMPLEX array, dimension (LTB)
On exit, details of the LU factorization of the band matrix.
LTB – [in]
LTB is INTEGER
The size of the array TB. LTB >= 4*N, internally used to select NB such that LTB >= (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 – [out]
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).
IPIV2 – [out]
IPIV2 is INTEGER array, 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 column IPIV(k).
WORK – [out] WORK is COMPLEX workspace of size LWORK
LWORK – [in]
LWORK is INTEGER
The size of WORK. LWORK >= N, internally used to select NB such that LWORK >= 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 – [out]
INFO is INTEGER
= 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
-
template<typename T>