F. Acton, Numerical Methods That (usually) Work, revised edn, 1990.

A. Al-mohy and N. Higham, A New Scaling and Squaring Algorithm for the Matrix Exponential, SIAM Journal on Matrix Analysis and Applications, vol.31, issue.3, pp.970-989, 2009.
DOI : 10.1137/09074721X

R. Alexander, Diagonally Implicit Runge???Kutta Methods for Stiff O.D.E.???s, SIAM Journal on Numerical Analysis, vol.14, issue.6, pp.1006-1021, 1977.
DOI : 10.1137/0714068

D. Applegate, R. Bixby, V. Chvátal, and W. Cook, The Traveling Salesman Problem : A Computational Study, 2006.

D. Applegate, R. Bixby, V. Chvátal, W. Cook, D. Espinoza et al., Certification of an optimal TSP tour through 85,900 cities, Operations Research Letters, vol.37, issue.1, pp.11-15, 2009.
DOI : 10.1016/j.orl.2008.09.006

U. Ascher and C. Greif, A First Course in Numerical Methods, SIAM, 2011.
DOI : 10.1137/9780898719987

R. Ashino, M. Nagase, and R. Vaillancourt, Behind and beyond the Matlab ODE suite, Computers & Mathematics with Applications, vol.40, issue.4-5, pp.491-512, 2000.
DOI : 10.1016/S0898-1221(00)00175-9

I. Beichl and F. Sullivan, The Metropolis Algorithm, Computing in Science & Engineering, vol.2, issue.1, pp.65-69, 2000.
DOI : 10.1109/5992.814660

G. Bekey and S. Masri, Random search techniques for optimization of nonlinear systems with many parameters, Mathematics and Computers in Simulation, vol.25, issue.3, pp.210-213, 1983.
DOI : 10.1016/0378-4754(83)90094-0

A. Ben-tal, L. E. Ghaoui, and A. Nemirovski, Robust Optimization, 2009.
DOI : 10.1515/9781400831050

M. Benzi, Preconditioning Techniques for Large Linear Systems: A Survey, Journal of Computational Physics, vol.182, issue.2, pp.418-477, 2002.
DOI : 10.1006/jcph.2002.7176

J. P. Berrut and L. Trefethen, Barycentric Lagrange Interpolation, SIAM Review, vol.46, issue.3, pp.501-517, 2004.
DOI : 10.1137/S0036144502417715

D. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Athena Scientific, 1996.

D. Bertsekas, Nonlinear Programming, Athena Scientific, 1999.

D. Bertsimas, D. Brown, and C. Caramanis, Theory and Applications of Robust Optimization, SIAM Review, vol.53, issue.3, pp.464-501, 2011.
DOI : 10.1137/080734510

M. Bertz and K. Makino, Verified integration of ODEs and flows using differential algebraic methods on high-order Taylor models, Reliable Computing, vol.4, issue.4, pp.361-369, 1998.
DOI : 10.1023/A:1024467732637

M. Bhatti and P. Bracken, Solutions of differential equations in a Bernstein polynomial basis, Journal of Computational and Applied Mathematics, vol.205, issue.1, pp.272-280, 2007.
DOI : 10.1016/j.cam.2006.05.002

A. Björck, Numerical Methods for Least Squares Problems, SIAM, 1996.
DOI : 10.1137/1.9781611971484

P. Bogacki and L. Shampine, A 3(2) pair of Runge - Kutta formulas, Applied Mathematics Letters, vol.2, issue.4, pp.321-325, 1989.
DOI : 10.1016/0893-9659(89)90079-7

P. Boggs and J. Tolle, Sequential Quadratic Programming, Acta Numerica, vol.1991, pp.1-51, 1995.
DOI : 10.1007/BF01580366

P. Boggs and J. Tolle, Sequential quadratic programming for large-scale nonlinear optimization, Journal of Computational and Applied Mathematics, vol.124, issue.1-2, pp.123-137, 2000.
DOI : 10.1016/S0377-0427(00)00429-5

J. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. Sagastizabal, Numerical Optimization ? Theoretical and Practical Aspects, 2006.

C. De-boor, Package for Calculating with B-Splines, SIAM Journal on Numerical Analysis, vol.14, issue.3, pp.441-472, 1977.
DOI : 10.1137/0714026

C. De-boor, A Practical Guide to Splines, revised edn, p.410, 2001.

L. De-boor, C. Swartz, and B. , Comments on: ??????A comparison of global methods for linear two-point boundary value problems??? (Math. Comp. {\bf 29} (1975), no. 132, 1007???1019) by R. D. Russell and J. M. Varah, Mathematics of Computation, vol.31, issue.140, pp.916-921, 1977.
DOI : 10.1090/S0025-5718-1977-0501939-4

J. Borrie, Stochastic Systems for Engineers, 1992.

F. Boulier, M. Lefranc, F. Lemaire, and P. E. Morant, Model Reduction of Chemical Reaction Systems using Elimination, Mathematics in Computer Science, vol.45, issue.10, pp.289-301, 2011.
DOI : 10.1007/s11786-011-0093-2
URL : https://hal.archives-ouvertes.fr/hal-00184558

S. Boyd and L. Vandenberghe, Convex Optimization, 2004.

