Lightning Plus Polynomial Approximation: Optimal Root-Exponential Convergence for Singular Functions in Corner Domains
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913172172046336 |
|---|---|
| author | Xiang, Shuhuang Xiang, Jun Yang, Shunfeng Zhong, Yuee |
| author_facet | Xiang, Shuhuang Xiang, Jun Yang, Shunfeng Zhong, Yuee |
| contents | This work presents a rigorous convergence analysis for the lightning plus polynomial approximation scheme, which employs rational approximations constructed with tapered, exponentially clustered poles. This pole placement strategy was originally introduced by Trefethen and his collaborators for the resolution of corner singularities. We establish optimal root-exponential convergence for the class of prototype functions of the form $g(z)z^α$ or $g(z)z^α\log z$, where $g$ is analytic on a neighborhood of the solution domain. The results obtained in this work confirm the validity of Conjectures 3.1 and 5.3 stated in [SIAM J. Numer. Anal., 61:2580-2600, 2023], and demonstrate that the choice $σ_{\mathrm{opt}} =\frac{\sqrt{2(2 -β)}π}{\sqrtα}$ achieves the theoretically optimal convergence rate $\mathcal{O}\left(e^{-\sqrt{2(2 - β)Nα}π}\right)$. In particular, for the specific case $β= 0$, the proposed scheme achieves the same optimal convergence rate as the best rational approximation to $x^α$ on $[0,1]$ established by Stahl. Furthermore, working within the decomposition framework for corner domains proposed by Gopal and Trefethen, this paper provides a rigorous proof of optimal root-exponential convergence for lightning plus polynomial approximation problems, and explicitly derives the optimal pole clustering parameter. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_30796 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Lightning Plus Polynomial Approximation: Optimal Root-Exponential Convergence for Singular Functions in Corner Domains Xiang, Shuhuang Xiang, Jun Yang, Shunfeng Zhong, Yuee Numerical Analysis 41A20, 65E05, 65D15, 30C10 This work presents a rigorous convergence analysis for the lightning plus polynomial approximation scheme, which employs rational approximations constructed with tapered, exponentially clustered poles. This pole placement strategy was originally introduced by Trefethen and his collaborators for the resolution of corner singularities. We establish optimal root-exponential convergence for the class of prototype functions of the form $g(z)z^α$ or $g(z)z^α\log z$, where $g$ is analytic on a neighborhood of the solution domain. The results obtained in this work confirm the validity of Conjectures 3.1 and 5.3 stated in [SIAM J. Numer. Anal., 61:2580-2600, 2023], and demonstrate that the choice $σ_{\mathrm{opt}} =\frac{\sqrt{2(2 -β)}π}{\sqrtα}$ achieves the theoretically optimal convergence rate $\mathcal{O}\left(e^{-\sqrt{2(2 - β)Nα}π}\right)$. In particular, for the specific case $β= 0$, the proposed scheme achieves the same optimal convergence rate as the best rational approximation to $x^α$ on $[0,1]$ established by Stahl. Furthermore, working within the decomposition framework for corner domains proposed by Gopal and Trefethen, this paper provides a rigorous proof of optimal root-exponential convergence for lightning plus polynomial approximation problems, and explicitly derives the optimal pole clustering parameter. |
| title | Lightning Plus Polynomial Approximation: Optimal Root-Exponential Convergence for Singular Functions in Corner Domains |
| topic | Numerical Analysis 41A20, 65E05, 65D15, 30C10 |
| url | https://arxiv.org/abs/2605.30796 |