Skip to main content
Log in

Computational experience with algorithms for separable nonlinear least squares problems

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

Nonlinear least squares problems frequently arise in which the fitting function can be written as a linear combination of functions involving further parameters in a nonlinear manner. This paper outlines an efficient implementation of an iterative procedure originally developed by Golub and Pereyra and successively modified by various authors, which takes advantage of the linear-nonlinear structure, and investigates its performances on various test problems as compared with the standard Gauss-Newton and Gauss-Newton-Marquardt schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. H. Barham, W. Drane,An algorithm for least squares estimation of nonlinear parameters when some of the parameters are linear, Technometrics14 (1972), 757–766.

    Article  MATH  Google Scholar 

  2. K. M. Brawn, J. E. Dennis,Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation, Numer. Math.18 (1972), 289–297.

    Article  Google Scholar 

  3. C. Corradi, L. Stefanini,Un algoritmo per la soluzione di problemi di minimi quadrati non lineari, C. N. E. N. tech. rept. RT/EDP (76) 5, (1976).

  4. L. Gardini, L. Stefanini,Procedure di minimi quadrati lineari e non lineari basate su trasformazioni ortogonali, SOGESTA internal report A-253, 1976.

  5. G. H. Golub, V. Pereyra,The differentiation of pseudo-inverses and nonlinear least squares pr blems whose variables separate, SIAM J. Number. Anal.10 (1975), 413–432.

    Article  MathSciNet  Google Scholar 

  6. L. S. Jennings, M. R. Osborne,Applications of orthogonal matrix transformations to the solution of systems of linear and nonlinear equations, Tech. Rept. 37, Computer Centre, Australian National University, (1970).

  7. L. Kaufman,A variable projection method for solving separable nonlinear least squares problems, BIT15 (1975), 49–57.

    Article  MATH  MathSciNet  Google Scholar 

  8. F. T. Krogh,Efficient implementation of a variable projection algorithm for nonlinear least squares problems, Comm. ACM17 (1974), 167–169.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. R. Meyer, P. M. Roth,Modified damped least squares: an algorithm for nonlinear estimation, J. Inst. Math. Appl.9 (1972), 218–233.

    Article  MATH  Google Scholar 

  10. M. R. Osborne,Some aspects of nonlinear least squares calculations, in «Numerical methods for nonlinear optimization», edited by F. A. Lootsma (1972), Acad. Press, London and New York, 171–189.

    Google Scholar 

  11. M. R. Osborne,Some special nonlinear least squares problems, SIAM J. Numer. Anal.12 (1975), 571–591.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Ruhe, P. A. Wedin,Algorithms for separable nonlinear least squares problems, Stanford Computer Science Tech. Rept. 434, (1974).

Download references

Author information

Authors and Affiliations

Authors

Additional information

A preliminary version of this note has been presented at the CNR-GNIM meeting held in Florence, september 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Corradi, C., Stefanini, L. Computational experience with algorithms for separable nonlinear least squares problems. Calcolo 15, 317–330 (1978). https://doi.org/10.1007/BF02575921

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02575921

Keywords

Navigation