Abstract
In this paper, an iterative method is presented for the computation of regularized solutions of discrete ill-posed problems. In the proposed method, the regularization problem is formulated as an equality constrained minimization problem and an iterative Lagrange method is used for its solution. The Lagrange iteration is terminated according to the discrepancy principle. The relationship between the proposed approach and classical Tikhonov regularization is discussed. Results of numerical experiments are presented to illustrate the effectiveness and usefulness of the proposed method.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
