A new general Routh-like algorithm to determine the number of RHP roots of a real or complex polynomial

DOI10.1109/TAC.1985.1103957zbMath0585.65039MaRDI QIDQ3709793

S. D. Agashe

Publication date: 1985

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

zbMATH Keywords

numerical examplessingular caseRouth algorithmnumber of right-half plane roots of a polynomialPrinciple of the Argument

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items (5)

A stability test for continuous systems ⋮ Collective motion under beacon-referenced cyclic pursuit ⋮ A geometrical interpretation of the Routh test ⋮ Euclid algorithm, orthogonal polynomials, and generalized Routh-Hurwitz algorithm ⋮ Tuning of complex coefficient PI/PD/PID controllers for a universal plant structure

This page was built for publication: A new general Routh-like algorithm to determine the number of RHP roots of a real or complex polynomial