Krylov Subspace Methods: Principles and Analysis
By J. Liesen, Zdenek Strakos. 2012
349 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/097118402514fb1c91168d5ca6ab77eb79e6b065
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Robert Mansel Gower
- Peter Richtárik
- Peter Benner
- Karen E. Willcox
- Nicolas Loizou
- Serkan Gugercin
- Jakub Konecný
- Martin Takác
Citations in the corpus
- A Survey of Projection-Based Model Reduction Methods for Parametric Dynamical Systems (2015, positive): “,Ak−1b] is replaced by an orthogonal basis robustly computed via an Arnoldi process [157, 212]).”
- Randomized Iterative Methods for Linear Systems (2015, methodology): “3 Formulation (2.3) is similar to the framework often used to describe Krylov methods [20, Chapter 1], which is where K k +1 ⊂ R n is a ( k + 1)–dimensional subspace.”