Hurwitz polynomial

Last updated

In mathematics, a Hurwitz polynomial, named after Adolf Hurwitz, is a polynomial whose roots (zeros) are located in the left half-plane of the complex plane or on the imaginary axis, that is, the real part of every root is zero or negative. [1] Such a polynomial must have coefficients that are positive real numbers. The term is sometimes restricted to polynomials whose roots have real parts that are strictly negative, excluding the imaginary axis (i.e., a Hurwitz stable polynomial). [2] [3]

Contents

A polynomial function P(s) of a complex variable s is said to be Hurwitz if the following conditions are satisfied:

1. P(s) is real when s is real.
2. The roots of P(s) have real parts which are zero or negative.

Hurwitz polynomials are important in control systems theory, because they represent the characteristic equations of stable linear systems. Whether a polynomial is Hurwitz can be determined by solving the equation to find the roots, or from the coefficients without solving the equation by the Routh–Hurwitz stability criterion.

Examples

A simple example of a Hurwitz polynomial is:

The only real solution is −1, because it factors as

In general, all quadratic polynomials with positive coefficients are Hurwitz. This follows directly from the quadratic formula:

where, if the discriminant b2−4ac is less than zero, then the polynomial will have two complex-conjugate solutions with real part −b/2a, which is negative for positive a and b. If the discriminant is equal to zero, there will be two coinciding real solutions at −b/2a. Finally, if the discriminant is greater than zero, there will be two real negative solutions, because for positive a, b and c.

Properties

