pith. sign in

arxiv: 1611.08706 · v1 · pith:FQEHJZLLnew · submitted 2016-11-26 · 🧮 math.NA

Improved error bound for multivariate Chebyshev polynomial interpolation

classification 🧮 math.NA
keywords interpolationboundchebysheverrormethodapplicationsbeforehandeffective
0
0 comments X
read the original abstract

Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For efficiency, a sharp error bound is essential, in particular for high-dimensional applications. For tensorized Chebyshev interpolation, we present an error bound that improves existing results significantly.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.