Gary Anderson () (Board of Governors of the Federal Reserve System)
Abstract
The Anderson-Moore algorithm is a powerful method for solving linear saddle-point models. The algorithm has proved useful in a wide variety of applications, including analyzing linear perfect-foresight models and providing initial solutions and asymptotic constraints for nonlinear models. The algorithm solves linear problems with dozens of lags and leads and hundreds of equations in seconds. The technique works well both for symbolic and numerical computation. The existing implementation of the algorithm exploits aspects of the inherent sparsity of the linear systems that alternative approaches cannot. However, incorporating sparse matrix storage and linear algebraic routines dramatically improves the scalability of the existing implementation. This paper describes the new implementation and documents the improvements in performance. The paper presents numerical results for solving a large macroeconomic model. The author can provide potential users with a C version on request.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
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.