Abstract
AbstractThis paper presents a new iterative solver for least‐squares problems, which is developed based on the Levenberg–Marquardt and trust region methods. The proposed iterative solver substantially reduces computing time compared with the conventional Levenberg–Marquardt scheme, and can be efficiently applied to large‐scale problems. Three numerical examples are used to demonstrate the effectiveness of the proposed solver. Copyright © 2005 John Wiley & Sons, Ltd.
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 callMore From: Communications in Numerical Methods in Engineering
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.
