Pages that link to "Item:Q1262084"
From MaRDI portal
The following pages link to Complexity analysis of a process for simultaneously obtaining all zeros of polynomials (Q1262084):
Displaying 6 items.
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously (Q262691) (← links)
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros (Q331804) (← links)
- On the determination of the safe initial approximation for the Durand- Kerner algorithm (Q1184142) (← links)
- The globalization of Durand-Kerner algorithm (Q1387545) (← links)
- The Root Separation of Polynomials and Some Applications (Q4847523) (← links)
- On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros (Q5225442) (← links)
