A reliable and computationally efficient algorithm for imposing the saddle point property in dynamic models

Gary Anderson

No 2010-13, Finance and Economics Discussion Series from Board of Governors of the Federal Reserve System (U.S.)

Abstract: This paper describes a set of algorithms for quickly and reliably solving linear rational expectations models. The utility, reliability and speed of these algorithms are a consequence of 1) the algorithm for computing the minimal dimension state space transition matrix for models with arbitrary numbers of lags or leads, 2) the availability of a simple modeling language for characterizing a linear model and 3) the use of the QR Decomposition and Arnoldi type eigenspace calculations. The paper also presents new formulae for computing and manipulating solutions for arbitrary exogenous processes.

Keywords: Rational; expectations; (Economic; theory) (search for similar items in EconPapers)
Date: 2010
New Economics Papers: this item is included in nep-cba and nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://www.federalreserve.gov/pubs/feds/2010/201013/201013abs.html (text/html)
http://www.federalreserve.gov/pubs/feds/2010/201013/201013pap.pdf (application/pdf)

Related works:
Journal Article: A reliable and computationally efficient algorithm for imposing the saddle point property in dynamic models (2010)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fip:fedgfe:2010-13

Access Statistics for this paper

More papers in Finance and Economics Discussion Series from Board of Governors of the Federal Reserve System (U.S.) Contact information at EDIRC.
Bibliographic data for series maintained by Ryan Wolfslayer ; Keisha Fournillier (ryan.d.wolfslayer@frb.gov).