This project concerns the development of Markov chain Monte Carlo and sequential Monte Carlo methods for unbiased estimation in Bayesian inverse problems. Inverse problems typically involve inferring the initial condition of PDEs/ODEs on the basis of real data, naturally encapsulated by a Bayesian posterior distribution. Intrinsically, there is often a numerical solution of the PDE/ODE leading to bias in the posterior inference. In this project, we will develop, with only access to numerical solutions of the PDEs, Monte Carlo based methods which can remove the bias and be effective computational tools for inference. This project will develop skills in numerical analysis, probability, statistics and programming and leave the graduating student with an excellent skill set allowing him/her to progress further in academia or to find high quality jobs in industry.
At KAUST, every admitted student is granted the KAUST Fellowship-giving you an unparalleled opportunity to enroll in any of our renowned graduate programs tuition free. You can live on the shores of the Red Sea; conduct groundbreaking research in our state-of-the-art research centers; and receive unsurpassed support through our living stipend, generous scholarship, and extensive academic community.
Every admitted student earns the KAUST Fellowship, which grants them:
· - Full Free Tuition Support · - Monthly Living Allowance · - Housing · - Medical and dental coverage · - Relocation Support
Insert previous message below for editing?
You haven’t included a message. Providing a specific message means universities will take your enquiry more seriously and helps them provide the information you need. Why not add a message here
The information you submit to KAUST will only be used by them or their data partners to deal with your enquiry, according to their privacy notice. For more information on how we use and store your data, please read our privacy statement.
* required field
Send a copy to me for my own records.
Your enquiry has been emailed successfully
Based on your current searches we recommend the following search filters.