Báo cáo hóa học: " Research Article Iterative Approximation to Convex Feasibility Problems in Banach Space" pptx

... Corporation Fixed Point Theory and Applications Volume 2007, Article ID 46797, 19 pages doi:10.1155/2007/46797 Research Article Iterative Approximation to Convex Feasibility Problems in Banach Space Shih-Sen ... Rhoades The convex feasibility problem (CFP) of finding a point in the nonempty intersection ∩ N i =1 C i is considered, where N ≥ 1isanintegerandeachC i is...

Ngày tải lên: 22/06/2014, 19:20

... 2007. Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2010, Article ID 476913, 8 pages doi:10.1155/2010/476913 Research Article Viscosity Approximation to Common Fixed Points ... strictly convex Banach space X and T : C → C is a nonexpansive mapping, then the fixed point set FT of T is a closed convex subset of C. By a gauge function we mean a contin...

Ngày tải lên: 21/06/2014, 11:20

... references therein. In this paper, motivated by the research work going on in this direction, we continue to consider the problem of finding a zero of the maximal monotone operator T. The iterative algorithms ... 1.14.Theresults Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2011, Article ID 282171, 18 pages doi:10.1155/2011/282171 Research Article...

Ngày tải lên: 21/06/2014, 11:20

... nonexpansive mapping defined on a uniformly convex Banach space and uses the fact that every uniformly convex space is reflexive. In 5, Singh extended Theorem 1.1 to reflexive Banach spaces by assuming further ... 2.49 Thus a shrinking mapping is nonexpansive but need not be a contraction mapping. If T is a shrinking mapping, then I − B −1 exists but need not be continuous. The...

Ngày tải lên: 21/06/2014, 11:20

... points of T.Apointp in C is said to be an asymptotic fixed point of T 2–4 if C contains a sequence {x n } which converges weakly to p such that lim n →∞ Tx n − x n   0. The set of asymptotic ... mapping but not relatively nonexpansive mapping. In this paper, we give an example which is weak relatively nonexpansive mapping but not relatively nonexpansive mapping in Banach space...

Ngày tải lên: 21/06/2014, 17:20

... wFPP. Recently in 2008 Cowell and Kalton 6 studied properties au and au ∗ in a Banach space X, where au coincides with WORT H if X is separable and au ∗ in X coincides with WORTH ∗ in X ∗ if X ... property which interests us in this paper, it was given by Garc ´ ıa- Falset and Llor ´ ens Fuster in 1990 7. Hindawi Publishing Corporation Fixed Point Theory and Applications Vol...

Ngày tải lên: 21/06/2014, 20:20

... is to load each subcarrier according to the channel state in- formation (CSI). Under a constrained transmit power, the well-known water-filling principle [4] gives the optimal so- lution of the problems ... N-point inverse Fourier transform to an input data vector and next a cyclical extension of the symbol with the last N G samples, that is, the so-called guard interval is added at...

Ngày tải lên: 22/06/2014, 19:20

... Method in Nonlinear Analysis, Shandong Scientific Technical Press, Jinan, China, 2000. 15 D. J. Guo and V. Lakshmikantham, Nonlinear Problems in Abstract Cones, vol. 5 of Notes and Reports in Mathematics ... αη /  1and ft, x is mixed nonmonotone in x and does not need to be separable by using the cone theory and the Banach contraction mapping principle. 2. Preliminaries Let...

Ngày tải lên: 21/06/2014, 05:20

... Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2011, Article ID 158219, 7 pages doi:10.1155/2011/158219 Research Article L p Approximation by Multivariate Baskakov-Durrmeyer ... distribution, and reproduction in any medium, provided the original work is properly cited. The main aim of this paper is to introduce and study multivariate Baskakov-Durrme...

Ngày tải lên: 21/06/2014, 05:20

... is interesting to observe that in this expression, al l those indices in error detected by the BCH decoder will consequently drive a flip in the soft information fed to the SENSING subgraph. Finally ... will be explained in next section. 3. Iterative Joint Decoding and Data Fusion In order to estimate the aforementioned original information sequence {x S k } K k =1 , the opt...

Ngày tải lên: 21/06/2014, 07:20