Lebesgue constant

In numerical analysis, Lebesgue constants (depending on a set of nodes and of its size) give an idea of how good the interpolant of a function (at the given nodes) is in comparison with the best polynomial approximation of the function (the degree of the polynomials are fixed). The Lebesgue constant for polynomials of degree at most n {\displaystyle n} and for the set of n + 1 {\displaystyle n+1} nodes T {\displaystyle T} is generally denoted by Λ n ( T ) {\displaystyle \Lambda _{n}(T)} .

Source: Wikipedia — Lebesgue constant (CC BY-SA 4.0)

Lebesgue constant

In numerical analysis, Lebesgue constants (depending on a set of nodes and of its size) give an idea of how good the interpolant of a function (at the given nodes) is in comparison with the best polynomial approximation of the function (the degree of the polynomials are fixed). The Lebesgue constant for polynomials of degree at most n {\displaystyle n} and for the set of n + 1 {\displaystyle n+1} nodes T {\displaystyle T} is generally denoted by Λ n ( T ) {\displaystyle \Lambda _{n}(T)} .

This neuron ends here.

Source: Wikipedia "Lebesgue constant" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy