IDEAS home Printed from https://ideas.repec.org/p/ucr/wpaper/200904.html
   My bibliography  Save this paper

Finite State Markov-Chain Approximations to Highly Persistent Processes

Author

Listed:
  • Karen A. Kopecky

    (Department of Economics, The University of Western Ontario)

  • Richard M. H. Suen

    () (Department of Economics, University of California Riverside)

Abstract

This paper re-examines the Rouwenhorst method of approximating first-order autoregressive processes. This method is appealing because it can match the conditional and unconditional mean, the conditional and unconditional variance and the first-order autocorrelation of any AR(1) process. This paper provides the first formal proof of this and other results. When comparing to five other methods, the Rouwenhorst method has the best performance in approximating the business cycle moments generated by the stochastic growth model. It is shown that, equipped with the Rouwenhorst method, an alternative approach to generating these moments has a higher degree of accuracy than the simulation method.

Suggested Citation

  • Karen A. Kopecky & Richard M. H. Suen, 2009. "Finite State Markov-Chain Approximations to Highly Persistent Processes," Working Papers 200904, University of California at Riverside, Department of Economics, revised May 2009.
    • Handle: RePEc:ucr:wpaper:200904
    as

    Download full text from publisher

    File URL: http://mpra.ub.uni-muenchen.de/15122/1/MPRA_paper_15122.pdf
    File Function: First version, 2009
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Aruoba, S. Boragan & Fernandez-Villaverde, Jesus & Rubio-Ramirez, Juan F., 2006. "Comparing solution methods for dynamic equilibrium economies," Journal of Economic Dynamics and Control, Elsevier, vol. 30(12), pages 2477-2508, December.
    2. Taylor, John B & Uhlig, Harald, 1990. "Solving Nonlinear Stochastic Growth Models: A Comparison of Alternative Solution Methods," Journal of Business & Economic Statistics, American Statistical Association, vol. 8(1), pages 1-17, January.
    3. Karen Kopecky & Richard Suen, 2010. "Finite State Markov-chain Approximations to Highly Persistent Processes," Review of Economic Dynamics, Elsevier for the Society for Economic Dynamics, vol. 13(3), pages 701-714, July.
    4. Tauchen, George & Hussey, Robert, 1991. "Quadrature-Based Methods for Obtaining Approximate Solutions to Nonlinear Asset Pricing Models," Econometrica, Econometric Society, vol. 59(2), pages 371-396, March.
    5. Lucas, Robert E, Jr, 1978. "Asset Prices in an Exchange Economy," Econometrica, Econometric Society, vol. 46(6), pages 1429-1445, November.
    6. Tauchen, George, 1990. "Solving the Stochastic Growth Model by Using Quadrature Methods and Value-Function Iterations," Journal of Business & Economic Statistics, American Statistical Association, vol. 8(1), pages 49-51, January.
    7. Jerome Adda & Russell W. Cooper, 2003. "Dynamic Economics: Quantitative Methods and Applications," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262012014, January.
    8. Tauchen, George, 1986. "Finite state markov-chain approximations to univariate and vector autoregressions," Economics Letters, Elsevier, vol. 20(2), pages 177-181.
    9. King, Robert G. & Rebelo, Sergio T., 1999. "Resuscitating real business cycles," Handbook of Macroeconomics,in: J. B. Taylor & M. Woodford (ed.), Handbook of Macroeconomics, edition 1, volume 1, chapter 14, pages 927-1007 Elsevier.
    10. Galindev, Ragchaasuren & Lkhagvasuren, Damba, 2010. "Discretization of highly persistent correlated AR(1) shocks," Journal of Economic Dynamics and Control, Elsevier, vol. 34(7), pages 1260-1276, July.
    11. Flodén, Martin, 2008. "A note on the accuracy of Markov-chain approximations to highly persistent AR(1) processes," Economics Letters, Elsevier, vol. 99(3), pages 516-520, June.
    12. Craig Burnside, 1998. "Discrete State-Space Methods for the Study of Dynamic Economies," QM&RBC Codes 125, Quantitative Macroeconomics & Real Business Cycles.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Numerical Methods; Finite State Approximations; Optimal Growth Model;

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:ucr:wpaper:200904. 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: (Kelvin Mac). General contact details of provider: http://edirc.repec.org/data/deucrus.html .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.