scholarly journals On the structure of fixed point sets of asymptotically regular mappings in Hilbert spaces

2009 ◽  
Vol 34 (2) ◽  
pp. 383 ◽  
Author(s):  
Jarosław Górnicki
Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1012
Author(s):  
Suthep Suantai ◽  
Narin Petrot ◽  
Montira Suwannaprapa

We consider the split feasibility problem in Hilbert spaces when the hard constraint is common solutions of zeros of the sum of monotone operators and fixed point sets of a finite family of nonexpansive mappings, while the soft constraint is the inverse image of a fixed point set of a nonexpansive mapping. We introduce iterative algorithms for the weak and strong convergence theorems of the constructed sequences. Some numerical experiments of the introduced algorithm are also discussed.


2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
F. O. Isiogugu

The strong convergence of a hybrid algorithm to a common element of the fixed point sets of multivalued strictly pseudocontractive-type mappings and the set of solutions of an equilibrium problem in Hilbert spaces is obtained using a strict fixed point set condition. The obtained results improve, complement, and extend the results on multivalued and single-valued mappings in the contemporary literature.


2000 ◽  
Vol 76 (1-2) ◽  
pp. 131-152 ◽  
Author(s):  
Dana M. Bedivan ◽  
Donal O′Regan

2020 ◽  
Vol 21 (1) ◽  
pp. 87 ◽  
Author(s):  
Laurence Boxer ◽  
P. Christopher Staecker

<p>In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results that often differ greatly from standard results in classical topology.</p><p>We introduce several measures related to fixed points for continuous self-maps on digital images, and study their properties. Perhaps the most important of these is the fixed point spectrum F(X) of a digital image: that is, the set of all numbers that can appear as the number of fixed points for some continuous self-map. We give a complete computation of F(C<sub>n</sub>) where C<sub>n</sub> is the digital cycle of n points. For other digital images, we show that, if X has at least 4 points, then F(X) always contains the numbers 0, 1, 2, 3, and the cardinality of X. We give several examples, including C<sub>n</sub>, in which F(X) does not equal {0, 1, . . . , #X}.</p><p>We examine how fixed point sets are affected by rigidity, retraction, deformation retraction, and the formation of wedges and Cartesian products. We also study how fixed point sets in digital images can be arranged; e.g., for some digital images the fixed point set is always connected.</p>


Sign in / Sign up

Export Citation Format

Share Document