Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron

DOI10.3934/dcds.2015.35.2997zbMath1336.65125arXiv1406.6755OpenAlexW2068324148MaRDI QIDQ255394

Yunfei Song, Zoltán Horváth, Tamás Terlaky

Publication date: 9 March 2016

Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.6755

zbMATH Keywords

algorithminvariant setpolyhedrondynamical systemdiscretization methodTaylor approximationforward Euler methodinvariance preservingsteplength thresholds

Mathematics Subject Classification ID

Linear ordinary differential equations and systems (34A30) Error bounds for numerical methods for ordinary differential equations (65L70) 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)

Related Items (4)

Invariance preserving discretization methods of dynamical systems ⋮ Invariance Conditions for Nonlinear Dynamical Systems ⋮ A novel unified approach to invariance conditions for a linear dynamical system ⋮ Invariance under discretization for positive systems

Uses Software

• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained stabilization of continuous-time linear systems
• On the positive invariance of polyhedral sets for discrete-time systems
• Positive operators on the \(n\)-dimensional ice cream cone
• \((A,B)\)-invariance conditions of polyhedral domains for continuous-time systems
• Discussion on: ``\((A,B)\)-invariance conditions of polyhedral domains for continuous-time systems by C. E. T. Dórea and J. -C. Hennet
• On the positivity step size threshold of Runge--Kutta methods
• Set invariance in control
• Contractivity in the numerical solution of initial value problems
• \((A,B)\)-invariant polyhedral sets of linear discrete-time systems
• Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
• Solving Ordinary Differential Equations I
• Exponential Nonnegativity on the Ice Cream Cone
• On invariant polyhedra of continuous-time linear systems
• Linear Matrix Inequalities in System and Control Theory
• Functions of Matrices
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Spectral Properties of Matrices which have Invariant Cones

This page was built for publication: Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron