Optimization of fast algorithms for global quadrature by expansion using target-specific expansions
From MaRDI portal
Publication:2222965
DOI10.1016/J.JCP.2019.108976zbMATH Open1453.65464arXiv1811.01110OpenAlexW2898936786WikidataQ127031755 ScholiaQ127031755MaRDI QIDQ2222965FDOQ2222965
Authors: Matt Wala, Andreas Klöckner 
Publication date: 28 January 2021
Published in: Journal of Computational Physics (Search for Journal in Brave)
Abstract: We develop an algorithm for the asymptotically fast evaluation of layer potentials close to and on the source geometry, combining Geometric Global Accelerated QBX (`GIGAQBX') and target-specific expansions. GIGAQBX is a fast high-order scheme for evaluation of layer potentials based on Quadrature by Expansion (`QBX') using local expansions formed via the Fast Multipole Method (FMM). Target-specific expansions serve to lower the cost of the formation and evaluation of QBX local expansions, reducing the associated computational effort from to in three dimensions, without any accuracy loss compared with conventional expansions, but with the loss of source/target separation in the expansion coefficients. GIGAQBX is a `global' QBX scheme, meaning that the potential is mediated entirely through expansions for points close to or on the boundary. In our scheme, this single global expansion is decomposed into two parts that are evaluated separately: one part incorporating near-field contributions using target-specific expansions, and one part using conventional spherical harmonic expansions of far-field contributions, noting that convergence guarantees only exist for the sum of the two sub-expansions. By contrast, target-specific expansions were originally introduced as an acceleration mechanism for `local' QBX schemes, in which the far-field does not contribute to the QBX expansion. Compared with the unmodified GIGAQBX algorithm, we show through a reproducible, time-calibrated cost model that the combined scheme yields a considerable cost reduction for the near-field evaluation part of the computation. We support the effectiveness of our scheme through numerical results demonstrating performance improvements for Laplace and Helmholtz kernels.
Full work available at URL: https://arxiv.org/abs/1811.01110
Recommendations
- A fast algorithm with error bounds for quadrature by expansion
- A fast algorithm for quadrature by expansion in three dimensions
- Fast algorithms for quadrature by expansion. I: Globally valid expansions
- Quadrature by expansion: a new method for the evaluation of layer potentials
- A local target specific quadrature by expansion method for evaluation of layer potentials in 3D
integral equationsquadraturefast algorithmsfast multipole methodsingular integraltarget-specific expansion
Numerical integration (65D30) Fundamental solutions, Green's function methods, etc. for boundary value problems involving PDEs (65N80) Numerical methods for integral equations (65R20)
Cites Work
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Linear integral equations
- Title not available (Why is that?)
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- A fast adaptive multipole algorithm in three dimensions
- Quadrature by expansion: a new method for the evaluation of layer potentials
- Über das Dirichletsche Außenraumproblem für die Helmholtzsche Schwingungsgleichung
- A fast and stable method for rotating spherical harmonic expansions
- On the convergence of local expansions of layer potentials
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- An Implementation of the Fast Multipole Method without Multipoles
- Spectra of Multiplication Operators as a Numerical Tool
- The Parallel Multipole Method on the Connection Machine
- Title not available (Why is that?)
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- Error estimates for the fast multipole method. II. The three-dimensional case
- A fast algorithm for quadrature by expansion in three dimensions
- Error estimation for quadrature by expansion in layer potential evaluation
- A local target specific quadrature by expansion method for evaluation of layer potentials in 3D
- Fast algorithms for quadrature by expansion. I: Globally valid expansions
- A fast algorithm with error bounds for quadrature by expansion
- Optimizing the adaptive fast multipole method for fractal sets
Cited In (15)
- A fast integral equation method for the two-dimensional Navier-Stokes equations
- A fast algorithm for quadrature by expansion in three dimensions
- A fast, high-order scheme for evaluating volume potentials on complex 2D geometries via area-to-line integral conversion and domain mappings
- FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions
- Finite Elements for Helmholtz Equations with a Nonlocal Boundary Condition
- A fast algorithm with error bounds for quadrature by expansion
- Quadrature by two expansions: evaluating Laplace layer potentials using complex polynomial and plane wave expansions
- A robust solver for elliptic PDEs in 3D complex geometries
- Fast multipole methods for the evaluation of layer potentials with locally-corrected quadratures
- High-order close evaluation of Laplace layer potentials: a differential geometric approach
- Fast algorithms for quadrature by expansion. I: Globally valid expansions
- Recursive computation of the multipole expansions of layer potential integrals over simplices for efficient fast multipole accelerated boundary elements
- A high-order fast boundary element method with near-boundary stability for field emission from nanoscale structures
- Integration of the modified double layer potential of the vector boundary element method for eddy current problems
- Recursive analytical quadrature for the close evaluation of Laplace and Helmholtz layer potentials over flat boundary elements in \(\mathbb{R}^3\)
Uses Software
This page was built for publication: Optimization of fast algorithms for global quadrature by expansion using target-specific expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222965)
