Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 52 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 216 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Lur'e Systems with Feedthrough Analysis

Updated 25 August 2025
  • Lur'e systems with feedthrough are feedback interconnections defined by an implicit output equation involving a direct nonlinear term, complicating standard analysis.
  • They require rigorous conditions like global invertibility and monotonicity to ensure existence, uniqueness, and forward completeness of solutions.
  • These systems are key in applications such as power systems, neural networks, and hybrid controls where instantaneous coupling and algebraic feedback are prevalent.

A Lur'e system with feedthrough is a feedback interconnection in which a finite-dimensional linear time-invariant (LTI) system is coupled in feedback with a static nonlinearity, and crucially, the nonlinearity may act on the output via an algebraic relation that includes a direct (feedthrough) term. Unlike classical Lur'e systems—where the output equation is explicit (feedthrough-free)—the presence of a direct nonlinear feedthrough creates an implicit algebraic coupling between the system's output, state, and input, significantly complicating well-posedness, analysis, and control synthesis. Such systems frequently arise in control applications where instantaneous coupling, measurement loops, or strict causality constraints are not assumed, and are also encountered in modern control of physical networks, neural, biological, and quantum systems. Recent advances have focused on establishing existence, uniqueness, continuation, and forward completeness of solutions to Lur'e systems with feedthrough under minimal and verifiable analytical conditions (Guiver et al., 22 Aug 2025).

1. Mathematical Structure and Characterization

A general Lur'e system with feedthrough is described by the coupled equations: x˙(t)=Ax(t)+Bf(t,y(t))+Bev(t), y(t)=Cx(t)+Df(t,y(t))+Dev(t),\begin{aligned} \dot{x}(t) &= A x(t) + B f(t, y(t)) + B_e v(t), \ y(t) &= C x(t) + D f(t, y(t)) + D_e v(t), \end{aligned} where x(t)Rnx(t) \in \mathbb{R}^n is the state, y(t)Rpy(t) \in \mathbb{R}^p is the output, v(t)v(t) is an exogenous input, and ff is a (possibly time-varying) nonlinearity. The presence of D0D \neq 0 (the feedthrough term) results in output equations which are implicit in y(t)y(t): y(t)=Cx(t)+Df(t,y(t))+Dev(t).y(t) = C x(t) + D f(t, y(t)) + D_e v(t). For a fixed state and input, yy solves Ft(y)=Cx+DevF_t(y) = Cx + D_e v where Ft(y)=yDf(t,y)F_t(y) = y - D f(t, y). If D=0D = 0, this reduces to the classic feedthrough-free case y(t)=Cx(t)+Dev(t)y(t) = C x(t) + D_e v(t).

Feedthrough arises naturally in models where measurement, interconnection, or energy flows are not strictly delayed, as in power systems, biomedical circuits, analog and mixed-signal controllers, or networks with high-frequency or algebraic coupling.

2. Well-posedness: Existence, Uniqueness, and Continuation

Well-posedness of Lur'e systems with feedthrough is nontrivial due to the implicit definition of y(t)y(t). The principal issues are:

  • Existence: For initial condition x(0)=x0x(0) = x_0 and input v()v(\cdot), does a solution pair (x(),y())(x(\cdot), y(\cdot)) exist on an interval?
  • Uniqueness: Is the solution unique, or can multiple solutions arise from the same initial state and input?
  • Continuation / Forward Completeness: Can maximal solutions be continued for all future times (i.e., global existence), or do solutions blow up in finite time?

While, for feedthrough-free systems, global existence and uniqueness can often be guaranteed by standard Lipschitz conditions on ff, in the presence of feedthrough this is generally insufficient (Guiver et al., 22 Aug 2025). Simple examples demonstrate absence of solutions (non-surjectivity of FtF_t), non-uniqueness (multiple preimages under FtF_t), or finite-time blowup even when ff is globally Lipschitz.

Sufficient conditions ensuring well-posedness include:

  • Global Invertibility: For each tt, the map Ft:RpRpF_t: \mathbb{R}^p \to \mathbb{R}^p is a homeomorphism (e.g., via uniform monotonicity or lower Lipschitz conditions on ff), together with local Lipschitz and boundedness.
  • Radial Unboundedness: Ft(ξ)\|F_t(\xi)\| \to \infty as ξ\|\xi\| \to \infty (uniformly on compacts of tt), preventing solution escape in finite time.
  • Set-valued Formulations: If FtF_t is not invertible, the system can be recast as a differential inclusion using measurable selections and upper semicontinuity techniques from nonsmooth analysis. This ensures existence, and—under further monotonicity of the set-valued feedback—uniqueness.

Table 1 summarizes the key scenarios:

Structural Property of FtF_t Well-posedness Result
Globally injective, radially unbounded, Carathéodory ff Existence and uniqueness. Blow-up iff state or ff diverges.
Non-invertible but set-valued, Carathéodory ff, convex Ft1F_t^{-1} fibers Existence of maximal solution. Uniqueness under monotonicity.

3. Mathematical and Analytical Framework

The analysis employs a blend of classical ODE theory, global inversion theorems, and tools from differential inclusions.

  • When FtF_t is invertible, one may define g(t,ξ)=Ft1(ξ)g(t, \xi) = F_t^{-1}(\xi) and rewrite the system as a standard ODE in xx, replacing yy by y=g(t,Cx+Dev)y = g(t, Cx+D_ev), and defining an effective nonlinearity h(t,x)=f(t,y)h(t, x) = f(t, y).
  • For set-valued inverses Ft1F_t^{-1}, the system is formulated as a differential inclusion

