Comments on the Routh-Hurwitz Criterion

Y. Shamash

doi:10.1109/TAC.1980.1102255

Comments on the Routh-Hurwitz Criterion

Y. Shamash

Electrical Engineering

Stony Brook University

Research output: Contribution to journal › Comment/debate

16 Scopus citations

Abstract

An algorithmic procedure is given for determining the location of the roots of a polynomial via the Routh table in the presence of purely imaginary roots and a left column zero. The algorithm is computationally attractive. An example is given to illustrate the procedure.

Original language	English
Pages (from-to)	132-133
Number of pages	2
Journal	IEEE Transactions on Automatic Control
Volume	25
Issue number	1
DOIs	https://doi.org/10.1109/TAC.1980.1102255
State	Published - Feb 1980

Access to Document

10.1109/TAC.1980.1102255

Cite this

@article{76d8c38814234320bcbfa85f50debed5,

title = "Comments on the Routh-Hurwitz Criterion",

abstract = "An algorithmic procedure is given for determining the location of the roots of a polynomial via the Routh table in the presence of purely imaginary roots and a left column zero. The algorithm is computationally attractive. An example is given to illustrate the procedure.",

author = "Y. Shamash",

year = "1980",

month = feb,

doi = "10.1109/TAC.1980.1102255",

language = "English",

volume = "25",

pages = "132--133",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Comments on the Routh-Hurwitz Criterion

AU - Shamash, Y.

PY - 1980/2

Y1 - 1980/2

N2 - An algorithmic procedure is given for determining the location of the roots of a polynomial via the Routh table in the presence of purely imaginary roots and a left column zero. The algorithm is computationally attractive. An example is given to illustrate the procedure.

AB - An algorithmic procedure is given for determining the location of the roots of a polynomial via the Routh table in the presence of purely imaginary roots and a left column zero. The algorithm is computationally attractive. An example is given to illustrate the procedure.

UR - https://www.scopus.com/pages/publications/6744252228

U2 - 10.1109/TAC.1980.1102255

DO - 10.1109/TAC.1980.1102255

M3 - Comment/debate

SN - 0018-9286

VL - 25

SP - 132

EP - 133

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 1

ER -

Comments on the Routh-Hurwitz Criterion

Abstract

Access to Document

Other files and links

Fingerprint

Cite this