2010•Shuxue de shijian yu renshiRequires access

Variants of Newton's Iteration Method with Third-Order Convergence

Xiaofeng Wang

Open publisher page 0 citations

Abstract

Two variants of Newton's Iteration method are given.The orders of convergence of the variant methods are three.In the end,numerical tests show that the variant methods have some more advantages than the other known Newton's Iteration methods with thirdorder convergence.

About this research paper

What this paper is about

Two variants of Newton's Iteration method are given.The orders of convergence of the variant methods are three.In the end,numerical tests show that the variant methods have some more advantages than the other known Newton's Iteration methods with thirdorder 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 variants of Newton's Iteration method are given.The orders of convergence of the variant methods are three.In the end,numerical tests show that the variant methods have some more advantages than the other known Newton's Iteration methods with thirdorder convergence.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Variants of Newton's Iteration Method with Third-Order Convergence — Research Paper | ScholarLens