In this paper, a new iteration scheme in uniformly convex metric space is defined and its convergence obtained. A numerical example also considered to compare the rate of convergences with that an existing scheme.

This paper deals with computational algorithms for obtaining the optimal stationary policy and the minimum cost of a discounted semi-Markov decision process. Van Nunen [23) has proposed a modified policy iteration algorithm with a suboptimality test of MacQueen type, where the modified policy iteration algorithm is policy iteration method with the policy evaluation routine by a finite number of...

In this paper, we introduce a generalized iteration scheme with errors for convergence to common fixed points of two nonexpansive mappings. This scheme contains a wide variety of existing iteration schemes as its special cases. The main feature of this scheme is that its special cases can handle both strong convergence like Halpern-type and weak convergence like Ishikawatype iteration schemes. ...

The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...

in this paper, we implemented the modified iteration perturbation method (mipm) for approximating the periodic behavior of a tapered beam. this problem is formulated as a nonlinear ordinary differential equation with linear and nonlinear terms. the solution is quickly convergent and does not need to complicated calculations. comparing the results of the mipm with the exact solution shows that t...

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 ...