Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493): Difference between revisions

The author develops two nearly optimal effective algorithms to approximate all roots of a univariate ploynomial. Two algorithms are combined in a single recursive process which leads to computation of the complete numerical factorization of a polynomial into the product of linear factors and further to the approximation of the roots. Both algorithms allow processor efficient acceleration to achieve the solution in polylogarithmic parallel time.