Fast parallel algorithms for Graeffeʹs root squaring technique

This paper presents two parallel algorithms for the solution of a polynomial equation of degree n, where n can be very large. The algorithms are based on Graeffeʹs root squaring technique implemented on two different systolic architectures, built around mesh of trees and multitrees, respectively. Each of these algorithms requires O(log n) time using O(n2) processors.