论文信息 - A particle approximation of the solution of the Kushner–Stratonovitch equation

A particle approximation of the solution of the Kushner–Stratonovitch equation

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.

D. Crisan | Terry Lyons

[1] David Aldous,et al. Stopping Times and Tightness. II , 1978 .

[2] A. Shiryayev,et al. Statistics of Random Processes I: General Theory , 1984 .

[3] Monte Carlo Method for Nonlinear Filtering , 1985 .

[4] Sylvie Roelly‐ Coppoletta. A criterion of convergence of measure‐valued processes: application to measure branching processes , 1986 .

[5] Patrick Florchinger,et al. Time-discretization of the Zakai equation for diffusion processes observed in correlated noise , 1990 .

[6] A. Bensoussan. Stochastic Control of Partially Observable Systems , 1992 .

[7] R. Glowinski,et al. Approximation of some stochastic differential equations by the splitting up method , 1992 .

[8] P. Moral. Nonlinear Filtering Using Random Particles , 1996 .

[9] D. Crisan,et al. Nonlinear filtering and measure-valued processes , 1997 .

[10] Dan Crisan,et al. Convergence of a Branching Particle Method to the Solution of the Zakai Equation , 1998, SIAM J. Appl. Math..