Should we focus on the for calling these routines, or would you prefer a comparison of execution speeds between EISPACK and its successor, LAPACK?
EISPACK was designed to be a "pathway" system. Users would select a specific path of subroutines based on the characteristics of their matrix and the specific data required:
It solves the standard eigenvalue problem ( ) and the generalized problem ( Matrix Eigensystem Routines — EISPACK Guide
By the late 1980s, the architecture of computers had changed. The rise of cache memory and vector processors meant that the "point-to-point" memory access patterns of EISPACK were no longer optimal. This led to the development of (Linear Algebra Package). LAPACK superseded EISPACK by:
Reorganizing algorithms into "blocked" versions that are significantly faster on modern hardware. Should we focus on the for calling these
In the early 1970s, the world of scientific computing was fragmented. While the Handbook for Automatic Computation by Wilkinson and Reinsch provided high-quality Algol 60 procedures for matrix computations, there was no standardized, portable, and rigorously tested library for the more widely used Fortran language.
This overview details the history, structure, and enduring legacy of the library, the definitive collection of Fortran subroutines for solving matrix eigenvalue problems. The Genesis of Numerical Reliability The rise of cache memory and vector processors
In response, the NATS project (National Activity to Test Software), involving Argonne National Laboratory and various universities, began translating and refining these algorithms. The result was , a milestone in software engineering that prioritized numerical stability, documentation, and systematic testing over simple execution speed. Scope and Mathematical Coverage