Approximation of the viability kernel

We study recursive inclusionsxⁿ⁺¹ G(xⁿ). For instance, such systems appear for discrete finite-difference inclusionsxⁿ⁺¹ G(xⁿ) whereG:=1+F. The discrete viability kernel ofG, i.e., the largest discrete viability domain, can be an internal approximation of the viability kernel ofK underF. We study discrete and finite dynamical systems. In the Lipschitz case we get a generalization to differential inclusions of the Euler and Runge-Kutta methods. We prove first that the viability kernel ofK underF can be approached by a sequence of discrete viability kernels associated withxⁿ⁺¹ (xⁿ) where(x) =x + F(x) + (ML/2) ². Secondly, we show that it can be approached by finite viability kernels associated withx_hⁿ⁺¹ ((x_hⁿ⁺¹) +(h) X_h.