A sharp error estimate of piecewise polynomial collocation for nonlocal problems with weakly singular kernels

09/24/2019 ∙ by Minghua Chen, et al. ∙ 0

As is well known, using piecewise linear polynomial collocation (PLC) and piecewise quadratic polynomial collocation (PQC), respectively, to approximate the weakly singular integral I(a,b,x) =∫^b_a u(y)/|x-y|^γdy, x ∈ (a,b) , 0< γ <1, have the local truncation error O(h^2) and O(h^4-γ). Moreover, for Fredholm weakly singular integral equations of the second kind, i.e., λ u(x)- I(a,b,x) =f(x) with λ≠ 0, also have global convergence rate O(h^2) and O(h^4-γ) in [Atkinson and Han, Theoretical Numerical Analysis, Springer, 2009]. Formally, following nonlocal models can be viewed as Fredholm weakly singular integral equations ∫^b_a u(x)-u(y)/|x-y|^γdy =f(x), x ∈ (a,b) , 0< γ <1. However, there are still some significant differences for the models in these two fields. In the first part of this paper we prove that the weakly singular integral by PQC have an optimal local truncation error O(h^4η_i^-γ), where η_i=min{x_i-a,b-x_i} and x_i coincides with an element junction point. Then a sharp global convergence estimate with O(h) and O(h^3) by PLC and PQC, respectively, are established for nonlocal problems. Finally, the numerical experiments including two-dimensional case are given to illustrate the effectiveness of the presented method.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.