Speedup algorithm: Both error bounds and policy iterations

We approximate the continuous random model without labor:

by switching model with infinite many states in order:

.

.

.

where

.

.

.

for many states.

We calculate each policy function for each as it is set like:

independently for each i and calculate the next index number.

The random process can be

for as before.

When we compute each policy function for each, we apply both error bounds and

policy iterations together.

Technically, we attach option 3 to option 1 and option 2 respectively in the program.