da Cunha, Rudnei Dias and Hopkins, Tim
(1993)
*
A Comparison of Acceleration Techniques Applied to the Sor Method.
*
In: Cuyt, A., ed.
Nonlinear Numerical Methods and Rational Approximation II.
Mathematics and Its Applications
.
Springer, Dordrecht, Netherlands, pp. 247-260.
ISBN 0-7923-2967-8.
(doi:10.1007/978-94-011-0970-3_21)
(The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)
(KAR id:20495)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |

Official URL http://dx.doi.org/10.1007/978-94-011-0970-3_21 |

## Abstract

In this paper we investigate the performance of four different SOR acceleration techniques on a variety of linear systems. Two of these techniques have been proposed by Dancis [1] who uses a polynomial acceleration together with a sub-optimal ω. The two other techniques discussed are vector accelerations; the ε algorithm proposed by Wynn [9] and a generalisation of Aitken’s Δ2 algorithm, proposed by Graves-Morris [3].

The experimental results show that these accelerations can reduce the amount of work required to obtain a solution and that their rates of convergence are generally less sensitive to the value of ω than the straightforward SOR method. However a poor choice of ω can result in particularly inefficient solutions and more work is required to enable cheap estimates of a effective parameter to be obtained.

Necessary conditions for the reduction in the computational work required for convergence are given for each of the accelerations, based on the number of floating-point operations.

It is shown experimentally that the reduction in the number of iterations is related to the separation between the two largest eigenvalues of the SOR iteration matrix for a given ω. This separation influences the convergence of all the acceleration techniques above.

Another important characteristic exhibited by these accelerations is that even if the number of iterations is not reduced significantly compared to the SOR method, they are competitive in terms of number of floating-point operations used and thus they reduce the overall computational workload.

Item Type: | Book section |
---|---|

DOI/Identification number: | 10.1007/978-94-011-0970-3_21 |

Uncontrolled keywords: | Sor; acceleration |

Subjects: | Q Science > QA Mathematics (inc Computing science) |

Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Mathematics, Statistics and Actuarial Science |

Depositing User: | P. Ogbuji |

Date Deposited: | 01 Jul 2009 20:10 UTC |

Last Modified: | 16 Nov 2021 09:58 UTC |

Resource URI: | https://kar.kent.ac.uk/id/eprint/20495 (The current URI for this page, for reference purposes) |

- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV

- Depositors only (login required):