Abstract
We provide estimates for the maximum error of polynomial tensor product interpolation on regular grids in \({\mathbb{R}^d}\). The set of partial derivatives required to form these bounds depends on the clustering of interpolation nodes. Also bounds on the partial derivatives of the error are derived.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Besov OV, Il’in VP, Nikol’skiĭ SM (1978) Integral representation of functions and embeddings Theorems, vol 1–2. Winston, Washington D.C., Halsted
de Boor C, Pinkus A: Proof of the conjectures of Bernstein and Erdös concerning optimal nodes for polynomial interpolation. J Approx Theory 24, 289–303 (1978)
de Boor C (1997) The error in polynomial tensor-product, and in Chung-Yao, interpolation. In: Le Méhauté A, Rabut C, Schumaker LL (eds) Surface fitting and multiresolution methods. Vanderbilt University Press, pp 35–50
Dahmen W, DeVore R, Scherer K: Multi-dimensional spline approximation. SIAM J Numer Anal 17(3), 380–402 (1980)
Rivlin TJ : The Lebesgue constants for polynomial interpolation. In: Garnir, HG et al (eds) Functional analysis and its applications. International Conference, Madras 1973, pp. 422–437. Springer-Verlag, New York (1974)
Rivlin TJ: The Chebyshev polynomials. Wiley-Interscience, New York (1974)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C.H. Cap.
Rights and permissions
About this article
Cite this article
Mößner, B., Reif, U. Error bounds for polynomial tensor product interpolation. Computing 86, 185–197 (2009). https://doi.org/10.1007/s00607-009-0062-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-009-0062-7