Skip to search formSkip to main contentSkip to account menu

Stable polynomial

A polynomial is said to be stable if either: * all its roots lie in the open left half-plane, or * all its roots lie in the open unit disk. The first… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
When dealing with systems with parameter uncertainty most attention is paid to robustness analysis of linear time-invariant… 
2009
2009
This note presents a new result for the guaranteed stability of polynomials under uniform non-negative polynomial mapping on the… 
2006
2006
The problem is studied of testing for stability a class of real polynomials in which the coefficients depend on a number of… 
2006
2006
A relatively optimal control is a stabilizing controller such that, if initialized at its zero state, produces the optimal… 
2004
2004
In this paper, the optimal filtering problem for nonlinear systems over linear observations with time delay is treated proceeding… 
2002
2002
A new parameterization of stable polynomials has recently been shown to facilitate robust control analysis and design. In this… 
2002
2002
This paper characterizes all controllers to a problem of simultaneous robust regulation and robust stabilization, which was left… 
2002
2002
The work considers applicability of the Earnshaw’s Theorem to superconductive magnetic systems. Differences between static… 
Review
1999
Review
1999
We survey some recent applications of Bernstein expansion to robust stability, viz. checking robust Hurwitz and Schur stability…