On the determination of the safe initial approximation for the Durand- Kerner algorithm

DOI10.1016/0377-0427(91)90188-PzbMath0747.65033MaRDI QIDQ1184142

Fengguang Zhao, Deren Wang

Publication date: 28 June 1992

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmparallel computingconvergence rateDurand-Kerner methodcomplex polynomial zeroscircular iterative methodsKuhn algorithmmajorant functionssafe initial approximation

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)

Related Items (5)

On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros ⋮ On the guaranteed convergence of the square-root iteration method ⋮ Convergence of the two-point Weierstrass root-finding method ⋮ Relationships between different types of initial conditions for simultaneous root finding methods ⋮ General convergence theorems for iterative processes and applications to the Weierstrass root-finding method

Cites Work

• Unnamed Item
• Unnamed Item
• On an iterative method for simultaneous inclusion of polynomial complex zeros
• Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen

This page was built for publication: On the determination of the safe initial approximation for the Durand- Kerner algorithm