Argument conditions for Hurwitz and Schur polynomials from network theory

Argument conditions for Hurwitz and Schur polynomials from network theory

The monotonicity conditions, recently given, for the arguments of Hurwitz polynomials, as well as some of their associated polynomials, are, very simply, derived using well-established results in network theory. Corresponding results for Schur polynomials may also be obtained.< >

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control 1994-02, Vol.39 (2), p.345-346
1. Verfasser: Bose, N.K.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Automatic control
Computer science
control theory
systems
Control systems
Control theory. Systems
Design optimization
Error correction
Exact sciences and technology
High definition video
Instruction sets
Polynomials
Process control
System theory
Three-term control
Transfer functions
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The monotonicity conditions, recently given, for the arguments of Hurwitz polynomials, as well as some of their associated polynomials, are, very simply, derived using well-established results in network theory. Corresponding results for Schur polynomials may also be obtained.< >
ISSN:0018-9286
1558-2523
DOI:10.1109/9.272330