Efficiency of a new iterative algorithm using fixed-point approach in the settings of uniformly convex Banach spaces

dc.contributor.authorSrivastava, Rekha
dc.contributor.authorAhmed, Wakeel
dc.contributor.authorTassaddiq, Asifa
dc.contributor.authorAlotaibi, Nouf
dc.date.accessioned2024-10-10T17:23:08Z
dc.date.available2024-10-10T17:23:08Z
dc.date.issued2024
dc.description.abstractIn the presence of Banach spaces, a novel iterative algorithm is presented in this study using the Chatterjea–Suzuki–C (CSC) condition, and the convergence theorems are established. The efficacy of the proposed algorithm is discussed analytically and numerically. We explain the solution of the Caputo fractional differential problem using our main result and then provide the numerical simulation to validate the results. Moreover, we use MATLAB R (2021a) to compare the obtained numerical results using the new iterative algorithm with some efficient existing algorithms. The work seems to contribute to the current advancement of fixed-point approximation iterative techniques in Banach spaces.
dc.description.reviewstatusReviewed
dc.description.scholarlevelFaculty
dc.identifier.citationSrivastava, R., Ahmed, W., Tassaddiq, A., & Alotaibi, N. (2024). Efficiency of a new iterative algorithm using fixed-point approach in the settings of uniformly convex Banach spaces. Axioms, 13(8), Article 8. https://doi.org/10.3390/axioms13080502
dc.identifier.urihttps://doi.org/10.3390/axioms13080502
dc.identifier.urihttps://hdl.handle.net/1828/20514
dc.language.isoen
dc.publisherAxioms
dc.rightsAttribution CC BY
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleEfficiency of a new iterative algorithm using fixed-point approach in the settings of uniformly convex Banach spaces
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
srivastava_rekha_axioms_2024.pdf
Size:
544.68 KB
Format:
Adobe Portable Document Format