Per Christian Hansen

Per Christian Hansen

Auto-generated profile, based on publicly available information

Per Christian Hansen

Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kgs. Lyngby, Denmark

Research Focus & Metrics

Academic Career Length

42Years (1985-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 1992 in SIAM Review
Verified
Journal Article
Closed access
PHPer Christian Hansen
Per Christian Hansen
When discrete ill-posed problems are analyzed and solved by various numerical regularization techniques, a very convenient way to display information about the regularized solution is to plot the norm or seminorm of the solution versus the norm of the residual vector. In particular, the graph associated with Tikhonov regularization plays a central role. The main purpose of this paper is to advocate the use of this graph in the numerical treatment of discrete ill-posed problems. The graph is characterized quantitatively, and several important relations between regularized solutions and the graph are derived. It is also demonstrated that several methods for choosing the regularization parameter are related to locating a characteristic L-shaped “corner” of the graph.

1 November 1993 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
PHPer Christian Hansen
Per Christian Hansen
DODianne Prost O’lEary
Dianne Prost O’lEary
Regularization algorithms are often used to produce reasonable solutions to ill-posed problems. The L-curve is a plot—for all valid regularization parameters—of the size of the regularized solution versus the size of the corresponding residual. Two main results are established. First a unifying characterization of various regularization methods is given and it is shown that the measurement of “size” is dependent on the particular regularization method chosen. For example, the 2-norm is appropriate for Tikhonov regularization, but a 1-norm in the coordinate system of the singular value decomposition (SVD) is relevant to truncated SVD regularization. Second, a new method is proposed for choosing the regularization parameter based on the L-curve, and it is shown how this method can be implemented efficiently. The method is compared to generalized cross validation and this new method is shown to be more robust in the presence of correlated errors.



1 January 1999 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
GGGene H. Golub
Gene H. Golub
PHPer Christian Hansen
Per Christian Hansen
DODianne P. O'Leary
Dianne P. O'Leary
Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to computestable solutions to these systems it is necessary to apply regularization methods. We show how Tikhonov's regularization method, which in its original formulation involves a least squares problem, can be recast in a total least squares formulation suited for problems in which both the coefficient matrix and the right-hand side are known only approximately. We analyze the regularizing properties of this method and demonstrate by a numerical example that, in certain cases with large perturbations, the new method is superior to standard regularization methods.

10 November 2007 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
PHPer Christian Hansen
Per Christian Hansen