Efficient implementation of a variable projection algorithm for nonlinear least squares problems
- 1 March 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (3), 167-169
- https://doi.org/10.1145/360860.360914
Abstract
Nonlinear least squares problems frequently arise for which the variables to be solved for can be separated into a linear and a nonlinear part. A variable projection algorithm has been developed recently which is designed to take advantage of the structure of a problem whose variables separate in this way. This paper gives a slightly more efficient and slightly more general version of this algorithm than has appeared earlier.Keywords
This publication has 2 references indexed in Scilit:
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables SeparateSIAM Journal on Numerical Analysis, 1973
- Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximationNumerische Mathematik, 1971