HackerPapers

arXiv:2601.05731math.FA

A simpler and more efficient fixed point iterative scheme

Nida Izhar Mallick, Izhar Uddin

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions on the underlying operator, we establish weak convergence and strong convergence results for the generated sequence. To demonstrate the effectiveness of the proposed scheme, we present a numerical example and perform a detailed comparative study with several well-known iterative methods from the literature. The numerical results clearly indicate that the proposed method exhibits a faster rate of convergence than the existing schemes, thereby confirming its computational advantage. These findings suggest that the new iterative process provides an efficient and reliable alternative for solving fixed point problems arising in applied mathematics and related fields.

arXiv comments
12 pages, 3 figures, 1 table
Journal reference
DOI
Subjects
math.FAFunctional Analysis math.NANumerical Analysis

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jan 2026 to Jan 2026. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.