Show simple item record

Regularization Algorithms Based on Total Least Squares

dc.contributor.authorHansen, Per Christianen_US
dc.contributor.authorO'Leary, Dianne P.en_US
dc.description.abstractDiscretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to compute stable solutions to these systems it is necessary to apply regularization methods. Classical regularization methods, such as Tikhonov's method or truncated {\em SVD}, are not designed for problems in which both the coefficient matrix and the right-hand side are known only approximately. For this reason, we develop {\em TLS}\/-based regularization methods that take this situation into account. Here, we survey two different approaches to incorporation of regularization, or stabilization, into the {\em TLS} setting. The two methods are similar in spirit to Tikhonov regularization and truncated {\em SVD}, respectively. We analyze the regularizing properties of the methods and demonstrate by numerical examples that in certain cases with large perturbations, these new methods are able to yield more accurate regularized solutions than those produced by the standard methods. (Also cross-referenced as UMIACS-TR-96-65)en_US
dc.format.extent237573 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3684en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-96-65en_US
dc.titleRegularization Algorithms Based on Total Least Squaresen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record