Convergence of algorithms for fixed points of relatively nonexpansive mappings via Ishikawa iteration
From MaRDI portal
Publication:6327059
arXiv1910.05541MaRDI QIDQ6327059FDOQ6327059
Authors: V. Pragadeeswarar, R. Gopi, Choonkil Park, D. Y. Shin 
Publication date: 12 October 2019
Abstract: By using the Ishikawa iterative algorithm, we approximate the fixed points and the best proximity points of a relatively non expansive mapping. Also, we use the von Neumann sequence to prove the convergence result in a Hilbert space setting. A comparison table is prepared using a numerical example which shows that the Ishikawa iterative algorithm is faster than some known iterative algorithms such as Picard and Mann iteration.
This page was built for publication: Convergence of algorithms for fixed points of relatively nonexpansive mappings via Ishikawa iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6327059)
