B-spline Created 2026-09-24 Updated 2026-11-05
An order- B-spline is a local, nonnegative spline determined by consecutive entries of a nondecreasing spline knot sequence. Its polynomial pieces have degree at most , and its support is contained in . The Cox-de Boor recurrence gives a constructive definition from interval indicators.[ref]
For example, the order-two B-spline with spline knots is the triangular hat
Only nearby B-splines are nonzero at a given point. This local support makes spline interpolation matrices and spline Gram matrices sparse. On the basic knot interval, a completed B-spline basis has partition of unity; spline knot multiplicities determine the smoothness across joins.
Cubic cardinal B-spline 2026-10-31
This degree-three Cardinal B-spline has support , is twice continuously differentiable, and has values at the consecutive integer knots. Their sum is one. Its truncated power function representation has coefficients whose first four moments vanish, making it zero after its final knot. Four knot intervals are the minimum possible compact support for a nonzero cubic spline: with fewer intervals the four moment constraints form a full-column-rank Vandermonde matrix. Translating and rescaling this function gives a local basis for cubic spline interpolation on a uniform mesh.
Equally spaced interpolation Created 2026-09-24 Updated 2026-11-05
Equally spaced interpolation constructs an interpolant from data at nodes . It is convenient when measurements or a computational grid already have uniform spacing. The degree-at-most- polynomial interpolant through distinct nodes is unique, but uniqueness does not imply good approximation as increases.
For on , high-degree polynomial interpolation at equally spaced nodes exhibits Runge's phenomenon near the endpoints. Chebyshev nodes reduce that endpoint instability by clustering there; piecewise spline interpolation offers another alternative. The data locations and the degree must therefore be treated as approximation choices, rather than assuming that more uniformly spaced data always improve a global polynomial.
Fix a clamped nondecreasing spline knot sequence on , with and . For continuous splines assume interior multiplicities at most , and assume . An order- spline has degree at most on each nonempty knot interval; at a knot of multiplicity it has continuous derivatives. Its dimension is , and a normalized B-spline basis has local support, nonnegative values and sum one on .
These properties are visible in the Cox-de Boor recurrence. Starting with interval indicators at order one, set
with a term of zero denominator defined to be zero. On each contributing support the weights are nonnegative, and summing the recurrence makes the coefficients of each lower-order B-spline add to one. This gives partition of unity and , with endpoint values defined by limits.
At distinct ordered sites , interpolation is the linear system
It has a unique solution for every data vector exactly when the B-spline collocation matrix is invertible. The Schoenberg–Whitney theorem characterizes this by for every ; away from clamped endpoints this is . At the clamped endpoints the first and last B-splines have value one, so the endpoint version uses this positive-value formulation rather than the strict inequalities. Both ordering and the support conditions matter. A spline space with interior knots is generally not a Chebyshev system on the entire interval: a locally supported B-spline vanishes on an interval. Thus arbitrary distinct nodes need not permit interpolation. Merely specifying all data sites as knots also need not fix the remaining freedom; for example, cubic interpolation with simple interior knots at data sites has dimension , and two extra boundary conditions are needed to interpolate values uniquely.
The positivity governing this existence theorem is total nonnegativity of B-spline collocation matrices: every square minor with increasing row and column indices is nonnegative. In spline terminology this is often called total positivity, but it permits zero minors caused by disjoint supports. It is not the stronger assertion that every minor is strictly positive. A useful proof uses knot insertion. Each refinement step changes coefficients by
with the unchanged endpoint pieces. The refinement matrix is nonnegative bidiagonal, and its minors are nonnegative: any nonzero determinant has its allowed diagonal matching and is a product of nonnegative entries. Products preserve this property by the Cauchy–Binet formula. Insert each sampling site to full multiplicity, so evaluation at that site becomes selection of an ordered refined coefficient. The collocation matrix is then an ordered row submatrix of the refinement product, proving total nonnegativity. The strict support criterion is the strict part of this argument: an ordered path through the consecutive support intervals exists exactly when every diagonal B-spline value is positive, giving the Schoenberg–Whitney theorem determinant criterion.
If is invertible, its determinant is positive and the adjugate identity yields
This checkerboard inverse of a totally nonnegative matrix is the central stability fact. With alternating data , the absolute row sums satisfy
For general data, the cardinal splines are . The spline interpolation operator and its exact Lebesgue constant of interpolation are
The equality for the operator norm follows by extending the signs at distinct sites to a continuous unit-norm data function, as in Solution 2. That solution also shows the last inequality can be very strict. Stability concerns the range function as well as its coefficients.
An optimal interpolation set must be specified relative to an objective. For the normalized B-spline coefficients, every admissible sampling set satisfies
since and sampling cannot increase the supremum norm. If a unit-norm spline has ordered alternating extrema at admissible sites, the checkerboard identity gives
Taking the largest row shows , so equality holds. This proves the optimal spline coefficient interpolation sites property and the Chebyshev spline coefficient and dual norm equality. In particular, for the cubic space of Solution 1 the alternating extrema satisfy the support conditions. Its coefficients have maximum magnitude , so these sites are optimal for coefficient recovery and
The argument proves optimality whenever this admissible equioscillating spline is available; it does not identify extrema of an arbitrary spline as optimal sites, or transfer coefficient optimality automatically to the Lebesgue constant of interpolation.
For the intrinsic interpolation objective, minimize itself. There is a minimizer for a fixed finite-dimensional continuous spline space. Indeed the sites lie in a compact ordered simplex. On admissible sets, inverse entries and hence vary continuously. As a collocation matrix tends to a singular one, its inverse norm diverges. The uniform-norm stability of a B-spline basis gives the complementary bound
choose sample signs attaining a largest inverse row, extend them to a continuous unit-norm function, and use . Thus a minimizing sequence with bounded Lebesgue constants of interpolation cannot approach a singular site set. A convergent subsequence has an admissible limit attaining the minimum.
Fekete interpolation sites for a continuous function space offer another useful, constructive criterion: maximize the absolute evaluation determinant. A nonzero maximum exists by compactness and linear independence. Replacing one row by evaluation at multiplies the determinant by the corresponding cardinal function, so maximality gives , and therefore . These sites are determinant-optimal, with a proven interpolation bound; one should not claim without further argument that they minimize . Greville abscissae provide inexpensive admissible sites for the usual continuous clamped spline spaces of order at least two. Admissibility alone does not give the best stability bound.
Finally, the coefficient condition number of a normalized B-spline basis is bounded by a constant depending only on order. To see the mechanism, for each coefficient choose a longest nonempty knot cell in that B-spline's support. If its length is and the support width is , then . On that cell the spline is a degree-at-most- polynomial; repeated Markov polynomial inequalities bound its th derivative by . In the De Boor–Fix spline coefficient functional, the accompanying derivative of the knot polynomial is bounded by . Each term is consequently at most , yielding independently of the number and spacing of knots. This is basis stability; it does not bound at arbitrarily poor sampling sites.
For approximation, reproduction gives the Lebesgue inequality for approximation projectors
As the maximum knot gap tends to zero with fixed order, spline quasi-interpolation gives an approximant with error at most , so the infimum tends to zero. A sequence of uniformly bounded interpolation linear operators therefore converges to every continuous target. Local support and a stable choice of sites make spline interpolation effective; mesh refinement without control of the interpolation operator norm is not by itself a convergence proof.
For the usual spline interpolation problem the sites are distinct and ordered; the Schoenberg–Whitney theorem then makes invertible under the stated support positivity. More generally, the following argument applies whenever the interpolation map in the question is well defined and is invertible.
Factor the spline interpolation operator as , where
Sampling has operator norm at most one from the supremum norm to . Nonnegativity and the subpartition of unity for B-splines give
Consequently .
For the reverse bound, select a row of with maximal absolute row sum, and choose , assigning any value of modulus at most one when the entry is zero. Then and
At distinct sites there is a continuous piecewise linear function with and : interpolate linearly between the ordered sites and extend constantly to the endpoints. The given uniform-norm stability of a B-spline basis therefore implies
Thus the B-spline interpolation operator norm satisfies
Positivity alone, without the usual distinct-site convention, is insufficient to define an interpolation operator. For example, take order-two B-splines with knots and . Both diagonal values are , but the B-spline collocation matrix has identical rows and is singular. The displayed proof uses the well-defined interpolation map posited in the question; ordered distinct sites supply its standard existence guarantee.
Write , and let . We use the standard interpolation convention of distinct ordered sites . Together with , the Schoenberg–Whitney theorem makes the B-spline collocation matrix invertible. Equivalently, its invertibility is implicit in the existence of the interpolation operator for every data vector.
If distinctness is not understood, the printed positivity condition alone is insufficient. For the order-two basis on spline knots , take . Both diagonal B-spline values are , but the two rows of coincide. Arbitrary data cannot then be interpolated uniquely. The norm statement below concerns the intended well-defined interpolation operator.
Spline interpolation determines the coefficient vector by , and hence
Nonnegativity and the subpartition of unity for B-splines give
For completeness, extend the finite spline knot sequence beyond both ends. For the full sequence the order-one interval indicators sum to one. Summing the Cox-de Boor recurrence and shifting the index in its second term combines the two coefficients of each lower-order B-spline to one, so induction gives partition of unity at every order. Our finite collection is a subset of that nonnegative collection, and thus has sum at most one. Repeated spline knots are handled by the standard zero-term convention or a knot limit. This argument controls the entire interval, not only the basic knot interval.
Since , the operator norm upper bound is
Here the matrix operator norm is the maximum absolute row sum. For the lower bound, choose a row of with maximum absolute row sum and a data vector whose components are the signs of that row's entries. Then and
A continuous piecewise-linear function taking these values at the distinct ordered sites, and constant outside their range, has supremum norm one. Apply the given uniform-norm stability of a B-spline basis to its coefficient vector:
Therefore
The construction of the bounded continuous data extension is what permits the matrix norm to give a lower bound for a function-space operator norm.
Schoenberg–Whitney theorem Created 2026-09-25 Updated 2026-11-05
For strictly increasing spline knots and interpolation sites , the order- B-spline collocation matrix , with , is invertible exactly when
These conditions place each site in the open support of its corresponding B-spline, and are equivalent to in this simple-knot setting. They characterize existence and uniqueness of spline interpolation for all data.[ref]
With repeated clamped endpoint spline knots, endpoint conventions matter: strict inequalities at the outer endpoints are not necessary. For example, the order-two clamped sequence gives the basis on . Sampling at gives the identity matrix, even though the corresponding outer strict inequalities fail. One must use the version allowing nonzero endpoint B-spline values instead of importing the simple-knot inequalities unchanged.
Spline (mathematics) 2026-10-14
A spline is a piecewise polynomial function whose polynomial pieces obey specified smoothness conditions at their joins, called spline knots. For example, a cubic spline is cubic on each interval and commonly has two continuous derivatives across interior knots. Spline approximation and spline interpolation use these finite-dimensional function spaces to represent data or approximate functions.