Abstract.
We construct a sequence of branching particle systems α n convergent in measure to the solution of the Kushner–Stratonovitch equation. The algorithm based on this result can be used to solve numerically the filtering problem. We prove that the rate of convergence of the algorithm is of order n ¼. This paper is the third in a sequence, and represents the most efficient algorithm we have identified so far.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 4 February 1997 / Revised version: 26 October 1998
Rights and permissions
About this article
Cite this article
Crisan, D., Lyons, T. A particle approximation of the solution of the Kushner–Stratonovitch equation. Probab Theory Relat Fields 115, 549–578 (1999). https://doi.org/10.1007/s004400050249
Issue Date:
DOI: https://doi.org/10.1007/s004400050249