Performance Evaluation of Storage Formats for Sparse Matrices in Fortran

1. The matrix market, http://math.nist.gov/MatrixMarket/

2. Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press, Oxford (1986)

   MATH  Google Scholar 

3. Duff, I.S., Heroux, M.A., Pozo, R.: An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum. ACM Transactions on Mathematical Software 28(2), 239–267 (2002)

   Article  MATH  MathSciNet  Google Scholar 

4. Duff, I.S., Vömel, C.: Algorithm 818: A reference model implementation of the Sparse BLAS in Fortran 95. ACM Transactions on Mathematical Software 28(2), 268–283 (2002)

   Article  MATH  Google Scholar 

5. Eun-Jin, K., Yelick, A., Vuduc, R.: SPARSITY: An optimization framework for sparse matrix kernels. International Journal of High Performance Computing Applications 18(1), 135–158 (2004)

   Article  Google Scholar 

6. Gundersen, G., Steihaug, T.: Data structures in Java for matrix computations. Concurrency and Computation: Practice and Experience 16(8), 799–815 (2004)

   Article  Google Scholar 

7. Luján, M., Usman, A., Hardie, P., Freeman, T.L., Gurd, J.R.: Storage formats for sparse matrices in Java. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3514, pp. 364–371. Springer, Heidelberg (2005)

   Chapter  Google Scholar 

8. Pooch, U.W., Nieder, A.: A survey of indexing techniques for sparse matrices. ACM Computing Surveys 5(2), 109–133 (1973)

   Article  MATH  Google Scholar 

Download references