Polynomial Curve Fitting (Streamlined Programs)

FOCAL8-236

Dr. J. H. Battocletti, Medical College of Wisconsin,

Milwaukee, Wisconsin

Near-ultimate streamlined programs to allow the greatest

number of data points and the largest order as possible, are

presented. Two are for the normal polynomial; one forces the

fit to go through zero. The third uses the Chebyshev poly-

nomial. Point-by-point error and total RMS error are

calculated.

Minimum Hardware:
4K PDP-8 with teletype

Source Language:
FOCAL 1969

Catalog: July 1973