BIT Numerical Mathematics

, Volume 47, Issue 1, pp 27-44

First online:

Convergence of inexact inverse iteration with application to preconditioned iterative solves

  • M. A. FreitagAffiliated withDepartment of Mathematical Sciences, University of Bath
  • , A. SpenceAffiliated withDepartment of Mathematical Sciences, University of Bath Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper we study inexact inverse iteration for solving the generalised eigenvalue problem A xM 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.

Key words

inverse iteration Newton’s method preconditioned iterative methods