A high performance algorithm using pre-processing for the sparse matrix-vector multiplication

Proceedings of the International Conference on Supercomputing

Volumn Part F129723, Issue , 1992, Pages 32-41

  Agarwal, R C ^a   Gustavson, F G ^a   Zubair, M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PERFORMANCE ALGORITHMS; PRE-PROCESSING; REGULAR STRUCTURE; RELATIVE EFFICIENCY; SPARSE MATRICES; SPARSE MATRIX-VECTOR MULTIPLICATION;

SUPERCOMPUTERS;

EID: 84983621818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/superc.1992.236712     Document Type: Conference Paper

References (12)

1. R. C. Agarwal and F. G. Gustavson, "How to improve sparse matrix-vector operation", unpublished note, 1987.
2. D. S. Dodson and R. G. Grimes and J. G. Lewis, "Sparse extensions to the FORTRAN basic linear algebra subprograms", ACM TOMS, Vol. 17, No. 2, pp. 253-263, June 1991.
3. I. Duff, R. Grimes and J. Lewis, "Sparse matrix test problems, Report CCS191, Computer Science and System Division, Harwell Laboratory, England, 1988.
4. ESSL, Guide and Reference, Order number SC23-0184-5, IBM Corp., December, 1990.
5. J. Forrest, "Test matrices for linear programming, private communication, IBM T. J. Watson Research Center, NY, 1991.
6. A. George and J. W. H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1981.
7. F. G. Gustavson, "Some basic techniques for solving sparse system of linear equations", Sparse Matrices and their Applications, Edited by D. J. Rose and R. A. Willoughby, pp. 41-52, Plenum Press, 1972.
8. F. G. Gustavson, "Two fast algorithms for sparse matrices: multiplication and permuted transposition", ACM TOMS, Vol. 4, No. 3, pp. 250-269, 1978.
9. D. Kincaid, T. Oppe, J. Respess, D. Young, ITPACKV2C User's Guide, Report CNA-191, The University of Texas at Austin, 1984.
10. K. Madsen, G. H. Rodrigue, and J. Karush, "Matrix multiplication by diagonals on a vector/parallel processor", Information Processing Letter, 2, pp. 41-45, 1978.
11. G. V. Paolini and G. Radicati di Brozolo, "Data structures to vectorize CG algorithms for general sparsity patterns", BIT 29, pp. 703-718, 1989.
12. Y. Saad, "Krylov subspace methods on supercomputers", SIAM J. Sci. Stat. Comput., Vol. 10, No. 6, pp. 1200-1232, 1989.