An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)

Cites Work

Cited In (23)

On the fourth order methods of Weierstrass' type
Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
A new method of increasing the order of convergence step by step
On the new fourth-order methods for the simultaneous approximation of polynomial zeros
On Euler-like methods for the simultaneous approximation of polynomial zeros
A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
On a cubically convergent derivative-free root finding method
Construction of zero-finding methods by Weierstrass functions
Families of high-order simultaneous methods with several corrections
On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
On some interval methods for algebraic, exponential and trigonometric polynomials
Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
On the guaranteed convergence of new two-point root-finding methods for polynomial zeros
On iteration methods without derivatives for the simultaneous determination of polynomial zeros
Some improved inclusion methods for polynomial roots with Weierstrass' corrections
The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic
On a high-order one-parameter family for the simultaneous determination of polynomial roots
Weierstrass-like methods with corrections for the inclusion of polynomial zeros
A family of simultaneous methods for the determination of polynomial complex zeros
The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods
Methods with corrections for the simultaneous inclusion of polynomial zeros
An efficient higher order family of root finders
Börsch-supan-like methods: point estimation and parallel implementation

This page was built for publication: An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241014)