Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Numerical Stability of Regularized Barycentric Interpolation Formulae for Interpolation and Extrapolation (1904.07187v4)

Published 15 Apr 2019 in math.NA and cs.NA

Abstract: The $\ell_2-$ and $\ell_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 $\mathcal{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 $\mathcal{O}(N\log 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.

Citations (3)

Summary

We haven't generated a summary for this paper yet.