نتایج جستجو برای: modified picard normal s iteration
تعداد نتایج: 1491225 فیلتر نتایج به سال:
Charles[1] proved the convergence of Picard-type iterative for generalized Φ− accretive non-self maps in a real uniformly smooth Banach space. Based on theorems zeros strongly quasi- and fixed points hemi-contractions, we extend results to Ishikawa iteration process with er- rors hemi-contractive .
The bending of a rectangular elastic plate under uniform distributed load and simply supported at the corners by equal-leg angles is studied analytically. The width of the supporting legs can be varied symmetrically about the plate axes giving mixed boundary conditions with supported and free edges. The solution is set up by using the Le'vy-Na'dai approach and the mixed boundary equation at the...
In this paper, a regularized long-wave equation (RLWE) is solved by using the Adomian's decomposition method (ADM) , modified Adomian's decomposition method (MADM), variational iteration method (VIM), modified variational iteration method (MVIM) and homotopy analysis method (HAM). The approximate solution of this equation is calculated in the form of series which its components are computed by ...
Robust dynamic programming (robust DP) mitigates the effects of ambiguity in transition probabilities on the solutions of Markov decision problems. We consider the computation of robust DP solutions for discrete-stage, infinite-horizon, discounted problems with finite state and action spaces. We present robust modified policy iteration (RMPI) and demonstrate its convergence. RMPI encompasses bo...
i P is closed, nonempty, and P / {0}, ii a, b ∈ R, a, b ≥ 0, and x, y ∈ P imply that ax by ∈ P, iii x ∈ P and −x ∈ P imply that x 0. The space E can be partially ordered by the cone P ⊂ E; by defining, x ≤ y if and only if y − x ∈ P . Also, we write x y if y − x ∈ int P , where int P denotes the interior of P . A cone P is called normal if there exists a constant K > 0 such that 0 ≤ x ≤ y impli...
Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three implementations of approximate MPI (AMPI) that are exten...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید