Abstract :
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.
Keywords :
Approximation, curve fitting, interpolation, numerical algorithm, spline function.; Algorithm design and analysis; Curve fitting; Equations; Interpolation; Iterative algorithms; Iterative methods; Packaging; Size control; Spline; Surface fitting; Approximation, curve fitting, interpolation, numerical algorithm, spline function.;
