Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A modified Newton method for polynomials
Communications of the ACM
A stopping criterion for polynomial root finding
Communications of the ACM
Corrections to numerical data on Q-D algorithm
Communications of the ACM
Finding zeros of a polynomial by the Q-D algorithm
Communications of the ACM
Polynomial interpolation and polynomial root finding on OTIS-mesh
Parallel Computing
A family of root-finding methods with accelerated convergence
Computers & Mathematics with Applications
Parallel algorithms for finding polynomial Roots on OTIS-torus
The Journal of Supercomputing
OTIS-MOT: an efficient interconnection network for parallel processing
The Journal of Supercomputing
| Hi-index | 0.00 |
Frequent synchronisations have a significant effect on the efficiency of parallel numerical algorithms. In this paper we consider simultaneous polynomial zero-finding algorithms and analyse, both theoretically and numerically, the effect of removing the synchronisation restriction from these algorithms.