Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- 1 December 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 34 (4) , 561-580
Abstract
When discrete ill-posed problems are analyzed and solved by various numerical regularization techniques, a very convenient way to display information about the regularized solution is to plot the norm or seminorm of the solution versus the norm of the residual vector. In particular, the graph associated with Tikhonov regularization plays a central role. The main purpose of this paper is to advocate the use of this graph in the numerical treatment of discrete ill-posed problems. The graph is characterized quantitatively, and several important relations between regularized solutions and the graph are derived. It is also demonstrated that several methods for choosing the regularization parameter are related to locating a characteristic L-shaped “corner” of the graph.Keywords
This publication has 34 references indexed in Scilit:
- Least squares methods1990
- Eigenvalues and Condition Numbers of Random MatricesSIAM Journal on Matrix Analysis and Applications, 1988
- A posteriori parameter choice for general regularization methods for solving linear ill-posed problemsApplied Numerical Mathematics, 1988
- The 2-norm of random matricesJournal of Computational and Applied Mathematics, 1988
- Ill-posed problems in early visionProceedings of the IEEE, 1988
- The truncatedSVD as a method for regularizationBIT Numerical Mathematics, 1987
- Asymptotic theory of filtering for linear operator equations with discrete noisy dataMathematics of Computation, 1987
- Calculating the Isochrones of Ventricular DepolarizationSIAM Journal on Scientific and Statistical Computing, 1984
- An Augmented Galerkin Method for First Kind Fredholm EquationsIMA Journal of Applied Mathematics, 1979
- Generalized Cross-Validation as a Method for Choosing a Good Ridge ParameterTechnometrics, 1979