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

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

2007
Guo-Qiang Zhang William C. Rounds

Synopsis. In this paper we study the logical aspects of the Smyth powerdomain via clausal theories. The clause-theoretic view leads to an unexpectedly simple, operational, representation of the Smyth powerdomain. At the heart of this representation is a hyperresolution rule, whose completeness hinges upon a combinatorial lemma for the book-keeping of intermediate clauses. These results are moti...

2007
John Lygeros

1 Problem Formulation Last two weeks we discussed controller synthesis for: Discrete systems: design characterized by a xed point of a diierence equation. Continuous systems: design characterized by xed point of a partial diierential equation. In either case the solution is characterized as a xed point of an equation, which we refer to as the Hamilton-Jacobi equation. Today, we bring the discre...

Journal: :international journal of nonlinear analysis and applications 2015
sushanta kumar mohanta rima maitra

in this paper, we prove some coupled coincidence point theorems for mappings satisfying generalized contractive conditions under a new invariant set in ordered cone metric spaces. in fact, we obtain sufficient conditions for existence of coupled coincidence points in the setting of cone metric spaces. some examples are provided to verify the effectiveness and applicability of our results.

E. Firouz, S. J. Hosseini Ghoncheh

Boujari [5] proved a fixed point theorem with an old version of the integraltype contraction , his proof is incorrect. In this paper, a new generalizationof integral type contraction is introduced. Moreover, a fixed point theorem isobtained.

2007
F Bartels

We describe an encoding of major parts of domain theory in the PVS extension of the simply typed calculus these encodings consist of Formalizations of basic structures like partial orders and complete partial orders domains Various domain constructions Notions related to monotonic functions and continuous functions Knaster Tarski xed point theorems for monotonic and continuous functions the pro...

Journal: :journal of linear and topological algebra (jlta) 0
k. ranga rao acharya nagarjuna university g. n.v. kishore k.l.university,vaddeswaram sk. sadik sir c r r college of engineering

in this paper we prove a unique common coupled fixed point theorem for two pairs of $w$-compatible mappings in $s_b$-metric spaces satisfying a contrctive type condition. we furnish an example to support our main theorem. we also give a corollary for junck type maps.

Journal: :international journal of mathematical modelling and computations 0
j. o. olaleru university of lagos, lagos, nigeria. nigeria mathematics department g. a. okeke university of lagos, lagos, nigeria. nigeria mathematics department h. akewe university of lagos, lagos, nigeria. nigeria mathematics department

in this paper, we unify, extend and generalize some results on coupled fixed point theorems of generalized φ- mappings with some applications to fixed points of integral type mappings in cone metric spaces.

Journal: :ITA 1999
Dilian Gurov Bruce M. Kapron

We consider proof systems with sequents of the form U for proving validity of a propositional modal calculus formula over a set U of states in a given model Such proof systems usually handle xed point formulae through unfolding thus allowing such formulae to reappear in a proof Tagging is a technique originated by Winskel for annotating xed point formulae with information about the proof states...

1997
Sergio Albeverio Yuri Kondratiev Yuri Kozitsky

A nonlinear generalization of the S-transform known in Gaussian analysis is introduced. It is deened as a nonlinear operator on topolog-ical spaces of entire functions of innnitely many variables with growth of at most second order and nite type restricted to a certain value. This nonlinear S-transform (NLST) has xed points a certain family of which is found and analyzed. In particular, their s...

1997
Martin Grajcar Bernhard Sick

Most of the existing Digital Signal Processors (DSPs) are optimized for a fast and e cient computation of the Fast Fourier Transform (FFT). However, there are only two oating-point DSPs available, which perform the butter y operation of a FFT in 4 processor cycles, but no xed-point DSP is designed that way. The new 24 bit xed-point DSP DAISY, which is able to execute the butter y in 4 cycles ev...

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

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