Abstract:
Anderson and Moore presents a procedure for solving linear perfect foresight models and Andersonn[Anderson1993] shows how to apply this technique to non linear models. The technique requires eigenvalue computations for a sparse linear system to deal with the long run dynamics and computations with large sparse band diagonal matrices for computing the nonlinear trajectory of the model variables. This paper applies methods for exploiting the special structure of these band diagonal linear systems Bai's SRRIT algorithm [Bai and Stewart1992] for computing vectors spanning the invariant space of a sparse linear system. These techniques dramatically reduce computational requirements while enhancing the accuracy and robustness of the original algorithm. The paper presents solution results for a variant of the multicountry model presented in Edison, Marques and Tyon
More papers in Computing in Economics and Finance 1996 from Society for Computational Economics Address: Department of Econometrics, University of Geneva, 102 Bd Carl-Vogt, 1211 Geneva 4, Switzerland Contact information at EDIRC. Series data maintained by Christopher F. Baum ().
This site is part of RePEc
and all the data displayed here is part of the RePEc data set.
Is your work missing from RePEc? Here is how to
contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .