Computing and Optimizing the $H^2$-norm of Delay Differential Algebraic Systems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914386340216832 |
|---|---|
| author | Provoost, Evert Michiels, Wim |
| author_facet | Provoost, Evert Michiels, Wim |
| contents | We present a Lanczos tau method for the approximation and optimization of the $H^2$-norm of time-delay systems described by semi-explicit delay differential algebraic equations. The soundness of this approach is proven under the assumption of a finite strong $H^2$-norm. Furthermore, we prove convergence if the rational approximation of the exponential underlying the discretization is well-behaved and the discretization is stability preserving. Numerical results suggest that, for multiple delays, the method converges at cubic rate in the discretization degree for systems of retarded type and linearly for those of neutral type. In the single delay case, we note geometric convergence of the $H^2$-norm for systems of both retarded and neutral type when a symmetric basis is chosen.
Explicit formulas are derived for the gradient of the approximation with respect to system parameters and delays. These allow us to compute the entire gradient using only about double the computational time of approximating the $H^2$-norm alone. We illustrate how these can be used to synthesize robust feedback controllers and stable approximate models.
The article is concluded by a discussion of how the presented results extend and improve for approximations based on splines. We note acceleration of the convergence rate by about two orders for such a choice. Finally, we prove that a Lanczos tau method using a spline based on Legendre orthogonal polynomials preserves stability and guarantees convergence of the $H^2$-norm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_10734 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Computing and Optimizing the $H^2$-norm of Delay Differential Algebraic Systems Provoost, Evert Michiels, Wim Numerical Analysis Optimization and Control 65L03, 34K06, 34K40, 34K35 We present a Lanczos tau method for the approximation and optimization of the $H^2$-norm of time-delay systems described by semi-explicit delay differential algebraic equations. The soundness of this approach is proven under the assumption of a finite strong $H^2$-norm. Furthermore, we prove convergence if the rational approximation of the exponential underlying the discretization is well-behaved and the discretization is stability preserving. Numerical results suggest that, for multiple delays, the method converges at cubic rate in the discretization degree for systems of retarded type and linearly for those of neutral type. In the single delay case, we note geometric convergence of the $H^2$-norm for systems of both retarded and neutral type when a symmetric basis is chosen. Explicit formulas are derived for the gradient of the approximation with respect to system parameters and delays. These allow us to compute the entire gradient using only about double the computational time of approximating the $H^2$-norm alone. We illustrate how these can be used to synthesize robust feedback controllers and stable approximate models. The article is concluded by a discussion of how the presented results extend and improve for approximations based on splines. We note acceleration of the convergence rate by about two orders for such a choice. Finally, we prove that a Lanczos tau method using a spline based on Legendre orthogonal polynomials preserves stability and guarantees convergence of the $H^2$-norm. |
| title | Computing and Optimizing the $H^2$-norm of Delay Differential Algebraic Systems |
| topic | Numerical Analysis Optimization and Control 65L03, 34K06, 34K40, 34K35 |
| url | https://arxiv.org/abs/2603.10734 |