de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Semi-Algebraic Approach for the Computation of Lyapunov Functions

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45471

She,  Zhikun
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45764

Xia,  Bican
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

She, Z., Xia, B., & Xiao, R. (2006). A Semi-Algebraic Approach for the Computation of Lyapunov Functions. In 2th IASTED International Conference on COMPUTATIONAL INTELLIGENCE. Canada: ACTA Press.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2223-C
Abstract
In this paper we deal with the problem of computing Lya punov functions for stability verification of differential sys tems. We concern on symbolic methods and start the dis cussion with a classical quantifier elimination model for computing Lyapunov functions in a given polynomial form, especially in quadratic forms. Then we propose a new semi-algebraic method by making advantage of the local property of the Lyapunov function as well as its deriva tive. This is done by first using real solution classifica tion to construct a semi-algebraic system and then solving this semi-algebraic system. Our semi-algebraic approach is more efficient in practice, especially for low-order systems. This efficiency will be evaluated empirically.