G. A. Atenekeng-kahou, L. Grigori, and M. Sosonkina, A partitioning algorithm for block-diagonal matrices with overlap, Parallel Computing, vol.34, issue.6-8, pp.332-344, 2008.
DOI : 10.1016/j.parco.2008.01.004

O. Bertrand and B. Philippe, Counting the eigenvalues surrounded by a closed curve, Zh. Ind. Mat, vol.4, pp.73-94, 2001.

E. Kamgnia and B. Philippe, Counting eigenvalues in domains of the complex field, Electronic Transactions on Numerical Analysis, vol.40, pp.1-16, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00795730

G. Golub and C. V. , Loan Matrix Computation, p51, 1989.

G. Karypis and V. Kumar, METIS -unstructured graph partitioning and sparse matrix ordering system, version 2.0, CS Dept, 1995.

E. Polizzi and A. , Sameh A parallel hybrid banded systems solver: the SPIKE algorithm Parallel Computing, pp.177-194, 2006.

Y. Maeda and Y. Futamura, Sakurai and Tetsuya Stochastic estimation method of eigenvalue density for nonlinear eigenvalue problem on the complex plane JSIAM Letters, pp.61-64, 2011.

;. X. Superlu, L. J. Sherry, J. Demmel, L. Gilbert, M. Grigori et al., SuperLU is a general purpose bibrary for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines http://crd-legacy.lbl.gov/ xiaoye/SuperLU [11] MUMPS; Multifrontal Massively Parallel sparse direct Solver http://graal.enslyon .fr/MUMPS/ [12] UMFPACK; Unsymmetric Multifrontal Sparse LU Factorization Package

T. A. Davis and I. S. Duff, An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.1, pp.140-158, 1997.
DOI : 10.1137/S0895479894246905

M. Market, Service of the Mathematical and Computational Sciences Division / Information Technology Laboratory / National Institute of Standards and Technology