On the determination of the safe initial approximation for the Durand- Kerner algorithm
DOI10.1016/0377-0427(91)90188-PzbMATH Open0747.65033MaRDI QIDQ1184142FDOQ1184142
Authors: Deren Wang, Fengguang Zhao 
Publication date: 28 June 1992
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
algorithmcomplexityconvergence rateparallel computingDurand-Kerner methodcomplex polynomial zeroscircular iterative methodsKuhn algorithmmajorant functionssafe initial approximation
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Cites Work
- Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
- Title not available (Why is that?)
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Title not available (Why is that?)
- On an iterative method for simultaneous inclusion of polynomial complex zeros
Cited In (7)
- Initial approximations in Durand-Kerner's root finding method
- Relationships between different types of initial conditions for simultaneous root finding methods
- On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step
- Convergence of the two-point Weierstrass root-finding method
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- On the guaranteed convergence of the square-root iteration method
This page was built for publication: On the determination of the safe initial approximation for the Durand- Kerner algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184142)
