[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

GAMS Module LMSTR in SMINPACK


LMSTR

 
Finds a minimum of the sum of the squares of m nonlinear functions in n variables by a
modification of the Levenberg-Marquardt algorithm which uses minimal storage.
The user must provide a subroutine which calculates the functions and the rows of
the Jacobian.
 
Classes  :  K1b1a2 . Unconstrained nonlinear least squares approximation by
                   smooth functions, user provides first derivatives
 
Type     : Fortran subroutine in SMINPACK package.
Access   : Public domain. Portable.
Precision: Single.
Note     : Double precision version available in NETLIB package MINPACK.
 
Usage    : CALL LMSTR(FCN, M, N, X, FVEC, FJAC, LDFJAC, FTOL, XTOL, GTOL,
           MAXFEV, DIAG, MODE, FACTOR, NPRINT, INFO, NFEV, NJEV, IPVT, QTF,
           WA1, WA2, WA3, WA4)
 
Details  : Fullsource Source
Sites    : (1) NETLIB
 

Implementation of LMSTR from SMINPACK on NETLIB

 
NETLIB:    Public access repository, The University of Tennessee at
           Knoxville and Bell Laboratories
 
Precision: Single.
Note     : Double precision version available in NETLIB package MINPACK.
 
You may access components from NETLIB outside GAMS as follows.
 
   Source       : echo "send only lmstr from sminpack" | mail netlib@ornl.gov
   Fullsource   : echo "send lmstr from sminpack" | mail netlib@ornl.gov


[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology

This page was generated on Sat Sep 20, 2008 at 05:32:00 UTC