A RECURSION RELATION FOR COMPUTING LEAST-SQUARE POLYNOMIALS OVER MOVING-ARCS,
Abstract
The smoothing of data may be accomplished on automatic computing machines such as the IBM Card-Programmed Electronic Calculator or the Eniac by fitting least-square polynomials over moving-arcs. Essentially it consists of fitting least-square polynomials successively over finite subsets of a given finite set of real points in a plane. The difficulty with the procedure has been in the small number of storage registers available in the machines. By means of the recursion relation between coefficients of successive least-square polynomials as derived in the report, the number of required storage registers is materially reduced, making practicable the application of the IBM Card-Programmed Electronic Calculator or the Eniac to this type of problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1951
- Accession Number
- AD0641341
Entities
People
- George R. Trimble
Organizations
- Ballistic Research Laboratory