Algorithms for the Routh-Hurwitz stability test (Q921873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Eduard Eitelberg / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Eduard Eitelberg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5594878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical systems and their applications: linear theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:34, 21 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for the Routh-Hurwitz stability test
scientific article

    Statements

    Algorithms for the Routh-Hurwitz stability test (English)
    0 references
    0 references
    1990
    0 references
    We discuss three algorithms for performing the Routh-Hurwitz stability test: a straightforward stable but slow algorithm, a faster but unstable algorithm, and a third algorithm that we conclude is a reasonable compromise between the first two.
    0 references
    algorithms
    0 references
    Routh-Hurwitz stability test
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references