# Stable polynomial

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 condition defines Hurwitz (or continuous-time) stability and the second one Schur (or discrete-time) stability. Stable polynomials arise in various mathematical fields, for example in control theory and differential equations. Indeed, a linear, time-invariant system (see LTI system theory) is said to be BIBO stable if and only if bounded inputs produce bounded outputs; this is equivalent to requiring that the denominator of its transfer function (which can be proven to be rational) is stable. The denominator is required to be Hurwitz stable if the system is in continuous-time and Schur stable if it is in discrete-time. Stable polynomials are sometimes called Hurwitz polynomials and Schur polynomials.

Properties

* The Routh-Hurwitz theorem provides an algorithm for determining if a given polynomial is Hurwitz stable. To test if a given polynomial "P" (of degree "d") is Schur stable, it suffices to apply this theorem to the transformed polynomial

:$Q\left(z\right)=\left(z-1\right)^d Pleft\left($z+1}over{z-1 ight)

obtained after the Möbius transformation $z mapsto$z+1}over{z-1 which maps the left half-plane to the open unit disc: "P" is Schur stable if and only if "Q" is Hurwitz stable.

* Necessary condition: a Hurwitz stable polynomial (with real coefficients) has coefficients of the same sign (either all positive or all negative).

* Sufficient condition: a polynomial $f\left(z\right)=a_0+a_1 z+cdots+a_n z^n$ with (real) coefficients such that::$a_n>a_\left\{n-1\right\}>cdots>a_0>0,$is Schur stable.

* Product rule: Two polynomials "f" and "g" are stable (of the same type) if and only if the product "fg" is stable.

Examples

* $4z^3+3z^2+2z+1$ is Schur stable because it satisfies the sufficient condition;
* $z^\left\{10\right\}$ is Schur stable (because all its roots equal 0) but it does not satisfy the sufficient condition;
* $z^2-z-2$ is not Hurwitz stable (its roots are -1,2) because it violates the necessary condition;
* $z^2+3z+2$ is Hurwitz stable (its roots are -1,-2).
* The polynomial $z^4+z^3+z^2+z+1$ (with positive coefficients) is neither Hurwitz stable nor Schur stable. Its roots are the four primitive fifth roots of unity

::$z_k=cosleft\left($2pi k}over 5} ight)+i sinleft(2pi k}over 5} ight), , k=1, ldots, 4 .

:Note here that

::$cos\left($2pi}/5})=sqrt{5}-1}over 4}>0.

:It is a "boundary case" for Schur stability because its roots lie on the unit circle. The example also shows that the necessary (positivity) conditions stated above for Hurwitz stability are not sufficient.

ee also

* [http://mathworld.wolfram.com/StablePolynomial.html Mathworld page]

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Stable (disambiguation) — Stable may refer to: *stable, a building in which livestock, usually horses, are kept. ** Stable, in professional wrestling, a group of wrestlers within a promotion who have a common element *the attribute of stability ** Chemically stable **… …   Wikipedia

• Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… …   Wikipedia

• Hurwitz polynomial — In mathematics, a Hurwitz polynomial, named after Adolf Hurwitz, is a polynomial whose coefficients are positive real numbers and whose zeros are located in the left half plane of the complex plane, that is, the real part of every zero is… …   Wikipedia

• Wilkinson's polynomial — In numerical analysis, Wilkinson s polynomial is a specific polynomial which was used by James H. Wilkinson in 1963 to illustrate a difficulty when finding the root of a polynomial: the location of the roots can be very sensitive to perturbations …   Wikipedia

• Minimal polynomial (linear algebra) — For the minimal polynomial of an algebraic element of a field, see Minimal polynomial (field theory). In linear algebra, the minimal polynomial μA of an n by n matrix A over a field F is the monic polynomial P over F of least degree such that… …   Wikipedia

• Bernstein polynomial — In the mathematical field of numerical analysis, a Bernstein polynomial, named after Sergei Natanovich Bernstein, is a polynomial in the Bernstein form, that is a linear combination of Bernstein basis polynomials.A numerically stable way to… …   Wikipedia

• Numerical polynomial — In mathematics, a numerical polynomial is a polynomial with rational coefficients that takes integer values on integers. They are also called integer valued polynomials. They are objects of study in their own right in algebra, and are frequently… …   Wikipedia

• List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

• Routh-Hurwitz stability criterion — The Routh Hurwitz stability criterion is a necessary (and frequently sufficient) method to establish the stability of a single input, single output (SISO), linear time invariant (LTI) control system. More generally, given a polynomial, some… …   Wikipedia

• Stability radius — The stability radius of a continuous function f (in a functional space F ) with respect to an open stability domain D is the distance between f and the set of unstable functions (with respect to D ). We say that a function is stable with respect… …   Wikipedia