This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Spline Fit Made Easy
May 1976 (vol. 25 no. 5)
pp. 522-527
null Ming-Lei Liou, Bell Laboratories
In this paper, a new algorithm for a cubic spline fit with equally spaced data points and given end conditions is described. It provides a new understanding of how a spline fit works and possesses the following computational advantages: 1) It can solve large size problems (virtually unlimited). 2) The accuracy can be realistically controlled based on the characteristics of data. 3) The computation time-is linearly proportional to the size of the problem. 4) It can handle a localized fit. 4) It can handle a localizd. The new algorithm is particularly suitable to be implemented in minicomputers for cutting surfaces by numerically controlled machines and for other applications.
Index Terms:
Approximation, curve fitting, interpolation, numerical algorithm, spline function.
Citation:
null Ming-Lei Liou, "Spline Fit Made Easy," IEEE Transactions on Computers, vol. 25, no. 5, pp. 522-527, May 1976, doi:10.1109/TC.1976.1674640
Usage of this product signifies your acceptance of the Terms of Use.