A New Convergence Theorem for Successive Overrelaxation Iterations
AbstractThis paper contains a new convergence theorem for Gauss-Seidel (SOR) iterations for an arbitrary equation system. We use that theorem to show how to reorder equations and to extend their radius of convergence. It is not generally optimal to minimise the number or size of the above diagonal elements in a non-recursive system. Citation Copyright 1999 by Kluwer Academic Publishers.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Society for Computational Economics in its journal Computational Economics.
Volume (Year): 13 (1999)
Issue (Month): 2 (April)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Hallett, A. J. Hughes & Piscitelli, Laura, 1998. "Simple reordering techniques for expanding the convergence radius of first-order iterative techniques," Journal of Economic Dynamics and Control, Elsevier, vol. 22(8-9), pages 1319-1333, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.