Abstract
Tikhonov regularization replaces a linear discrete ill-posed problem by a penalized least-squares problem, whose solution is less sensitive to errors in the data and round-off errors introduced during the solution process. The penalty term is defined by a regularization matrix and a regularization parameter. The latter generally has to be determined during the solution process. This requires repeated solution of the penalized least-squares problem. It is therefore attractive to transform the least-squares problem to simpler form before solution. The present paper describes a transformation of the penalized least-squares problem to simpler form that is faster to compute than available transformations in the situation when the regularization matrix has linearly dependent columns and no exploitable structure. Properties of this kind of regularization matrices are discussed and their performance is illustrated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bai, Z.: The CSD, GSVD, Their Applications and Computation. IMA preprint 958, Institute for Mathematics and its Applications, University of Minnesota, Minneapolis, MN (1992)
Bai, Z., Demmel, J.W.: Computing the generalized singular value decomposition. SIAM J. Sci. Comput. 14, 1464–1486 (1993)
Brezinski, C., Redivo-Zaglia, M., Rodriguez, G., Seatzu, S.: Extrapolation techniques for ill-conditioned linear systems. Numer. Math. 81, 1–29 (1998)
Brezinski, C., Redivo-Zaglia, M., Rodriguez, G., Seatzu, S.: Multi-parameter regularization techniques for ill-conditioned linear systems. Numer. Math. 94, 203–228 (2003)
Brezinski, C., Rodriguez, G., Seatzu, S.: Error estimates for linear systems with application to regularization. Numer. Algorithms 49, 85–104 (2008)
Brezinski, C., Rodriguez, G., Seatzu, S.: Error estimates for the regularization of least squares problems. Numer. Algorithms 51, 61–76 (2009)
Calvetti, D., Reichel, L., Shuibi, A.: Invertible smoothing preconditioners for linear discrete ill-posed problems. Appl. Numer. Math. 54, 135–149 (2005)
Campbell, S.L., Meyer, C.D.: Generalized Inverses of Linear Transformations. Dover, Mineola (1991)
Eldén, L.: Algorithms for the regularization of ill-conditioned least squares problems. BIT 17, 134–145 (1977)
Eldén, L.: A weighted pseudoinverse, generalized singular values, and constrained least squares problems. BIT 22, 487–501 (1982)
Engl, H.W., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Kluwer, Dordrecht (1996)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)
Hansen, P.C.: Regularization, GSVD and truncated GSVD. BIT 29, 491–504 (1989)
Hansen, P.C.: Regularization tools version 4.0 for Matlab 7.3. Numer. Algorithms 46, 189–194 (2007)
Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems. SIAM, Philadelphia (1998)
Morigi, S., Reichel, L., Sgallari, F.: Orthogonal projection regularization operators. Numer. Algorithms 44, 99–114 (2007)
Phillips, D.L.: A technique for the numerical solution of certain integral equations of the first kind. J. ACM 9, 84–97 (1962)
Reichel, L., Ye, Q.: Simple square smoothing regularization operators. Electron. Trans. Numer. Anal. 33, 63–83 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Claude Brezinski and Sebastiano Seatzu on the occasion of their 70th birthdays.
L. Reichel research supported in part by NSF grant DMS-1115385.
Rights and permissions
About this article
Cite this article
Dykes, L., Reichel, L. On the reduction of Tikhonov minimization problems and the construction of regularization matrices. Numer Algor 60, 683–696 (2012). https://doi.org/10.1007/s11075-012-9600-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-012-9600-z