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


Creative Commons License

Alagöz O., Gündüz B., Akbulut S.

FACTA UNIVERSITATIS-SERIES MATHEMATICS AND INFORMATICS, cilt.33, sa.2, ss.295-305, 2018 (Hakemli Dergi)

Özet

In this paper we prove that the M-iteration process converges strongly faster than S-iteration and Picard-S iteration processes. Moreover, the M− iteration process is faster than the Sn 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 c 2018 All rights reserved.