MINPACK

MINPACK is a library of FORTRAN subroutines for the solving of systems of nonlinear equations, or the least-squares minimization of the residual of a set of linear or nonlinear equations.

MINPACK, along with other similar libraries such as LINPACK and EISPACK, originated from the Mathematics and Computer Science Division Software (MCS) of Argonne National Laboratory. Written by Jorge Moré, Burt Garbow, and Ken Hillstrom, MINPACK is free and designed to be highly portable, robust and reliable. The quality of its implementation of the Levenberg–Marquardt algorithm is attested by Dennis and Schnabel.[1]

Five algorithmic paths each include a core subroutine and a driver routine. The algorithms proceed either from an analytic specification of the Jacobian matrix or directly from the problem functions. The paths include facilities for systems of equations with a banded Jacobian matrix, for least-squares problems with a large amount of data, and for checking the consistency of the Jacobian matrix with the functions.

References
  • J. J. Moré, B. S. Garbow, and K. E. Hillstrom, User Guide for MINPACK-1, Argonne National Laboratory Report ANL-80-74, Argonne, Ill., 1980.
  • J. J. Moré, D. C. Sorensen, K. E. Hillstrom, and B. S. Garbow, The MINPACK Project, in Sources and Development of Mathematical Software, W. J. Cowell, ed., Prentice-Hall, pages 88–111, 1984.
  1. Dennis, J. E.; Schnabel, Robert B. (1996). Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Society for Industrial and Applied Mathematics. pp. 228, 233, 265. ISBN 9781611971200.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.