On the convergence of the SAOR method and the error bounds for its acceleration

DOI10.1016/0377-0427(88)90002-7zbMath0659.65030OpenAlexW2014824478MaRDI QIDQ1112552

David J. Evans, Chang-jun Li

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90002-7

zbMATH Keywords

convergence accelerationerror boundssymmetric successive overrelaxationsemi-iterative methodssymmetric accelerated overrelaxationacceleration parameter

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (3)

Preconditioned Conjugate Gradient Method and Generalized Successive Overrelaxation Method for the Least Squares Problems ⋮ GSOR Method for the Equality Constrained Least Squares Problems and the Generalized Least Squares Problems ⋮ Preconditioned conjugate gradient method and generalized successive over relaxation method for the weighted least squares problems

Cites Work

• Unnamed Item
• Unnamed Item
• Non-adaptive and adaptive SAOR-CG algorithms
• The principle of extrapolation in connection with the accelerated overrelaxation method
• Symmetric accelerated overrelaxation (saor) method
• Three-part splittings and Varca's type extensions of the successive overrelaxation (SOR) theory
• Optimum Accelerated Overrelaxation (AOR) Method for Systems with Positive Definite Coefficient Matrix
• A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
• Optimum Accelerated Overrelaxation Method in a Special Case
• Accelerated Overrelaxation Method

This page was built for publication: On the convergence of the SAOR method and the error bounds for its acceleration