A new efficient algorithm for the computation of the stability chart of linear time delay systems is proposed and tested on several examples. The stability chart is obtained by investigating the 2d-parameter space by a first coarse square grid which is then adaptively refined by triangulation to match the desired tolerance. This leads to a considerable reduction in computational cost with respect to investigate a uniform fine square grid. Stability of each point is determined by approximating the rightmost characteristic root real part via a numerical scheme recently developed by the authors and based on pseudospectral differencing methods. A Matlab code is included in appendix.
Efficient Computation of Stability Charts for Linear Time Delay Systems
BREDA, Dimitri;VERMIGLIO, Rossana
2005-01-01
Abstract
A new efficient algorithm for the computation of the stability chart of linear time delay systems is proposed and tested on several examples. The stability chart is obtained by investigating the 2d-parameter space by a first coarse square grid which is then adaptively refined by triangulation to match the desired tolerance. This leads to a considerable reduction in computational cost with respect to investigate a uniform fine square grid. Stability of each point is determined by approximating the rightmost characteristic root real part via a numerical scheme recently developed by the authors and based on pseudospectral differencing methods. A Matlab code is included in appendix.File | Dimensione | Formato | |
---|---|---|---|
2005_idetc_breda_maset_vermiglio.pdf
non disponibili
Tipologia:
Versione Editoriale (PDF)
Licenza:
Non pubblico
Dimensione
2.11 MB
Formato
Adobe PDF
|
2.11 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.