ScholarLens Back to search
2012•Journal of mathematical extension.Open access

A New Three-step Iterative Method forSolving Nonlinear Equations

M. Matin far, Mohammad Aminzadeh, Sasan Asadpour

Open full text 0 citations

Abstract

In this paper, a new three-step iterative method for finding a simple root of the nonlinear equation of f(x) = 0 will be introduced. This method is based on the two-step method of [C. Chun, Y. Ham, Some fourth-order modifications of Newton’s method, Appl. Math. Comput. 197 (2008) 654-658]. The new method requires three evaluations of the function and two of its first-derivative. We will prove that the order of convergence of the new method and its efficiency index will respectively be 8, and 1.5157. Some numerical experiments are given to illustrate the performance of the three-step iterative method.

About this research paper

What this paper is about

In this paper, a new three-step iterative method for finding a simple root of the nonlinear equation of f(x) = 0 will be introduced. This method is based on the two-step method of [C. Chun, Y. Ham, Some fourth-order modifications of Newton’s method, Appl. Math. Comput. 197 (2008) 654-658]. The new method requires three evaluations of the function and two of its first-derivative. We will prove that the order of convergence of the new method and its efficiency index will respectively be 8, and 1.5157. Some numerical experiments are given to illustrate the performance of the three-step iterative method.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, a new three-step iterative method for finding a simple root of the nonlinear equation of f(x) = 0 will be introduced. This method is based on the two-step method of [C. Chun, Y. Ham, Some fourth-order modifications of Newton’s method, Appl. Math. Comput. 197 (2008) 654-658]. The new method requires three evaluations of the function and two of its first-derivative. We will prove that the order of convergence of the new method and its efficiency index will respectively be 8, and 1.5157. Some numerical experiments are given to illustrate the performance of the three-step iterative method.

Key concepts: Mathematics, Iterative method, Newton's method in optimization, Local convergence, Nonlinear system, Root-finding algorithm, Convergence (economics), Simple (philosophy)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Three-step Iterative Method forSolving Nonlinear Equations — Research Paper | ScholarLens