Reciprocal-log approximation and planar PDE solvers

10/05/2020
by   Yuji Nakatsukasa, et al.
0

This article is about both approximation theory and the numerical solution of partial differential equations (PDEs). First we introduce the notion of reciprocal-log or log-lightning approximation of analytic functions with branch point singularities at points {z_k} by functions of the form g(z) = ∑_k c_k /(log(z-z_k) - s_k), which have N poles potentially distributed along a Riemann surface. We prove that the errors of best reciprocal-log approximations decrease exponentially with respect to N and that exponential or near-exponential convergence (i.e., at a rate O((-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.

READ FULL TEXT
research
05/08/2019

Solving Laplace problems with corner singularities via rational functions

A new method is introduced for solving Laplace problems on 2D regions wi...
research
07/23/2020

Exponential node clustering at singularities for rational approximation, quadrature, and PDEs

Rational approximations of functions with singularities can converge at ...
research
03/03/2023

Sigmoid functions and multiscale resolution of singularities

In this short, conceptual paper we observe that essentially the same mat...
research
03/16/2023

Adaptive rational Krylov methods for exponential Runge–Kutta integrators

We consider the solution of large stiff systems of ordinary differential...
research
03/02/2020

Log orthogonal functions: approximation properties and applications

We present two new classes of orthogonal functions, log orthogonal funct...
research
04/19/2021

A linear barycentric rational interpolant on starlike domains

When an approximant is accurate on the interval, it is only natural to t...
research
03/25/2022

On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples

Sparse polynomial approximation has become indispensable for approximati...

Please sign up or login with your details

Forgot password? Click here to reset