Regularization with randomized SVD for large-scale discrete inverse problems

被引:40
|
作者
Xiang, Hua [1 ]
Zou, Jun [2 ]
机构
[1] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China
[2] Chinese Univ Hong Kong, Dept Math, Shatin, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
MONTE-CARLO ALGORITHMS; L-CURVE; PARAMETER; APPROXIMATION; MATRICES;
D O I
10.1088/0266-5611/29/8/085008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页数:23
相关论文
共 50 条