R. Brent, Algorithms for Minimization Without Derivatives, 1973.

R. Bronson, Operations Research. Schaum's Outline Series, 1982.

C. Broyden, A class of methods for solving nonlinear simultaneous equations, Mathematics of Computation, vol.19, issue.92, pp.577-593, 1965.
DOI : 10.1090/S0025-5718-1965-0198670-6

C. Broyden, Quasi-Newton methods and their application to function minimisation, Mathematics of Computation, vol.21, issue.99, pp.368-381, 1967.
DOI : 10.1090/S0025-5718-1967-0224273-2

K. Bryan and T. Leise, The $25,000,000,000 Eigenvector: The Linear Algebra behind Google, SIAM Review, vol.48, issue.3, pp.569-581, 2006.
DOI : 10.1137/050623280

J. Butcher, Implicit Runge-Kutta processes, Mathematics of Computation, vol.18, issue.85, pp.50-64, 1964.
DOI : 10.1090/S0025-5718-1964-0159424-9

J. Butcher and G. Wanner, Runge-Kutta methods: some historical notes, Applied Numerical Mathematics, vol.22, issue.1-3, pp.113-151, 1996.
DOI : 10.1016/S0168-9274(96)00048-7

R. Byrd, M. Hribar, and J. Nocedal, An Interior Point Algorithm for Large-Scale Nonlinear Programming, SIAM Journal on Optimization, vol.9, issue.4, pp.877-900, 1999.
DOI : 10.1137/S1052623497325107

T. Chandrupatla and A. Belegundu, Introduction to Finite Elements in Engineering, NJ, 2002.

J. M. Chesneaux, Etude théorique et implémentation en ADA de la méthode CESTAC, 1988.

J. M. Chesneaux, Study of the computing accuracy by using probabilistic approach Contribution to Computer Arithmetic and Self-Validating Methods, pp. 19? 30, J.C. Baltzer AG, 1990.

J. M. Chesneaux, L'arithmétique stochastique et le logiciel CADNA. HabilitationàHabilitation`Habilitationà diriger des recherches, 1995.

P. Ciarlet, Introduction to Numerical Linear Algebra and Optimization, 1989.

Y. Collette and P. Siarry, Multiobjective Optimization, 2003.
DOI : 10.1007/978-3-662-08883-8

A. Conn, N. Gould, and P. Toint, A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds, SIAM Journal on Numerical Analysis, vol.28, issue.2, pp.545-572, 1991.
DOI : 10.1137/0728030

A. Conn, N. Gould, P. Toint, . J. Ibm-t, . Watson-research et al., A globally convergent augmented Lagrangian barrier algorithm for optimization with general constraints and simple bounds, 1995.

N. Cressie, Statistics for Spatial Data, 1993.

G. Dahlquist, A special stability problem for linear multistep methods, BIT, vol.3, issue.1, pp.27-43, 1963.
DOI : 10.1007/BF01963532

J. Demmel, The probability that a numerical analysis problem is difficult, Mathematics of Computation, vol.50, issue.182, pp.449-480, 1988.
DOI : 10.1090/S0025-5718-1988-0929546-7

J. Demmel, Applied Numerical Linear Algebra, SIAM, 1997.
DOI : 10.1137/1.9781611971446

J. Demmel and W. Kahan, Accurate Singular Values of Bidiagonal Matrices, SIAM Journal on Scientific and Statistical Computing, vol.11, issue.5, pp.873-912, 1990.
DOI : 10.1137/0911052

J. Dennis, J. Moré, and J. , Quasi-Newton Methods, Motivation and Theory, SIAM Review, vol.19, issue.1, pp.46-89, 1977.
DOI : 10.1137/1019005
URL : https://hal.archives-ouvertes.fr/hal-01495720

O. Didrit, M. Petitot, and E. Walter, Guaranteed solution of direct kinematic problems for general configurations of parallel manipulators, IEEE Transactions on Robotics and Automation, vol.14, issue.2, pp.259-266, 1998.
DOI : 10.1109/70.681244

P. Diez, A note on the convergence of the secant method for simple and multiple roots, Applied Mathematics Letters, vol.16, issue.8, pp.1211-1215, 2003.
DOI : 10.1016/S0893-9659(03)90119-4

L. Dixon, Quasi Newton techniques generate identical points II: The proofs of four new theorems, Mathematical Programming, vol.24, issue.3, pp.345-358, 1972.
DOI : 10.1007/BF01585007

J. Dongarra and F. Sullivan, Guest Editors Introduction to the top 10 algorithms, Computing in Science & Engineering, vol.2, issue.1, pp.22-23, 2000.
DOI : 10.1109/MCISE.2000.814652

P. Dorato, C. Abdallah, and V. Cerone, Linear-Quadratic Control, An Introduction, 1995.

M. Dorigo and T. Stützle, Ant Colony Optimization, 2004.

J. Dormand and P. Prince, A family of embedded Runge-Kutta formulae, Journal of Computational and Applied Mathematics, vol.6, issue.1, pp.19-26, 1980.
DOI : 10.1016/0771-050X(80)90013-3

J. Dormand and P. Prince, A reconsideration of some embedded Runge???Kutta formulae, Journal of Computational and Applied Mathematics, vol.15, issue.2, pp.203-211, 1986.
DOI : 10.1016/0377-0427(86)90027-0

