Level 3 Basic Linear Algebra Subprograms for Sparse Matrices: A User-Level Interface

ACM Transactions on Mathematical Software

Volumn 23, Issue 3, 1997, Pages 379-401

  Duff, Iain S ^a   Marrone, Michele ^b   Radicati, Giuseppe ^b   Vittoli, Carlo ^b  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b IBM   (Italy)

Author keywords

D.2.2 Software Engineering : Tools and Techniques user interfaces; D.2.3 Software Engineering : Coding standards; F.2.1 Analysis of Algorithms and Problem Complexity : Numerical Algorithms and Problems computations on matrices

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA STRUCTURES; ITERATIVE METHODS; MATRIX ALGEBRA; USER INTERFACES;

BASIC LINEAR ALGEBRA SUBPROGRAMS (BLAS);

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0031223114     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/275323.275327     Document Type: Article

References (23)

1. AEA TECHNOLOGY. 1996. Harwell Subroutine Library: A catalogue of subroutines (release 12). AEA Technology, Didcot, Oxon, United Kingdom.
2. AGARWAL R. C., GUSTAVSON, F. G., AND ZUBAIR, M. 1992. A high performance algorithm using pre-processing for the sparse matrix-vector multiplication. In Supercomputing '92 (Minneapolis, MN, Nov. 16-20, 1992), R. Werner, Ed. IEEE Computer Society Press, Los Alamitos, CA, 32-41.
3. AMESTOY, P. R., DAYDÉ, M., AND DUFF, I. S. 1989. Use of level 3 BLAS in the solution of full and sparse linear equations. In High Performance Computing (Montpellier, France, March 22-24, 1989), J.-L. Delhaye and E. Gelenbe, Eds. North-Holland Pubhshing Co., Amsterdam, The Netherlands, 19-31.
4. ANDERSON, E., BAI, Z., BISCHOF, C., DEMMEL, J., DONGARRA, J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., OSTROUCHOV, S., AND SORENSEN, D. 1992. LAPACk User's Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA.
5. ASHBY, S. F. AND SEAGER, M. K. 1990. A proposed standard for iterative solvers. Tech. Rep. 102860, Lawrence Livermore National Laboratory, Livermore, CA.
6. CARNEY, S., HEROUX, M. A., AND LI, G. 1993. A proposal for a sparse BLAS toolkit. Tech. Rep. TR/PA/92/90, Revised. CERFACS, Toulouse, France.
7. CEMONI, F., COMJANNI, M., FILIPPONE, S., AND MAIOLATESI, S. 1996. A proposal for parallel sparse BLAS. Tech. Rep. RI.96.05, University of Rome - Tor Vergata, Rome, Italy.
8. DODSON, D. S., GRIMES, R. G., AND LEWIS, J. G. 1991. Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 17, 2 (June), 253-263.
9. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND DUFF, I. 1990. A set of level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 16, 1 (Mar.) 1-17.
10. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND HANSON, R. J. 1988. An extended set of FORTRAN Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 14, 1 (Mar.), 1-17.
11. DUFF, I. S. 1981. Full matrix techniques in sparse Gaussian elimination. In Numerical Analysis Proceedings (Dundee, Scotland), G. A. Watson, Ed. Lecture Notes in Mathematics, vol. 912. Springer-Verlag New York, Inc., New York, NY, 71-84.
12. DUFF, I. S. AND REID, J. K. 1996. Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 22, 2 (June), 227-257.
13. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1989. Sparse matrix test problems. ACM Trans. Math. Softw. 15, 1 (Mar.), 1-14.
14. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1997. The Rutherford-Boeing Sparse Matrix Collection. Tech. Rep. RAL TR-97-031, Rutherford Appleton Laboratory, Didcot, Oxon, United Kingdom.
15. ERHEL, J. 1990. Sparse matrix multiplication on vector computers. Int. J. High Speed Comput. 2, 101-116.
16. IBM. 1990. IBM Engineering and Scientific Subroutine Library: Guide and Reference. Tech. Rep. IBM Corp., Riverton, NJ.
17. LAWSON, C. L., HANSON, R. J., KINCAID, D. R., AND KROGH, F. T. 1979. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Softw. 5, 3, 308-323.
18. OPPE, T. C. AND KINCAID, D. R. 1990. Are there iterative BLAS?. Tech. Rep. CNA-240, The University of Texas at Austin, Austin, TX.
19. OPPE, T. C., JOUBERT, W., AND KINCAID, D. R. 1988. NSPCG user's guide: A package for solving large linear systems by various iterative methods. Tech. Rep. CNA-216, The University of Texas at Austin, Austin, TX.
20. PAOLINI, G. V. AND RADICATI DI BROZOLO, G. 1989. Data structures to vectorize CG algorithms for general sparsity patterns. BIT 29, 4, 703-718.
21. POZO, R. AND REMINGTON, K. A. 1996. The NIST sparse BLAS library implementation. Design and performance. Tech. Rep. National Institute of Standards and Technology, Gaithersburg, MD.
22. SAAD, Y. 1994. ILUT: A dual threshold incomplete factorization. Num. Lin. Alg. Appl. 1, 4, 387-402.
23. THINKING MACHINES. 1992. CMSSL for CM Fortran. Version 3.0. Tech. Rep. Thinking Machines Corporation, Bedford, MA.