Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation (Q628241)
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: Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation |
scientific article; zbMATH DE number 5864262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation |
scientific article; zbMATH DE number 5864262 |
Statements
Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation (English)
0 references
10 March 2011
0 references
The authors present an algorithm to compute the number of zeros of a complex polynomial inside the unit disk. Using the Schur-Cohn and Brown transforms they recursively associate to the given polynomial a sequence of polynomials and consider the number of sign changes in the sequence of their values at zero.
0 references
polynomials
0 references
root-counting method and Brown transform
0 references
Schur-Cohn subtransform
0 references
0 references
0.873964786529541
0 references
0.8089067935943604
0 references
0.7913492918014526
0 references
0.785515546798706
0 references
0.7808655500411987
0 references
