
doi: 10.1137/0221047
handle: 11568/174254
An algorithm for simultaneous approximation of all zeros of a polynomial introduced by Householder is considered. A modification suitable for parallel computation is proposed. The root-finding problem for a polynomial of degree \(n\), having zeros \(z_ i\), \(i=1,\dots,n\) is \(NC\)- reduced to finding a polynomial \(\alpha(z)\) such that \(| \alpha(z_{i+1})/\alpha(z_ i)|\leq 1-1/n^ c\), where \(c\) is a constant.
polynomial root- finding, Complexity and performance of numerical algorithms, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), Computational aspects of field theory and polynomials, parallel complexity, Numerical computation of solutions to single equations, Parallel numerical computation, polynomial zeros, Euclidean scheme
polynomial root- finding, Complexity and performance of numerical algorithms, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), Computational aspects of field theory and polynomials, parallel complexity, Numerical computation of solutions to single equations, Parallel numerical computation, polynomial zeros, Euclidean scheme
| 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). | 8 | |
| 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 |
