An optimal storage format for sparse matrices

DOI10.1016/J.IPL.2004.01.014MaRDI QIDQ2390230zbMATH OpenOpenAlexFDO

Authors Eurípides Montagne, Anand Ekambaram

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.01.014

zbMATH Keywords

sparse matrixdata structuresmatrix vector productTranspose Jagged Diagonal Storage format

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Data structures (68P05)

Recommendations

• An efficient storage format for large sparse matrices
• Computational Science – ICCS 2005
• Computational Science – ICCS 2005
• Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS

Cites work

• Krylov Subspace Methods on Supercomputers
• Templates for the Solution of Algebraic Eigenvalue Problems

Cited in

(10)

• A Class of Sparse Invertible Matrices and Their Use for Nonlinear Prediction of Nearly Periodic Time Series with Fixed Period
• Optimal indexes for sparse bit vectors
• A transposition algorithm for the factorizable sparse matrix
• An efficient storage format for large sparse matrices
• scientific article; zbMATH DE number 5929618 (Why is no real title available?)
• A high performance large sparse symmetric solver for the meshfree Galerkin method
• Jagged non-zero submatrix data structure
• A compact row storage scheme for Cholesky factors using elimination trees
• Computational Science – ICCS 2005
• A practical method for compressing sparse matrices with variant entries

Describes a project that uses

Uses Software

• JDQR
• ITSOL
• JDQZ
• SPARSKIT

This page was built for publication: An optimal storage format for sparse matrices

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