|
|
SGEJSV (P) or DGEJSV (P)
|
Computes the singular value decomposition (SVD) of a real general matrix.
|
DSGESV
|
Computes the solution to a real system of linear equations with a general matrices (mixed precision with iterative refinement).
|
SGESVJ (P) or DGESVJ (P)
|
Computes the singular value decomposition (SVD) of a real general matrix. Implements a preconditioned Jacobi SVD algorithm. Uses SGEQP3, SGEQR, and SGELQF or DGEQP3, DGEQRF and DGELQF as a preprocessor, which can mean higher accuracy.
|
ZCGESV
|
Computes the solution to a complex system of linear equations with a general matrices (mixed precision with iterative refinement).
|
ZCPOSV
|
Computes the solution to a complex system of linear equations with a positive definite matrix (mixed precision with iterative refinement).
|
xGEBAK
|
Forms the right or left eigenvectors of a general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by xGEBAL.
|
xGEBAL (P)
|
Balances a real or complex general matrix.
|
xGEBD2
|
Reduces a general matrix to bidiagonal form (unblocked algorithm).
|
xGEBRD
|
Reduces a general matrix to upper or lower bidiagonal form by an unitary or orthogonal transformation (blocked algorithm).
|
xGECON
|
Estimates the reciprocal of the condition number of a general matrix, using the factorization computed by xGETRF.
|
xGEEQU (P)
|
Computes row and column scalings intended to equilibrate a general rectangular matrix and reduce its condition number.
|
xGEEQUB (P)
|
Computes row and column scalings intended to equilibrate a general rectangular matrix and reduce its condition number. Differs from xGETRF by restricting the scaling factors to a power of the radix.
|
xGEES
|
Computes the eigenvalues and Schur factorization of a general matrix (simple driver).
|
xGEESX
|
Computes the eigenvalues and Schur factorization of a general matrix (expert driver).
|
xGEEV (P)
|
Computes the eigenvalues and left and right eigenvectors of a general matrix (simple driver).
|
xGEEVX (P)
|
Computes the eigenvalues and left and right eigenvectors of a general matrix (expert driver).
|
xGEGS
|
Deprecated routine replaced by xGGES.
|
xGEGV (P)
|
Deprecated routine replaced by xGGEV.
|
xGEHD2
|
Reduces a general square matrix to an upper Hessenberg form by the unitary or orthogonal similarity transformation (unblocked algorithm).
|
xGEHRD (P)
|
Reduces a general matrix to upper Hessenberg form by an orthogonal similarity transformation.
|
xGELQ2
|
Computes the LQ factorization of a real or complex general rectangular matrix (unblocked algorithm).
|
xGELQF
|
Computes the LQ factorization of a general rectangular matrix.
|
xGELS (P)
|
Computes the least squares solution to an over-determined system of linear equations using a QR or LQ factorization of A.
|
xGELSD
|
Computes the least squares solution to an over-determined system of linear equations using a divide and conquer method and a QR or LQ factorization of A.
|
xGELSS
|
Computes the minimum-norm solution to a linear least squares problem by using the SVD of a general rectangular matrix (simple driver).
|
xGELSX (P)
|
Deprecated routine replaced by xSELSY.
|
xGELSY (P)
|
Computes the minimum-norm solution to a linear least squares problem using a complete orthogonal factorization.
|
xGEMQRT
|
Overwrites a general matrix with the result of its transformation by an orthogonal matrix, defined as the product of elementary reflectors generated using the compact WY representation as returned by xGEQRT.
|
xGEQL2
|
Computes the QL factorization of a real or complex general rectangular matrix (unblocked algorithm).
|
xGEQLF
|
Computes the QL factorization of a real or complex general rectangular matrix.
|
xGEQP3
|
Computes the QR factorization of general rectangular matrix using Level 3 BLAS.
|
xGEQPF
|
Deprecated routine replaced by xGEQP3.
|
xGEQR2
|
Computes the QR factorization of a real or complex general rectangular matrix (unblocked algorithm).
|
xGEQR2P
|
Computes the QR factorization of a real or complex general rectangular matrix with non-negative diagonal elements (unblocked algorithm).
|
xGEQRFP
|
Computes the QR factorization of a real or complex general rectangular matrix.
|
xGEQRT
|
Computes a blocked QR factorization of a general real or complex matrix using the compact WY representation of Q.
|
xGEQRT2
|
Computes a QR factorization of a general real or complex matrix using the compact WY representation of Q.
|
xGEQRT3 (P)
|
Recursively computes a QR factorization of a general real or complex matrix using the compact WY representation of Q.
|
xGERFS (P)
|
Refines the solution to a system of linear equations.
|
xGERFSX (P)
|
Improves the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution (extra precision).
|
xGERQ2
|
Computes the RQ factorization of a real or complex general rectangular matrix using an unblocked algorithm.
|
xGERQF
|
Computes the RQ factorization of a real or complex general rectangular matrix.
|
xGESDD
|
Computes the singular value decomposition (SVD) of a real or complex general rectangular matrix using a divide and conquer method (driver).
|
xGESV
|
Solves a general system of linear equations (simple driver).
|
xGESVD
|
Computes the singular value decomposition (SVD) for a real or complex general matrix (driver).
|
SGESVJ or DGESVJ
|
Computes the singular value decomposition (SVD) of a real general rectangular matrix.
|
xGESVX (P)
|
Solves a general system of linear equations (expert driver).
|
xGESVXX (P)
|
Computes the solution to a system of linear equations for general matrices (extra precision).
|
xGETF2
|
Computes the LU factorization of a real or complex general matrix using partial pivoting with row interchanges (unblocked algorithm).
|
xGETRF (P)
|
Computes the LU factorization of a general rectangular matrix using partial pivoting with row interchanges.
|
xGETRI
|
Computes the inverse of a general matrix using the factorization computed by xGETRF.
|
xGETRS
|
Solves a general system of linear equations using the factorization computed by xGETRF.
|
SGSVJ0 (P) or DGSVJ0 (P)
|
Preprocessor for SGESVJ or DGESVJ. Applies Jacobi rotations targeting only particular pivots.
|
SGSVJ1 (P) or DGSVJ1 (P)
|
Preprocessor for SGESVJ or DGESVJ. Applies Jacobi rotations in the same way as SGESVJ or DGESVJ does, but it does not check convergence (stopping criterion).
|
xLA_GEAMV (P)
|
Performs a matrix-vector operation to calculate error bounds for a real or complex general matrix.
|
CLA_GERCOND_C (P) or ZLA_GERCOND_C (P)
|
Computes the infinity norm condition number of op(A)*inv(diag(c)) for a complex general matrix. C is a REAL vector.
|
CLA_GERCOND_X (P) or ZLA_GERCOND_X (P)
|
Computes the infinity norm condition number of op(A)*inv(diag(x)) for a complex general matrix. X is a COMPLEX vector.
|
SLA_GERCOND(P) or DLA_GERCOND (P)
|
Estimates the Skeel condition number for a real general matrix.
|
xLA_GERFSX_EXTENDED (P)
|
Improves the computed solution to a system of linear equations for a real or complex general matrix by performing extra-precise iterative refinement and provides error bounds and backward error estimates for the solution.
|
xLA_GERFSX_GBRPVGRW
|
Computes the reciprocal pivot growth factor norm(A)/norm(U) for a real or complex general matrix.
|
xLALS0 (P)
|
Applies back multiplying factors in solving the least squares problem using the divide and conquer SVD approach. Used by xLALSA.
|
CLALSA (P) or ZLALSA (P)
|
Computes the SVD of a complex matrix in compact form. Used by SGELSD.
|
SLALSA or DLALSA
|
Computes the SVD of a real matrix in compact form. Used by SGELSD or DGELSD.
|
xLALSD (P)
|
Solves the least squares problem using the SVD. Used by xGELSD.
|