By Topic

Sum-of-squares polynomials and the stability of discrete-time systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dumitrescu, B. ; Tampere Int. Center for Signal Process., Tampere Univ. of Technol., Finland

The purpose of this paper is to gather several applications of sum-of-squares polynomials in analyzing the stability of discrete-time systems, as well as to present a new one. We review a stability test for multidimensional systems. Also, a method to describe a convex stability domain is presented in the general case. The new application regards a robust stability test for polynomials whose coefficients depend polynomially on some bounded parameters. The test uses a Positivstellensatz relaxation in the form of a semidefinite programming problem. We give some examples and point out possible applications.

Published in:

Multidimensional Systems, 2005. NDS 2005. The Fourth International Workshop on

Date of Conference:

10-13 July 2005