We introduce the market resources method (MRM) for solving dynamic optimization problems. MRM extends Carroll's (2006) endogenous grid point method (EGM) for problems with more than one control variable using policy function iteration. The MRM algorithm is simple to implement and provides...

This chapter is concerned with numerical simulation of dynamic economic models. We focus on some basic algorithms and assess their accuracy and stability properties. This analysis is useful for an optimal implementation and testing of these procedures, as well as to evaluate their performance....

We survey numerical methods that are tractable in dynamic economic models with a finite, large number of continuous state variables. (Examples of such models are new Keynesian models, life-cycle models, heterogeneous-agents models, asset-pricing models, multisector models, multicountry models,...

This paper evaluates the accuracy of a set of techniques that approximate the solution of continuous-time DSGE models. Using the neoclassical growth model I compare linear-quadratic, perturbation and projection methods. All techniques are applied to the HJB equation and the optimality conditions...

We show that the standard Value Function Iteration (VFI) algorithm has difficulties approximating models with jump discontinuities in policy functions. We find that VFI fails to accurately identify the location and size of jump discontinuities while other methods - such as the Endogenous Grid...

We show that the standard Value Function Iteration (VFI) algorithm has difficulties approximating models with jump discontinuities in policy functions. We find that VFI fails to accurately identify the location and size of jump discontinuities while other methods - such as the Endogenous Grid...

We introduce the market resources method (MRM) for solving dynamic optimization problems. MRM extends Carroll’s (2006) endogenous grid point method (EGM) for problems with more than one control variable using policy function iteration. The MRM algorithm is simple to implement and provides...

First, we propose a more efficient implementation of the Smolyak method for interpolation, namely, we show how to avoid costly evaluations of repeated basis functions in the conventional Smolyak formula. Second, we extend the Smolyak method to include anisotropic constructions; this allows us to...

We study a generalized version of Coleman (1990)'s time iteration method (GTI) for solving dynamic optimization problems. Our benchmark framework is an irreversible investment model with labor-leisure choice. The GTI algorithm is simple to implement and provides advantages in terms of speed...

Value function iteration is one of the standard tools for the solution of the Ramsey model. We compare six different ways of value function iteration with regard to speed and precision. We find that value function iteration with cubic spline interpolation between grid points dominates the other...