نتایج جستجو برای: commonfi xed point

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

1999
Jan Friso Groote Radu Mateescu

We deene a value-based modal-calculus, built from rst-order formulas, modalities, and xed point operators parameterized by data variables, which allows to express temporal properties involving data. We interpret this logic over Crl terms deened by linear process equations. The satisfaction of a temporal formula by a Crl term is translated to the satisfaction of a rst-order formula containing pa...

1998
Andrew Paice Fabian Wirth

We consider a perturbed nonlinear system with a xed point that is invariant under all perturbations. Under the assumption that this xed point is locally exponentially stable for the unperturbed system we propose a method for the approximation of the robust domain of attraction, that is, the set of points that are attracted to the xed point under all time-varying perturbations taking values in a...

Journal: :journal of linear and topological algebra (jlta) 0
s radenovic faculty of mechanical engineering, university of belgrade, serbia sh sedghi 1department of mathematics, qaemshahr branch, islamic azad university, qaemshahr, iran a gholidahneh 2department of mathematics, qaemshahr branch, islamic azad university, qaemshahr, iran t dosenovic 3faculty of technology, university of novi sad, bulevar cara lazara 1, serbia j esfahani department of mathematics, qaemshahr branch, islamic azad university, qaemshahr, iran

in this paper is introduced a new type of generalization of metric spaces called sb metric space. for this new kind of spaces it has been proved a common xed point theorem for four mappings which satisfy generalized contractive condition. we also present example to con rm our theorem.

Journal: :Kathedra of Byzantine and Modern Greek Studies 2020

1999
Monk-Ping Leong M. Y. Yeung C. K. Yeung C. W. Fu Pheng-Ann Heng Philip Heng Wai Leong

The automatic conversion of oating point software implementations of algorithms to a equivalent xed point implementation which can be eeciently implemented in an FCCM remains an obstacle in the rapid systems prototyping design ow. Floating point to xed point conversion is tedious, error prone and requires a good knowledge of xed point computer arithmetic. This paper describes a software system ...

1994
Davide Anguita Benedict A. Gomes

We examine the eecient implementation of back prop type algorithms on T0 4], a vector processor with a xed point engine, designed for neural network simulation. A matrix formulation of back prop, Matrix Back Prop 1], has been shown to be very eecient on some RISCs 2]. Using Matrix Back Prop, we achieve an asymptotically optimal performance on T0 (about 0.8 GOPS) for both forward and backward ph...

Journal: :نظریه تقریب و کاربرد های آن 0
sh rezaei department of mathematic, islamic azad university, aligudarz branch, aligudarz, lorestan, iran.

in this paper, we prove the existence of the solution for boundary value prob-lem(bvp) of fractional di erential equations of order q 2 (2; 3]. the kras-noselskii's xed point theorem is applied to establish the results. in addition,we give an detailed example to demonstrate the main result.

2000
Vassili Gelfreich

When the saddle-center bifurcation occurs in an analytic family of area-preserving maps, rst a parabolic xed point appears at the origin and then this point bi-furcates, creating an elliptic xed point and a hyperbolic one. Separatrices of the hyperbolic xed point form a small loop around the elliptic point. In general the sep-aratrices intersect transversely and the splitting is exponentially s...

Journal: :caspian journal of mathematical sciences 0
m. ozturk sakarya university,department of mathematics, 54187, sakarya, turkey e. girgin sakarya university,department of mathematics, 54187, sakarya, turkey

jachymski [ proc. amer. math. soc., 136 (2008), 1359-1373] gave modified version of a banach fixed point theorem on a metric space endowed with a graph. in the present paper, (g, φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. also, hardy-rogers g-contraction have been introduced and some fixed point theorems have been proved. s...

Journal: :Information and Control 1986
Neil Immerman

We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point operator and a total ordering on the universe We also show that even without the ordering one application of xed point su ces to express any query expressible with several alternations of xed point and negation This proves that the xed point query hierarchy suggested by Cha...

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

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