Dmitry Khmelev

Learn More
Abstract. The paper concerns numerical algorithms for solving the Beltrami equation fz̄(z) = μ(z)fz(z) for a compactly supported μ. First, we study an efficient algorithm that has been proposed in the literature, and present its rigorous justification. We then propose a different scheme for solving the Beltrami equation which has a comparable speed and(More)
We propose a general approach to accelerate the convergence of the widely used solution methods of Markov decision processes. The approach is inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem equivalent to the MDP. Numerical studies show that the computational savings can be significant(More)
  • 1