Greedy Tikhonov regularization for large linear ill-posed problems

被引:10
|
作者
Reichel, L. [1 ]
Sadok, H.
Shyshkov, A.
机构
[1] Kent State Univ, Dept Math Sci, Kent, OH 44242 USA
[2] Univ Littoral, Ctr Univ Mi Voix, Lab Mat Pures Appl, F-62228 Calais, France
关键词
discrepancy principle; ill-posed problem; inverse problem; Lanczos bidiagonalization; regularization;
D O I
10.1080/00207160701356324
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Several numerical methods for the solution of large linear ill-posed problems combine Tikhonov regularization with an iterative method based on partial Lanczos bidiagonalization of the operator. This paper discusses the determination of the regularization parameter and the dimension of the Krylov subspace for this kind of method. A method that requires a Krylov subspace of minimal dimension is referred to as greedy.
引用
收藏
页码:1151 / 1166
页数:16
相关论文
共 50 条