Improved error bound for multivariate Chebyshev polynomial interpolation
Numerical Analysis
2016-11-29 v1
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.
Cite
@article{arxiv.1611.08706,
title = {Improved error bound for multivariate Chebyshev polynomial interpolation},
author = {Kathrin Glau and Mirco Mahlstedt},
journal= {arXiv preprint arXiv:1611.08706},
year = {2016}
}
Comments
Keywords: (Tensorized) Chebyshev Polynomials, Polynomial Interpolation, Error Bounds