e04gzf (PDF version)

E04 (opt) Chapter Contents

E04 (opt) Chapter Introduction

NAG Library ManualKeyword Search:

NAG Library Routine Document

e04gzf (lsq_uncon_mod_deriv_easy)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

▸▿ 10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

e04gzf is an easy-to-use modified Gauss–Newton algorithm for finding an unconstrained minimum of a sum of squares of

m

nonlinear functions in

n

variables

(m \geq n)

. 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

Fortran Interface

Subroutine e04gzf (

m, n, lsfun2, x, fsumsq, w, lw, iuser, ruser, ifail)

Integer, Intent (In)	::	m, n, lw
Integer, Intent (Inout)	::	iuser(*), ifail
Real (Kind=nag_wp), Intent (Inout)	::	x(n), ruser(*)
Real (Kind=nag_wp), Intent (Out)	::	fsumsq, w(lw)
External	::	lsfun2

C Header Interface

#include nagmk26.h

void

e04gzf_ ( const Integer *m, const Integer *n,
void (NAG_CALL *lsfun2)( const Integer *m, const Integer *n, const double xc[], double fvec[], double fjac[], const Integer *ldfjac, Integer iuser[], double ruser[]),
double x[], double *fsumsq, double w[], const Integer *lw, Integer iuser[], double ruser[], Integer *ifail)

3

Description

e04gzf is similar to the subroutine LSFDN2 in the NPL Algorithms Library. It is applicable to problems of the form

Minimize F (x) = \sum_{i = 1}^{m} {[f_{i} (x)]}^{2}

where

x = {(x_{1}, x_{2}, \dots, x_{n})}^{T}

and

m \geq n

