Pages that link to "Item:Q901005"
From MaRDI portal
The following pages link to Relationships between different types of initial conditions for simultaneous root finding methods (Q901005):
Displaying 17 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)
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros (Q343681) (← links)
- Convergence of the two-point Weierstrass root-finding method (Q403839) (← links)
- On a family of Weierstrass-type root-finding methods with accelerated convergence (Q668566) (← links)
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity (Q1697274) (← links)
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods (Q1733448) (← links)
- Unified convergence analysis for Picard iteration in \(n\)-dimensional vector spaces (Q1742974) (← links)
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros (Q2008912) (← links)
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
- Computer visualization and dynamic study of new families of root-solvers (Q2231295) (← links)
- On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros (Q2279594) (← links)
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously (Q2357433) (← links)
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously (Q2407926) (← links)
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros (Q2424923) (← links)
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods (Q5865291) (← links)
- A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence (Q6049349) (← links)