By Topic

Determining the closest stable polynomial to an unstable one

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)
R. L. Moses ; Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA ; D. Liu

The problem of being given a polynomial whose zeros do not all lie on or inside the unit circle and finding the closest polynomial whose zeros are all on or inside the unit circle is considered. The measure of closeness used is the weighted Euclidean distance in coefficient space. The algorithm can be extended to other measures of closeness as well. Because the direct minimization on the coefficient space is difficult, the problem is approached in Schur coefficient space. In this way, the stability condition is easily guaranteed. A very efficient algorithm for obtaining the optimum solution is developed

Published in:

IEEE Transactions on Signal Processing  (Volume:39 ,  Issue: 4 )