A projection-based approach to general-form Tikhonov regularization

SIAM Journal on Scientific Computing

Volumn 29, Issue 1, 2007, Pages 315-330

  Kilmer, Misha E ^a   Hansen, Per Christian ^b   Español, Malena I ^a  

^a TUFTS UNIVERSITY   (United States)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

General form Tikhonov regularization; Iterative bidiagonalization methods

Indexed keywords

ALGORITHMS; NUMERICAL METHODS; PROBLEM SOLVING;

ITERATIVE BIDIAGONALIZATION METHODS; REGULARIZATION MATRIX; TIKHONOV REGULARIZATION;

ITERATIVE METHODS;

EID: 39449117105     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/050645592     Document Type: Article

References (17)

1. A. BJÖRK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
2. M. G. COX, Data approximation by splines in one and two independent variables, in The State of the Art in Numerical Analysis, A. Iserles and M. J. D. Powell, eds., Clarendon Press, Oxford University Press, New York, 1987.
3. L. ELDÉN, A weighted pseudoinverse, generalized singular values, and constrained least squares problems, BIT, 22 (1982), pp. 487-502.
4. M. FEDI, P. C. HANSEN, AND V. PAOLETTI, Tutorial: Analysis of depth resolution in potentialfield inversion, Geophys., 70 (2005), pp. A1-A11.
5. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
6. C. W. GROETSCH, Inverse Problems in the Mathematical Sciences, Vieweg, Wiesbaden, Germany, 1993.
7. M. HANKE AND C. R. VOGEL, Two-level preconditioners for regularized inverse problems. I. Theory, Numer. Math., 83 (1999), pp. 385-402.
8. P. C. HANSEN, M. KILMER, AND R. H. KJELDSEN, Exploiting residual information in the parameter choice for discrete ill-posed problems, BIT, 46 (1996), pp, 41-59.
9. P. C. HANSEN, Regularization, GSVD and truncated GSVD, BIT, 29 (1989), pp. 491-504.
10. P. C. HANSEN, The discrete Picard condition for discrete ill-posed problems, BIT, 30 (1990), pp. 658-672.
11. P. C. HANSEN, Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems, Numer. Algorithms, 6 (1994), pp. 1-35.
12. M. JACOBSEN, P. C. HANSEN, AND M. A. SAUNDERS, Subspace preconditioned LSQR for discrete ill-posed problems, BIT, 43 (2003), pp. 975-989.
13. T. K. JENSEN AND P. C. HANSEN, Smoothing-norm preconditioning for regularizing minimum-residual methods, SIAM J. Matrix Anal. Appl., 29 (2006), pp. 1-14.
14. M. E. KILMER AND D. P. O'LEARY, Choosing regularization parameters in iterative methods for ill-posed problems, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 1204-1221.
15. C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares problems, ACM Trans. Math Software, 8 (1982), pp. 43-71.
16. M. A. SAUNDERS, Computing projections with LSQR, BIT, 37 (1997), pp. 96-104.
17. H. ZHA, Computing the generalized singular values/vectors of large sparse or structured matrix pairs, Numer. Math., 72 (1996), pp. 391-417.