Dynamic Programming with Hermite Approximation
Numerical dynamic programming algorithms typically use Lagrange data to approximate value functions over continuous states. Hermite data is easily obtained from solving the Bellman equation and can be used to approximate value functions. We illustrate this method with one-, three-, and six-dimensional examples. We find that value function iteration with Hermite approximation improves accuracy by one to three digits using little extra computing time. Moreover, Hermite approximation is significantly faster than Lagrange for the same accuracy, and this advantage increases with dimension.
|Date of creation:||Nov 2012|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.nber.org
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:18540. 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: ()
If references are entirely missing, you can add them using this form.