1,385 research outputs found

    Domain Decomposition preconditioning for high-frequency Helmholtz problems with absorption

    Get PDF
    In this paper we give new results on domain decomposition preconditioners for GMRES when computing piecewise-linear finite-element approximations of the Helmholtz equation −Δu−(k2+iε)u=f-\Delta u - (k^2+ {\rm i} \varepsilon)u = f, with absorption parameter ε∈R\varepsilon \in \mathbb{R}. Multigrid approximations of this equation with ε≠0\varepsilon \not= 0 are commonly used as preconditioners for the pure Helmholtz case (ε=0\varepsilon = 0). However a rigorous theory for such (so-called "shifted Laplace") preconditioners, either for the pure Helmholtz equation, or even the absorptive equation (ε≠0\varepsilon \not=0), is still missing. We present a new theory for the absorptive equation that provides rates of convergence for (left- or right-) preconditioned GMRES, via estimates of the norm and field of values of the preconditioned matrix. This theory uses a kk- and ε\varepsilon-explicit coercivity result for the underlying sesquilinear form and shows, for example, that if ∣ε∣∼k2|\varepsilon|\sim k^2, then classical overlapping additive Schwarz will perform optimally for the absorptive problem, provided the subdomain and coarse mesh diameters are carefully chosen. Extensive numerical experiments are given that support the theoretical results. The theory for the absorptive case gives insight into how its domain decomposition approximations perform as preconditioners for the pure Helmholtz case ε=0\varepsilon = 0. At the end of the paper we propose a (scalable) multilevel preconditioner for the pure Helmholtz problem that has an empirical computation time complexity of about O(n4/3)\mathcal{O}(n^{4/3}) for solving finite element systems of size n=O(k3)n=\mathcal{O}(k^3), where we have chosen the mesh diameter h∼k−3/2h \sim k^{-3/2} to avoid the pollution effect. Experiments on problems with h∼k−1h\sim k^{-1}, i.e. a fixed number of grid points per wavelength, are also given

    Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

    Full text link
    We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.Comment: 24 pages, Elsevier Journal of Computational and Applied Mathematics, Dec 201

    Preconditioning harmonic unsteady potential flow calculations

    Get PDF
    This paper considers finite element discretisations of the Helmholtz equation and its generalisation arising from harmonic acoustics perturbations to a non-uniform steady potential flow. A novel elliptic, positive definite preconditioner, with a multigrid implementation, is used to accelerate the iterative convergence of Krylov subspace solvers. Both theory and numerical results show that for a model 1D Helmholtz test problem the preconditioner clusters the discrete system's eigenvalues and lowers its condition number to a level independent of grid resolution. For the 2D Helmholtz equation, grid independent convergence is achieved using a QMR Krylov solver, significantly outperforming the popular SSOR preconditioner. Impressive results are also presented on more complex domains, including an axisymmetric aircraft engine inlet with non-stagnant mean flow and modal boundary conditions

    On the indefinite Helmholtz equation: complex stretched absorbing boundary layers, iterative analysis, and preconditioning

    Full text link
    This paper studies and analyzes a preconditioned Krylov solver for Helmholtz problems that are formulated with absorbing boundary layers based on complex coordinate stretching. The preconditioner problem is a Helmholtz problem where not only the coordinates in the absorbing layer have an imaginary part, but also the coordinates in the interior region. This results into a preconditioner problem that is invertible with a multigrid cycle. We give a numerical analysis based on the eigenvalues and evaluate the performance with several numerical experiments. The method is an alternative to the complex shifted Laplacian and it gives a comparable performance for the studied model problems
    • …
    corecore