0
Exact convergence rates of lightning plus polynomial approximation for branch singularities with uniform exponentially clustered poles
arXiv:2504.16756v3 Announce Type: replace
Abstract: This paper builds rigorous analysis on the root-exponential convergence for the lightning schemes via rational functions in approximating corner (branch) singularity problems with uniform exponentially clustered poles proposed by Gopal and Trefethen. The start point is to set up the integral representations of $z^\alpha$ and $z^\alpha\log z$ in the slit disk and develop results akin to Paley-Wiener theorem, from which, together with the Poisson summation formula, the root-exponential convergence of the lightning plus polynomial scheme with an exact order for each clustered parameter is established in approximation of prototype functions $z^{\alpha}$ or $z^\alpha\log z$ on a sector-shaped domain, which includes $[0,1]$ as a special case. In addition, the fastest convergence rate is confirmed based upon the best choice of the clustered parameter. Furthermore, the optimal selection of the clustered parameter is employed in conformal mappings through solving Laplace problems on corner domains, building upon Lehman and Wasow's analysis of corner singularities and incorporating the domain decomposition method proposed by Gopal and Trefethen.
Abstract: This paper builds rigorous analysis on the root-exponential convergence for the lightning schemes via rational functions in approximating corner (branch) singularity problems with uniform exponentially clustered poles proposed by Gopal and Trefethen. The start point is to set up the integral representations of $z^\alpha$ and $z^\alpha\log z$ in the slit disk and develop results akin to Paley-Wiener theorem, from which, together with the Poisson summation formula, the root-exponential convergence of the lightning plus polynomial scheme with an exact order for each clustered parameter is established in approximation of prototype functions $z^{\alpha}$ or $z^\alpha\log z$ on a sector-shaped domain, which includes $[0,1]$ as a special case. In addition, the fastest convergence rate is confirmed based upon the best choice of the clustered parameter. Furthermore, the optimal selection of the clustered parameter is employed in conformal mappings through solving Laplace problems on corner domains, building upon Lehman and Wasow's analysis of corner singularities and incorporating the domain decomposition method proposed by Gopal and Trefethen.
Anonymous
No comments yet.