Areas Approximation theory Topic
Interpolation nodes and convergence
Summary
This topic is a part of approximation theory. It covers how the choice of nodes controls the convergence of polynomial interpolants, with Lebesgue constants, Runge's example, Chebyshev points, Faber's negative theorem and the theory of mean convergence.
About this page
| Tag | W0H6C9P57X |
|---|---|
| URI | m2://W0H6C9P57X |
| Kind | topic |
| Writing | W0 stub |
| MSC | 41A05, 65D05 |
| Part of | Approximation theory |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- 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.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
No page links to this page yet.