Adaptive GMRES(m) for the Electromagnetic Scattering Problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2232796 (Why is no real title available?)
- A Krylov--Schur algorithm for large eigenproblems
- A Restarted GMRES Method Augmented with Eigenvectors
- A Technique for Accelerating the Convergence of Restarted GMRES
- A multigrid method enhanced by Krylov subspace iteration for discrete Helmholtz equations
- A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm
- A simple strategy for varying the restart parameter in GMRES\((m)\)
- Applying GMRES to the Helmholtz equation with shifted Laplacian preconditioning: What is the largest shift for which wavenumber-independent convergence is guaranteed?
- Experimental study of ILU preconditioners for indefinite matrices
- GMRES with Deflated Restarting
- GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Heavy ball restarted CMRH methods for linear systems
- On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems
- Preconditioning Helmholtz linear systems
- Preconditioning iterative algorithm for the electromagnetic scattering from a large cavity.
- Recent computational developments in Krylov subspace methods for linear systems
- The Tortoise and the Hare Restart GMRES
- Why it is difficult to solve Helmholtz problems with classical iterative methods
- \(\text{GMRES}(m)\) algorithm with changing the restart cycle adaptively
Cited in
(3)
This page was built for publication: Adaptive GMRES(m) for the Electromagnetic Scattering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068995)
