Computes matrix - matrix product of a sparse matrix stored in the BSR format (deprecated).
Converts a sparse matrix in the CSR format to the coordinate format and vice versa (deprecated).
You can use a two-stage algorithm for Inspector-executor Sparse BLAS routines which produce a sparse matrix. The applicable routines are:
Provides estimate of number and type of upcoming triangular system solver operations.
Computes the symmetric product of three sparse matrices and stores the result as a sparse matrix.
Performs two-strided scaling and out-of-place transposition/copying of matrices.
In practice, most computations are performed with rounding errors. Besides, you often need to solve a system Ax = b, where the data (the elements of A and b) are not known exactly. Therefore, it is important to understand how the data errors and rounding errors can affect the solution x.
Computes the factorization of a symmetric (Hermitian) positive-definite tridiagonal matrix.
Solves a system of linear equations with a Cholesky-factored symmetric (Hermitian) positive-definite coefficient matrix using the Rectangular Full Packed (RFP) format.