e04hy 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 mn. First and second 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).


public static void e04hy(
	int m,
	int n,
	E04..::..E04HY_LSFUN2 lsfun2,
	E04..::..E04HY_LSHES2 lshes2,
	double[] x,
	out double fsumsq,
	out int ifail
Visual Basic
Public Shared Sub e04hy ( _
	m As Integer, _
	n As Integer, _
	lsfun2 As E04..::..E04HY_LSFUN2, _
	lshes2 As E04..::..E04HY_LSHES2, _
	x As Double(), _
	<OutAttribute> ByRef fsumsq As Double, _
	<OutAttribute> ByRef ifail As Integer _
Visual C++
static void e04hy(
	int m, 
	int n, 
	E04..::..E04HY_LSFUN2^ lsfun2, 
	E04..::..E04HY_LSHES2^ lshes2, 
	array<double>^ x, 
	[OutAttribute] double% fsumsq, 
	[OutAttribute] int% ifail
static member e04hy : 
        m : int * 
        n : int * 
        lsfun2 : E04..::..E04HY_LSFUN2 * 
        lshes2 : E04..::..E04HY_LSHES2 * 
        x : float[] * 
        fsumsq : float byref * 
        ifail : int byref -> unit 


Type: System..::..Int32
On entry: the number m of residuals, fix, and the number n of variables, xj.
Constraint: 1nm.
Type: System..::..Int32
On entry: the number m of residuals, fix, and the number n of variables, xj.
Constraint: 1nm.
Type: NagLibrary..::..E04..::..E04HY_LSFUN2
You must supply this method to calculate the vector of values fix and the Jacobian matrix of first derivatives fixj at any point x. It should be tested separately before being used in conjunction with e04hy (see the E04 class).

A delegate of type E04HY_LSFUN2.

Type: NagLibrary..::..E04..::..E04HY_LSHES2
You must supply this method to calculate the elements of the symmetric matrix
at any point x, where Gix is the Hessian matrix of fix. It should be tested separately before being used in conjunction with e04hy (see the E04 class).

A delegate of type E04HY_LSHES2.

Type: array<System..::..Double>[]()[][]
An array of size [n]
On entry: x[j-1] must be set to a guess at the jth component of the position of the minimum, for j=1,2,,n. The method checks lsfun2 and lshes2 at the starting point and so is more likely to detect any error in your methods if the initial x[j-1] are nonzero and mutually distinct.
On exit: the lowest point found during the calculations. Thus, if ifail=0 on exit, x[j-1] is the jth component of the position of the minimum.
Type: System..::..Double%
On exit: the value of the sum of squares, Fx, corresponding to the final point stored in x.
Type: System..::..Int32%
On exit: ifail=0 unless the method detects an error or a warning has been flagged (see [Error Indicators and Warnings]).


e04hy is similar to the method LSSDN2 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 method to evaluate the residuals and their first derivatives at any point x, and a method to evaluate the elements of the second derivative term of the Hessian matrix of Fx.
Before attempting to minimize the sum of squares, the algorithm checks the user-supplied delegates 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.


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

Error Indicators and Warnings

Note: e04hy may return useful information for one or more of the following detected errors or warnings.
Errors or warnings detected by the method:
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 e04hy 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 method has been unable to complete a singular value decomposition in a reasonable number of sub-iterations.
There is some doubt about whether the point xx found by e04hy 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 method has found a minimum.
It is very likely that you have made an error in forming the derivatives fixj in lsfun2.
It is very likely that you have made an error in forming the quantities Bjk in lshes2.
An error occured, see message report.
Invalid Parameters value
Negative dimension for array value
Invalid Parameters value
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.


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 Fx is of order 1 at the minimum) and 2t-2 (if Fx is close to zero at the minimum) decimals accuracy in Fx.

Parallelism and Performance


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 e04hy varies, but for mn is approximately n×m2+On3. In addition, each iteration makes at least one call of lsfun2 and some iterations may call lshes2. So, unless the residuals and their derivatives can be evaluated very quickly, the run time will be dominated by the time spent in lsfun2 (and, to a lesser extent, in lshes2).
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 e04hy 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 not in this release), using information returned in segments of the workspace array w. See (E04YCF not in this release) for further details.


This example finds least squares estimates of x1, x2 and x3 in the model
using the 15 sets of data given in the following table.
The program uses 0.5,1.0,1.5 as the initial guess at the position of the minimum.

Example program (C#): e04hye.cs

Example program data: e04hye.d

Example program results: e04hye.r

See Also