Pages that link to "Item:Q1101184"
From MaRDI portal
The following pages link to On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184):
Displayed 22 items.
- Average-case results for zero finding (Q582817) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Simple algorithms for approximating all roots of a polynomial with real roots (Q757494) (← links)
- General local convergence theory for a class of iterative processes and its applications to Newton's method (Q998977) (← links)
- A new solution method for the finite-horizon discrete-time EOQ problem (Q1011324) (← links)
- Complexity of functions: Some questions, conjectures, and results (Q1174450) (← links)
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)
- Practical improvement of the divide-and-conquer eigenvalue algorithms (Q1192014) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Complexity lower bounds for approximation algebraic computation trees (Q1578509) (← links)
- Finding a cluster of zeros of univariate polynomials (Q1594831) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain (Q1905198) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) (← links)
- How to be sure of finding a root of a complex polynomial using Newton's method (Q5285715) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)