Abstract
In this paper, we are concerned with two efficient algorithms for surface construction. Based on the Gauss equations, a discretized nonlinear equation of the form should be solved in the process of surface construction. We first consider a regularized fixed-point iterative algorithm for solving the discretized equation, in which we determine the actual regularization parameter by the Morozov discrepancy principle. A two-parameter algorithm is employed for solving the Morozov equation, and the convergence of the regularized fixed-point iterative algorithm is demonstrated. Secondly, we also propose the regularizing Levenberg–Marquardt scheme to solve the discretized equation, in which the regularization parameter is chosen to be a small constant. Numerical experiments are provided to demonstrate the robustness and efficiency of the two algorithms.
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.
