Time-Domain Iterative Rational Krylov Method
- 5 May 2025
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (3) , A1628-A1651
Abstract
The Realization Independent Iterative Rational Krylov Algorithm (TF-IRKA) is a frequency-based data-driven reduced order modeling (DDROM) method that constructs [Formula: see text] optimal DDROMs. However, as the [Formula: see text] optimal approximation theory dictates, TF-IRKA requires repeated sampling of frequency data, that is, values of the system transfer function and its derivative, outside the unit circle. This repeated evaluation of frequency data requires repeated full model computations and may not be feasible. The data informativity framework for moment matching provides a method for obtaining such frequency data from a single time-domain simulation. However, this framework usually requires solving linear systems with prohibitively ill-conditioned matrices, especially when recovering frequency data from off the unit circle as required for optimality. In this paper, building upon our previous work with the data-informativity framework for moment matching, we provide a formula for the nonzero extreme eigenvalues of a symmetric rank-1 perturbation to an orthogonal projection, which then leads to an optimal scaling of the aforementioned linear systems. We also establish connections between the underlying dynamical system and conditioning of these linear systems. This analysis then leads to our algorithmic development, time-domain IRKA, which allows us to implement a time-domain variant of TF-IRKA, constructing [Formula: see text] optimal DDROMs from a single time-domain simulation without requiring repeated frequency data evaluations. The numerical examples illustrate the effectiveness of the proposed algorithm. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://zenodo.org/records/12751391 . [Formula: see text]Keywords
All Related Versions
This publication has 40 references indexed in Scilit:
- AAA rational approximation for time domain model order reductionApplied Mathematics Letters, 2024
- Structured barycentric forms for interpolation-based data-driven reduced modeling of second-order systemsAdvances in Computational Mathematics, 2024
- Pseudospectra of Loewner Matrix Pencils2022
- Modeling of dynamical systems through deep learningBiophysical Reviews, 2020
- Revisiting IRKA: Connections with Pole Placement and Backward StabilityVietnam Journal of Mathematics, 2020
- Lift & Learn: Physics-informed machine learning for large-scale nonlinear dynamical systemsPhysica D: Nonlinear Phenomena, 2020
- Transfer functions of distributed parameter systems: A tutorialAutomatica, 2009
- Reduced Basis Approximation and a Posteriori Error Estimation for Affinely Parametrized Elliptic Coercive Partial Differential EquationsArchives of Computational Methods in Engineering, 2008
- A framework for the solution of the generalized realization problemLinear Algebra and its Applications, 2007
- Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung)Mathematische Annalen, 1912