Algebraic complexity of computing polynomial zeros

Authors: Victor Y. Pan

Source: Computers & Mathematics with Applications. 14:285-304

Subject Terms: zeros of polynomials, Analysis of algorithms and problem complexity, upper estimates of relative errors, Parallel numerical computation, 0102 computer and information sciences, sequential and parallel computational complexity, 01 natural sciences, Computational Mathematics, cost operations, Computational Theory and Mathematics, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), Modelling and Simulation, Numerical computation of solutions to single equations, 0101 mathematics, Graeffe-Runge method, Turan method

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/0898122187901374
https://core.ac.uk/display/82335874