Table of Contents
Fetching ...

A simpler and more efficient fixed point iterative scheme

Nida Izhar Mallick, Izhar Uddin

TL;DR

The paper addresses the approximation of fixed points for self-nonexpansive mappings $K: W\to W$ in Banach spaces. It introduces a simpler, two-parameter Ishikawa-like iterative scheme with updates defined by $s_1=(1-\beta_n)s_n+\beta_n Ks_n$ and $s_{n+1}=(1-\alpha_n) r_n+\alpha_n Ks_n$, where $\alpha_n,\beta_n\in(a,b)\subset(0,1)$. The authors prove weak convergence to a fixed point in a uniformly convex Banach space and strong convergence under Condition $(I)$ together with $\liminf_{n\to\infty} d(s_n,F(K))=0$, supplemented by a numerical example showing faster convergence than classical methods (Mann, Ishikawa, Noor). These results indicate a simpler yet faster-converging method for fixed-point problems with potential broad applicability in applied mathematics.

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.

A simpler and more efficient fixed point iterative scheme

TL;DR

The paper addresses the approximation of fixed points for self-nonexpansive mappings in Banach spaces. It introduces a simpler, two-parameter Ishikawa-like iterative scheme with updates defined by and , where . The authors prove weak convergence to a fixed point in a uniformly convex Banach space and strong convergence under Condition together with , supplemented by a numerical example showing faster convergence than classical methods (Mann, Ishikawa, Noor). These results indicate a simpler yet faster-converging method for fixed-point problems with potential broad applicability in applied mathematics.

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.
Paper Structure (5 sections, 8 theorems, 34 equations, 3 figures, 1 table)

This paper contains 5 sections, 8 theorems, 34 equations, 3 figures, 1 table.

Key Result

Lemma 2.1

G Let $Z$ be a uniformly convex Banach space, $W$ a closed and convex subset of $Z$, and $K: W \to W$ nonexpansive mapping. Then $I-T$ is demiclosed on $W$.

Figures (3)

  • Figure 1: Convergence path of Ishikawa iteration and the proposed iteration for the fixed point of $g(x)=1-x$.
  • Figure 2: Difference between Ishikawa iteration and our proposed iteration.
  • Figure 3:

Theorems & Definitions (17)

  • Definition 2.1
  • Definition 2.2
  • Lemma 2.1
  • Proposition 2.1
  • Definition 2.3
  • Definition 2.4
  • Theorem 2.2
  • Lemma 3.1
  • proof
  • Lemma 3.2
  • ...and 7 more