Abstract
A new trust region subproblem that accelerates convergence for solving symmetric nonlinear equations is defined. To avoid repeatedly computing the trust region subproblem, a line search technique without derivative information is used in the trust region algorithm. Moreover, a limited memory BFGS update is employed to generate an approximated matrix rather than a normal Jacobian matrix or quasi-Newton matrix. Under mild conditions, the global convergence and the superlinear convergence of the given algorithm are established. The numerical results indicate that this method can be beneficial for solving the presented problems.
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.