A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials

Authors:

1 January 1995

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 5, 3856-3858
DOI:10.1109/acc.1995.533863

Abstract

The problem of checking robust stability of a polytope of polynomials is equivalent to a zero exclusion condition at each frequency. In this paper, we show that this problem can be formulated as two continuous knapsack problems with bounded variables, which are solvable in /spl Oscr/(n) time.

Keywords

This publication has 4 references indexed in Scilit:

A generalization of Kharitonov's four-polynomial concept for robust stability problems with linearly dependent coefficient perturbations
IEEE Transactions on Automatic Control, 1989
Some results on robust stability of discrete-time systems
IEEE Transactions on Automatic Control, 1988
The stability of polynomials under correlated coefficient perturbations
1987
An Algorithm for Large Zero-One Knapsack Problems
Operations Research, 1980