Some modified Newton-type methods with order of convergence varied from two to siz under weak conditions
We present some modified Newton-type methods for solving nonlinear equations. These algorithms are free from second derivatives and permit f(x) = 0 in some iteration points. The convergent analysis demonstrates that the order of convergence and the efficiency index of the present methods are better than that of the classical Newtons method. Some numerical examples are given to illustrate their efficiency and performance.
Liang Fang Guoping He Yunhong Hu Li Sun
Taishan University College of Mathematics and System Science, Taian, 271021, China Shanghai Jiao To Shandong University of Science and Technology, College of Information Science and Engineering, Qingd Yuncheng University Department of Applied Mathematics, Yuncheng, 044000, China Shandong University o Shanghai Jiao Tong University Department of Mathematics, Shanghai, 200240, China
国际会议
三亚
英文
1687-1690
2009-04-24(万方平台首次上网日期,不代表论文的发表时间)