C. R. Adams, On the irregular cases of the linear ordinary difference equation. Transactions of the, pp.507-541, 1928.

W. Balser and T. Bothner, Computation of formal solutions of systems of linear difference equations Advances in Dynamical Systems and Applications, pp.29-47, 2010.

A. Benoit, Algorithmique semi-numérique rapide des séries de Tchebychev, Thèse de doctorat, ´ Ecole polytechnique, 2012.

A. Benoit and B. Salvy, Chebyshev expansions for solutions of linear differential equations, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.23-30, 2009.
DOI : 10.1145/1576702.1576709

URL : https://hal.archives-ouvertes.fr/inria-00395716

W. G. Bickley, L. J. Comrie, J. C. Miller, D. H. Sadler, and A. J. Thompson, Bessel functions . Part II. Functions of positive integer order, volume X of Mathematical Tables, British Association for the Advancement of Science, 1952.

G. D. Birkhoff, Formal theory of irregular linear difference equations, Acta Mathematica, vol.54, issue.0, 1930.
DOI : 10.1007/BF02547522

G. D. Birkhoff and W. J. Trjitzinsky, Analytic theory of singular difference equations, Acta Mathematica, vol.60, issue.0, pp.1-89, 1933.
DOI : 10.1007/BF02398269

A. Bostan, B. Salvy, and . Schost, Power series composition and change of basis, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.269-276, 2008.
DOI : 10.1145/1390768.1390806

URL : https://hal.archives-ouvertes.fr/inria-00273385

R. P. Brent and P. Zimmermann, Modern Computer Arithmetic, 2010.
DOI : 10.1017/CBO9780511921698

URL : https://hal.archives-ouvertes.fr/cel-01500109

N. Brisebarre and M. Joldes, Chebyshev interpolation polynomial-based tools for rigorous computing, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.147-154, 2010.
DOI : 10.1145/1837934.1837966

URL : https://hal.archives-ouvertes.fr/ensl-00472509

M. Bronstein and B. Salvy, Full partial fraction decomposition of rational functions, Proceedings of the 1993 international symposium on Symbolic and algebraic computation , ISSAC '93, pp.157-160, 1993.
DOI : 10.1145/164081.164114

E. W. Cheney, Introduction to approximation theory, 1998.

S. Chevillard, J. Harrison, M. Joldes, and C. Lauter, Efficient and accurate computation of upper bounds of approximation errors, Theoretical Computer Science, vol.412, issue.16, pp.1523-1543, 2011.
DOI : 10.1016/j.tcs.2010.11.052

URL : https://hal.archives-ouvertes.fr/ensl-00445343

S. Chevillard, M. Jolde¸sjolde¸s, and C. Lauter, Sollya: An Environment for the Development of Numerical Codes, Mathematical Software -ICMS 2010, pp.28-31, 2010.
DOI : 10.1007/978-3-642-15582-6_5

URL : https://hal.archives-ouvertes.fr/hal-00761644

C. W. Clenshaw, A note on the summation of Chebyshev series, Mathematics of Computation, vol.9, issue.51, pp.118-120, 1955.
DOI : 10.1090/S0025-5718-1955-0071856-0

C. W. Clenshaw, The numerical solution of linear differential equations in Chebyshev series, Proceedings of the Cambridge Philosophical Society, pp.134-149, 1957.
DOI : 10.1017/S0305004100032072

T. A. Driscoll, F. Bornemann, and L. N. Trefethen, The chebop system for automatic solution of differential equations, BIT Numerical Mathematics, vol.1, issue.4, pp.701-723, 2008.
DOI : 10.1007/s10543-008-0198-4

T. H. Einwohner and R. J. Fateman, A MACSYMA package for the generation and manipulation of chebyshev series, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation , ISSAC '89, pp.180-185, 1989.
DOI : 10.1145/74540.74562

M. K. El-daou, E. L. Ortiz, and H. Samara, A unified approach to the Tau Method and Chebyshev series expansion techniques, Computers & Mathematics with Applications, vol.25, issue.3, pp.73-82, 1993.
DOI : 10.1016/0898-1221(93)90145-L

C. Epstein, W. L. Miranker, and T. J. Rivlin, Ultra-arithmetic I: Function data types, Mathematics and Computers in Simulation, vol.24, issue.1, pp.1-18, 1982.
DOI : 10.1016/0378-4754(82)90045-3

C. Epstein, W. L. Miranker, and T. J. Rivlin, Ultra-arithmetic II: intervals of polynomials, Mathematics and Computers in Simulation, vol.24, issue.1, pp.19-29, 1982.
DOI : 10.1016/0378-4754(82)90046-5

L. Fox, Chebyshev Methods for Ordinary Differential Equations, The Computer Journal, vol.4, issue.4, p.318, 1962.
DOI : 10.1093/comjnl/4.4.318

L. Fox and I. B. Parker, Chebyshev polynomials in numerical analysis, 1968.

K. O. Geddes, Symbolic computation of recurrence equations for the Chebyshev series solution of linear ODE's, Proceedings of the 1977 MACSYMA User's Conference, pp.405-423, 1977.

X. Gourdon and B. Salvy, Effective asymptotics of linear recurrences with rational coefficients, Discrete Mathematics, vol.153, issue.1-3, pp.145-163, 1996.
DOI : 10.1016/0012-365X(95)00133-H

G. K. Immink, Reduction to Canonical Forms and the Stokes Phenomenon in the Theory of Linear Difference Equations, SIAM Journal on Mathematical Analysis, vol.22, issue.1, pp.238-259, 1991.
DOI : 10.1137/0522014

