 |
8.1
general documentation
|
|
|
8.1
general documentation
|
|
Structure to handle the convergence of an iterative algorithm. More...
#include <cs_iter_algo.h>
Collaboration diagram for cs_iter_algo_t:Data Fields | |
| cs_iter_algo_type_t | type |
| cs_param_sles_cvg_t | cvg_param |
| int | verbosity |
| void * | context |
Structure to handle the convergence of an iterative algorithm.
Metadata to manage an iterative algorithm such as Picard or Uzawa for instance. This structure can handle a two-level (i.e. outer/inner) iterative algorithm since the notion of inner and outer iterations is defined. Nevertheless, only the outer iterative algorithm is managed (information about inner iterations are only for monitoring purposes).
| context |
pointer to structure cast on the fly
| cvg_param |
structure storing the main settings
| type |
Type of iterative algorithm to consider. Useful to cast on-the-fly the context structure
| verbosity |
Level of printed information
1.9.1