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...
Uložené v:
| Vydané v: | Afrika mathematica Ročník 30; číslo 5-6; s. 797 - 816 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.09.2019
Springer Nature B.V |
| Predmet: | |
| ISSN: | 1012-9405, 2190-7668 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografia: | 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 |