2000 character limit reached
A Lyapunov-based small-gain theorem for infinite networks
Published 28 Oct 2019 in math.OC | (1910.12746v3)
Abstract: This paper presents a small-gain theorem for networks composed of a countably infinite number of finite-dimensional subsystems. Assuming that each subsystem is exponentially input-to-state stable, we show that if the gain operator, collecting all the information about the internal Lyapunov gains, has a spectral radius less than one, the overall infinite network is exponentially input-to-state stable. The effectiveness of our result is illustrated through several examples including nonlinear spatially invariant systems with sector nonlinearities and a road traffic network.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.