2012/07/12 by Fei Shen, Wenyuan Wu, Shen, Fei +3
Computer Science · #FOS: Computer and information sciences #Symbolic Computation (cs.SC) #cs.SC
paper · pdf · doi:10.48550/arxiv.1207.3019
23 pages. Accepted by ASCM2012. Some typos have been corrected
arxiv created 2012/10/16 · arxiv updated 2012/10/17
A new algorithm for real root isolation of polynomial equations based on hybrid computation is presented in this paper. Firstly, the approximate (complex) zeros of the given polynomial equations are obtained via homotopy continuation method. Then, for each approximate zero, an initial box relying on the Kantorovich theorem is constructed, which contains the corresponding accurate zero. Finally, the Krawczyk interval iteration with interval arithmetic is applied to the initial boxes so as to check whether or not the corresponding approximate zeros are real and to obtain the real root isolation boxes. Meanwhile, an empirical construction of initial box is provided for higher performance. Our experiments on many benchmarks show that the new hybrid method is more efficient, compared with the traditional symbolic approaches.