LAPACK: A Linear Algebra Library for High-Performance Computers

  • Jack J. Dongarra
  • James W. Demmel
  • Susan Ostrouchov


This talk outlines the computational package called LAPACK. LAPACK is a collection of Fortran 77 subroutines for the analysis and solution of various systems of simultaneous linear algebraic equations, linear least squares problems, and matrix eigenvalue problems. Such computations form the core of perhaps the majority of statistical methods.

The library provides a uniform set of subroutines to solve the most common linear algebra problems and runs efficiently on a wide range of architectures. This library, which is freely accessible via computer network, not only eases code development, makes codes more portable among machines of different architectures, and increases efficiency, but also provides tools for evaluating computer performance. The library is based on the well-known and widely used LINPACK and EISPACK packages for linear equation solving, eigenvalue problems, and linear least squares. LINPACK and EISPACK have provided an important infrastructure for scientific computing on serial machines, but they were not designed to exploit the profusion of parallel and vector architectures now becoming available.

This talk will describe the evolution of LAPACK and the naming scheme for the routines, as well as give listings for a few routines and notes on the structure of the routines and choice of algorithms. In addition, a discussion of the aspects of software design will be given.


Memory Hierarchy Numerical Linear Algebra Library Design Band Matrice Matrix Eigenvalue Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Anderson andJ. Dongarra. Results from the initial release of LAPACK. Computer Science Dept. Technical Report CS-89-89, University of Tennessee, Knoxville, 1989. (LAPACK Working Note #16).Google Scholar
  2. [2]
    E. Anderson and J. Dongarra. Evaluating block algorithm variants in LAPACK. Computer Science Dept. Technical Report CS-90-103, University of Tennessee, Knoxville, 1990. (LAPACK Working Note #19).Google Scholar
  3. [3]
    S. Batterson. Convergence of the shifted QR algorithm on 3 by 3 normal matrices. Num. Math., 58:341–352, 1990.CrossRefGoogle Scholar
  4. [4]
    J. Bunch, J. Dongarra, C. Moler, and G. W. Stewart. UNPACK User’s Guide. SIAM, Philadelphia, PA, 1979.Google Scholar
  5. [5]
    J. Demmel. Underflow and the reliability of numerical software. SIAM J. Sci. Stat. Comput., 5(4):887–919, Dec 1984.CrossRefGoogle Scholar
  6. [6]
    J. Demmel. LAPACK: A portable linear algebra library for supercomputers. In Proceedings of the 1989 IEEE Control Systems Society Workshop on Computer-Aided Control System Design, Tampa, FL, Dec 1989. IEEE.Google Scholar
  7. [7]
    J. Dongarra, J. Du Croz, I. Duff, and S. Hammarling. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Soft., 16(1):1–17, March 1990.CrossRefGoogle Scholar
  8. [8]
    J. Dongarra and E. Grosse. Distribution of mathematical software via electronic mail. Communications of the ACM, 30(5):403–407, July 1987.CrossRefGoogle Scholar
  9. [9]
    J. Du Croz and M. Pont. The development of a floating-point validation package. In M. J. Irwin and R. Stefanelli, editors, Proceedings of the 8th Symposium on Computer Arithmetic, Como, Italy, May 19–21 1987. IEEE Computer Society Press.Google Scholar
  10. [10]
    B. S. Garbow, J. M. Boyle, J. J. Dongarra, and C. B. Moler. Matrix Eigensystem Routines-EISPACK Guide Extension, volume 51 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1977.CrossRefGoogle Scholar
  11. [11]
    G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, 2nd edition, 1989.Google Scholar
  12. [12]
    W. Kahan. Paranoia, available from Netlib[8].Google Scholar
  13. [13]
    B. T. Smith, J. M. Boyle, J. J. Dongarra, B. S. Garbow, Y. Ikebe, V. C. Klema, and C. B. Moler. Matrix Eigensystem Routines-EISPACK Guide, volume 6 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1976.CrossRefGoogle Scholar
  14. [14]
    J. H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford University Press, Oxford, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Jack J. Dongarra
    • 1
    • 2
    • 3
    • 4
  • James W. Demmel
    • 1
    • 2
    • 3
    • 4
  • Susan Ostrouchov
    • 1
    • 2
    • 3
    • 4
  1. 1.Computer Science DepartmentUniversity of TennesseeKnoxvilleUSA
  2. 2.Oak Ridge National LaboratoryOak RidgeUSA
  3. 3.Computer Science Division and Mathematics DepartmentUniversity of CaliforniaBerkeleyUSA
  4. 4.Computer Science DepartmentUniversity of TennesseeKnoxvilleUSA

Personalised recommendations