ROUTH S STABILITY CRITERION



Similar documents
Understanding Poles and Zeros

2.3. Finding polynomial functions. An Introduction:

3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

POLYNOMIAL FUNCTIONS

Zeros of a Polynomial Function

Root Computations of Real-coefficient Polynomials using Spreadsheets*

Zeros of Polynomial Functions

Zeros of Polynomial Functions

SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS

ALGEBRA 2: 4.1 Graph Quadratic Functions in Standard Form

is the degree of the polynomial and is the leading coefficient.

Section 5.0A Factoring Part 1

expression is written horizontally. The Last terms ((2)( 4)) because they are the last terms of the two polynomials. This is called the FOIL method.

Zeros of Polynomial Functions

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Unit 6: Polynomials. 1 Polynomial Functions and End Behavior. 2 Polynomials and Linear Factors. 3 Dividing Polynomials

First, we show how to use known design specifications to determine filter order and 3dB cut-off

1.3 Algebraic Expressions

Alum Rock Elementary Union School District Algebra I Study Guide for Benchmark III

Algebra Practice Problems for Precalculus and Calculus

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:

ALGEBRA 2 CRA 2 REVIEW - Chapters 1-6 Answer Section

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

Algebra 2 Year-at-a-Glance Leander ISD st Six Weeks 2nd Six Weeks 3rd Six Weeks 4th Six Weeks 5th Six Weeks 6th Six Weeks

Root Locus. E(s) K. R(s) C(s) 1 s(s+a) Consider the closed loop transfer function:

Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

Roots of Polynomials

Algebra II A Final Exam

Polynomial and Synthetic Division. Long Division of Polynomials. Example 1. 6x 2 7x 2 x 2) 19x 2 16x 4 6x3 12x 2 7x 2 16x 7x 2 14x. 2x 4.

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

CRLS Mathematics Department Algebra I Curriculum Map/Pacing Guide

3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

EAP/GWL Rev. 1/2011 Page 1 of 5. Factoring a polynomial is the process of writing it as the product of two or more polynomial factors.

Method To Solve Linear, Polynomial, or Absolute Value Inequalities:

Lecture 5 Rational functions and partial fraction expansion

Factoring Polynomials and Solving Quadratic Equations

3.6. Partial Fractions. Introduction. Prerequisites. Learning Outcomes

Determinants can be used to solve a linear system of equations using Cramer s Rule.

What are the place values to the left of the decimal point and their associated powers of ten?

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

Solving Quadratic Equations

SOLVING POLYNOMIAL EQUATIONS

Polynomial Degree and Finite Differences

5. Factoring by the QF method

is identically equal to x 2 +3x +2

Review of Intermediate Algebra Content

SECTION 2.5: FINDING ZEROS OF POLYNOMIAL FUNCTIONS

4.1. COMPLEX NUMBERS

Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.

How To Understand And Solve Algebraic Equations

Answer Key for California State Standards: Algebra I

Integrals of Rational Functions

Linear Equations in One Variable

5.1 Radical Notation and Rational Exponents

Higher Education Math Placement

Exponents and Radicals

Vocabulary Words and Definitions for Algebra

Sect Solving Equations Using the Zero Product Rule

Polynomials and Factoring

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

MATH 21. College Algebra 1 Lecture Notes

Polynomials. Teachers Teaching with Technology. Scotland T 3. Teachers Teaching with Technology (Scotland)

Indiana State Core Curriculum Standards updated 2009 Algebra I

6-3 Solving Systems by Elimination

Year 9 set 1 Mathematics notes, to accompany the 9H book.

Students Currently in Algebra 2 Maine East Math Placement Exam Review Problems

MA107 Precalculus Algebra Exam 2 Review Solutions

0.4 FACTORING POLYNOMIALS

MAC Learning Objectives. Module 10. Polar Form of Complex Numbers. There are two major topics in this module:

The degree of a polynomial function is equal to the highest exponent found on the independent variables.

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA

Quadratics - Build Quadratics From Roots

Algebra 2: Q1 & Q2 Review

Algebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.

Algebra II End of Course Exam Answer Key Segment I. Scientific Calculator Only

Algebra 1 If you are okay with that placement then you have no further action to take Algebra 1 Portion of the Math Placement Test

2.5 ZEROS OF POLYNOMIAL FUNCTIONS. Copyright Cengage Learning. All rights reserved.

Core Maths C1. Revision Notes

Brunswick High School has reinstated a summer math curriculum for students Algebra 1, Geometry, and Algebra 2 for the school year.

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

Solving certain quintics

Answers to Basic Algebra Review

6.1 Add & Subtract Polynomial Expression & Functions

3 Orthogonal Vectors and Matrices

Linear Programming Problems

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

7.1 Graphs of Quadratic Functions in Vertex Form

Algebra 1 Course Title

Solution of Linear Systems

PYTHAGOREAN TRIPLES KEITH CONRAD

1 Lecture: Integration of rational functions by decomposition

LAB 11: MATRICES, SYSTEMS OF EQUATIONS and POLYNOMIAL MODELING

This is a square root. The number under the radical is 9. (An asterisk * means multiply.)

