Gains from Combining the Anderson-Moore Algorithm and Julliard's Stack Algorithm

Gary Anderson

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

Abstract: This paper describes an extension of the stack algorithm of Julliard, which makes it possible to (a) use any linear terminal condition, and (b) compute fixed points with the algorithm. Numerical results are presented for solving three different macroeconomic models including the Canada Model. The results show that employing the linear constraints generated by the Anderson-Moore algorithm significantly reduce the computational burden. The author can provide potential users with either a C or Mathematica 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:813

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 ().