Abstract
Ten full-matrix problems and thirteen sparse-matrix problems, all based on chemical engineering problems, are used to perform a comprehensive test of iterative nonlinear equation solving techniques, in particular the techniques used for computing the correction step, and for updating sparse Jacobian matrices. Comparisons are made on the basis of both efficiency and reliability. Results indicate that Powell's dogleg correction step performs slightly better than the quasi-Newton step. Schubert's sparse Jacobian update performs very well, but the best overall is Bogle and Perkins's new least-relative-change update, at least when combined with the dogleg correction step.
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.
