Raahauge, Peter (Department of Finance, Copenhagen Business School)
Abstract
This paper suggests a method for determining rigorous upper bounds on approximation errors of numerical solutions to infinite horizon dynamic programming models. Bounds are provided for approximations of the value function and the policy function as well as the derivatives of the value function. The bounds apply to more general problems than existing bounding methods do. For instance, since strict concavity is not required, linear models and piecewise linear approximations can be dealt with. Despite the generality, the bounds perform well in comparison with existing methods even when applied to approximations of a standard(strictly concave)growth model.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Copenhagen Business School, Department of Finance in its series Working Papers with number
2004-4.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: