In this paper we develop a discretized version of the dynamic programming algorithm and derive error bounds for the approximate value and policy functions. We show that under the proposed scheme the computed value function converges quadratically to the true value function and the computed policy function converges linearly, as the mesh size of the discretization converges to zero. Moreover, the constants involved in these orders of convergence can be computed in terms of primitive data of the model. We also discuss several aspects of the implementation of our methods, and present numerical results for some commonly studied macroeconomic models.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.