|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| null Ming-Lei Liou, "Spline Fit Made Easy," IEEE Transactions on Computers, vol. 25, no. 5, pp. 522-527, May, 1976. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1976.1674640, author = {null Ming-Lei Liou}, title = {Spline Fit Made Easy}, journal ={IEEE Transactions on Computers}, volume = {25}, number = {5}, issn = {0018-9340}, year = {1976}, pages = {522-527}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1976.1674640}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Spline Fit Made Easy IS - 5 SN - 0018-9340 SP522 EP527 EPD - 522-527 A1 - null Ming-Lei Liou, PY - 1976 KW - Approximation KW - curve fitting KW - interpolation KW - numerical algorithm KW - spline function. VL - 25 JA - IEEE Transactions on Computers ER - | |||
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.

