toms384

toms384, a Fortran77 code which implements ACM toms algorithm 384, for computing the eigenvalues and eigenvectors of a symmetric matrix.

The text of many ACM TOMS algorithms is available online through ACM: https://www.acm.org/pubs/calgo or NETLIB: https://www.netlib.org/toms/index.html.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

toms384 is available in a Fortran77 version.

Related Data and Programs:

toms384_test

eispack, a Fortran90 library which can compute eigenvalues and eigenvectors of a variety of matrix types.

LAPACK_EXAMPLES, a Fortran90 program which demonstrates the use of the LAPACK linear algebra library.

TEST_MAT, a Fortran90 library which defines matrices with various properties for testing linear algebra software.

Reference:

  1. Pete Stewart,
    Algorithm 384: Eigenvalues and Eigenvectors of a Real Symmetric Matrix,
    Communications of the ACM,
    June 1970, Volume 13, Number 6, pages 369-371.
  2. Pete Stewart,
    Incorporating Origin Shifts into the Symmetric QR Algorithm for Symmetric Tridiagonal Matrices,
    Communications of the ACM,
    June 1970, Volume 13, Number 6, pages 365-367.

Source Code:

Last revised on 13 November 2023.