摘要
提出了促使迭代ｘｎ＋１＝ｇ（ｘｎ）加速收敛的两种算法，其效率远优于著名的Ｓｔｅｆｅｎｓｅｎ算法，也优于文［１］提出的改进算法，两种算法的实质是求解方程ｘ－ｇ（ｘ）＝０的二次插值法．
Abstract This paper proposes two algorithms for accelerating convergence of the iteration x n+1 =g(x n). Their efficiecies are more superior than the sfeffensen algorithm and the improved algorithm supplied in the reference . Both algorithms are second degree interpolation method for solving the equation x-g(x)=0.
出处
《工程数学学报》
CSCD
北大核心
1998年第1期117-120,共4页
Chinese Journal of Engineering Mathematics