. (The functions

f_{i} (x)

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

F (x)

.

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

Arguments

1: $m$ – IntegerInput

2: $n$ – IntegerInput

On entry: the number

m

of residuals,

f_{i} (x)

, and the number

n

of variables,

x_{j}

.

Constraint:

1 \leq n \leq m

.

3: $lsfun2$ – Subroutine, supplied by the user.External Procedure

You must supply this routine to calculate the vector of values

f_{i} (x)

and the Jacobian matrix of first derivatives

\frac{\partial f_{i}}{\partial x_{j}}

at any point

x

. It should be tested separately before being used in conjunction with e04gzf.

The specification of lsfun2 is:

Fortran Interface

Subroutine lsfun2 (

m, n, xc, fvec, fjac, ldfjac, iuser, ruser)

Integer, Intent (In)	::	m, n, ldfjac
Integer, Intent (Inout)	::	iuser(*)
Real (Kind=nag_wp), Intent (In)	::	xc(n)
Real (Kind=nag_wp), Intent (Inout)	::	fjac(ldfjac,n), ruser(*)
Real (Kind=nag_wp), Intent (Out)	::	fvec(m)

C Header Interface

#include nagmk26.h

void	lsfun2 ( const Integer m, const Integer n, const double xc[], double fvec[], double fjac[], const Integer *ldfjac, Integer iuser[], double ruser[])

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 $f_{i}$ and the $\frac{\partial f_{i}}{\partial x_{j}}$ are required.
4: $fvec (m)$ – Real (Kind=nag_wp) arrayOutput: On exit: $fvec (i)$ must be set to the value of $f_{i}$ at the point $x$ , for $i = 1, 2, \dots, m$ .
5: $fjac (ldfjac, n)$ – Real (Kind=nag_wp) arrayOutput: On exit: $fjac (i, j)$ must be set to the value of $\frac{\partial f_{i}}{\partial x_{j}}$ at the point $x$ , for $i = 1, 2, \dots, m$ and $j = 1, 2, \dots, n$ .
6: $ldfjac$ – IntegerInput: On entry: the first dimension of the array fjac, set to $m$ by e04gzf.
7: $iuser (*)$ – Integer arrayUser Workspace
8: $ruser (*)$ – Real (Kind=nag_wp) arrayUser Workspace: lsfun2 is called with the arguments iuser and ruser as supplied to e04gzf. You should use the arrays iuser and ruser to supply information to lsfun2.

lsfun2 must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which e04gzf is called. Arguments denoted as Input must not be changed by this procedure.

Note: lsfun2 should not return floating-point NaN (Not a Number) or infinity values, since these are not handled by e04gzf. If your code inadvertently does return any NaNs or infinities, e04gzf is likely to produce unexpected results.

4: $x (n)$ – Real (Kind=nag_wp) arrayInput/Output

On entry:

x (j)

must be set to a guess at the

j

th component of the position of the minimum, for

j = 1, 2, \dots, n

. The routine checks the first derivatives calculated by lsfun2 at the starting point and so is more likely to detect any error in your routines if the initial

x (j)

are nonzero and mutually distinct.

On exit: the lowest point found during the calculations. Thus, if

ifail = 0

on exit,

x (j)

is the

j

th component of the position of the minimum.

5: $fsumsq$ – Real (Kind=nag_wp)Output

On exit: the value of the sum of squares,

F (x)

, corresponding to the final point stored in x.

6: $w (lw)$ – Real (Kind=nag_wp) arrayCommunication Array

7: $lw$ – IntegerInput

On entry: the dimension of the array w as declared in the (sub)program from which e04gzf is called.

Constraints:

if $n > 1$ , $lw \geq 8 \times n + 2 \times n \times n + 2 \times m \times n + 3 \times m$ ;
if $n = 1$ , $lw \geq 11 + 5 \times m$ .

8: $iuser (*)$ – Integer arrayUser Workspace

9: $ruser (*)$ – Real (Kind=nag_wp) arrayUser Workspace

iuser and ruser are not used by e04gzf, but are passed directly to lsfun2 and may be used to pass information to this routine.

10: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

,

- 1 ​ or ​ 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation 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 arguments may be useful even if

ifail \neq 0

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: e04gzf may return useful information for one or more of the following detected errors or warnings.

Errors or warnings detected by the routine:

$ifail = 1$

On entry,	$n < 1$ ,
or	$m < n$ ,
or	$lw < 8 \times n + 2 \times n \times n + 2 \times m \times n + 3 \times m$ , when $n > 1$ ,
or	$lw < 11 + 5 \times m$ , when $n = 1$ .

$ifail = 2$: There have been $50 \times 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 e04gzf from the final point held in x.

$ifail = 3$: The final point does not satisfy the conditions for acceptance as a minimum, but no lower point could be found.

$ifail = 4$: An auxiliary routine has been unable to complete a singular value decomposition in a reasonable number of sub-iterations.

$ifail = 5$
$ifail = 6$
$ifail = 7$
$ifail = 8$: There is some doubt about whether the point x $x$ found by e04gzf is a minimum of $F (x)$ . 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.

$ifail = 9$: It is very likely that you have made an error in forming the derivatives $\frac{\partial f_{i}}{\partial x_{j}}$ in lsfun2.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

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 about

t / 2 - 1

decimals accuracy in the components of

x

and between

t - 1

(if

F (x)

is of order

1

at the minimum) and

2 t - 2

(if

F (x)

is close to zero at the minimum) decimals accuracy in

F (x)

.

8

Parallelism and Performance

e04gzf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

e04gzf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

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 e04gzf varies, but for

m ≫ n

is approximately

n \times m^{2} + O (n^{3})

. 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 e04gzf 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.

10

Example

This example finds least squares estimates of

x_{1}

,

x_{2}

and

x_{3}

in the model

y = x_{1} + \frac{t_{1}}{x_{2} t_{2} + x_{3} t_{3}}

using the

15

sets of data given in the following table.

\begin{array}{r} y & t_{1} & t_{2} & t_{3} \\ 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 \end{array}

The program uses

(0.5, 1.0, 1.5)

as the initial guess at the position of the minimum.

10.1

Program Text

Program Text (e04gzfe.f90)

10.2

Program Data

Program Data (e04gzfe.d)

10.3

Program Results

Program Results (e04gzfe.r)

e04gzf (PDF version)

E04 (opt) Chapter Contents

E04 (opt) Chapter Introduction

NAG Library Manual

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