The Numerical Stability of Regularized Barycentric Interpolation Formulae for Interpolation and Extrapolation
Abstract
The 2- and 1-regularized modified Lagrange interpolation formulae over [-1,1] are deduced in this paper. This paper mainly analyzes the numerical characteristics of regularized barycentric interpolation formulae, which are presented in [C. An and H.-N. Wu, 2019], and regularized modified Lagrange interpolation formulae for both interpolation and extrapolation. Regularized barycentric interpolation formulae can be carried out in O(N) operations based on existed algorithms [H. Wang, D. Huybrechs and S. Vandewalle, Math. Comp., 2014], and regularized modified Lagrange interpolation formulae can be realized in an algorithm of O(N N) operations. For interpolation, the regularized modified Lagrange interpolation formulae are blessed with backward stability and forward stability, whereas the regularized barycentric interpolation formulae are only provided with forward stability. For extrapolation, the regularized barycentric interpolation formulae meet loss of accuracy outside [-1,1], but the regularized modified Lagrange interpolation formulae still work. Consistent results for extrapolation are also verified outside the Chebfun ellipse (a special Bernstein ellipse) in the complex plain. Finally, we illustrate that regularized interpolation formulae perform better than classical interpolation formulae without regularization in noise reduction.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.