Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron
Abstract: Steplength thresholds for invariance preserving of three types of discretization methods on a polyhedron are considered. For Taylor approximation type discretization methods we prove that a valid steplength threshold can be obtained by finding the first positive zeros of a finite number of polynomial functions. Further, a simple and efficient algorithm is proposed to numerically compute the steplength threshold. For rational function type discretization methods we derive a valid steplength threshold for invariance preserving, which can be computed by using an analogous algorithm as in the first case. The relationship between the previous two types of discretization methods and the forward Euler method is studied. Finally, we show that, for the forward Euler method, the largest steplength threshold for invariance preserving can be computed by solving a finite number of linear optimization problems.
Keywords: Dynamical System, Invariant Set, Polyhedron, Discretizat ion method, Invariance Preserving.
Category 1: Convex and Nonsmooth Optimization
Category 2: Convex and Nonsmooth Optimization (Convex Optimization )
Citation: Discrete and Continuous Dynamical Systems - Series A
Entry Submitted: 07/11/2016
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|