A survey of subspace recycling iterative methods
From MaRDI portal
Publication:6144044
Abstract: 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.
Recommendations
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Recycling Krylov subspace methods for sequences of linear systems. Analysis and applications
- Krylov subspace recycling for sequences of shifted linear systems
- A note on augmented unprojected Krylov subspace methods
- Subspace Recycling--Based Regularization Methods
Cites work
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 1218975 (Why is no real title available?)
- scientific article; zbMATH DE number 592768 (Why is no real title available?)
- scientific article; zbMATH DE number 1069512 (Why is no real title available?)
- scientific article; zbMATH DE number 783550 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 1406963 (Why is no real title available?)
- A Deflated Version of the Conjugate Gradient Algorithm
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A Rayleigh-Ritz preconditioner for the iterative solution to large scale nonlinear problems
- A Restarted GMRES Method Augmented with Eigenvectors
- A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
- A combination of the fast multipole boundary element method and Krylov subspace recycling solvers
- A flexible generalized conjugate residual method with inner orthogonalization and deflated restarting
- A framework for deflated and augmented Krylov subspace methods
- A numerical study of various algorithms related to the preconditioned conjugate gradient method
- A simplified and flexible variant of \texttt{GCROT} for solving nonsymmetric linear systems
- Accelerating the shifted Laplace preconditioner for the Helmholtz equation by multilevel deflation
- Accelerating with rank-one updates
- Adaptively Preconditioned GMRES Algorithms
- An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- An augmented LSQR method
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- An introduction to domain decomposition methods. Algorithms, theory, and parallel implementation
- An overview of the Trilinos project
- Analysis of Augmented Krylov Subspace Methods
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- Analysis of acceleration strategies for restarted minimal residual methods
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Augmented GMRES-type methods
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Balancing domain decomposition
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BiCGStab() for families of shifted linear systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Block GMRES method with inexact breakdowns and deflated restarting
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Comparison of the deflated preconditioned conjugate gradient method and algebraic multigrid for composite materials
- Computational aspects of the stochastic finite element method
- Computing and deflating eigenvalues while solving multiple right-hand side linear systems with an application to quantum chromodynamics
- Computing reduced order models via inner-outer Krylov recycling in diffuse optical tomography
- Decomposition methods for large linear discrete ill-posed problems
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- Deflated and Augmented Krylov Subspace Techniques
- Deflated and augmented Krylov subspace methods: A framework for deflated BiCG and related solvers
- Deflated and restarted symmetric Lanczos methods for eigenvalues and linear equations with multiple right-hand sides
- Deflation and Balancing Preconditioners for Krylov Subspace Methods Applied to Nonsymmetric Matrices
- Deflation of Conjugate Gradients with Applications to Boundary Value Problems
- Eigenvalue translation based preconditioners for the GMRES(k) method
- Enabling off-design linearised aerodynamics analysis using Krylov subspace recycling technique
- Enriched Krylov subspace methods for ill-posed problems
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides.
- Fast Algorithms for Hyperspectral Diffuse Optical Tomography
- Fast CG-Based Methods for Tikhonov--Phillips Regularization
- Flexible GMRES with deflated restarting
- Flexible conjugate gradients
- GMRES convergence for perturbed coefficient matrices, with application to approximate deflation preconditioning
- GMRES with Deflated Restarting
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GMRESR: a family of nested GMRES methods
- Galerkin Projection Methods for Solving Multiple Linear Systems
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Incremental spectral preconditioners for sequences of linear systems
- Integral Equation Based Domain Decomposition Method for Solving Electromagnetic Wave Scattering From Non-Penetrable Objects
- Iterative Krylov Methods for Large Linear Systems
- Iterative accelerating algorithms with Krylov subspaces for the solution to large-scale nonlinear problems
- Krylov subspace recycling for sequences of shifted linear systems
- Krylov-subspace recycling via the POD-augmented conjugate-gradient method
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Large-scale topology optimization using preconditioned Krylov subspace methods with recycling
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Methods of conjugate gradients for solving linear systems
- Minimal Residual Method Stronger than Polynomial Preconditioning
- Mstab: stabilized induced dimension reduction for Krylov subspace recycling
- Multipreconditioned GMRES for shifted systems
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Nested Krylov methods based on GCR
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- On the construction of deflation-based preconditioners
- On the convergence of restarted Krylov subspace methods
- On the numerical solution of \(AX-XB=C\)
- Parallel Domain Decomposition Methods for Stochastic Elliptic Equations
- Parallel iterative methods for sparse linear systems
- Preconditioned recycling Krylov subspace methods for self-adjoint problems
- Probabilistic numerics and uncertainty in computations
- Projection techniques for iterative solution of \(A\underline x=\underline b\) with successive right-hand sides
- QMR-based projection techniques for the solution of non-Hermitian systems with multiple right-hand sides
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- R\(^3\)GMRES: including prior information in GMRES-type methods for discrete inverse problems
- Recycling BICG with an application to model reduction
- Recycling BiCGSTAB with an application to parametric model order reduction
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Recycling Krylov subspaces for CFD applications and a new hybrid recycling solver
- Recycling Krylov subspaces for efficient large-scale electrical impedance tomography
- Recycling Subspace Information for Diffuse Optical Tomography
- Restarted GMRES for Shifted Linear Systems
- Restarted GMRES preconditioned by deflation
- Restarted block-GMRES with deflation of eigenvalues
- Restarted full orthogonalization method for shifted linear systems
- Robust and efficient adjoint solver for complex flow conditions
- Solution of Sparse Indefinite Systems of Linear Equations
- Subspace recycling accelerates the parametric macro-modeling of MEMS
- The Lanczos method for parameterized symmetric linear systems with multiple right-hand sides
- The adaptive augmented GMRES method for solving ill-posed problems
- The deflated conjugate gradient method: convergence, perturbation and accuracy
- The rate of convergence of conjugate gradients
- Total and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problems
- Truncation Strategies for Optimal Krylov Subspace Methods
- Two recursive GMRES-type methods for shifted linear systems with general preconditioning
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Cited in
(8)- A sketch-and-select Arnoldi process
- Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
- Recycling Krylov subspace methods for sequences of linear systems. Analysis and applications
- A rational filtering algorithm for sequences of shifted symmetric linear systems with applications to frequency response analysis
- Subspace Acceleration for a Sequence of Linear Systems and Application to Plasma Simulation
- Krylov subspace recycling with randomized sketching for matrix functions
- Iterative Methods by Space Decomposition and Subspace Correction
- Acceleration of the subspace iteration method by selective repeated inverse iteration
This page was built for publication: A survey of subspace recycling iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144044)
