AbstractWe prove that if |a1| is large and |a0| is small enough, then every approximate zero of the polynomial of degree n, anzn+an−1zn−1+⋯+a1z+a0=0, can be approximated by a true zero within a good error bound
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently g...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given....
The aim of this paper is to correct the bounds for the zeros of certain polynomials recently proved ...
Abstract. The aim of this paper is to prove the stability in the sense of Hyers–Ulam stability of a ...
AbstractLagrange interpolation and partial fraction expansion can be used to derive a Gerschgorin-ty...
AbstractA real polynomial is called Hurwitz (stable) if all its zeros have negative real parts. For ...
AbstractApproximations of entire functions by polynomials are considered. Residual bounds for zeros ...
We are interested in problems concerning the location and multiplicity of zeros of polynomials with ...
AbstractLet P(z) = ∑n−1j=0ajzj+zn (n ≥ 2) be a polynomial with complex coefficients, where not all o...
AbstractWe substantially improve the known algorithms for approximating all the complex zeros of an ...
AbstractWe prove that if |a1| is large and |a0| is small enough, then every approximate zero of the ...
We propose a new algorithm for the classical and still practically important problem of approximatin...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
AbstractWe propose a new algorithm for the classical and still practically important problem of appr...
Abstract. A well known result due to Ankeny and Rivlin [1] states that if p(z) = ∑n j=0 ajz j is a p...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently g...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given....
The aim of this paper is to correct the bounds for the zeros of certain polynomials recently proved ...
Abstract. The aim of this paper is to prove the stability in the sense of Hyers–Ulam stability of a ...
AbstractLagrange interpolation and partial fraction expansion can be used to derive a Gerschgorin-ty...
AbstractA real polynomial is called Hurwitz (stable) if all its zeros have negative real parts. For ...
AbstractApproximations of entire functions by polynomials are considered. Residual bounds for zeros ...
We are interested in problems concerning the location and multiplicity of zeros of polynomials with ...
AbstractLet P(z) = ∑n−1j=0ajzj+zn (n ≥ 2) be a polynomial with complex coefficients, where not all o...
AbstractWe substantially improve the known algorithms for approximating all the complex zeros of an ...
AbstractWe prove that if |a1| is large and |a0| is small enough, then every approximate zero of the ...
We propose a new algorithm for the classical and still practically important problem of approximatin...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
AbstractWe propose a new algorithm for the classical and still practically important problem of appr...
Abstract. A well known result due to Ankeny and Rivlin [1] states that if p(z) = ∑n j=0 ajz j is a p...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently g...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given....
The aim of this paper is to correct the bounds for the zeros of certain polynomials recently proved ...