x˙(t)Ax(t)+Bh(t,x(t)),\dot{x}(t) \in A x(t) + B h(t, x(t)),

with h(t,x)={f(t,y):yFt1(Cx(t)+Dev(t))}h(t, x) = \{ f(t, y): y \in F_t^{-1}(Cx(t) + D_e v(t)) \}, and measurable selection theorems (e.g., Filippov's theorem) are invoked to establish solution properties.

  • Lower Lipschitz constant conditions:

minζf(t,ξ)IDζc>0\min_{\zeta \in \partial f(t, \xi)} \|I - D \zeta\| \geq c > 0

provide uniform invertibility of FtF_t via Clarke's generalized derivative (for nonsmooth ff), a critical condition for well-posedness.

4. Illustrative Counterexamples and Structural Pitfalls

The pathological behaviors are illustrated by explicit examples (Guiver et al., 22 Aug 2025):

  • Non-existence: There are time-varying, piecewise-affine nonlinearities with feedthrough such that, for some initial states, the output equation y=Cx+Df(t,y)y = Cx + D f(t, y) has no solution (the range of FtF_t does not cover Rp\mathbb{R}^p).
  • Non-uniqueness: Piecewise-linear ff with feedthrough may lead to multiple values of yy solving the same output equation for fixed xx and vv, resulting in non-unique system trajectories.
  • Finite-time Blow-up: Even with globally Lipschitz ff, the algebraic part can experience finite-time singularity, where solution norms diverge as the trajectory approaches a non-invertible point of FtF_t.
  • Feedthrough-free contrast: For comparison, in the absence of feedthrough, classical ODE theory applies (uniqueness, continuation by Grönwall or Cauchy–Lipschitz) under weaker regularity conditions.

These examples underscore that standard "feedforward" well-posedness and robustness guarantees do not extend automatically to the feedthrough case.

5. Sufficient Conditions via Invertibility and Monotonicity

The main sufficient conditions for well-posedness are formulated in terms of properties of the mapping Ft(y)=yDf(t,y)F_t(y) = y - D f(t, y):

  • Uniform local injectivity of FtF_t (for all yy and tt in compact intervals), or more generally, that the lower Clarke derivative (or the minimal singular value of IDfI - D \partial f) remains bounded away from zero.
  • Radial unboundedness (the norm of Ft(y)F_t(y) grows at infinity), to prevent finite escape.
  • Convexity of fibers of Ft1(Cx+Dev)F_t^{-1}(Cx + D_e v), facilitating selection of measurable branches for existence.
  • Monotonicity of ff in yy (or sector boundedness), i.e., inner product f(t,y)f(t,y),yy0\langle f(t, y) - f(t, y'), y - y' \rangle \geq 0, ensures uniqueness in the set-valued context.

Notably, invertibility of IDζI - D \zeta for all subgradients ζf\zeta \in \partial f is operationally analogous to nonsingularity of the linear algebraic constraint in the classic case, and arises in Lyapunov and LMI-based analysis.

6. Implications for Analysis, Controller Synthesis, and Applications

The rigorous theory for Lur’e systems with feedthrough illuminates several aspects:

  • Extension of Absolute Stability Criteria: Classical circle and Popov criteria, which depend critically on standard output equations, cannot be directly transferred; passivity-type conditions and Lyapunov-based arguments require adaptation to implicit output mappings and algebraic constraints.
  • Robustness and Design: Controller and filter design procedures for nonlinear circuits, biological systems, or networks with algebraic feedback must ensure that their feedback interconnections satisfy invertibility or monotonicity conditions for the resulting coupled algebraic equations.
  • Nonlinear Networks and Neural Models: Non-unique, non-existent, or explosive behaviors in neural architectures or hybrid physical systems often trace back to failures of global invertibility or monotonicity in the feedthrough mapping.

The analytical framework is crucial for constraining model classes in robust design and networked control applications, ensuring that adverse behaviors associated with feedthrough are avoided, and providing verifiable criteria for closed-loop correctness.

7. Extensions and Connections to Differential Inclusions and Nonsmooth Analysis

The methodology naturally generalizes to systems with nonsmooth dynamics, time-varying or set-valued nonlinearities, and even hybrid inclusions.

  • Set-valued feedbacks: The differential inclusion framework accommodates feedbacks defined via maximally monotone operators, subdifferentials, or normal cones (as in projected dynamics or network equilibria).
  • Lyapunov Stability and ISS: The adaptation of Lyapunov and passivity arguments to systems with feedthrough leverages convexity, monotonicity, and sector conditions on the nonlinearity, often encoded in algebraic and incremental dissipativity properties.
  • Applications in Uncertain and Data-driven Models: The well-posedness results provide a mathematical basis for data-driven and neural network feedback system design, where identification or learning may produce models with implicit or non-invertible feedthrough structure.

The paper of Lur'e systems with feedthrough thus requires a departure from standard ODE and feedback theory. Global invertibility and monotonicity conditions on the output equation's implicit map FtF_t, as detailed in (Guiver et al., 22 Aug 2025), form the basis for ensuring existence, uniqueness, and robustness properties in such systems. This has direct ramifications for mathematical modeling and synthesis in energy systems, cyber-physical networks, and nonlinear circuit and control architectures where direct feedthrough cannot be neglected.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)