E04GYF (PDF version)
E04 Chapter Contents
E04 Chapter Introduction
NAG Library Manual

NAG Library Routine Document


Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

E04GYF is an easy-to-use quasi-Newton algorithm for finding an unconstrained minimum of a sum of squares of m nonlinear functions in n variables mn. First derivatives are required.
It is intended for functions which are continuous and which have continuous first and second derivatives (although it will usually work even if the derivatives have occasional discontinuities).

2  Specification

REAL (KIND=nag_wp)  X(N), FSUMSQ, W(LW), RUSER(*)

3  Description

E04GYF is similar to the subroutine LSFDQ2 in the NPL Algorithms Library. It is applicable to problems of the form
where x=x1,x2,,xnT and mn. (The functions fix are often referred to as ‘residuals’.) You must supply a subroutine to evaluate the residuals and their first derivatives at any point x.
Before attempting to minimize the sum of squares, the algorithm checks the subroutine for consistency. Then, from a starting point supplied by you, a sequence of points is generated which is intended to converge to a local minimum of the sum of squares. These points are generated using estimates of the curvature of Fx.

4  References

Gill P E and Murray W (1978) Algorithms for the solution of the nonlinear least-squares problem SIAM J. Numer. Anal. 15 977–992

5  Parameters

1:     M – INTEGERInput
2:     N – INTEGERInput
On entry: the number m of residuals, fix, and the number n of variables, xj.
Constraint: 1NM.
3:     LSFUN2 – SUBROUTINE, supplied by the user.External Procedure
You must supply this routine to calculate the vector of values fix and the Jacobian matrix of first derivatives fi xj  at any point x. It should be tested separately before being used in conjunction with E04GYF (see the E04 Chapter Introduction).
The specification of LSFUN2 is:
Important: the dimension declaration for FJAC must contain the variable LDFJAC, not an integer constant.
1:     M – INTEGERInput
On entry: m, the numbers of residuals.
2:     N – INTEGERInput
On entry: n, the numbers of variables.
3:     XC(N) – REAL (KIND=nag_wp) arrayInput
On entry: the point x at which the values of the fi and the fi xj  are required.
4:     FVEC(M) – REAL (KIND=nag_wp) arrayOutput
On exit: FVECi must contain the value of fi at the point x, for i=1,2,,m.
5:     FJAC(LDFJAC,N) – REAL (KIND=nag_wp) arrayOutput
On exit: FJACij must contain the value of fi xj  at the point x, for i=1,2,,m and j=1,2,,n.
6:     LDFJAC – INTEGERInput
On entry: the first dimension of the array FJAC as declared in the (sub)program from which E04GYF is called.
7:     IUSER(*) – INTEGER arrayUser Workspace
8:     RUSER(*) – REAL (KIND=nag_wp) arrayUser Workspace
LSFUN2 is called with the parameters IUSER and RUSER as supplied to E04GYF. You are free to use the arrays IUSER and RUSER to supply information to LSFUN2 as an alternative to using COMMON global variables.
LSFUN2 must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which E04GYF is called. Parameters denoted as Input must not be changed by this procedure.
4:     X(N) – REAL (KIND=nag_wp) arrayInput/Output
On entry: Xj must be set to a guess at the jth component of the position of the minimum, for j=1,2,,n. The routine checks the first derivatives calculated by LSFUN2 at the starting point and so is more likely to detect an error in your routine if the initial Xj are nonzero and mutually distinct.
On exit: the lowest point found during the calculations. Thus, if IFAIL=0 on exit, Xj is the jth component of the position of the minimum.
5:     FSUMSQ – REAL (KIND=nag_wp)Output
On exit: the value of the sum of squares, Fx, corresponding to the final point stored in X.
6:     W(LW) – REAL (KIND=nag_wp) arrayWorkspace
7:     LW – INTEGERInput
On entry: the dimension of the array W as declared in the (sub)program from which E04GYF is called.
  • if N>1, LW8×N+2×N×N+2×M×N+3×M;
  • if N=1, LW11+5×M.
