Skip to main content

A Look at the Evolution of Mathematical Software for Dense Matrix Problems over the Past Fifteen Years

  • Conference paper
  • 159 Accesses

Part of the book series: The IMA Volumes in Mathematics and Its Applications ((IMA,volume 13))

Abstract

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.

Work supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. J. Dongarra, J. Bunch, C. Moler, and G. Stewart, UNPACK Users’ Guide, SIAM Pub, Philadelpha (1976).

    Google Scholar 

  2. J. Dongarra and Stanley C. Eisenstat, “Squeezing the Most out of an Algorithm in Cray Fortran,” ACM Trans. Math. Software 10, 3, pp. 221–230 (1984).

    Article  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 

  4. J.J. Dongarra, L. Kaufman, and S. Hammarling, “Squeezing the Most Out of High Performance Computers for Finding the Eigenvalues,” Linear Algebra and Its Applications 77, pp. 113–136 (1986).

    Article  MathSciNet  MATH  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 

  6. B.S. Garbow, J.M. Boyle, J.J. Dongarra, and C.B. Moler, Matrix Eigensystem Routines — EISPACK Guide Extension, 1977.

    MATH  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 RoutinesEISPACK Guide, Second Edition., 1976.

    Google Scholar 

  9. J. Wilkinson and C. Reinsch, Handbook for Automatic Computation: Volume IILinear Algebra, Springer-Verlag, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag New York Inc.

About this paper

Cite this paper

Dongarra, J.J., Sorensen, D.C. (1988). A Look at the Evolution of Mathematical Software for Dense Matrix Problems over the Past Fifteen Years. In: Schultz, M. (eds) Numerical Algorithms for Modern Parallel Computer Architectures. The IMA Volumes in Mathematics and Its Applications, vol 13. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6357-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-6357-6_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4684-6359-0

  • Online ISBN: 978-1-4684-6357-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics