Error estimates for large-scale ill-posed problems

The computation of an approximate solution of linear discrete ill-posed problems with contaminated data is delicate due to the possibility of severe error propagation. Tikhonov regularization seeks to reduce the sensitivity of the computed solution to errors in the data by replacing the given ill-posed problem by a nearby problem, whose solution is less sensitive to perturbation. This regularization method requires that a suitable value of the regularization parameter be chosen. Recently, Brezinski et al. (Numer Algorithms 49, 2008) described new approaches to estimate the error in approximate solutions of linear systems of equations and applied these estimates to determine a suitable value of the regularization parameter in Tikhonov regularization when the approximate solution is computed with the aid of the singular value decomposition. This paper discusses applications of these and related error estimates to the solution of large-scale ill-posed problems when approximate solutions are computed by Tikhonov regularization based on partial Lanczos bidiagonalization of the matrix. The connection between partial Lanczos bidiagonalization and Gauss quadrature is utilized to determine inexpensive bounds for a family of error estimates.

[1]  Giles Auchmuty,et al.  A posteriori error estimates for linear equations , 1992 .

[2]  G. Golub.  Bounds for matrix moments , 1974 .

[3]  Lothar Reichel,et al.  Matrices, moments, and rational quadrature , 2008 .

[4]  C. B. Shaw,et al.  Improvement of the resolution of an instrument by numerical solution of an integral equation , 1972 .

[5]  A. Bakushinskii.  Remarks on choosing a regularization parameter using the quasioptimality and ratio criterion , 1985 .

[6]  Per Christian Hansen,et al.  Regularization Tools version 4.0 for Matlab 7.3 , 2007, Numerical Algorithms.

[7]  Lothar Reichel,et al.  SIMPLE SQUARE SMOOTHING REGULARIZATION OPERATORS , 2009 .

[8]  H. Engl,et al.  Regularization of Inverse Problems , 1996 .

[9]  Michael A. Saunders,et al.  LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[10]  Giuseppe Rodriguez,et al.  Fast Solution of Toeplitz- and Cauchy-Like Least-Squares Problems , 2006, SIAM J. Matrix Anal. Appl..

[11]  W. Gautschi.  Orthogonal Polynomials: Computation and Approximation , 2004 .

[12]  Sebastiano Seatzu.  A remark on the numerical solution of linear inverse problems with discrete data , 1986 .

[13]  C. Brezinski,et al.  Error Estimates for the Solution of Linear Systems , 1999, SIAM J. Sci. Comput..

[14]  Claude Brezinski,et al.  Error estimates for the regularization of least squares problems , 2009, Numerical Algorithms.

[15]  Cornelis V. M. van der Mee,et al.  A Method for Generating Infinite Positive Self-adjoint Test Matrices and Riesz Bases , 2005, SIAM J. Matrix Anal. Appl..

[16]  W. Gautschi,et al.  THE INTERPLAY BETWEEN CLASSICAL ANALYSIS AND ( NUMERICAL ) LINEAR ALGEBRA — A TRIBUTE TO GENE , 2002 .

[17]  Serena Morigi,et al.  Orthogonal projection regularization operators , 2007, Numerical Algorithms.

[18]  G. Golub,et al.  Estimation of the L-Curve via Lanczos Bidiagonalization , 1999 .

[19]  Gene H. Golub,et al.  Matrices, moments, and quadrature , 2007, Milestones in Matrix Computation.

[20]  Per Christian Hansen,et al.  Rank-Deficient and Discrete Ill-Posed Problems , 1996 .

[21]  L. Eldén.  Algorithms for the regularization of ill-conditioned least squares problems , 1977 .

[22]  M. Baart.  The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems , 1982 .

[23]  G. Golub,et al.  Calculation of Gauss quadratures with multiple free and fixed knots , 1983 .

[24]  David L. Phillips,et al.  A Technique for the Numerical Solution of Certain Integral Equations of the First Kind , 1962, JACM.

[25]  Claude Brezinski,et al.  Error estimates for linear systems with applications to regularization , 2008, Numerical Algorithms.

[26]  Walter Gautschi,et al.  THE INTERPLAY BETWEEN CLASSICAL ANALYSIS AND (NUMERICAL) LINEAR ALGEBRA — A TRIBUTE TO GENE H. GOLUB , 2002 .

[27]  D. Calvetti,et al.  Tikhonov Regularization of Large Linear Problems , 2003 .