Comparison of the method of averages with the method of least squares.
- 1 January 1968
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 22 (104) , 833-845
- https://doi.org/10.1090/s0025-5718-1968-0239742-x
Abstract
It is shown that the computationally simple method of averages can yield a surprisingly good solution of an overdetermined system of linear equations, provided that the grouping of the equations is done in an appropriate way. The notion of angle between linear subspaces is applied in a general comparison of this method and the method of least squares. The optimal application of the method is treated for the test problem of fitting a polynomial of degree less than six.Keywords
This publication has 5 references indexed in Scilit:
- The Theory of Matrices in Numerical Analysis.The American Mathematical Monthly, 1966
- The Algebraic Eigenvalue ProblemMathematics of Computation, 1966
- Comparison of the Method of Averages with the Method of Least Squares: Fitting a ParabolaJournal of Mathematics and Physics, 1959
- Method of Averages and Its Comparison with the Method of Least SquaresJournal of Applied Physics, 1954
- Approximation and Graduation According to the Principle of Least Squares by Orthogonal PolynomialsThe Annals of Mathematical Statistics, 1932