Speaker: James Anderson (University of Oxford)

Title: Computational Stability Analysis Using Convex Optimization and Graph Decompositions

Abstract: In this talk I will consider the problem of computational stability analysis of large-scale dynamical systems modelled by sets of coupled ordinary differential equations. Using techniques from convex optimization and algebraic graph theory it will be shown how stability certificates for nonlinear (polynomial) systems can be constructed using the sum-of-squares decomposition. After introducing the SOS framework it will be shown how chordal graph decompositions allow for the analysis to be carried out on systems with a much larger state-dimension than was previously possible with a direct approach.