1,248 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

    Analysis of a Helmholtz preconditioning problem motivated by uncertainty quantification

    Get PDF
    This paper analyses the following question: let Aj\mathbf{A}_j, j=1,2,j=1,2, be the Galerkin matrices corresponding to finite-element discretisations of the exterior Dirichlet problem for the heterogeneous Helmholtz equations āˆ‡ā‹…(Ajāˆ‡uj)+k2njuj=āˆ’f\nabla\cdot (A_j \nabla u_j) + k^2 n_j u_j= -f. How small must āˆ„A1āˆ’A2āˆ„Lq\|A_1 -A_2\|_{L^q} and āˆ„n1āˆ’n2āˆ„Lq\|{n_1} - {n_2}\|_{L^q} be (in terms of kk-dependence) for GMRES applied to either (A1)āˆ’1A2(\mathbf{A}_1)^{-1}\mathbf{A}_2 or A2(A1)āˆ’1\mathbf{A}_2(\mathbf{A}_1)^{-1} to converge in a kk-independent number of iterations for arbitrarily large kk? (In other words, for A1\mathbf{A}_1 to be a good left- or right-preconditioner for A2\mathbf{A}_2?). We prove results answering this question, give theoretical evidence for their sharpness, and give numerical experiments supporting the estimates. Our motivation for tackling this question comes from calculating quantities of interest for the Helmholtz equation with random coefficients AA and nn. Such a calculation may require the solution of many deterministic Helmholtz problems, each with different AA and nn, and the answer to the question above dictates to what extent a previously-calculated inverse of one of the Galerkin matrices can be used as a preconditioner for other Galerkin matrices

    Numerical methods for integral equations of Mellin type

    Get PDF
    We present a survey of numerical methods (based on piecewise polynomial approximation) for integral equations of Mellin type, including examples arising in boundary integral methods for partial differential equations on polygonal domains

    Convergence of Restricted Additive Schwarz with impedance transmission conditions for discretised Helmholtz problems

    Get PDF
    The Restricted Additive Schwarz method with impedance transmission conditions, also known as the Optimised Restricted Additive Schwarz (ORAS) method, is a simple overlapping one-level parallel domain decomposition method, which has been successfully used as an iterative solver and as a preconditioner for discretized Helmholtz boundary-value problems. In this paper, we give, for the first time, a convergence analysis for ORAS as an iterative solver -- and also as a preconditioner -- for nodal finite element Helmholtz systems of any polynomial order. The analysis starts by showing (for general domain decompositions) that ORAS as an unconventional finite element approximation of a classical parallel iterative Schwarz method, formulated at the PDE (non-discrete) level. This non-discrete Schwarz method was recently analysed in [Gong, Gander, Graham, Lafontaine, Spence, arXiv 2106.05218], and the present paper gives a corresponding discrete version of this analysis. In particular, for domain decompositions in strips in 2-d, we show that, when the mesh size is small enough, ORAS inherits the convergence properties of the Schwarz method, independent of polynomial order. The proof relies on characterising the ORAS iteration in terms of discrete `impedance-to-impedance maps', which we prove (via a novel weighted finite-element error analysis) converge as hā†’0h\rightarrow 0 in the operator norm to their non-discrete counterparts.Comment: 34 pages, 2 figure
    • ā€¦
    corecore