Abstract:
In this study we combine the dynamic programming method with the projection methods for solving stochastic growth models. One of the inconveniences of Judd's projection technique is that finding a good initial guess is not that easy or it is time costly especially when the dimensionality of the problem is high. Secondly, there is no theoretical assurance that projection technique converges to the true policy function. First we use the dynamic programming method to obtain an approximate solution for the policy function. Since the approximate solution is in the vicinity of the true solution, we use those coefficients as the initial guess for the projection method. Then we use Judd's projection method to find an exact solution for the policy function. Once we find the exact solution for the policy function we check whether or not projection method converged to the true policy function. We do that by using the dynamic programming method to test whether the policy function satisfies the Bellman equation.
More papers in Computing in Economics and Finance 1996 from Society for Computational Economics Address: Department of Econometrics, University of Geneva, 102 Bd Carl-Vogt, 1211 Geneva 4, Switzerland Contact information at EDIRC. Series data maintained by Christopher F. Baum ().
This site is part of RePEc
and all the data displayed here is part of the RePEc data set.
Is your work missing from RePEc? Here is how to
contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .