1 option
Dynamic Programming with Hermite Approximation / Yongyang Cai, Kenneth L. Judd.
- Format:
- Book
- Author/Creator:
- Cai, Yongyang.
- Series:
- Working Paper Series (National Bureau of Economic Research) no. w18540.
- NBER working paper series no. w18540
- Language:
- English
- Physical Description:
- 1 online resource: illustrations (black and white);
- Place of Publication:
- Cambridge, Mass. National Bureau of Economic Research 2012.
- Summary:
- 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.
- Notes:
- Print version record
- November 2012.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.