Abstract
An efficient guaranteed method for the computation of the integral of a nonlinear continuous function between two interval endpoints is proposed. This computation can be of interest for the computation of global optimization problems where such integrals occur like in robotics. The method results in the computation of the minimum and maximum of these integrals and provides the endpoints at stake. The complexity of the resulting algorithms is discussed, it depends on the number of roots of the function to be integrated. The computation is illustrated on several examples.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Alefeld, G., Mayer, G.: Interval analysis: theory and applications. J. Comput. Appl. Math. 121(1–2), 421–464 (2000)
Alexandre dit Sandretto, J., Chapoutot, A.: Validated explicit and implicit runge-kutta methods. Reliable Comput. 22, 78–103 (2016). Electronic edition
Aubry, C., Desmare, R., Jaulin, L.: Loop detection of mobile robots using interval analysis. Automatica 49(2), 463–470 (2013)
Corliss, G.F.: Computing narrow inclusions for definite integrals. In: Computer Arithmetic, pp. 150–179 (1987)
Corliss, G.F., Rall, L.B.: Adaptive, self-validating numerical quadrature. SIAM J. Sci. Stat. Comput. 8(5), 831–847 (1987)
Hansen, E.: Global optimization using interval analysis–the multi-dimensional case. Numer. Math. 34(3), 247–270 (1980)
Moore, R.E.: Interval Analysis, vol. 4. Prentice-Hall, Englewood Cliffs (1966)
Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis, vol. 110. SIAM, Philadelphia (2009)
Nedialkov, N.S., Jackson, K.R., Corliss, G.F.: Validated solutions of initial value problems for ordinary differential equations. Appl. Math. Comput. 105(1), 21–68 (1999)
Petras, K.: On the complexity of self-validating numerical integration and approximation of functions with singularities. J. Complex. 14(3), 302–318 (1998)
Petras, K.: Self-validating integration and approximation of piecewise analytic functions. J. Comput. Appl. Math. 145(2), 345–359 (2002)
Sandretto, J.A.D., Chapoutot, A., Mullier, O.: Optimal switching instants for the control of hybrid systems. In: 11th Summer Workshop on Interval Methods (SWIM) (2018)
Acknowledgement
This research was supported by the “Complex Systems Engineering Chair - Ecole Polytechnique, THALES, DGA, FX, DASSAULT AVIATION, DCNS Research, ENSTA ParisTech, Télécom ParisTech, Fondation ParisTech and FDO ENSTA”. This research is also partially funded by DGA MRIS.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Mullier, O., Alexandre dit Sandretto, J. (2020). Set-Membership Computation of Integrals with Uncertain Endpoints. In: Sergeyev, Y., Kvasov, D. (eds) Numerical Computations: Theory and Algorithms. NUMTA 2019. Lecture Notes in Computer Science(), vol 11974. Springer, Cham. https://doi.org/10.1007/978-3-030-40616-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-40616-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-40615-8
Online ISBN: 978-3-030-40616-5
eBook Packages: Computer ScienceComputer Science (R0)