Incremental Gain Computation and Regulation of Discrete-time Positive Lur\'e Systems using Linear Programming
Abstract
This work approaches the problem of computing incremental 1 and ∞ gains for discrete-time positive systems in feedback with static memoryless nonlinearities, and regulating the ∞ gain through the design of a state-feedback controller. Finite incremental gains provide a quantitative measure of robustness for trajectories, and will ensure that all pairs of trajectories will converge to a fixed point or will diverge together in the absence of an applied input. Upper-bounds on these incremental gains can be computed through linear programming. Computation and regulation of the 1 and ∞ incremental gains are verified by numerical examples.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.