Numerische Mathematik

, Volume 53, Issue 4, pp 485–498 | Cite as

Extrapolated Gauss-Seidel I and SOR methods for least-squares problems

  • D. J. Evans
  • C. Li


Recently, special attention has been given in the literature, to the problems of accurately computing the least-squares solution of very largescale over-determined systems of linear equations which occur in geodetic applications. In particular, it has been suggested that one can solve such problems iteratively by applying the block SOR (Successive Overrelaxation) and EGS1 (Extrapolated Gauss Seidel 1) plus semi-iterative methods to a linear system with coefficient matrix 2-cyclic or 3-cyclic. The comparison of 2-block SOR and 3-block SOR was made in [1] and showed that the 2-block SOR is better. In [6], the authors also proved that 3-block EGS1-SI is better than 3-block SOR. Here, we first show that the 2-block DJ (Double Jacobi)-SI, GS-SI and EGS1-SI methods are equivalent and all of them are equivalent to the 3-block EGS1-SI method; then, we prove that the composite methods and 2-block SOR have the same asymptotic rate of convergence, but the former has a better average rate of convergence; finally, numerical experiments are reported, and confirm that the 3-block EGS1-SI is better than the 2-block SOR.

Subject Classifications

AMS (MOS): 65F10 CR: G1.3 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Markham, T.L., Neumann, M., Plemmons, R.J.: Convergence of a direct-iterative method for large-scale least-squares problems. LAA69:155–167 (1965)Google Scholar
  2. 2.
    Papadopoulou, E.P., Papatheodorou, T.S., Saridakis, Y.G.: Block AOR iteration schemes for large-scale least-squares problems. Private Communication (1987)Google Scholar
  3. 3.
    Rice, J.R.: PHRVEC Workshop on really large least squares problems and supercomputers. CSD-TR 464, Computer Science Dept., Purdue Univ., Purdue, Indiana 1983Google Scholar
  4. 4.
    Niethammer, W., Pillis, J. de, Varga, R.S.: Convergence of block iterative methods applied to sparse least squares problems. LAA58: 327–341 (1984)Google Scholar
  5. 5.
    Evans, D.J., Li, C.: The iterative solution of large sparse least-squares problems. Computer Studies 339, Loughborough Univ. of Technology, UK 1987Google Scholar
  6. 6.
    Evans, D.J., Li, C.: The EGS1 and semi-iterative (SI) method for the solution of large sparse least-squares problems. Computer Studies 346, Loughborough Univ. of Tech., UK 1987Google Scholar
  7. 7.
    Evans, D.J., Li, C.: Determination of theD-norm of SOR iterative matrix for the unsymmetric Case. Computer Studies 352, Loughborough Univ. of Tech., UK Math. Comput. (1988) (in press)Google Scholar
  8. 8.
    Young, D.M.: Iterative solution of large linear systems. New York: Academic Press 1971Google Scholar
  9. 9.
    Plemmons, R.J.: Adjustment by least squares in geodesy using block iterative methods for sparse matrices. ARD Report 79-3, Proc. 1979: Army Num. Anal. Comp. Conf., El Paso, 1979Google Scholar
  10. 10.
    Varga, R.S.: Matrix iterative analysis. Engelwood Cliffs: Prentice Hall 1962Google Scholar
  11. 11.
    Hageman, L.A., Young, D.M.: Applied iterative methods. New York: Academic Press 1981Google Scholar
  12. 12.
    Freund, R.: A note on two block SOR methods for sparse least-squares problems. LAA88, 211–221 (1987)Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • D. J. Evans
    • 1
  • C. Li
    • 1
  1. 1.Department of Computer StudiesLoughborough University of TechnologyLoughboroughUK

Personalised recommendations