For a linearly independent partition-normalized B-spline basis, equivalence of norms gives a lower coefficient-stability constant. The upper bound follows from the subpartition of unity for B-splines. A knot-independent stability bound can be chosen depending on spline order. This norm comparison transfers matrix estimates to the B-spline interpolation operator norm.
For a nonnegative partition-normalized B-spline basis, the synthesis linear map has operator norm one. Its condition number is consequently , with the supremum norm on the spline space and the maximum norm on its coefficients. The uniform-norm stability of a B-spline basis bounds this number independently of the spline knot sequence when the order is fixed. This is different from the condition number of a particular sampled B-spline collocation matrix.
Suppose and at increasing sites satisfying the Schoenberg–Whitney theorem conditions. For the B-spline collocation matrix , the coefficient linear functional in the dual basis is . Therefore . The checkerboard inverse of a totally nonnegative matrix makes , attaining that bound. Since ,The conclusion is an extremal property of an alternating unit-norm spline, not a claim that every bounded spline has these extremal coefficients.
The equality holds when an alternating unit-norm spline has as many ordered extremal sites as the dimension, and those sites satisfy the Schoenberg–Whitney theorem. For every admissible set, sampling has operator norm at most one, giving . At the alternating sites the checkerboard inverse of a totally nonnegative matrix identifies each inverse absolute row sum with the magnitude of the corresponding coefficient of . The Chebyshev spline coefficient and dual norm equality therefore gives equality. This minimizes amplification into B-spline coefficients; it does not by itself prove optimality for the distinct Lebesgue constant of interpolation.
Articles by others on the same topic
There are currently no matching articles.