Abstract

In the classical theory of cubic interpolation splines there exists an algorithm which works with only On 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 On 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. We provide an example of two L-splines interpolating S&P500 data.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.