A survey of subspace recycling iterative methods

by   Kirk M. Soodhalter, et al.

This survey concerns subspace recycling methods, a popular class of iterative methods that enable effective reuse of subspace information in order to speed up convergence and find good initial guesses over a sequence of linear systems with slowly changing coefficient matrices, multiple right-hand sides, or both. The subspace information that is recycled is usually generated during the run of an iterative method (usually a Krylov subspace method) on one or more of the systems. Following introduction of definitions and notation, we examine the history of early augmentation schemes along with deflation preconditioning schemes and their influence on the development of recycling methods. We then discuss a general residual constraint framework through which many augmented Krylov and recycling methods can both be viewed. We review several augmented and recycling methods within this framework. We then discuss some known effective strategies for choosing subspaces to recycle before taking the reader through more recent developments that have generalized recycling for (sequences of) shifted linear systems, some of them with multiple right-hand sides in mind. We round out our survey with a brief review of application areas that have seen benefit from subspace recycling methods.


A note on augmented unprojected Krylov subspace methods

Subspace recycling iterative methods and other subspace augmentation sch...

Augmented unprojected Krylov subspace methods from an alternative view of an existing framework

Augmented Krylov subspace methods aid in accelerating the convergence of...

Unprojected recycled block Krylov subspace methods for shifted systems

The use of block Krylov subspace methods for computing the solution to a...

Cross-interactive residual smoothing for global and block Lanczos-type solvers for linear systems with multiple right-hand sides

Global and block Krylov subspace methods are efficient iterative solvers...

Flexible subspace iteration with moments for an effective contour integration-based eigensolver

Contour integration schemes are a valuable tool for the solution of diff...

Gl-QFOM and Gl-QGMRES: two efficient algorithms for quaternion linear systems with multiple right-hand sides

In this paper, we propose the global quaternion full orthogonalization (...

EMG-Controlled Hand Teleoperation Using a Continuous Teleoperation Subspace

We present a method for EMG-driven teleoperation of non-anthropomorphic ...

Please sign up or login with your details

Forgot password? Click here to reset