Accuracy of Numerical Solution to Dynamic Programming Models

Dynamic programming models with continuous state and control variables are solved approximately using numerical methods in most applications. We develop a method for measuring the accuracy of numerical solution of stochastic dynamic programming models. Using this method, we compare the accuracy of various interpolation schemes. As expected, the results show that the accuracy improves as number of nodes is increased. Comparison of Chebyshev and linear spline indicates that the linear spline may give higher maximum absolute error than Chebyshev, however, the overall performance of spline interpolation is better than Chebyshev interpolation for non-smooth functions. Two-stage grid search method of optimization is developed and examined with accuracy analysis. The results show that this method is more efficient and accurate. Accuracy is also examined by allocating a different number of nodes for each dimension. The results show that a change in node configuration may yield a more efficient and accurate solution.

Issue Date:
Publication Type:
Working or Discussion Paper
Record Identifier:
PURL Identifier:
Total Pages:
Series Statement:
Staff Paper P06-3

 Record created 2017-04-01, last modified 2018-01-22

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)