S. Droste, T. Jansen, and I. Wegener, Perhaps not a free lunch but at least a free appetizer, Proc. 1st Genetic and Evolutionary Computation Conf, pp.833-839, 1999.

P. Duchêne and P. Rouchon, Kinetic sheme reduction, attractive invariant manifold and slow/fast dynamical systems, Chem. Eng. Science, vol.53, pp.4661-4672, 1996.

R. Farouki, The Bernstein polynomial basis: A centennial retrospective, Computer Aided Geometric Design, vol.29, issue.6, pp.379-419, 2012.
DOI : 10.1016/j.cagd.2012.03.001

C. Floudas and P. Pardalos, Encyclopedia of Optimization, second edn, 2009.

A. Fortin, Numerical Analysis for Engineers, Ecole Polytechnique de Montréal, 2009.

. Galassi, GNU Scientific Library Reference Manual, third edn, NetworkTheory Ltd, 2009.

M. Gander and G. Wanner, From Euler, Ritz, and Galerkin to Modern Computing, SIAM Review, vol.54, issue.4, pp.627-666, 2012.
DOI : 10.1137/100804036

W. Gander and W. Gautschi, Adaptive quadrature -revisited, Bit Numerical Mathematics, vol.40, issue.1, pp.84-101, 2000.
DOI : 10.1023/A:1022318402393

C. Gear, Numerical Initial Value Problems in Ordinary Differential Equations, 1971.

E. Gertz, A quasi-Newton trust-region method, Mathematical Programming, vol.100, issue.3, pp.447-470, 2004.

J. Gilbert, C. Moler, and R. Schreiber, Sparse Matrices in MATLAB: Design and Implementation, SIAM Journal on Matrix Analysis and Applications, vol.13, issue.1, pp.333-356, 1992.
DOI : 10.1137/0613024

J. Gilbert, G. L. Vey, and J. Masse, La différentiation automatique de fonctions représentées par des programmes, p.INRIA, 1991.

P. Gill, W. Murray, M. Saunders, J. Tomlin, and M. Wright, On projected newton barrier methods for linear programming and an equivalence to Karmarkar???s projective method, Mathematical Programming, vol.4, issue.2, pp.183-209, 1986.
DOI : 10.1007/BF02592025

I. Gladwell, L. Shampine, and R. Brankin, Locating special events when solving ODEs, Applied Mathematics Letters, vol.1, issue.2, pp.153-156, 1988.
DOI : 10.1016/0893-9659(88)90062-6

D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1989.

D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys, vol.23, issue.1, pp.5-48, 1991.
DOI : 10.1145/103162.103163

G. Golub and W. Kahan, Calculating the Singular Values and Pseudo-Inverse of a Matrix, Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, vol.2, issue.2, pp.205-224, 1965.
DOI : 10.1137/0702016

G. Golub and D. O-'leary, Some History of the Conjugate Gradient and Lanczos Algorithms: 1948???1976, SIAM Review, vol.31, issue.1, pp.50-102, 1989.
DOI : 10.1137/1031003

G. Golub and C. Reinsch, Singular value decomposition and least squares solutions, Numerische Mathematik, vol.11, issue.5, pp.403-420, 1970.
DOI : 10.1007/BF02163027

G. Golub and J. Welsch, Calculation of Gauss quadrature rules, Mathematics of Computation, vol.23, issue.106, pp.221-230, 1969.
DOI : 10.1090/S0025-5718-69-99647-1

R. Gonin and A. Money, Nonlinear L p -Norm Estimation, 1989.

J. Grabmeier, E. Kaltofen, and V. Weispfenning, Computer Algebra Handbook : Foundations , Applications, Systems, 2003.
DOI : 10.1007/978-3-642-55826-9

A. Griewank and G. Corliss, Automatic Differentiation of Algorithms : Theory, Implementation and Applications, 1991.

A. Griewank and A. Walther, Principles and Techniques of Algorithmic Differentiation, second edn, SIAM, 2008.

M. Grote and T. Huckle, Parallel Preconditioning with Sparse Approximate Inverses, SIAM Journal on Scientific Computing, vol.18, issue.3, pp.838-853, 1997.
DOI : 10.1137/S1064827594276552

G. Gupta, R. Sacks-davis, and P. Tischer, A review of recent developments in solving ODEs, ACM Computing Surveys, vol.17, issue.1, pp.5-47, 1985.
DOI : 10.1145/4078.4079

B. Gustafsson, Fundamentals of Scientific Computing, 2011.
DOI : 10.1007/978-3-642-19495-5

M. Gutknecht, A Brief Introduction to Krylov Space Methods for Solving Linear Systems, Proc. Int. Symp. on Frontiers of Computational Science, pp.53-62, 2005.
DOI : 10.1007/978-3-540-46375-7_5

W. Hager, Updating the Inverse of a Matrix, SIAM Review, vol.31, issue.2, pp.221-239, 1989.
DOI : 10.1137/1031049

W. Hager and H. Zhang, A survey of nonlinear conjugate gradient methods, Pacific J. of Optimization, vol.2, issue.1, pp.35-58, 2006.

