Javascript must be enabled to continue!
The generalized Routh array and a further simplification of the extended Routh array
View through CrossRef
The well-known Routh Array settles the problem of stability of systems of differential equations with rral coefficients. The Extended Routh Array (ERA) is the complex counterpart of the Routh Array and it settles the stability of these systems when the coefficients are complex. Since its construction, the ERA remained more of a theoretical achievement, than a practical tool to test the stability of linear systems. Some attempts were made to overcome the complexity of the ERA. The Modified Extended Routh Array (MERA) was then introduced and it reduced the burden of computations, but still it involved lots of divisions and many operations with complex numbers. In the present work, we use the interlacing property to propose an equivalent criterion to both ERA and MERA, we call the Generalized Routh Array (GRA). The new array has advantages over both ERA and MERA in the sense that neither division algorithm, nor operations of complex numbers are involved. An example is given to illustrate the feasibility of the new test.
Title: The generalized Routh array and a further simplification of the extended Routh array
Description:
The well-known Routh Array settles the problem of stability of systems of differential equations with rral coefficients.
The Extended Routh Array (ERA) is the complex counterpart of the Routh Array and it settles the stability of these systems when the coefficients are complex.
Since its construction, the ERA remained more of a theoretical achievement, than a practical tool to test the stability of linear systems.
Some attempts were made to overcome the complexity of the ERA.
The Modified Extended Routh Array (MERA) was then introduced and it reduced the burden of computations, but still it involved lots of divisions and many operations with complex numbers.
In the present work, we use the interlacing property to propose an equivalent criterion to both ERA and MERA, we call the Generalized Routh Array (GRA).
The new array has advantages over both ERA and MERA in the sense that neither division algorithm, nor operations of complex numbers are involved.
An example is given to illustrate the feasibility of the new test.
Related Results
Numerical Simplification and its Effect on Fragment Distributions in Genetic Programming
Numerical Simplification and its Effect on Fragment Distributions in Genetic Programming
<p>In tree-based genetic programming (GP) there is a tendency for the program trees to increase in size from one generation to the next. If this increase in program size is n...
Semantically Enriched Simplification of Trajectories
Semantically Enriched Simplification of Trajectories
Abstract. Moving objects that are equipped with GPS devices generate huge volumes of spatio-temporal data. This spatial and temporal information is used in tracing the path travell...
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Topological descriptor is a fixed real number directly attached with the molecular graph to predict the physical and chemical properties of the chemical compound. Gutman and Trinaj...
The Routh and Routh‐Hurwitz Stability Criteria
The Routh and Routh‐Hurwitz Stability Criteria
THE classic Routh stability criteria1 are applicable only to polynomial characteristic equations with real coefficients. The writer recently came across co‐related criteria in a Ru...
LOOPS: LOcally Optimized Polygon Simplification
LOOPS: LOcally Optimized Polygon Simplification
AbstractDisplaying polygonal vector data is essential in various application scenarios such as geometry visualization, vector graphics rendering, CAD drawing and in particular geog...
Non‐circular signals for nested array: sum–difference co‐array and direction of arrival estimation algorithm
Non‐circular signals for nested array: sum–difference co‐array and direction of arrival estimation algorithm
Nested array has aroused remarkable attention due to the capability to obtain both enhanced degrees of freedom (DOFs) and enlarged array aperture, whereas only difference co‐array ...
Analisis Stabilitas Sistem Kendali Linier Menggunakan Routh-Hurwitz dan Nyquist dengan Implementasi MATLAB: Studi Kasus pada Sistem Otomasi
Analisis Stabilitas Sistem Kendali Linier Menggunakan Routh-Hurwitz dan Nyquist dengan Implementasi MATLAB: Studi Kasus pada Sistem Otomasi
Stabilitas merupakan aspek fundamental dalam sistem kendali linier, yang menentukan apakah sistem akan merespons input secara terkendali atau tidak. Penelitian ini bertujuan untuk ...
A Treatise on Analytical Statics
A Treatise on Analytical Statics
As senior wrangler in 1854, Edward John Routh (1831–1907) was the man who beat James Clerk Maxwell in the Cambridge mathematics tripos. He went on to become a highly successful coa...

