NANADec 22, 2017

Partition of Unity Extension of Functions on Complex Domains

arXiv:1712.0846133 citationsh-index: 29
Originality Incremental advance
AI Analysis

Provides an efficient, parallelizable function extension method for boundary integral methods on complex domains, enabling high-accuracy solutions to inhomogeneous PDEs.

The paper introduces PUX, a parallel algorithm for extending functions from complex 2D domains using overlapping partitions and radial basis functions, achieving tenth-order convergence down to 10^{-14} error when solving Poisson equations.

We introduce an efficient algorithm, called partition of unity extension or PUX, to construct an extension of desired regularity of a function given on a complex multiply connected domain in $2D$. Function extension plays a fundamental role in extending the applicability of boundary integral methods to inhomogeneous partial differential equations with embedded domain techniques. Overlapping partitions are placed along the boundaries, and a local extension of the function is computed on each patch using smooth radial basis functions; a trivially parallel process. A partition of unity method blends the local extrapolations into a global one, where weight functions impose compact support. The regularity of the extended function can be controlled by the construction of the partition of unity function. We evaluate the performance of the PUX method in the context of solving the Poisson equation on multiply connected domains using a boundary integral method and a spectral solver. With a suitable choice of parameters the error converges as a tenth order method down to $10^{-14}$.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes