#include <LinSolver.hpp>
Inheritance diagram for IterativeLinSolver< T >:


Public Member Functions | |
| IterativeLinSolver (double the_reduction, unsigned the_max_iter, double the_abs_prec) | |
| The explicit constructor. | |
| IterativeLinSolver (SGParam *list) | |
| Constructor for reading the halting criteria from SG parameters. | |
Protected Attributes | |
| double | reduction |
| unsigned | max_iter |
| double | abs_prec |
This is the base class template for generic iterative solvers for large sparse linear systems. The only difference from LinSolver<T> is that this class has fields for storing the iteration parameters like the max. number of the iterations and the desired reduction. These parameters can be read form SG parameters using standard methods of this class.
| IterativeLinSolver< T >::IterativeLinSolver | ( | double | the_reduction, | |
| unsigned | the_max_iter, | |||
| double | the_abs_prec | |||
| ) | [inline] |
The explicit constructor.
| [in] | the_reduction | The desired reduction (0 to do 'max_iter' iter.) |
| [in] | the_max_iter | The maximum number of iterations |
| [in] | the_abs_prec | The minimum norm of the residual |
| IterativeLinSolver< T >::IterativeLinSolver | ( | SGParam * | list | ) | [inline] |
Constructor for reading the halting criteria from SG parameters.
The parameter names are:
| [in] | list | The list of the SG parameters |
double IterativeLinSolver< T >::reduction [protected] |
the desired reduction of the residual (0 to do 'max_iter' iter.)
unsigned IterativeLinSolver< T >::max_iter [protected] |
the maximum number of iterations to compute
double IterativeLinSolver< T >::abs_prec [protected] |
the minimum norm of the residual
1.5.2