INERTIAL PICARD NORMAL S-ITERATION PROCESS

Samir Dashputre, . Padmavati, Kavita Sakure

Abstract


Many iterative algorithms like that Picard, Mann, Ishikawa and S-iteration are very useful to elucidate the fixed point problems of a nonlinear operators in various topological spaces. The recent trend for elucidate the fixed point via inertial iterative algorithm, in which next iterative depends on more than one previous terms. The purpose of the paper is to establish convergence theorems of new inertial Picard normal S-iteration algorithm for nonexpansive mapping in Hilbert spaces. The comparison of convergence of InerNSP and InerPNSP is done with InerSP (introduced by Phon-on et al. [25]) and MSP (introduced by Suparatulatorn et al. [27]) via numerical example.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


ISSN: 1229-1595 (Print), 2466-0973 (Online)

(51767) 7 Kyungnamdaehak-ro, Masanhappo-gu, Changwon-si, Gyeongsangnam-do, Republic of Korea