Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation (Q628241): Difference between revisions
From MaRDI portal
Latest revision as of 21:19, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation |
scientific article |
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
