Adaptive algorithms for computing the reduced-order model of time-delay systems (TDSs) are proposed in this work. The algorithms are based on interpolating the transfer function at multiple expansion points and greedy iterations for selecting the expansion points. The (Formula presented.) -error of the reduced transfer function is used as the criterion for choosing the next new expansion point. One heuristic greedy algorithm and one algorithm based on the error system and adaptive sub-interval selection are developed. Results on four TDSs with tens of delays from electromagnetic applications are presented and show the efficiency of the proposed algorithms.
Model order reduction for delay systems by iterative interpolation
Lombardi L.;Antonini G.
;
2021-01-01
Abstract
Adaptive algorithms for computing the reduced-order model of time-delay systems (TDSs) are proposed in this work. The algorithms are based on interpolating the transfer function at multiple expansion points and greedy iterations for selecting the expansion points. The (Formula presented.) -error of the reduced transfer function is used as the criterion for choosing the next new expansion point. One heuristic greedy algorithm and one algorithm based on the error system and adaptive sub-interval selection are developed. Results on four TDSs with tens of delays from electromagnetic applications are presented and show the efficiency of the proposed algorithms.File | Dimensione | Formato | |
---|---|---|---|
MOR4delay5revised-PB.pdf
accesso aperto
Descrizione: Articolo principale
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
2 MB
Formato
Adobe PDF
|
2 MB | Adobe PDF | Visualizza/Apri |
Numerical Meth Engineering - 2020 - Alfke - Model order reduction for delay systems by iterative interpolation.pdf
accesso aperto
Tipologia:
Documento in Versione Editoriale
Licenza:
Creative commons
Dimensione
1.56 MB
Formato
Adobe PDF
|
1.56 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.