On the Complexity of Polynomial Zeros
From MaRDI portal
Publication:4018402
DOI10.1137/0221047zbMath0756.65071OpenAlexW1993289606MaRDI QIDQ4018402
Dario Andrea Bini, Luca Gemignani
Publication date: 16 January 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221047
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Related Items
Simultaneous factorization of a polynomial by rational approximation, Optimal and nearly optimal algorithms for approximating polynomial zeros, Efficient parallel factorization and solution of structured and unstructured linear systems