There are basis splines for the stated knots; the upper limit in the printed basis list is an indexing slip. Let
The strictly increasing sites and give invertibility by the Schoenberg–Whitney theorem. The needed additional matrix property is total nonnegativity of B-spline collocation matrices: every ordered minor of is nonnegative.
Here is a structural justification of that sign property. Knot insertion refines spline coefficients by rules of the form , , with the usual unchanged coefficients before the insertion and shifted coefficients after it. Each coefficient map is a nonnegative rectangular bidiagonal matrix; all its ordered minors are nonnegative, as its nonzero terms preserve row/column order. Products preserve this property by the Cauchy–Binet formula. Insert each ordered sampling site until it has full knot multiplicity. Evaluation at such a break is one of the refined coefficients, with a consistent one-sided convention. Consequently the B-spline collocation matrix is an ordered row submatrix of the product of refinement matrices, proving its nonnegative minors. This also applies to repeated admissible original knots.
Since is invertible and totally nonnegative, . The adjugate identity gives the checkerboard inverse of a totally nonnegative matrix:
Now for any spline , its sampled-value vector is . Hence the coefficient linear functional in the dual basis is exactly
In particular , verifying the hinted formula rather than assuming it. The operator norm of this linear functional is taken for the uniform norm on the spline's interval, containing all sampling sites. Evaluation at a sampling site has norm at most one, so
For the given unit-norm alternating spline, , and the checkerboard signs make all terms in a fixed inverse row align:
Since , this supplies the reverse operator norm inequality and proves the Chebyshev spline coefficient and dual norm equality
This spline attains the operator norm of each coefficient linear functional.
Use the order of the three Bernstein basis functions given in this part. Endpoint evaluation gives
so both endpoint coefficients have absolute value at most one. At the midpoint,
The triangle inequality therefore gives the quadratic Bernstein coefficient bound
All three bounds are sharp. Indeed has uniform norm one and coefficient vector in this basis. The reversed ordering of endpoint Bernstein functions does not affect these symmetric endpoint bounds.

Articles by others on the same topic (0)

There are currently no matching articles.