Approximations and expansions Interpolation Concept
Birkhoff interpolation
Summary
Birkhoff interpolation asks for a polynomial whose derivatives of chosen orders take chosen values at chosen nodes. Unlike Hermite interpolation, it does not require that all lower derivatives are also prescribed. It contains polynomial interpolation and Hermite interpolation as special cases. Unlike these, it does not always have a unique solution, even when the number of conditions equals the number of coefficients. The main question of the theory is which patterns of conditions, encoded in an incidence matrix, are poised, that is, solvable uniquely for all data.
Further reading
About this page
| Tag | FT1YKVBFC9 |
|---|---|
| URI | m2://FT1YKVBFC9 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A05, 65D05 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.