Computing dsge models with recursive preferences
By: Dario Caldara, Jesús Fernández-Villaverde, Juan F. Rubio-Ramírez, Wen Yao.
Contributors: Caldara, Dario.; National Bureau of Economic Research.
Series: NBER working paper series -- working paper 15026; Working paper series (National Bureau of Economic Research : Online) -- working paper no. 15026.
Publisher: National Bureau of Economic Research
Published: 2009
Place of publication: Cambridge, MA
Language: eng
Format: Electronic resource
Description: "This paper compares different solution methods for computing the equilibrium of dynamic stochastic general equilibrium (DSGE) models with recursive preferences such as those in Epstein and Zin (1989 and 1991).  Models with these preferences have recently become popular, but we know little about the best ways to implement them numerically.  To fill this gap, we solve the stochastic neoclassical growth model with recursive preferences using four different approaches: second- and third-order perturbation, Chebyshev polynomials, and value function iteration.  We document the performance of the methods in terms of computing time, implementation complexity, and accuracy.  Our main finding is that a third-order perturbation is competitive in terms of accuracy with Chebyshev polynomials and value function iteration, while being an order of magnitude faster to run.  Therefore, we conclude that perturbation methods are an attractive approach for computing this class of problems"--National Bureau of Economic Research web site.
Notes: Title from PDF file as viewed on 6/11/2009.

Includes bibliographical references.

Also available in print.

System requirements: Adobe Acrobat Reader.

Mode of access: World Wide Web.