Searcharxiv⌕ Search

arXiv · 2610.13483

Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems

Abstract

In this paper we propose a novel regularisation strategy for structured linear inverse problems of the form $Ax=F \circ 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christina Brandt, Patrick Horn. 2026-10-09. Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems. https://arxiv.org/abs/2610.13483

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

High order integration of stochastic dynamics on Riemannian manifolds with frozen flow methods

We present a new class of numerical methods for solving stochastic differential equations with additive noise on general Riemannian manifolds with high weak order of accuracy. In opposition to the popular approach with projection methods, the proposed methods are intrinsic: they only rely on geometric operations and avoid coordinates and embeddings. We provide a robust and general convergence analysis and an algebraic formalism of exotic planar Butcher series for the computation of order conditions at any high order. To illustrate the methodology, an explicit method of second weak order is introduced, and several numerical experiments confirm the theoretical findings and extend the approach for the sampling of the invariant measure of Riemannian Langevin dynamics.

math.NA↗

Convergence analysis of GMRES applied to Helmholtz problems near resonances

The finite element solution of Helmholtz problems near resonant or quasi-resonant frequencies poses significant challenges, as iterative solvers typically suffer from severely degraded convergence. We analyze the convergence behavior of GMRES applied to linear systems arising from such configurations. Theoretical convergence estimates are derived based on harmonic Ritz values, highlighting their proximity to small eigenvalues as a key determining factor. We further examine deflation strategies and their interplay with preconditioning techniques, using the Complex Shifted Laplacian preconditioner as a case study. Numerical experiments on resonant and quasi-resonant test cases validate the theoretical framework and demonstrate the effectiveness of deflation strategies. This study provides new insights and practical guidance for analyzing and improving iterative solvers for time-harmonic problems near resonances.

math.NA↗

A general framework for the OSRC-preconditioned EFIE in computational electromagnetics

We investigate on-surface radiation condition (OSRC) preconditioners for the electric field integral equation (EFIE), considering Electric-to-Magnetic (EtM) and Magnetic-to-Electric (MtE) approximations applied from both the left and the right. A pseudodifferential analysis establishes the well-posedness of the four resulting formulations and shows that, locally, the OSRC EtM and MtE approximations present a similar structure to the EFIE itself and its inverse, respectively. At the discrete level, both MtE formulations are compatible with the standard RWG/SNC discretization and can be implemented without barycentric refinement, whereas the EtM formulations require an appropriate discrete duality map and BC/RBC spaces. Numerical experiments show that the OSRC preconditioners substantially improve GMRES convergence compared with the unpreconditioned EFIE, with the refinement-free MtE formulations also providing the lowest computational cost among the formulations considered.

math.NA↗