Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. On the Global Convergence of Broyden's Method

On the Global Convergence of Broyden's Method

File(s)
74-216.ps (481.86 KB)
74-216.pdf (1.36 MB)
Permanent Link(s)
https://hdl.handle.net/1813/6055
Collections
Computer Science Technical Reports
Author
More, Jorge J.
Trangenstein, J. A.
Abstract

We consider Broyden's 1965 method for solving nonlinear equations. If the mapping is linear, then a simple modification of this method guarantees global and Q-superlinear convergence. For nonlinear mappings it is shown that the hybrid strategy for nonlinear equations due to Powell leads to R-superlinear convergence provided the search directions from a uniformly linearly indepenent sequence. We then explore this last concept and its connection with Broyden's method. Finally, we point out how the above results extend to Powell's symmetric version of Broyden's method.

Date Issued
1974-10
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-216
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance