Papers
Topics
Authors
Recent
Search
2000 character limit reached

Toward a certified greedy Loewner framework with minimal sampling

Published 2 Mar 2023 in math.NA, cs.NA, cs.SY, and eess.SY | (2303.01015v3)

Abstract: We propose a strategy for greedy sampling in the context of non-intrusive interpolation-based surrogate modeling for frequency-domain problems. We rely on a non-intrusive and cheap error indicator to drive the adaptive selection of the high-fidelity samples on which the surrogate is based. We develop a theoretical framework to support our proposed indicator. We also present several practical approaches for the termination criterion that is used to end the greedy sampling iterations. To showcase our greedy strategy, we numerically test it in combination with the well-known Loewner framework. To this effect, we consider several benchmarks, highlighting the effectiveness of our adaptive approach in approximating the transfer function of complex systems from few samples.

Authors (1)
Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.