Results 11 to 20 of about 5,970,576 (296)
Geometrically Constructed Family of the Simple Fixed Point Iteration Method
Mathematics, 2021 This study presents a new one-parameter family of the well-known fixed point iteration method for solving nonlinear equations numerically. The proposed family is derived by implementing approximation through a straight line.
Vinay Kanwar +6 more
doaj +2 more sources
MANAS: Journal of Engineering, 2013 We discuss the problem of finding approximate solutions of the equation x)0 f()0 (1) In some cases it is possible to find the exact roots of the equation (1) for example when f(x) is a quadratic on cubic polynomial otherwise, in general, is interested
Mehmet Karakas
doaj +2 more sources
, 1992 Iteration seems to play a fundamental role in learning theory - as everywhere else. Since neurons need a rather long time to reach a stable state, Caianiello's Paradox suggests that special actions cause the iteration of state transitions until a stable neural state is reached. Now, a stable state is a fixed point for any transition function; so we may
G. Germano, MAZZANTI, STEFANO
openaire +2 more sources
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
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
Atalan, Yunus +8 more
core +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 +2 more sources
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 +2 more sources
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