Results 21 to 30 of about 5,846,948 (298)
Some fixed point iteration procedures
International Journal of Mathematics and Mathematical Sciences, 1991 This paper provides a survey of iteration procedures that have been used to obtain fixed points for maps satisfying a variety of contractive conditions.
B. E. Rhoades
doaj +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
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
Fixed points for mappings with a contractive iterate at each point [PDF]
Mathematica Slovaca, 2014 Abstract We generalize the results of Sehgal and Guseman for mappings on a complete metric space with a contractive iterate condition at each point.
Karaibryamov, Samet, Zlatanov, Boyan
openaire +2 more sources
Clustering with Semidefinite Programming and Fixed Point Iteration
J. Mach. Learn. Res., 2020 We introduce a novel method for clustering using a semidefinite programming (SDP) relaxation of the Max k-Cut problem. The approach is based on a new methodology for rounding the solution of an SDP relaxation using iterated linear optimization. We show the vertices of the Max k-Cut relaxation correspond to partitions of the data into at most k sets. We
Pedro F. Felzenszwalb +2 more
openaire +4 more sources
Convergence Rate of Some Two-Step Iterative Schemes in Banach Spaces
Journal of Mathematics, 2016 This article proves some theorems to approximate fixed point of Zamfirescu operators on normed spaces for some two-step iterative schemes, namely, Picard-Mann iteration, Ishikawa iteration, S-iteration, and Thianwan iteration, with their errors.
O. T. Wahab +3 more
doaj +1 more source
Adjoints Of Fixed-Point Iterations
, 2014 Adjoint algorithms, and in particular those obtained through the adjoint mode of Automatic Differentiation (AD), are probably the most efficient way to obtain the gradient of a numerical simulation. This however needs to use the ow of data of the original simulation in reverse order, at a cost that increases with the length of the simulation.
Taftaf, Ala +2 more
openaire +3 more sources
A generalization of some fixed point theorems of K. M. Ghosh
International Journal of Mathematics and Mathematical Sciences, 1982 This note establishes the following result. Let T be a selfmap of a normed linear space E.
B. E. Rhoades
doaj +1 more source
A polynomially accelerated fixed-point iteration for vector problems [PDF]
E-Journal of Analysis and Applied MathematicsFixed-point solvers are ubiquitous in nonlinear PDEs, yet their progress collapses whenever the Jacobian at the solution carries an eigenvalue arbitrarily close to one.
Francesco Alemanno
doaj +1 more source