The standard approach to solving linear DSGE models is to apply the QZ method. It is a one-shot algorithm that leaves the researcher with little alternative than to seek a different algorithm should the result be numerically unsatisfactory. We develop an iterative implementation of QZ that...

We construct the first algorithm for the perfect foresight solution of otherwise linear models with occasionally binding constraints, with fixed terminal conditions, that is guaranteed to return a solution in finite time, if one exists. We also provide a proof of the inescapability of the "curse...

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 paper applies structure preserving doubling methods to solve the matrix quadratic underlying the recursive solution of linear DSGE models. We present and compare two Structure-Preserving Doubling Algorithms (SDAs) to other competing methods - the QZ method, a Newton algorithm, and an...

This paper presents and compares Bernoulli iterative approaches for solving linear DSGE models. The methods are compared using nearly 100 different models from the Macroeconomic Model Data Base (MMB) and different parameterizations of the monetary policy rule in the medium-scale New Keynesian...

A recursive formula for computing the exact value of score vectors is proposed, which is more desirable than approximate values in some statistical analyses, for a general form of the linear Gaussian state space model. Unlike most extant methods, our formula calculates all components of the...