A fast algorithm for the multivariate Birkhoff interpolation problem

From MaRDI portal





The computational task addressed in this article is the fast computation of a solution to the Hermite-Birkhoff interpolation problem using given data in several dimensions. In a generalisation of the so-called MB-algorithm, the authors of this paper develop a method B-MB (Birkhoff monomial basis) to compute the minimal interpolation monomial basis for the aforementioned problem with low computational complexity. It is shown that this B-MB algorithm provides the minimal monomial basis for the problem using lexicographical order.











This page was built for publication: A fast algorithm for the multivariate Birkhoff interpolation problem

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