Improving the convergence rate of the inverse iteration method

Rajendran, S and Raghavan, MR and Narasimhan, MV (1995) Improving the convergence rate of the inverse iteration method. In: Computers & Structures, 55 (4). pp. 709-715.

PDF IMPROVING_THE_CONVERGENCE.pdf - Published Version Restricted to Registered users only Download (638kB) | Request a copy

Abstract

Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration method exhibits slow convergence for some eigenproblems. In this paper, a modified inverse iteration algorithm is presented for improving the convergence rate. At every iteration, an optimal linear combination of the latest and the preceding iteration vectors is used as the input vector for the next iteration. The effectiveness of the proposed algorithm is demonstrated for three typical eigenproblems, i.e. eigenproblems with distinct, close and repeated eigenvalues. The algorithm yields 29, 96 and 23% savings in computational time, respectively, for these problems. The algorithm is simple and easy to implement, and this renders the algorithm even more attractive.

Item Type:	Journal Article
Publication:	Computers & Structures
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Department/Centre:	Division of Mechanical Sciences > Mechanical Engineering
Date Deposited:	31 May 2011 06:28
Last Modified:	31 May 2011 06:28
URI:	http://eprints.iisc.ac.in/id/eprint/38030

Actions (login required)

View Item