Beyond curse of dimensionality with transition matrix

After calculating the following values:

from j=1 to n

where is one of the column vectors calculated by (P*v’)’ for each dimension, we can

implement speed-up algorithms in the same way as before.

(1) error bounds

(2) policy iterations by direct inversion

(3) modified iterations