We present a general and efficient numerical method with low computational complexity for computing the number of zeros of a real polynomial in the unit disk.
โฆ LIBER โฆ
Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation
โ Scribed by B. Gleyse; A. Larabi; M. Moflih
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 224 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
โฆ Synopsis
We present a general method for the exact computation of the number of zeros of a complex polynomial inside the unit disk, assuming that the polynomial does not vanish on the unit circle. We prove the existence of a polynomial sequence. This sequence involves a reduced number of arithmetic operations and the growth of intermediate coefficients remains controlled. We study the singular case where the constant term of a polynomial of this sequence vanishes.
๐ SIMILAR VOLUMES
Numerical computation of the number of z
โ
B. Gleyse; A. Larabi
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 195 KB
On polynomials having all zeros in a hal
โ
Ezra Zeheb
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 488 KB
The Root and Bellโs disk iteration metho
โ
M.N.O. Ikhile
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 490 KB
Erratum: Volume 120, Number 1 (1989), in
โ
.
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 31 KB