An alternative compressed storage format for sparse matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2869, Issue , 2003, Pages 196-203

  Ekambaram, Anand ^a   Montagne, Eurípides ^a  

^a University of Central Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INDIRECT ADDRESSING; IRREGULAR PROBLEMS; PERMUTATION ARRAYS; SCIENTIFIC APPLICATIONS; SPARSE MATRICES; SPARSE MATRIX VECTOR PRODUCTS; SPARSITY PATTERNS; STORAGE REQUIREMENTS;

MATRIX ALGEBRA;

EID: 0142215175     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39737-3_25     Document Type: Article

References (6)

1. J. Dongarra, Sparse Matrix Storage Formats, In Zhaojun Bai et al, Eds., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000. Electronic version available at: http://www.cs.utk.edu/∼dongarra/etemplates/node372.html.
2. Matrix Market, the electronic version is available at the following URL: http://math.nist.gov/MatrixMarket/.
3. Y. Saad, Krylov Subspace methods on Supercomputers, Siam J. Sci. Stat. Comp., vol 10(6), pp. 1200-1232, 1989.
4. Y. Saad, SPARSKIT : A basic tool kit for sparse matrix computations Report RIACS-90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA, 1990.
5. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS publishing company, ITP, Boston, MA, 1996.
6. E. Montagne and A. Ekambaram, An Optimal Storage Format for Sparse Matrices, Dec. 2002(submitted for publication).