A cubic spline is a twice continuously differentiable piecewise polynomial of degree at most three whose polynomial pieces meet at specified knots.
A natural cubic spline is linear beyond its two outer knots, equivalently its second derivative vanishes at those knots.
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
There are currently no matching articles.