G. Alefeld and J. Herzberger, Introduction to Interval Analysis, 1983.

B. [. Bitmead and . Anderson, Asymptotically fast solution of toeplitz and related systems of linear equations, Linear Algebra and its Applications, vol.34, pp.103116-73, 1980.
DOI : 10.1016/0024-3795(80)90161-5

I. Babuska, Numerical stability in mathematical analysis, Proceedings of the 1968 IFIP Congress, p.1123, 1969.

C. [. Bürgisser, M. A. Clausen, and . Shokrollahi, Algebraic Complexity Theory
DOI : 10.1007/978-3-662-03338-8

R. James, J. E. Bunch, and . Hopcroft, Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, vol.2811, p.231236, 1974.

A. Bostan, C. Jeannerod, C. Mouilleron, and É. Schost, Fast simultaneous multiplication of a structured matrix by vectors, 2011. Draft, available upon request, p.68

A. Bostan, C. Jeannerod, and É. Schost, Solving Toeplitzand Vandermonde-like linear systems with large displacement rank, IS- SAC'07, pp.3340-53, 2007.

A. Bostan, C. Jeannerod, and É. Schost, Solving structured linear systems with large displacement rank, Theoretical Computer Science, vol.407, issue.13, pp.155181-66, 2008.

D. [. Brent, K. Kuck, and . Maruyama, The parallel evaluation of arithmetic expressions without division. Computers, IEEE Transactions, vol.81, issue.5, pp.22532-534, 1973.

A. Bostan, G. Lecerf, and É. Schost, Tellegen's principle into practice, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, p.3744, 2003.
DOI : 10.1145/860854.860870

M. Bodrato, A Strassen-like matrix multiplication suited for squaring and higher power computation, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, p.280, 2010.
DOI : 10.1145/1837934.1837987
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.6333

S. Boldo and É. Lyon, Preuves formelles en arithmétiques à virgule ottante, 2004.

A. Borodin, Horner's rule is uniquely optimal. Theory of machines and computations, p.4558, 1971.
DOI : 10.1016/b978-0-12-417750-5.50008-7

A. Bostan, Algorithmes rapides pour les polyn??mes, s??ries formelles et matrices, Les cours du CIRM, vol.1, issue.2, pp.75262-62, 2010.
DOI : 10.5802/ccirm.9

R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM, vol.21, issue.2
DOI : 10.1145/321812.321815

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

R. Brent and P. Zimmermann, Modern Computer Arithmetic Version 0.2.1, 2009.

J. Cardinal, On a property of Cauchy-like matrices. C. R. Acad. Sci. Paris -Série I -Analyse numérique/Numerical Analysis, pp.10891093-10891124, 1999.

J. Cardinal, A divide and conquer method to solve Cauchy-like systems The FRISCO Consortium, pp.31-33, 2000.

S. Chevillard, Évaluation ecace de fonctions numériques -Outils et exemples, 2009.

E. [. Cantor and . Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, p.693701, 1991.
DOI : 10.1007/BF01178683

M. Ceberio and V. Kreinovich, Greedy algorithms for optimizing multivariate Horner schemes, ACM SIGSAM Bulletin, vol.38, issue.1, p.815, 2004.
DOI : 10.1145/980175.980179
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.7430

. Cheung, Automating custom-precision function evaluation for embedded processors, Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems , CASES '05, p.31, 2005.
DOI : 10.1145/1086297.1086302

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2009.

S. [. Coppersmith and . Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, p.16, 1987.
DOI : 10.1145/28395.28396
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

J. Peter, B. L. Downey, R. Leong, and . Sethi, Computing sequences with addition chains, SIAM Journal on Computing, vol.149, p.638646, 1981.

M. H. Ivor and . Etherington, Non-associate powers and a functional equation

J. Eve, The evaluation of polynomials, Numerische Mathematik, vol.8, issue.1, pp.17-21, 1964.
DOI : 10.1007/BF01386049

J. A. Fisher, P. Faraboschi, and C. Young, Embedded Computing: A VLIW Approach to Architecture, Compilers and Tools, 2005.

R. Steven and . Finch, Mathematical Constants, 1994.

[. Franchetti, F. Mesmay, D. Mcfarlin, and M. Püschel, Operator Language: A Program Generation Framework for Fast Kernels, Proceedings of the IFIP TC 2 Working Conference on Domain-Specic Languages , DSL '09, p.385409, 2009.
DOI : 10.1109/TIT.1967.1054010

P. Flajolet and R. Sedgewick, Analytic Combinatorics. Princeton University, pp.126-127, 2009.
DOI : 10.1017/cbo9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

[. Giesbrecht, Nearly Optimal Algorithms for Canonical Matrix Forms, SIAM Journal on Computing, vol.24, issue.5, 1995.
DOI : 10.1137/S0097539793252687

[. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, p.135142
DOI : 10.1145/860854.860889

T. [. Gohberg, V. Kailath, and . Olshevsky, Fast Gaussian elimination with partial pivoting for matrices with displacement structure, Mathematics of Computation, vol.64, issue.212, p.15571576, 1995.
DOI : 10.1090/S0025-5718-1995-1312096-X

]. I. Go94a, V. Gohberg, and . Olshevsky, Complexity of multiplication with vectors for structured matrices, Linear Algebra Appl, vol.202, p.163192, 1994.

]. I. Go94b, V. Gohberg, and . Olshevsky, Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems. Integral Equations and Operator Theory, pp.4483-4510, 1994.

R. Green, Faster Math Functions, Tutorial at Game Developers Conference, 2002.

N. J. Higham, Accuracy and Stability of Numerical Algorithms, Society for Industrial and Applied Mathematics, vol.81, issue.109, p.176, 2002.
DOI : 10.1137/1.9780898718027

N. J. Higham, Functions of Matrices: Theory and Computation, Society for Industrial and Applied Mathematics, vol.5, issue.174, pp.175-180, 2008.
DOI : 10.1137/1.9780898717778

J. Harrison, T. Kubaska, S. Story, and P. Tang, The computation of transcendental functions on the IA-64 architecture, Intel Technology Journal, vol.81, p.17, 1999.

G. Heinig and K. Rost, Algebraic methods for Toeplitz-like matrices and operators, 1984.
DOI : 10.1007/978-3-0348-6241-7

S. [. Ibarra, R. Moran, and . Hui, A generalization of the fast LUP matrix decomposition algorithm and applications, Journal of Algorithms, vol.3, issue.1, p.4556, 1982.
DOI : 10.1016/0196-6774(82)90007-4

[. Jeannerod, J. Jourdan-lu, C. Monat, and G. Revy, How to square oats accurately and eciently on the ST231 integer processor, Proc. of the 20th IEEE Symposium on Computer Arithmetic (ARITH'20), p.7781, 2011.

C. Jeannerod, H. Knochel, C. Monat, and G. Revy, Computing oating-point square roots via bivariate polynomial evaluation, LIP, vol.122, p.161, 2008.
DOI : 10.1109/tc.2010.152

C. Jeannerod, H. Knochel, C. Monat, and G. Revy, Computing oating-point square roots via bivariate polynomial evaluation, IEEE Transactions on Computers, vol.6084, p.214227, 2011.

[. Jeannerod and C. Mouilleron, Computing specied generators of structured matrix inverses, 2010.

C. Jeannerod and C. Mouilleron, Computing specied generators of structured matrix inverses, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, p.28128831, 2010.

W. Kahan, Pracniques: further remarks on reducing truncation errors, Communications of the ACM, vol.8, issue.1
DOI : 10.1145/363707.363723

[. Kaltofen, Asymptotically fast solution of Toeplitz-like singular linear systems, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.297304-297352, 1994.
DOI : 10.1145/190347.190431

[. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Mathematics of Computation, vol.6425, issue.210, p.777806, 1995.

H. Khalil, Matrices structurées et matrices de Toeplitz par blocs de Toeplitz en calcul numérique et formel

S. [. Kailath, M. Kung, and . Morf, Displacement ranks of matrices and linear equations, Journal of Mathematical Analysis and Applications, vol.68, issue.2, pp.395407-395431, 1979.
DOI : 10.1016/0022-247X(79)90124-0

J. David, Y. Kuck, and . Muraoka, Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity, Acta Inf, vol.81, pp.203216-95, 1974.

J. David, K. Kuck, and . Maruyama, Time bounds on the parallel evaluation of arithmetic expressions, 1975.

E. Donald and . Knuth, Evaluation of polynomials by computers, Communications of the ACM, vol.580, issue.94, p.595599, 1962.

E. Donald and . Knuth, Seminumerical Algorithms, volume 2 of The Art of Computer Programming, 1969.

E. Donald and . Knuth, Seminumerical Algorithms, volume 2 of The Art of Computer Programming, pp.114-148, 1998.

J. David and . Kuck, A survey of parallel machine organization and programming

C. Lauter, Arrondi correct de fonctions mathématiques -fonctions univariées et bivariées, certication et automatisation, 2008.

B. [. Labahn, S. Bechermann, and . Cabay, Inversion of mosaic Hankel matrices via matrix polynomial systems, Linear Algebra and its Applications, vol.221, issue.221, p.253280, 1995.
DOI : 10.1016/0024-3795(93)00262-X

P. Langlois, M. Martel, and L. Thévenoux, Accuracy versus time, Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO '10, p.121130, 2010.
DOI : 10.1145/1837210.1837229
URL : https://hal.archives-ouvertes.fr/hal-00477511

[. Lee and J. D. Villasenor, Optimized Custom Precision Function Evaluation for Embedded Processors, IEEE Transactions on Computers, vol.58, issue.1, p.4659, 2009.
DOI : 10.1109/TC.2008.124

M. Martel, Semantics-Based Transformation of Arithmetic Expressions
DOI : 10.1007/978-3-540-74061-2_19

M. Martel, Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics, Journal of Formal Methods in System Design, p.169, 2009.
DOI : 10.1007/s10703-009-0068-y

[. Martel, Program transformation for numerical precision, Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, PEPM '09, 2009.
DOI : 10.1145/1480945.1480960

D. Matula, Higher Radix Squaring Operations Employing Left-to-Right Dual Recoding, 2009 19th IEEE Symposium on Computer Arithmetic, pp.39-47, 2009.
DOI : 10.1109/ARITH.2009.34

J. Muller, N. Brisebarre, C. Florent-de-dinechin, V. Jeannerod, G. Lefèvre et al., Handbook of Floating-Point Arithmetic, Nathalie Revol, vol.1083, p.96, 2010.
DOI : 10.1007/978-0-8176-4705-6
URL : https://hal.archives-ouvertes.fr/ensl-00379167

G. Melquiond and É. Lyon, De l'arithmétique d'intervalles à la certication de programmes, p.166, 2006.

R. E. Moore, Interval Analysis, 1966.

M. Morf, Doubling algorithms for Toeplitz and related equations, ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing, pp.954959-73, 1980.
DOI : 10.1109/ICASSP.1980.1171074

C. Mouilleron and G. Revy, Automatic generation of fast and certied code for polynomial evaluation, Proc. of the 20th IEEE Symposium on Computer Arithmetic (ARITH'20), pp.233242-154, 2011.

T. Mulders, On short multiplications and divisions. Applicable Algebra in Engineering, Communication and Computing, vol.1112, issue.6988 10, 1007.

J. Muller, Elementary Functions, Algorithms and Implementation
URL : https://hal.archives-ouvertes.fr/ensl-00000008

[. Olshevsky and V. Y. Pan, A unied superfast algorithm for boundary rational tangential interpolation problems and for inversion and factorization of dense structured matrices, Proc. 39th IEEE FOCS, 1998.

T. Ogita, S. M. Rump, and S. Oishi, Accurate Sum and Dot Product, SIAM Journal on Scientific Computing, vol.26, issue.6, 2005.
DOI : 10.1137/030601818
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.1547

M. [. Olshevsky and . Shokrollahi, A displacement approach to decoding algebraic codes, Contemporary mathematics: theory and applications, p.265292, 2003.
DOI : 10.1090/conm/323/05709

R. Otter, The Number of Trees, The Annals of Mathematics, vol.49, issue.3, 1948.
DOI : 10.2307/1969046

Y. Victor and . Pan, Methods of Computing Values of Polynomials, Russian Mathematical Surveys, vol.2180, issue.138, p.105136, 1966.

Y. Victor and . Pan, Strassen's algorithm is not optimal: trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations, Foundations of Computer Science 19th Annual Symposium on, pp.166-176, 1978.

Y. Victor and . Pan, On some computations with dense structured matrices, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, ISSAC '89, p.3442, 1989.

Y. Victor and . Pan, Parallel solution of Toeplitz-like linear systems, Journal of Complexity, vol.825, issue.1, p.121, 1992.

Y. Victor and . Pan, Decreasing the displacement rank of a matrix, SIAM J. Matrix Anal. Appl, vol.1425, issue.1, p.118121, 1993.

Y. Victor and . Pan, Nearly optimal computations with structured matrices, SODA'00, pp.953962-52, 2000.

Y. Victor and . Pan, Structured Matrices and Polynomials, Birkhäuser Boston Inc, vol.57, pp.45-56, 2001.

M. Püschel, F. Franchetti, and Y. Voronenko, Encyclopedia of Parallel Computing, chapter Spiral, 2011.

S. Putot, E. Goubault, and M. Martel, Static analysis-based validation of oating-point computations, Novel Approaches to Verication, p.295312, 2004.

C. Pivoteau, Génération aléatoire de structures combinatoires : méthode de Boltzmann eective, 2008.

N. Johnson and . Rizzolo, Spiral: Code generation for dsp transforms, Proceedings of the IEEE, pp.232-275, 2005.

M. S. Paterson and L. J. Stockmeyer, On the number of nonscalar multiplications necessary to evalutate polynomials, SIAM Journal on Computing, vol.25, issue.87, pp.6066-91, 1973.

J. Manuel, P. , and T. Sauer, On the multivariate Horner scheme

C. Pivoteau, B. Salvy, and M. Soria, Boltzmann oracle for combinatorial systems, Algorithms, Trees, Combinatorics and Probabilities Proceedings of the Fifth Colloquium on Mathematics and Computer Science. Blaubeuren, p.475488, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00346845

G. Revy, Analyse et implantation d'algorithmes rapides pour l'évaluation polynomiale sur les nombres ottants. Master's thesis, 2006.

G. Revy, Implementation of binary oating-point arithmetic on embedded integer processors -Polynomial evaluation-based algorithms and certied code generation, pp.123-165, 2009.

N. Revol and F. Rouillier, Motivations for an Arbitrary Precision Interval Arithmetic and the MPFI Library, Reliable Computing, vol.2, issue.3, pp.275-290, 2005.
DOI : 10.1007/s11155-005-6891-y
URL : https://hal.archives-ouvertes.fr/inria-00544998

S. M. Rump, Ultimately Fast Accurate Summation, SIAM Journal on Scientific Computing, vol.31, issue.5, p.34663502, 2009.
DOI : 10.1137/080738490
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1673

R. P. Stanley, Enumerative Combinatorics, 1999.

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, p.354356, 1969.
DOI : 10.1007/BF02165411
URL : http://www.digizeitschriften.de/download/PPN362160546_0013/PPN362160546_0013___log38.pdf

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 69] [vzGS92] J. von zur Gathen and V. Shoup. Computing Frobenius maps and factoring polynomials. Comput. Complexity, p.187224, 1992.
DOI : 10.1017/CBO9781139856065

J. Wedderburn, The functional equation g(x 2 ) = 2?x + [g(x)] 2, The Annals of Mathematics, vol.2480, issue.126, p.121140, 1922.

R. Yates, Fixed-Point Arithmetic: An Introduction. Digital Signal Labs, 2009.