SearcharxivSearch

arXiv · 2411.08342

Recursive reduction quadrature for the evaluation of Laplace layer potentials in three dimensions

Abstract

A high-order quadrature scheme is constructed for the evaluation of Laplace single and double layer potentials and their normal derivatives on smooth surfaces in three dimensions. The construction begins with a harmonic approximation of the density on each patch, which allows for a natural harmonic polynomial extension in a volumetric neighborhood of the patch in the ambient space. Then by the general Stokes theorem, singular and nearly singular surface integrals are reduced to line integrals preserving the singularity of the kernel, instead of the standard origin-centered 1-forms that require expensive adaptive integration. These singularity-preserving line integrals can be semi-analytically evaluated using singularity-swap quadrature. In other words, the evaluation of singular and nearly singular surface integrals is reduced to function evaluations at the vertices on the boundary of each patch. The recursive reduction quadrature largely removes adaptive integration that is needed in most existing high-order quadratures for singular and nearly singular surface integrals, resulting in exceptional performance. The scheme achieves twelve-digit accuracy uniformly for close evaluations and offers a speedup of five times or more in constructing the sparse quadrature-correction matrix compared to previous state-of-the-art quadrature schemes.

Explore related subjects

Keep this discovery

BibTeXRIS

Shidong Jiang, Hai Zhu. 2026-09-03. Recursive reduction quadrature for the evaluation of Laplace layer potentials in three dimensions. https://arxiv.org/abs/2411.08342

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA