Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron
From MaRDI portal
(Redirected from Publication:255394)
algorithmdiscretization methoddynamical systemforward Euler methodinvariance preservinginvariant setpolyhedronsteplength thresholdsTaylor approximation
Linear ordinary differential equations and systems (34A30) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Finite difference and finite volume methods for ordinary differential equations (65L12) Error bounds for numerical methods for ordinary differential equations (65L70)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
- Constrained stabilization of continuous-time linear systems
- Contractivity in the numerical solution of initial value problems
- Discussion on: ``\((A,B)\)-invariance conditions of polyhedral domains for continuous-time systems by C. E. T. Dórea and J. -C. Hennet
- Exponential Nonnegativity on the Ice Cream Cone
- Functions of Matrices
- Invariant cones and polyhedra for dynamical systems
- Linear Matrix Inequalities in System and Control Theory
- On invariant polyhedra of continuous-time linear systems
- On the positive invariance of polyhedral sets for discrete-time systems
- On the positivity step size threshold of Runge--Kutta methods
- Positive operators on the \(n\)-dimensional ice cream cone
- Set invariance in control
- Solving Ordinary Differential Equations I
- Spectral Properties of Matrices which have Invariant Cones
- \((A,B)\)-invariance conditions of polyhedral domains for continuous-time systems
- \((A,B)\)-invariant polyhedral sets of linear discrete-time systems
Cited in
(5)- Invariance conditions for nonlinear dynamical systems
- Invariant cones and polyhedra for dynamical systems
- Invariance under discretization for positive systems
- Invariance preserving discretization methods of dynamical systems
- A novel unified approach to invariance conditions for a linear dynamical system
This page was built for publication: Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255394)
