Recent computational developments in Krylov subspace methods for linear systems

By Valeria Simoncini, Daniel B. Szyld. Numerical Linear Algebra with Applications, 2007

435 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Computational Methods for Linear Matrix Equations (2016, methodology): “, [230] for a review of polynomial acceleration procedures of restarted methods in the linear system setting.”
INEXACT AND TRUNCATED PARAREAL-INTIME KRYLOV SUBSPACE METHODS FOR PARABOLIC OPTIMAL CONTROL PROBLEMS (2012, methodology): “In this paper, we use the full orthogonalization method (FOM) [25, 26, 29], which reduces to CG when the coefficient matrix is symmetric and does not change from one iteration to the next.”
A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations (2007, methodology): “We refer to [35] for pointers to similar so called inner-outer methods in the linear system setting.”
The Exponentially Convergent Trapezoidal Rule (2014, background): “4), a sequence of upper-Hessenberg systems of much smaller dimension; see [123, 151].”