2011Harbin Ligong Daxue xuebaoOpen access

Two Classes of Newton's Iteration Methods with Third-order Convergence

Xiaofeng Wang

Open full text 0 citations

Abstract

Two classes of Newton's variants Iteration method are given.The orders of convergence of the variant methods are three at least.Numerical tests show that the variant methods have more advantages than the other known Newton's Iteration methods with third-order convergence.

About this research paper

What this paper is about

Two classes of Newton's variants Iteration method are given.The orders of convergence of the variant methods are three at least.Numerical tests show that the variant methods have more advantages than the other known Newton's Iteration methods with third-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

Two classes of Newton's variants Iteration method are given.The orders of convergence of the variant methods are three at least.Numerical tests show that the variant methods have more advantages than the other known Newton's Iteration methods with third-order convergence.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Two Classes of Newton's Iteration Methods with Third-order Convergence — Research Paper | ScholarLens