CONVERGENCE THEOREM AND CONVERGENCE RATE OF A NEW FASTER ITERATION METHOD FOR CONTINUOUS FUNCTIONS ON AN ARBITRARY INTERVAL

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The aim of this paper is to propose a new faster iterative method, called the MNiteration process, for approximating a fixed point of continuous functions on an arbitrary interval. Then, a necessary and sufficient condition for the convergence of the MN-iteration of continuous functions on an arbitrary interval is established. We also compare the rate of convergence between the proposed iteration and some other iteration processes in the literature. Specifically, our main result shows that MN-iteration converges faster than NSP-iteration to the fixed point. We finally give numerical examples to compare the result with Mann, Ishikawa, Noor, SP and NSP iterations. Our findings improve corresponding results in the contemporary literature.

Cite

CITATION STYLE

APA

Chairatsiripong, C., Kittiratanawasin, L., Yambangwai, D., & Thianwan, T. (2023). CONVERGENCE THEOREM AND CONVERGENCE RATE OF A NEW FASTER ITERATION METHOD FOR CONTINUOUS FUNCTIONS ON AN ARBITRARY INTERVAL. Miskolc Mathematical Notes, 24(2), 709–724. https://doi.org/10.18514/MMN.2023.3978

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free