Pages that link to "Item:Q1977146"
From MaRDI portal
The following pages link to Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146):
Displayed 6 items.
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
- Generalizations of Gershgorin disks and polynomial zeros (Q3574809) (← links)
- A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial (Q4652860) (← links)
- A new proximity test for polynomial zeros (Q5948808) (← links)