A simpler and more efficient fixed point iterative scheme
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909985708965888 |
|---|---|
| author | Mallick, Nida Izhar Uddin, Izhar |
| author_facet | Mallick, Nida Izhar Uddin, Izhar |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_05731 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A simpler and more efficient fixed point iterative scheme Mallick, Nida Izhar Uddin, Izhar Functional Analysis Numerical Analysis 47H09, 47H10 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. |
| title | A simpler and more efficient fixed point iterative scheme |
| topic | Functional Analysis Numerical Analysis 47H09, 47H10 |
| url | https://arxiv.org/abs/2601.05731 |