By Topic

Robust strict positive realness via polynomial positivity

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
$33 $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

2 Author(s)
D. M. Stipanovic ; Dept. of Electr. Eng., Santa Clara Univ., CA, USA ; D. D. Siljak

This paper attempts to convert the strictly positive real (SPR) conditions for rational functions and matrices to conditions involving only positivity of polynomials. The new polynomial formulation provides efficient SPR criteria for functions and matrices with uncertain parameters. To establish the robust SPR property it suffices to test positivity of only two uncertain polynomials for functions and three for matrices. The most interesting feature of the proposed polynomial approach is that all coefficients of the uncertain functions and matrices can have polynomial uncertainty structures. This generality is easily handled in numerical computations by applying the Bernstein expansion algorithm

Published in:

American Control Conference, 2000. Proceedings of the 2000  (Volume:6 )

Date of Conference: