Nonlinear filtering algorithms based on averaging over characteristics and on the innovation approach

Add to your list(s) Download to your calendar using vCal

• Tretyakov, M (Leicester)
• Monday 14 June 2010, 14:00-14:50
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

This talk has been canceled/deleted

It is well known that numerical methods for nonlinear filtering problems, which directly use the Kallianpur-Striebel formula, can exhibit computational instabilities due to the presence of very large or very small exponents in both the numerator and denominator of the formula. We obtain computationally stable schemes by exploiting the innovation approach. We propose Monte Carlo algorithms based on the method of characteristics for linear parabolic stochastic partial differential equations. Convergence and some properties of the considered algorithms are studied. Variance reduction techniques are discussed. Results of some numerical experiments are presented. The talk is based on a joint work with G.N. Milstein.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.