A Look at the Evolution of Mathematical Software for Dense Matrix Problems over the Past Fifteen Years
In this paper we look at the evolution which has taken place in the design of mathematical software for dense matrix problems. Our main emphasis is on algorithms for solving linear algebra problems where the software we develop would reside in a library on high-performance computers.
KeywordsLinear Algebra Memory Reference Argonne National Laboratory Mathematical Software Vector Operation
Unable to display preview. Download preview PDF.
- 1.J. Dongarra, J. Bunch, C. Moler, and G. Stewart, UNPACK Users’ Guide, SIAM Pub, Philadelpha (1976).Google Scholar
- 3.J.J. Dongarra, “Performance of Various Computers Using Standard Linear Equations Software in a Fortran Environment,” Argonne National Laboratory MCS-TM-23 (October 1986).Google Scholar
- 5.J.J. Dongarra and D.C. Sorensen, “Linear Algebra on High-Performance Computers,” pp. 3–32 in Proceedings Parallel Computing 85, ed. U. Schendel, North Holland (1986).Google Scholar
- 7.C. Lawson, R. Hanson, D. Kincaid, and and F. Krogh, “Basic Linear Algebra Subprograms for Fortran Usage,” ACM Transactions on Mathematical Software, pp. 308–323 (1979).Google Scholar
- 8.B.T. Smith, J.M. Boyle, J.J. Dongarra, B.S. Garbow, Y. Ikebe, V. Klema, and C. Moler, Matrix Eigensystem Routines — EISPACK Guide, Second Edition., 1976.Google Scholar
- 9.J. Wilkinson and C. Reinsch, Handbook for Automatic Computation: Volume II — Linear Algebra, Springer-Verlag, New YorkGoogle Scholar