On optimizing multiplications of sparse matrices
From MaRDI portal
(Redirected from Publication:4645925)
Recommendations
- Algorithms – ESA 2004
- Fast sparse matrix multiplication
- SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
- Processor-efficient sparse matrix-vector multiplication
- The input/output complexity of sparse matrix multiplication
- A note on the multiplication of sparse matrices
- New ideas in sparse matrix matrix multiplication
- Optimizing sparse matrix-matrix multiplication for the GPU
- Fast multiplication and sparse structures
- scientific article; zbMATH DE number 4117735
Cites work
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 3852305 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 554767 (Why is no real title available?)
- scientific article; zbMATH DE number 635680 (Why is no real title available?)
- scientific article; zbMATH DE number 194559 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- Sparse matrices
Cited in
(11)- Structure prediction and computation of sparse matrix products
- Size-estimation framework with applications to transitive closure and reachability
- Cache oblivious sparse matrix multiplication
- A note on the multiplication of sparse matrices
- scientific article; zbMATH DE number 5929618 (Why is no real title available?)
- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
- Automatic Nonzero Structure Analysis
- Predicting Structure in Sparse Matrix Computations
- Nearly Optimal Sparse Polynomial Multiplication
- Fast multiplication and sparse structures
- On sparse matrix chain products
This page was built for publication: On optimizing multiplications of sparse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645925)
