A unifying frame for stability-test algorithms for continuous-time systems

Author

Krajewski, W. ; Lepschy, A. ; Mian, G.A. ; Viaro, U.

Author_Institution

Syst. Res. Inst., Polish Acad. of Sci., Warsaw, Poland

Volume

37

Issue

2

fYear

1990

fDate

2/1/1990 12:00:00 AM

Firstpage

290

Lastpage

296

Abstract

A number of stability-test algorithms for linear continuous-time systems are presented in a unified manner, which is based on a general recursive relation for generating a sequence of polynomials of descending degree. Each polynomial in the sequence is expressed as a suitable combination of the preceding polynomial of higher degree and the polynomial with opposite zeros. It is shown how the general recursion may give rise to the known stability-test algorithms as well as to some families of new algorithms. The corresponding criteria are proved with the aid of simple geometrical considerations based on root loci. In this way, insight is gained into the nature of the different procedures

Keywords

linear systems; polynomials; stability; continuous-time systems; general recursive relation; geometrical considerations; polynomials; root loci; stability-test algorithms; Circuit stability; Circuit testing; Circuits and systems; Informatics; Linear systems; Polynomials; System testing; Terminology;

fLanguage

English

Journal_Title

Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0098-4094

Type

jour

DOI

10.1109/31.45725

Filename

45725