An efficient, memory-saving approach for the Loewner framework
Davide Palitta, Sanda Lefteriu

TL;DR
This paper introduces a memory-efficient, scalable method for the Loewner framework that exploits matrix structure to reduce computational costs from quadratic to near-linear, enabling model reduction on large data sets.
Contribution
The paper develops a novel approach using hierarchically semiseparable matrices to efficiently compute rational models without explicitly forming large matrices.
Findings
Reduces computational complexity to O(N log N)
Significantly lowers memory requirements
Enables handling of large, highly-sampled data sets
Abstract
The Loewner framework is one of the most successful data-driven model order reduction techniques. If is the cardinality of a given data set, the so-called Loewner and shifted Loewner matrices and can be defined by solely relying on information encoded in the considered data set and they play a crucial role in the computation of the sought rational model approximation. In particular, the singular value decomposition of a linear combination of and provides the tools needed to construct accurate models which fulfill important approximation properties with respect to the original data set. However, for highly-sampled data sets, the dense nature of and leads to numerical difficulties, namely the failure to allocate these matrices in certain memory-limited…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
