Accelerating the iterative solution of convection-diffusion problems using singular value decomposition.
From MaRDI portal
Abstract: The discretization of convection-diffusion equations by implicit or semi-implicit methods leads to a sequence of linear systems usually solved by iterative linear solvers such as GMRES. Many techniques bearing the name of emph{recycling Krylov space methods} have been proposed to speed up the convergence rate after restarting, usually based on the selection and retention of some Arnoldi vectors. After providing a unified framework for the description of a broad class of recycling methods and preconditioners, we propose an alternative recycling strategy based on a singular value decomposition selection of previous solutions, and exploit this information in classical and new augmentation and deflation methods. The numerical tests in scalar non-linear convection-diffusion problems are promising for high-order methods.
Recommendations
- Preconditioned recycling Krylov subspace methods for self-adjoint problems
- Krylov-subspace recycling via the POD-augmented conjugate-gradient method
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Recycling Krylov subspaces for CFD applications and a new hybrid recycling solver
- Preconditioning parametrized linear systems
Cited in
(3)- Nonlinear diffusion, boundary layers and nonsmoothness: analysis of challenges in drift-diffusion semiconductor simulations
- An efficient iterative method for solving parameter-dependent and random convection-diffusion problems
- Initial Guesses for Sequences of Linear Systems in a GPU-Accelerated Incompressible Flow Solver
This page was built for publication: Accelerating the iterative solution of convection-diffusion problems using singular value decomposition.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120310)
