Abstract
We prove the saturation of methods for solving linear ill-posed problems in Hilbert spaces for a wide class of regularization methods. It turns out that, under a certain convexity assumption, saturation must necessarily occur. We provide easy to verify assumptions, which allow us to calculate the rate at which saturation occurs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.