CaltechAUTHORS
  A Caltech Library Service

MCMC methods for sampling function space

Beskos, Alexandros and Stuart, Andrew (2009) MCMC methods for sampling function space. In: Sixth International Congress on Industrial and Applied Mathematics. EMS Monographs in Mathematics. European Mathematical Society , Zurich, pp. 337-364. ISBN 978-3-03719-056-2. https://resolver.caltech.edu/CaltechAUTHORS:20170612-093904953

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170612-093904953

Abstract

Applied mathematics is concerned with developing models with predictive capability, and with probing those models to obtain qualitative and quantitative insight into the phenomena being modelled. Statistics is data-driven and is aimed at the development of methodologies to optimize the information derived from data. The increasing complexity of phenomena that scientists and engineers wish to model, together with our increased ability to gather, store and interrogate data, mean that the subjects of applied mathematics and statistics are increasingly required to work in conjunction in order to significantly progress understanding.This article is concerned with a research program at the interface between these two disciplines, aimed at problems in differential equations where profusion of data and the sophisticated model combine to produce the mathematical problem of obtaining information from a probability measure on function space. In this context there is an array of problems with a common mathematical structure, namely that the probability measure in question is a change of measure from a Gaussian. We illustrate the wide-ranging applicability of this structure. For problems whose solution is determined by a probability measure on function space, information about the solution can be obtained by sampling from this probability measure. One way to do this is through the use of Markov chain Monte-Carlo (MCMC) methods. We show how the common mathematical structure of the aforementioned problems can be exploited in the design of effective MCMC methods.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://www.ems-ph.org/books/show_abstract.php?proj_nr=98&vol=1&rank=16PublisherArticle
http://dx.doi.org/10.4171/056-1/16DOIArticle
Additional Information:© 2009 EMS Publishing House. We are very grateful to Yalchin Efendiev, Frank Pinski, Gareth Roberts and Jochen Voss for comments on early drafts of this article, and to Efendiev (Figure 4), Pinski (Figure 1) and Voss (Figures 2 and 3) for providing the illustrations in the article.
Subject Keywords:Bayes's formula, inverse problem, change of measure from Gaussian, MCMC, Langevin SPDEs
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Andrew StuartC12
Series Name:EMS Monographs in Mathematics
Classification Code:MSC (2000):Primary 35R30; Secondary 65C40
Record Number:CaltechAUTHORS:20170612-093904953
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170612-093904953
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:78094
Collection:CaltechAUTHORS
Deposited By: Ruth Sustaita
Deposited On:12 Jun 2017 18:43
Last Modified:03 Oct 2019 18:05

Repository Staff Only: item control page