نتایج جستجو برای: common xed points

تعداد نتایج: 930174  

S. Ghafari V. Dadashi

In this paper we propose and studied a new composite iterative scheme with certain control con-ditions for viscosity approximation for a zero of accretive operator and xed points problems in areflexive Banach space with weakly continuous duality mapping. Strong convergence of the sequencefxng dened by the new introduced iterative sequence is proved. The main results improve andcomplement the co...

1994
F. van Breugel J. Warmerdam Franck van Breugel Jeroen Warmerdam

In order to solve domain equations over 1-bounded compact metric spaces, xed points of functors on categories of 1-bounded compact metric spaces are studied. Two categories of 1-bounded compact metric spaces are considered: KMS and KMS E. In both categories, objects are isomorphic if and only if they are isometric. As a consequence, provided that the operation of a domain equation can be extend...

1996
Derek R. Dreyer Michael L. Overton

The Steiner tree problem is to nd the tree with minimal Euclidean length spanning a set of xed points in the plane, given the ability to add points (Steiner points). The problem is NP-hard, so polynomial-time heuristics are desired. We present two such heuristics, both of which utilize an eecient method for computing a locally optimal tree with a given topology. The rst systematically inserts S...

1998
Charles J. Colbourn

Doyen conjectured that there is no Steiner 2-design having an automorphism with more than r + 1 but fewer than r + p r ? 1 xed points, where r is the replication number. The falsity of this conjecture is shown by describing 2-(45,5,1) designs having an automorphism of order 2 with exactly 13 xed points.

2001
Luc Devroye Ralph Neininger

An algorithm is developed for the exact simulation from distributions that are deened as xed-points of maps between spaces of probability measures. The xed-points of the class of maps under consideration include examples of limit distributions of random variables studied in the probabilistic analysis of algorithms. The sampling algorithm relies on a modiied rejection method.

Journal: :Kathedra of Byzantine and Modern Greek Studies 2020

Journal: :Discrete & Computational Geometry 1988
Nimrod Megiddo

It is NP complete to recognize whether two sets of points in general space can be separated by two hyperplanes It is NP complete to recognize whether two sets of points in the plane can be separated with k lines For every xed k in any xed dimension it takes polynomial time to recognize whether two sets of points can be separated with k hyperplanes

In this paper, we will establish some xed point results for two pairs of self mappings satisfying generalized contractive condition by using a new concept as weak subsequential continuity with compatibility of type (E) in metric spaces, as an application the existence of unique common solution for a system of functional equations arising in system programming is proved.

A. Sombabu, B. Srinuvasa Rao G.N.V. Kishore, Huseyin IsIk K.P.R. Rao

In this paper, we establish the existence and uniqueness of common coupled xed point results for three covariant mappings in bipolar metric spaces. Moreover, we give an illustration which presents the applicability of the achieved results also we provided applications to homotopy theory as well as integral equations.

1996
Colin Stirling

We deene Ehrenfeucht-Fra ss e games which exactly capture the expressive power of the extremal xed point operators of modal mu-calculus. The resulting games have signiicance, we believe, within and outside of concurrency theory. On the one hand they naturally extend the iterative bisimulation games associated with Hennessy-Milner logic, and on the other hand they ooer deeper insight into the lo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید