E是一实Banach空间,K是E的一非空闭凸子集.设f:K→K是一压缩映象,T1,T2…,TN∶K→K是具序列{kn}[1,+∞),lim kn=1 n→∞的有限簇一致L-Lipschitzian渐近伪压缩映象,且∩F(Ti)≠Φ from i=1 to N.设序列{xn}定义为xn+1=(1-αn-βn)xn+...E是一实Banach空间,K是E的一非空闭凸子集.设f:K→K是一压缩映象,T1,T2…,TN∶K→K是具序列{kn}[1,+∞),lim kn=1 n→∞的有限簇一致L-Lipschitzian渐近伪压缩映象,且∩F(Ti)≠Φ from i=1 to N.设序列{xn}定义为xn+1=(1-αn-βn)xn+αnf(xx)+βnTrnnyn yn=(1-γn)xn+γnTrnnxn,n≥0其中{αn},{βn},{γn}[0,1],rn=n mod N.文章在一定条件下,用黏性逼近法证明了迭代序列{xn}强收敛于T1,T2,…,TN的公共不动点.该文结果推广和改进了一些文献的最新结果.展开更多
在实Banach空间中,研究迭代序列x(n+1)=P[(1-αn)xn+αn(1/(n+1))∑ from j=1 to n+1 T(PT)^(j-1)yn],yn=P[(1-βn)xn+βn(1/(n+1))∑ from j=1 to n+1 T(PT)^(j-1)xn]在对参数适当限制条件下逼近一致L-Lipschitzian非自映象的不动点问题.
The purpose of this paper is to study necessary and su?cient condition for the strong convergence of a new parallel iterative algorithm with errors for two finite families of uniformly L-Lipschitzian mappings in Bana...The purpose of this paper is to study necessary and su?cient condition for the strong convergence of a new parallel iterative algorithm with errors for two finite families of uniformly L-Lipschitzian mappings in Banach spaces. The results presented in this paper improve and extend the recent ones announced by [2–7].展开更多
文摘E是一实Banach空间,K是E的一非空闭凸子集.设f:K→K是一压缩映象,T1,T2…,TN∶K→K是具序列{kn}[1,+∞),lim kn=1 n→∞的有限簇一致L-Lipschitzian渐近伪压缩映象,且∩F(Ti)≠Φ from i=1 to N.设序列{xn}定义为xn+1=(1-αn-βn)xn+αnf(xx)+βnTrnnyn yn=(1-γn)xn+γnTrnnxn,n≥0其中{αn},{βn},{γn}[0,1],rn=n mod N.文章在一定条件下,用黏性逼近法证明了迭代序列{xn}强收敛于T1,T2,…,TN的公共不动点.该文结果推广和改进了一些文献的最新结果.
文摘在实Banach空间中,研究迭代序列x(n+1)=P[(1-αn)xn+αn(1/(n+1))∑ from j=1 to n+1 T(PT)^(j-1)yn],yn=P[(1-βn)xn+βn(1/(n+1))∑ from j=1 to n+1 T(PT)^(j-1)xn]在对参数适当限制条件下逼近一致L-Lipschitzian非自映象的不动点问题.
基金supported by the National Natural Science Foun-dation of China (11071169)the Natural Science Foundation of Zhejiang Province (Y6110287)
文摘The purpose of this paper is to study necessary and su?cient condition for the strong convergence of a new parallel iterative algorithm with errors for two finite families of uniformly L-Lipschitzian mappings in Banach spaces. The results presented in this paper improve and extend the recent ones announced by [2–7].