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 24 items.
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- On the stability of computing polynomial roots via confederate linearizations (Q2814445) (← links)
- Generalizations of Gershgorin disks and polynomial zeros (Q3574809) (← links)
- Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← 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)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
- On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)
- A new proximity test for polynomial zeros (Q5948808) (← links)
- Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues (Q6057349) (← links)
- Fast evaluation and root finding for polynomials with floating-point coefficients (Q6060390) (← links)
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees (Q6073133) (← links)