Answers are grounded in this paper and cite their sources.
In the present paper we describe a class of algorithms for the solution of Laplace's equation on polygonal domains with Dirichlet and Neumann boundary conditions. It is well known that in such cases the solutions may have singularities near the corners, which poses a challenge for many existing methods. We present a high-order solver for Laplace's equation on polygonal domains requiring relatively few degrees of freedom to resolve the behavior near corners accurately. Our approach is based on the observation that if the boundary data are smooth on each edge of the polygon then in the vicinity of each corner the solution to the corresponding boundary integral equation has an expansion in terms of certain (analytically available) singular powers. We construct a set of discretization nodes and weights which accurately integrate and interpolate these singular powers, enabling the construction of high-order Nyström schemes requiring relatively few discretization nodes. Our results are illustrated with several numerical examples.
No takes yet. Share an insight, caveat, or question.
Hoskins et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: