Results 21 to 30 of about 380,543 (330)
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
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 +4 more sources
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
A Fixed-Point Iteration for Steady-State Analysis of Water Distribution Networks [PDF]
IEEE Global Conference on Signal and Information Processing, 2018 This paper develops a fixed-point iteration to solve the steady-state water flow equations in an urban water distribution network. The fixed-point iteration is derived upon the assumption of turbulent flow solutions and the validity of the Hazen-Williams
M. Bazrafshan +3 more
semanticscholar +1 more source
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 +1 more source
Journal of Function Spaces, 2021 In this article, we consider an extensive class of monotone nonexpansive mappings and introduce a new iteration algorithm to approximate the fixed point for monotone total asymptotically nonexpansive mappings in the framework of hyperbolic space.
Amna Kalsoom +6 more
doaj +1 more source
Abstract Fixed-Point Theorems and Fixed-Point Iterative Schemes
Symmetry, 2022 Mathematical methods are extensively used in dealing with simulation and approximation problems related to computer science, engineering, physics, and many others [...]
openaire +1 more source
Alexandria Engineering Journal, 2018 Recently Kilicman et al. (2006) propose a variational fixed point iteration technique with the Galerkin method for the determination of the starting function for the solution of second order linear ordinary differential equation with two-point boundary ...
Nakone Bello +2 more
doaj +1 more source
Open Mathematics, 2023 This article analyzes the JK iteration process with the class of mappings that are essentially endowed with a condition called condition (E). The convergence of the iteration toward a fixed point of a specific mapping satisfying the condition (E) is ...
Ullah Kifayat +5 more
doaj +1 more source
Chebyshev Inertial Iteration for Accelerating Fixed-Point Iterations
CoRR, 2020 A novel method which is called the Chebyshev inertial iteration for accelerating the convergence speed of fixed-point iterations is presented. The Chebyshev inertial iteration can be regarded as a valiant of the successive over relaxation or Krasnosel'ski\vı-Mann iteration utilizing the inverse of roots of a Chebyshev polynomial as iteration dependent ...
Tadashi Wadayama, Satoshi Takabe
openaire +2 more sources