University of Cambridge > Talks.cam > CCIMI Short Course: Introduction to the Bayesian approach to inverse problems

CCIMI Short Course: Introduction to the Bayesian approach to inverse problems

Add to your list(s) Send you e-mail reminders

Uncertainty quantification (UQ) is an interesting, fast growing research area aimed at developing methods to address the impact of parameter, data and model uncertainty in complex systems. In this course, we will focus on the identification of parameters through observations of the response of the system – the inverse problem. The uncertainty in the solution of the inverse problem will be described via the Bayesian approach.

We will derive Bayes’ theorem in the setting of finite dimensional parameter spaces, and discuss properties such as well-posedness, statistical estimates and connections to classical regularization methods. We will briefly examine the extension of the Bayesian approach to the infinite dimensional setting. The remainder of this course will be devoted to algorithms for the efficient approximation of the solution of the Bayesian inverse problem. We will give a detailed discussion on Monte Carlo methods in this context, and review alternative approaches such as multilevel Monte Carlo and Markov chain Monte Carlo.

Other views and ways to subscribe

You can include this list in your own website. Read the Instructions on how to include a list in your site and then click on 'Create Custom View' above to get started.

List Managers

Each talk has an organiser. Please contact them in the first instance if you have a query about a particular talk. Only contact one of the people below if you have a question about the list, such as whether your talk or series could be added.

(In order to see the manager's details, such as their e-mail, you will need to have an account and log in)

Lists included in this list

This list does not include any other list

Lists that include this list

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity