Abstract
A new and straightforward proof of the unisolvability of the problem of multivariate polynomial interpolation based on Coatmèlec configurations of nodes, a class of properly posed set of nodes defined by hyperplanes, is presented. The proof generalizes a previous one for the bivariate case and is based on a recursive reduction of the problem to simpler ones following the so-called Radon–Bézout process.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call