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 โฆ
Sturm sequences and the number of zeros of a real polynomial in the unit disk: Numerical computation
โ Scribed by B. Gleyse
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 229 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Numerical computation of the number of z
โ
B. Gleyse; A. Larabi
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 195 KB
Exact computation of the number of zeros
โ
B. Gleyse; M. Moflih
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 309 KB
We present a new and versatile method for the exact computation of the number of zeros of a real polynomial inside the unit disk. Our technique is based on a determinant representation.
Algebraic computation of the number of z
โ
B. Gleyse; A. Larabi; M. Moflih
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 224 KB
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 operation
The average number of real zeros of a ra
โ
D. C. Stevens
๐
Article
๐
1969
๐
John Wiley and Sons
๐
English
โ 572 KB
A combined symbolic and numerical algori
โ
Amparo Gil; Javier Segura
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 189 KB
The Root and Bellโs disk iteration metho
โ
M.N.O. Ikhile
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 490 KB