A full-Newton approach to separable nonlinear least squares problems and its application to discrete least squares rational approximation
Borges, Carlos F.
MetadataShow full item record
We consider a class of non-linear least squares problems that are widely used in fitting experimental data. A defining characteristic of the models we will consider is that the solution parameters may be separated into two classes, those that enter the problem linearly and those that enter non-linearly. Problems of this type are known as separable non-linear least squares (SNLLS) problems and are often solved using a Gauss-Newton algorithm that was developed in Golub and Pereyra [SIAM J. Numer. Anal., 10 (1973), pp. 413–432] and has been very widely applied. We develop a full-Newton algorithm for solving this problem. Exploiting the structure of the general problem leads to a surprisingly compact algorithm which exhibits all of the excellent characteristics of the full-Newton approach (e.g. rapid convergence on problems with large residuals). Moreover, for certain problems of quite general interest, the per iteration cost for the full-Newton algorithm compares quite favorably with that of the Gauss-Newton algorithm. We explore one such problem, that of discrete least-squares fitting of rational functions.
Showing items related by title, author, creator and subject.
Romano, M.; Agrawal, B. (2004);The dynamics equations of a spacecraft consisting of two bodies mutually rotating around a common gimbal axis are derived by the use of the Newton–Euler approach. One of the bodies contains a cluster of single-gimbal var ...
Hewett, Marle David. (Monterey, California. Naval Postgraduate School, 1974-06);A second-order epsilon method is developed for trajectory optimization problems. The method is applied to several aircraft and missile performance and air combat maneuvering problems. Heavy emphasis is placed on the ...
Goldstein, Allen A. (Monterey, California. Naval Postgraduate School, 1989-02); NPS-53-88-010Pt.1. 1) Relying on a theorem of Nemerovsky and Yuden(1979) a lower bound is given for the efficiency of global Newton methods over the class C1(mu, Lambda). 2) The efficiency of Smale's global Newton method in a simple ...