Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration

2003 ◽  
Vol 41 (1) ◽  
pp. 272-286 ◽  
Author(s):  
E. Ovtchinnikov
Keyword(s):  
Eigenvalue Problems ◽  
Davidson Method ◽  
Convergence Estimates ◽  
Symmetric Eigenvalue Problems

A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems

2017 ◽  
Vol 7 (1) ◽  
pp. 21-37 ◽  
Author(s):  
Cun-Qiang Miao
Keyword(s):  
Convergence Rate ◽  
Chebyshev Polynomials ◽  
Numerical Experiments ◽  
Eigenvalue Problems ◽  
Cubic Convergence ◽  
Davidson Method ◽  
Filtering Technique ◽  
Matrix Vector ◽  
Three Term Recurrence Relation ◽  
Symmetric Eigenvalue Problems

AbstractFor symmetric eigenvalue problems, we constructed a three-term recurrence polynomial filter by means of Chebyshev polynomials. The new filtering technique does not need to solve linear systems and only needs matrix-vector products. It is a memory conserving filtering technique for its three-term recurrence relation. As an application, we use this filtering strategy to the Davidson method and propose the filtered-Davidson method. Through choosing suitable shifts, this method can gain cubic convergence rate locally. Theory and numerical experiments show the efficiency of the new filtering technique.

Sign in / Sign up

Export Citation Format

Share Document