Proposed sparse extensions to the Basic Linear Algebra Subprograms

ABSTRACT

Many codes now exist for solving sparse linear systems: MA28 /4/, SPARSPAK /7/, the Yale Sparse Matrix Package /6/, and ICCG/ILU preconditioning /10/. It has been found that sparse matrix computations are useful in many fields. Furthermore, much effort is being expended in other sparse matrix computations such as sparse least squares and eigenvalue extraction.

REFERENCES

• 1: Dembart, B. and Neves, K. W. Sparse Triangular Factorization on Vector Computers, <u>Exploring Applications of Parallel Processing</u>, Electrical Power Research Institute, EL-566-QR, Palo Alto, California, (1977), 57--103.
• 2: David S. Dodson , John G. Lewis, Issues relating to extension of the Basic Linear Algebra Subprograms, ACM SIGNUM Newsletter, v.20 n.1, p.19-22, January 1985 [doi>10.1145/1057935.1057937]
• 3: Jack J. Dongarra , Jeremy Du Croz , Sven Hammarling , Richard J. Hanson, A proposal for an extended set of Fortran Basic Linear Algebra Subprograms, ACM SIGNUM Newsletter, v.20 n.1, p.2-18, January 1985 [doi>10.1145/1057935.1057936]
• 4: Duff, L. S. MA28: A Set of Fortran Subroutines for Sparse Unsymmetric Linear Equations, AERE Report R.8730, HMSO, London, (1971).
• 5: Duff, I. S. and Reid, J. K. The Multifrontal Solution of Unsymmetric Sets of Linear Equations, AERE Report CSS 133, (1983).
• 6: Eisenstat, S. C., Gursky, M. C., Schultz, M. H., and Sherman, A. H. <u>Yale Sparse Matrix Package II. The Nonsymmetric Codes</u>, Department of Computer Science Research Report #114, Yale University, (1977).
• 7: Alan George , Joseph W. Liu, Computer Solution of Large Sparse Positive Definite, Prentice Hall Professional Technical Reference, 1981
• 8: C. L. Lawson , R. J. Hanson , D. R. Kincaid , F. T. Krogh, Basic Linear Algebra Subprograms for Fortran Usage, ACM Transactions on Mathematical Software (TOMS), v.5 n.3, p.308-323, Sept. 1979 [doi>10.1145/355841.355847]
• 9: Rice, J. R. Report on PARVEC Workshop #4: BLAS, Linear Algebra Modules and Supercomputers, Computer Science Department TR 501, Purdue University, West Lafayette, Indiana 47907, (Dec. 1984).
• 10: Simon, H. D. Incomplete LU Preconditioners for Conjugate Gradient Type Iterative Methods, Paper SPE 13533, <u>Proceedings of the Eighth SPE Symposium on Reservoir Simulation</u>, (Feb. 1985).
• 11: Woo, P. T. and Leveque, J. M. Benchmarking a Sparse Elimination Routine on the Cyber 205 and the CRAY-1, Proceedings of the Sixth SPE Symposium on Reservoir Simulation, (Feb. 1982).