M. Crouzeix, B. Philippe, and M. Sadkane, The Davidson Method, SIAM Journal on Scientific Computing, vol.15, issue.1, pp.62-76, 1994.
DOI : 10.1137/0915004
URL : https://hal.archives-ouvertes.fr/inria-00075206

E. R. Davidson, The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices, Journal of Computational Physics, vol.17, issue.1, pp.87-94, 1975.
DOI : 10.1016/0021-9991(75)90065-0

G. H. Golub and Q. Ye, Inexact inverse iteration for generalized eigenvalue problems, pp.40-671, 2000.

M. E. Hochstenbach and Y. Notay, The Jacobi-Davidson method, GAMM-Mitteilungen, pp.368-382, 2006.

Y. Lai, K. Lin, and W. Lin, An inexact inverse iteration for large sparse eigenvalue problems, Numerical Linear Algebra with Applications, vol.13, issue.5, pp.425-437, 1997.
DOI : 10.1002/(SICI)1099-1506(199709/10)4:5<425::AID-NLA117>3.0.CO;2-G

B. N. Parlett, The Symmetric Eigenvalue Problem, Reprinted as Classics in Applied Mathematics, vol.20, 1980.
DOI : 10.1137/1.9781611971163

B. N. Parlett, D. R. Taylor, and Z. A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp, vol.44, pp.105-124, 1985.

G. Peters and J. H. Wilkinson, Inverse Iteration, Ill-Conditioned Equations and Newton???s Method, SIAM Review, vol.21, issue.3, pp.339-360, 1979.
DOI : 10.1137/1021052

A. Ruhe, Rational Krylov sequence methods for eigenvalue computation, Linear Algebra and its Applications, vol.58, pp.391-405, 1984.
DOI : 10.1016/0024-3795(84)90221-0

A. Ruhe, Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils, SIAM Journal on Scientific Computing, vol.19, issue.5, pp.1535-1551, 1998.
DOI : 10.1137/S1064827595285597

Y. Saad, Numerical Methods for Large Eigenvalue Problems, 1992.
DOI : 10.1137/1.9781611970739

O. Schenk, M. Bollhöfer, and R. A. Römer, On large-scale diagonalization techniques for the Anderson model of localization, SIAM Review also appears in SIAM J. Sci. Comput, vol.50, issue.28, pp.91-112, 2006.

V. Simoncini and L. Elden, Inexact Rayleigh quotient-type methods for eigenvalue computations, BIT, pp.42-159, 2002.

G. L. Sleijpen, H. A. Van-der, . Vorst, and . Jacobi, A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems, SIAM Review, vol.42, issue.2, pp.401-425, 1996.
DOI : 10.1137/S0036144599363084

D. C. Sorensen, -Step Arnoldi Method, SIAM Journal on Matrix Analysis and Applications, vol.13, issue.1, pp.357-385, 1992.
DOI : 10.1137/0613025
URL : https://hal.archives-ouvertes.fr/hprints-00957151

D. C. Sorensen and C. Yang, A Truncated RQ Iteration for Large Scale Eigenvalue Calculations, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.4, pp.1045-1073, 1998.
DOI : 10.1137/S0895479896305398

G. W. Stewart, Matrix Algorithms, 2001.

L. N. Trefethen and R. S. Schreiber, Average-Case Stability of Gaussian Elimination, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.3, pp.335-360, 1990.
DOI : 10.1137/0611023

H. A. Van and . Vorst, Computational methods for large eigenvalue problems Handbook of Numerical Analysis, pp.3-179, 2002.

D. S. Watkins, The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods, 2008.
DOI : 10.1137/1.9780898717808

J. H. Wilkinson, The Algebraic Eigenvalue Problem, 1965.

C. Yang, Convergence analysis of an inexact truncated RQ-iteration, Electronic Transactions on Numerical Analysis, vol.7, pp.40-55, 1998.

Y. Zhou and Y. Saad, A Chebyshev???Davidson Algorithm for Large Symmetric Eigenproblems, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.3, pp.954-971, 2007.
DOI : 10.1137/050630404