English

Reciprocal-log approximation and planar PDE solvers

Numerical Analysis 2020-10-06 v1 Numerical Analysis

Abstract

This article is about both approximation theory and the numerical solution of partial differential equations (PDEs). First we introduce the notion of {\em reciprocal-log} or {\em log-lightning approximation} of analytic functions with branch point singularities at points {zk}\{z_k\} by functions of the form g(z)=kck/(log(zzk)sk)g(z) = \sum_k c_k /(\log(z-z_k) - s_k), which have NN poles potentially distributed along a Riemann surface. We prove that the errors of best reciprocal-log approximations decrease exponentially with respect to NN and that exponential or near-exponential convergence (i.e., at a rate O(exp(CN/logN))O(\exp(-C N / \log N))) also holds for near-best approximations with preassigned singularities constructed by linear least-squares fitting on the boundary. We then apply these results to derive a "log-lightning method" for numerical solution of Laplace and related PDEs in two-dimensional domains with corner singularities. The convergence is near-exponential, in contrast to the root-exponential convergence for the original lightning methods based on rational functions.

Keywords

Cite

@article{arxiv.2010.01807,
  title  = {Reciprocal-log approximation and planar PDE solvers},
  author = {Yuji Nakatsukasa and Lloyd N. Trefethen},
  journal= {arXiv preprint arXiv:2010.01807},
  year   = {2020}
}

Comments

20 pages, 11 figures

R2 v1 2026-06-23T19:01:53.207Z