Estimation of the L-Curve via Lanczos Bidiagonalization

被引:0
作者
D. Calvetti
G. H. Golub
L. Reichel
机构
[1] Case Western Reserve University,Department of Mathematics
[2] Stanford University,Department of Computer Science
[3] Kent State University,Department of Mathematics and Computer Science
来源
BIT Numerical Mathematics | 1999年 / 39卷
关键词
Ill-posed problem; regularization; L-curve criterion; Gauss quadrature;
D O I
暂无
中图分类号
学科分类号
摘要
The L-curve criterion is often applied to determine a suitable value of the regularization parameter when solving ill-conditioned linear systems of equations with a right-hand side contaminated by errors of unknown norm. However, the computation of the L-curve is quite costly for large problems; the determination of a point on the L-curve requires that both the norm of the regularized approximate solution and the norm of the corresponding residual vector be available. Therefore, usually only a few points on the L-curve are computed and these values, rather than the L-curve, are used to determine a value of the regularization parameter. We propose a new approach to determine a value of the regularization parameter based on computing an L-ribbon that contains the L-curve in its interior. An L-ribbon can be computed fairly inexpensively by partial Lanczos bidiagonalization of the matrix of the given linear system of equations. A suitable value of the regularization parameter is then determined from the L-ribbon, and we show that an associated approximate solution of the linear system can be computed with little additional work.
引用
收藏
页码:603 / 619
页数:16
相关论文
共 26 条
[1]  
Baart M. L.(1982)The use of auto-correlation for pseudo-rank determination in noisy ill-conditioned least-squares problems IMA J. Numer. Anal. 2 241-247
[2]  
Björck Å.(1988)A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations BIT 18 659-670
[3]  
Eldén L.(1977)Algorithms for the regularization of ill-conditioned least squares problems BIT 17 134-145
[4]  
Engl H. W.(1994)Using the L-curve for determining optimal regularization parameters Numer. Math. 69 25-31
[5]  
Grever W.(1981)Least squares with a quadratic constraint Numer. Math. 36 291-307
[6]  
Gander W.(1973)Some modified matrix eigenvalue problems SIAM Review 15 318-334
[7]  
Golub G. H.(1994)Estimates in quadratic formulas Numer. Algorithms 8 241-268
[8]  
Golub G. H.(1991)Quadratically constrained least squares and quadratic problems Numer. Math. 59 561-580
[9]  
Strakos Z.(1997)Generalized cross-validation for large scale problems J. Comput. Graph. Stat. 6 1-34
[10]  
Golub G. H.(1996)Limitations of the L-curve method in ill-posed problems BIT 36 287-301