2000 character limit reached
Finding cones for K-cooperative systems
Published 19 Mar 2019 in math.OC and cs.SY | (1903.07924v2)
Abstract: We design and test a cone finding algorithm to robustly address nonlinear system analysis through differential positivity. The approach provides a numerical tool to study multi-stable systems, beyond Lyapunov analysis. The theory is illustrated on two examples: a consensus problem with some repulsive interactions and second order agent dynamics, and a controlled duffing oscillator.
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.