Efficient iterative procedures for approximating fixed points of contractive-type mappings with applications-Reference-Cited by-同舟云学术

Efficient iterative procedures for approximating fixed points of contractive-type mappings with applications

Published:2024-07-01 Issue: Volume: Page:
ISSN:1017-1398
Container-title:Numerical Algorithms
language:en
Short-container-title:Numer Algor

Author:

Sharma Puneet,Ramos Higinio,Kanwar Vinay,Behl Ramandeep,Rajput Mithil

Abstract

AbstractThis paper introduces and analyzes some new highly efficient iterative procedures for approximating fixed points of contractive-type mappings. The stability, data dependence, strong convergence, and performance of the proposed schemes are addressed. Numerical examples demonstrate that the newly introduced schemes produce approximations of great accuracy and comparable to other similar robust schemes appeared in the literature. Nevertheless, all the schemes developed here are more efficient than other robust schemes used for comparison.

Funder

Universidad de Salamanca

Publisher

Springer Science and Business Media LLC

Link

https://link.springer.com/content/pdf/10.1007/s11075-024-01869-x.pdf

Reference30 articles.

1. Abbas, M., Nazir, T.: A new faster iteration process applied to constrained minimization and feasibility problems. Mat. Vesn. 66(2), 223–234 (2014)

2. Agarwal, R.P., O’Regan, D., Sahu, D.R.: Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 8(1), 61–79 (2007)

3. Akutsah, F., Narain, O.K., Afassinou, K., Mebawondu, A.A.: An iterative scheme for fixed point problems. Adv. Math.: Sci. J. 10(5), 2295–2316 (2021)

4. Berinde, V.: On the stability of some fixed point procedures. Bul. Ştiinţ. Univ. Baia Mare, Ser. B, Fasc. Mat. Inform. 18(1), 7–14 (2002)

5. Berinde, V.: Picard iteration converges faster than Mann iteration for a class of quasi-contractive operators. Fixed Point Theory and Appl. 2, 1–9 (2004)