arXiv Analytics

Sign in

arXiv:2304.03813 [math.NA]AbstractReferencesReviewsResources

Leveraging the Hankel norm approximation and block-AAA algorithms in reduced order modeling

Annan Yu, Alex Townsend

Published 2023-04-07Version 1

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.

Related articles: Most relevant | Search more
arXiv:1612.00337 [math.NA] (Published 2016-12-01)
The AAA algorithm for rational approximation
arXiv:math/0207183 [math.NA] (Published 2002-07-21, updated 2002-08-17)
Error autocorrection in rational approximation and interval estimates
arXiv:2407.15775 [math.NA] (Published 2024-07-22)
Improving Greedy Algorithms for Rational Approximation