On the determination of the safe initial approximation for the Durand- Kerner algorithm
From MaRDI portal
(Redirected from Publication:1184142)
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 3890621 (Why is no real title available?)
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- 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)
