arXiv subjects

Andrew Gibbs

Publications and source records attributed to Andrew Gibbs.

7 recordsLinked to original sources

arXiv2026

Acoustic scattering by fractal inhomogeneities via geometry-conforming Galerkin methods for the Lippmann-Schwinger equation

We propose and analyse a numerical method for time-harmonic acoustic scattering in $\mathbb{R}^n$, $n=2,3$, by a class of inhomogeneities (penetrable scatterers) with fractal boundary. Our method is based on a Galerkin discretisation of the Lippmann-Schwinger volume integral equation, using a discontinuous piecewise-polynomial approximation space on a geometry-conforming mesh comprising elements which themselves have fractal boundary. We first provide a semi-discrete well-posedness and error analysis for both the $h$- and $p$-versions of our method for completely arbitrary inhomogeneities (without any regularity assumption on the boundary of the inhomogeneity or of the mesh elements). We prove convergence estimates for the integral equation solution and superconvergence estimates for linear functionals such as scattered field and far-field pattern evaluations, and elucidate how the regularity of the inhomogeneity boundary and the regularity of the refractive index affect the rates of convergence predicted. We then specialise to the case where the inhomogeneity is an ``$n$-attractor'', i.e.\ the fractal attractor of an iterated function system satisfying the open set condition with non-empty interior, showing how in this case the self-similarity of the inhomogeneity can be used to generate geometry-conforming meshes. For the $h$-version with piecewise constant approximation we also present singular quadrature rules, supported by a fully discrete error analysis, permitting practical implementation of our method. We present numerical results for two-dimensional examples, which validate our theoretical results and show that our method is significantly more accurate than a comparable method involving replacement of the fractal inhomogeneity by a smoother prefractal approximation.

math.NA↗

arXiv2023

Numerical evaluation of singular integrals on non-disjoint self-similar fractal sets

We consider the numerical evaluation of a class of double integrals with respect to a pair of self-similar measures over a self-similar fractal set (the attractor of an iterated function system), with a weakly singular integrand of logarithmic or algebraic type. In a recent paper [Gibbs, Hewett and Moiola, Numer. Alg., 2023] it was shown that when the fractal set is "disjoint" in a certain sense (an example being the Cantor set), the self-similarity of the measures, combined with the homogeneity properties of the integrand, can be exploited to express the singular integral exactly in terms of regular integrals, which can be readily approximated numerically. In this paper we present a methodology for extending these results to cases where the fractal is non-disjoint but non-overlapping (in the sense that the open set condition holds). Our approach applies to many well-known examples including the Sierpinski triangle, the Vicsek fractal, the Sierpinski carpet, and the Koch snowflake.

math.NA↗

arXiv2022

A Hausdorff-measure boundary element method for acoustic scattering by fractal screens

Sound-soft fractal screens can scatter acoustic waves even when they have zero surface measure. To solve such scattering problems we make what appears to be the first application of the boundary element method (BEM) where each BEM basis function is supported in a fractal set, and the integration involved in the formation of the BEM matrix is with respect to a non-integer order Hausdorff measure rather than the usual (Lebesgue) surface measure. Using recent results on function spaces on fractals, we prove convergence of the Galerkin formulation of this ``Hausdorff BEM'' for acoustic scattering in $\mathbb{R}^{n+1}$ ($n=1,2$) when the scatterer, assumed to be a compact subset of $\mathbb{R}^n\times\{0\}$, is a $d$-set for some $d\in (n-1,n]$, so that, in particular, the scatterer has Hausdorff dimension $d$. For a class of fractals that are attractors of iterated function systems, we prove convergence rates for the Hausdorff BEM and superconvergence for smooth antilinear functionals, under certain natural regularity assumptions on the solution of the underlying boundary integral equation. We also propose numerical quadrature routines for the implementation of our Hausdorff BEM, along with a fully discrete convergence analysis, via numerical (Hausdorff measure) integration estimates and inverse estimates on fractals, estimating the discrete condition numbers. Finally, we show numerical experiments that support the sharpness of our theoretical results, and our solution regularity assumptions, including results for scattering in $\mathbb{R}^2$ by Cantor sets, and in $\mathbb{R}^3$ by Cantor dusts.

math.NA↗

arXiv2020

Fast hybrid numerical-asymptotic boundary element methods for high frequency screen and aperture problems based on least-squares collocation

