Weierstrass (Sitzungsber Königl Preuss Akad Wiss Berlin II: 1085–1101, 1891) introduced
his famous iterative method for numerical finding all zeros of a polynomial simultaneously …

In this paper we present new local and semilocal convergence theorems for the two-point
Weierstrass method for the simultaneous computation of polynomial zeros. Our local …

A novel three-step simultaneous scheme for finding all distinct and multiple roots of non-
linear equations are developed in this paper. Analysis of convergence demonstrates that the …

In this paper we give methodological survey of “contemporary methods” for solving the
nonlinear equation f (x)= 0. The reason for this review is that many authors in present days …

In this paper, we construct and study a new family of multi-point Ehrlich-type iterative
methods for approximating all the zeros of a uni-variate polynomial simultaneously. The first …

The integrated principle of SINS/CNS/SMNS is investigated, and a federated information
fusion method for the integrated navigation system is founded. On account of primary …

A novel algorithm for solving nonlinear equations is proposed. The computation is carried
out by simple gradient descent rule with adaptive variable step-size. In order to make the …

We modify a new iterative method introduced by Abu-Alshaikh [Enformatika. 5 (2005) h. 190--
193] to speed up the convergence for finding multiple roots of a nonlinear equation in one …

We modify a new iterative method introduced by Abu-Alshaikh lEnformatika. 5 (2005) h. 190--
193] to speed up the convergence for finding multiple roots of a nonlinear equation in one …

Whereas Newton's method involves only the first derivative, methods discussed in this
chapter involve the second or higher. The “classical” methods of this type (such as Halley's …