NATIONAL BUREAU OF ECONOMIC RESEARCH
NATIONAL BUREAU OF ECONOMIC RESEARCH

Dynamic Programming with Hermite Approximation

Yongyang Cai, Kenneth L. Judd

NBER Working Paper No. 18540
Issued in November 2012
NBER Program(s):   TWP

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.

download in pdf format
   (436 K)

email paper

Machine-readable bibliographic record - MARC, RIS, BibTeX

Document Object Identifier (DOI): 10.3386/w18540

Published: Mathematical Methods of Operations Research June 2015, Volume 81, Issue 3, pp 245-267 Date: 13 Feb 2015 Dynamic programming with Hermite approximation Yongyang Cai, Kenneth L. Judd citation courtesy of

Users who downloaded this paper also downloaded these:
Cai, Judd, and Xu w18709 Numerical Solution of Dynamic Portfolio Optimization with Transaction Costs
Cai, Judd, Thain, and Wright w18714 Solving Dynamic Programming Problems on a Computational Grid
Cai, Judd, Lontzek, Michelangeli, and Su w19034 Nonlinear Programming Method for Dynamic Programming
Judd, Maliar, and Maliar w18501 Merging Simulation and Projection Approaches to Solve High-Dimensional Problems
Cai, Judd, and Lontzek w18704 The Social Cost of Stochastic and Irreversible Climate Change
 
Publications
Activities
Meetings
NBER Videos
Themes
Data
People
About

National Bureau of Economic Research, 1050 Massachusetts Ave., Cambridge, MA 02138; 617-868-3900; email: info@nber.org

Contact Us