On the relative value iteration with a risk-sensitive criterion

A multiplicative relative value iteration algorithm for solving the dynamic programming equation for the risk-sensitive control problem is studied for discrete time controlled Markov chains with a compact Polish state space, and controlled diffusions in the whole Euclidean space. The main result is a proof of convergence to the desired limit in each case.