We propose a novel methodology for evaluating the accuracy of numerical solutions to dynamic economic models. It consists in constructing a lower bound on the size of approximation errors. A small lower bound on errors is a necessary condition for accuracy: If a lower error bound is unacceptably large, then the actual approximation errors are even larger, and hence, the approximation is inaccurate. Our lower‐bound error analysis is complementary to the conventional upper‐error (worst‐case) bound analysis, which provides a sufficient condition for accuracy. As an illustration of our methodology, we assess approximation in the first‐ and second‐order perturbation solutions for two stylized models: a neoclassical growth model and a new Keynesian model. The errors are small for the former model but unacceptably large for the latter model under some empirically relevant parameterizations.
MLA
Judd, Kenneth L., et al. “Lower Bounds on Approximation Errors to Numerical Solutions of Dynamic Economic Models.” Econometrica, vol. 85, .no 3, Econometric Society, 2017, pp. 991-1012, https://doi.org/10.3982/ECTA12791
Chicago
Judd, Kenneth L., Lilia Maliar, and Serguei Maliar. “Lower Bounds on Approximation Errors to Numerical Solutions of Dynamic Economic Models.” Econometrica, 85, .no 3, (Econometric Society: 2017), 991-1012. https://doi.org/10.3982/ECTA12791
APA
Judd, K. L., Maliar, L., & Maliar, S. (2017). Lower Bounds on Approximation Errors to Numerical Solutions of Dynamic Economic Models. Econometrica, 85(3), 991-1012. https://doi.org/10.3982/ECTA12791
Supplement to "Lower Bounds on Approximation Errors to Numerical Solutions of Dynamic Economic Models"
In Appendices A and B, we describe additional details of the lower-bound error analysis in the neoclassical stochastic growth model and in the new Keynesian model studied in the main text.
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.