New Algorithm Based on Sign Decomposition to Verify the Robust Stability Property for a Class of Linear Time-Delay Systems
The main focus of this paper is to analyze the robust stability property for a class of time-delay systems when parametric polynomic uncertainty is considered. The analysis is made by replacing the time-delay part with an auxiliary equation and then using the sign definite decomposition to deal with...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2015
|
| Online Access: | http://eprints.uanl.mx/15002/1/173.pdf |
| Summary: | The main focus of this paper is to analyze the robust stability property for a class of time-delay systems when parametric polynomic uncertainty is considered. The analysis is made by replacing the time-delay part with an auxiliary equation and then using the sign definite decomposition to deal with the polynomic parametric uncertainty. Also, it is shown that it is possible to verify the robust stability property by first obtaining the Hurwitz matrix from the characteristic equation for this class of systems and then checking the leading principal minors positivity using the sign definite decomposition. Finally, an algorithm codified in MATLAB is used to evaluate and graphically show the robust stability property. This is shown by a series of points that were calculated using the sign definite de composition. |
|---|