On the Necessity and Sufficiency of Discrete-Time O'Shea-Zames-Falb Multipliers
This paper considers the robust stability of a discrete-time Lurye system consisting of the feedback interconnection between a linear system and a bounded and monotone nonlinearity. It has been conjectured that the existence of a suitable linear time-invariant (LTI) O'Shea-Zames-Falb multiplier is not only sufficient but also necessary. Roughly speaking, a successful proof of the conjecture would require: (a) a conic parameterization of a set of multipliers that describes exactly the set of nonlinearities, (b) a lossless S-procedure to show that the non-existence of a multiplier implies that the Lurye system is not uniformly robustly stable over the set of nonlinearities, and (c) the existence of a multiplier in the set of multipliers used in (a) implies the existence of an LTI multiplier. We investigate these three steps, showing the current bottlenecks for proving this conjecture. In addition, we provide an extension of the class of multipliers which may be used to disprove the conjecture.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On the Necessity and Sufficiency of the Zames-Falb Multipliers for Bounded Operators
This paper analyzes the robust feedback stability of a single-input-single-output stable linear time-invariant (LTI) system against four different classes of nonlinear systems using the Zames-Falb multipliers. The contri…
Beyond Sufficiency: Time Series Explanation with Counterfactual Necessity
Faithful explanations of time-series classifiers should identify subsequences that are not only sufficient to preserve a black-box model's prediction, but also necessary for maintaining it. However, existing sufficiency-…
Zames-Falb Multipliers: don't panic
Zames-Falb multipliers are mathematical constructs which can be used to prove stability of so-called Lur'e systems: systems that consist of a feedback interconnection of a linear element and a static nonlinear element. T…
Linear systems with neural network nonlinearities: Improved stability analysis via acausal Zames-Falb multipliers
In this paper, we analyze the stability of feedback interconnections of a linear time-invariant system with a neural network nonlinearity in discrete time. Our analysis is based on abstracting neural networks using integ…
Computational EfficiencySufficient and Necessary Barrier-like Conditions for Safety and Reach-avoid Verification of Stochastic Discrete-time Systems
In this paper, we examine necessary and sufficient barrier-like conditions for infinite-horizon safety verification and reach-avoid verification of stochastic discrete-time systems, derived through a relaxation of Bellma…