Uses the diagonal pivoting factorization to compute the solution to the system of linear equations with a real or complex symmetric coefficient matrix A, and provides error bounds on the solution.
Multiplies a general matrix by the orthogonal/unitary matrix Q of the QR factorization formed by ?geqrt.
Multiplies a complex matrix by the unitary matrix Q of the QL factorization formed by ?geqlf.
Generates the real orthogonal matrix Q or PT determined by ?gebrd.
Reduces a complex Hermitian matrix to tridiagonal form using packed storage.
Reduces a complex Hermitian positive-definite generalized eigenvalue problem to the standard form.
Computes selected eigenvectors of an upper (quasi-) triangular matrix computed by ?hseqr.
This topic describes LAPACK computational routines used for finding the generalized singular value decomposition (GSVD) of two matrices A and B as
UHAQ = D1*(0 R),
VHBQ = D2*(0 R),
Solves a general Gauss-Markov linear model problem using a generalized QR factorization.
Computes all eigenvalues and, optionally, eigenvectors of a real symmetric band matrix.