-
Notifications
You must be signed in to change notification settings - Fork 99
SPARSE
Nathan Ellingwood edited this page Jun 24, 2020
·
15 revisions
Sparse containers are data structures that store indices and values associated with linear algebra objects, they allow storage savings all values associated with indices not explicitly stored are assumed to be zeros.
No level 1 kernels have been implemented so far.
Functions in this category are the equivalent of standard SPARSE-2 type functions.
- spmv Matrix Vector Multiplication
- spmv-struct Matrix Vector Multiplication for structured problems
-
trsv Triangular Solve for
A*x=b
-
sptrsv Parallelized Sparse Triangular Solve for
L*x=b
orU*x=b
Functions in this category are the equivalent of standard SPARSE-3 type functions.
- spadd Matrix Matrix Addition - symbolic and numeric phases
- spgemm Matrix Matrix Multiplication - symbolic and numeric phases
Functions in this category are extra SPARSE type functions.
-
gauss_seidel Iterative method to solve
A*x=b
- spiluk Incomplete LU factorization ILU(k) - symbolic and numeric phases