The I/O Complexity of Sparse Matrix Dense Matrix Multiplication

DOI10.1007/978-3-642-12200-2_14MaRDI QIDQ3557017zbMATH OpenOpenAlexFDO

Authors Gero Greiner, Riko Jacob

Publication date 27 April 2010

Published in LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12200-2_14

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Optimal sparse matrix dense vector multiplication in the I/O-model
• The input/output complexity of sparse matrix multiplication
• On optimizing multiplications of sparse matrices
• The I/O complexity of Strassen's matrix multiplication with recomputation
• scientific article; zbMATH DE number 7650266
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
• Algorithms – ESA 2004
• Fast sparse matrix multiplication
• Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
• Processor-efficient sparse matrix-vector multiplication

Cited in

(9)

• scientific article; zbMATH DE number 7650266 (Why is no real title available?)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• Evaluating non-square sparse bilinear forms on multiple vector pairs in the I/O-model
• Optimal sparse matrix dense vector multiplication in the I/O-model
• N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm
• Communication lower bounds and optimal algorithms for numerical linear algebra
• The I/O complexity of Strassen's matrix multiplication with recomputation
• The input/output complexity of sparse matrix multiplication
• A note on the multiplication of sparse matrices

This page was built for publication: The I/O Complexity of Sparse Matrix Dense Matrix Multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557017)