Anderson's papers describe a method for solving linear saddle point models. The numerical implementation of the algorithm has proved useful in a wide array of applications including analyzing linear perfect foresight models, and providing initial solutions and asymptotic constraints for nonlinear models. In contract, although the symbolic algebra version has been available for years, few researchers have used it in their work. Most researchers believe that symbolic algebraic solution of useful rational expectations models remains beyond the capacity of present day computers. This papers provides practical advice on how to use symbolic algebra packages to solve moderate sized linear rational expectations models. The computational bottleneck lies in the determination of the invariant space associated with large roots of the transition matrix. This paper provides strategies for avoiding the solution of high order polynomial characteristic, and provides techniques for "switching" to numeric computation at strategic points. With present day PC's, one can solve linear models with ten or twenty equations using these strategies.
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||01 Apr 2001|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.econometricsociety.org/conference/SCE2001/SCE2001.html|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf1:138. 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: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.