Fast solution of boundary integral equations with the generalized Neumann kernel

Abstract

A fast method for solving boundary integral equations with the generalized Neumann kernel and the adjoint generalized Neumann kernel is presented. The method is based on discretizing the integral equations by the Nyström method with the trapezoidal rule to obtain $(m+1)n\times (m+1)n$ linear systems where $m+1$ is the multiplicity of the multiply connected domain and $n$ is the number of nodes in the discretization of each boundary component. The obtained linear systems are solved by the generalized minimal residual (GMRES) method. Each iteration of the GMRES method requires a matrix-vector product which can be computed using the Fast Multipole Method (FMM). The complexity of the presented method is $O((m+1)n\ln n)$ for the integral equation with the generalized Neumann kernel and $O((m+1)n)$ for the integral equation with the adjoint generalized Neumann kernel. The presented numerical results illustrate that the presented method gives accurate results even for domains with high connectivity, domains with piecewise smooth boundaries, and domains with close boundaries.

References in corpus (1)

• Numerical conformal mapping via a boundary integral equation with the adjoint generalized Neumann kernel

Cited by in corpus (8)

• Fast and accurate computation of the logarithmic capacity of compact sets
• Numerical computation of the conformal map onto lemniscatic domains
• Circular arc polygons, numerical conformal mappings, and moduli of quadrilaterals
• Condenser capacity and hyperbolic perimeter
• Numerical computation of Mityuk's function and radius for circular-radial slit domains
• Application of integral equations to simulate local fields in carbon nanotube reinforced composites
• Condenser capacity and hyperbolic diameter
• Averaged Nyström interpolants for the solution of Fredholm integral equations of the second kind