With respect to the “influence on the development and practice of science and engineering in the 20th century”, Krylov space methods are considered as one of the ten most important classes of numerical methods [1]. Large sparse linear systems of equations or large sparse matrix eigenvalue problems appear in most applications of scientific computing. Sparsity means that most elements of the matrix involved are zero. In particular, discretization of PDEs with the finite element method (FEM) or with the finite difference method (FDM) leads to such problems. In case the original problem is nonlinear, linearization by Newton’s method or a Newton-type method leads again to a linear problem. We will treat here systems of equations only, but many of the numerical methods for large eigenvalue problems are based on similar ideas as the related solvers for equations.
CITATION STYLE
Gutknecht, M. H. (2007). A Brief Introduction to Krylov Space Methods for Solving Linear Systems. In Frontiers of Computational Science (pp. 53–62). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-46375-7_5
Mendeley helps you to discover research relevant for your work.