Large-scale linear, time-invariant (LTI) dynamical systems are widely used to characterize complicated physical phenomena. We propose a two-stage algorithm to reduce the order of a large-scale LTI system given samples of its transfer function for a target degree $k$ of the reduced system. In the first stage, a modified adaptive Antoulas--Anderson (AAA) algorithm is used to construct a degree $d$ rational approximation of the transfer function that corresponds to an intermediate system, which can be numerically stably reduced in the second stage using ideas from the theory on Hankel norm approximation (HNA). We also study the numerical issues of Glover's HNA algorithm and provide a remedy for its numerical instabilities. A carefully computed rational approximation of degree $d$ gives us a numerically stable algorithm for reducing an LTI system, which is more efficient than SVD-based algorithms and more accurate than moment-matching algorithms.
翻译:大规模线性时不变(LTI)动态系统被广泛用于表征复杂的物理现象。我们提出了一个两阶段算法,根据目标阶数k的传递函数样本来降低大规模LTI系统的阶数。在第一阶段中,使用修改后的自适应Antoulas-Anderson(AAA)算法构建度数$d$的传递函数有理逼近,该逼近对应中间系统,该中间系统可以在第二阶段使用Hankel范数逼近(HNA)理论的思想进行数值稳定的降阶处理。我们还研究了Glover的HNA算法的数值问题,并提供了其数值不稳定性的解决方案。精确计算出的度数$d$的有理逼近为我们提供了一种数值稳定的降阶LTI系统的算法,该算法比基于SVD的算法更高效,比基于矩匹配的算法更精确。