TY - GEN
T1 - Set-Membership Computation of Integrals with Uncertain Endpoints
AU - Mullier, Olivier
AU - Alexandre dit Sandretto, Julien
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - 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.
AB - 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.
KW - Integral
KW - Interval methods
KW - Set-membership computation
UR - https://www.scopus.com/pages/publications/85080955529
U2 - 10.1007/978-3-030-40616-5_13
DO - 10.1007/978-3-030-40616-5_13
M3 - Conference contribution
AN - SCOPUS:85080955529
SN - 9783030406158
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 169
EP - 181
BT - Numerical Computations
A2 - Sergeyev, Yaroslav D.
A2 - Kvasov, Dmitri E.
A2 - Sergeyev, Yaroslav D.
A2 - Kvasov, Dmitri E.
PB - Springer
T2 - 3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019
Y2 - 15 June 2019 through 21 June 2019
ER -