检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Xinhong Chen[1] Yanlai Song[1] Jianying He[1] Liping Gong[1]
出 处:《Journal of Applied Mathematics and Physics》2019年第10期2187-2199,共13页应用数学与应用物理(英文)
摘 要:The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.
关 键 词:HILBERT Space Demimetric Mapping SPLIT Common Fixed Point PROBLEM SELF-ADAPTIVE Algorithm
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.145.114