Upper Bounds on Numerical Approximation Errors

Peter Raahauge
Additional contact information
Peter Raahauge: Department of Finance, Copenhagen Business School, Postal: Department of Finance, Copenhagen Business School, Solbjerg Plads 3, A5, DK-2000 Frederiksberg, Denmark

No 2004-4, Working Papers from Copenhagen Business School, Department of Finance

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.

Keywords: Numerical approximation errors; Bellman contractions; Error bounds (search for similar items in EconPapers)
JEL-codes: G00 (search for similar items in EconPapers)
Pages: 26 pages
Date: 2006-06-21
New Economics Papers: this item is included in nep-cmp and nep-dge
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://openarchive.cbs.dk/cbsweb/handle/10398/7171 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hhs:cbsfin:2004_004

Access Statistics for this paper

More papers in Working Papers from Copenhagen Business School, Department of Finance Department of Finance, Copenhagen Business School, Solbjerg Plads 3, A5, DK-2000 Frederiksberg, Denmark. Contact information at EDIRC.
Bibliographic data for series maintained by Lars Nondal ().