E. Hairer and G. Wanner, On the Instability of the BDF Formulas, SIAM Journal on Numerical Analysis, vol.20, issue.6, pp.1206-1209, 1983.
DOI : 10.1137/0720090

R. Hamming, Numerical Methods for Scientists and Engineers, 1986.

S. P. Han and O. Mangasarian, Exact penalty functions in nonlinear programming, Mathematical Programming, vol.13, issue.1, pp.251-269, 1979.
DOI : 10.1007/BF01588250

E. Hansen, Global Optimization Using Interval Analysis. Marcel Dekker, 1992.

M. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, Journal of Research of the National Bureau of Standards, vol.49, issue.6, pp.409-436, 1952.
DOI : 10.6028/jres.049.044

D. Higham, An Algorithmic Introduction to Numerical Simulation of Stochastic Differential Equations, SIAM Review, vol.43, issue.3, pp.525-546, 2001.
DOI : 10.1137/S0036144500378302

N. Higham, ALGORITHM 674: Fortran codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation, ACM Transactions on Mathematical Software, vol.15, issue.2, pp.381-396, 1988.
DOI : 10.1145/63522.214391

N. Higham, Accuracy and Stability of Numerical Algorithms, second edn, SIAM, 2002.

N. Higham, The numerical stability of barycentric Lagrange interpolation, IMA Journal of Numerical Analysis, vol.24, issue.4, pp.547-556, 2004.
DOI : 10.1093/imanum/24.4.547

N. Higham, Cholesky factorization, Wiley Interdisciplinary Reviews: Computational Statistics, vol.103, issue.2, pp.251-254, 2009.
DOI : 10.1002/wics.18

N. Higham, The Scaling and Squaring Method for the Matrix Exponential Revisited, SIAM Review, vol.51, issue.4, pp.747-764, 2009.
DOI : 10.1137/090768539

N. Higham, Gaussian elimination, Wiley Interdisciplinary Reviews: Computational Statistics, vol.15, issue.3, pp.230-238, 2011.
DOI : 10.1002/wics.164

N. Higham and F. Tisseur, A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra, SIAM Journal on Matrix Analysis and Applications, vol.21, issue.4, pp.1185-1201, 2000.
DOI : 10.1137/S0895479899356080

A. Hindmarsh, P. Brown, K. Grant, S. Lee, R. Serban et al., SUNDIALS, ACM Transactions on Mathematical Software, vol.31, issue.3, pp.363-396, 2005.
DOI : 10.1145/1089014.1089020

J. B. Hiriart-urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms -Advanced Theory and Bundle Methods, 1993.

J. B. Hiriart-urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms -Fundamentals, 1993.

Y. C. Ho and D. Pepyne, Simple explanation of the no free lunch theorem of optimization, Proc. 40th IEEE Conf. on Decision and Control, pp.4409-4414, 2001.

R. Horst and H. Tuy, Global Optimization, 1990.

I. Ipsen, Computing an Eigenvector with Inverse Iteration, SIAM Review, vol.39, issue.2, pp.254-291, 1997.
DOI : 10.1137/S0036144596300773

L. Jaulin, M. Kieffer, O. Didrit, and E. Walter, Applied Interval Analysis, 2001.
DOI : 10.1007/978-1-4471-0249-6
URL : https://hal.archives-ouvertes.fr/hal-00845131

A. Jazwinski, Stochastic Processes and Filtering Theory, 1970.

D. Jones, A taxonomy of global optimization methods based on response surfaces, Journal of Global Optimization, vol.21, issue.4, pp.345-383, 2001.
DOI : 10.1023/A:1012771025575

D. Jones, M. Schonlau, and W. Welch, Efficient global optimization of expensive black-box functions, Journal of Global Optimization, vol.13, issue.4, pp.455-492, 1998.
DOI : 10.1023/A:1008306431147

W. Kahan, How futile are mindless assessments of roundoff in floating-point computation ?, 2006.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-395, 1984.
DOI : 10.1007/BF02579150

R. Kearfott, GlobSol user guide, Optimization Methods and Software, vol.24, issue.4-5, pp.687-708, 2009.
DOI : 10.1080/10556780802614051

C. Kelley, Iterative Methods for Optimization, SIAM, 1999.
DOI : 10.1137/1.9781611970920

C. Kelley, Solving Nonlinear Equations with Newton's Method, SIAM, 2003.
DOI : 10.1137/1.9780898718898

J. Kennedy, R. Eberhart, and Y. Shi, Swarm Intelligence, 2001.
DOI : 10.1007/0-387-27705-6_6

D. Kershaw, A Note on the Convergence of Interpolatory Cubic Splines, SIAM Journal on Numerical Analysis, vol.8, issue.1, pp.67-74, 1971.
DOI : 10.1137/0708009

L. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.191-194, 1979.
DOI : 10.1016/0041-5553(80)90061-0

J. Kierzenka and L. Shampine, A BVP solver based on residual control and the Maltab PSE, ACM Transactions on Mathematical Software, vol.27, issue.3, pp.299-316, 2001.
DOI : 10.1145/502800.502801

E. Kiountouzis, Linear Programming Techniques in Regression Analysis, Applied Statistics, vol.22, issue.1, pp.69-73, 1973.
DOI : 10.2307/2346304

