Search arXivSearch

arXiv · 2609.08110

Third-order Halley-type iterative method with positive and bounded correction function

Abstract

In this paper, we propose a new one-point iterative method for finding simple roots of nonlinear equations by modifying Halley's method. Its correction function is positive and bounded on $\mathbb{R}$ and matches the local expansion of Halley's correction function near a simple root. The method avoids the singularity and sign reversal of Halley's correction function while retaining at least third-order local convergence. We also establish sufficient conditions for global convergence. Numerical experiments show that the proposed method achieves high convergence success rates and favorable iteration counts over a wide range of initial guesses. Further experiments near the singularity of Halley's correction function demonstrate robust convergence behavior of the proposed method. An application to the van der Waals equation illustrates the effectiveness of the proposed method.

Explore related subjects

Keep this discovery

BibTeXRIS

Hirai Mukasa. 2026-09-08. Third-order Halley-type iterative method with positive and bounded correction function. https://arxiv.org/abs/2609.08110

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT