Galerkin method with trigonometric basis on stable numerical differentiation

作者:

Highlights:

摘要

This paper considers the p (p=1,2,3) order numerical differentiation on function y in (0, 2π). They are transformed into corresponding Fredholm integral equation of the first kind. Computational schemes with analytic solution formulas are designed using Galerkin method on trigonometric basis. Convergence and divergence are all analysed in Corollaries 5.1, 5.2, and a-priori error estimate is uniformly obtained in Theorem 6.1, 7.1, 7.2. Therefore, the algorithm achieves the optimal convergence rate O(δ2μ2μ+1)(μ=12or1) with periodic Sobolev source condition of order 2µp. Besides, we indicate a noise-independent a-priori parameter choice when the function y possesses the form of∑k=0p−1aktk+∑k=1N1bkcoskt+∑k=1N2cksinkt,bN1,cN2≠0,In particular, in numerical differentiations for functions above, good filtering effect (error approaches 0) is displayed with corresponding parameter choice. In addition, several numerical examples are given to show that even derivatives with discontinuity can be recovered well.

论文关键词:Numerical differentiation,Galerkin method,Fourier expansion,Regularization

论文评审过程:Received 16 July 2019, Revised 4 October 2019, Accepted 10 November 2019, Available online 29 November 2019, Version of Record 13 December 2019.

论文官网地址:https://doi.org/10.1016/j.amc.2019.124912