Reducible discrete delays and LTIs

Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 269)


As specified in the previous chapters, we first focus on the discrete delays case, that is on the characterization of the triplets (A,A d, τ d):
$$ \begin{gathered} A_d = \left[ {A_1 A_2 ... A_{n_d } } \right], \hfill \\ \tau _d = \left[ {\tau _1 \tau _2 ... \tau _{n_d } } \right], \hfill \\ \end{gathered} $$
guaranteeing the asymptotic stability of the associated delay system:
$$ \dot x(t) = Ax(t) + \sum\limits_{i = 1}^{n_d } {A_i x(t\_\tau _i ),} $$
using the notions and definitions presented in the previous chapter. Next we consider more general cases (only some simple frequency-sweeping tests).


Unit Circle Model Transformation Imaginary Axis Delay System Delay Interval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limeted 2001

Personalised recommendations