Please use this identifier to cite or link to this item:
https://hdl.handle.net/10321/5615
Title: | On AI-iteration process for finding fixed points of enriched contraction and enriched nonexpansive mappings with application to fractional BVPs | Authors: | Oboyi, J. Orim, R. E. Ofem, A. E. Maharaj, A. Narain, O. K. |
Keywords: | Enriched contraction mapping;Enriched nonexpansive mapping;Stability;Fractional BVPs | Issue Date: | 2024 | Publisher: | SCIK Publishing Corporation | Source: | Oboyi, J. et al. 2024. On AI-iteration process for finding fixed points of enriched contraction and enriched nonexpansive mappings with application to fractional BVPs. Advances in Fixed Point Theory. doi:10.28919/afpt/8812 | Journal: | Advances in Fixed Point Theory | Abstract: | In this article, we consider the AI-iteration process for approximating the fixed points of enriched contraction and enriched nonexpansive mappings. Firstly, we prove the strong convergence of the AI-iteration process to the fixed points of enriched contraction mappings. Furthermore, we present a numerical experiment to demonstrate the efficiency of the AI-iterative method over some existing methods. Secondly, we establish the weak and strong convergence results of AI-iteration method for enriched nonexpansive mappings in uniformly convex Banach spaces. Thirdly, the stability analysis results of the considered method is presented. Finally, we apply our results to the solution of fractional boundary value problems in Banach spaces |
URI: | https://hdl.handle.net/10321/5615 | ISSN: | 1927-6303 (Online) | DOI: | 10.28919/afpt/8812 |
Appears in Collections: | Research Publications (Applied Sciences) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Oboyi et al_2024.pdf | 183.3 kB | Adobe PDF | View/Open | |
AFPT Copyright Clearance.docx | 220.14 kB | Microsoft Word XML | View/Open |
Page view(s)
54
checked on Dec 13, 2024
Download(s)
9
checked on Dec 13, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.