S. Barnett, Polynomial and Linear Control Systems, 1983.

D. Bini, Numerical Computation of Polynomial Zeros by Means of Aberth's Method, Numerical Algorithms 13, pp.179-200, 1996.

D. A. Bini and G. Fiorentino, Design, Analysis, and Implementation of a Multiprecision Polynomial Rootfinder, Numerical Algorithms, pp.127-173, 2000.

D. A. Bini and L. , Solving secular and polynomial equations: A multiprecision algorithm, Journal of Computational and Applied Mathematics, vol.272, pp.276-292, 2014.
DOI : 10.1016/j.cam.2013.04.037

G. E. Box and G. M. Jenkins, Time Series Analysis: Forecasting and Control, 1976.
DOI : 10.1002/9781118619193

C. Brunie and P. Picart, A Fast Version of the Schur???Cohn Algorithm, Journal of Complexity, vol.16, issue.1, pp.54-69, 2000.
DOI : 10.1006/jcom.1999.0528

C. J. Demeure and C. T. Mullis, The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.37, issue.4, pp.545-552, 1989.
DOI : 10.1109/29.17535

C. J. Demeure and C. T. Mullis, A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.38, issue.10, pp.1697-1709, 1990.
DOI : 10.1109/29.60101

S. Fortune, An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials, Journal of Symbolic Computation, vol.33, issue.5, pp.627-646, 2002.
DOI : 10.1006/jsco.2002.0526

M. Fürer, Faster Integer Multiplication, SIAM Journal on Computing, vol.39, issue.3, pp.979-1005, 2009.
DOI : 10.1137/070711761

A. S. Householder, . Dandelin, and . Lobachevskii, Dandelin, Lobacevskii, or Graeffe, The American Mathematical Monthly, vol.66, issue.6, pp.464-466, 1959.
DOI : 10.2307/2310626

P. Kirrinnis, Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z], Journal of Complexity, vol.14, issue.3, pp.378-444, 1998.
DOI : 10.1006/jcom.1998.0481

A. Kobel and M. Sagraloff, Fast Approximate Polynomial Multipoint Evaluation and Applications, 2013.

J. M. Mcnamee, A 2002 Update of the Supplementary Bibliography on Roots of Polynomials, J. of Computational and Applied Math, vol.142, pp.433-434, 2002.

J. M. Mcnamee, Numerical Methods for Roots of Polynomials, 2007.

J. M. Mcnamee and V. Y. Pan, Efficient polynomial root-refiners: A survey and new record efficiency estimates, Computers & Mathematics with Applications, vol.63, issue.1, pp.239-254, 2012.
DOI : 10.1016/j.camwa.2011.11.015

J. M. Mcnamee and V. Y. Pan, Numerical Methods for Roots of Polynomials

K. Mehlhorn, M. Sagraloff, and P. Wang, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Proc. International Symp. on Symbolic and Algebraic Computations, pp.283-290, 2013.
DOI : 10.1016/j.jsc.2014.02.001

R. Moenck and A. Borodin, Fast modular transforms via division, 13th Annual Symposium on Switching and Automata Theory (swat 1972), pp.90-96, 1972.
DOI : 10.1109/SWAT.1972.5

V. Y. Pan, How to Multiply Matrices Faster, Lecture Notes in Computer Science, vol.179, 1984.
DOI : 10.1007/3-540-13866-8

V. Y. Pan, Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration, Journal of Complexity, vol.16, issue.1, pp.213-264, 2000.
DOI : 10.1006/jcom.1999.0532

V. Y. Pan, Univariate polynomials, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.701-733, 2002.
DOI : 10.1145/384101.384136

V. Y. Panv, V. Gerdt, E. W. Koepf, E. V. Mayr, and . Vorozhtsov, Root-refining for a Polynomial Equation, Proceedings of CASC 2012, pp.271-282, 2012.

V. Y. Pan and E. P. Tsigaridas, On the boolean complexity of real root refinement, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pp.299-306, 2013.
DOI : 10.1145/2465506.2465938
URL : https://hal.archives-ouvertes.fr/hal-00816214

V. Y. Pan and E. P. Tsigaridas, Nearly optimal refinement of real roots of a univariate polynomial, Journal of Symbolic Computation, vol.74, 2015.
DOI : 10.1016/j.jsc.2015.06.009
URL : https://hal.archives-ouvertes.fr/hal-00960896

J. Renegar, On the worst-case arithmetic complexity of approximating zeros of polynomials, Journal of Complexity, vol.3, issue.2, pp.90-113, 1987.
DOI : 10.1016/0885-064X(87)90022-7

A. Schönhage, The Fundamental Theorem of Algebra in Terms of Computational Complexity, Preliminary Report, 1982.

P. Tilli, Convergence Conditions of Some Methods for the Simultaneous Computations of Polynomial Zeros, Calcolo, pp.3-15, 1998.

J. Van-der-hoeven, Fast Composition of Numeric Power Series, 2008.

P. M. Van-dooren, Some Numerical Challenges in Control Theory, Linear Algebra for Control Theory, Math. Appl, vol.62, 1994.

G. T. Wilson, Factorization of the Covariance Generating Function of a Pure Moving Average Process, SIAM Journal on Numerical Analysis, vol.6, issue.1, pp.1-7, 1969.
DOI : 10.1137/0706001