Algorithmic Design and Beowulf Cluster Implementation of Stochastic Simulation Code of Stochastic Simulation Code for Large Scale Non Linear Models
Anderson & Moore describe a powerful method for solving linear saddle point models. The algorithm has proved useful in a wide array of applications including analyzing linear perfect foresight models, providing initial solutions and asymptotic constraints for nonlinear models. However, many algorithmic design choices remain in selecting components of a nonlinear certainty equivalence equation solver. This paper describes the present state of development of this set of tools. The paper descibes the results of simulation experiments using the FRBUS quarterly econometric model and the Canada Model. The paper provides data characterizing the impact of solution path length, initial path guess, terminal constraint strategy and strategies for exploiting sparsity on computation time, solution accuracy and memory requirements. The paper compares algorithm performance on traditional unix platform with our recent Beowulf Cluster Parallel Computation Implementation.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
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.
|Date of creation:||01 Apr 2001|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.econometricsociety.org/conference/SCE2001/SCE2001.html|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf1:128. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.