On the cost of approximating all roots of a complex polynomial
Copyright policy )On the cost of approximating all roots of a complex polynomial
The author examines the computational complexity of the algorithm of \textit{H. W. Kuhn} [Fixed Points. Algorithms and Applications, Proc. 1st int. Conf., Clemson/South Carolina 1976, 11-39 (1977; Zbl 0431.65032)] for the approximation of the (simple) roots of a complex polynomial within a probabilistic framework.
- Colorado State University United States
computational complexity, Newton's method, zeros of polynomials, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), homotopy algorithm, Numerical computation of solutions to single equations, complex polynomial
computational complexity, Newton's method, zeros of polynomials, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), homotopy algorithm, Numerical computation of solutions to single equations, complex polynomial
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).13 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!