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 new method for approximating vector autoregressions by a finite-state Markov chain. The method is more robust to the number of discrete values and tends to outperform the existing methods over a wide range of the parameter space, especially for highly persistent vector...

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