LAPACK: A Linear Algebra Library for High-Performance Computers

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.

[1]  J. Du Croz,et al.  The development of a floating-point validation package , 1987, IEEE Symposium on Computer Arithmetic.

[2]  James Demmel.  Underflow and the Reliability of Numerical Software , 1984 .

[3]  S. Batterson.  Convergence of the shifted QR algorithm on 3×3 normal matrices , 1990 .

[4]  Jack J. Dongarra,et al.  A set of level 3 basic linear algebra subprograms , 1990, TOMS.

[5]  J. Demmel,et al.  LAPACK: a portable linear algebra library for supercomputers , 1989, IEEE Control Systems Society Workshop on Computer-Aided Control System Design.

[6]  Gene H. Golub,et al.  Matrix computations , 1983 .

[7]  Jack J. Dongarra,et al.  Evaluating Block Algorithm Variants in LAPACK , 1989, PPSC.

[8]  Brian T. Smith,et al.  Matrix Eigensystem Routines — EISPACK Guide , 1974, Lecture Notes in Computer Science.

[9]  Jack J. Dongarra,et al.  Matrix Eigensystem Routines — EISPACK Guide Extension , 1977, Lecture Notes in Computer Science.

[10]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .