Available in electronic format
Available in print format
Mathematics of Computation
Journal of the American Mathematical Society
ISSN 1088-6842(e) ISSN 0025-5718(p)
     

Implicitly restarted Arnoldi with purification for the shift-invert transformation

Author(s): Karl Meerbergen; Alastair Spence.
Journal: Math. Comp. 66 (1997), 667-689.
MSC (1991): Primary 65F15, 65F50
Retrieve article in: PDF
This article is available free of charge

Abstract | Similar articles | Additional information

Abstract: The need to determine a few eigenvalues of a large sparse generalised eigenvalue problem $Ax=\lambda Bx$ with positive semidefinite $B$ arises in many physical situations, for example, in a stability analysis of the discretised Navier-Stokes equation. A common technique is to apply Arnoldi's method to the shift-invert transformation, but this can suffer from numerical instabilities as is illustrated by a numerical example. In this paper, a new method that avoids instabilities is presented which is based on applying the implicitly restarted Arnoldi method with the $B$ semi-inner product and a purification step. The paper contains a rounding error analysis and ends with brief comments on some extensions.


Similar Articles:

Retrieve articles in Mathematics of Computation with MSC (1991): 65F15, 65F50

Retrieve articles in all Journals with MSC (1991): 65F15, 65F50


Additional Information:

Karl Meerbergen
Affiliation: LMS Numerical Technologies, Interleuvenlaan 70, 3001 Heverlee, Belgium
Email: km@lmsnit.be

Alastair Spence
Affiliation: School of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, United Kingdom
Email: A.Spence@maths.bath.ac.uk

DOI: 10.1090/S0025-5718-97-00844-2
PII: S 0025-5718(97)00844-2
Keywords: Sparse generalised eigenvalue problems, shift-invert, semi-inner product, implicitly restarted Arnoldi.
Received by editor(s): May 9, 1995
Received by editor(s) in revised form: November 5, 1995
Copyright of article: Copyright 1997, American Mathematical Society


  AMS Website Logo Small Comments: webmaster@ams.org
© Copyright 2009, American Mathematical Society
Privacy Statement
Search the AMSPowered by Google