On the Convergence of Restarted Krylov Subspace Methods

Authors:
V. Simoncini
Affiliations:
-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2000

Citing 0
Cited 3

Simultaneous solution of large-scale linear systems and eigenvalue problems with a parallel GMRES method

Journal of Computational and Applied Mathematics
Restarted weighted full orthogonalization method for shifted linear systems

Computers & Mathematics with Applications
Arnoldi versus GMRES for computing pageRank: A theoretical contribution to google's pageRank problem

ACM Transactions on Information Systems (TOIS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are interested in the convergence analysis of restarted Krylov subspace iterative methods for the solution of large nonsymmetric linear systems. Several contributions in the literature have associated the convergence to some spectral properties of the coefficient matrix, while little work has been devoted to investigating how the singular values of A may influence the convergence. In this paper we present new relations that can be used to monitor the behavior of the restarted methods, especially GMRES, when the coefficient matrix has small (but not tiny) singular values and the right-hand side has a dominant component onto the corresponding left singular space.We also present some simple but insightful relations that highlight the dependence of the restarted schemes on new matrices; moreover, closed forms of the restarted solutions are used to relate the approximations of the unrestarted and restarted approaches.