Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userApproximating fixed point of({lambda},{rho})-firmly nonexpansive mappings in modular function spaces
144
0
0.0
(
0
)
Authors
Safeer Hussain Khan
Ask ChatGPT about the research
No Arabic abstract
In this paper, we first introduce an iterative process in modular function spaces and then extend the idea of a {lambda}-firmly nonexpansive mapping from Banach spaces to modular function spaces. We call such mappings as ({lambda},{rho})-firmly nonexpansive mappings. We incorporate the two ideas to approximate fixed points of ({lambda},{rho})-firmly nonexpansive mappings using the above mentioned iterative process in modular function spaces. We give an example to validate our results.
rate research
Read More
We show that the typical nonexpansive mapping on a small enough subset of a CAT($kappa$)-space is a contraction in the sense of Rakotch. By typical we mean that the set of nonexpansive mapppings without this property is a $sigma$-porous set and therefore also of the first Baire category. Moreover, we exhibit metric spaces where strict contractions are not dense in the space of nonexpansive mappings. In some of these cases we show that all continuous self-mappings have a fixed point nevertheless.
This paper investigates optimal error bounds and convergence rates for general Mann iterations for computing fixed-points of non-expansive maps in normed spaces. We look for iterations that achieve the smallest fixed-point residual after $n$ steps, by minimizing a worst-case bound $|x^n-Tx^n|le R_n$ derived from a nested family of optimal transport problems. We prove that this bound is tight so that minimizing $R_n$ yields optimal iterations. Inspired from numerical results we identify iterations that attain the rate $R_n=O(1/n)$, which we also show to be the best possible. In particular, we prove that the classical Halpern iteration achieves this optimal rate for several alternative stepsizes, and we determine analytically the optimal stepsizes that attain the smallest worst-case residuals at every step $n$, with a tight bound $R_napproxfrac{4}{n+4}$. We also determine the optimal Halpern stepsizes for affine nonexpansive maps, for which we get exactly $R_n=frac{1}{n+1}$. Finally, we show that the best rate for the classical Krasnoselskiu{i}-Mann iteration is $Omega(1/sqrt{n})$, and we present numerical evidence suggesting that even after introducing inertial terms one cannot reach the faster rate $O(1/n)$.
We consider a class of generalized nonexpansive mappings introduced by Karapinar [5] and seen as a generalization of Suzuki (C)-condition. We prove some weak and strong convergence theorems for approximating fixed points of such mappings under suitable conditions in uniformly convex Banach spaces. Our results generalize those of Khan and Suzuki [4] to the case of this kind of mappings and, in turn, are related to a famous convergence theorem of Reich [2] on nonexpansive mappings.
The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount rate may be negative. We characterize the minimality of a fixed point in terms of the nonlinear spectral radius of a certain semidifferential. We apply this characterization to design a policy iteration algorithm, which applies to the case of finite state and action spaces. The algorithm returns a locally minimal fixed point, which turns out to be globally minimal when the discount rate is nonnegative.
In this paper we study the Pettis integral of fuzzy mappings in arbitrary Banach spaces. We present some properties of the Pettis integral of fuzzy mappings and we give conditions under which a scalarly integrable fuzzy mapping is Pettis integrable.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
