2013IJSEATRequires access

Convergence Of Iterative Newton’s Method For The Solution Numerical Equations

Kusuma Kumari

Open publisher page 0 citations

Abstract

Abstract:In this paper an Iterative Newton’s method for the solution of simple and multiple roots of an equation f(x)=0 is given and it is proved that this method has second order convergence.

About this research paper

What this paper is about

Abstract:In this paper an Iterative Newton’s method for the solution of simple and multiple roots of an equation f(x)=0 is given and it is proved that this method has second order convergence.

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

Abstract:In this paper an Iterative Newton’s method for the solution of simple and multiple roots of an equation f(x)=0 is given and it is proved that this method has second order convergence.

Key concepts: Local convergence, Newton's method, Mathematics, Convergence (economics), Iterative method, Steffensen's method, Newton's method in optimization, Applied mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Convergence Of Iterative Newton’s Method For The Solution Numerical Equations — Research Paper | ScholarLens