R. Klopfenstein, Numerical differentiation formulas for stiff systems of ordinary differential equations, RCA Review, vol.32, pp.447-462, 1971.

D. Knuth, The Art of Computer Programming : 2 Seminumerical Algorithms, 1997.

D. Krige, A statistical approach to some basic mine valuation problems on the Witwatersrand, J. of the Chemical, Metallurgical and Mining Society, vol.52, pp.119-139, 1951.

U. Kulisch, Very fast and exact accumulation of products, Computing, vol.205, issue.4, pp.397-405, 2011.
DOI : 10.1007/s00607-010-0131-y

L. Porte, M. Vignes, and J. , Algorithmes numériques, analyse et mise en oeuvre, 1 : Arithmétique des ordinateurs. Systèmes linéaires, 1974.

P. Van-laarhoven and E. Aarts, Simulated Annealing : Theory and Applications, Kluwer, 1987.
DOI : 10.1007/978-94-015-7744-1

J. Lagarias, B. Poonen, and M. Wright, Convergence of the Restricted Nelder--Mead Algorithm in Two Dimensions, SIAM Journal on Optimization, vol.22, issue.2, pp.501-532, 2012.
DOI : 10.1137/110830150

J. Lagarias, J. Reeds, M. Wright, and P. Wright, Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions, SIAM Journal on Optimization, vol.9, issue.1, pp.112-147, 1998.
DOI : 10.1137/S1052623496303470

A. Langville and C. Meyer, Google's PageRank and Beyond, 2006.
DOI : 10.1515/9781400830329

L. Lapidus and G. Pinder, Numerical Solution of Partial Differential Equations in Science and Engineering, 1999.

C. Lawson and R. Hanson, Solving Least Squares Problems, Classics in Applied Mathematics. SIAM, 1995.
DOI : 10.1137/1.9781611971217

L. Roux, N. Schmidt, M. Bach, and F. , A stochastic gradient method with an exponential convegence rate for strongly-convex optimization with finite training sets, Neural Information Processing Systems (NIPS 2012). Lake Tahoe, 2012.

K. Levenberg, A method for the solution of certain non-linear problems in least squares, Quarterly of Applied Mathematics, vol.2, issue.2, pp.164-168, 1944.
DOI : 10.1090/qam/10666

R. Leveque, Finite Difference methods for Ordinary and Partial Differential Equations, SIAM, 2007.
DOI : 10.1137/1.9780898717839

R. Lewis and V. Torczon, A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds, SIAM Journal on Optimization, vol.12, issue.4, 1998.
DOI : 10.1137/S1052623498339727

M. Lotkin, The Treatment of Boundary Problems by Matrix Methods, The American Mathematical Monthly, vol.60, issue.1, pp.11-19, 1953.
DOI : 10.2307/2306472

A. Lowan, N. Davids, and A. Levenson, Table of the zeros of the Legendre polynomials of order 1-16 and the weight coefficients for Gauss' mechanical quadrature formula, Bulletin of the American Mathematical Society, vol.48, issue.10, pp.739-743, 1942.
DOI : 10.1090/S0002-9904-1942-07771-8

A. Lowan, N. Davids, and A. Levenson, Errata to ???Table of the zeros of the Legendre polynomials of order 1-16 and the weight coefficients for Gauss' mechanical quadrature formula???, Bulletin of the American Mathematical Society, vol.49, issue.12, pp.939-939, 1943.
DOI : 10.1090/S0002-9904-1943-08073-1

K. Makino and M. Bertz, Suppression of the wrapping effect by Taylor model-based verified integrators : Long-term stabilization by preconditioning, Int. J. of Differential Equations and Applications, vol.10, issue.4, pp.353-384, 2005.

K. Makino and M. Bertz, Suppression of the wrapping effect by Taylor model-based verified integrators : The single step, Int. J. of Pure and Applied Mathematics, vol.36, issue.2, pp.175-196, 2007.

D. Marquardt, An Algorithm for Least-Squares Estimation of Nonlinear Parameters, Journal of the Society for Industrial and Applied Mathematics, vol.11, issue.2, pp.431-441, 1963.
DOI : 10.1137/0111030

J. Marzat, E. Walter, and H. Piet-lahanier, Worst-case global optimization of black-box functions through Kriging and relaxation, Journal of Global Optimization, vol.14, issue.6, pp.707-727, 2013.
DOI : 10.1007/s10898-012-9899-y
URL : https://hal.archives-ouvertes.fr/hal-00682475

J. Mathews and K. Fink, Numerical Methods Using MATLAB, fourth edn, NJ, 2004.

J. Matousek and B. Gärtner, Understanding and Using Linear Programming, 2007.

M. Minoux, Mathematical Programming -Theory and Algorithms, 1986.

D. Mitra, F. Romeo, and A. Sangiovanni-vincentelli, Convergence and finite-time behavior of simulated annealing, Advances in Applied Probability, vol.6, issue.03, pp.747-771, 1986.
DOI : 10.1126/science.220.4598.671

J. Mockus, Bayesian Approach to Global Optimization, 1989.

C. Moler, Numerical Computing with MATLAB, revised reprinted edn, SIAM, 2008.

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

R. Moore, Automatic error analysis in digital computation, 1959.

