A Modified Parallel Algorithm for a Common Fixed-Point Problem with Application to Signal Recovery

Journal article

Authors/Editors

PARIWATE VARNAKOVIDA

Strategic Research Themes

Simulation (Computational Science and Engineering)

Publication Details

Author list: Khemphet A., Suparatulatorn R., Varnakovida P., Charoensawan P.

Publisher: MDPI

Publication year: 2023

Volume number: 15

Issue number: 7

ISSN: 20738994

eISSN: 2073-8994

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85166254018&doi=10.3390%2fsym15071464&partnerID=40&md5=670366c742698ffd3ff0b542400f3c36

Languages: English-Great Britain (EN-GB)

View in Web of Science | View on publisher site | View citing articles in Web of Science

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. © 2023 by the authors.

Keywords

G-nonexpansive mapping