Rank-deficient and Discrete ill-posed problems
Number of credits: 9 hp
Examiner: Tommy Elfving
Course literature and course contents: Project 1. Implementation of the algorithms CGLS and CGMN in the SNARK programming package. Tests and comparisons of these algorithms with Ladweber and Art iteration on problems from image reconstruction and electron microscope image reconstruction. Behavior using noisy and noise free data. Stopping criteria.
Project 2. Comparison using CGLS resp CG on regularized problem. Choice of regulartization parameter. Effect of using regularizing preconditioners.
Organisation: The student will present the contents of the literature at 8 bi-weekly seminars. The student will also do projects/assignments related to the course.
Examination: Reading course.
Last updated: 2014-04-29