نتایج جستجو برای: metric structure

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

Journal: :international journal of nonlinear analysis and applications 0
kamal fallahi department of mathematics, payame noor university, p.o. box 19395-3697, tehran, iran aris aghanians department of mathematics, payame noor university, p.o. box 19395-3697, tehran, iran

in this work‎, ‎we formulate chatterjea contractions using graphs in metric spaces endowed with a graph ‎‎and‏ ‎‎‎‎investigate ‎the ‎existence‎ ‎of ‎fixed ‎points ‎for such mappings ‎under two different hypotheses‎. we also discuss the uniqueness of the fixed point. the given result is a generalization of chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a g...

Journal: :journal of linear and topological algebra (jlta) 0
g soleimani rad young researchers and elite club, central tehran branch, islamic azad university, tehran, iran i altun department of mathematics, faculty of science and arts, kirikkale university, 71450 yahsihan, kirikkale, turkey

in this paper we consider the so called a vector metric space, which is a generalization of metric space, where the metric is riesz space valued. we prove some common fixed point theorems for three mappings in this space. obtained results extend and generalize well-known comparable results in the literature.

Journal: :sahand communications in mathematical analysis 0
kamal fallahi department of mathematics, payame noor university, p.o. box 19395-3697, tehran, iran. ghasem soleimani rad department of mathematics, payame noor university, p.o. box 19395-3697, tehran, iran.

in this paper, we prove the existence of fixed point for chatterjea type mappings under $c$-distance in cone metric spaces endowed with a graph. the main results extend, generalized and unified some fixed point theorems on $c$-distance in metric and cone metric spaces.

2010
Joseph Thomas John Kececioglu

We consider the problem of computing nearest neighbors in an arbitrary metric space, particularly a metric space that cannot be easily embedded in R. We present a data structure, the Partition Tree, that can be constructed in O(n logn) time, where n is the size of the set of points to be searched, and has been experimentally shown to have an average query time that is a sublinear function of n ...

In this paper, we present some fixed point theorems for single valued mappings on $K$-complete, $M$-complete and Symth complete quasi metric spaces. Here, for contractive condition, we consider some altering distance functions together with functions belonging to $C$-class and $A$-class. At the same time, we will consider two different type $M$ functions in contractive conditions because the qu...

2006
Marius Buliga

A dilatation structure is a concept in between a group and a differential structure. In this article we study fundamental properties of dilatation structures on metric spaces. This is a part of a series of papers which show that such a structure allows to do non-commutative analysis, in the sense of differential calculus, on a large class of metric spaces, some of them fractals. We also describ...

The sequential $p$-convergence in a fuzzy metric space, in the sense of George and Veeramani, was introduced by D. Mihet as a weaker concept than convergence. Here we introduce a stronger concept called $s$-convergence, and we characterize those fuzzy metric spaces in which convergent sequences are $s$-convergent. In such a case $M$ is called an $s$-fuzzy metric. If $(N_M,ast)$ is a fuzzy metri...

Journal: :iranian journal of fuzzy systems 2008
shaban sedghi k. p. r. rao nabi shobe

in this paper, we give some new definitions of m-fuzzy metric spaces and we prove a common fixed point theorem for six mappings under the condition of weakly compatible mappings in complete m-fuzzy metric spaces.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس 1388

یکی از مشکلات اساسی در rmmac کلاسیک این است که طراحی سیستماتیک این روش برای plant های ناپایدار امکان پذیر نمی باشد. مشکل اصلی در اینجاست که bpm برای plant های حلقه باز ناپایدار قابل محاسبه نیست. علاوه بر آن، تقسیم سیستماتیک زیرفضای نامعین در rmmac کلاسیک، وابسته به ابزار سنتز µ می باشد و دارای پیچیدگی های نسبتا زیادی است. برای حل مشکلات مذکور، در این تحقیق کنترل تطبیقی مقاوم به روش مدل چندگانه ...

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

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

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