Article detail · 2018 · article
NUMERICAL RECKONING FIXED POINTS FOR BERINDE MAPPINGS VIA A FASTER ITERATION PROCESS
Data source split
- YÖKSİSYÖKSİS article record
- YÖKSİS venueFacta Universitatis, Series: Mathematics and Informatics
- OpenAlexOpenAlex enrichment (abstract, citations, topics)
Abstract
In this work we prove that $M$-iteration process converges strongly faster than $S$-iteration and Picard-$S$ iteration processes. Moreover $M-$ iteration process is faster than $S_n$ iteration process with a sufficient condition for weak contractive mapping defined on a normed linear space. We also give two numerical reckoning examples to support our main theorem. For approximating fixed points, all codes were written in MAPLE \textcircled{c}2018 All rights reserved.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
3citationsOpenAlex · cited_by_count (cache / database)
1 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).