An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces

We study an algorithm to compute minimum norm solution of ill-posed problems in Hilbert spaces and investigate its regularizing properties with discrepancy principle stopping rule. This algorithm results from straightly applying the LSQR method to the main problem before discretizing. In fact, the p...

Full description

Saved in:
Bibliographic Details
Published in:Afrika mathematica Vol. 30; no. 5-6; pp. 797 - 816
Main Authors: Jozi, Meisam, Karimi, Saeed, Salkuyeh, Davod Khojasteh
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2019
Springer Nature B.V
Subjects:
ISSN:1012-9405, 2190-7668
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study an algorithm to compute minimum norm solution of ill-posed problems in Hilbert spaces and investigate its regularizing properties with discrepancy principle stopping rule. This algorithm results from straightly applying the LSQR method to the main problem before discretizing. In fact, the proposed algorithm obtains a sequence of approximate solutions of the original problem. In order to test the new algorithm, it is implemented to solve system of linear integral equations of the first kind and some examples are given. Moreover, we compare the presented algorithm with the Tikhonov regularization method to compute the least norm solution when there are more than one solution.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1012-9405
2190-7668
DOI:10.1007/s13370-019-00685-0