Reference Material

Project Funded by NSF Grant No. ACR 034255

 

 

1. Documents

2. Software

3. Test Data and Benchmarks

 

1. Documents: Journals, conference papers and Talks

 

Classified in Preconditioners, Storage schemes, Solve Methods and Other.

 

Preconditioners

 

M. Benzi. Preconditioning Techniques for Large Linear Systems: A Survey, Journal of Computational Physics, 182 (2002), pp. 418-477.

 

 

 

 

M. Benzi and M. Tuma. A Parallel Solver for Large-Scale Markov Chains, Applied Numerical Mathematics, 41 (2002), pp. 135-153.

 

M. Benzi, J. Marin, and M. Tuma. A Two-Level Parallel Preconditioner Based on Sparse Approximate Inverses, in Iterative Methods in Scientific Computation IV, D. R. Kincaid and A. C. Elster, eds., IMACS Series in Computational and Applied Mathematics, Vol. 5, IMACS, New Brunswick, NJ (1999), pp. 167-178.

 

M. Benzi and M. Tuma. A Comparative Study of Sparse Approximate Inverse Preconditioners, Applied Numerical Mathematics 30, 2-3 (1999), pp. 305-340.

 

M. Benzi and M. Tuma. A Comparison of Some Preconditioning Techniques for General Sparse Matrices , in S. Margenov and P. Vassilevski, editors, Iterative Methods in Linear Algebra, II, IMACS Series in Computational and Applied Mathematics, Vol. 3, pp. 191-203, IMACS, NJ, 1996.

 

Farid Khoury, Efficient Parallel Triangular System Solvers for Preconditioning Large Sparse Linear Systems. Australian center for advanced computing and communications. 1994.

 

Storage Schemes

 

Stamatis Vassiliadis, Sorin Cotofana, and Pyrrhos Stathis, Block Based Compression Storage Expected Performance, Delft University of Technology, The Netherlands, hpcs, 2000

 

Malik Silva, Richard Wait, Sparse Matrix Storage Revisited, University of Colombo School of Computing, Computing Frontiers, May 2005.

 

Anand Ekambaram and Eurıpides Montagne, An Alternative Compressed Storage Format for Sparse Matrices. ISCIS XVIII - Eighteenth International Symposium on Computer and Information Sciences, LNCS 2869, pp196-203, Nov 2003.

 

O. Temam and W. Jalby, Characterizing the behavior of sparse algorithms on caches, Conference on High Performance Networking and Computing, Proceedings of the 1992 ACM/IEEE conference on Supercomputing, Minneapolis, Minnesota, Pg 578 – 587, 1992

 

Solve Methods

 

Roland W. Freund, A block-QMR algorithm for Non-Hermitian Linear System with multiple right-hand  Sides, Numerical Analysis Manuscript, Bell laboratories. 1995.

 

Other

 

Shuting Xu, Jun Zhang, A Data Mining Approach to Matrix Preconditioning Problem, Laboratory for High Performance Scientific Computing and Computer Simulation, Department of Computer Science, University of Kentucky, March, 2005.

 

I. S. Duff, Roger G. Grimes and John G. Lewis, Sparse matrix test problems, ACM Transactions on Mathematical Software (TOMS), Volume 15, Issue 1, March 1989, Pg 1 – 14.

 

2. Software

 

Freely available software for linear algebra on the web (may 2004) http://www.netlib.org/utk/people/JackDongarra/la-sw.html

 

PIN, tool for dynamic instrumentation

http://rogue.colorado.edu/Pin/index.html

 

3. Test Data and Benchmarks

 

Test Data

 

Harwell-Boeing Sparse Matrix Collection

SPARSKIT

Nonsymmetric Eigenvalue Problem (NEP)

Matrix Market (database includes all the collections above)

University of Florida Sparse Matrix Collection

 

Benchmarks

 

SparseBench: a sparse iterative benchmark

 

  Home | People | Publications/Talks | Reference material | News/Other | Contact Info

Tuning libraries Group, Egan Science and Engineering Research Center, Office 225, 120 Forsyth St. and College of Computer Science, Office 370, West Village H, 440 Huntington Avenue, Northeastern university, Boston, MA 02115