IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v110y2004i2p275-294.html
   My bibliography  Save this article

Markov chain approximations to filtering equations for reflecting diffusion processes

Author

Listed:
  • Kouritzin, Michael A.
  • Long, Hongwei
  • Sun, Wei

Abstract

Herein, we consider direct Markov chain approximations to the Duncan-Mortensen-Zakai equations for nonlinear filtering problems on regular, bounded domains. For clarity of presentation, we restrict our attention to reflecting diffusion signals with symmetrizable generators. Our Markov chains are constructed by employing a wide band observation noise approximation, dividing the signal state space into cells, and utilizing an empirical measure process estimation. The upshot of our approximation is an efficient, effective algorithm for implementing such filtering problems. We prove that our approximations converge to the desired conditional distribution of the signal given the observation. Moreover, we use simulations to compare computational efficiency of this new method to the previously developed branching particle filter and interacting particle filter methods. This Markov chain method is demonstrated to outperform the two-particle filter methods on our simulated test problem, which is motivated by the fish farming industry.

Suggested Citation

  • Kouritzin, Michael A. & Long, Hongwei & Sun, Wei, 2004. "Markov chain approximations to filtering equations for reflecting diffusion processes," Stochastic Processes and their Applications, Elsevier, vol. 110(2), pages 275-294, April.
  • Handle: RePEc:eee:spapps:v:110:y:2004:i:2:p:275-294
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(03)00175-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bhatt, Abhay G. & Kallianpur, G. & Karandikar, Rajeeva L., 1999. "Robustness of the nonlinear filter," Stochastic Processes and their Applications, Elsevier, vol. 81(2), pages 247-254, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nappo, Giovanna & Torti, Barbara, 2006. "Continuous time random walks and queues: Explicit forms and approximations of the conditional law with respect to local times," Stochastic Processes and their Applications, Elsevier, vol. 116(4), pages 585-610, April.

    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:eee:spapps:v:110:y:2004:i:2:p:275-294. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.