Affin-invariant Newton Techniques (ANT) - GIANT
GIANT - the implementation of the Inexact Newton Techniques.
This code is designed for solving a nonlinear system of a very large dimension. The Jacobian may not be explicitly hold in the storage, since the iterative linear solver, which is used to solve the arising linear systems, makes no explicit reference to it, but only to a subroutine which has to compute the product Jac*X for a given input vector X, and to a preconditioner subroutine.
Included in the GIANT package is an interface to the sparse matrix multiplication and preconditioner routines of the SLAP-package (Sparse Linear Algebra Package) and three sample calling program for different cases of usage.
These files are available from the CodeLib: the GIANT tar-archive (use "load to disk") , and
- README file
- subroutine GIANT
- EASYPACK: Interface package to SLAP and selected SLAP routines
- subroutine GMRES
- Sample program 1 to call GIANT with GBIT and SLAP-Interface
- Output of sample program 1
- Sample program 2 to call GIANT using a matrix-free method (without SLAP-Interface)
- Output of sample program 2
- Sample program 3 to call GIANT with GMRES and SLAP-Interface
- Output of sample program 3
ANT - Introduction Codes - Introduction NLEQ1 NLEQ1S
NLEQ2 GIANT References
