If a real degree-at-most- polynomial has absolute value at most one at every extremum of the Chebyshev polynomial , its th derivative on is bounded by , for . This strengthens the Markov inequality for polynomial derivatives by replacing a bound on the whole interval with these finitely many samples. The node set is rigid, as quantified by uniqueness of Chebyshev derivative-norming nodes.
For , any distinct node set in different from the Chebyshev polynomial extrema admits one degree- polynomial , bounded by one at all those nodes, whose every nonconstant derivative violates the corresponding sharp endpoint bound. In decreasing order set . The endpoint derivative signs of Lagrange cardinal polynomials give . Interpolating on the same nodes showsEach term is nonnegative and at least one is positive, because the other node set includes a nonextremal point. Uniqueness is a claim about node sets: permuting the same nodes does not change their norming property.
Articles by others on the same topic
There are currently no matching articles.