Thumbnail
Access Restriction
Subscribed

Author Barnett, S.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1973
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations ♦ Other branches of engineering
Subject Keyword Linear systems
Abstract The well-known Routh and Jury tabular schemes for determination of linear system zero location relative to the left half plane and unit disc respectively are formulated as special cases of two algorithms for finding the greatest common divisor of two polynomials. Two recent extensions of the tabular methods are expressed similarly, and this enables a previously unknown 'duality' property of the two zero location algorithms to be demonstrated. Namely, that a Routh-type array can be applied to the unit disc problem, and a Jury-type array to the left half plane problem, and these applications occur in a precisely symmetrical fashion. Extensions are given for complex polynomials, and remarks are made on the problem of coefficient growth during array construcion.
Description Author affiliation: University of Bradford, England (Barnett, S.)
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1973-12-05
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 558.57 kB
Page Count 7
Starting Page 308
Ending Page 314


Source: IEEE Xplore Digital Library