Location of Repository

Successive eigenvalue relaxation: a new method for the generalized eigenvalue problem and convergence estimates

By Evgueni Ovtchinnikov and Leonidas Xanthis


We present a new subspace iteration method for the efficient computation of several smallest eigenvalues of the generalized eigenvalue problem Au = lambda Bu for symmetric positive definite operators A and B. We call this method successive eigenvalue relaxation, or the SER method (homoechon of the classical successive over-relaxation,\ud or SOR method for linear systems). In particular, there are two significant features of SER which render it computationally attractive: (i) it can effectively deal with\ud preconditioned large-scale eigenvalue problems, and (ii) its practical implementation does not require any information about the preconditioner used: it can routinely\ud accommodate sophisticated preconditioners designed to meet more exacting requirements (e.g. three-dimensional elasticity problems with small thickness parameters).\ud We endow SER with theoretical convergence estimates allowing for multiple and clusters of eigenvalues and illustrate their usefulness in a numerical example for a\ud discretized partial differential equation exhibiting clusters of eigenvalues.\u

Topics: UOW3
OAI identifier: oai:westminsterresearch.wmin.ac.uk:529
Provided by: WestminsterResearch

Suggested articles



  1. (1997). 150 years old and still alive: eigenproblems.
  2. (2001). A
  3. (1996). A subspace preconditioning algorithm for eigenvector/eigenvalue computation.
  4. (1997). An adaptive subspace method for elliptic eigenproblems with hierarchical basis preconditioning.
  5. (1997). Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem.
  6. (1987). Convergence rate estimates for iterative methods for mesh symmetric eigenvalue problem.
  7. (2000). Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures—a paradigm in three dimensions.
  8. (2000). Eigenvalue computation in the 20th century.
  9. (1993). Eigenvalues of matrices.
  10. (1998). Iterative subspace correction methods for thin elastic structures and Korn’s type inequality in subspaces.
  11. (2000). Mathematics and computing.
  12. (1997). Matrix computations.
  13. (1993). Monster matrices: their eigenvalues and eigenvectors.
  14. (1992). Numerical methods for large eigenvalue problems. Manchester:
  15. (1992). On an iterative method for finding lower eigenvalues.
  16. (1996). Optimization in solving elliptic problems.
  17. (1998). Preconditioned eigensolvers—an oxymoron?
  18. (1998). Review of eigensolution procedures for linear dynamic finite element analysis.
  19. (2000). Successive eigenvalue relaxation.
  20. (1965). The algebraic eigenvalue problem.
  21. (2000). The apodeictics of SER—proofs and praxis.
  22. (1998). The symmetric eigenvalue problem.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.