We present a hybrid numerical-asymptotic (HNA) boundary element method (BEM) for high frequency scattering by two-dimensional screens and apertures, whose computational cost to achieve any prescribed accuracy remains bounded with increasing frequency. Our method is a collocation implementation of the high order hp HNA approximation space of Hewett et al. IMA J. Numer. Anal. 35 (2015), pp.1698- 1728, where a Galerkin implementation was studied. An advantage of the current collocation scheme is that the one-dimensional highly oscillatory singular integrals appearing in the BEM matrix entries are significantly easier to evaluate than the two-dimensional integrals appearing in the Galerkin case, which leads to much faster computation times. Here we compute the required integrals at frequency-independent cost using the numerical method of steepest descent, which involves complex contour deformation. The change from Galerkin to collocation is nontrivial because naive collocation implementations based on square linear systems suffer from severe numerical instabilities associated with the numerical redundancy of the HNA basis, which produces highly ill-conditioned BEM matrices. In this paper we show how these instabilities can be removed by oversampling, and solving the resulting overdetermined collocation system in a weighted least-squares sense using a truncated singular value decomposition. On the basis of our numerical experiments, the amount of oversampling required to stabilise the method is modest (around 25% typically suffices) and independent of frequency. As an application of our method we present numerical results for high frequency scattering by prefractal approximations to the middle-third Cantor set.

math.NA↗

arXiv2020

A high frequency boundary element method for scattering by a class of multiple obstacles

We propose a boundary element method for problems of time-harmonic acoustic scattering by multiple obstacles in two dimensions, at least one of which is a convex polygon. By combining a Hybrid Numerical Asymptotic (HNA) approximation space on the convex polygon with standard polynomial-based approximation spaces on each of the other obstacles, we show that the number of degrees of freedom required in the HNA space to maintain a given accuracy needs to grow only logarithmically with respect to the frequency, as opposed to the (at least) linear growth required by standard polynomial-based schemes. This method is thus most effective when the convex polygon is many wavelengths in diameter and the small obstacles have a combined perimeter comparable to the problem wavelength.

math.NA↗

arXiv2019

High-frequency bounds for the Helmholtz equation under parabolic trapping and applications in numerical analysis

This paper is concerned with resolvent estimates on the real axis for the Helmholtz equation posed in the exterior of a bounded obstacle with Dirichlet boundary conditions when the obstacle is trapping. There are two resolvent estimates for this situation currently in the literature: (i) in the case of elliptic trapping the general "worst case" bound of exponential growth applies, and examples show that this growth can be realised through some sequence of wavenumbers, (ii) in the prototypical case of hyperbolic trapping where the Helmholtz equation is posed in the exterior of two strictly convex obstacles (or several obstacles with additional constraints) the nontrapping resolvent estimate holds with a logarithmic loss. This paper proves the first resolvent estimate for parabolic trapping by obstacles, studying a class of obstacles the prototypical example of which is the exterior of two squares (in 2-d), or two cubes (in 3-d), whose sides are parallel. We show, via developments of the vector-field/multiplier argument of Morawetz and the first application of this methodology to trapping configurations, that a resolvent estimate holds with a polynomial loss over the nontrapping estimate. We use this bound, along with the other trapping resolvent estimates, to prove results about integral-equation formulations of the boundary value problem in the case of trapping. Feeding these bounds into existing frameworks for analysing finite and boundary element methods, we obtain the first wavenumber-explicit proofs of convergence for numerical methods for solving the Helmholtz equation in the exterior of a trapping obstacle.

math.AP↗

arXiv2018

Numerically stable computation of embedding formulae for scattering by polygons

For problems of time-harmonic scattering by polygonal obstacles, embedding formulae provide a useful means of computing the far-field coefficient induced by any incident plane wave, given the far-field coefficient of a relatively small set of canonical problems. The number of such problems to be solved depends only on the geometry of the scatterer. Whilst the formulae themselves are exact in theory, any implementation will inherit numerical error from the method used to solve the canonical problems. This error can lead to numerical instabilities. Here, we present an effective approach to identify and regulate these instabilities. This approach is subsequently extended to the case where the incident wave is a Herglotz wave function, and we suggest how this could potentially remove frequency dependence of a T-matrix method.

math.NA↗