Skip to content
James Foucar edited this page Mar 31, 2023 · 15 revisions

Containers

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.

SPARSE 1 Kernels

No level 1 kernels have been implemented so far.

SPARSE 2 Kernels

Functions in this category are the equivalent of standard SPARSE-2 type functions.

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 or U*x=b
  • spadd Matrix Matrix Addition - symbolic and numeric phases

SPARSE 3 Kernels

Functions in this category are the equivalent of standard SPARSE-3 type functions.

Functions:

  • spgemm Matrix Matrix Multiplication - symbolic and numeric phases

SPARSE Extra Kernels

Functions in this category are extra SPARSE type functions.

Functions:

  • gauss_seidel Iterative method to solve A*x=b
  • spiluk Incomplete LU factorization ILU(k) - symbolic and numeric phases
  • par_ilut A Parallel threshold incomplete LU factorization - symbolic and numeric phases
Clone this wiki locally