首页> 外文期刊>Nonlinear Analysis: An International Multidisciplinary Journal >Construction of a CPA contraction metric for periodic orbits using semidefinite optimization
【24h】

Construction of a CPA contraction metric for periodic orbits using semidefinite optimization

机译:使用半定优化构造周期轨道的CPA收缩度量。

获取原文
获取原文并翻译 | 示例
           

摘要

A Riemannian metric with a local contraction property can be used to prove existence and uniqueness of a periodic orbit and determine a subset of its basin of attraction. While the existence of such a contraction metric is equivalent to the existence of an exponentially stable periodic orbit, the explicit construction of the metric is a difficult problem. In this paper, the construction of such a contraction metric is achieved by formulating it as an equivalent problem, namely a feasibility problem in semidefinite optimization. The contraction metric, a matrix-valued function, is constructed as a continuous piecewise affine (CPA) function, which is affine on each simplex of a triangulation of the phase space. The contraction conditions are formulated as conditions on the values at the vertices. The paper states a semidefinite optimization problem. We prove on the one hand that a feasible solution of the optimization problem determines a CPA contraction metric and on the other hand that the optimization problem is always feasible if the system has an exponentially stable periodic orbit and the triangulation is fine enough. An objective function can be used to obtain a bound on the largest Floquet exponent of the periodic orbit.
机译:具有局部收缩特性的黎曼度量可用于证明周期轨道的存在和唯一性,并确定其吸引盆的子集。尽管这种收缩度量的存在与指数稳定周期轨道的存在等效,但度量的显式构造是一个难题。在本文中,这种收缩度量的构建是通过将其表示为一个等效问题,即半确定优化中的可行性问题来实现的。收缩度量(矩阵值函数)构造为连续分段仿射(CPA)函数,该函数仿照在相空间的三角剖分的每个单形上。将收缩条件公式化为顶点值的条件。本文提出了一个半定优化问题。我们一方面证明了优化问题的可行解决方案确定了CPA收缩度量,另一方面证明了如果系统具有指数稳定的周期轨道并且三角剖分足够精细,则优化问题总是可行的。可以使用目标函数来获得周期轨道的最大Floquet指数的界。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号