Results 21 to 30 of about 560,761 (277)
Fixed point Ishikawa iterations
If \(J\) is the closed unit inverval, with \(T\) a selfmap of \(J\), the Ishikawa iterates of \(T\) are defined by \(u_{n+1}=[(1-\alpha_ n)u_ n+\alpha_ nT[(1-\beta_ n)u_ n+b_ n Tu_ n]]\) with \(u_ 0\in J\) and \(\{\alpha_ n\}\), \(\{\beta_ n\}\) satisfying the three conditions \[ \text{(a)} \quad 0\leq \alpha_ n\leq \beta_ n\leq 1, \qquad \text{(b ...
Kalinde, Albert K, Rhoades, B.E
openaire +2 more sources
Abstract Fixed-Point Theorems and Fixed-Point Iterative Schemes
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
Convergence Rate of Some Two-Step Iterative Schemes in Banach Spaces
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
Fixed Points by Mean Value Iterations [PDF]
If E is a convex compact subset of a Hilbert space, T is a strictly pseudocontractive function from E into E and x1 is a point in E, then the point sequence {xi})', converges to a fixed point of T, where for each positive integer n, Xn+1 = [11(n + 1)][Tx. + nxj.l In this paper it is shown that a technique of W. R.
openaire +1 more source
We introduce a new iterative method called D-iteration to approximate a fixed point of continuous nondecreasing functions on arbitrary closed intervals. The purpose is to improve the rate of convergence compared to previous work.
Jukkrit Daengsaen, Anchalee Khemphet
doaj +1 more source
A polynomially accelerated fixed-point iteration for vector problems [PDF]
Fixed-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
A generalization of some fixed point theorems of K. M. Ghosh
This note establishes the following result. Let T be a selfmap of a normed linear space E.
B. E. Rhoades
doaj +1 more source
The Fixed Point Property of Strong Pseudocontraction Mapping
In this paper, the iterative methods of fixed point of strong pseudocontraction mappings and accretive operators are studied in Banach spaces. A new threestep Ishikawa iteration is given.
CUI Yunan, ZHU Peng, WANG Ping
doaj +1 more source
A structural design methodology for retrofitting weakened frame systems following earthquakes is developed and presented. The design procedure refers to frame systems in their degraded strength and stiffness states and restores their dynamic performance ...
Assaf Shmerling, Matthias Gerdts
doaj +1 more source
Adjoints Of Fixed-Point Iterations
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 +2 more sources

