arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.3427math.OCcs.SYeess.SY
收藏

联合谱半径与路径完全图Lyapunov函数

Joint Spectral Radius and Path-Complete Graph Lyapunov Functions

Massachusetts Institute of Technology(麻省理工学院);Université catholique de Louvain(天主教鲁汶大学)

Amir Ali Ahmadi, Raphaël Jungers, Pablo A. Parrilo, Mardavij Roozbehani

AI总结:

提出路径完全图Lyapunov函数框架来逼近联合谱半径,通过带标记有向图上的多个Lyapunov函数不等式分析切换系统稳定性,统一并推广了多种现有方法,并提供了若干图族的逼近保证。

摘要:

我们引入了路径完全图Lyapunov函数的框架来逼近联合谱半径。该方法基于通过关联到带标记有向图上的多个Lyapunov函数之间施加的不等式来分析底层切换系统。受自动机理论和符号动力学概念的启发,我们定义了一类称为路径完全图的图,并表明任何这样的图都提供了一种证明切换系统稳定性的方法。这使我们能够推导出几个渐近紧的半定规划松弛层次结构,这些层次结构统一并推广了许多现有技术,如公共二次型、公共平方和以及最大值/最小值二次型Lyapunov函数。我们比较了某些类别的路径完全图(包括对偶图族和两个矩阵字母表上具有两个节点的所有路径完全图)所获得的逼近质量。我们为几个路径完全图族(如De Bruijn图)提供了逼近保证,并作为副产品建立了最大值/最小值二次型Lyapunov函数的构造性逆Lyapunov定理。

英文摘要:

We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is based on the analysis of the underlying switched system via inequalities imposed among multiple Lyapunov functions associated to a labeled directed graph. Inspired by concepts in automata theory and symbolic dynamics, we define a class of graphs called path-complete graphs, and show that any such graph gives rise to a method for proving stability of the switched system. This enables us to derive several asymptotically tight hierarchies of semidefinite programming relaxations that unify and generalize many existing techniques such as common quadratic, common sum of squares, and maximum/minimum-of-quadratics Lyapunov functions. We compare the quality of approximation obtained by certain classes of path-complete graphs including a family of dual graphs and all path-complete graphs with two nodes on an alphabet of two matrices. We provide approximation guarantees for several families of path-complete graphs, such as the De Bruijn graphs, establishing as a byproduct a constructive converse Lyapunov theorem for maximum/minimum-of-quadratics Lyapunov functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