EISPACK

EISPACK is a software library for numerical computation of eigenvalues and eigenvectors of matrices, written in FORTRAN. It
contains subroutines for calculating the eigenvalues of nine classes of matrices: complex general, complex Hermitian, real general,
real symmetric, real symmetric banded, real symmetric tridiagonal, special real tridiagonal, generalized real, and generalized real
symmetric matrices. In addition it includes subroutines to perform asingular value decomposition.

Originally written around 1972–1973,[1] EISPACK, like LINPACK and MINPACK, originated from Argonne National Laboratory,
has always been free, and aims to be portable, robust and reliable. The library drew heavily on algorithms developed by James
Wilkinson, which were originally implemented in ALGOL. Brian Smith led a team at Argonne developing EISPACK, initially by
translating these algorithms into FORTRAN. Jack Dongarra joined the team as an undergraduate intern at Argonne, and later went on
to create LAPACK, which has largely superseded EISPACK and LINPACK.

Documentation
Brian Smith, James Boyle, Jack Dongarra, Burton Garbow , Y Ikebe, V Klema, Cleve Moler, Matrix Eigensystem
Routines, EISPACK Guide, Lecture Notes in Computer Science, Volume 6, Springer Verlag, 1976. As of 2012, it has
been cited more than 1200 times in the scholarly literature.
Burton Garbow et al., Matrix eigensystem routines: EISP ACK guide extension, Lecture Notes in Computer Science,
Volume 51, Springer Verlag, 1977.

References
1. Garbow, Burton S. (1974). "EISPACK — A package of matrix eigensystem routines".Computer Physics
Communications. 7: 179–184. doi:10.1016/0010-4655(74)90086-1(https://doi.org/10.1016%2F0010-4655%2874%2
990086-1).

External links
Netlib download site for EISPACK
Interview with Jack Dongarra about EISPACK.

Retrieved from "https://en.wikipedia.org/w/index.php?title=EISP

ACK&oldid=774719461"

This page was last edited on 10 April 2017, at 07:43.

Text is available under theCreative Commons Attribution-ShareAlike License ; additional terms may apply. By using this
site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of theWikimedia
Foundation, Inc., a non-profit organization.