Some Convergence Properties of Broyden's Method / David M. Gay.
Material type:
- Hardcopy version available to institutional subscribers
Item type | Home library | Collection | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
Working Paper | Biblioteca Digital | Colección NBER | nber w0175 (Browse shelf(Opens below)) | Not For Loan |
July 1977.
In 1965 Broyden introduced a family of algorithms called(rank-one) quasi-New-ton methods for iteratively solving systems of nonlinear equations. We show that when any member of this family is applied to an n x n nonsingular system of linear equations and direct-prediction steps are taken every second iteration, then the solution is found in at most 2n steps. Specializing to the particular family member known as Broyden’s (good) method, we use this result to show that Broyden's method enjoys local 2n-step Q-quadratic convergence on nonlinear problems.
Hardcopy version available to institutional subscribers
System requirements: Adobe [Acrobat] Reader required for PDF files.
Mode of access: World Wide Web.
Print version record
There are no comments on this title.