Uses the Cholesky factorization to compute the solution to the system of linear equations with a symmetric (Hermitian) positive-definite band coefficient matrix A, and provides error bounds on the solution.
Uses the diagonal pivoting factorization to compute the solution to the system of linear equations with a Hermitian coefficient matrix A stored in packed format, and provides error bounds on the solution.
Computes the LQ factorization of a general m-by-n matrix.
Generates the complex matrix Q of the RQ factorization formed by ?gerqf.
Multiplies an arbitrary real matrix by the real orthogonal matrix Q or PT determined by ?gebrd.
Generates the real orthogonal matrix Q determined by ?sptrd.
Generalized symmetric-definite eigenvalue problems are as follows: find the eigenvalues λ and the corresponding eigenvectors z that satisfy one of these equations:
Az = λBz, ABz = λz, or BAz = λz,
Computes all eigenvalues and (optionally) the Schur factorization of a matrix reduced to Hessenberg form.
Solves the generalized Sylvester equation.
Uses QR or LQ factorization to solve an overdetermined or underdetermined linear system with full rank matrix, with best performance for tall and skinny matrices.