[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

32. Multidimensional Root-Finding

This chapter describes functions for multidimensional root-finding (solving nonlinear systems with n equations in n unknowns). The library provides low level components for a variety of iterative solvers and convergence tests. These can be combined by the user to achieve the desired solution, with full access to the intermediate steps of the iteration. Each class of methods uses the same framework, so that you can switch between solvers at runtime without needing to recompile your program. Each instance of a solver keeps track of its own state, allowing the solvers to be used in multi-threaded programs. The solvers are based on the original Fortran library MINPACK.

The header file `gsl_multiroots.h' contains prototypes for the multidimensional root finding functions and related declarations.

32.1 Overview  
32.2 Initializing the Solver  
32.3 Providing the function to solve  
32.4 Iteration  
32.5 Search Stopping Parameters  
32.6 Algorithms using Derivatives  
32.7 Algorithms without Derivatives  
32.8 Examples  
32.9 References and Further Reading  



This document was generated by Michael Stenner on February, 14 2002 using texi2html