I. Subaihi and G. A. Watson, Fitting parametric curves and surfaces by ? ? distance regression, BIT, pp.45-443, 2005.

J. Baglama, D. Calvetti, and L. , Fast Leja points, Electron. Trans. Numer. Anal, vol.7, pp.124-140, 1998.

Z. Bai, D. Hu, and L. , Implementation of GMRES method using QR factorization, Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, pp.84-91, 1992.

Z. , D. , and M. Si, R e i c h e l ,AN e w t o nb a s i sG, J. Numer. Anal, pp.14-563, 1994.

B. Beckermann and L. , Error estimation and evaluation of matrix functions via the Faber transform, SIAM J. Numer. Anal

M. Bellalij, Y. Saad, and H. Sadok, On the convergence of the Arnoldi process for eigenvalue problems, 2007.

D. Calvetti, G. H. Golub, and L. , An adaptive Chebyshev iterative method\newline for nonsymmetric linear systems based on modified moments, Numerische Mathematik, vol.67, issue.1, pp.21-40, 1994.
DOI : 10.1007/s002110050016

D. Calvetti, J. Petersen, and L. , A parallel implementation of the GMRES algorithm, in Numerical Linear Algebra, pp.31-46, 1993.

P. J. Davis, Interpolation and Approximation, 1975.

M. Eiermann, Fields of values and iterative methods, Linear Algebra and its Applications, vol.180, pp.167-198, 1993.
DOI : 10.1016/0024-3795(93)90530-2

H. C. Elman, Y. Saad, and P. E. Saylor, A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations, SIAM Journal on Scientific and Statistical Computing, vol.7, issue.3, pp.840-855, 1986.
DOI : 10.1137/0907057

W. Gautschi, The condition of orthogonal polynomials, Mathematics of Computation, vol.26, issue.120, pp.923-924, 1972.
DOI : 10.1090/S0025-5718-1972-0313558-9

W. Gautschi, The condition of polynomials in power form, Mathematics of Computation, vol.33, issue.145, pp.343-352, 1979.
DOI : 10.1090/S0025-5718-1979-0514830-6

M. Gutknecht and S. Röllin, The Chebyshev iteration revisited, Parallel Computing, vol.28, issue.2, pp.263-283, 2002.
DOI : 10.1016/S0167-8191(01)00139-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.1625

W. D. Joubert and G. F. Carey, Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory, International Journal of Computer Mathematics, vol.572, issue.1-4, pp.243-267, 1992.
DOI : 10.1016/0024-3795(80)90165-2
URL : https://digital.library.unt.edu/ark:/67531/metadc704755/m2/1/high_res_d/674849.pdf

W. D. Joubert and G. F. Carey, Parallelizable restarted iterative methods for nonsymmetric linear systems. Part II: Parallel implementation, Intern, J. Computer Math, vol.44, pp.269-290, 1992.

F. Leja, Sur certaines suits liées aux ensemble plan et leur applicationàlapplication`applicationàl a representation conforme, Ann. Polon. Math, vol.4, pp.8-13, 1957.

T. A. Manteuffel and G. Starke, On hybrid iterative methods for nonsymmetric systems of linear equations, Numerische Mathematik, vol.73, issue.4, pp.489-506, 1996.
DOI : 10.1007/s002110050202

N. M. Nachtigal, L. Reichel, and L. N. Trefethen, A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems, SIAM Journal on Matrix Analysis and Applications, vol.13, issue.3, pp.796-825, 1992.
DOI : 10.1137/0613050

Y. Saad, Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems, SIAM Journal on Numerical Analysis, vol.24, issue.1, pp.155-169, 1987.
DOI : 10.1137/0724013

Y. Saad, Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator, SIAM Journal on Numerical Analysis, vol.29, issue.1, pp.209-228, 1992.
DOI : 10.1137/0729014

Y. Saad, Iterative Methods for Sparse Linear Systems, 2003.
DOI : 10.1137/1.9780898718003

Y. Saad and M. H. Schultz, GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, vol.7, issue.3, pp.856-869, 1986.
DOI : 10.1137/0907058

R. B. Sidje, Alternatives for parallel Krylov subspace basis computation, Numerical Linear Algebra with Applications, vol.19, issue.4, pp.305-331, 1997.
DOI : 10.1002/(SICI)1099-1506(199707/08)4:4<305::AID-NLA104>3.0.CO;2-D

G. Starke and R. S. Varga, A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations, Numerische Mathematik, vol.5, issue.156, pp.213-240, 1993.
DOI : 10.1007/BF01388688

R. Taylor and V. Totik, Lebesgue constants for Leja points, IMA Journal of Numerical Analysis, vol.30, issue.2
DOI : 10.1093/imanum/drn082
URL : http://imajna.oxfordjournals.org/cgi/content/short/30/2/462

K. Toh and L. N. Trefethen, Calculation of Pseudospectra by the Arnoldi Iteration, SIAM Journal on Scientific Computing, vol.17, issue.1, pp.1-15, 1996.
DOI : 10.1137/0917002

T. G. Wright and L. N. Trefethen, Large-Scale Computation of Pseudospectra Using ARPACK and Eigs, SIAM Journal on Scientific Computing, vol.23, issue.2, pp.591-605, 2001.
DOI : 10.1137/S106482750037322X