  We propose an approach to constructing iterative methods for finding
polynomial roots simultaneously. One feature of this approach is using the
fundamental theorem of symmetric polynomials. Within this framework, we
reconstruct many of the existing root finding methods. The new results
presented in this paper are some modifications of the Durand-Kerner method.
