Computing a basin of attraction to a target region by solving bilinear semi-definite problems

  • Authors:
  • Zhikun She;Bai Xue

  • Affiliations:
  • SKLSDE, LMIB and School of Mathematics and Systems Science, Beihang University, China;SKLSDE, LMIB and School of Mathematics and Systems Science, Beihang University, China

  • Venue:
  • CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a sum of squares programming based method for computing a basin of attraction to a target region as large as possible by iteratively searching for Lyapunov-like functions. We start with the basic mathematical notions and show how attraction to a target region can be ensured by Lyapunov-like functions. Then, we present an initial framework for getting an increasing sequence of basins of attraction by iteratively computing Lyapunov-like functions. This framework can be realized by solving bilinear semi-definite problems based on sums of squares decomposition. We implement our algorithm and test it on some interesting examples. The computation results show the usefulness of our method.