Weierstrass formula and zero-finding methods

  title={Weierstrass formula and zero-finding methods
  author={Milan Petkovi'c and Carsten Carstensen and Miroslav Trajkov'i c},
  journal={Numerische Mathematik},
Summary. Classical Weierstrass' formula [29] has been often the subject of investigation of many authors. In this paper we give some further applications of this formula for finding the zeros of polynomials and analytic functions. We are concerned with the problems of localization of polynomial zeros and the construction of iterative methods for the simultaneous approximation and inclusion of these zeros. Conditions for the safe convergence of Weierstrass' method, depending only on initial… 

Point estimation and some applications to iterative methods

We consider one of the crucial problems in solving polynomial equations concerning the construction of such initial conditions which provide a safe convergence of simultaneous zero-finding methods.

Laguerre-like Methods for the Simultaneous Approximation of Polynomial Zeros

This paper considers some iterative methods of higher order for the simultaneous determination of polynomial zeros based on Euler’s third order method and proves that the presented methods have the order of convergence equal to four or more.

Complexity Analysis of Algorithms in Algebraic Computation

This dissertation develops point estimates for two different definitions of approximate zeros of an analytic function on a Banach space, and analyses the worst-case complexity of two algorithms for isolating real roots of a square-free polynomial with real coefficients: The Descartes method and Akritas' continued fractions algorithm.


New iterative methods for the simultaneous inclusion of multiple complex zeros of algebraic polynomials, based on a suitable fixed point relation of Laguerre’s type, are considered. The proposed

Ostrowski-Like Method with Corrections for the Inclusion of Polynomial Zeros

In this paper we construct iterative methods of Ostrowski's type for the simultaneous inclusion of all zeros of a polynomial. Using the concept of the R-order of convergence of mutually dependent

On the guaranteed convergence of the Japanese zero-finding method

Initial conditions which ensure the guaranteed convergence of the fourth order iterative method for the simultaneous approximation of simple zeros of polynomials, proposed by Sakurai, Torii and Sugiura in 1991 are stated.



A class of simultaneous methods for the zeros of analytic functions

On the efficiency of some combined methods for polynomial complex zeros

Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems

Whenever the approxIMations are sufficiently well separated and sufficiently close to the zeros of this polynomial, the radii of these circular regions are shown to overestimate the errors by at most a modest factor simply related to the configuration of the approximations.

A generalization of the Siewert–Burniston method for the determination of zeros of analytic functions

The Siewert–Burniston method for the derivation of closed‐form formulas for the zeros of sectionally analytic functions with a discontinuity interval along the real axis (based on the Riemann–Hilbert

Inclusion of the roots of a polynomial based on Gerschgorin's theorem

SummaryIn this note a new companion matrix is presented which can be interpreted as a product of Werner's companion matrices [13]. Gerschgorin's theorem yields an inclusion of the roots of a

A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem

SummaryBy using Gershgorin's theorem and the theorems on minimal Gershgorin disks a posteriori error bounds for the zeros of a polynomial are deduced, from which the bounds given in [1] by Braess and

Simultaneous inclusion of the zeros of a polynomial

SummaryA family of inclusion sets for the zeros of a complex polynomial is derived from the Lagrangean interpolation formulas. The optimization of the inclusion leads to a special type of matrix

Iterative Methods for Simultaneous Inclusion of Polynomial Zeros

Basic concepts.- Iterative methods without derivatives.- Generalized root iterations.- Bell's polynomials and parallel disk iterations.- Computational efficiency of simultaneous methods.