Optimal Order Iterative Methods

preprint OA: closed
View at publisher

Abstract

Based on Newton’s method and interpolation method, we establish two iterative methods for solving the nonlinear equations by using n+1 evaluations of the function(or the first derivative) per iteration. Analysis of convergence shows that our methods arrive at the optimal order of convergence 2^n, where the n is any a nature number. This work also proves the conjecture of Kung-Traub (J.ACM643-651,1974) for constructing multipoint optimal iterations.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-06-02T02:00:03.124865+00:00