Estimation of the L-Curve via Lanczos Bidiagonalization

BIT Numerical Mathematics

Volumn 39, Issue 4, 1999, Pages 603-619

  Calvetti, D ^a   Golub, G H ^b   Reichel, L ^c  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b Stanford University   (United States)

^c KENT STATE UNIVERSITY   (United States)

Author keywords

Gauss quadrature; Ill posed problem; L curve criterion; Regularization

Indexed keywords

EID: 0000924088     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022383005969     Document Type: Article

References (21)

1. M. L. Baart, The use of auto-correlation for pseudo-rank determination in noisy ill-conditioned least-squares problems, IMA J. Numer. Anal., 2 (1982), pp. 241-247.
2. Å. Björck, A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations, BIT, 18 (1988), pp. 659-670.
3. L. Eldén, Algorithms for the regularization of ill-conditioned least squares problems, BIT, 17, (1977), pp. 134-145.
4. H. W. Engl and W. Grever, Using the L-curve for determining optimal regularization parameters, Numer. Math., 69 (1994), pp. 25-31.
5. W. Gander, Least squares with a quadratic constraint, Numer. Math., 36 (1981), pp. 291-307.
6. G. H. Golub, Some modified matrix eigenvalue problems, SIAM Review, 15 (1973), pp. 318-334.
7. G. H. Golub and G. Meurant, Matrices, moments and quadrature, in Numerical Analysis 1993, D. F. Griffiths and G. A. Watson, eds., Longman, Essex, England, 1994, pp. 105-156.
8. G. H. Golub and Z. Strakos, Estimates in quadratic formulas, Numer. Algorithms, 8 (1994), pp. 241-268.
9. G. H. Golub and U. von Matt, Quadratically constrained least squares and quadratic problems, Numer. Math., 59 (1991), pp. 561-580.
10. G. H. Golub and U. von Matt, Generalized cross-validation for large scale problems, J. Comput. Graph. Stat., 6 (1997), pp. 1-34.
11. G. H. Golub and U. von Matt, Tikhonov regularization for large scale problems, in Workshop on Scientific Computing, G. H. Golub, S. H. Lui, F. Luk, and R. Plemmons, eds., Springer, New York, 1997, pp. 3-26.
12. M. Hanke, Limitations of the L-curve method in ill-posed problems, BIT, 36 (1996), pp. 287-301.
13. P. C. Hansen, Analysis of discrete ill-posed problems by means of the L-curve, SIAM Review, 34 (1992), pp. 561-580.
14. P. C. Hansen, Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems, Numer. Algorithms, 6 (1994), pp. 1-35. Software is available in Netlib at http://www.netlib.org.
15. P. C. Hansen and D. P. O'Leary, The use of the L-curve in the regularization of discrete ill-posed problems, SIAM J. Sci. Comput., 14 (1993), pp. 1487-1503.
16. L. Kaufman and A. Neumaier, Regularization of ill-posed problems by envelope guided conjugate gradients, J. Comput. Graph. Stat., 6 (1997), pp. 451-463.
17. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, SIAM, Philadelphia, PA, 1995.
18. V. A. Morozov, On the solution of functional equations by the method of regularization, Soviet Math. Dokl., 7 (1966), pp. 414-417.
19. D. P. O'Leary and J. A. Simmons, A bidiagonalization-regularization procedure for large scale discretizations of ill-posed problems, SIAM J. Sci. Stat. Comput., 2 (1981), pp. 474-489.
20. C. C. Paige and M. A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
21. C. R. Vogel, Non-convergence of the L-curve regularization parameter selection method, Inverse Problems, 12 (1996), pp. 535-547.