2000 character limit reached
Improved error bound for multivariate Chebyshev polynomial interpolation (1611.08706v1)
Published 26 Nov 2016 in math.NA
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.