R. Moore, Interval Analysis, 1966.

R. Moore, Mathematical Elements of Scientific Computing, 1975.

R. Moore, Methods and Applications of Interval Analysis, SIAM, 1979.
DOI : 10.1137/1.9781611970906

W. Morokoff and R. Caflisch, Quasi-Monte Carlo Integration, Journal of Computational Physics, vol.122, issue.2, pp.218-230, 1995.
DOI : 10.1006/jcph.1995.1209

J. M. Muller, Elementary Functions, Algorithms and Implementation, second edn, 2006.

J. M. Muller, N. Brisebarre, F. De-dinechin, C. P. Jeannerod, V. Lefèvre et al., Handbook of Floating-Point Arithmetic, 2010.
DOI : 10.1007/978-0-8176-4705-6
URL : https://hal.archives-ouvertes.fr/ensl-00379167

N. Nedialkov, VNODE-LP, a validated solver for initial value problems in ordinary differential equations, 2006.

N. Nedialkov, K. Jackson, and G. Corliss, Validated solutions of initial value problems for ordinary differential equations, Applied Mathematics and Computation, vol.105, issue.1, pp.21-68, 1999.
DOI : 10.1016/S0096-3003(98)10083-8

Y. Nesterov, Introductory Lectures on Convex Optimization : A Basic Course, 2004.
DOI : 10.1007/978-1-4419-8853-9

Y. Nesterov, Primal-dual subgradient methods for convex problems, Mathematical Programming, vol.8, issue.1, pp.221-259, 2009.
DOI : 10.1007/s10107-007-0149-x

A. Neumaier, Interval Methods for Systems of Equations, 1990.
DOI : 10.1017/CBO9780511526473

Y. Nievergelt, A tutorial history of least squares with applications to astronomy and geodesy, Journal of Computational and Applied Mathematics, vol.121, issue.1-2, pp.37-72, 2000.
DOI : 10.1016/S0377-0427(00)00343-5

J. Nocedal and S. Wright, Numerical Optimization, 1999.
DOI : 10.1007/b98874

A. Owen, Monte Carlo Variance of Scrambled Net Quadrature, SIAM Journal on Numerical Analysis, vol.34, issue.5, pp.1884-1910, 1997.
DOI : 10.1137/S0036142994277468

C. Paige and M. Saunders, Solution of Sparse Indefinite Systems of Linear Equations, SIAM Journal on Numerical Analysis, vol.12, issue.4, pp.617-629, 1975.
DOI : 10.1137/0712047

P. Papalambros and D. Wilde, Principles of Optimal Design, 1988.
DOI : 10.1017/CBO9780511626418

B. Parlett, The QR algorithm, Computing in Science & Engineering, vol.2, issue.1, pp.38-42, 2000.
DOI : 10.1109/5992.814656

V. Paschos, Applications of Combinatorial Optimization, 2010.
DOI : 10.1002/9781119005384

V. Paschos, Concepts of Combinatorial Optimization, 2010.
DOI : 10.1002/9781119005216

V. Paschos, Paradigms of Combinatorial Optimization : Problems and New Approaches, 2010.
DOI : 10.1002/9781119005353

M. Pichat and J. Vignes, Ingénierie du contrôle de la précision des calculs sur ordinateur, Editions Technip, 1993.

E. Polak, Computational Methods in Optimization, 1971.

E. Polak, Optimization ? Algorithms and Consistent Approximations, 1997.

B. Polyak, Introduction to Optimization. Optimization Software, 1987.

W. Press, B. Flannery, S. Teukolsky, and W. Vetterling, Numerical Recipes, 1986.

P. Prince and J. Dormand, High order embedded Runge-Kutta formulae, Journal of Computational and Applied Mathematics, vol.7, issue.1, pp.67-75, 1981.
DOI : 10.1016/0771-050X(81)90010-3

L. Pronzato and E. Walter, Eliminating Suboptimal Local Minimizers in Nonlinear Parameter Estimation, Technometrics, vol.43, issue.4, pp.434-442, 2001.
DOI : 10.1198/00401700152672528

L. Pronzato, E. Walter, A. Venot, and J. F. Lebruchec, A general-purpose global optimizer: Implimentation and applications, Mathematics and Computers in Simulation, vol.26, issue.5, pp.412-422, 1984.
DOI : 10.1016/0378-4754(84)90105-8

L. Rall and G. Corliss, Introduction to automatic differentiation, Computational Differentiation Techniques, Applications, and Tools. SIAM, 1996.

H. Ratschek and J. Rokne, New Computer Methods for Global Optimization, 1988.

G. Reddien, Projection Methods for Two-Point Boundary Value Problems, SIAM Review, vol.22, issue.2, pp.156-171, 1980.
DOI : 10.1137/1022025
URL : https://hal.archives-ouvertes.fr/hal-01333730

J. Rice, A Theory of Condition, SIAM Journal on Numerical Analysis, vol.3, issue.2, pp.287-310, 1966.
DOI : 10.1137/0703023

C. Robert and G. Casella, Monte Carlo Statistical Methods, 2004.

S. Rump, INTLAB ??? INTerval LABoratory, Developments in Reliable Computing, pp.77-104, 1999.
DOI : 10.1007/978-94-017-1247-7_7

