A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve

DOI10.1007/978-3-642-25100-9_73zbMath1253.65069OpenAlexW1581507139MaRDI QIDQ2905507

Rob H. Bisseling, Albert-Jan N. Yzelman

Publication date: 27 August 2012

Published in: Mathematics in Industry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25100-9_73

zbMATH Keywords

algorithmssparse matrixsparse matrix-vector multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Uses Software

• ATLAS
• JDQR
• OSKI
• JDQZ

Cites Work

• Unnamed Item
• Optimal sparse matrix dense vector multiplication in the I/O-model
• When cache blocking of sparse matrix vector multiply works and why
• Applying Automated Memory Analysis to Improve Iterative Algorithms
• Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
• Templates for the Solution of Algebraic Eigenvalue Problems
• A Hilbert-order multiplication scheme for unstructured sparse matrices
• Automated empirical optimizations of software and the ATLAS project

This page was built for publication: A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve