Abstract
In Crisan, Gaines and Lyons [SIAM J. Appl. Probab. 58 (1998) 313--342] we describe a branching particle algorithm that produces a particle approximation to the solution of the Zakai equation and find an upper bound for the rate of convergence of the mean square error. In this paper, the exact rate of convergence of the mean square error is deduced. Also, several variations of the branching algorithm with better rates of convergence are introduced.
Citation
Dan Crisan. "Exact rates of convergeance for a branching particle approximation to the solution of the Zakai equation." Ann. Probab. 31 (2) 693 - 718, April 2003. https://doi.org/10.1214/aop/1048516533
Information