On the worst-case arithmetic complexity of approximating zeros of polynomials

Recommendations

On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
Sequential and parallel complexity of approximate evaluation of polynomial zeros
On the Complexity of Polynomial Zeros
Algebraic complexity of computing polynomial zeros
On the cost of computing roots of polynomials

Cites work

scientific article; zbMATH DE number 3489473 (Why is no real title available?)
scientific article; zbMATH DE number 3628385 (Why is no real title available?)
scientific article; zbMATH DE number 3992817 (Why is no real title available?)
scientific article; zbMATH DE number 3309631 (Why is no real title available?)
scientific article; zbMATH DE number 3321949 (Why is no real title available?)
A Generalization of a Theorem of Bôcher
An Algorithm for the Machine Calculation of Complex Fourier Series
Numerics of analytic functions and complexity
On the efficiency of algorithms of analysis
The fundamental theorem of algebra and complexity theory

Cited in

(58)

A new fast root-finder for black box polynomials
Root-Squaring for Root-Finding
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
Simple algorithms for approximating all roots of a polynomial with real roots
Newton's method and the computational complexity of the fundamental theorem of algebra
Finding a cluster of zeros of univariate polynomials
On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
Computing real roots of real polynomials
Probabilistic analyses of condition numbers
Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
From approximate factorization to root isolation with application to cylindrical algebraic decomposition
On the cost of computing roots of polynomials
Average-case results for zero finding
Complexity of functions: Some questions, conjectures, and results
scientific article; zbMATH DE number 4037051 (Why is no real title available?)
A tight bound for approximating the square root
General local convergence theory for a class of iterative processes and its applications to Newton's method
Kronecker's and Newton's approaches to solving: a first comparison
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
Efficient polynomial root-refiners: a survey and new record efficiency estimates
On solving univariate sparse polynomials in logarithmic time
Complexity of path-following methods for the eigenvalue problem
On the convergence of Halley's method for multiple polynomial zeros
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
A note on the finite variance of the averaging function for polynomial system solving
scientific article; zbMATH DE number 3928209 (Why is no real title available?)
Complexity and algorithms for nonlinear optimization problems
Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
Optimal and nearly optimal algorithms for approximating polynomial zeros
New Practical Advances in Polynomial Root Clustering
Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
A geometric algorithm for winding number computation with complexity analysis
Newton's method in practice: finding all roots of polynomials of degree one million efficiently
Practical improvement of the divide-and-conquer eigenvalue algorithms
On the efficient global dynamics of Newton’s method for complex polynomials
Algebraic complexity of computing polynomial zeros
An adaptive subdivision method for root finding of univariate polynomials
Nearly optimal refinement of real roots of a univariate polynomial
How to be sure of finding a root of a complex polynomial using Newton's method
Finding the number of roots of a polynomial in a plane region using the winding number
Sequential and parallel complexity of approximate evaluation of polynomial zeros
Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
Rigid continuation paths II. structured polynomial systems
Near optimal subdivision algorithms for real root isolation
Geometry of polynomials and root-finding via path-lifting
On the evaluation of the eigenvalues of a banded Toeplitz block matrix
A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Real polynomial root-finding by means of matrix and polynomial iterations
A new solution method for the finite-horizon discrete-time EOQ problem
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Accelerated approximation of the complex roots and factors of a univariate polynomial
Complexity lower bounds for approximation algebraic computation trees
Robust approximate zeros in Banach space
Fast linear homotopy to find approximate zeros of polynomial systems
Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain

This page was built for publication: On the worst-case arithmetic complexity of approximating zeros of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101184)