✦ LIBER ✦

A computational test for the existence of polynomial zero

✍ Scribed by M.S. Petković; L.D. Petković

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 268 KB
Volume: 17
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(89)90041-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the moments of the density of

Computing the moments of the density of zeros for orthogonal polynomials

✍ B. Germano; P. Natalini; P.E. Ricci 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 615 KB

On the Zeroes of a Polynomial

✍ H. Alzer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 70 KB

An annulus for the zeros of polynomials

✍ M. Bidkham; E. Shashahani 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 197 KB

In this paper, we prove a more general result concerning the location of the zeros of a polynomial in a ring shaped region involving binomial coefficients and t-Fibonacci numbers. We include not only some known results as special cases, but also improve the results due to Daiz-Barrero and Egozcue [6

Algebraic computation of the number of z

Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation

✍ 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

Zeros of the Wronskian of a polynomial

✍ Karl Dilcher; Kenneth B Stolarsk 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Numerical computation of the number of z

Numerical computation of the number of zeros of real polynomials in the open unit disk using a Chebyshev polynomials representation

✍ B. Gleyse; A. Larabi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 195 KB

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.