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.

 

The sigma-SOR algorithm and the optimal strategy for the utilization of the SOR iterative method
HTML articles powered by AMS MathViewer

by Zbigniew I. Woźnicki PDF
Math. Comp. 62 (1994), 619-644 Request permission

Corrigendum: Math. Comp. 66 (1997), 1769-1769.

Abstract:

The paper describes, discusses, and numerically illustrates the method for obtaining a priori estimates of the optimum relaxation factor in the SOR iteration method. The computational strategy of this method uses the so-called Sigma-SOR algorithm based on the theoretical result proven in the paper. The method presented is especially efficient for problems with slowly convergent iteration process and in this case is strongly competitive with adaptive procedures used for determining dynamically the optimum relaxation factor during the course of the SOR solution.
References
  • Louis A. Hageman and David M. Young, Applied iterative methods, Computer Science and Applied Mathematics, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], New York-London, 1981. MR 630192
    • B. A. Carré, The determination of the optimum accelerating factor for successive over-relaxation, Comput. J. 4 (1961), 73-78.
  • H. E. Kulsrud, A practical technique for the determination of the optimum relaxation factor of the successive over-relaxation method, Comm. ACM 4 (1961), 184–187. MR 0143336, DOI 10.1145/355578.366504
    • L. A. Hageman and R. B. Kellogg, Estimating optimum relaxation factors for use in the successive over relaxation and the Chebyshev polynomial methods of iteration, WAPD-TM-592, 1966.
  • J. H. Wilkinson, The algebraic eigenvalue problem, Clarendon Press, Oxford, 1965. MR 0184422
  • Louis A. Hageman and Richard S. Varga, Block iterative methods for cyclically reduced matrix equations, Numer. Math. 6 (1964), 106–119. MR 166912, DOI 10.1007/BF01386061
  • P. Concus, G. H. Golub, and G. Meurant, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statist. Comput. 6 (1985), no. 1, 220–252. MR 773293, DOI 10.1137/0906018
  • Z. I. Woźnicki, On numerical analysis of conjugate gradient method, Japan J. Indust. Appl. Math. 10 (1993), no. 3, 487–519. MR 1247879, DOI 10.1007/BF03167286
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65F10, 65B99
  • Retrieve articles in all journals with MSC: 65F10, 65B99
Additional Information
  • © Copyright 1994 American Mathematical Society
  • Journal: Math. Comp. 62 (1994), 619-644
  • MSC: Primary 65F10; Secondary 65B99
  • DOI: https://doi.org/10.1090/S0025-5718-1994-1212270-6
  • MathSciNet review: 1212270