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

被引:1
|
作者
Khemphet, Anchalee [1 ]
Suparatulatorn, Raweerote [1 ]
Varnakovida, Pariwate [2 ,3 ]
Charoensawan, Phakdi [1 ]
机构
[1] Chiang Mai Univ, Fac Sci, Dept Math, Chiang Mai 50200, Thailand
[2] King Mongkuts Univ Technol Thonburi, Fac Sci, KMUTT Geospatial Engn & Innovat Ctr, Bangkok 10140, Thailand
[3] King Mongkuts Univ Technol Thonburi, Fac Sci, Dept Math, Bangkok 10140, Thailand
来源
SYMMETRY-BASEL | 2023年 / 15卷 / 07期
关键词
parallel algorithm; inertial technique; G-nonexpansive mapping; fixed-point problem; process innovation;
D O I
10.3390/sym15071464
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
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.
引用
收藏
页数:11
相关论文
共 50 条