Discrete Newton's method with local variations for solving large-scale nonlinear systems

dc.creatorDiniz-Ehrhardt, MA
dc.creatorGomes-Ruggiero, MA
dc.creatorLopes, VLR
dc.creatorMartinez, JM
dc.date2003
dc.dateAUG-OCT
dc.date2014-11-20T05:28:50Z
dc.date2015-11-26T16:06:43Z
dc.date2014-11-20T05:28:50Z
dc.date2015-11-26T16:06:43Z
dc.date.accessioned2018-03-28T22:55:32Z
dc.date.available2018-03-28T22:55:32Z
dc.identifierOptimization. Taylor & Francis Ltd, v. 52, n. 41763, n. 417, n. 440, 2003.
dc.identifier0233-1934
dc.identifierWOS:000186897600004
dc.identifier10.1080/02331930310001611538
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/79702
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/79702
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/79702
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1265982
dc.descriptionA globally convergent discrete Newton method is proposed for solving large-scale nonlinear systems of equations. Advantage is taken from discretization steps so that the residual norm can be reduced while the Jacobian is approximated, besides the reduction at Newtonian iterations. The Curtis-Powell-Reid (CPR) scheme for discretization is used for dealing with sparse Jacobians. Global convergence is proved and numerical experiments are presented.
dc.description52
dc.description41763
dc.description417
dc.description440
dc.languageen
dc.publisherTaylor & Francis Ltd
dc.publisherAbingdon
dc.publisherInglaterra
dc.relationOptimization
dc.relationOptimization
dc.rightsfechado
dc.rightshttp://journalauthors.tandf.co.uk/permissions/reusingOwnWork.asp
dc.sourceWeb of Science
dc.subjectnonlinear systems
dc.subjectdiscrete Newton's method
dc.subjectlocal variations method
dc.subjectSparse Jacobian Matrices
dc.subjectOptimization Software
dc.subjectEquations
dc.titleDiscrete Newton's method with local variations for solving large-scale nonlinear systems
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución