Accession Number : AD0641341

Title :   A RECURSION RELATION FOR COMPUTING LEAST-SQUARE POLYNOMIALS OVER MOVING-ARCS,

Corporate Author : BALLISTIC RESEARCH LABS ABERDEEN PROVING GROUND MD

Personal Author(s) : Trimble,George R.

Report Date : NOV 1951

Pagination or Media Count : 15

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)

Descriptors :   (*POLYNOMIALS, *LEAST SQUARES METHOD), NUMERICAL ANALYSIS, SERIES(MATHEMATICS), MATHEMATICAL LOGIC

Subject Categories : Statistics and Probability

Distribution Statement : APPROVED FOR PUBLIC RELEASE