In this paper, we investigate the performance of zero bounds due to Kalantari and Dehmer by using special classes of polynomials. Our findings are evidenced by numerical as well as analytical results
AbstractApproximations of entire functions by polynomials are considered. Residual bounds for zeros ...
AbstractUsing the Newton-like algorithm for finding a complex zero of a polynomial, presented by M. ...
We consider the problem of constructing the polynomial that is nearest to given polynomials in two c...
In this paper, we evaluate the quality of zero bounds on the moduli of univariate complex polynomial...
We prove some extensions of the classical results concerning Enestrom-Kakeya theorem and related ana...
The aim of this paper is to correct the bounds for the zeros of certain polynomials recently proved ...
Problems on algebraical polynomials appear in many fields of mathematics and computer science. Espec...
AbstractWe use mixed three term recurrence relations typically satisfied by classical orthogonal pol...
AbstractThis paper deals with the zeros of polynomials generated by a certain three term recurrence ...
Source: Masters Abstracts International, Volume: 04-04, page: 1400.Thesis (M.A.)--American Universit...
The problem of obtaining the smallest possible region containing all the zeros of a polynomial has b...
AbstractWe define a region Hα,ƒ in the complex number field, where α is a complex number, ƒ(x) ϵ K [...
Polynomials pervade mathematics and much that is beautiful in mathematics is related to polynomials,...
In this paper, by using standard techniques we shall obtain results with relaxed hypothesis which g...
Abstract. Let {pn} n=0 be a sequence of orthogonal polynomials. We briefly review properties of pn t...
AbstractApproximations of entire functions by polynomials are considered. Residual bounds for zeros ...
AbstractUsing the Newton-like algorithm for finding a complex zero of a polynomial, presented by M. ...
We consider the problem of constructing the polynomial that is nearest to given polynomials in two c...
In this paper, we evaluate the quality of zero bounds on the moduli of univariate complex polynomial...
We prove some extensions of the classical results concerning Enestrom-Kakeya theorem and related ana...
The aim of this paper is to correct the bounds for the zeros of certain polynomials recently proved ...
Problems on algebraical polynomials appear in many fields of mathematics and computer science. Espec...
AbstractWe use mixed three term recurrence relations typically satisfied by classical orthogonal pol...
AbstractThis paper deals with the zeros of polynomials generated by a certain three term recurrence ...
Source: Masters Abstracts International, Volume: 04-04, page: 1400.Thesis (M.A.)--American Universit...
The problem of obtaining the smallest possible region containing all the zeros of a polynomial has b...
AbstractWe define a region Hα,ƒ in the complex number field, where α is a complex number, ƒ(x) ϵ K [...
Polynomials pervade mathematics and much that is beautiful in mathematics is related to polynomials,...
In this paper, by using standard techniques we shall obtain results with relaxed hypothesis which g...
Abstract. Let {pn} n=0 be a sequence of orthogonal polynomials. We briefly review properties of pn t...
AbstractApproximations of entire functions by polynomials are considered. Residual bounds for zeros ...
AbstractUsing the Newton-like algorithm for finding a complex zero of a polynomial, presented by M. ...
We consider the problem of constructing the polynomial that is nearest to given polynomials in two c...
DOI
Add to ORKG