A Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics
We introduce a rapid grid search method in solving 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.
Volume (Year): 8 (2013)
Issue (Month): 2 (June)
|Contact details of provider:|| |
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:fec:journl:v:8:y:2013:i:2:p:260-271. 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: (Frank H. Liu)
If references are entirely missing, you can add them using this form.