dc.creatorMartinez J.M.
dc.date1984
dc.date2015-06-30T13:43:15Z
dc.date2015-11-26T14:38:33Z
dc.date2015-06-30T13:43:15Z
dc.date2015-11-26T14:38:33Z
dc.date.accessioned2018-03-28T21:43:41Z
dc.date.available2018-03-28T21:43:41Z
dc.identifier
dc.identifierComputing. Springer-verlag, v. 33, n. 3-4, p. 353 - 362, 1984.
dc.identifier0010485X
dc.identifier10.1007/BF02242278
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-0021614679&partnerID=40&md5=6500400bde7bd97a6fa7b72da04e10f4
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/98634
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/98634
dc.identifier2-s2.0-0021614679
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1249633
dc.descriptionIn this paper we introduce a new Quasi-Newton method for solving nonlinear simultaneous equations. At each iteration only one column of Bk is changed to obtain Bk+1. This permits to use the well-known techniques of Linear Programming for modifying the factorization of Bk. We present a local convergence theorem for a restarted version of the method. The new algorithm is compared numerically with some other methods which were introduced for solving the same kind of problems. © 1984 Springer-Verlag.
dc.description33
dc.description3-4
dc.description353
dc.description362
dc.languageen
dc.publisherSpringer-Verlag
dc.relationComputing
dc.rightsfechado
dc.sourceScopus
dc.titleA Quasi-newton Method With Modification Of One Column Per Iteration
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución