Optimal robustness of passive discrete time systems
Volker Mehrmann, Paul Van Dooren

TL;DR
This paper develops methods to construct the most robust passive discrete-time systems from a given transfer function and finds the closest passive system to a non-passive one, using linear matrix inequalities.
Contribution
It introduces a novel approach to optimize robustness of passive systems and links it to linear matrix inequalities, also addressing the nearest passive system problem.
Findings
Constructed optimally robust passive realizations.
Linked robustness to linear matrix inequalities.
Provided methods to find the nearest passive system.
Abstract
We construct optimally robust realizations of a given rational transfer function that represents a passive discrete-time system. We link it to the solution set of linear matrix inequalities defining passive transfer functions. We also consider the problem of finding the nearest passive system to a given non-passive one.
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.
