A sharp error estimate of piecewise polynomial collocation for nonlocal problems with weakly singular kernels
Minghua Chen, Wenya Qi, Jiankang Shi, Jiming Wu

TL;DR
This paper provides a precise error analysis for piecewise polynomial collocation methods applied to nonlocal problems with weakly singular kernels, establishing sharp local and global convergence rates and validating with numerical experiments.
Contribution
It introduces a sharp error estimate for piecewise quadratic collocation in nonlocal problems, improving understanding of convergence behavior compared to classical results.
Findings
PQC achieves an optimal local truncation error of O(h^4 η_i^{-\gamma})
PLC and PQC have global convergence rates of O(h) and O(h^3), respectively
Numerical experiments confirm the theoretical convergence rates and effectiveness
Abstract
As is well known, using piecewise linear polynomial collocation (PLC) and piecewise quadratic polynomial collocation (PQC), respectively, to approximate the weakly singular integral have the local truncation error and . Moreover, for Fredholm weakly singular integral equations of the second kind, i.e., with , also have global convergence rate and in [Atkinson and Han, Theoretical Numerical Analysis, Springer, 2009]. Formally, following nonlocal models can be viewed as Fredholm weakly singular integral equations However,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
