Computational aspects of polynomial interpolation in several variables
Open Access
- 1 May 1992
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 58 (198) , 705
- https://doi.org/10.1090/s0025-5718-1992-1122061-0
Abstract
The pair <!-- MATH $\langle \Theta ,P\rangle$ --> of a point set <!-- MATH $\Theta \subset {\mathbb{R}^d}$ --> and a polynomial space P on <!-- MATH ${\mathbb{R}^d}$ --> is correct if the restriction map <!-- MATH $P \to {\mathbb{R}^\Theta }:p \mapsto {p_{|\Theta }}$ --> is invertible, i.e., if there is, for any f defined on , a unique which matches f on .
Keywords
This publication has 3 references indexed in Scilit:
- The least solution for the polynomial interpolation problemMathematische Zeitschrift, 1992
- On polynomial ideals of finite codimension with applications to box spline theoryJournal of Mathematical Analysis and Applications, 1991
- On multivariate polynomial interpolationConstructive Approximation, 1990