Discovering polynomial Lyapunov functions for continuous dynamical systems

DOI10.1016/J.JSC.2013.06.003zbMath1338.37025OpenAlexW2066116184MaRDI QIDQ2437283

Zhikun She, Hao-Yang Li, Bican Xia, Bai Xue, Zhi Ming Zheng

Publication date: 3 March 2014

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2013.06.003

zbMATH Keywords

Lyapunov functionsemi-algebraic systemreal root classification

Mathematics Subject Classification ID

Stability of topological dynamical systems (37B25) Stability theory for smooth dynamical systems (37C75)

Related Items (12)

Stability analysis of discrete-time switched systems via multi-step multiple Lyapunov-like functions ⋮ FOSSIL ⋮ On the stability of discrete-time homogeneous polynomial dynamical systems ⋮ Automatic Determination of Connected Sublevel Sets of CPA Lyapunov Functions ⋮ Characterizations and Criteria for Synchronization of Heterogeneous Networks to Linear Subspaces ⋮ Inner-estimating domains of attraction for discrete-time non-polynomial systems with piecewise difference inclusions ⋮ Global dynamics of a predator-prey system with density-dependent mortality and ratio-dependent functional response ⋮ A conflict-driven solving procedure for poly-power constraints ⋮ Sufficient and necessary conditions for discrete-time nonlinear switched systems with uniform local exponential stability ⋮ Symbolic computation for the qualitative theory of differential equations ⋮ Special algorithm for stability analysis of multistable biological regulatory systems ⋮ Review on computational methods for Lyapunov functions

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• REDLOG
• RSOLVER
• YALMIP
• Benchmarks
• PENBMI
• HSolver
• DISCOVERER
• ConstructibleSetTools
• ParametricSystemTools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
• Condition number based complexity estimate for solving polynomial systems
• A complete algorithm for automated discovering of a class of inequality-type theorems
• Tightened reachability constraints for the verification of linear hybrid systems
• Condition number based complexity estimate for computing local extrema
• A semi-algebraic approach for asymptotic stability analysis
• Partial cylindrical algebraic decomposition for quantifier elimination
• Testing stability by quantifier elimination
• Semidefinite programming relaxations for semialgebraic problems
• Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
• Solving systems of strict polynomial inequalities
• Real solution isolation using interval arithmetic
• Algebraic analysis on asymptotic stability of switched hybrid systems
• Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
• Computing a Basin of Attraction to a Target Region by Solving Bilinear Semi-Definite Problems
• Constraint-Based Approach for Analysis of Hybrid Systems
• Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)
• Multiple Lyapunov functions and other analysis tools for switched and hybrid systems
• Stability Region Analysis Using Polynomial and Composite Polynomial Lyapunov Functions and Sum-of-Squares Programming
• The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
• Algebraic analysis on asymptotic stability of continuous dynamical systems
• Stability analysis of biological systems with real solution classification
• Hybrid Systems: Computation and Control
• Improved projection for cylindrical algebraic decomposition

This page was built for publication: Discovering polynomial Lyapunov functions for continuous dynamical systems