Solving rational expectations models at first order: what Dynare does
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 in the litterature. The contribution of the present paper is to focus on implementation details that make the algorithm more generic and more efficient, especially for large models.
|Date of creation:||Apr 2011|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +33(0) 1 43 13 62 30
Fax: +33(0) 1 43 13 62 32
Web page: http://www.cepremap.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cpm:dynare:002. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Stéphane Adjemian)
If references are entirely missing, you can add them using this form.