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

牛顿迭代收敛的加速
引用本文:谢文平.牛顿迭代收敛的加速[J].航空计算技术,2004,34(4):34-36.
作者姓名:谢文平
作者单位:邵阳学院,数学系,湖南,邵阳,422000
摘    要:基于Newton迭代法单根的二阶收敛性和重根的线性收敛性,提出了加速牛顿迭代收敛的思想。利用反函数的性质,取Taylor展开式的前三项进行迭代;并利用差商代替导数的方法,构造出更高收敛阶的迭代公式。大量的数值实验结果表明,本文算法理论上的推导是完全可行的,且有效地提高了迭代公式的收敛速度。

关 键 词:收敛阶  反函数  差商  迭代法  重根问题
文章编号:1671-654X(2004)04-0034-03
修稿时间:2004年6月3日

The Acceleration of Convergence of Newton' s Iterative
XIE Wen-ping.The Acceleration of Convergence of Newton'''' s Iterative[J].Aeronautical Computer Technique,2004,34(4):34-36.
Authors:XIE Wen-ping
Abstract:Based on second - order convergence of simple root and first - order convergence of the heavy root of Newton iterative, This paper proposes a new idea for accelerating the convergence of Newton' s method This method is to utilize nature of inverse function, the first three which fetch the type that launches Taylor change taking the place of, Divided difference has appeared at the same time to replace a steps of derivatives, and constructs a kind of third - order convergence Newton' s iterative schemes. Indicate through a large amount of number value experimental results , deriving in theory is totally feasible, and has improved the speed of convergence which takes the place of the form of changing greatly .
Keywords:convergence  inverse function  divided difference  iterative algorithm  multiple roots problem  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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