Abstract

In this work, an algorithm is introduced for the problem of finding a common fixed point of a finite family of G-nonexpansive mappings in a real Hilbert space endowed with a directed graph G. This algorithm is a modified parallel algorithm inspired by the inertial method and the Mann iteration process. Moreover, both weak and strong convergence theorems are provided for the algorithm. Furthermore, an application of the algorithm to a signal recovery problem with multiple blurring filters is presented. Consequently, the numerical experiment shows better results compared with the previous algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call