Why Broyden's Nonsymmetric Method Terminates on linear equations
| dc.contributor.author | O'Leary, Dianne P. | en_US |
| dc.date.accessioned | 2004-05-31T22:23:12Z | |
| dc.date.available | 2004-05-31T22:23:12Z | |
| dc.date.created | 1993-03 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Abstract. The family of algorithms introduced by Broyden in 1965 for solving systems of nonlinear equations has been used quite effectively on a variety of problems. In 1979, Gay proved the then surprising result that the algorithms terminate in at most 2n steps on linear problems with n variables. His very clever proof gives no insight into properties of the intermediate iterates, however. In this work we show that Broyden's methods are projection methods, forcing the residuals to lie in a nested set of subspaces of decreasing dimension. (Also cross-referenced as UMIACS-TR-93-23) | en_US |
| dc.format.extent | 94172 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/583 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3045 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-93-23 | en_US |
| dc.title | Why Broyden's Nonsymmetric Method Terminates on linear equations | en_US |
| dc.type | Technical Report | en_US |