A cubic spline is a twice continuously differentiable piecewise polynomial of degree at most three whose polynomial pieces meet at specified knots.
A clamped cubic spline is a cubic spline whose endpoint first derivatives are prescribed. A clamped cubic spline interpolant additionally matches prescribed values at its spline knots. Distinct spline knots, arbitrary nodal values and arbitrary endpoint slopes determine one such interpolant. The minimum roughness property of a clamped cubic spline proves uniqueness. Unlike the natural cubic spline, this construction prescribes endpoint slopes rather than zero endpoint second derivatives.
Let be a clamped cubic spline interpolant and let have the same values at all spline knots and the same endpoint slopes. For , or more generally an absolutely continuous function with square-integrable second derivative, the exact displayed identity holds. In particular uniquely minimizes the second derivative roughness penalty among these competitors.
To prove the identity, put . On each knot interval, two applications of integration by parts give , since the cubic piece has zero fourth derivative. Terms containing vanish at the spline knots; terms containing cancel at interior spline knots because and are continuous. The endpoint terms vanish because is zero there. Thus , and expanding proves the identity. Equality makes , so is an affine function; a prescribed endpoint value and slope force .
If also matches the first derivative of at every spline knot, both and vanish at the ends of each knot interval. For a sufficiently differentiable , integration by parts separately on that interval gives the stronger local identity .
A natural cubic spline is linear beyond its two outer knots, equivalently its second derivative vanishes at those knots.
If is the natural cubic spline interpolating data at fixed distinct knots , then is the natural cubic spline interpolating .
The transformed function is piecewise cubic, preserves continuity of the first two derivatives, and has endpoint second derivatives . It takes exactly the transformed nodal values. Uniqueness of the natural spline therefore proves the claim. This permits affine changes in data or the addition of a linear trend without solving a new spline system.
For at least two distinct knots and values , the unique natural cubic spline matching those values and linear beyond . Its interpolation map is a linear map by uniqueness. Over a larger domain , the two exterior pieces remain linear. With only one knot, arbitrary slopes of affine functions make uniqueness false.
Let be the interpolating cardinal basis and set . Linearity gives , and this Gram matrix is a positive semidefinite matrix. Its null space consists precisely of vectors , by the null-space statement for the second derivative roughness penalty. Thus its rank is , including the zero matrix when .
For and any taking the same values at at least two distinct knots, . To prove it, set , integrate by parts on each polynomial interval and use , , continuous and linear exterior pieces. Boundary terms cancel. Expanding the square proves the identity. Equality forces , so is an affine function and its two prescribed zeros make it identically zero.
The minimum roughness property of the natural cubic spline interpolant extends to interpolants with an absolutely continuous first derivative and square-integrable second derivative. For vanishing at the knots, integration by parts on each cubic interval gives : the knot boundary terms cancel by continuity, the exterior terms vanish by natural boundary conditions, and the remaining constant-third-derivative term vanishes because is zero at the interval endpoints. Expanding the square proves minimality. Equality makes affine; its zeros at two distinct knots force , proving uniqueness. Competitors with infinite roughness cannot improve the finite spline penalty.

Articles by others on the same topic (0)

There are currently no matching articles.