S. Rump, Verification methods, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.287-449, 2010.
DOI : 10.1145/1837934.1837937

R. Russel and L. Shampine, A collocation method for boundary value problems, Numerische Mathematik, vol.6, issue.1, pp.1-28, 1972.
DOI : 10.1007/BF01395926

R. Russell and J. Varah, A comparison of global methods for linear two-point boundary value problems, Mathematics of Computation, vol.29, issue.132, pp.1007-1019, 1975.
DOI : 10.1090/S0025-5718-1975-0388788-3

B. Rustem and M. Howe, Algorithms for Worst-Case Design and Applications to Risk Management, 2002.
DOI : 10.1515/9781400825110

Y. Saad, Preconditioning techniques for nonsymmetric and indefinite linear systems, Journal of Computational and Applied Mathematics, vol.24, issue.1-2, pp.89-105, 1988.
DOI : 10.1016/0377-0427(88)90345-7

Y. Saad, Iterative Methods for Sparse Linear Systems, second edn, SIAM, 2003.

Y. Saad, Numerical Methods for Large Eigenvalue Problems, second edn, SIAM, 2011.

Y. Saad and M. Schultz, GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, vol.7, issue.3, pp.856-869, 1986.
DOI : 10.1137/0907058

J. Sacks, W. Welch, T. Mitchell, and H. Wynn, Design and Analysis of Computer Experiments, Statistical Science, vol.4, issue.4, pp.409-435, 1989.
DOI : 10.1214/ss/1177012413

T. Santner, B. Williams, and W. Notz, The Design and Analysis of Computer Experiments, 2003.
DOI : 10.1007/978-1-4757-3799-8

M. Sasena, Flexibility and efficiency enhancements for constrained global design optimization with kriging approximations, 2002.

M. Sasena, P. Papalambros, and P. Goovaerts, Exploration of Metamodeling Sampling Criteria for Constrained Global Optimization, Engineering Optimization, vol.34, issue.3, pp.263-278, 2002.
DOI : 10.1080/03052150211751

L. Segel and M. Slemrod, The Quasi-Steady-State Assumption: A Case Study in Perturbation, SIAM Review, vol.31, issue.3, pp.446-477, 1989.
DOI : 10.1137/1031091

L. Shampine, What everyone solving differential equations numerically should know Computational Techniques for Ordinary Differential Equations, 1980.

L. Shampine, Numerical Solution of Ordinary Differential Equations. Chappman & Hall, 1994.

L. Shampine, Error Estimation and Control for ODEs, Journal of Scientific Computing, vol.1, issue.1, pp.3-16, 2005.
DOI : 10.1007/s10915-004-4629-3

L. Shampine, Vectorized solution of ODEs in MATLAB, Scalable Computing : Practice and Experience, pp.337-345, 2009.

L. Shampine and C. Gear, A User???s View of Solving Stiff Ordinary Differential Equations, SIAM Review, vol.21, issue.1, pp.1-17, 1979.
DOI : 10.1137/1021001

L. Shampine, I. Gladwell, and S. Thompson, Solving ODEs in MATLAB, 2003.
DOI : 10.1017/CBO9780511615542

L. Shampine, J. Kierzenka, and M. Reichelt, Solving boundary value problems for ordinary differential equations in MATLAB with bvp4c, 2000.

L. Shampine and M. Reichelt, The MATLAB ODE Suite, SIAM Journal on Scientific Computing, vol.18, issue.1, pp.1-22, 1997.
DOI : 10.1137/S1064827594276424
URL : https://hal.archives-ouvertes.fr/hal-01333731

L. Shampine and S. Thompson, Event location for ordinary differential equations, Computers & Mathematics with Applications, vol.39, issue.5-6, pp.43-54, 2000.
DOI : 10.1016/S0898-1221(00)00045-6

J. Shewchuk, An introduction to the conjugate gradient method without the agonizing pain, 1994.

K. Shimizu and E. Aiyoshi, Necessary conditions for min-max problems and algorithms by a relaxation procedure, IEEE Transactions on Automatic Control, vol.25, issue.1, pp.62-66, 1980.
DOI : 10.1109/TAC.1980.1102226

N. Shor, Minimization Methods for Non-differentiable Functions, 1985.
DOI : 10.1007/978-3-642-82118-9

J. Skufca, Analysis Still Matters: A Surprising Instance of Failure of Runge--Kutta--Felberg ODE Solvers, SIAM Review, vol.46, issue.4, pp.729-737, 2004.
DOI : 10.1137/S003614450342911X

B. Speelpening, Compiling fast partial derivatives of functions given by algorithms, 1980.
DOI : 10.2172/5254402

T. Steihaug and A. Wolfbrandt, An attempt to avoid exact Jacobian and nonlinear equations in the numerical solution of stiff differential equations, Mathematics of Computation, vol.33, issue.146, pp.521-534, 1979.
DOI : 10.1090/S0025-5718-1979-0521273-8

G. Stewart, On the Early History of the Singular Value Decomposition, SIAM Review, vol.35, issue.4, pp.551-566, 1993.
DOI : 10.1137/1035134

G. Stewart, The decompositional approach to matrix computation, Computing in Science & Engineering, vol.2, issue.1, pp.50-59, 2000.
DOI : 10.1109/5992.814658

