An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
From MaRDI portal
Publication:1241014
DOI10.1016/0771-050X(77)90006-7zbMath0364.65033MaRDI QIDQ1241014
Publication date: 1977
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Related Items (22)
Some improved inclusion methods for polynomial roots with Weierstrass' corrections ⋮ On iteration methods without derivatives for the simultaneous determination of polynomial zeros ⋮ On a cubically convergent derivative-free root finding method ⋮ Construction of zero-finding methods by Weierstrass functions ⋮ On Euler-like methods for the simultaneous approximation of polynomial zeros ⋮ On a high-order one-parameter family for the simultaneous determination of polynomial roots ⋮ A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence ⋮ 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 ⋮ 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 ⋮ Methods with corrections for the simultaneous inclusion of polynomial zeros ⋮ On the fourth order methods of Weierstrass' type ⋮ Börsch-supan-like methods: point estimation and parallel implementation ⋮ An efficient higher order family of root finders ⋮ Weierstrass-like methods with corrections for the inclusion of polynomial zeros ⋮ On the new fourth-order methods for the simultaneous approximation of polynomial 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 ⋮ 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 a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial ⋮ A family of simultaneous methods for the determination of polynomial complex zeros ⋮ On some interval methods for algebraic, exponential and trigonometric polynomials
Cites Work
This page was built for publication: An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)