A new convergence theorem for successive overrelaxation iterations
The authors propose convergence criteria (sufficient conditions) on the successive overrelaxation iterations for systems of linear real equation. Tight bounds for the relaxation parameter are given which guarantee convergence of the method. These bounds depend on the positive real roots of an \(n\)th degree polynomial. To get simple estimates to the roots, quadratic or linear approximations to that polynomial around zero may be used. A sequence of convergence tests in ascending order of computational complexity is presented. All these theoretical results, combined with reordering equations techniques to accelerate the convergence, are demonstrated by numerical examples.
- New Simple Criteria for the Jacobi, Gauss‐Seidel and SOR Iterations
- On the convergence of the modified accelerated overrelaxation (MAOR) method
- A sufficient and necessary condition of the convergence of the SAOR iterative method for consistently ordered matrices
- Convergence on successive over-relaxed iterative methods for non-Hermitian positive definite linear systems
- Successive overrelaxation (SOR) and related methods
- Simple reordering techniques for expanding the convergence radius of first-order iterative techniques
- The Convergence of Accelerated Overrelaxation Iterations
- Convergence of the Successive Overrelaxation Method
- scientific article; zbMATH DE number 749711 (Why is no real title available?)
- Influence of the form of convection-diffusion equation on the convergence of the successive over-relaxation method
This page was built for publication: A new convergence theorem for successive overrelaxation iterations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300637)
