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
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the pack...
Over the past few years several proposals have been made for the standardization of sparse matrix st...
Sparse matrices are stored in compressed formats in which zeros are not stored explicitly. Writing h...
A technique for optimizing software is proposed that involves the use of a standardized set of compu...
This paper summarizes the BLAS Technical Forum Standard, a speci- #cation of a set of kernel routine...
This paper proposes a set of Level 3 Basic Linear Algebra Subprograms and associated kernels for sp...
International audienceThe efficiency of a sparse linear algebra operation heavily relies on the abil...
Recently, we have proposed a recursive partitioning based layout for multi-core computations on spar...
Sparse matrix computations arise in many scientific computing problems and for some (e.g.: iterative...
Over the past few years several proposals have been made for the standardization of sparse matrix st...
ABSTRACT Sparse linear algebra is a cornerstone of modern computational science. These algorithms ig...
Basic Linear Algebra Subprograms (BLAS) are building blocks for many other matrix computations BLAS ...
In this paper we propose a set of parallel interfaces that extends the sparse BLAS presented in [8] ...
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the pack...
We have implemented the Bernoulli generic programming system for sparse matrix computations. What di...
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the pack...
Over the past few years several proposals have been made for the standardization of sparse matrix st...
Sparse matrices are stored in compressed formats in which zeros are not stored explicitly. Writing h...
A technique for optimizing software is proposed that involves the use of a standardized set of compu...
This paper summarizes the BLAS Technical Forum Standard, a speci- #cation of a set of kernel routine...
This paper proposes a set of Level 3 Basic Linear Algebra Subprograms and associated kernels for sp...
International audienceThe efficiency of a sparse linear algebra operation heavily relies on the abil...
Recently, we have proposed a recursive partitioning based layout for multi-core computations on spar...
Sparse matrix computations arise in many scientific computing problems and for some (e.g.: iterative...
Over the past few years several proposals have been made for the standardization of sparse matrix st...
ABSTRACT Sparse linear algebra is a cornerstone of modern computational science. These algorithms ig...
Basic Linear Algebra Subprograms (BLAS) are building blocks for many other matrix computations BLAS ...
In this paper we propose a set of parallel interfaces that extends the sparse BLAS presented in [8] ...
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the pack...
We have implemented the Bernoulli generic programming system for sparse matrix computations. What di...
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the pack...
Over the past few years several proposals have been made for the standardization of sparse matrix st...
Sparse matrices are stored in compressed formats in which zeros are not stored explicitly. Writing h...
Add to ORKG