The Origin and Development of Krylov Subspace Methods
Author:
- 1 July 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 24 (4) , 28-39
Abstract
Krylov subspace methods have had unparalleled success in solving real-life problems across disciplines ranging from computational fluid dynamics to statistics, machine learning, control theory, and computational chemistry, among many others. This article provides a brief history of these methods, discussing their origin, their expansion, and the lives of the people behind them.Keywords
Funding Information
- National Science Foundation (DMS 1912048)
This publication has 36 references indexed in Scilit:
- Krylov subspace iterationComputing in Science & Engineering, 2000
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblemLinear Algebra and its Applications, 1980
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methodsLinear Algebra and its Applications, 1980
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equationsLinear Algebra and its Applications, 1980
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric MatrixIMA Journal of Applied Mathematics, 1976
- Conjugate gradient methods for indefinite systems1976
- George Forsythe and the development of computer scienceCommunications of the ACM, 1972
- Estimates for some computational techniques in linear algebraMathematics of Computation, 1966
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methodsNumerische Mathematik, 1961
- Solving linear algebraic equations can be interestingBulletin of the American Mathematical Society, 1953