![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Engineering Department Structures Research Seminars > Statistical Finite Elements via Interacting Particle Langevin Dynamics
![]() Statistical Finite Elements via Interacting Particle Langevin DynamicsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Shehara Perera. In this work, we develop a class of interacting particle Langevin algorithms to solve inverse problems for partial differential equations (PDEs). We leverage the statistical finite elements formulation to obtain a finite-dimensional statistical model, where the parameter is that of the forward map and the latent variable is the discretised solution of the PDE , assumed to be partially observed. We then adapt a recently proposed expectation-maximisation like scheme, the interacting particle Langevin algorithm (IPLA), for this problem and obtain a joint estimation procedure for the parameters and the latent variables. The estimation of an unknown source term is demonstrated for linear and nonlinear Poisson PDEs, as well as the diffusivity parameter for the linear Poisson PDE . We provide computational complexity estimates for forcing estimation in the linear case, including comprehensive numerical experiments and preconditioning strategies that significantly improve the performance. This talk is part of the Engineering Department Structures Research Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsEnterprise Tuesday 2009/2010 Wizkid NanoDTC Energy Materials TalksOther talks(Cambridge Festival) Life in Lilliput - The Mathematics of Fictional Realms Modelling microbiome-mediated epigenetic inheritance of disease risk Fred Simmons: "Abiogenetic Bias, Axiology, and Teleology." Archimedeans Talk: Disks and rings throughout the Universe tbc Andean Adventures |