The Gatlinburg Symposia and Their Influence on the Development of Numerical Linear Algebra

About 1960, Alton S. Householder initiated the idea of “Gatlinburg Symposia on Numerical Linear Algebra”. They were named after the resort of Gatlinburg, Tennessee, where the early meetings took place; later on they shifted to various other locations in North America and also in Europe. Responsible for their program was the “Gatlinburg Committee”; the first consisted of A.S. Householder, J.H. Wilkinson, W. Givens, G.E. Forsythe, P. Henrici, and F.L. Bauer. There were only invited lectures and there were, at least initially, no parallel sessions. The list of participants contains many well known names and continues to read like a “Who’s Who” in the area of Numerical Linear Algebra, so that it is not surprising that the Symposia have had a tremendous influence on its development, both with respect to theory and the design of reliable and efficient algorithms. Such well-known software packages as LINPACK, LAPACK, EISPACK, and SPARSEPACK had their root in the collection of ALGOL programs in the book of Wilkinson and Reinsch, Linear Algebra, in many critical discussions during Gatlinburg Symposia, and in the close cooperation of scientists attending these meetings.

[1]  R. Fletcher.  Conjugate gradient methods for indefinite systems , 1976 .

[2]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[3]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[4]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[5]  G. Stewart.  Perturbation Theory for the Generalized Eigenvalue Problem , 1978 .

[6]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[7]  R. Varga.  Geršgorin And His Circles , 2004 .

[8]  Michael L. Overton,et al.  Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..

[9]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[10]  W. Givens.  Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form , 1958 .

[11]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[12]  Louis A. Hageman,et al.  Iterative Solution of Large Linear Systems. , 1971 .

[13]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[14]  F. L. Bauer,et al.  Moments and characteristic roots , 1960 .

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

[16]  W. Gautschi.  Construction of Gauss-Christoffel quadrature formulas , 1968 .

[17]  G. Stewart,et al.  An Algorithm for Generalized Matrix Eigenvalue Problems. , 1973 .

[18]  C. Lanczos.  Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .

[19]  Ralph Byers,et al.  Hamiltonian and symplectic algorithms for the algebraic riccati equation , 1983 .

[20]  J. G. F. Francis,et al.  The QR Transformation A Unitary Analogue to the LR Transformation - Part 1 , 1961, Comput. J..

[21]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[22]  R. Freund,et al.  QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .

[23]  P. Dooren.  The Computation of Kronecker's Canonical Form of a Singular Pencil , 1979 .

[24]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[25]  Jack Dongarra,et al.  ScaLAPACK Users' Guide , 1987 .

[26]  Ed Anderson,et al.  LAPACK Users' Guide , 1995 .

[27]  J. Reid.  Large Sparse Sets of Linear Equations , 1973 .

[28]  Alston S. Householder,et al.  The Theory of Matrices in Numerical Analysis , 1964 .

[29]  Richard S. Varga.  Reminiscences on the University of Michigan summer schools, the Gatlinburg Symposia, and Numerische Mathematik , 1990 .

[30]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[31]  James Demmel,et al.  LAPACK Users' Guide, Third Edition , 1999, Software, Environments and Tools.

[32]  P. Henrici.  Discrete Variable Methods in Ordinary Differential Equations , 1962 .

[33]  J. H. Wilkinson.  Error analysis of floating-point computation , 1960 .

[34]  B. S. Garbow,et al.  Matrix Eigensystem Routines — EISPACK Guide , 1974, Lecture Notes in Computer Science.

[35]  W. Greub.  Linear Algebra , 1981 .

[36]  Gene H. Golub,et al.  Calculation of Gauss quadrature rules , 1967, Milestones in Matrix Computation.

[37]  S. Kaniel.  Estimates for Some Computational Techniques - in Linear Algebra , 1966 .

[38]  Alston S. Householder,et al.  Unitary Triangularization of a Nonsymmetric Matrix , 1958, JACM.

[39]  Jack Dongarra,et al.  LINPACK Users' Guide , 1987 .

[40]  W. Arnoldi.  The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[41]  李幼升,et al.  Ph , 1989 .

[42]  V. Kublanovskaya.  On some algorithms for the solution of the complete eigenvalue problem , 1962 .

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

[44]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[45]  A. Householder.  Moments and characteristic roots. II , 1968 .

[46]  Xiaomei Yang.  Rounding Errors in Algebraic Processes , 1964, Nature.

[47]  Heinz Rutishauser.  Description of Algol 60 , 1967 .

[48]  Christopher C. Paige,et al.  The computation of eigenvalues and eigenvectors of very large sparse matrices , 1971 .

[49]  Ji-guang Sun,et al.  A note on Stewart's theorem for definite matrix pairs☆ , 1982 .