Skip to main navigation Skip to search Skip to main content

Common Lyapunov function computation for discrete-time systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We describe an algorithm to compute a common Lyapunov function for a finite set of nonlinear discrete-time systems. In this algorithm a compact neighbourhood of a common equilibrium of the systems is subdivided into simplices and a linear programming problem is constructed. We prove that any feasible solution to this linear programming problem can be used to parameterize a common Lyapunov function for the systems that is continuous and affine on each of the simplices of the triangulation. We conclude the paper by applying our algorithm to two planar examples.

Original languageEnglish
Title of host publication2018 IEEE Conference on Decision and Control, CDC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3211-3216
Number of pages6
ISBN (Electronic)9781538613955
DOIs
Publication statusPublished - 18 Jan 2019
Event57th IEEE Conference on Decision and Control, CDC 2018 - Miami, United States
Duration: 17 Dec 201819 Dec 2018

Publication series

NameProceedings of the IEEE Conference on Decision and Control
Volume2018-December

Conference

Conference57th IEEE Conference on Decision and Control, CDC 2018
Country/TerritoryUnited States
CityMiami
Period17/12/1819/12/18

Bibliographical note

Publisher Copyright: © 2018 IEEE.

Fingerprint

Dive into the research topics of 'Common Lyapunov function computation for discrete-time systems'. Together they form a unique fingerprint.

Cite this