A new storage scheme for an efficient implementation of the sparse matrix-vector product

DOI10.1016/0167-8191(89)90090-2zbMATH Open0689.65023OpenAlexW2007298293MaRDI QIDQ582003FDOQ582003

Jianyong Qiao, Sumit K. Garg

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90090-2

zbMATH Keywords

performance measurementsvector computersparse matrix- vector productsstorage scheme

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Cited In (5)

• A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
• A Highly Efficient Implementation of Multiple Precision Sparse Matrix-Vector Multiplication and Its Application to Product-type Krylov Subspace Methods
• Modeling data locality for the sparse matrix-vector product using distance measures
• A Storage-Efficient $WY$ Representation for Products of Householder Transformations

This page was built for publication: A new storage scheme for an efficient implementation of the sparse matrix-vector product

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