An overview of the sparse basic linear algebra subprograms
Iain Duff, Michael A. Heroux, Roldan Pozo · ACM Transactions on Mathematical Software · 2002
We discuss the interface design for the Sparse Basic Linear Algebra Subprograms (BLAS), the kernels in the recent standard from the BLAS Technical Forum that are concerned with unstructured sparse matrices. The motivation for such a standard is to encourage portable programming while allowing for library-specific optimizations. In particular, we show how this interface can shield one from concern over the specific storage scheme for the sparse matrix. This design makes it easy to add further functionality to the sparse BLAS in the future.We illustrate the use of the Sparse BLAS with examples in the three supported programming languages, Fortran 95, Fortran 77, and C.
Cited by 147 works. doi:10.1145/567806.567810
Authors
References
- Matrix computations (3rd ed.)
- A set of level 3 basic linear algebra subprograms
- Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods
- Direct Methods for Sparse Matrices
- An extended set of FORTRAN basic linear algebra subprograms
- Numerical Methods for Large Eigenvalue Problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Full matrix techniques in sparse Gaussian elimination
- Preface: Basic Linear Algebra Subprograms Technical (Blast) Forum Standard
- Segmented Operations for Sparse Matrix Computation on Vector Multiprocessors