One-node Quadrature Beats Monte Carlo: A Generalized Stochastic Simulation Algorithm
In conventional stochastic simulation algorithms, Monte Carlo integration and curve fitting are merged together and implemented by means of regression. We perform a decomposition of the solution error and show that regression does a good job in curve fitting but a poor job in integration, which leads to low accuracy of solutions. We propose a generalized notion of stochastic simulation approach in which integration and curve fitting are separated. We specifically allow for the use of deterministic (quadrature and monomial) integration methods which are more accurate than the conventional Monte Carlo method. We achieve accuracy of solutions that is orders of magnitude higher than that of the conventional stochastic simulation algorithms.
|Date of creation:||Jan 2011|
|Date of revision:|
|Publication status:||published as Kenneth L. Judd, Lilia Maliar and Serguei Maliar, (2011). “Numerically Stable and Accurate Stochastic Simulation Methods for Solving Dynamic Models" and "Supplement", Quantitative Economics 2, 173-210.|
|Contact details of provider:|| Postal: |
Web page: http://www.nber.org
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:16708. 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: ()
If references are entirely missing, you can add them using this form.