TY - GEN
T1 - Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta
AU - Alexandre dit Sandretto, Julien
AU - Wan, Jian
PY - 2018/8/30
Y1 - 2018/8/30
N2 - Ordinary Differential Equations (ODEs) are a general form of differential equations. This mathematical format is often used to represent the dynamic behavior of physical systems such as control systems and chemical processes. Linear ODEs can usually be solved analytically while nonlinear ODEs may need numerical methods to obtain approximate solutions. There are also various developments for validated simulation of nonlinear ODEs such as explicit and implicit guaranteed Runge-Kutta integration schemes. The implicit ones are mainly based on zonotopic computations using affine arithmetics. It allows to compute the reachability of a nonlinear ODE with a zonotopic set as its initial value. In this paper, we propose a new validated approach to solve nonlinear ODEs with a polytopic set as the initial value using an indirectly implemented polytopic set computation technique.
AB - Ordinary Differential Equations (ODEs) are a general form of differential equations. This mathematical format is often used to represent the dynamic behavior of physical systems such as control systems and chemical processes. Linear ODEs can usually be solved analytically while nonlinear ODEs may need numerical methods to obtain approximate solutions. There are also various developments for validated simulation of nonlinear ODEs such as explicit and implicit guaranteed Runge-Kutta integration schemes. The implicit ones are mainly based on zonotopic computations using affine arithmetics. It allows to compute the reachability of a nonlinear ODE with a zonotopic set as its initial value. In this paper, we propose a new validated approach to solve nonlinear ODEs with a polytopic set as the initial value using an indirectly implemented polytopic set computation technique.
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85053885946&partnerID=MN8TOARS
UR - https://link.springer.com/chapter/10.1007/978-3-030-00250-3_1
U2 - 10.1007/978-3-030-00250-3_1
DO - 10.1007/978-3-030-00250-3_1
M3 - Conference publication
SN - 9783030002497
T3 - Lecture Notes in Computer Science
SP - 1
EP - 14
BT - Reachability Problems
A2 - Potapov, Igor
A2 - Reynier, Pierre-Alain
PB - Springer
ER -