A new method for solving complex roots of polynomial equations
Zhao Lian-peng
WANG Li-ying
MAO Shao-miao
Abstract：Solving of polynomial equations is a common computing problem in engineering design .Among the existing solutions , the Splitting Factor Method has the problems of slow convergence speed and no conver-gence , which leads to some limitations of the application of polynomial equations .Therefore , this paper proposes a new method to solve the defect of the Splitting Factor Method .In this method , combining the iterative mecha-nism of genetic algorithm and the basic idea of parallel computing , it has strong adaptability and global conver-gence.Especially in the solution of complex roots , this advantage is more obvious .Compared with the Splitting Factor Methods, this method not only avoids complex operation , but also has lower algorithm complexity and higher computational precision .For example , in numerical experiments , the relationship between the real num-ber and the plural is shown in this paper , which shows that the genetic algorithm combined with the parallel com-puting has good applicability in solving the complex root of polynomial equation .
Keywords：parallel computingcomplex rootgenetic aigorithmpolynomial equations
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 363-369 )