In this paper, we evaluate the quality of zero bounds on the moduli of univariate complex polynomials. We select classical and recently developed bounds and evaluate their quality by using several ...

SIAM Journal on Numerical Analysis, Vol. 11, No. 6 (Dec., 1974), pp. 1087-1104 (18 pages) A composite algorithm has been designed for finding zeros of real polynomials. The algorithm has proved to be ...

Abstract: In both the analysis and the design of linear networks, a commonly occurring task is that of locating the zeros of a polynomial. Among the many methods available for doing this, the one due ...

Abstract: PROFESSOR Yitang Zhang, a number theorist at the University of California, Santa Barbara, USA, has posted a paper on arXiv [1] that hints at the possibility that he may have solved the ...

A method which finds simultaneously all the zeros of a polynomial, developed by H. Rutishauser, has been tested on a number of polynomials with real coefficients. This slowly converging method (the ...

In this paper we consider the problem of finding the estimate of maximum number of zeros in a prescribed region and the results which we obtain generalizes and improves upon some well known results.

In a recent paper the first author gave an explicit construction of a sequence of polynomials having their zeros on the unit circumference which converge boundedly to a given bounded zero-free ...

Let be a polynomial of degree n having all its zeros in , then for each , , with , Aziz and Ahemad (1996) proved that In this paper, we extend the above inequality to the class of polynomials , having ...