Skip Navigation

The Computer Journal 1964 7(2):137-140; doi:10.1093/comjnl/7.2.137
© 1964 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Evans, D. J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The extrapolated modified Aitken iteration method applied to {sigma}1-ordered systems of linear equations

D. J. Evans *

Computing Machine Laboratory, The University, Manchester, UK

The extrapolated Aitken iteration method as applied to {sigma}2-ordered systems of linear equations was proposed and analyzed by Evans (1963), who showed that with a suitable choice of extrapolation factor, together with Chebyshev acceleration, an asymptotic rate of convergence superior to the of S.O.R. may be obtained for certain problems.

The present paper applies the above method to {sigma}1-ordered systems of linear equations, and the analysis concerning the extrapolation and Chebyshev acceleration of the iterative procedure is discussed. The theoretical results derived for the asymptotic rate of convergence for both the {sigma}1 and {sigma}2-orderings are confirmed by numerical examples.



* Computing Machine Laboratory, The University, Manchester 13.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.