This unit has primarily been about quadratics, and parabolas. Answer the following questions to aid yourselves in creating your own study guide.

Florida Algebra 1 End-of-Course Assessment Item Bank, Polk County School District

G(s) = Y (s)/u(s) In this representation, the output is always the Transfer function times the input. Y (s) = G(s)U(s).

IOWA End-of-Course Assessment Programs. Released Items ALGEBRA I. Copyright 2010 by The University of Iowa.

Solving Cubic Polynomials

Transcription:

ECE 680 Modern Automatic Control Routh s Stability Criterion June 13, 2007 1 ROUTH S STABILITY CRITERION Consider a closed-loop transfer function H(s) = b 0s m + b 1 s m 1 + + b m 1 s + b m a 0 s n + s n 1 + + a n 1 s + a n = B(s) A(s) where the a i s and b i s are real constants and m n An alternative to factoring the denominator polynomial, Routh s stability criterion, determines the number of closedloop poles in the right-half s plane (1) Algorithm for applying Routh s stability criterion The algorithm described below, like the stability criterion, requires the order of A(s) to be finite 1 Factor out any roots at the origin to obtain the polynomial, and multiply by 1 if necessary, to obtain where a 0 0 and a n > 0 a 0 s n + s n 1 + + a n 1 s + a n = 0 (2) 2 If the order of the resulting polynomial is at least two and any coefficient a i is zero or negative, the polynomial has at least one root with nonnegative real part To obtain the precise number of roots with nonnegative real part, proceed as follows Arrange the coefficients of the polynomial, and values subsequently calculated from them as shown below: s n a 0 a 2 a 4 a 6 s n 1 a 3 a 5 a 7 s n 2 b 1 b 2 b 3 b 4 s n 3 c 1 c 2 c 3 c 4 s n 4 d 1 d 2 d 3 d 4 (3) s 2 e 1 e 2 s 1 f 1 s 0 g 0 where the coefficients b i are b 1 = a 2 a 0 a 3 (4) b 2 = a 4 a 0 a 5 (5) b 3 = a 6 a 0 a 7 (6)

ECE 680 Modern Automatic Control Routh s Stability Criterion June 13, 2007 2 generated until all subsequent coefficients are zero Similarly, cross multiply the coefficients of the two previous rows to obtain the c i, d i, etc c 1 = b 1a 3 b 2 b 1 (7) c 2 = b 1a 5 b 3 b 1 (8) c 3 = b 1a 7 b 4 b 1 (9) d 1 = c 1b 2 b 1 c 2 c 1 (10) d 2 = c 1b 3 b 1 c 3 c 1 (11) until the nth row of the array has been completed 1 Missing coefficients are replaced by zeros The resulting array is called the Routh array The powers of s are not considered to be part of the array We can think of them as labels The column beginning with a 0 is considered to be the first column of the array The Routh array is seen to be triangular It can be shown that multiplying a row by a positive number to simplify the calculation of the next row does not affect the outcome of the application of the Routh criterion 3 Count the number of sign changes in the first column of the array It can be shown that a necessary and sufficient condition for all roots of (2) to be located in the left-half plane is that all the a i are positive and all of the coefficients in the first column be positive Example: Generic Quadratic Polynomial Consider the quadratic polynomial: a 0 s 2 + s + a 2 = 0 (12) where all the a i are positive The array of coefficients becomes (13) s 2 a 0 a 2 s 1 0 s 0 a 2 1 There is one important detail that we have not yet mentioned If an element of the first column becomes zero, we must alter the procedure Since this altered procedure is requires some explanation, we postpone discussion of it to a pair of subsections below

ECE 680 Modern Automatic Control Routh s Stability Criterion June 13, 2007 3 where the coefficient is the result of multiplying by a 2 and subtracting a 0 (0) then dividing the result by a 2 In the case of a second order polynomial, we see that Routh s stability criterion reduces to the condition that all a i be positive Example: Generic Cubic Polynomial Consider the generic cubic polynomial: where all the a i are positive The Routh array is so the condition that all roots have negative real parts is a 0 s 3 + s 2 + a 2 s + a 3 = 0 (14) s 3 a 0 a 2 s 2 a 3 s 1 a 2 a 0 a 3 (15) s 0 a 3 a 2 > a 0 a 3 (16) Example: A Quartic Polynomial Next we consider the fourth-order polynomial: s 4 + 2s 3 + 3s 2 + 4s + 5 = 0 (17) Here we illustrate the fact that multiplying a row by a positive constant does not change the result One possible Routh array is given at left, and an alternative is given at right, s 4 1 3 5 s 3 2 4 0 s 2 1 5 s 1 6 s 0 5 s 4 1 3 5 s 3 2 4 0 Divide this row by two to get 1 2 0 s 2 1 5 s 1 3 s 0 5 In this example, the sign changes twice in the first column so the polynomial equation A(s) = 0 has two roots with positive real parts Necessity of all coefficients being positive In stating the algorithm above, we did not justify the stated conditions Here we show that all coefficients being positive is necessary for all roots to be located in the left halfplane It can be shown that any polynomial in s, all of whose coefficients are real, can

