A note on the multiplication of sparse matrices

DOI10.2478/S13537-014-0201-XMaRDI QIDQ2445101zbMATH OpenOpenAlexFDO

Authors Keivan Borna, Sohrab Aboozarkhani Fard

Publication date 14 April 2014

Published in Central European Journal of Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/s13537-014-0201-x

zbMATH Keywords

algorithmssparse matricesmatrix multiplicationtiny matrices

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Algorithms – ESA 2004
• Fast sparse matrix multiplication
• On optimizing multiplications of sparse matrices
• The input/output complexity of sparse matrix multiplication
• The I/O Complexity of Sparse Matrix Dense Matrix Multiplication

Cites work

• Fast sparse matrix multiplication
• Gaussian elimination is not optimal
• Matrix multiplication via arithmetic progressions
• Rectangular matrix multiplication revisited

Cited in

(7)

• A note on preserving the spark of a matrix
• Algorithms – ESA 2004
• On optimizing multiplications of sparse matrices
• The algorithms for FPGA implementation of sparse matrices multiplication
• Sparse Matrix-Matrix Products Executed Through Coloring
• Robs algorithm
• Fast multiplication algorithm for square sparse matrices. Application toimages processing

This page was built for publication: A note on the multiplication of sparse matrices

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