2026-10-19T02:18:29Zhttps://ebyu-rdlopen.rawdatalibrary.net/oai/request

oai:ebyu-rdlopen.rawdatalibrary.net:ebyu/169712026-10-18T20:41:10Zopenairedrivercom_ebyu_10000col_ebyu_10001

NUMERICAL RECKONING FIXED POINTS FOR BERINDE MAPPINGS VIA A FASTER ITERATION PROCESSAlagoz, OsmanGunduz, BirolAkbulut, SezginIteration processfixed pointweak contractive mappingnormed linear spaceNONEXPANSIVE-MAPPINGSCONVERGENCESPACESMathematicsIn 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 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 (C) 2018 All rights reserved.UNIV NIS2018Articlehttps://rdlopen.rawdatalibrary.net/r/ebyu/16971https://doi.org/10.22190/fumi1802295a0352-9665enFACTA UNIVERSITATIS-SERIES MATHEMATICS AND INFORMATICSinfo:eu-repo/semantics/openAccessinfo:eu-repo/semantics/articlehttps://ebyu-rdlopen.rawdatalibrary.net/tr/items/ebyu/16971