A common frame for some well-known algorithms for the stability analysis of continuous-time linear systems is derived. Specifically, a general polynomial recursion is given which includes as particular cases both Routh- and Levinson-type algorithms and is capable of generating new algorithms too. A systematic analysis of all possible corresponding split forms (three-term immittance-domain recurrence relations) is then carried out. This may allow one to clarify and compare the properties of the standard procedures.

General and split forms of some well-known s-domain algorithms

Viaro U.
Membro del Collaboration Group
1989-01-01

Abstract

A common frame for some well-known algorithms for the stability analysis of continuous-time linear systems is derived. Specifically, a general polynomial recursion is given which includes as particular cases both Routh- and Levinson-type algorithms and is capable of generating new algorithms too. A systematic analysis of all possible corresponding split forms (three-term immittance-domain recurrence relations) is then carried out. This may allow one to clarify and compare the properties of the standard procedures.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11390/1194222
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact