Extrapolated Iterative Methods for Linear Systems Approximation
- 1 February 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 21 (1) , 192-201
- https://doi.org/10.1137/0721014
Abstract
In this note, we present results on extrapolated iterative methods, especially the extrapolated successive overrelaxation (ESOR). We show that they converge even if the original iteration diverges which increases considerably the scope of application of iterative schemes. The ESOR method is discussed under this aspect for consistently ordered systems and complex eigenvalues of the Jacobi iteration matrix. Comparison theorems are given to show that the ESOR is particularly useful if the SOR diverges or its optimum parameter $\omega _b $ cannot be determined; but even if $\omega _b $ is known the ESOR may be faster than the SOR method. Further insight into the structure of the method is obtained by relating it to Euler’s integration method.
Keywords
This publication has 5 references indexed in Scilit:
- On the Convergence of Some Generalized Preconditioned Iterative MethodsSIAM Journal on Numerical Analysis, 1981
- On Different Splittings and the Associated Iteration MethodsSIAM Journal on Numerical Analysis, 1979
- Accelerated overrelaxation methodMathematics of Computation, 1978
- On a two-parametric iteration methodApplications of Mathematics, 1973
- Solving linear algebraic equations can be interestingBulletin of the American Mathematical Society, 1953