arXiv subjects

Timo Betcke

Publications and source records attributed to Timo Betcke.

23 records · Page 2Linked to original sources

arXiv2017

Product algebras for Galerkin discretisations of boundary integral operators and their applications

Operator products occur naturally in a range of regularized boundary integral equation formulations. However, while a Galerkin discretisation only depends on the domain space and the test (or dual) space of the operator, products require a notion of the range. In the boundary element software package Bempp we have implemented a complete operator algebra that depends on knowledge of the domain, range and test space. The aim was to develop a way of working with Galerkin operators in boundary element software that is as close to working with the strong form on paper as possible while hiding the complexities of Galerkin discretisations. In this paper, we demonstrate the implementation of this operator algebra and show, using various Laplace and Helmholtz example problems, how it significantly simplifies the definition and solution of a wide range of typical boundary integral equation problems.

math.NA↗

arXiv2017

Simple and efficient GPU parallelization of existing H-Matrix accelerated BEM code

In this paper, we demonstrate how GPU-accelerated BEM routines can be used in a simple black-box fashion to accelerate fast boundary element formulations based on Hierarchical Matrices (H-Matrices) with ACA (Adaptive Cross Approximation). In particular, we focus on the expensive evaluation of the discrete weak form of boundary operators associated with the Laplace and the Helmholtz equation in three space dimensions. The method is based on offloading the CPU assembly of elements during the ACA assembly onto a GPU device and to use threading strategies across ACA blocks to create sufficient workload for the GPU. The proposed GPU strategy is designed such that it can be implemented in existing code with minimal changes to the surrounding application structure. This is in particular interesting for existing legacy code that is not from the ground-up designed with GPU computing in mind. Our benchmark study gives realistic impressions of the benefits of GPU-accelerated BEM simulations by using state-of-the-art multi-threaded computations on modern high-performance CPUs as a reference, rather than drawing synthetic comparisons with single-threaded codes. Speed-up plots illustrate that performance gains up to a factor of 5.5 could be realized with GPU computing under these conditions. This refers to a boundary element model with about 4 million unknowns, whose H-Matrix weak form associated with a real-valued (Laplace) boundary operator is set up in only 100 minutes harnessing the two GPUs instead of 9 hours when using the 20 CPU cores at disposal only. The benchmark study is followed by a particularly demanding real-life application, where we compute the scattered high-frequency sound field of a submarine to demonstrate the increase in overall application performance from moving to a GPU-based ACA assembly.

cs.DC↗

arXiv2017

Software frameworks for integral equations in electromagnetic scattering based on Calderón identities

In recent years there have been tremendous advances in the theoretical understanding of boundary integral equations for Maxwell problems. In particular, stable dual pairing of discretisation spaces have been developed that allow robust formulations of the preconditioned electric field, magnetic field and combined field integral equations. Within the BEM++ boundary element library we have developed implementations of these frameworks that allow an intuitive formulation of the typical Maxwell boundary integral formulations within a few lines of code. The basis of these developments is an efficient and robust implementations of Calderón identities together with a product algebra that hides and automates most technicalities involved in assembling Galerkin boundary integral equations. In this paper we demonstrate this framework and use it to derive very simple and robust software formulations of the standard preconditioned electric field, magnetic field and regularised combined field integral equations for Maxwell.

math.NA↗

arXiv2014

The Factorization method for three dimensional Electrical Impedance Tomography

The use of the Factorization method for Electrical Impedance Tomography has been proved to be very promising for applications in the case where one wants to find inhomogeneous inclusions in a known background. In many situations, the inspected domain is three dimensional and is made of various materials. In this case, the main challenge in applying the Factorization method consists in computing the Neumann Green's function of the background medium. We explain how we solve this difficulty and demonstrate the capability of the Factorization method to locate inclusions in realistic inhomogeneous three dimensional background media from simulated data obtained by solving the so-called complete electrode model. We also perform a numerical study of the stability of the Factorization method with respect to various modelling errors.

math.AP↗

arXiv2010

Condition number estimates for combined potential integral operators in acoustics and their boundary element discretisation

We consider the classical coupled, combined-field integral equation formulations for time-harmonic acoustic scattering by a sound soft bounded obstacle. In recent work, we have proved lower and upper bounds on the $L^2$ condition numbers for these formulations, and also on the norms of the classical acoustic single- and double-layer potential operators. These bounds to some extent make explicit the dependence of condition numbers on the wave number $k$, the geometry of the scatterer, and the coupling parameter. For example, with the usual choice of coupling parameter they show that, while the condition number grows like $k^{1/3}$ as $k\to\infty$, when the scatterer is a circle or sphere, it can grow as fast as $k^{7/5}$ for a class of `trapping' obstacles. In this paper we prove further bounds, sharpening and extending our previous results. In particular we show that there exist trapping obstacles for which the condition numbers grow as fast as $\exp(γk)$, for some $γ>0$, as $k\to\infty$ through some sequence. This result depends on exponential localisation bounds on Laplace eigenfunctions in an ellipse that we prove in the appendix. We also clarify the correct choice of coupling parameter in 2D for low $k$. In the second part of the paper we focus on the boundary element discretisation of these operators. We discuss the extent to which the bounds on the continuous operators are also satisfied by their discrete counterparts and, via numerical experiments, we provide supporting evidence for some of the theoretical results, both quantitative and asymptotic, indicating further which of the upper and lower bounds may be sharper.

math.NA↗