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

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

2000
Ralf Bader Wilhelm Merz

In this paper we consider the pair di usion process in more than two spatial dimensions. In this case we are able to prove just a local existence result, since it is not possible to deduce global a priori estimates for the equations as it can be done in the two dimensional case. The model includes a nonlinear system of reaction{ drift{di usion equations, a nonlinear ordinary di erential equatio...

2001
Pascal Hitzler Anthony Karel Seda

We prove a type of converse of the Banach contraction mapping theorem for metric spaces: if X is a T 1 topological space and f : X ! X is a function with unique xed point a such that f n (x) converges to a for each x 2 X , then there exists a distance function d on X such that f is a contraction on the complete ultrametric space (X; d) with contractivity factor 1 2. We explore properties of the...

1999
Teruya Minamoto

We consider a numerical method to verify the existence and uniqueness of the solutions of nonlinear hyperbolic problems with guaranteed error bounds. Using a C 1 nite element solution and an inequality constituting a bound on the norm of the inverse operator of the linearized operator, we numerically construct a set of functions which satisfy the hypothesis of Banach's xed point theorem for a c...

1998
Mitsuharu Yamamoto Koichi Takahashi Masami Hagiya Shin-ya Nishizaki Tetsuo Tamai

This paper describes a formalization of a class of xed-point problems on graphs and its applications. This class captures several wellknown graph theoretical problems such as those of shortest path type and for data ow analysis. An abstract solution algorithm of the xedpoint problem is formalized and its correctness is proved using a theorem proving system. Moreover, the validity of the A* algo...

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 ...

Journal: :Mathematical Structures in Computer Science 1997
Marcelo P. Fiore

Domain-theoretic categories are axiomatised by means of categorical non-order-theoretic requirements on a cartesian closed category equipped with a commutative monad. An enrichment theorem showing that every axiomatic domain-theoretic category can be endowed with an intensional notion of approximation, the path relation, with respect to which the category Cpo-enriches is proved. Our analysis su...

2016
Karol Pak

Topological manifolds form an important class of topological spaces with applications throughout mathematics. However, the development of this scienti c area, even at the initial stage, requires non-trivial Brouwer's theorems: the xed point theorem, the topological invariance of degree, and the topological invariance of dimension, where each of them is provided for n-dimensional case. We presen...

Journal: :نظریه تقریب و کاربرد های آن 0
javad mojaradi-afra institute of mathematics, national academy of sciences of ra

  a variant of fixed point theorem is proved in the setting of s-metric spaces

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: :caspian journal of mathematical sciences 2012
n. nyamoradi

in this work, by employing the krasnosel'skii fixed point theorem, we study the existence of positive solutions of a three-point boundary value problem for the following fourth-order differential equation begin{eqnarray*} left { begin{array}{ll} u^{(4)}(t) -f(t,u(t),u^{prime prime }(t))=0 hspace{1cm} 0 leq t leq 1, & u(0) = u(1)=0, hspace{1cm} alpha u^{prime prime }(0) - beta u^{prime prime...

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

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