We present an algorithm for constructing a basis of the ideal of all polynomials, which vanish at a preassigned set of points {y1,..,ym} ⊂ Kn, K a field. The algorithm yields also Newton-type polynomials for pointwise interpolation. These polynomials admit an immediate construction of interpolating polynomials and allow to shorten the algorithm, if it is applied to an enlarged set {y1,..,ym1} ⊂ Kn, m1>m.
CITATION STYLE
Möller, H. M., & Buchberger, B. (1982). The construction of multivariate polynomials with preassigned zeros. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 144 LNCS, pp. 24–31). Springer Verlag. https://doi.org/10.1007/3-540-11607-9_3
Mendeley helps you to discover research relevant for your work.