Results 11 to 20 of about 5,976,148 (331)
SOME FIXED POINT RESULTS FOR A NEW THREE STEPS ITERATION PROCESS IN BANACH SPACES [PDF]
, 2017 In this paper, we introduce a three step iteration method and show that this method can be used to approximate fixed point of weak contraction mappings. Furthermore, we prove that this iteration method is equivalent to Mann iterative scheme and converges
V. Karakaya +3 more
semanticscholar +2 more sources
Iterative Schemes of Mean Nonexpansive Mapping
Journal of Harbin University of Science and Technology, 2021 Based on Mann iteration, Ishikawa iteration and some other twostep iteration, threestep iteration methods, two new fourstep iteration schemes and one nstep iteration are constructed.
CUI Yunan , ZHANG Jiaxing
doaj +1 more source
Nuclear Engineering and Technology, 2021 In-depth convergence analyses for neutronics/thermal-hydraulics (T/H) coupled calculations are performed to investigate the performance of nonlinear methods based on the Fixed-Point Iteration (FPI).
Jaejin Lee, H. Joo
semanticscholar +1 more source
African Scientific Reports, 2022 The paper analyzes the convergence of Ishikawa iteration to the fixed point of a class of '-quasinonexpansive mappings in uniformly convex Banach spaces, as well as the stability of the Ishikawa iteration used in approximating the fixed point.
F. D. Ajibade +3 more
doaj +1 more source
Introduction of new Picard–S hybrid iteration with application and some results for nonexpansive mappings [PDF]
Arab Journal of Mathematical Sciences, 2022 Purpose – In this paper, Picard–S hybrid iterative process is defined, which is a hybrid of Picard and S-iterative process. This new iteration converges faster than all of Picard, Krasnoselskii, Mann, Ishikawa, S-iteration, Picard–Mann hybrid, Picard ...
Julee Srivastava
doaj +1 more source
Analyzing Stability and Data Dependence Notions by a Novel Jungck-Type Iteration Method
Journal of New Theory, 2023 Finding the ideal circumstances for a mapping to have a fixed point is the fundamental goal of fixed point theory. These criteria can also be used for the structure under investigation.
Esra Erbaş, Yunus Atalan
doaj +1 more source
Approximating fixed points by ishikawa iterates [PDF]
Bulletin of the Australian Mathematical Society, 1989 In a uniformly convex Banach space the convergence of Ishikawa iterates to a fixed point is discussed for nonexpansive and generalised nonexpansive mappings.
Maiti, M., Ghosh, M. K.
openaire +1 more source
Inexact fixed-point iteration method for nonlinear complementarity problems
Journal of Algorithms & Computational Technology, 2023 Based on the modulus decomposition, the structured nonlinear complementarity problem is reformulated as an implicit fixed-point system of nonlinear equations. Distinguishing from some existing modulus-based matrix splitting methods, we present a flexible
Xiaobo Song +3 more
doaj +1 more source
DAIMI Report Series, 1991 In the context of abstract interpretation for languages without higher-order features we study the number of times a functional need to be unfolded in order to give the least fixed point. For the cases of total or monotone functions we obtain an exponential bound and in the case of strict and additive (or distributive) functions we obtain a quadratic ...
Hanne Riis Nielson, Flemming Nielson
openaire +6 more sources
Anderson Acceleration for Fixed-Point Iterations [PDF]
SIAM Journal on Numerical Analysis, 2011 This paper concerns an acceleration method for fixed-point iterations that originated in work of D. G. Anderson [J. Assoc. Comput. Mach., 12 (1965), pp. 547-560], which we accordingly call Anderson acceleration here. This method has enjoyed considerable success and wide usage in electronic structure computations, where it is known as Anderson mixing ...
Homer F. Walker, Peng Ni
openaire +2 more sources