Module BCLSF in IMSLM

• IMSLM Information

• Components
  • Documentation from ITL
  • Example from ITL

BCLSF

 
Solve a nonlinear least squares problem subject to bounds on the variables using a
modified Levenberg-Marquardt algorithm and a finite-difference Jacobian.
 
Classes  :  K1b1a1 . Unconstrained nonlinear least squares approximation by
                   smooth functions, user provides no derivatives
            K1b2a .  Linearly constrained nonlinear least squares
                   approximation
 
Type     : Fortran subroutine in IMSLM library.
Access   : Proprietary. Many implementations available.
Precision: Single.
 
Usage    : CALL BCLSF (FCN, M, N, XGUESS, IBTYPE, XLB, XUB, XSCALE, FSCALE,
           IPARAM, RPARAM, X, FVEC, FJAC, LDFJAC)
 
Details  : Documentation Example
Sites    : (1) ITL
 

Implementation of BCLSF from IMSLM on ITL

 
ITL:       Unix Workstation Network, National Institute of Standards and
           Technology (NIST), Gaithersburg, MD. Available to NIST staff.
 
Precision: Single. (Double: DBCLSF)
 
Access available only to NIST staff on internal Unix systems. They may access this
package provided the /itl tree is cross-mounted.
 
   Link         : Login to spruce.nist.gov and see ITL How-To for
                  information on how to setup your environment and link.
   Documentation: cat
                  /home/fetch/Subjects/Math-Stat-Software/imsl/Documentation/bclsf
   Example      : cat
                  /home/fetch/Subjects/Math-Stat-Software/imsl/Examples/bclsf