A process is described and evaluated for computing a least squares polynomial approximation of data points in which the optimum degree of the polynomial is automatically determined. An iterative smoothing technique is used to replace every point with the value taken on by a moving least squares polynomial computed from a subset of points centered at the point to be replaced. The optimum degree of the resulting polynomial approximation is determined by analyzing the finite differences of each successive set of smoothed points. To evaluate the process, both artificially constructed data and actual Mariner Mars 1971 (MM'71) tracking data are used. This process was incorporated into a transmission media calibration computer program (MEDIA), whi...
Algorithms and original data matrix approaches compared for linear least squares proble
Langley plots are used to calibrate sun radiometers primarily for the measurement of the aerosol com...
summary:A numerical method of fitting a multiparameter function, non-linear in the parameters which ...
Application of polynomial-smoothing formulas and related derivative-estimating formulas simplifies c...
An efficient algorithm for selecting the degree of a polynomial that defines a curve that best appro...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Least squares method theory and application to curve fitting, data smoothing, and solution of overde...
Contains report on one research project.Joint Services Electronics Programs (U.S. Army, U.S. Navy, a...
The design of optimum polynomial digital data smoothers (filters) is considered for linear and adapt...
The fact that least squares polynomial surfaces can be used to effect a form of low pass filtering (...
Least squares technique and curve fitting subroutine for backscatter data analysi
Two algorithms are presented for smoothing arbitrary sets of data. They are the explicit variable al...
Square root information estimation, starting from its beginnings in least-squares parameter estimati...
A systematic pointing error model is used to calibrate antennas in the Deep Space Network. The least...
Modern processes of air traffic control are realized on a single information platform called globall...
Algorithms and original data matrix approaches compared for linear least squares proble
Langley plots are used to calibrate sun radiometers primarily for the measurement of the aerosol com...
summary:A numerical method of fitting a multiparameter function, non-linear in the parameters which ...
Application of polynomial-smoothing formulas and related derivative-estimating formulas simplifies c...
An efficient algorithm for selecting the degree of a polynomial that defines a curve that best appro...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Least squares method theory and application to curve fitting, data smoothing, and solution of overde...
Contains report on one research project.Joint Services Electronics Programs (U.S. Army, U.S. Navy, a...
The design of optimum polynomial digital data smoothers (filters) is considered for linear and adapt...
The fact that least squares polynomial surfaces can be used to effect a form of low pass filtering (...
Least squares technique and curve fitting subroutine for backscatter data analysi
Two algorithms are presented for smoothing arbitrary sets of data. They are the explicit variable al...
Square root information estimation, starting from its beginnings in least-squares parameter estimati...
A systematic pointing error model is used to calibrate antennas in the Deep Space Network. The least...
Modern processes of air traffic control are realized on a single information platform called globall...
Algorithms and original data matrix approaches compared for linear least squares proble
Langley plots are used to calibrate sun radiometers primarily for the measurement of the aerosol com...
summary:A numerical method of fitting a multiparameter function, non-linear in the parameters which ...