1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.DS2016
Path-Complete Graphs and Common Lyapunov Functions
David Angeli, Matthew Philippe, Nikolaos Athanasopoulos +1
A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalitie…
math.DS2016
Extremal storage functions and minimal realizations of discrete-time linear switching systems
Matthew Philippe, Ray Essick, Geir Dullerud +1
We study the induced gain of discrete-time linear switching systems with graph-constrained switching sequences. We first prove that, for stable systems in a minimal…
math.DS2014★ 1 cited
Converse Lyapunov theorems for discrete-time linear switching systems with regular switching sequences
Matthew Philippe, Raphaël M. Jungers
We present a stability analysis framework for the general class of discrete-time linear switching systems for which the switching sequences belong to a regular language. They admit…