Computes the product U*UT(U*UH) or LT*L (LH*L), where U and L are upper or lower triangular matrices (blocked algorithm).
Copies a triangular/symmetric matrix or submatrix from standard packed format to full format.
Returns the size required for layout serialization.
Creates split layers.
This section describes the ScaLAPACK routines for matrix factorization. The following factorizations are supported:
LU factorization of general matrices
LU factorization of diagonally dominant-like matrices
Cholesky factorization of real symmetric or complex Hermitian positive-definite matrices
You can compute the factorizations using full and band storage of matrices.
Solves a system of linear equations with a triangular distributed matrix.
This section describes the ScaLAPACK routines for the QR(RQ) and LQ(QL) factorization of matrices. Routines for the RZ factorization as well as for generalized QR and RQ factorizations are also included. For the mathematical definition of the factorizations, see the respective LAPACK sections or refer to [SLUG].
Multiplies a general matrix by the unitary matrix Q of the QL factorization formed by p?geqlf.
Reduces a symmetric matrix to real symmetric tridiagonal form by an orthogonal similarity transformation.
Reduces a general matrix to bidiagonal form.