Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational aspects of deciding if all roots of a polynomial lie within the unit circle |
scientific article; zbMATH DE number 3502710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational aspects of deciding if all roots of a polynomial lie within the unit circle |
scientific article; zbMATH DE number 3502710 |
Statements
Computational aspects of deciding if all roots of a polynomial lie within the unit circle (English)
0 references
1976
0 references
