IDEAS home Printed from https://ideas.repec.org/p/sce/scecf9/1051.html
   My bibliography  Save this paper

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

Author

Listed:
  • 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.

Suggested Citation

  • Gary Anderson, 1999. "Gains From Employing Sparse Matrix Techniques in the Anderson-Moore Algorithm," Computing in Economics and Finance 1999 1051, Society for Computational Economics.
    • Handle: RePEc:sce:scecf9:1051
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sce:scecf9:1051. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.