We introduce an envelope condition method (ECM) for solving dynamic programming problems. The ECM method is simple to implement, dominates conventional value function iteration and is comparable in accuracy and cost to Carroll’s (2005) endogenous grid method. Codes are available.

Local (perturbation) methods compute solutions in one point and tend to deliver far lower accuracy levels than global solution methods. We develop a hybrid method that solves for some policy functions locally (using a perturbation method) and that solves for the other policy functions globally...

We develop numerically stable and accurate stochastic simulation approaches for solving dynamic economic models. First, instead of standard least-squares methods, we examine a variety of alternatives, including least-squares methods using singular value decomposition and Tikhonov regularization,...

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 introduce an envelope condition method (ECM) for solving dynamic programming problems. The ECM method is simple to implement, dominates conventional value function iteration and is comparable in accuracy and cost to Carroll’s (2005) endogenous grid method. Codes are available.

We assess gains from parallel computation on Backlight supercomputer. We find that information transfers are expensive. To make parallel computation efficient, a task per core must be sufficiently large, ranging from few seconds to one minute depending on the number of cores employed. For small...

We introduce an algorithm for solving dynamic economic models that merges stochastic simulation and projection approaches: we use simulation to approximate the ergodic measure of the solution, we construct a fixed grid covering the support of the constructed ergodic measure, and we use...

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 show how to enhance the performance of a Smolyak method for solving dynamic economic models. 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...

We develop an envelope condition method (ECM) for dynamic programming problems –a tractable alternative to expensive conventional value function iteration. ECM has two novel features: First, to reduce the cost, ECM replaces expensive backward iteration on Bellman equation with relatively...