2021-10-22T20:51:58Zhttps://keep.lib.asu.edu/oai/requestoai:keep.lib.asu.edu:node-1365202021-08-11T21:09:57Zoai_pmh:alloai_pmh:repo_items136520
https://hdl.handle.net/2286/R.I.28737
28737
http://rightsstatements.org/vocab/InC/1.0/
2015-05
33 pages
eng
Hansen, Jakob Kristian
Renaut, Rosemary
Cochran, Douglas
Barrett, The Honors College
School of Music
Economics Program in CLAS
School of Mathematical and Statistical Sciences
Text
Deconvolution of noisy data is an ill-posed problem, and requires some form of regularization to stabilize its solution. Tikhonov regularization is the most common method used, but it depends on the choice of a regularization parameter λ which must generally be estimated using one of several common methods. These methods can be computationally intensive, so I consider their behavior when only a portion of the sampled data is used. I show that the results of these methods converge as the sampling resolution increases, and use this to suggest a method of downsampling to estimate λ. I then present numerical results showing that this method can be feasible, and propose future avenues of inquiry.
Deconvolution
Tikhonov Regularization
Mathematics
Signal Processing
Downsampling for Efficient Parameter Choice in Ill-Posed Deconvolution Problems