نتایج جستجو برای: rho asymptotically regular mapping

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

Journal: :iranian journal of science and technology (sciences) 2011
h. khan

a definition of two jointly asymptotically nonexpansive mappings s and t on uniformly convex banach space e is studied to approximate common fixed points of two such mappings through weak and strong convergence of an ishikawa type iteration scheme generated by s and t on a bounded closed and convex subset of e. as a consequence of the notion of two jointly asymptotically nonexpansive maps, we c...

Journal: :Physical review 2022

As previously proposed in Simpson and Visser [J. Cosmol. Astropart. Phys. 02 (2019) 042], Mazza et al. 04 (2021) 082], Franzin 07 036], Lobo [Phys. Rev. D 103, 084052 (2021), the ``black bounce'' spacetimes are an interesting type of globally regular modifications ordinary black holes (such as Kerr-Newman geometry its particular cases) which generically contain a spacetime singularity (usually ...

Journal: :Arabian Journal of Mathematics 2023

Abstract We establish a relationship between asymptotic regularity and common stationary points of multivalued mappings on metric space. As consequence our results, we obtain new fixed point result for two asymptotically regular single-valued mappings. Our work significantly improves complements comparable results in the literature.

2009
Jong Soo Jung JONG SOO JUNG

Let E be a reflexive Banach space with a weakly sequentially continuous duality mapping, C be a nonempty closed convex subset of E, f : C → C a contractive mapping (or a weakly contractive mapping), and T : C → C a nonexpansive mapping with the fixed point set F (T ) 6= ∅. Let {xn} be generated by a new composite iterative scheme: yn = λnf(xn)+(1−λn)Txn, xn+1 = (1−βn)yn+βnTyn, (n ≥ 0). It is pr...

Journal: :bulletin of the iranian mathematical society 0
r. a. rashwan department of mathematics, university of assiut, p.o.box 71516, assiut, egypt d. al-baqeri department of mathematics, university of assiut, p.o.box 71516, assiut, egypt

begin{abstract} in this paper, we prove some strong and weak convergence of three step random iterative scheme with errors to common random fixed points of three asymptotically nonexpansive nonself random mappings in a real uniformly convex separable banach space. end{abstract}

Journal: :Int. J. Math. Mathematical Sciences 2008
Lili He Lei Deng Jianjun Liu

with kn ≥ 0, rn ≥ 0, kn → 1, rn → 0 n → ∞ , for each x, y ∈ C, n 0, 1, 2, . . . . If kn 1 and rn 0, 1.1 reduces to nonexpansive mapping; if rn 0, 1.1 reduces to asymptotically nonexpansive mapping; if kn 1, 1.1 reduces to asymptotically nonexpansive-type mapping. So, a generalized asymptotically nonexpansive mapping is much more general than many other mappings. Browder 1 introduced the followi...

2002
Sergio Dain

I describe the construction of a large class of asymptotically flat initial data with non-vanishing mass and angular momentum for which the metric and the extrinsic curvature have asymptotic expansions at space-like infinity in terms of powers of a radial coordinate. I emphasize the motivations and the main ideas behind the proofs.

Journal: :Lifetime data analysis 1998
D O Scharfstein A A Tsiatis P B Gilbert

The generalized odds-rate class of regression models for time to event data is indexed by a non-negative constant rho and assumes that [formula: see text] where g: rho(s) = log(rho-1(s-rho - 1)) for rho > 0, g0(s) = log(-logs), S(t[symbol: see text]Z) is the survival function of the time to event for an individual with q x 1 covariate vector Z, beta is a q x 1 vector of unknown regression param...

2009
NAVIN KASHYAP

In this note, we prove that the family of regular codes is not asymptotically good. The notation follows that in [2]. All codes considered are binary linear codes. H7 refers to the [7, 4] binary Hamming code. Definition 1. A binary linear code is regular iff it does not contain as a minor any code equivalent to H7 or H 7 . It follows from the theorem that the family of regular codes, which we w...

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

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