For a polynomial to be Hurwitz, it is necessary but not sufficient that all of its coefficients be positive (except for quadratic polynomials, which also doesn't imply sufficiency). A necessary and sufficient condition that a polynomial is Hurwitz is that it passes the Routh–Hurwitz stability criterion. A given polynomial can be efficiently tested to be Hurwitz or not by using the Routh continued fraction expansion technique.

Related Research Articles

Complex number Element of a number system in which –1 has a square root

A complex number is a number that can be expressed in the form a + bi, where a and b are real numbers, and i represents the imaginary unit, satisfying the equation i2 = −1. Because no real number satisfies this equation, i is called an imaginary number. For the complex number a + bi, a is called the real part, and b is called the imaginary part. The set of complex numbers is denoted by either of the symbols or C. Despite the historical nomenclature "imaginary", complex numbers are regarded in the mathematical sciences as just as "real" as the real numbers, and are fundamental in many aspects of the scientific description of the natural world.

Polynomial In mathematics, sum of products of variables, power of variables, and coefficients

In mathematics, a polynomial is an expression consisting of variables and coefficients, that involves only the operations of addition, subtraction, multiplication, and non-negative integer exponentiation of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example in three variables is x3 + 2xyz2yz + 1.

In algebra, a quadratic equation is any equation that can be rearranged in standard form as

Imaginary unit Principal square root of −1

The imaginary unit or unit imaginary number is a solution to the quadratic equation x2 + 1 = 0. Although there is no real number with this property, i can be used to extend the real numbers to what are called complex numbers, using addition and multiplication. A simple example of the use of i in a complex number is 2 + 3i.

In mathematics, the discriminant of a polynomial is a quantity that depends on the coefficients and determines various properties of the roots. It is generally defined as a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number theory, and algebraic geometry. It is often denoted by the symbol .

Quadratic formula solution of the quadratic equation

In elementary algebra, the quadratic formula is a formula that provides the solution(s) to a quadratic equation. There are other ways of solving a quadratic equation instead of using the quadratic formula, such as factoring, completing the square, graphing and others.

Galois theory Mathematical connection between field theory and group theory

In mathematics, Galois theory provides a connection between field theory and group theory. Using Galois theory, certain problems in field theory can be reduced to group theory, which is in some sense simpler and better understood. It has been used to solve classic problems including showing that two problems of antiquity cannot be solved as they were stated ; showing that there is no quintic formula; and showing which polygons are constructible.

Cubic equation Polynomial equation of degree 3

In algebra, a cubic equation in one variable is an equation of the form

Quadratic function Polynomial function of degree two

In algebra, a quadratic function, a quadratic polynomial, a polynomial of degree 2, or simply a quadratic, is a polynomial function with one or more variables in which the highest-degree term is of the second degree.

In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field or ring to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial x2 − 2 is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients. It is irreducible if it is considered as a polynomial with integer coefficients, but it factors as if it is considered as a polynomial with real coefficients. One says that the polynomial x2 − 2 is irreducible over the integers but not over the reals.

Quartic function Polynomial function of degree four

In algebra, a quartic function is a function of the form

In mathematics, an algebraic equation or polynomial equation is an equation of the form

In control system theory, the Routh–Hurwitz stability criterion is a mathematical test that is a necessary and sufficient condition for the stability of a linear time invariant (LTI) control system. The Routh test is an efficient recursive algorithm that English mathematician Edward John Routh proposed in 1876 to determine whether all the roots of the characteristic polynomial of a linear system have negative real parts. German mathematician Adolf Hurwitz independently proposed in 1895 to arrange the coefficients of the polynomial into a square matrix, called the Hurwitz matrix, and showed that the polynomial is stable if and only if the sequence of determinants of its principal submatrices are all positive. The two procedures are equivalent, with the Routh test providing a more efficient way to compute the Hurwitz determinants than computing them directly. A polynomial satisfying the Routh–Hurwitz criterion is called a Hurwitz polynomial.

In mathematics, the Routh–Hurwitz theorem gives a test to determine whether all roots of a given polynomial lie in the left half-plane. Polynomials with this property are called Hurwitz stable polynomials. The Routh-Hurwitz theorem is important in dynamical systems and control theory, because the characteristic polynomial of the differential equations of a stable linear system has roots limited to the left half plane. Thus the theorem provides a test to determine whether a linear dynamical system is stable without solving the system. The Routh–Hurwitz theorem was proved in 1895, and it was named after Edward John Routh and Adolf Hurwitz.

Hopf bifurcation

In the mathematical theory of bifurcations, a Hopfbifurcation is a critical point where a system's stability switches and a periodic solution arises. More accurately, it is a local bifurcation in which a fixed point of a dynamical system loses stability, as a pair of complex conjugate eigenvalues—of the linearization around the fixed point—crosses the complex plane imaginary axis. Under reasonably generic assumptions about the dynamical system, a small-amplitude limit cycle branches from the fixed point.

Stability theory Part of mathematics that addresses the stability of solutions

In mathematics, stability theory addresses the stability of solutions of differential equations and of trajectories of dynamical systems under small perturbations of initial conditions. The heat equation, for example, is a stable partial differential equation because small perturbations of initial data lead to small variations in temperature at a later time as a result of the maximum principle. In partial differential equations one may measure the distances between functions using Lp norms or the sup norm, while in differential geometry one may measure the distance between spaces using the Gromov–Hausdorff distance.

In mathematics, a quadratic equation is a polynomial equation of the second degree. The general form is

In mathematics, a univariate polynomial of degree n with real or complex coefficients has n complex roots, if counted with their multiplicities. They form a set of n points in the complex plane. This article concerns the geometry of these points, that is the information about their localization in the complex plane that can be deduced from the degree and the coefficients of the polynomial.

In algebra, casus irreducibilis is one of the cases that may arise in attempting to solve polynomials of degree 3 or higher with integer coefficients, to obtain roots that are expressed with radicals. It shows that many algebraic numbers are real-valued but cannot be expressed in radicals without introducing complex numbers. The most notable occurrence of casus irreducibilis is in the case of cubic polynomials that are irreducible over the rational numbers and have three real roots, which was proven by Pierre Wantzel in 1843. One can decide whether a given irreducible cubic polynomial is in casus irreducibilis using the discriminant Δ, via Cardano's formula. Let the cubic equation be given by

Conic section Curve obtained by intersecting a cone and a plane

In mathematics, a conic section is a curve obtained as the intersection of the surface of a cone with a plane. The three types of conic section are the hyperbola, the parabola, and the ellipse; the circle is a special case of the ellipse, though historically it was sometimes called a fourth type. The ancient Greek mathematicians studied conic sections, culminating around 200 BC with Apollonius of Perga's systematic work on their properties.

References

  1. Kuo, Franklin F. (1966). Network Analysis and Synthesis, 2nd Ed. John Wiley & Sons. pp. 295–296. ISBN   0471511188.
  2. Weisstein, Eric W (1999). "Hurwitz polynomial". Wolfram Mathworld. Wolfram Research. Retrieved July 3, 2013.
  3. Reddy, Hari C. (2002). "Theory of two-dimensional Hurwitz polynomials". The Circuits and Filters Handbook, 2nd Ed. CRC Press. pp. 260–263. ISBN   1420041401 . Retrieved July 3, 2013.