Convergence of inexact inverse iteration with application to preconditioned iterative solves


Freitag, M. and Spence, A., 2007. Convergence of inexact inverse iteration with application to preconditioned iterative solves. BIT Numerical Mathematics, 47 (1), pp. 27-44.

Related documents:

PDF (Spence_BIT_accepted.pdf) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (218kB) | Preview

    Official URL:


    In this paper we study inexact inverse iteration for solving the generalised eigenvalue problem A x=λM x. We show that inexact inverse iteration is a modified Newton method and hence obtain convergence rates for various versions of inexact inverse iteration for the calculation of an algebraically simple eigenvalue. In particular, if the inexact solves are carried out with a tolerance chosen proportional to the eigenvalue residual then quadratic convergence is achieved. We also show how modifying the right hand side in inverse iteration still provides a convergent method, but the rate of convergence will be quadratic only under certain conditions on the right hand side. We discuss the implications of this for the preconditioned iterative solution of the linear systems. Finally we introduce a new ILU preconditioner which is a simple modification to the usual preconditioner, but which has advantages both for the standard form of inverse iteration and for the version with a modified right hand side. Numerical examples are given to illustrate the theoretical results.


    Item Type Articles
    CreatorsFreitag, M.and Spence, A.
    Uncontrolled Keywordspreconditioned iterative methods,newton’s method,inverse iteration
    DepartmentsFaculty of Science > Mathematical Sciences
    ID Code169
    Additional Information©The original publication is available at


    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...