Pages that link to "Item:Q3477120"
From MaRDI portal
The following pages link to On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial (Q3477120):
Displayed 14 items.
- On the guaranteed convergence of the square-root iteration method (Q596189) (← links)
- The guaranteed convergence of Laguerre-like method (Q597223) (← links)
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros (Q929751) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- On the convergence of Wang-Zheng's method (Q1298532) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- The convergence of a family of parallel zero-finding methods (Q1767950) (← links)
- Point estimation of a family of simultaneous zero-finding methods (Q1806445) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II. (Q2372910) (← links)
- Approximate Zeros of Quadratically Convergent Algorithms (Q4305971) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- A short survey on Kantorovich (Q5270188) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey (Q5948584) (← links)