Fourier Analysis of GMRES(m) Preconditioned by Multigrid

  title={Fourier Analysis of GMRES(m) Preconditioned by Multigrid},
  author={Roman Wienands and Cornelis W. Oosterlee and Takumi Washio},
  journal={SIAM J. Sci. Comput.},
This paper deals with convergence estimates of GMRES(m) [Saad and Schultz, { SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856--869] preconditioned by multigrid [Brandt, Math. Comp., 31 (1977), pp. 333--390], [Hackbusch, Multi-Grid Methods and Applications, Springer, Berlin, 1985]. Fourier analysis is a well-known and useful tool in the multigrid community for the prediction of two-grid convergence rates [Brandt, Math. Comp., 31 (1977), pp. 333--390], [Stuben and Trottenberg, in Multigrid… 

Local Fourier analysis of the complex shifted Laplacian preconditioner for Helmholtz problems

A wavenumber‐dependent minimal complex shift parameter is proposed, which is predicted by a rigorous k‐grid local Fourier analysis of the multigrid scheme and claimed to provide the reader with a parameter choice that leads to efficient Krylov convergence.

A multigrid preconditioner for an adaptive Black-Scholes solver

The eigenvalue spectrum of the multigrid iteration matrix for uniform grid problems is analysed and the method’s efficiency in practice is illustrated by considering the results of numerical experiments on both uniform grids and those which use adaptivity in space.

A generalized predictive analysis tool for multigrid methods

The semi-algebraic mode analysis (SAMA) proposed here couples standard local Fourier analysis approaches with algebraic computation to enable analysis of a wider class of problems, including those with strong advective character, as well as a two-dimensional convection-diffusion problem.

Multigrid preconditioners for Bi-CGSTAB for the sparse-grid solution of high-dimensional anisotropic diffusion equation

This work presents is a solver based on the Krylov subspace method Bi-CGSTAB preconditioned with d-multigrid, a robust combination of the two methods that results in a solvers that converges well for a wide class of discrete problems arising from discretization on various anisotropic grids.

A Fourier Transform Analysis of Convergence Properties of Multigrid V-Cycle Algorithm

The Fourier transform analysis is implemented to compute quantitatively the frequency spectrum of components of the residual resulted from the MG iterations, and shows that the complexity of the MG method is close to [Formula], meaning that it is a close-to-linear scalable solver, which echoes the findings given by other literature.

Multicolor Fourier analysis of the multigrid method for quadratic FEM discretizations

A multi-level preconditioned Krylov method for the efficient solution of algebraic tomographic reconstruction problems

Numerical experiments are promising, showing the use of Krylov solvers for tomographic linear inversion problems to be competitive with the classical Algebraic Reconstruction Techniques in terms of convergence speed and overall performance (CPU time) as well as precision of the reconstruction.

Local Fourier analysis for multigrid with overlapping smoothers applied to systems of PDEs

A local Fourier analysis (LFA, or local mode analysis) framework for analyzing the complementarity between relaxation and coarse‐grid correction within multigrid solvers for systems of PDEs is presented.

Efficient d-multigrid preconditioners for sparse-grid solution of high-dimensional partial differential equations

This paper presents a robust solver based on the Krylov subspace method Bi-CGSTAB combined with a powerful, and efficient, multigrid preconditioner that converges well for a wide class of discrete problems arising from discretization on various anisotropic grids.



An Evaluation of Parallel Multigrid as a Solver and a Preconditioner for Singularly Perturbed Problems

This paper tries to achieve h-independent convergence with preconditioned GMRES with three recently developed multigrid methods for two-dimensional (2D) singularly perturbed equations with eigenvalue spectra analyzed for the equations solved in order to understand the convergence of the three algorithms.

Krylov Subspace Acceleration of Nonlinear Multigrid with Application to Recirculating Flows

This paper deals with the combination of two solution methods: multigrid and GMRES, and uses the full approximation storage (FAS) scheme as the "preconditioner" for a nonlinear Krylov subspace method.

How Fast are Nonsymmetric Matrix Iterations?

It is shown that the convergence of CGN is governed by singular values and that of GMRES and CGS by eigenvalues or pseudo-eigenvalues, and the three methods are found to be fundamentally different.

On the order of prolongations and restrictions in multigrid procedures

Multi-level adaptive solutions to boundary-value problems math comptr

The boundary-value problem is discretized on several grids (or finite-element spaces) of widely different mesh sizes, enabling us to conveniently adapt the discretization to the evolving solution in a nearly optimal way, obtaining "°°-order" approximations and low n, even when singularities are present.

Schwarz Methods: To Symmetrize or Not to Symmetrize

It is conjectured that enforcing minimal symmetry achieves the best results when combined with conjugate gradient acceleration and it is shown that the absence of symmetry in the linear preconditioner is advantageous when the linear method is accelerated by using the Bi-CGstab method.

Iterative Solution of Large Sparse Systems of Equations

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods

Multi-grid methods and applications

  • W. Hackbusch
  • Mathematics
    Springer series in computational mathematics
  • 1985
This paper presents the Multi-Grid Method of the Second Kind, a method for solving Singular Perturbation Problems and Eigenvalue Problems and Singular Equations of the Two-Grid Iteration.

On Recombining Iterants in Multigrid Algorithms and Problems with Small Islands

This article deals with nearly singular problems and with problems having small “islands” or other small features not visible on a coarse grid, in which cases usual multigrid solvers converge slowly