Please note! Course description is confirmed for two academic years, which means that in general, e.g. Learning outcomes, assessment methods and key content stays unchanged. However, via course syllabus, it is possible to specify or change the course execution in each realization of the course, such as how the contact sessions are organized, assessment methods weighted or materials used.

LEARNING OUTCOMES

You will learn to identify an ill-posed inverse problem and to understand the restrictions its nature imposes on the solution process. You will familiarize yourself with several classical regularization methods for finding approximate solutions to linear ill-posed problems. You will learn to formulate an inverse problem as a Bayesian problem of statistical inference and to interpret the information contained in the resulting posterior probability distribution. You will learn to numerically implement the introduced solution techniques.

 

Credits: 5

Schedule: 27.02.2023 - 14.04.2023

Teacher in charge (valid for whole curriculum period):

Teacher in charge (applies in this implementation): Nuutti Hyvönen

Contact information for the course (applies in this implementation):

Lecturer: Nuutti Hyvönen (first.last@aalto.fi)

Assistant: Pauliina Hirvi (first.last@aalto.fi)

CEFR level (valid for whole curriculum period):

Language of instruction and studies (applies in this implementation):

Teaching language: English. Languages of study attainment: English

CONTENT, ASSESSMENT AND WORKLOAD

Content
  • valid for whole curriculum period:

    The course s topic is computational methods for solving inverse problems arising from practical applications. The course consists of two parts: the first three weeks focus on classic regularization techniques, the latter three weeks discuss statistical methods.

     

  • applies in this implementation

    See https://mycourses.aalto.fi/course/view.php?id=36201

Assessment Methods and Criteria
  • valid for whole curriculum period:

    Teaching methods: lectures, exercises and home exam.

    Assessment methods: exercises, a home exam.

     

  • applies in this implementation

    The students are assumed to participate actively in the course by weekly returning their solutions to one home assignment (typically involving MATLAB computations). 25% of the overall grade is based on the home assignments and 75% on a home exam that is held after the lectures have ended.

Workload
  • valid for whole curriculum period:

    Contact hours 36h (no compulsory attendance)

    Self-study ca 100h

     

  • applies in this implementation

    Contact hours 36h (no compulsory attendance)

    Self-study ca 100h

DETAILS

Study Material
Substitutes for Courses
Prerequisites

FURTHER INFORMATION

Further Information
Details on the schedule
  • applies in this implementation

    The preliminary weekly timetable is as follows:

    • Week 1: Motivation and (truncated) singular value decomposition
    • Week 2: Morozov discrepancy principle and Tikhonov regularization
    • Week 3: Regularization by truncated iterative methods
    • Week 4: Motivation and preliminaries of Bayesian inversion, preliminaries of sampling
    • Week 5: Prior models, Gaussian densities, MCMC (Metropolis-Hastings algorithm)
    • Week 6: MCMC (Gibbs sampler), hypermodels