Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Comparison of the method of averages with the method of least squares.
HTML articles powered by AMS MathViewer

by G. Dahlquist, B. Sjöberg and P. Svensson PDF
Math. Comp. 22 (1968), 833-845 Request permission

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.
References
  • P. G. Guest, Numerical methods of curve fitting, Cambridge University Press, New York, 1961. MR 0120762
  • Alston S. Householder, The theory of matrices in numerical analysis, Blaisdell Publishing Co. [Ginn and Co.], New York-Toronto-London, 1964. MR 0175290
    • Ch. Jordan, Calculus of Finite Differences, reprint of 2nd ed., Chelsea, New York, 1960. MR 1, 74. Ch. Jordan, "Approximation and graduation according to the principle of least squares by orthogonal polynomials," Ann. Math. Statist., 1932, pp. 257–357.
  • Tosio Kato, Perturbation theory for linear operators, Die Grundlehren der mathematischen Wissenschaften, Band 132, Springer-Verlag New York, Inc., New York, 1966. MR 0203473
  • J. W. Linnik, Method of least squares and principles of the theory of observations. , Pergamon Press, New York-Oxford-London-Paris, 1961. Translated from the Russian by Regina C. Elandt; edited by N. L. Johnson. MR 0124121
  • Morris Morduchow, Method of averages and its comparison with the method of least squares, J. Appl. Phys. 25 (1954), 1260–1263. MR 65249, DOI 10.1063/1.1721540
  • Morris Morduchow and Lionel Levin, Comparison of the method of averages with the method of least squares: fitting a parabola, J. Math. and Phys. 38 (1959/60), 181–192. MR 111119, DOI 10.1002/sapm1959381181
    • B. Sjöberg & P. Svensson, Medelvärdesmetodens Effektivitet vid Kurvanpassning, Royal Institute of Technology Computer Science Dept. Report, Stockholm, 1964.
  • Survey of numerical analysis, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1962. MR 0135221
    • J. M. Varah, The Computation of Bounds for the Invariant Subspaces of a General Matrix Operator, Stanford University Computer Science Dept. Technical Report No. CS 66. E. Whittaker & G. Robinson, The Calculus of Observations, 4th ed., Blackie, London, 1944.
  • J. H. Wilkinson, The algebraic eigenvalue problem, Clarendon Press, Oxford, 1965. MR 0184422
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65.35
  • Retrieve articles in all journals with MSC: 65.35
Additional Information
  • © Copyright 1968 American Mathematical Society
  • Journal: Math. Comp. 22 (1968), 833-845
  • MSC: Primary 65.35
  • DOI: https://doi.org/10.1090/S0025-5718-1968-0239742-X
  • MathSciNet review: 0239742