Parallel Computation of Domains of Attraction for Nonlinear Dynamic Systems

In this paper a parallel version of a new approach for investigation of the stability of nonlinear dynamic system swill be presented. It is an extension of an interval arithmetic approach which computes tight approximations for domains of attraction using the Lyapunov stability theory. Unfortunately, the execution time of the serial algorithm grows exponentially with an increase in the number of state space variables, which makes it time-consuming to solve tasks of higher dimensions. We will show that parallelization is a good strategy to overcome this drawback.