نتایج جستجو برای: common xed points
تعداد نتایج: 930174 فیلتر نتایج به سال:
the purpose of this paper is to study the convergence and the almost sure t-stability of the modied sp-type random iterative algorithm in a separable banach spaces. the bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure t-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. our resu...
in this paper, tripled coincidence points of mappings satisfying -contractive conditions in the framework of partially ordered gb-metric spaces are obtained. our results extend the results of aydi et al. [h. aydi, e. karapnar and w. shatanawi, tripled xed point results in generalized metric space, j. applied math., volume 2012, article id 314279, 10 pages]. moreover, some examples of the mai...
We present global and local algorithms for evaluating minimal xed points of dependency graphs, a general problem in xed-point computation and model checking. Our algorithms run in linear-time, matching the complexity of the best existing algorithms for similar problems, and are simple to understand. The main novelty of our global algorithm is that it does not use the counter and \reverse list" ...
in this paper, we prove some common fixed point results for two self mappingsf and g on s-metric space such that f is a g.w.c.m with respect to g.
Macbeath gave a formula for the number of xed points for each non-identity element of a cyclic group of automorphisms of a compact Riemann surface in terms of the universal covering transformation group of the cyclic group. We observe that this formula generalizes to determine the xed-point set of each non-identity element of a cyclic group of automorphisms acting on a closed non-orientable sur...
We show how the proof-assistant Coq helped us formally verify security properties of an API. As far as we know, this is the rst mathematical proof of security properties of an API. The API we veried is a xed version of Bond's modelization of IBM's Common Cryptographic Architecture. We explain the methodology we followed, sketch our proof and explain the points the formal veri cation raised.
In this paper a hybrid type theory HTT is deened which combines the programming language notion of partial type with the logical notion of total type into a single theory. A new partial type constructor A is added to the type theory: objects in A may diverge, but if they converge, they must be members of A. A xed point typing rule is given to allow for typing of xed points. The underlying theor...
Let g be a complex semisimple Lie algebra. In this paper, we prove that the action of a certain involution on canonical bases for irreducible g-modules deened by Lusztig agrees with the action of a special element of the associated simply connected Lie group, up to a scalar of unit absolute value. This leads to formulas for the number of xed points of the involution by means of the Weyl charact...
Diiusion processes on the Sierpinski gasket and the abc-gaskets are constructed as limits of random walks. In terms of the associated renor-malization group, the present method uses the inverse trajectories which converge to unstable xed points corresponding to the random walks on one-dimensional chains. In particular, non-degenerate xed points are unnecessary for the construction. A limit theo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید