Gains From Employing Sparse Matrix Techniques in the Anderson-Moore Algorithm

Gary Anderson

No 1051, Computing in Economics and Finance 1999 from Society for Computational Economics

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.

Date: 1999-03-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
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:sce:scecf9:1051

Access Statistics for this paper

More papers in Computing in Economics and Finance 1999 from Society for Computational Economics CEF99, Boston College, Department of Economics, Chestnut Hill MA 02467 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum (baum@bc.edu).