Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems
Christina Brandt, Patrick Horn
Abstract
In this paper we propose a novel regularisation strategy for structured linear inverse problems of the form Ax=F G x = z. Instead of using the operator A or a complex scheme involving both F and G simultaneously, combining already existing and simpler regularisations for F and G allows the use of established and optimised programs for high-speed computations. As classical parameter choice rules fail in the scenario when no source conditions are known because intermediate error bounds may be unavailable, we provide both a-priori and a-posteriori rules with a convergence speed analysis given source conditions. We test the proposed method on the pre-clinical medical imaging technique of magnetic particle imaging with different choices of regularisation and on a convolution problem for an analysis of the convergence speed.
Create a lesson
Related papers
Fast and Stable Arbitrary Precision Approximate Matrix Multiplication
Ioana Dumitriu, Olga Holtz, Abraham Hsu et al.
Analysis of an inexact Schwarz domain decomposition method in 3D
Nibedita Ghosh
Energy conserving compatible space--time FEM for deterministic and stochastic rotating shallow water
Maneesh Kumar Singh, Colin J. Cotter
Preconditioning proximal Galerkin: mesh and degree robust solvers for variational inequalities
Ioannis P. A. Papadopoulos, Pablo D. Brubeck
On a maximum principle in discretization with spherical harmonics
Arnold Reusken
Global Optimization of Beam Profiles for Suppressing the Bump-On-Tail Instability
Sandro Mignelli, Lukas Einkemmer