Analysis of a Numerical Dynamic Programming Algorithm Applied to Economic Models
In this paper, the authors develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. They show that the computed value function converges quadratically to the true value function and that the computed value function converges linearly, as the mesh size of the discretization converges to zero; further, the algorithm is stable. The authors also discuss several aspects of the implementation of their procedures as applied to some commonly studied growth models.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 66 (1998)
Issue (Month): 2 (March)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:66:y:1998:i:2:p:409-426. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.