Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1978)
TJMAR 1 - - A FORTRAN subroutine for nonlinear least squares parameter estimation
JPL Math Library Documentation, Jet Propulsion Lab
MINPACK Documentation, Appl. Math. Dlv. Argonne National Lab
G. Peckham (1970)
A New Method for Minimising a Sum of Squares Without Calculating GradientsComput. J., 13
J. Moré (1977)
The Levenberg-Marquardt algo-rithm: Implementation and theory
NPL Numerical Optimization Software Library User's Manual
H. Chernoff (1973)
The Use of Faces to Represent Points in k- Dimensional Space GraphicallyJournal of the American Statistical Association, 68
(1977)
An adapative nonlinear least-squares algorithm
(1981)
ACM Transactions on Mathematmal Software
HarweU Subroutine Library-Catalog of Subroutines
(1979)
A comparison of nonhnear least squares software. Sandia Tech. Rep. SAND79- 0483, Sandia Labs
David Jacobs (1978)
Numerical Software: Needs and Availability
(1980)
Received March
J. Moré, B. Garbow, K. Hillstrom (1981)
Testing Unconstrained Optimization SoftwareACM Trans. Math. Softw., 7
F. Krogh (1974)
Efficient implementation of a variable projection algorithm for nonlinear least squares problemsCommun. ACM, 17
An Evaluation of Mathematical Software That Solves Nonlinear Least Squares Problems K. L. HIEBERT Sandla National Laboratories In this paper the "state of the art" of mathematical software that solves nonlinear least squares problems is evaluated. The evaluatmn is based on a comparison of 12 readily available FORTRAN codes. Theoretical and software aspects of the codes, as well as their performance on a carefully designed set of test problems, are used in the comparison. Key Words and Phrases: software evaluation, nonlinear least squares, nonlinear regression, nonlinear data fittmg, Levenberg-Marquardt, Gauss-Newton, augmented Gauss-Newton, quasi-Newton CR Categories: 4, 4.6, 5, 5.1 1. INTRODUCTION An integral part of the development of m a t h e m a t i c a l software is the testing of the software. One c o m m o n type of testing is comparison testing, t h a t is, comparing the performance of two or more codes t h a t claim to be able to solve the same type of problem, for the purpose of determining which code is "best." As a n y o n e who has ever been involved in testing software knows, testing to find a "best"
ACM Transactions on Mathematical Software (TOMS) – Association for Computing Machinery
Published: Mar 1, 1981
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.