Determining xed points of nonexpansive mappings is a frequent problem in mathematics and physical sciences. An algorithm for nding common xed points of nonexpansive mappings in Hilbert space, essentially due to Halpern, is analyzed. The main theorem extends Wittmann's recent work and partially generalizes a result by Lions. Algorithms of this kind have been applied to the convex feasibility pro...

in this paper we formulate and prove some xed and common xed pointtheorems for self-mappings dened on complete lower transversal functionalprobabilistic spaces.

in this paper we investigate common xed point theorems for contraction mapping in fuzzy metric space introduced by gregori and sapena [v. gregori, a. sapena, on xed-point the- orems in fuzzy metric spaces, fuzzy sets and systems, 125 (2002), 245-252].

Some algorithms for nding common xed point of a family of mappings isconstructed. Indeed, let C be a nonempty closed convex subset of a uniformlyconvex Banach space X whose norm is Gateaux dierentiable and let {Tn} bea family of self-mappings on C such that the set of all common fixed pointsof {Tn} is nonempty. We construct a sequence {xn} generated by the hybridmethod and also we give the cond...

In this paper, we introduce a new iterative scheme to approximate a common fixed point for a finite family of nonexpansive non-self mappings. Strong convergence theorems of the proposed iteration in Banach spaces.

Let be a nite alphabet, and let h : ! be a morphism. Finite and innnite xed points of morphisms | i.e., those words w such that h(w) = w | play an important role in formal language theory. Head characterized the nite xed points of h, and later, Head and Lando characterized the one-sided innnite xed points of h. Our paper has two main results. First, we complete the characterization of xed point...

In this paper we investigate common xed point theorems for contraction mapping in fuzzy metric space introduced by Gregori and Sapena [V. Gregori, A. Sapena, On xed-point the- orems in fuzzy metric spaces, Fuzzy Sets and Systems, 125 (2002), 245-252].

Let be a nite alphabet, and let h : ! be a morphism. Finite and innnite xed points of morphisms | i.e., those words w such that h(w) = w | play an important role in formal language theory. Head characterized the nite xed points of h, and later, Head and Lando characterized the one-sided innnite xed points of h. In this paper, we complete the characterization of xed points of morphisms by descri...

Graphical models, such as Bayesian networks and Markov random elds, represent statistical dependencies of variables by a graph. The max-product \belief propagation" algorithm is a local-message passing algorithm on this graph that is known to converge to a unique xed point when the graph is a tree. Furthermore, when the graph is a tree, the assignment based on the xedpoint yields the most proba...

The dynamic behaviour of discrete event systems with only maximum timing constraints (or, dually, only minimum timing constraints) can be studied by linear methods based on max-plus algebra, as discussed in the recent book \Synchronization and Linearity" by Bac-celli, Cohen, Quadrat and Olsder. Systems with both maximum and minimum constraints are non-linear from this perspective and only limit...