Title :

Computer algebra methods for the stability analysis of differential systems with commensurate time-delays

Author(s) :

Bouzidi, Yacine [Auteur]
Non-Asymptotic estimation for online systems [NON-A]
Poteaux, Adrien [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Quadrat, Alban [Auteur]
Non-Asymptotic estimation for online systems [NON-A]

Conference title :

13th IFAC Workshop on Time Delay Systems

City :

Istanbul

Country :

Turquie

Start date of the conference :

2016-06-22

Book title :

13th IFAC Workshop on Time Delay Systems

Publication date :

2016-06

English keyword(s) :

Differential time-delay systems
Stability analysis
Critical pairs
Polynomial systems
Puiseux series
Computer algebra

HAL domain(s) :

Informatique [cs]/Calcul formel [cs.SC]
Mathématiques [math]/Optimisation et contrôle [math.OC]
Mathématiques [math]/Algèbre commutative [math.AC]
Mathématiques [math]/Géométrie algébrique [math.AG]

English abstract : [en]

This paper is devoted to the study of the stability of linear differential systems with commensurate delays. Within the frequency-domain approach, it is well-known that the asymptotic stability of such systems is ensured ...
Show more >This paper is devoted to the study of the stability of linear differential systems with commensurate delays. Within the frequency-domain approach, it is well-known that the asymptotic stability of such systems is ensured by the condition that all the roots of the corresponding quasipolynomial have negative real parts. A classical approach for checking this condition consists in computing the set of critical zeros of the quasipolynomial, i.e., the roots (and the corresponding delays) of the quasipolynomial that lie on the imaginary axis, and then analyzing the variation of these roots with respect to the variation of the delay. Following this approach, based on solving algebraic systems techniques, we propose a certified and efficient symbolic-numeric algorithm for computing the set of critical roots of a quasipolynomial. Moreover, using recent algorithmic results developed by the computer algebra community, we present an efficient algorithm for the computation of Puiseux series at a critical zero which allows us to finely analyze the stability of the system with respect to the variation of the delay. Explicit examples are given to illustrate our algorithms.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

ANR Project :

Systèmes multidimensionnels, digression sur la stabilité

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL