W. Baur and V. Strassen, The complexity of partial derivatives, Theoretical Computer Science, vol.22, issue.3, pp.317-320, 1983.
DOI : 10.1016/0304-3975(83)90110-X

D. J. Bernstein, Removing redundancy in high-precision Newton iteration, 2000.

A. Bostan, P. Flajolet, B. Salvy, and . Schost, Fast computation of special resultants, Journal of Symbolic Computation, vol.41, issue.1, pp.1-29, 2006.
DOI : 10.1016/j.jsc.2005.07.001
URL : https://hal.archives-ouvertes.fr/inria-00000960

A. Bostan and . Schost, Polynomial evaluation and interpolation on special sets of points, Journal of Complexity, vol.21, issue.4, pp.420-446, 2005.
DOI : 10.1016/j.jco.2004.09.009

R. P. Brent, MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION, Analytic computational complexity Proceedings of a Symposium, pp.151-176, 1975.
DOI : 10.1016/B978-0-12-697560-4.50014-9

R. P. Brent and H. T. Kung, Fast algorithms for composition and reversion of multivariate power series, Proceedings of the Conference on Theoretical Computer Science, pp.149-158, 1977.

R. P. Brent and H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, pp.581-595, 1978.
DOI : 10.1145/322092.322099
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5030

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory, of Grundlehren Math. Wiss, 1997.
DOI : 10.1007/978-3-662-03338-8

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.570

E. A. Coddington, An introduction to ordinary differential equations, N.J, 1961.

E. P. Fulmer, Computation of the Matrix Exponential, The American Mathematical Monthly, vol.82, issue.2, pp.156-159, 1975.
DOI : 10.2307/2319662

J. Zur-gathen and J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.40-47, 1997.
DOI : 10.1145/258726.258745

J. Zur-gathen and J. Gerhard, Modern computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

K. O. Geddes, Convergence behavior of the Newton iteration for first order differential equations, EUROSAM '79: Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, pp.189-199, 1979.

C. Q. Gu, A new Padé approximation algorithm for matrix exponentials, Acta Automat. Sinica, vol.25, issue.1, pp.94-99, 1999.

C. Q. Gu, Continued fraction algorithm for matrix exponentials, Journal of Shanghai University (English Edition), vol.16, issue.1, pp.11-14, 2001.
DOI : 10.1007/s11741-001-0019-3

G. Hanrot and P. Zimmermann, Newton iteration revisited, 2002.

E. L. Ince, Ordinary Differential Equations, The Mathematical Gazette, vol.18, issue.231, 1956.
DOI : 10.2307/3605524

R. B. Kirchner and D. E. Knuth, An explicit formula for e At The analysis of algorithms, Actes du Congrès International des Mathématiciens, pp.741200-1204, 1967.

H. T. Kung and J. F. Traub, All Algebraic Functions Can Be Computed Fast, Journal of the ACM, vol.25, issue.2, pp.245-260, 1978.
DOI : 10.1145/322063.322068

I. E. Leonard, The Matrix Exponential, SIAM Review, vol.38, issue.3, pp.507-512, 1996.
DOI : 10.1137/S0036144595286488

E. Liz, Classroom Note:A Note on the Matrix Exponential, SIAM Review, vol.40, issue.3, pp.700-702, 1998.
DOI : 10.1137/S0036144596320752

U. Luther and K. Rost, Matrix exponentials and inversion of confluent Vandermonde matrices, Electron. Trans. Numer. Anal, vol.18, pp.91-100, 2004.

R. T. Moenck and J. H. Carter, Approximate algorithms to derive exact solutions to systems of linear equations, Symbolic and algebraic computation (EUROSAM '79, Internat. Sympos., Marseille), pp.65-73, 1979.
DOI : 10.1007/3-540-09519-5_60

C. Moler and C. Van-loan, Nineteen Dubious Ways to Compute the Exponential of a Matrix, SIAM Review, vol.20, issue.4, pp.801-836, 1978.
DOI : 10.1137/1020098

C. Moler and C. Van-loan, Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later, SIAM Review, vol.45, issue.1, pp.3-49, 2003.
DOI : 10.1137/S00361445024180

W. O. Pennell, A New Method for Determining a Series Solution of Linear Differential Equations with Constant or Variable Coefficients, The American Mathematical Monthly, vol.33, issue.6, pp.293-307, 1926.
DOI : 10.2307/2300196

E. J. Putzer, Avoiding the Jordan Canonical Form in the Discussion of Linear Systems with Constant Coefficients, The American Mathematical Monthly, vol.73, issue.1, pp.2-7, 1966.
DOI : 10.2307/2313914

A. Schönhage, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, vol.1, issue.2, pp.139-144, 1971.
DOI : 10.1007/BF00289520

A. Schönhage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

G. Schulz, Iterative Berechung der reziproken Matrix, ZAMM - Zeitschrift f??r Angewandte Mathematik und Mechanik, vol.9, issue.1, pp.57-59, 1933.
DOI : 10.1002/zamm.19330130111

A. Storjohann, High-order lifting, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.246-254, 2002.
DOI : 10.1145/780506.780538

V. Strassen, The Computational Complexity of Continued Fractions, SIAM Journal on Computing, vol.12, issue.1, pp.1-27, 1983.
DOI : 10.1137/0212001

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562