2000 character limit reached
Optimal robustness of passive discrete time systems (1909.06871v1)
Published 15 Sep 2019 in math.OC, cs.NA, and math.NA
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.