نتایج جستجو برای: fixed point iteration
تعداد نتایج: 715482 فیلتر نتایج به سال:
Let K be a nonempty closed convex subset of a real Banach space E and T be a Lipschitz pseudocontractive self-map of K with F (T ) := {x ∈ K : Tx = x} 6= ∅. An iterative sequence {xn} is constructed for which ||xn − Txn|| → 0 as n → ∞. If, in addition, K is assumed to be bounded, this conclusion still holds without the requirement that F (T ) 6= ∅. Moreover, if, in addition, E has a uniformly G...
Maximum likelihood estimations for the parameters of extreme value distributions are discussed in this paper using fixed point iteration. The commonly used numerical approach for adressing this problem is the Newton-Raphson approach which requires differentiation unlike the fixed point iteration which is also easier to implement. Graphical approaches are also usualy proposed in the literature. ...
In this paper, we introduce a new iteration process for approximation of common fixed point of countably infinite family of nonself asymptotically nonexpansive mappings in uniformly convex Banach spaces, and prove weak and strong convergence of our iteration process to a common fixed point of these operators. Our theorems extend, generalize and unify many recently announced results. Our iterati...
in this paper, we obtained the convergence of modified noor iterative scheme for nearly lipschitzian maps in real banach spaces. our results contribute to the literature in this area of re- search.
We prove in this paper that policy iteration can be generally defined in finite domain of templates using Lagrange duality. Such policy iteration algorithm converges to a fixed point when for very simple technique condition holds. This fixed point furnishes a safe over-approximation of the set of reachable values taken by the variables of a program. We prove also that policy iteration can be ea...
In this paper we demonstrate that a number of fixed point iteration problems can be solved using a modified Krasnoselskij iteration process, which is much simpler to use than the other iteration schemes that have been defined. 2008 Elsevier Inc. All rights reserved. For maps with a slow enough growth rate, the Banach contraction principle provides the existence and uniqueness of the fixed point...
The stability problem of functional equations originated from a question of Ulam 1 concerning the stability of group homomorphisms. Hyers 2 gave a first affirmative partial answer to the question of Ulam for Banach spaces. Hyers’ theoremwas generalized byAoki 3 for additive mappings and by Rassias 4 for linear mappings by considering an unbounded Cauchy difference. The paper of Rassias 4 has pr...
The main purpose of this paper is to study an iteration procedure for finding a common fixed point of a countable family of nonexpansive mappings in Banach spaces. We introduce a Mann type iteration procedure. Then we prove that such a sequence converges weakly to a common fixed point of a countable family of nonexpansive mappings. Moreover, we apply our result to the problem of finding a commo...
0045-7825/$ see front matter 2012 Elsevier B.V. A http://dx.doi.org/10.1016/j.cma.2012.03.007 ⇑ Corresponding author. E-mail addresses: [email protected], jeff788@g A new multi-variate fixed-point iteration scheme is devised for solving the coupled dynamic integral equations governing nonlocal plasticity using the material point method (MPM). Novel use of the MPM grid for particle–particle c...
In control applications the use of noise-burdened sensor signals cannot be evaded. Also, certain can lost. This problem traditionally is tackled by Kalman filters that provide some “optimal solution” to these problems based on reasonable assumptions are not always well underpinned in practice. These made with regard system model and statistical distribution noise signals. The Fixed Point Iterat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید