This paper introduces a numerical method for solving concave continuous state dynamic programming problems which is based on a pair of polyhedral approximations of concave functions. The method is globally convergent and produces computable upper and lower bounds on the value function which can...

This paper describes in detail the algorithm implemented in Dynare for computing the first order approximated solution of a nonlinear rational expectations model. The core of the algorithm is a generalized Schur decomposition (also known as the QZ decomposition), as advocated by several authors...

We introduce a new algorithm that can be used to solve stochastic dynamic general equilibrium models. This approach exploits the fact that the equations defining equilibrium can be viewed as a set of differential algebraic equations in the neighborhood of the steady-state. Then a modified...

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 use the stochastic simulation algorithm, described in Judd, Maliar and Maliar (2009), and the cluster-grid algorithm, developed in Judd, Maliar and Maliar (2010a), to solve a collection of multi-country real business cycle models. The following ingredients help us reduce the cost in...

We show that Australian options are equivalent to fixed or floating strike Asian options and consequently that by studying Asian options from the Australian perspective and vice versa, much can be gained. One specific application of this “Australian approach” leads to a natural dimension...

We characterize the balanced growth path of the basic neoclassical growth economy using standard, almost linear numerical solution methods, as well as the parameterized expectations approach, which preserves the nonlinearity in the model. We also apply the same methods after adding indivisible...

This paper describes briefly main functionalities and exploited numerical methods of the package CompDTIMe which consists of several Matlab routines. This package allows one to calculate two-dimensional bifurcation diagrams, to find periodic points not depending on whether they are attracting,...

This paper proposes a moment-matching method for approximating vector autoregressions by finite-state Markov chains. The Markov chain is constructed by targeting the conditional moments of the underlying continuous process. The proposed method is more robust to the number of discrete values and...

This paper proposes a moment-matching method for approximating vector autoregressions by finite-state Markov chains. The Markov chain is constructed by targeting the conditional moments of the underlying continuous process. The proposed method is more robust to the number of discrete values and...