On the cost of computing roots of polynomials
From MaRDI portal
Publication:3330394
DOI10.1007/BF02612355zbMath0542.65025MaRDI QIDQ3330394
Sen-Lin Xu, Ze-Ke Wang, Harold W. Kuhn
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
computational complexity; zeros of a polynomial; roots of polynomials; complementary pivoting; piecewise linear homotopy
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
Related Items
How to be sure of finding a root of a complex polynomial using Newton's method, Some computational methods for systems of nonlinear equations and systems of polynomial equations, On the complexity of a PL homotopy algorithm for zeros of polynomials