An Algorithm to Verify a Class of Matrix Inequalities in the Global Stability of Nonlinear Systems

The global stability and stabilization for nonlinear systems is a challenging problem in control theory. The conditions like R(t) < -E0I or R (x) < -E0I often appeared in many related literature. Obviously, to verify this condition is not easy, partly because there is not a general method to f...

Full description

Saved in:
Bibliographic Details
Main Authors: Gu, Huiling, Sun, Yimin
Format: Conference Proceeding
Language:English
Subjects:
complete discrimination system
Control theory
Geometry
Global stability
Linear matrix inequalities
mathematics mechanization
Nonlinear systems
polynomial
Scientific computing
Stability analysis
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The global stability and stabilization for nonlinear systems is a challenging problem in control theory. The conditions like R(t) < -E0I or R (x) < -E0I often appeared in many related literature. Obviously, to verify this condition is not easy, partly because there is not a general method to find the precise value of its roots by radicals for a univariate polynomial with degree more than 4. In this paper, we mainly discuss the case which all entries in R are polynomials and give a feasible algorithm to verify the condition R(t)
ISSN:2161-2927
DOI:10.23919/CCC55666.2022.9902217