scientific article; zbMATH DE number 3876580

From MaRDI portal
Publication:3341887





[For the entire collection see Zbl 0533.00024.] An algorithm for constructing a basis of the ideal of all polynomials that vanish at a preassigned set of points \(\{y_ 1,...,y_ m\}\subset K^ n,\) K a field, is presented. 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 \(\{y_ 1,...,y_{m_ 1}\}\subset K^ n, m_ 1>m\). The algorithm makes uses of the concept of Gröbner bases for polynomial ideals [see \textit{B. Buchberger}, Gröbner-bases: an algorithmic method in polynomial ideal theory, chapter 6 in: Recent trends in multidimensional system theory (1985), edited by \textit{N. K. Bose}].




Cited in
(60)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341887)