On the solvability of the Birkhoff interpolation problem
From MaRDI portal
The authors study a univariate Birkhoff interpolation problem. They determine the smallest \(N\) for which the Birkhoff interpolation problem is always solvable. This is the main result of the paper and it is contained in Theorem 2.1, where is obtained the best possible upper bound for the solvability number of an incidence matrix \(E\) in terms only of its number of ones, its number of odd supported sequences and its almost-Pólya defect. Finally, an example is presented.
Recommendations
Cites work
Cited in
(11)- The proper interpolation space for multivariate Birkhoff interpolation
- scientific article; zbMATH DE number 6907715 (Why is no real title available?)
- On the unique minimal monomial basis of Birkhoff interpolation problem
- Project 2: The Birkhoff interpolation problem
- Solving the Birkhoff interpolation problem via the critical point method: An experimental study
- scientific article; zbMATH DE number 2150971 (Why is no real title available?)
- Lower bounds by Birkhoff interpolation
- Applying quantifier elimination to the Birkhoff interpolation problem
- On the solvability of bivariate Hermite-Birkhoff interpolation problems
- Simultaneous approximation, interpolation and Birkhoff systems
- A regularized solution to the Birkhoff interpolation problem
This page was built for publication: On the solvability of the Birkhoff interpolation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414075)