Polynomials Root-Finding Using a SLEFE-Based Clipping Method  

作　　者：Ping Jiang Xingqiao Wu Zhi Liu 

机构地区：[1]School of Mathematics,Hefei University of Technology,Hefei 230009,China

出　　处：《Communications in Mathematics and Statistics》2016年第3期311-322,共12页数学与统计通讯（英文）

基　　金：the joint grant by National Natural Science Foundation ofChina(No.11471093);Thanks to the authors of references for the valuable ideas to this paper and thanksto the reviewers for their precious opinions proposed to this paper.

摘　　要：For finding the real roots of a polynomial,we propose a clipping algorithmcalled SLEFEclipping and an isolation algorithmcalled SLEFEisolation algorithm.Ateach iterative step,the SLEFEclipping algorithm generates two broken lines boundingthe given polynomial.Then,a sequence of intervals can be obtained by computing theintersection of the sequence of broken lines with the abscissa axis.The sequence ofthese intervals converges to the root with a convergence rate of 2.Numerical examplesshow that SLEFE clipping requires fewer iterations and less computation time thancurrent algorithms,and the SLEFE isolation algorithm can compute all intervals thatcontain the roots rapidly and accurately.

关 键 词：POLYNOMIAL ROOT-FINDING SLEFE clipping Real root interval isolation 

分 类 号：O17[理学—数学]