The truncatedSVD as a method for regularization

@article{Hansen1987TheTA,
  title={The truncatedSVD as a method for regularization},
  author={Per Christian Hansen},
  journal={BIT Numerical Mathematics},
  year={1987},
  volume={27},
  pages={534-553}
}
  • P. Hansen
  • Published 1987
  • Mathematics
  • BIT Numerical Mathematics
The truncated singular value decomposition (SVD) is considered as a method for regularization of ill-posed linear least squares problems. In particular, the truncated SVD solution is compared with the usual regularized solution. Necessary conditions are defined in which the two methods will yield similar results. This investigation suggests the truncated SVD as a favorable alternative to standard-form regularization in cases of ill-conditioned matrices with well-determined numerical rank. 

Figures and Tables from this paper

Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
  • P. Hansen
  • Mathematics, Computer Science
  • SIAM J. Sci. Comput.
  • 1990
TLDR
The purpose of this paper is to show that the success of both truncated SVD and Tikhonov regularization depends on satisfaction of a discrete Picard condition, involving both the matrix and the right-hand side. Expand
Solution of Ill-Posed Problems by Means of Truncated SVD
We consider Truncated SVD (TSVD) solutions to ill-posed least squares problems involving matrices with well-determined as well as ill-determined numerical rank. If a discrete Picard condition isExpand
Regularization,GSVD and truncatedGSVD
The purpose of this paper is to analyze Tikhonov regularization in general form by means of generalized SVD (GSVD) in the same spirit as SVD is used to analyze standard-form regularization. We alsoExpand
The SVD in image restoration
Publisher Summary This chapter focuses on singular value decomposition (SVD)-based algorithms for ill-posed problems in image restoration. It discusses the characteristics of solutions produced byExpand
The discrete picard condition for discrete ill-posed problems
We investigate the approximation properties of regularized solutions to discrete ill-posed least squares problems. A necessary condition for obtaining good regularized solutions is that the FourierExpand
An Improved Tikhonov-Regularized Variable Projection Algorithm for Separable Nonlinear Least Squares
  • Hua Guo, Guolin Liu, Luyao Wang
  • Computer Science, Mathematics
  • Axioms
  • 2021
In this work, we investigate the ill-conditioned problem of a separable, nonlinear least squares model by using the variable projection method. Based on the truncated singular value decompositionExpand
An algorithm for estimating the optimal regularization parameter by the L-curve
In this paper we introduce a new algorithm to estimate the optimal regularization parameter in truncated singular value decomposition (TSVD) regularization methods for the numerical solution ofExpand
Model Selection Criteria for a Linear Model to Solve Discrete Ill-Posed Problems on the Basis of Singular Decomposition and Random Projection
Criteria are developed to determine the optimal number of components of a linear model in solving a discrete ill-posed problem by the methods of truncated singular value decomposition and randomExpand
Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
TLDR
An efficient method is presented for computing the TSVD solution via a QR-factorization, without the need for computing a complete SVD. Expand
Modern regularization methods for inverse problems
TLDR
The aim of this paper is to provide a reasonably comprehensive overview of this shift towards modern nonlinear regularization methods, including their analysis, applications and issues for future research. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
Algorithms for the regularization of ill-conditioned least squares problems
Two regularization methods for ill-conditioned least squares problems are studied from the point of view of numerical efficiency. The regularization methods are formulated as quadraticallyExpand
Perturbation bounds in connection with singular value decomposition
LetA be anm ×n-matrix which is slightly perturbed. In this paper we will derive an estimate of how much the invariant subspaces ofAHA andAAH will then be affected. These bounds have the sin ϑ theoremExpand
On the almost rank deficient case of the least squares problem
This paper studies properties of the solutions to overdetermined systems of linear equations whose matrices are almost rank deficient. Let such a system be approximated by the system of rankr whichExpand
On the Numerical Solution of Ill-Conditioned Linear Systems with Applications to Ill-Posed Problems
We consider the solution of ill-conditioned linear systems using the singular value decomposition, and show how this can improve the accuracy of the computed solution for certain kinds of right-handExpand
Rank degeneracy and least squares problems
This paper is concerned with least squares problems when the least squares matrix A is near a matrix that is not of full rank. A definition of numerical rank is given. It is shown that under certainExpand
A Numerical Method for Solving Fredholm Integral Equations of the First Kind Using Singular Values
The integral equation in question is approximated by simple numerical quadrature formulas plus collocation.Each row of the resulting matrix equation for the unknown function values is weighted by theExpand
An SVD analysis of linear algebraic equations derived from first kind integral equations
Abstract By means of singular value decomposition (SVD) we investigate the systems of linear algebraic equations which are derived for numerical solution of first kind Fredholm integral equationsExpand
A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
Four well-known methods for the numerical solution of linear discrete ill-posed problems are investigated from a common point of view: namely, the type of algebraic expansion generated for the solu...
The generalized eigenstructure problem in linear system theory
The algebraic theory of linear time-invariant systems has been studied in large detail during the past few decades and numerous computational algorithms have been developed to solve problems arisingExpand
The Numerical Solution of a Non-Characteristic Cauchy Probelm for a Parabolic Equation
We study the problem of solving numerically a parabolic partial differential equation in one space dimension, where boundary values are given on one boundary only. For the analysis and numericalExpand
...
1
2
3
4
...