Computational Science – ICCS 2005

DOI10.1007/B136570zbMATH Open1129.65312OpenAlexW2495705296MaRDI QIDQ5709505FDOQ5709505

Authors: Eduardo F. D'Azevedo, Mark Fahey, Richard Tran Mills 

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136570

Recommendations

• A vectorized version of a sparse matrix-vector multiply
• Sparse matrix-vector multiplication on NVIDIA GPU
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
• Cache friendly sparse matrix-vector multiplication
• Compressed multirow storage format for sparse matrices on graphics processing units

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cited In (8)

• Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems
• Cache friendly sparse matrix-vector multiplication
• A Hilbert-order multiplication scheme for unstructured sparse matrices
• A user-friendly hybrid sparse matrix class in C++
• Sparse computation with PEI
• A practical method for compressing sparse matrices with variant entries
• Title not available (Why is that?)
• An optimal storage format for sparse matrices

Uses Software

• PETSc

This page was built for publication: Computational Science – ICCS 2005

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