1 Matching Results

Search Results

Advanced search parameters have been applied.

On the Convergence of an Implicitly Restarted Arnoldi Method

Description: We show that Sorensen's [35] implicitly restarted Arnoldi method (including its block extension) is simultaneous iteration with an implicit projection step to accelerate convergence to the invariant subspace of interest. By using the geometric convergence theory for simultaneous iteration due to Watkins and Elsner [43], we prove that an implicitly restarted Arnoldi method can achieve a super-linear rate of convergence to the dominant invariant subspace of a matrix. Moreover, we show how an IRAM computes a nested sequence of approximations for the partial Schur decomposition associated with the dominant invariant subspace of a matrix.
Date: July 12, 1999
Creator: Lehoucq, Richard B.
Partner: UNT Libraries Government Documents Department