Tikhonov regularization is a standard method for obtaining smooth solutions to discrete ill-posed problems. A more recent method, based on the singular value decomposition (SVD), is the truncated SVD method. The purpose of this paper is to show, under mild conditions, 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. When this condition is satisfied, then both methods are guaranteed to produce smooth solutions that are very similar.
No takes yet. Share an insight, caveat, or question.
Per Christian Hansen (1990) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: