Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: An Algorithm For Solving Sparse Nonlinear Least Squares Problems
Author: Martinez J.M.
Abstract: We introduce a new method for solving Nonlinear Least Squares problems when the Jacobian matrix of the system is large and sparse. The main features of the new method are the following: a) The Gauss-Newton equation is "partially" solved at each iteration using a preconditioned Conjugate Gradient algorithm. b) The new point is obtained using a two-dimensional trust region scheme, similar to the one introduced by Bulteau and Vial. We prove global and local convergence results and we present some numerical experiments. © 1987 Springer-Verlag.
Editor: Springer-Verlag
Rights: fechado
Identifier DOI: 10.1007/BF02239974
Date Issue: 1987
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-0023568876.pdf809.01 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.