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

DOI10.1098/rspa.2000.0674zbMath0987.65035OpenAlexW2084664249MaRDI QIDQ2748134

Leonidas S. Xanthis, Evgueni E. Ovtchinnikov

Publication date: 9 June 2002

Published in: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: http://westminsterresearch.wmin.ac.uk/529/1/Ovtchinnikov_Xanthis_2001_final.pdf

zbMATH Keywords

large scale problemssubspace iterationeigensolvers with preconditioningmultiple and clustered eigenvaluessuccessive eigenvalue relaxation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (1)

A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems

Uses Software

• JDQR
• JDQZ

This page was built for publication: Successive eigenvalue relaxation: a new method for the generalized eigenvalue problem and convergence estimates