Finding zeros of a polynomial by the Q-D algorithm
Communications of the ACM
Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
Journal of the ACM (JACM)
Paper: Asynchronous polynomial zero-finding algorithms
Parallel Computing
Hi-index | 48.22 |