J. Stoer and R. Bulirsch, Introduction to Numerical Analysis, 1980.

R. Storn and K. Price, Differential evolution ? a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol.11, issue.4, pp.341-359, 1997.
DOI : 10.1023/A:1008202821328

G. Strang, Introduction to Applied Mathematics, 1986.

S. Theodoridis, K. Slavakis, and I. Yamada, Adaptive Learning in a World of Projections, IEEE Signal Processing Magazine, vol.28, issue.1, pp.97-123, 2011.
DOI : 10.1109/MSP.2010.938752

L. Trefethen, Six myths of polynomial interpolation and quadrature, Mathematics Today, vol.47, pp.184-188, 2011.

L. Trefethen, Approximation Theory and Approximation Practice, SIAM, 2013.

J. Varah, On the Numerical Solution of Ill-Conditioned Linear Systems with Applications to Ill-Posed Problems, SIAM Journal on Numerical Analysis, vol.10, issue.2, pp.257-267, 1973.
DOI : 10.1137/0710025

E. Vazquez and E. Walter, Estimating derivatives and integrals with Kriging, Proceedings of the 44th IEEE Conference on Decision and Control, pp.8156-8161, 2005.
DOI : 10.1109/CDC.2005.1583482
URL : https://hal.archives-ouvertes.fr/hal-00369893

W. Vetter, Derivative operations on matrices, IEEE Transactions on Automatic Control, vol.15, issue.2, pp.241-244, 1970.
DOI : 10.1109/TAC.1970.1099409

J. Vignes, New methods for evaluating the validity of the results of mathematical computations, Mathematics and Computers in Simulation, vol.20, issue.4, pp.227-249, 1978.
DOI : 10.1016/0378-4754(78)90016-2

J. Vignes, A stochastic arithmetic for reliable scientific computation, Mathematics and Computers in Simulation, vol.35, issue.3, pp.233-261, 1993.
DOI : 10.1016/0378-4754(93)90003-D

J. Vignes, R. Alt, and M. Pichat, Algorithmes numériques, analyse et mise en oeuvre, 2 : ´ equations et systèmes non linéaires, 1980.

H. Van-der-vorst, Bi-CGSTAB, SIAM J. Scientific and Statistical Computing, vol.13, issue.2, pp.631-644, 1992.
DOI : 10.1017/CBO9780511615115.010

H. Van-der-vorst, Krylov subspace iteration, Computing in Science & Engineering, vol.2, issue.1, pp.32-37, 2000.
DOI : 10.1109/5992.814655

H. Wackernagel, Multivariate Geostatistics, third edn, 2003.

G. Wahba, Spline Models for Observational Data, SIAM, 1990.
DOI : 10.1137/1.9781611970128

E. Walter, Identifiability of State Space Models, 1982.
DOI : 10.1007/978-3-642-61823-9

E. Walter and L. Pronzato, Identification of Parametric Models, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00252148

D. Watkins, Understanding the $QR$ Algorithm, SIAM Review, vol.24, issue.4, pp.427-440, 1982.
DOI : 10.1137/1024100

L. Watson, M. Bartholomew-biggs, and J. Ford, Optimization and Nonlinear Equations, J. of Computational and Applied Mathematics, vol.124, issue.12, pp.1-373, 2000.

J. Wilkinson, Convergence of the LR, QR, and Related Algorithms, The Computer Journal, vol.8, issue.1, pp.77-84, 1965.
DOI : 10.1093/comjnl/8.1.77

J. Wilkinson, Modern Error Analysis, SIAM Review, vol.13, issue.4, pp.548-568, 1971.
DOI : 10.1137/1013095

J. Wilkinson, The perfidious polynomial Studies in Numerical Analysis, The perfidious polynomial, pp.1-28, 1984.

J. Wilkinson, Error analysis revisited, IMA Bulletin, vol.22, issue.1112, pp.192-200, 1986.

J. Wilkinson, Rounding Errors in Algebraic Processes, 1994.

D. Wolpert and W. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.67-82, 1997.
DOI : 10.1109/4235.585893

M. Wright, The interior-point revolution in optimization: History, recent developments, and lasting consequences, Bulletin of the American Mathematical Society, vol.42, issue.01, pp.39-56, 2004.
DOI : 10.1090/S0273-0979-04-01040-7

D. Young, Iterative methods for solving partial difference equations of elliptic type, Transactions of the American Mathematical Society, vol.76, issue.1, 1950.
DOI : 10.1090/S0002-9947-1954-0059635-7

T. Ypma, Historical Development of the Newton???Raphson Method, SIAM Review, vol.37, issue.4, pp.531-551, 1995.
DOI : 10.1137/1037125

T. Zahradnicky and R. Lorencz, FPU-supported running error analysis, Acta Polytechnica, vol.50, issue.2, pp.30-36, 2010.

A. Zaslavski, A Sufficient Condition for Exact Penalty in Constrained Optimization, SIAM Journal on Optimization, vol.16, issue.1, pp.250-262, 2005.
DOI : 10.1137/040612294

H. Zedan, Modified Rosenbrock-Wanner methods for solving systems of stiff ordinary differential equations, 1982.