In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method  and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. F...

Value iteration is a commonly used and em­ pirically competitive method in solving many Markov decision process problems. However, it is known that value iteration has only pseudo­ polynomial complexity in general. We estab­ lish a somewhat surprising polynomial bound for value iteration on deterministic Markov decision (DMDP) problems. We show that the basic value iteration procedure converges...

Value iteration is a commonly used and empirically competitive method in solving many Markov decision process problems. However, it is known that value iteration has only pseudopolynomial complexity in general. We establish a somewhat surprising polynomial bound for value iteration on deterministic Markov decision (DMDP) problems. We show that the basic value iteration procedure converges to th...

In this paper, we have proposed a new iterative method for finding the solution of ordinary differential equations of the first order. In this method we have extended the idea of variational iteration method by changing the general Lagrange multiplier which is defined in the context of the variational iteration method.This causes the convergent rate of the method increased compared with the var...

This paper examines the reasons for design iteration and describes models of design iteration. Iteration is the process of repeating tasks within a design project, and is common to all types of engineering design. Iteration is typically necessary for two reasons: an unexpected failure of a design or prototype to meet established criteria; and an expected response to information which was genera...