Polynomial Interpolation to Data on Flats in Rd

✍ Scribed by Carl de Boor; Nira Dyn; Amos Ron

• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 231 KB
• Volume: 105
• Category: Article
• ISSN: 0021-9045
• DOI: 10.1006/jath.2000.3473

✦ Synopsis

Stimulated by recent work of Hakopian and Sahakian, polynomial interpolation to data at all the s-dimensional intersections of an arbitrary sequence of hyperplanes in R d is considered, and reduced, by the adjunction of an additional s hyperplanes in general position with respect to the given sequence, to the case s=0 solved much earlier by two of the present authors. In particular, interpolation is from the very same polynomial spaces already used earlier. The difficult question of multiplicity and corresponding matching of derivative information is completely solved, with the number of independent derivative conditions at an intersection exactly equal to that intersection's multiplicity. Also, the consistency requirements placed on the data are minimal in the sense that they need to be checked only at the finitely many 0-dimensional intersections of the hyperplanes involved. The arguments used provide, incidentally, further insights into the two polynomial spaces, P(5) and D(5), of basic interest in box spline theory.