期刊
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
卷 198, 期 2, 页码 483-492出版社
ELSEVIER
DOI: 10.1016/j.cam.2005.09.026
关键词
discrete ill-posed problems; L-curve criterion; regularization; parameter-choice method
We describe a robust and adaptive implementation of the L-curve criterion. The algorithm locates the corner of a discrete L-curve which is a log-log plot of corresponding residual norms and solution norms of regularized solutions from a method with a discrete regularization parameter (such as truncated SVD or regularizing CG iterations). Our algorithm needs no predefined parameters, and in order to capture the global features of the curve in an adaptive fashion, we use a sequence of pruned L-curves that correspond to considering the curves at different scales. We compare our new algorithm to existing algorithms and demonstrate its robustness by numerical examples. (c) 2005 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据