Regularization of inverse problems by an approximate matrix-function technique
Regularization of inverse problems by an approximate matrix-function technique
In this work, we introduce and investigate a class of matrix-free regularization techniques for discrete linear ill-posed problems based on the approximate computation of a special matrix-function. In order to produce a regularized solution, the proposed strategy employs a regular approximation of the Heavyside step function computed into a small Krylov subspace. This particular feature allows our proposal to be independent from the structure of the underlying matrix. If on the one hand, the use of the Heavyside step function prevents the amplification of the noise by suitably filtering the responsible components of the spectrum of the discretization matrix, on the other hand, it permits the correct reconstruction of the signal inverting the remaining part of the spectrum. Numerical tests on a gallery of standard benchmark problems are included to prove the efficacy of our approach even for problems affected by a high level of noise.
Krylov methods, Matrix function, Regularization
1275-1308
Cipolla, Stefano
373fdd4b-520f-485c-b36d-f75ce33d4e05
Donatelli, Marco
83c0b4c5-8ac8-4cfc-960f-7290aa8d0ca2
Durastante, Fabio
56118788-83b2-4273-b959-c45f486f86c1
November 2021
Cipolla, Stefano
373fdd4b-520f-485c-b36d-f75ce33d4e05
Donatelli, Marco
83c0b4c5-8ac8-4cfc-960f-7290aa8d0ca2
Durastante, Fabio
56118788-83b2-4273-b959-c45f486f86c1
Cipolla, Stefano, Donatelli, Marco and Durastante, Fabio
(2021)
Regularization of inverse problems by an approximate matrix-function technique.
Numerical Algorithms, 88 (3), .
(doi:10.1007/s11075-021-01076-y).
Abstract
In this work, we introduce and investigate a class of matrix-free regularization techniques for discrete linear ill-posed problems based on the approximate computation of a special matrix-function. In order to produce a regularized solution, the proposed strategy employs a regular approximation of the Heavyside step function computed into a small Krylov subspace. This particular feature allows our proposal to be independent from the structure of the underlying matrix. If on the one hand, the use of the Heavyside step function prevents the amplification of the noise by suitably filtering the responsible components of the spectrum of the discretization matrix, on the other hand, it permits the correct reconstruction of the signal inverting the remaining part of the spectrum. Numerical tests on a gallery of standard benchmark problems are included to prove the efficacy of our approach even for problems affected by a high level of noise.
Text
s11075-021-01076-y
- Version of Record
More information
Accepted/In Press date: 20 January 2021
e-pub ahead of print date: 11 April 2021
Published date: November 2021
Additional Information:
Funding Information:
Open Access funding provided by Università degli Studi di Padova within the CRUI-CARE Agreement. This work has been partially funded by the 2019 GNCS-INDAM Project “Tecniche innovative e parallele per sistemi lineari e non lineari di grandi dimensioni, funzioni ed equazioni matriciali ed applicazioni”.
.
Keywords:
Krylov methods, Matrix function, Regularization
Identifiers
Local EPrints ID: 485535
URI: http://eprints.soton.ac.uk/id/eprint/485535
ISSN: 1017-1398
PURE UUID: 7bf7a3f1-439e-4bd0-af55-77be81a71bd6
Catalogue record
Date deposited: 08 Dec 2023 17:42
Last modified: 18 Mar 2024 04:17
Export record
Altmetrics
Contributors
Author:
Stefano Cipolla
Author:
Marco Donatelli
Author:
Fabio Durastante
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics