Skip Navigation

IMA Journal of Applied Mathematics 1968 4(3):295-314; doi:10.1093/imamat/4.3.295
© 1968 by Institute of Mathematics and its Applications
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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
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 Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices

D. J. EVANS

University Computing Laboratory, Department of Applied Mathematics, University of Sheffield

The asymptotic convergence rates of many standard iterative methods for the solution of linear equations can be shown to depend inversely on the P-condition number of the co-efficient matrix. The notion of minimizing the P-condition number and hence maximizing the convergence rate by the introduction of a new pre-conditioning factor is shown to be computationally feasible. The application of this idea to the method of Simultaneous Displacement, Richardson's method and other iterative methods, are discussed and numerical examples given to illustrate its effectiveness.


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.