8:     IUSER(*) – INTEGER arrayUser Workspace
9:     RUSER(*) – REAL (KIND=nag_wp) arrayUser Workspace
IUSER and RUSER are not used by E04GYF, but are passed directly to LSFUN2 and may be used to pass information to this routine as an alternative to using COMMON global variables.
10:   IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, because for this routine the values of the output parameters may be useful even if IFAIL0 on exit, the recommended value is -1. When the value -1​ or ​1 is used it is essential to test the value of IFAIL on exit.
On exit: IFAIL=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6  Error Indicators and Warnings

If on entry IFAIL=0 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Note: E04GYF may return useful information for one or more of the following detected errors or warnings.
Errors or warnings detected by the routine:
On entry,N<1,
orLW<8×N+2×N×N+2×M×N+3×M, when N>1,
orLW<11+5×M, when N=1.
There have been 50×n calls of LSFUN2, yet the algorithm does not seem to have converged. This may be due to an awkward function or to a poor starting point, so it is worth restarting E04GYF from the final point held in X.
The final point does not satisfy the conditions for acceptance as a minimum, but no lower point could be found.
An auxiliary routine has been unable to complete a singular value decomposition in a reasonable number of sub-iterations.
There is some doubt about whether the point X found by E04GYF is a minimum of Fx. The degree of confidence in the result decreases as IFAIL increases. Thus, when IFAIL=5, it is probable that the final x gives a good estimate of the position of a minimum, but when IFAIL=8 it is very unlikely that the routine has found a minimum.
It is very likely that you have made an error in forming the derivatives fi xj  in LSFUN2.
If you are not satisfied with the result (e.g., because IFAIL lies between 3 and 8), it is worth restarting the calculations from a different starting point (not the point at which the failure occurred) in order to avoid the region which caused the failure. Repeated failure may indicate some defect in the formulation of the problem.

7  Accuracy

If the problem is reasonably well scaled and a successful exit is made then, for a computer with a mantissa of t decimals, one would expect to get t/2-1 decimals accuracy in the components of x and between t-1 (if Fx is of order 1 at the minimum) and 2t-2 (if Fx is close to zero at the minimum) decimals accuracy in Fx.

8  Further Comments

The number of iterations required depends on the number of variables, the number of residuals and their behaviour, and the distance of the starting point from the solution. The number of multiplications performed per iteration of E04GYF varies, but for mn is approximately n×m2+On3. In addition, each iteration makes at least one call of LSFUN2. So, unless the residuals and their derivatives can be evaluated very quickly, the run time will be dominated by the time spent in LSFUN2.
Ideally the problem should be scaled so that the minimum value of the sum of squares is in the range 0,1 and so that at points a unit distance away from the solution the sum of squares is approximately a unit value greater than at the minimum. It is unlikely that you will be able to follow these recommendations very closely, but it is worth trying (by guesswork), as sensible scaling will reduce the difficulty of the minimization problem, so that E04GYF will take less computer time.
When the sum of squares represents the goodness-of-fit of a nonlinear model to observed data, elements of the variance-covariance matrix of the estimated regression coefficients can be computed by a subsequent call to E04YCF, using information returned in segments of the workspace array W. See E04YCF for further details.

9  Example

This example finds the least squares estimates of x1, x2 and x3 in the model
using the 15 sets of data given in the following table.
y t1 t2 t3 0.14 1.0 15.0 1.0 0.18 2.0 14.0 2.0 0.22 3.0 13.0 3.0 0.25 4.0 12.0 4.0 0.29 5.0 11.0 5.0 0.32 6.0 10.0 6.0 0.35 7.0 9.0 7.0 0.39 8.0 8.0 8.0 0.37 9.0 7.0 7.0 0.58 10.0 6.0 6.0 0.73 11.0 5.0 5.0 0.96 12.0 4.0 4.0 1.34 13.0 3.0 3.0 2.10 14.0 2.0 2.0 4.39 15.0 1.0 1.0
The program uses 0.5,1.0,1.5 as the initial guess at the position of the minimum.

9.1  Program Text

Program Text (e04gyfe.f90)

9.2  Program Data

Program Data (e04gyfe.d)

9.3  Program Results

Program Results (e04gyfe.r)

E04GYF (PDF version)
E04 Chapter Contents
E04 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012