2021/12/30 by Ognyan Kounchev, Kounchev, Ognyan, Hermann Render +3
Computer Science · Engineering · Mathematics · #41A05 #41A15 #41A63 #65D07 #Advanced Numerical Analysis Techniques #Classical Analysis and ODEs (math.CA) #Digital Filter Design and Implementation #FOS: Mathematics #Iterative Methods for Nonlinear Equations #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.2112.15235
openalex publication_date 2021/12/30 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
In the classical theory of cubic interpolation splines there exists an algorithm which works with only O( n) arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces their computation to interpolation cubic splines and also performs with O( n) arithmetic operations. In this paper it is shown that many features of the polynomial cubic spline setting carry over to the larger class of L-splines where L is a linear differential operator of order 4 with constant coefficients. Criteria are given such that the associated matrix R is strictly diagonally dominant which implies the existence of a fast algorithm for interpolation.