A Note on a Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics

Abstract

We introduce a rapid grid search method in solving the dynamic programming problems in economics. Compared to mainstream grid search methods, by using local information of the Bellman equation, this method can significantly increase the efficiency in solving dynamic programming problems by reducing the grid points searched in the control space.Dynamic Programming, Grid Search, Control Space