نتایج جستجو برای: iteration scheme
تعداد نتایج: 261462 فیلتر نتایج به سال:
We present an accelerated algorithm for the solution of static HamiltonJacobi-Bellman equations related to optimal control problems and differential games. The new scheme combines the advantages of value iteration and policy iteration methods by means of an efficient coupling. The method starts with a value iteration phase on a coarse mesh and then switches to a policy iteration procedure over ...
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...
A new general composite implicit random iteration scheme with perturbed mapping is proposed and obtain necessary and sufficient conditions for strong convergence of proposed iteration scheme to random fixed point of a finite family of random nonexpansive mappings are obtained.
In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our metho...
Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...
This article is concerned with recent developments of adaptive wavelet solvers for elliptic eigenvalue problems. We describe the underlying abstract iteration scheme of the preconditioned perturbed iteration. We apply the iteration to a simple model problem in order to identify the main ideas which a numerical realization of the abstract scheme is based upon. This indicates how these concepts c...
We clarify the links between a recently developped long wavelength iteration scheme of Einstein’s equations, the Belinski Khalatnikov Lifchitz (BKL) general solution near a singularity and the antinewtonian scheme of Tomita’s. We determine the regimes when the long wavelength or antinewtonian scheme is directly applicable and show how it can otherwise be implemented to yield the BKL oscillatory...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید