NLEQ2 - an algorithmic extension of NLEQ1 to handle rank-deficient Jacobians
This code covers the features of NLEQ1 and includes additionally a special rank reduction device.

Additional properties of NLEQ2 are:

• Rank reduction is done if the condition of the Jacobian exceeds a certain, internally set, maximum number (which may be also overwritten by the user - see above)
• Optional indirect rank-1 (Broyden) updates are also available.

These files are available from the CodeLib: the NLEQ2 tar-archive (use "load to disk") , and

• README file
• subroutine package NLEQ2
• sample calling program for NLEQ2
• sample monitor output of the above program
• sample data output of the above program
• easy to use subroutine NLEQ2E
• sample calling program for NLEQ2E
• sample monitor output of the above program

ANT - Introduction   Codes - Introduction  NLEQ1   NLEQ1S
NLEQ2                    GIANT                        References