Operator-ADI balanced truncation of delay differential systems
Abstract
We develop a balanced truncation method for linear delay differential systems based on a finite-rank alternating-direction implicit (ADI) iteration for the associated operator Lyapunov equations. The method acts directly on the infinite-dimensional history-state realization and does not discretize the delay interval during Gramian approximation or balancing. The finite-rank reachability and observability factors are represented exactly in Takenaka--Malmquist coordinates, reducing the required computations to finite-dimensional linear algebra. These factors yield a finite-dimensional, delay-free reduced model. For real system data, the implementation remains in real arithmetic. Under suitable conditions on the ADI shifts and a gap in the Hankel singular values, we prove convergence in ℋ∞ to the reduced transfer function obtained by exact balanced truncation of the infinite-dimensional system. The construction extends to finitely many discrete delays. Numerical experiments validate the method against independent reference computations. The complete MATLAB implementation used in the experiments is provided as supplementary material.
Related
- Balanced truncation for bilinear time-delay systems with approximate Gramians
- Symmetric Hermite quadrature-based balanced truncation for learning linear dynamical systems from derivative data
- Ergodicity of stochastic functional differential equation with jumps and finite delay
- Oscillation of Noncanonical Neutral-Type Delay Differential Equations
- On a Nonlinear Fractional Delay Differential Equation with Nonlocal Boundary Conditions
BibTeX
@misc{reis2026operatoradi,
title = {{Operator-ADI balanced truncation of delay differential systems}},
author = {Timo Reis},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.31044},
eprint = {2609.31044},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.31044},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Operator-ADI balanced truncation of delay differential systems
AU - Timo Reis
PY - 2026
DA - 2026/09/25
PB - arXiv
DO - 10.48550/arxiv.2609.31044
UR - https://arxiv.org/abs/2609.31044
AB - We develop a balanced truncation method for linear delay differential systems based on a finite-rank alternating-direction implicit (ADI) iteration for the associated operator Lyapunov equations. The method acts directly on the infinite-dimensional history-state realization and does not discretize the delay interval during Gramian approximation or balancing. The finite-rank reachability and observability factors are represented exactly in Takenaka--Malmquist coordinates, reducing the required computations to finite-dimensional linear algebra. These factors yield a finite-dimensional, delay-free reduced model. For real system data, the implementation remains in real arithmetic. Under suitable conditions on the ADI shifts and a gap in the Hankel singular values, we prove convergence in ℋ_∞ to the reduced transfer function obtained by exact balanced truncation of the infinite-dimensional system. The construction extends to finitely many discrete delays. Numerical experiments validate the method against independent reference computations. The complete MATLAB implementation used in the experiments is provided as supplementary material.
ER -