Some Modified Newton-Type Methods with Order of Convergence Varied from Two to Six under Weak Conditions
Liang Fang, Guoping He, Yunhong Hu, Li Sun
Abstract
Liang Fang, Guoping He, Yunhong Hu, Li Sun
Abstract
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 Newton's method. Some numerical examples are given to illustrate their efficiency and performance.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 Newton's method. Some numerical examples are given to illustrate their efficiency and performance.
Key concepts: Newton's method, Convergence (economics), Steffensen's method, Local convergence, Type (biology), Mathematics, Nonlinear system, Applied mathematics