A Note on a Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics
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.
|Date of creation:||17 Sep 2010|
|Date of revision:|
|Contact details of provider:|| Postal: 2424 Maile Way, Honolulu, HI 96822|
Web page: http://www.economics.hawaii.edu/
More information through EDIRC
|Order Information:|| Web: http://www.economics.hawaii.edu/research/working.html Email: |
When requesting a correction, please mention this item's handle: RePEc:hai:wpaper:201017. 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: (Web Technician)
If references are entirely missing, you can add them using this form.