G. K. Immink, On the Relation between Global Properties of Linear Difference and Differential Equations with Polynomial Coefficients, II, Journal of Differential Equations, vol.128, issue.1, pp.168-205, 1996.
DOI : 10.1006/jdeq.1996.0093

M. Joldes, Rigorous polynomial approximations and applications, Thèse de doctorat, ´ Ecole normale supérieure de Lyon, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00657843

E. W. Kaucher and W. L. Miranker, Self-validating numerics for function space problems, 1984.

E. W. Kaucher and W. L. Miranker, Validating computation in a function space In Reliability in computing: the role of interval methods in scientific computing, pp.403-425, 1988.

M. Kauers, The holonomic toolkit Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, Texts and Monographs in Symbolic Computation, 2013.

C. Lanczos, Trigonometric Interpolation of Empirical and Analytical Functions, Journal of Mathematics and Physics, vol.XX, issue.1-4, pp.123-199, 1938.
DOI : 10.1002/sapm1938171123

S. Lewanowicz, Construction of a recurrence relation of the lowest order for coefficients of the Gegenbauer series, Zastosowania Matematyki, XV, issue.3, pp.345-395, 1976.

S. Lewanowicz, A new approach to the problem of constructing recurrence relations for the Jacobi coefficients, Zastosowania Matematyki, vol.21, pp.303-326, 1991.

K. Makino and M. Berz, Taylor models and other validated functional inclusion methods, International Journal of Pure and Applied Mathematics, vol.4, issue.4, pp.379-456, 2003.

J. C. Mason and D. C. Handscomb, Chebyshev polynomials, 2003.
DOI : 10.1201/9781420036114

R. J. Mathar, Chebyshev series expansion of inverse polynomials, Journal of Computational and Applied Mathematics, vol.196, issue.2, pp.596-607, 2006.
DOI : 10.1016/j.cam.2005.10.013

M. Mezzarobba, Autour de l'´ evaluation numérique des fonctions D-finies, Thèse de doctorat, ´ Ecole polytechnique, 2011.

L. M. Milne-thomson, The calculus of finite differences, 1933.

R. E. Moore, Methods and applications of interval analysis, Society for Industrial and Applied Mathematics, 1979.
DOI : 10.1137/1.9781611970906

A. Neumaier, Taylor forms ? Use and limits, Reliable Computing, vol.9, issue.1, pp.43-79, 2003.
DOI : 10.1023/A:1023061927787

S. Olver and A. Townsend, A Fast and Well-Conditioned Spectral Method, SIAM Review, vol.55, issue.3, pp.462-489, 2013.
DOI : 10.1137/120865458

V. Y. Pan, Optimal and nearly optimal algorithms for approximating polynomial zeros, Computers & Mathematics with Applications, vol.31, issue.12, pp.3197-138, 1996.
DOI : 10.1016/0898-1221(96)00080-6

V. Y. Pan, New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set, Computers & Mathematics with Applications, vol.35, issue.3, pp.125-129, 1998.
DOI : 10.1016/S0898-1221(97)00283-6

S. Paszkowski, Zastosowania numeryczne wielomianow i szeregow Czebyszewa. Podstawowe Algorytmy Numeryczne, 1975.

H. Poincaré, Sur les Equations Lineaires aux Differentielles Ordinaires et aux Differences Finies, American Journal of Mathematics, vol.7, issue.3, pp.203-258
DOI : 10.2307/2369270

L. Rebillard, Etude théorique et algorithmique des séries de Chebyshev solutions d'´ equations différentielles holonomes, Thèse de doctorat, 1998.

T. J. Rivlin, The Chebyshev polynomials, 1974.

B. Salvy, D-finiteness, Proceedings of the 2005 international symposium on Symbolic and algebraic computation , ISSAC '05, pp.2-3, 2005.
DOI : 10.1145/1073884.1073886

F. W. Schäfke, L???sungstypen von Differenzengleichungen und Summengleichungen in normierten abelschen Gruppen, Mathematische Zeitschrift, vol.16, issue.no. 3, pp.61-104, 1965.
DOI : 10.1007/BF01112693

R. P. Stanley, Differentiably Finite Power Series, European Journal of Combinatorics, vol.1, issue.2, pp.175-188, 1980.
DOI : 10.1016/S0195-6698(80)80051-5

L. N. Trefethen, Computing numerically with functions instead of numbers, Communications of the ACM, vol.58, issue.10, pp.9-19, 2007.
DOI : 10.1145/2814847

L. N. Trefethen, Approximation theory and approximation practice, SIAM, 2013.

W. Tucker, Validated Numerics: A Short Introduction to Rigorous Computations, 2011.

H. L. Turrittin, The formal theory of systems of irregular homogeneous linear difference and differential equations, pp.255-264, 1960.

M. Van-der-put and M. F. Singer, Galois theory of difference equations, Lecture Notes in Mathematics, vol.1666, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00635918

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

J. Wimp, On recursive computation, 1969.

J. Wimp, Computation with Recurrence Relations, 1984.

R. V. Zahar, A mathematical analysis of Miller's algorithm, Numerische Mathematik, vol.26, issue.4, pp.427-447, 1976.
DOI : 10.1007/BF01399606

D. Zeilberger, A holonomic systems approach to special functions identities, Journal of Computational and Applied Mathematics, vol.32, issue.3, pp.321-368, 1990.
DOI : 10.1016/0377-0427(90)90042-X

A. Benoit, ´ Education nationale; France E-mail address: alexandrebenoit@yahoo.fr URL

M. Joldes, ;. Cnrs, and . Laas, Cedex 4, France E-mail address: joldes@laas.fr URL, Avenue du Colonel Roche, 31077 Toulouse