Skip Navigation

The Computer Journal 1960 2(4):170-173; doi:10.1093/comjnl/2.4.170
© 1960 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (20)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Clenshaw, C. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Curve Fitting with a Digital Computer

C. W. Clenshaw

National Physical Laboratory, Teddington, UK

Forsythe (1957) has described a method for fitting polynomials to a set of points, using the principle of least squares. The method, designed to exploit the advantages of high-speed computers, uses orthogonal polynomials to overcome the problems of ill-conditioning which are usually associated with this approach. The present paper shows how this powerful method can be modified to save a substantial proportion of the machine storage. This is achieved by representing each polynomial within the machine by the coefficients in its Chebyshev series.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.