Parallelized methods for solving polynomial equations

The current microprocessors are concentrating on the multiprocessor or multi -core system architecture.The parallel algorithms are recently focusing on multi -core system to take full utilization of multiple processors available in the system.The design of parallel algorithm and performance measurement is the major issue on today's multi -core environment.Numerical problems arise in almost every branch of science which requires fast solution.In this paper we have presented parallel algorithms for computing the solution of system of non -linear equations and approximate the simple zeros of polynomial equations.The experimental results reveal that the performances of parallel algorithms are better than sequential.We implemented the parallel algorithms using multithreading features of OpenMP.