Skip to main content
Log in

On the Convergence Rate of a Preconditioned Subspace Eigensolver

  • Published:
Computing Aims and scope Submit manuscript

Abstract.

In this paper we present a proof of convergence for a preconditioned subspace method which shows the dependency of the convergence rate on the preconditioner used. This convergence rate depends only on the condition of the pre-conditioned system \( \kappa _{2}(MA) \) and the relative separation of the first two eigenvalues \( 1-\lambda _{1}/\lambda _{2} \). This means that, for example, multigrid preconditioners can be used to find eigenvalues of elliptic PDE's at a grid-independent rate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: March 9, 1999, revised June 23, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oliveira, S. On the Convergence Rate of a Preconditioned Subspace Eigensolver. Computing 63, 219–231 (1999). https://doi.org/10.1007/s006070050032

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s006070050032

Navigation