首页 | 本学科首页   官方微博 | 高级检索  
     

求多项式全部零点的快速Halley算法
引用本文:崔向照,杨大地,龙瑶. 求多项式全部零点的快速Halley算法[J]. 工程数学学报, 2006, 23(3): 511-517
作者姓名:崔向照  杨大地  龙瑶
作者单位:红河学院数学系,云南,661100;重庆大学数理学院,重庆,400044
摘    要:在Halley圆盘迭代法的基础上,用圆盘算术构造了一种求多项式全部零点的快速Halley算法,并在与Halley迭代法相同的条件下建立了它的收敛性定理,该算法取得了七阶收敛速度。数值结果表明该算法是十分有效的。

关 键 词:多项式  全部零点  快速算法
文章编号:1005-3085(2006)03-0511-07
收稿时间:2004-03-18
修稿时间:2004-03-18

The Fast Halley Algorithm for Finding all Zeros of a Polynomial
CUI Xiang-zhao,YANG Da-di,LONG Yao. The Fast Halley Algorithm for Finding all Zeros of a Polynomial[J]. Chinese Journal of Engineering Mathematics, 2006, 23(3): 511-517
Authors:CUI Xiang-zhao  YANG Da-di  LONG Yao
Affiliation:1. Department of Mathematics, Honghe University, Yunnan 661100; 2. College of Mathematics and Physics, Chongqing University, Chongqing 400044
Abstract:Based on the Halley circular iteration method,a fast Halley algorithm is constructed by circular arithmetic for finding all zeros of a polynomial,and the convergence has been established under the same condition as that for the Halley iteration method,the convergence rate of seventh order is obtained.The numerical experiments show the efficiency of the proposed algorithm.
Keywords:polynomial  all zeros  fast algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号