Some matrix nearness problems suggested by Tikhonov regularization

Abstract

The numerical solution of linear discrete ill-posed problems typically requires regularization, i.e., replacement of the available ill-conditioned problem by a nearby better conditioned one. The most popular regularization methods for problems of small to moderate size are Tikhonov regularization and truncated singular value decomposition (TSVD). By considering matrix nearness problems related to Tikhonov regularization, several novel regularization methods are derived. These methods share properties with both Tikhonov regularization and TSVD, and can give approximate solutions of higher quality than either one of these methods.

Cited by in corpus (4)

• The Generalized Matrix Chain Algorithm
• High-order regularization dealing with ill-conditioned robot localization problems
• Gradient-based iterative algorithms for solving Sylvester tensor equations and the associated tensor nearness problems
• The Matrix Chain Algorithm to Compile Linear Algebra Expressions