ECE 680 Modern Automatic Control Routh s Stability Criterion June 13, 2007 4 be factored into a product of a maximal number linear and quadratic factors also having real coefficients Clearly a linear factor (s + a) has nonnegative real root iff a is positive For both roots of a quadratic factor (s 2 + bs + c) to have negative real parts both b and c must be positive (If c is negative, the square root of b 2 4c is real and the quadratic factor can be factored into two linear factors so the number of factors was not maximal) It is easy to see that if all coefficients of the factors are positive, those of the original polynomial must be as well To see that the condition is not sufficient, we can refer to several examples above Example: Determining Acceptable Gain Values So far we have discussed only one possible application of the Routh criterion, namely determining the number of roots with nonnegative real parts In fact, it can be used to determine limits on design parameters, as shown below Consider a system whose closed-loop transfer function is The characteristic equation is The Routh array is H(s) = K s(s 2 + s + 1)(s + 2) + K (18) s 4 + 3s 3 + 3s 2 + 2s 4 + K = 0 (19) s 4 1 3 K s 3 3 2 0 s 2 7/3 K s 1 2 9K/7 s 0 K so the s 1 row yields the condition that, for stability, (20) 14/9 > K > 0 (21) Special Case: Zero First-Column Element If the first term in a row is zero, but the remaining terms are not, the zero is replaced by a small, positive value of ɛ and the calculation continues as described above Here s an example: s 3 + 2s 2 + s + 2 = 0 (22) has Routh array s 3 1 1 s 2 2 2 s 1 0 = ɛ s 0 2 (23)

ECE 680 Modern Automatic Control Routh s Stability Criterion June 13, 2007 5 where the last element of the first column is equal 2 = (ɛ2 0)/ɛ In counting changes of sign, the row beginning with ɛ is not counted If the elements above and below the ɛ in the first column have the same sign, a pair of imaginary roots is indicated Here, for example, (22) has two roots at s = ±j On the other hand, if the elements above and below the ɛ have opposite signs, this counts as a sign change For example, has Routh array with two sign changes in the first column s 3 3s + 2 = (s 2 1)(s + 2) = 0 (24) s 3 1 3 s 2 0 = ɛ 2 s 1 3 2/ɛ s 0 2 Special Case: Zero Row If all the coefficients in a row are zero, a pair of roots of equal magnitude and opposite sign is indicated These could be two real roots with equal magnitudes and opposite signs or two conjugate imaginary roots The zero row is replaced by taking the coefficients of dp (s)/ds, where P (s), called the auxiliary polynomial, is obtained from the values in the row above the zero row The pair of roots can be found by solving dp (s)/ds = 0 Note that the auxiliary polynomial always has even degree It can be shown that an auxiliary polynomial of degree 2n has n pairs of roots of equal magnitude and opposite sign (25) Example: Use of Auxiliary Polynomial Consider the quintic equation A(s) = 0 where A(s) is s 5 + 2s 4 + 24s 3 + 48s 2 50 (26) The Routh array starts off as s 5 1 24 25 s 4 2 48 50 auxiliary polynomial P (s) s 3 0 0 (27) The auxiliary polynomial P (s) is P (s) = 2s 4 + 48s 2 50 (28) which indicates that A(s) = 0 must have two pairs of roots of equal magnitude and opposite sign, which are also roots of the auxiliary polynomial equation P (s) = 0 Taking

ECE 680 Modern Automatic Control Routh s Stability Criterion June 13, 2007 6 the derivative of P (s) with respect to s we obtain dp (s) ds = 8s 3 + 96s (29) so the s 3 row is as shown below and the Routh array is s 5 1 24 25 s 4 2 48 50 s 3 8 96 Coefficients of dp (s)/ds s 2 24 50 s 1 1127 0 s 0 50 (30) There is a single change of sign in the first column of the resulting array, indicating that there A(s) = 0 has one root with positive real part Solving the auxiliary polynomial equation, 2s 4 + 48s 2 50 = 0 (31) yields the remaining roots, namely, from so the original equation can be factored as s 2 = 1, s 2 = 25, (32) s = ±1, s = ±j5 (33) (s + 1)(s 1)(s + j5)(s j5)(s + 2) = 0 (34) Relative stability analysis Routh s stability criterion provides the answer to the question of absolute stability This, in many practical cases, is not sufficient We usually require information about the relative stability of the system A useful approach for examining relative stability is to shift the s-plane axis and apply Routh s stability criterion Namely, we substitute s = z σ (σ = constant) into the characteristic equation of the system, write the polynomial in terms of z, and apply Routh s stability criterion to the new polynomial in z The number of changes of sign in the first column of the array developed for the polynomial in z is equal to the number of roots which are located to the right of the vertical line s = σ Thus, this test reveals the number of roots which lie to the right of the vertical line s = σ 2 2 This italicized text and most of the numerical examples are from Section 6-6 of Ogata, Katsuhiko, Modern Control Engineering, Englewood Cliffs, NJ: Prentice-Hall, 1970, pp 252 258 The rest of the text, including the descriptions of the examples is mine