Journal
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume 198, Issue 2, Pages 483-492Publisher
ELSEVIER
DOI: 10.1016/j.cam.2005.09.026
Keywords
discrete ill-posed problems; L-curve criterion; regularization; parameter-choice method
Categories
Ask authors/readers for more resources
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.
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