Well-posedness of Lur'e systems with feedthrough
Chris Guiver, Hartmut Logemann

TL;DR
This paper investigates the well-posedness of Lur'e systems with feedthrough, providing conditions for existence, uniqueness, and continuation of solutions despite the complexities introduced by implicit algebraic equations.
Contribution
It introduces new sufficient conditions for well-posedness of Lur'e systems with feedthrough, addressing challenges posed by implicit algebraic equations and nonlinearities.
Findings
Established conditions for existence and uniqueness of solutions.
Demonstrated that feedthrough complicates well-posedness properties.
Provided examples illustrating theoretical results.
Abstract
For a large class of Lur'e systems with time-varying nonlinearities and feedthrough we consider several well-posedness issues, namely: existence, continuation, blow-up in finite-time, forward completeness and uniqueness of solutions. Lur'e systems with feedthrough are systems of forced, nonlinear ordinary differential equations coupled with a nonlinear algebraic equation determining the output of the system. The presence of feedthrough means that the algebraic equation is implicit in the output, and, in general, the output may not be expressible by an analytic formula in terms of the state and the input. Simple examples illustrate that the well-posedness properties of such systems are not necessarily guaranteed by assumptions sufficient for the corresponding well-posedness properties of Lur'e systems without feedthrough. We provide sufficient conditions for the well-posedness properties…
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.
