Let p be a complex polynomial of fixed degree n. In this paper we show that Cauchy’s method may fail to find all zeros of p for any initial guess z0 lying in the complex plane and we propose several ways to find all zeros of a given polynomial using scaled Cauchy’s methods
Abstract. In this paper Newton’s method is derived, the general speed of convergence of the method i...
Let P(z) be a polynomial of degree n with real or complex coefficients. In this paper, we shall obta...
AbstractLet P(z) = ∑n−1j=0ajzj+zn (n ≥ 2) be a polynomial with complex coefficients, where not all o...
The aim of this paper is to investigate the iterative root-finding Chebyshev’s method from a dynamic...
Abstract. We investigate Newton’s method for complex polynomials of arbitrary degree d, normalized s...
In this note, we improve upon Cauchy’s classical bound, and upon some recent bounds for the moduli o...
In this paper we explore some properties of the well known root-finding Chebyshev’s method applied t...
The field of dynamics is itself a huge part of many branches of science, including the motion of the...
AbstractLetp(z)=1+∑nj=1bjzjbe a complex polynomial. Two theorems on the coefficients and zeros ofp(z...
AbstractLet Pn(x)=xm+pm−1(n)xm−1+⋯+p1(n)x+pm(n) be a parametrized family of polynomials of a given d...
Abstract. Using techinques of complex dynamics we prove the conjecture of Sheil-Small and Wilmshurst...
This paper shows the dynamical behavior of the well-known Chebyshev method when it is applied to cub...
AbstractA parametric family of iterative methods for the simultaneous determination of simple comple...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
We consider the problem of constructing the polynomial that is nearest to given polynomials in two c...
Abstract. In this paper Newton’s method is derived, the general speed of convergence of the method i...
Let P(z) be a polynomial of degree n with real or complex coefficients. In this paper, we shall obta...
AbstractLet P(z) = ∑n−1j=0ajzj+zn (n ≥ 2) be a polynomial with complex coefficients, where not all o...
The aim of this paper is to investigate the iterative root-finding Chebyshev’s method from a dynamic...
Abstract. We investigate Newton’s method for complex polynomials of arbitrary degree d, normalized s...
In this note, we improve upon Cauchy’s classical bound, and upon some recent bounds for the moduli o...
In this paper we explore some properties of the well known root-finding Chebyshev’s method applied t...
The field of dynamics is itself a huge part of many branches of science, including the motion of the...
AbstractLetp(z)=1+∑nj=1bjzjbe a complex polynomial. Two theorems on the coefficients and zeros ofp(z...
AbstractLet Pn(x)=xm+pm−1(n)xm−1+⋯+p1(n)x+pm(n) be a parametrized family of polynomials of a given d...
Abstract. Using techinques of complex dynamics we prove the conjecture of Sheil-Small and Wilmshurst...
This paper shows the dynamical behavior of the well-known Chebyshev method when it is applied to cub...
AbstractA parametric family of iterative methods for the simultaneous determination of simple comple...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
We consider the problem of constructing the polynomial that is nearest to given polynomials in two c...
Abstract. In this paper Newton’s method is derived, the general speed of convergence of the method i...
Let P(z) be a polynomial of degree n with real or complex coefficients. In this paper, we shall obta...
AbstractLet P(z) = ∑n−1j=0ajzj+zn (n ≥ 2) be a polynomial with complex coefficients, where not all o...
DOI
Add to ORKG