NUMERICAL RECKONING FIXED POINTS FOR BERINDE MAPPINGS VIA A FASTER ITERATION PROCESS

OpenAlex İngilizce

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.