C05QCF (PDF version)
C05 Chapter Contents
C05 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

C05QCF is a comprehensive routine that finds a solution of a system of nonlinear equations by a modification of the Powell hybrid method.

2  Specification


3  Description

The system of equations is defined as:
fi x1,x2,,xn = 0 ,   ​ i= 1, 2, , n .
C05QCF is based on the MINPACK routine HYBRD (see Moré et al. (1980)). It chooses the correction at each step as a convex combination of the Newton and scaled gradient directions. The Jacobian is updated by the rank-1 method of Broyden. At the starting point, the Jacobian is approximated by forward differences, but these are not used again until the rank-1 method fails to produce satisfactory progress. For more details see Powell (1970).

4  References

Moré J J, Garbow B S and Hillstrom K E (1980) User guide for MINPACK-1 Technical Report ANL-80-74 Argonne National Laboratory
Powell M J D (1970) A hybrid method for nonlinear algebraic equations Numerical Methods for Nonlinear Algebraic Equations (ed P Rabinowitz) Gordon and Breach

5  Parameters

1:     FCN – SUBROUTINE, supplied by the user.External Procedure
FCN must return the values of the functions fi  at a point x, unless IFLAG=0 on entry to C05QCF.
The specification of FCN is:
REAL (KIND=nag_wp)  X(N), FVEC(N), RUSER(*)
1:     N – INTEGERInput
On entry: n, the number of equations.
2:     X(N) – REAL (KIND=nag_wp) arrayInput
On entry: the components of the point x at which the functions must be evaluated.
3:     FVEC(N) – REAL (KIND=nag_wp) arrayInput/Output
On entry: if IFLAG=0 , FVEC contains the function values fix  and must not be changed.
On exit: if IFLAG>0  on entry, FVEC must contain the function values fix  (unless IFLAG is set to a negative value by FCN).
4:     IUSER(*) – INTEGER arrayUser Workspace
5:     RUSER(*) – REAL (KIND=nag_wp) arrayUser Workspace
FCN is called with the parameters IUSER and RUSER as supplied to C05QCF. You are free to use the arrays IUSER and RUSER to supply information to FCN as an alternative to using COMMON global variables.
6:     IFLAG – INTEGERInput/Output
On entry: IFLAG0 .
X and FVEC are available for printing (see NPRINT).
FVEC must be updated.
On exit: in general, IFLAG should not be reset by FCN. If, however, you wish to terminate execution (perhaps because some illegal point X has been reached), then IFLAG should be set to a negative integer.
FCN must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which C05QCF is called. Parameters denoted as Input must not be changed by this procedure.
2:     N – INTEGERInput
On entry: n, the number of equations.
Constraint: N>0 .
3:     X(N) – REAL (KIND=nag_wp) arrayInput/Output
On entry: an initial guess at the solution vector.
On exit: the final estimate of the solution vector.
4:     FVEC(N) – REAL (KIND=nag_wp) arrayOutput
On exit: the function values at the final point returned in X.
5:     XTOL – REAL (KIND=nag_wp)Input
On entry: the accuracy in X to which the solution is required.
Suggested value: ε, where ε is the machine precision returned by X02AJF.
Constraint: XTOL0.0 .
6:     MAXFEV – INTEGERInput
On entry: the maximum number of calls to FCN with IFLAG0 . C05QCF will exit with IFAIL=2, if, at the end of an iteration, the number of calls to FCN exceeds MAXFEV.
Suggested value: MAXFEV=200×N+1 .
Constraint: MAXFEV>0 .
7:     ML – INTEGERInput
On entry: the number of subdiagonals within the band of the Jacobian matrix. (If the Jacobian is not banded, or you are unsure, set ML=N-1 .)
Constraint: ML0 .
8:     MU – INTEGERInput
On entry: the number of superdiagonals within the band of the Jacobian matrix. (If the Jacobian is not banded, or you are unsure, set MU=N-1 .)
Constraint: MU0 .
9:     EPSFCN – REAL (KIND=nag_wp)Input
On entry: a rough estimate of the largest relative error in the functions. It is used in determining a suitable step for a forward difference approximation to the Jacobian. If EPSFCN is less than machine precision (returned by X02AJF) then machine precision is used. Consequently a value of 0.0 will often be suitable.
Suggested value: EPSFCN=0.0 .
10:   MODE – INTEGERInput
On entry: indicates whether or not you have provided scaling factors in DIAG.
If MODE=2 the scaling must have been specified in DIAG.
Otherwise, if MODE=1, the variables will be scaled internally.
Constraint: MODE=1 or 2.
11:   DIAG(N) – REAL (KIND=nag_wp) arrayInput/Output
On entry: if MODE=2, DIAG must contain multiplicative scale factors for the variables.
If MODE=1, DIAG need not be set.
Constraint: if MODE=2, DIAGi>0.0 , for i=1,2,,n.
On exit: the scale factors actually used (computed internally if MODE=1).
12:   FACTOR – REAL (KIND=nag_wp)Input
On entry: a quantity to be used in determining the initial step bound. In most cases, FACTOR should lie between 0.1 and 100.0. (The step bound is FACTOR×DIAG×X2  if this is nonzero; otherwise the bound is FACTOR.)
Suggested value: FACTOR=100.0 .
Constraint: FACTOR>0.0 .
On entry: indicates whether (and how often) special calls to FCN, with IFLAG set to 0, are to be made for printing purposes.
No calls are made.
FCN is called at the beginning of the first iteration, every NPRINT iterations thereafter and immediately before the return from C05QCF.
14:   NFEV – INTEGEROutput
On exit: the number of calls made to FCN with IFLAG>0.
15:   FJAC(N,N) – REAL (KIND=nag_wp) arrayOutput
On exit: the orthogonal matrix Q produced by the QR  factorisation of the final approximate Jacobian.
16:   R(N×N+1/2) – REAL (KIND=nag_wp) arrayOutput
On exit: the upper triangular matrix R produced by the QR  factorization of the final approximate Jacobian, stored row-wise.
17:   QTF(N) – REAL (KIND=nag_wp) arrayOutput
On exit: the vector QTf .
18:   IUSER(*) – INTEGER arrayUser Workspace
19:   RUSER(*) – REAL (KIND=nag_wp) arrayUser Workspace
IUSER and RUSER are not used by C05QCF, but are passed directly to FCN and may be used to pass information to this routine as an alternative to using COMMON global variables.
20:   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, if you are not familiar with this parameter, the recommended value is 0. 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).
Errors or warnings detected by the routine:
There have been at least MAXFEV evaluations of FCN. Consider restarting the calculation from the final point held in X.
No further improvement in the approximate solution X is possible; XTOL is too small.
The iteration is not making good progress, as measured by the improvement from the last five Jacobian evaluations.
The iteration is not making good progress, as measured by the improvement from the last ten iterations.
You have set IFLAG negative in FCN.
On entry, N0.
On entry, XTOL<0.0.
On entry, MODE1 or 2.
On entry, FACTOR0.0.
On entry, MODE=2 and DIAGi0.0 for some i, for i=1,2,,N.
On entry, ML<0.
On entry, MU<0.
On entry, MAXFEV0.
Internal memory allocation failed.
A value of IFAIL=4 or 5 may indicate that the system does not have a zero, or that the solution is very close to the origin (see Section 7). Otherwise, rerunning C05QCF from a different starting point may avoid the region of difficulty.

7  Accuracy

If x^  is the true solution and D denotes the diagonal matrix whose entries are defined by the array DIAG, then C05QCF tries to ensure that
D x-x^ 2 XTOL × D x^ 2 .
If this condition is satisfied with XTOL = 10-k , then the larger components of Dx  have k significant decimal digits. There is a danger that the smaller components of Dx  may have large relative errors, but the fast rate of convergence of C05QCF usually obviates this possibility.
If XTOL is less than machine precision and the above test is satisfied with the machine precision in place of XTOL, then the routine exits with IFAIL=3.
Note:  this convergence test is based purely on relative error, and may not indicate convergence if the solution is very close to the origin.
The convergence test assumes that the functions are reasonably well behaved. If this condition is not satisfied, then C05QCF may incorrectly indicate convergence. The validity of the answer can be checked, for example, by rerunning C05QCF with a lower value for XTOL.

8  Further Comments

Local workspace arrays of fixed lengths are allocated internally by C05QCF. The total size of these arrays amounts to 4×n real elements.
The time required by C05QCF to solve a given problem depends on n, the behaviour of the functions, the accuracy requested and the starting point. The number of arithmetic operations executed by C05QCF to process each evaluation of the functions is approximately 11.5×n2 . The timing of C05QCF is strongly influenced by the time spent evaluating the functions.
Ideally the problem should be scaled so that, at the solution, the function values are of comparable magnitude.
The number of function evaluations required to evaluate the Jacobian may be reduced if you can specify ML and MU accurately.

9  Example

This example determines the values x1 , , x9  which satisfy the tridiagonal equations:
3-2x1x1-2x2 = -1, -xi-1+3-2xixi-2xi+1 = -1,  i=2,3,,8 -x8+3-2x9x9 = -1.

9.1  Program Text

Program Text (c05qcfe.f90)

9.2  Program Data


9.3  Program Results

Program Results (c05qcfe.r)

C05QCF (PDF version)
C05 Chapter Contents
C05 Chapter Introduction
NAG Library Manual

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