906 research outputs found

    An optimal 25-point finite difference scheme for the Helmholtz equation with PML

    Get PDF
    AbstractIn this paper, we present an optimal 25-point finite difference scheme for solving the Helmholtz equation with perfectly matched layer (PML) in two dimensional domain. Based on minimizing the numerical dispersion, we propose the refined choice strategy for choosing optimal parameters of the 25-point finite difference scheme. Numerical experiments are given to illustrate the improvement of the accuracy and the reduction of the numerical dispersion

    Near-optimal perfectly matched layers for indefinite Helmholtz problems

    Full text link
    A new construction of an absorbing boundary condition for indefinite Helmholtz problems on unbounded domains is presented. This construction is based on a near-best uniform rational interpolant of the inverse square root function on the union of a negative and positive real interval, designed with the help of a classical result by Zolotarev. Using Krein's interpretation of a Stieltjes continued fraction, this interpolant can be converted into a three-term finite difference discretization of a perfectly matched layer (PML) which converges exponentially fast in the number of grid points. The convergence rate is asymptotically optimal for both propagative and evanescent wave modes. Several numerical experiments and illustrations are included.Comment: Accepted for publication in SIAM Review. To appear 201

    The PML for rough surface scattering

    Get PDF
    In this paper we investigate the use of the perfectly matched layer (PML) to truncate a time harmonic rough surface scattering problem in the direction away from the scatterer. We prove existence and uniqueness of the solution of the truncated problem as well as an error estimate depending on the thickness and composition of the layer. This global error estimate predicts a linear rate of convergence (under some conditions on the relative size of the real and imaginary parts of the PML function) rather than the usual exponential rate. We then consider scattering by a half-space and show that the solution of the PML truncated problem converges globally at most quadratically (up to logarithmic factors), providing support for our general theory. However we also prove exponential convergence on compact subsets. We continue by proposing an iterative correction method for the PML truncated problem and, using our estimate for the PML approximation, prove convergence of this method. Finally we provide some numerical results in 2D.(C) 2008 IMACS. Published by Elsevier B.V. All rights reserved

    A rapidly converging domain decomposition method for the Helmholtz equation

    Full text link
    A new domain decomposition method is introduced for the heterogeneous 2-D and 3-D Helmholtz equations. Transmission conditions based on the perfectly matched layer (PML) are derived that avoid artificial reflections and match incoming and outgoing waves at the subdomain interfaces. We focus on a subdivision of the rectangular domain into many thin subdomains along one of the axes, in combination with a certain ordering for solving the subdomain problems and a GMRES outer iteration. When combined with multifrontal methods, the solver has near-linear cost in examples, due to very small iteration numbers that are essentially independent of problem size and number of subdomains. It is to our knowledge only the second method with this property next to the moving PML sweeping method.Comment: 16 pages, 3 figures, 6 tables - v2 accepted for publication in the Journal of Computational Physic

    Absolute value preconditioning for symmetric indefinite linear systems

    Full text link
    We introduce a novel strategy for constructing symmetric positive definite (SPD) preconditioners for linear systems with symmetric indefinite matrices. The strategy, called absolute value preconditioning, is motivated by the observation that the preconditioned minimal residual method with the inverse of the absolute value of the matrix as a preconditioner converges to the exact solution of the system in at most two steps. Neither the exact absolute value of the matrix nor its exact inverse are computationally feasible to construct in general. However, we provide a practical example of an SPD preconditioner that is based on the suggested approach. In this example we consider a model problem with a shifted discrete negative Laplacian, and suggest a geometric multigrid (MG) preconditioner, where the inverse of the matrix absolute value appears only on the coarse grid, while operations on finer grids are based on the Laplacian. Our numerical tests demonstrate practical effectiveness of the new MG preconditioner, which leads to a robust iterative scheme with minimalist memory requirements

    Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers

    Full text link
    This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow the general structure of constructing an approximate LDLtLDL^t factorization by eliminating the unknowns layer by layer starting from an absorbing layer or boundary condition. The central idea of this paper is to approximate the Schur complement matrices of the factorization using moving perfectly matched layers (PMLs) introduced in the interior of the domain. Applying each Schur complement matrix is equivalent to solving a quasi-1D problem with a banded LU factorization in the 2D case and to solving a quasi-2D problem with a multifrontal method in the 3D case. The resulting preconditioner has linear application cost and the preconditioned iterative solver converges in a number of iterations that is essentially indefinite of the number of unknowns or the frequency. Numerical results are presented in both two and three dimensions to demonstrate the efficiency of this new preconditioner.Comment: 25 page
    • …
    corecore