An overview of the sparse basic linear algebra subprograms

2002/06/01 by Iain Duff, Michael A. Heroux, Roldan Pozo · 4 citations
Computer Science · #Advanced Data Storage Technologies #Numerical Methods and Algorithms #Parallel Computing and Optimization Techniques

paper · doi:10.1145/567806.567810

openalex publication_date 2002/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11

Abstract

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.

Citations

• A set of level 3 basic linear algebra subprograms
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear

Cited by

• Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
• Evaluating Rust for Sparse Matrix Kernels in Scientific Computing
• SMASH: Sparse Matrix Atomic Scratchpad Hashing
• Basic Linear Algebra Subprograms [wikipedia]