Stable and Efficient Computational Methods for Dynamic Programming
Dynamic programming is the foundation of dynamic economic analysis and often requires numerical solution methods. Standard methods are either slow or unstable. These instabilities are avoided when one uses modern methods from numerical optimization and approximation. Furthermore, large dynamic programming problems can be solved by using modern parallel computing architectures. (JEL: K23, L26, L51) (c) 2010 by the European Economic Association.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 8 (2010)
Issue (Month): 2-3 (04-05)
|Contact details of provider:|| Web page: http://www.mitpressjournals.org/jeea|
|Order Information:||Web: http://www.mitpressjournals.org/jeea|
When requesting a correction, please mention this item's handle: RePEc:tpr:jeurec:v:8:y:2010:i:2-3:p:626-634. 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: (Anna Pollock-Nelson)
If references are entirely missing, you can add them using this form.