A fast iterative method for determining the stability of a polynomial (Q5961644)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 982511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast iterative method for determining the stability of a polynomial |
scientific article; zbMATH DE number 982511 |
Statements
A fast iterative method for determining the stability of a polynomial (English)
0 references
1 October 1997
0 references
iterative method
0 references
convergence
0 references
zero-location problems
0 references
Bézout matrices
0 references
Routh-Hurwitz problem
0 references
stability
0 references
polynomial
0 references
Schur-Cohn problems
0 references
fast polynomial arithmetic
0 references
numerical experiments
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0.7637383341789246
0 references
0.758691132068634
0 references
0.7489477396011353
0 references
0.746440589427948
0 references
