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

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

1997
Michael van Hartskamp

We present two examples of nice normal spaces X having the property that for some xed-point free homeomorphism on X its Cech-Stone extension has a xed point. One of the spaces presented here is locally countable, locally compact, separable , normal, countably paracompact and weakly zero-dimensional. The other one is hereditarily normal and strongly zero-dimensional. Our construction of this exa...

2011
Claudia Burgard Katja Görlitz Thomas K. Bauer Wolfgang Leininger

Using data from the German Socio-Economic Panel (GSOEP), this paper analyzes the relationship between training and job satisfaction focusing in particular on gender diff erences. Controlling for a variety of socio-demographic, job and fi rm characteristics, we fi nd a diff erence between males and females in the correlation of training with job satisfaction which is positive for males but insig...

1998
Alex K. Simpson

Fixed points play a central role in domain theory, where, traditionally, the least-xed-point operator for continuous endofunctions on complete partial orders (cpos) is used. Recently, there has been considerable interest in developing a more general axiomatic (and order-free) account of the constructions of domain theory. Peter Freyd made an essential contribution to this programme by emphasisi...

Journal: :bulletin of the iranian mathematical society 0
a. amini-harandi

this paper is concerned with the best proximity pair problem in hilbert spaces. given two subsets $a$ and $b$ of a hilbert space $h$ and the set-valued maps $f:a o 2^ b$ and $g:a_0 o 2^{a_0}$, where $a_0={xin a: |x-y|=d(a,b)~~~mbox{for some}~~~ yin b}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in a$ such that $$d(g(x_0),f(x_0))=d(a,b).$$

The main purpose of this paper is to study the approximate best proximity pair of cyclic maps and their diameter in fuzzy normed spaces defined by Bag and Samanta. First, approximate best point proximity points on fuzzy normed linear spaces are defined and four general lemmas are given regarding approximate fixed point and approximate best proximity pair of cyclic maps on fuzzy normed spaces. U...

1996
Filippo De Mari

We show that the Weyl group W = M 0 =M of a noncompact semisimple Lie group is obtained by taking xed point sets of smooth involutions in K=M. More precisely, one considers rst the xed point set X of the involutions deened on K=M by the elements of order 2 in exp ia. The Weyl group is either X , or the xed point set of the involutions deened on X by special elements of order 4 in exp ia.

1998
SAEED ZAKERI

Let f be a quadratic polynomial which has an irrationally indi erent xed point Let z be a biaccessible point in the Julia set of f Then In the Siegel case the orbit of z must eventually hit the critical point of f In the Cremer case the orbit of z must eventually hit the xed point Siegel polynomials with biaccessible critical point certainly exist but in the Cremer case it is possible that biac...

2011
C. S. Wortmann D. D. Tarkalson C. A. Shapiro A. R. Dobermann R. B. Ferguson D. Walters

Published in Agron. J. 103:76–84 (2011) Published online 3 Nov 2010 doi:10.2134/agronj2010.0189 Copyright © 2011 by the American Society of Agronomy, 5585 Guilford Road, Madison, WI 53711. All rights reserved. No part of this periodical may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or any information storage and retrie...

1992
Yunping Jiang Takehiko Morita

We prove that the period doubling operator has an expanding di rection at the xed point We use the induced operator a Perron Frobenius type operator to study the linearization of the period dou bling operator at its xed point We then use a sequence of linear operators with nite ranks to study this induced operator The proof is constructive One can calculate the expanding direction and the rate ...

1997
Kamen R. Ralev Peter H. Bauer

Di erent options for block oating point lter implementation are introduced and their e ciency determined. The e ciency is quanti ed by the additional number of operations over those required for xed point operation. Some of the implementations are new. It is shown that they are more e cient than the existing ones. Examples are given in which the processing time per recursion of a block oating p...

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

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