Journal
INVERSE PROBLEMS
Volume 29, Issue 8, Pages -Publisher
IOP PUBLISHING LTD
DOI: 10.1088/0266-5611/29/8/085008
Keywords
-
Categories
Funding
- National Natural Science Foundation of China [10901125, 91130022, 11161130003]
- Hong Kong RGC grant [404611]
- CUHK Focused Investment Scheme
Ask authors/readers for more resources
In this paper, we propose an algorithm for solving the large-scale discrete ill-conditioned linear problems arising from the discretization of linear or nonlinear inverse problems. The algorithm combines some existing regularization techniques and regularization parameter choice rules with a randomized singular value decomposition (SVD), so that only much smaller scale systems are needed to solve, instead of the original large-scale regularized system. The algorithm can directly apply to some existing regularization methods, such as the Tikhonov and truncated SVD methods, with some popular regularization parameter choice rules such as the L-curve, GCV function, quasi-optimality and discrepancy principle. The error of the approximate regularized solution is analyzed and the efficiency of the method is well demonstrated by the numerical examples.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available