Optimal sparse matrix dense vector multiplication in the I/O-model
DOI10.1007/S00224-010-9285-4zbMATH Open1213.68069OpenAlexW2677289244MaRDI QIDQ613122FDOQ613122
Rolf Fagerberg, Riko Jacob, Gerth Stølting Brodal, Michael A. Bender, E. Vicari
Publication date: 17 December 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/66998
Recommendations
Computational methods for sparse matrices (65F50) Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Gaussian elimination is not optimal
- Cache-Oblivious Algorithms
- PSBLAS
- Title not available (Why is that?)
- On the limits of cache-obliviousness
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Languages and Programming
- Multi-linear formulas for permanent and determinant are of super-polynomial size
Cited In (8)
- Efficient boundary condition-enforced immersed boundary method for incompressible flows with moving boundaries
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
- Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
- Optimal cache-oblivious mesh layouts
- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Storing matrices on disk for efficient row and column retrieval
Uses Software
This page was built for publication: Optimal sparse matrix dense vector multiplication in the I/O-model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613122)
