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...

This paper proposes a solution method to solve linear difference models with lagged expectations. Variables with lagged expectations expand the model's state space greatly when N is large; and getting the system into a canonical form solvable by the traditional methods involves substantial manual...

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...

Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...