Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems

DOI10.1134/s1995080223080346OpenAlexW4389103016MaRDI QIDQ6140408

Boris I. Krasnopolsky, R. M. Kuprii, K. A. Zhukov

Publication date: 22 January 2024

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080223080346

zbMATH Keywords

iterative methodscompressed sparse row formatsystems of linear algebraic equationssparse matrix-vector multiplicationmatrix storage format

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Cites Work

• Reliable updated residuals in hybrid Bi-CG methods
• When cache blocking of sparse matrix vector multiply works and why
• A Unified Sparse Matrix Data Format for Efficient General Sparse Matrix-Vector Multiplication on Modern Processors with Wide SIMD Units
• The university of Florida sparse matrix collection
• SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems