Abstract

Iterated Tikhonov regularization methods are prevalent regularization methods that can make the solution of ill-posed problems less sensitive to noise. As the iteration number grows, their solution gradually converges to the optimum approximation of the desired solution but then changes to the worse, causing a semiconvergence. This difficulty can be reduced by a reliable early termination rule or a strategy for choosing the appropriate regularization parameter at each iteration. Different from the existing methods, this paper describes a novel iterative Tikhonov regularization based on introducing a non-decreasing sequence of relaxation parameters into the stationary iterated Tikhonov regularization, providing a fast and roughly stable convergence. After investigating theoretically the convergence rate of the novel iterative Tikhonov regularization, we propose a series of numerical experiments for the evaluation of its accuracy and finally describe a real-world application in the field of 3-dimensional image restoration problems to verify its efficiency.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.