• Corpus ID: 328787

Shifted Laplace preconditioners for the Helmholtz equations

  title={Shifted Laplace preconditioners for the Helmholtz equations},
  author={Cornelis Vuik and Yogi A. Erlangga},
  journal={Reports of the Department of Applied Mathematical Analysis},
  • C. VuikY. Erlangga
  • Published 2003
  • Computer Science
  • Reports of the Department of Applied Mathematical Analysis
In this paper, we present a numerical method to solve the time-harmonic wave equation in 2D heterogeneous media. The underlying equation governs wave propagations and scattering phenomena arising in acoustic and optical problems. In particular, we look for solutions of the Helmholtz equation discretized by a finite difference method. Since the number of gridpoints per wavelength should be sufficiently large to result in acceptable solutions, for very high wavenumbers the discrete problem… 

Figures and Tables from this paper

Numerical Aspects of Iterative Solving of Linear Systems derived from Helmholtz's Problem

  • J. Tang
  • Mathematics, Computer Science
  • 2004
Several numerical aspects and difficulties for solving a large linear system, derived from the Helmholtz equation, are overviewed and the numerical and exact solution of the one-dimensional HBVP in cases when the wavenumber and the source term are both real-valued is given.

A survey of finite element methods for time-harmonic acoustics

The development of a finite volume method for modeling sound in coastal ocean environment

The rapid growth of renewable energy from offshore sources has raised concerns that underwater noise from construction and operation of offshore devices may interfere with communication of marine

Méthodes de décomposition de domaines pour des problèmes de propagation d'ondes hétérogènes

Dans cette these on considere des algorithmes de Schwarz appliques aux problemes harmoniques heterogenes (Maxwell et Helmholtz) en deux et trois dimensions. On fait l'etude pour une decomposition en


The approach taken in this paper is to preconditions this linear system with a sine transform based preconditioner and then solve it using the generalized minimum residual method (GMRES).



Preconditioned iterative solution of the 2D Helmholtz equation

Numerical analysis shows the preconditioner to be effective on a simple 1D test problem, and results are presented showing considerable convergence acceleration for a number of different Krylov methods for more complex problems in 2D, as well as for the more general problem of harmonic disturbances to a non-stagnant steady flow.

On a Class of Preconditioners for Solving the Helmholtz Equation

An Iterative method for the Helmholtz equation

CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems

A Lanczos-type method is presented for nonsymmetric sparse linear systems as arising from discretisations of elliptic partial differential equations. The method is based on a polynomial variant of

A Petrov-Galerkin type method for solving Axk=b, where A is symmetric complex

Discretization of steady-state eddy-current equations may lead to linear system Ax=b in which the complex matrix A is not Hermitian, but may be chosen symmetric. In the positive definite Hermitian

Preconditioning indefinite discretization matrices

A careful algebraic analysis of the condition numbers and the spectra of perturbed matrices which are preconditioned by the same matrices as in the unperturbed case is shown.

Comparison of Krylov-type methods for complex linear systems applied to high-voltage problems

Comparisons between different Krylov-subspace methods, also in combination with residual smoothing techniques, and parameter studies are presented in this paper to find a sufficiently robust solution method for high-voltage power plants.

GMRESR: a family of nested GMRES methods

Recently Eirola and Nevanlinna have proposed an iterativ<: solution method for unsymmetric linear systems, in which the preconditioner is updated from step to step. Following their ideas we suggest

A Flexible Inner-Outer Preconditioned GMRES Algorithm

  • Y. Saad
  • Computer Science
    SIAM J. Sci. Comput.
  • 1993
A variant of the GMRES algorithm is presented that allows changes in the preconditioning at every step, resulting in a result of the flexibility of the new variant that any iterative method can be used as a preconditionser.