Evaluating Polynomials at Fixed Sets of Points, SIAM Journal on Computing, vol.4, issue.4, pp.533-539, 1975. ,
DOI : 10.1137/0204045
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
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. ,
Stability of Methods for Solving Toeplitz Systems of Equations, SIAM Journal on Scientific and Statistical Computing, vol.6, issue.2, pp.349-364, 1985. ,
DOI : 10.1137/0906025
A Fast Adaptive Multipole Algorithm for Particle Simulations, SIAM Journal on Scientific and Statistical Computing, vol.9, issue.4, pp.669-686, 1988. ,
DOI : 10.1137/0909044
String-matching and other products, Complexity of Computation, vol.7, pp.113-125, 1974. ,
A Fast Algorithm for Trummer???s Problem, SIAM Journal on Scientific and Statistical Computing, vol.8, issue.1, pp.135-138, 1987. ,
DOI : 10.1137/0908017
A fast algorithm for particle simulations, Journal of Computational Physics, vol.73, issue.2, pp.325-348, 1987. ,
DOI : 10.1016/0021-9991(87)90140-9
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. ,
Mathematics for Computer Algebra, 1991. ,
DOI : 10.1007/978-1-4613-9171-5
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
Structured Matrices and Polynomials: Unified Superfast Algorithms, 2001. ,
DOI : 10.1007/978-1-4612-0129-8
Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions, Computer Science -Theory and Applications Lecture Notes in Computer Science, vol.8476, pp.287-299, 2014. ,
DOI : 10.1007/978-3-319-06686-8_22
Fast Approximate Computations with Cauchy Matrices and Polynomials. arXiv preprint, 2015. ,
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
Computational Geometry. Texts and monographs in computer science, 1985. ,
A fast numerical algorithm for the composition of power series with complex coefficients, Theoretical Computer Science, vol.44, pp.1-16, 1986. ,
DOI : 10.1016/0304-3975(86)90107-6
Complex interval arithmetic, Communications of the ACM, vol.14, issue.2, pp.111-112, 1971. ,
DOI : 10.1145/362515.362563
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. ,
Equation solving in terms of computational complexity, Proc of the International Congress of Mathematicians, pp.131-153, 1986. ,
Univariate real root isolation in an extension field, Proc. 36th ACM Int'l Symp. on Symbolic & Algebraic Comp. (ISSAC), pp.321-328, 2011. ,
Univariate real root isolation in presence of logarithms, INRIA TR, 2014. ,
Fast composition of numeric power series, 2008. ,
Fundamental Problems of Algorithmic Algebra, 2000. ,