Quadratic interval refinement for real roots, ACM Communications in Computer Algebra, vol.48, issue.1/2 ,
DOI : 10.1145/2644288.2644291
Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol.10, 2006. ,
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587
Simple algorithms for approximating all roots of a polynomial with real roots, Journal of Complexity, vol.6, issue.4, pp.417-442, 1990. ,
DOI : 10.1016/0885-064X(90)90032-9
Parallel complexity of tridiagonal symmetric eigenvalue problem, Proc. 2nd Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), pp.384-393, 1991. ,
Eine praktische Verbesserung der Divide- und Conquer-Algorithmen, Computing, vol.3, issue.2, pp.109-123, 1992. ,
DOI : 10.1007/BF02241709
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real, SIAM Journal on Computing, vol.27, issue.4, pp.1099-1115, 1998. ,
DOI : 10.1137/S0097539790182482
A linear filtering approach to the computation of discrete fourier transform. Audio and Electroacoustics, IEEE Transactions on, vol.18, issue.4, pp.451-455, 1970. ,
Complexity and Real Computation, 1998. ,
DOI : 10.1007/978-1-4612-0701-6
Long Integers and Polynomial Evaluation with Estrin's Scheme, 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.39-46, 2011. ,
DOI : 10.1109/SYNASC.2011.17
On the topology of planar algebraic curves, Proceedings of the 25th annual symposium on Computational geometry, SCG '09, pp.361-370, 2009. ,
DOI : 10.1145/1542362.1542424
URL : https://hal.archives-ouvertes.fr/inria-00329754
A hybrid method for high precision calculation of polynomial real roots, Proceedings of the 1993 international symposium on Symbolic and algebraic computation , ISSAC '93, pp.47-52, 1993. ,
DOI : 10.1145/164081.164090
Cylindrical algebraic decomposition, School of Mathematical Sciences, 1988. ,
On the asymptotic and practical complexity of solving bivariate systems over the reals, Journal of Symbolic Computation, vol.44, issue.7, pp.818-835, 2009. ,
DOI : 10.1016/j.jsc.2008.04.009
Quasi-Laguerre Iteration in Solving Symmetric Tridiagonal Eigenvalue Problems, SIAM Journal on Scientific Computing, vol.17, issue.6, pp.1347-1368, 1996. ,
DOI : 10.1137/S1064827594273225
The quasi-laguerre iteration Mathematics of Computation of the, pp.345-361, 1997. ,
Amortized Bound for Root Isolation via Sturm Sequences, Int. Workshop on Symbolic Numeric Computing, pp.113-129, 2005. ,
DOI : 10.1007/978-3-7643-7984-1_8
Real root isolation for exact and approximate polynomials using Descartes' rule of signs, 2008. ,
On the complexity of solving a bivariate polynomial system, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.154-161, 2012. ,
DOI : 10.1145/2442829.2442854
Random polynomials and expected complexity of bisection methods for real solving, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.235-242, 2010. ,
DOI : 10.1145/1837934.1837980
URL : https://hal.archives-ouvertes.fr/inria-00482722
String-matching and other products, Complexity of Computation, vol.7, pp.113-125, 1974. ,
Faster Integer Multiplication, SIAM Journal on Computing, vol.39, issue.3, pp.979-1005, 2009. ,
DOI : 10.1137/070711761
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic, Proc. CASC, pp.200-214 ,
DOI : 10.1007/978-3-642-23568-9_16
URL : https://hal.archives-ouvertes.fr/hal-00650389
Algorithms for Polynomial Real Root Isolation, 1991. ,
DOI : 10.1007/978-3-7091-9459-1_13
On the Complexity of Reliable Root Approximation, Proc. 11th Int'l Wkshp on Computer Algebra in Scientific Computing (CASC), pp.155-167, 2009. ,
DOI : 10.1016/j.tcs.2008.09.017
Efficient real root approximation, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.209-216, 2011. ,
DOI : 10.1145/1993886.1993920
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.475
A worst-case bound for topology computation of algebraic curves, Journal of Symbolic Computation, vol.47, issue.3, pp.239-258, 2012. ,
DOI : 10.1016/j.jsc.2011.11.001
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
The art of computer programming): seminumerical algorithms, 1997. ,
Fast approximate polynomial multipoint evaluation and applications. arXiv preprint, 2013. ,
On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, Theoretical Computer Science, vol.412, issue.22, pp.2312-2330, 2011. ,
DOI : 10.1016/j.tcs.2011.01.009
URL : https://hal.archives-ouvertes.fr/inria-00530756
Numerical methods for roots of polynomials (II), chapter 15, 2013. ,
From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Journal of Symbolic Computation, vol.66, pp.34-69, 2015. ,
DOI : 10.1016/j.jsc.2014.02.001
Mathematics for Computer Algebra, 1991. ,
DOI : 10.1007/978-1-4613-9171-5
Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.741-750, 1995. ,
DOI : 10.1145/225058.225292
Optimal and nearly optimal algorithms for approximating polynomial zeros, Computers & Mathematics with Applications, vol.31, issue.12, pp.97-138, 1996. ,
DOI : 10.1016/0898-1221(96)00080-6
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
URL : http://doi.org/10.1006/jcom.1999.0532
Structured Matrices and Polynomials: Unified Superfast Algorithms, 2001. ,
DOI : 10.1007/978-1-4612-0129-8
Univariate polynomials, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.701-733, 2002. ,
DOI : 10.1145/384101.384136
Transformations of matrix structures work again, Linear Algebra and its Applications, vol.465, pp.1-32, 2015. ,
DOI : 10.1016/j.laa.2014.09.004
Real polynomial root-finding by means of matrix and polynomial iterations Also at arXiv preprint: arXiv:1501, Proc. 16th International Workshop Computer Algebra in Scientific Computing (CASC), (, pp.335-34905390, 2014. ,
Bisection acceleration for the symmetric tridiagonal eigenvalue problem, Numerical Algorithms, vol.22, issue.1, pp.13-39, 1999. ,
DOI : 10.1023/A:1019146505291
Real rootfinding, Proc. 2nd ACM Int'l Work. Symbolic Numeric Computation (SNC), pp.161-169, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01105309
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
Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract) Also at arXiv preprint: arXiv:1501, Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, pp.132-13405392, 2014. ,
Simple and efficient real root-finding for a univariate polynomial, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01105309
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
On Solving Systems of Bivariate Polynomials, pp.100-104, 2010. ,
DOI : 10.1007/978-3-642-15582-6_21
URL : https://hal.archives-ouvertes.fr/hal-01110516
When Newton meets Descartes, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.297-304, 2012. ,
DOI : 10.1145/2442829.2442872
Computing real roots of real polynomialsan efficient method based on Descartes' rule of signs and newton iteration. arXiv preprint arXiv, pp.1308-4088, 2013. ,
Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coeficients, LNCS, vol.144, pp.3-15, 1982. ,
The fundamental theorem of algebra in terms of computational complexity, Manuscript. Univ. of Tübingen, 1982. ,
Near Optimal Subdivision Algorithms for Real Root Isolation, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '15, 2015. ,
DOI : 10.1145/2755996.2756656
Robust Approximate Zeros, Proc. European Symposium of Algorithms (ESA), pp.874-886, 2005. ,
DOI : 10.1007/11561071_77
Univariate real root isolation in an extension field, Proc. 36th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), pp.321-328, 2011. ,
Fast composition of numeric power series, 2008. ,