Pages that link to "Item:Q1101184"

The following pages link to On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184):

Displaying 50 items.

• A tight bound for approximating the square root (Q287183) (← links)
• Finding the number of roots of a polynomial in a plane region using the winding number (Q316523) (← links)
• Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
• Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
• A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
• Computing real roots of real polynomials (Q491245) (← links)
• 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)
• Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← 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)
• Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
• Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← 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)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← 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)
• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
• From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
• A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
• On the convergence of Halley's method for multiple polynomial zeros (Q2354280) (← 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)
• Robust approximate zeros in Banach space (Q2465576) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
• On the cost of computing roots of polynomials (Q3330394) (← links)
• (Q3776504) (← links)
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940) (← links)
• On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) (← links)
• Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
• Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
• New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
• How to be sure of finding a root of a complex polynomial using Newton's method (Q5285715) (← links)
• Probabilistic analyses of condition numbers (Q5740078) (← links)
• On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)
• Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)