Parameterized Expectations Algorithm and the Moving Bounds

Lilia Maliar and Serguei Maliar

Journal of Business & Economic Statistics, 2003, vol. 21, issue 1, 88-92

Abstract: The Parameterized Expectations Algorithm (PEA) is a powerful tool for solving nonlinear stochastic dynamic models. However, it has an important shortcoming: it is not a contraction mapping technique and thus does not guarantee a solution will be found. We suggest a simple modification that enhances the convergence property of the algorithm. The idea is to rule out the possibility of (ex)implosive behavior by artificially restricting the simulated series within certain bounds. As the solution is refined along the iterations, the bounds are gradually removed. The modified PEA can systematically converge to the stationary solution starting from the nonstochastic steady state.

Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (19)

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

Related works:
Software Item: Matlab code for Solving a Neoclassical Growh Model with a Parametrized Expectations Algorithm and Moving Bounds (2003)
Working Paper: PARAMETRIZED EXPECTATIONS ALGORITHM AND THE MOVING BOUNDS (2001)
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:bes:jnlbes:v:21:y:2003:i:1:p:88-92

Ordering information: This journal article can be ordered from
http://www.amstat.org/publications/index.html

Access Statistics for this article

Journal of Business & Economic Statistics is currently edited by Jonathan H. Wright and Keisuke Hirano

More articles in Journal of Business & Economic Statistics from American Statistical Association
Bibliographic data for series maintained by Christopher F. Baum ().