#include <dune/pdelab/newton/newton.hh>
template<class GOS , class S , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
Enumerator |
---|
noLineSearch |
don't do any linesearch or damping
|
hackbuschReusken |
perform a linear search for the optimal damping parameter with multiples of damping
the strategy was described in [Hackbusch and Reusken, 1989]
|
hackbuschReuskenAcceptBest |
same as hackbuschReusken, but doesn't fail if the best update is still not good enough
|
template<class GOS , class S , class TrlV , class TstV = TrlV>
template<class GOS , class S , class TrlV , class TstV = TrlV>
template<class GOS , class S , class TrlV , class TstV >
template<class GOS , class S , class TrlV , class TstV >
template<class GOS , class S , class TrlV , class TstV >
|
inlineprotectedvirtualinherited |
template<class GOS , class TrlV , class TstV >
Discard the stored Jacobian matrix.
template<class GOS , class TrlV , class TstV >
Return whether the jacobian matrix is kept across calls to apply().
template<class GOS , class TrlV , class TstV >
|
protectedpure virtualinherited |
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
|
protectedpure virtualinherited |
template<class GOS , class TrlV , class TstV >
template<class GOS , class S , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
set a fixed reduction in the linear solver (overwrites setMinLinearReduction)
- Note
- with fixed_linear_reduction > 0, the linear reduction rate will always be fixed to min_linear_reduction.
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
Set whether the jacobian matrix should be kept across calls to apply().
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
set the minimal reduction in the linear solver
- Note
- with min_linear_reduction > 0, the linear reduction will be determined as mininum of the min_linear_reduction and the linear_reduction needed to achieve second order Newton convergence.
template<class GOS , class S , class TrlV , class TstV = TrlV>
interpret a parameter tree as a set of options for the newton solver
example configuration:
[NewtonParameters]
ReassembleThreshold = 0.1
LineSearchMaxIterations = 10
MaxIterations = 7
AbsoluteLimit = 1e-6
Reduction = 1e-4
LinearReduction = 1e-3
LineSearchDamping = 0.9
and invocation in the code:
newton.setParameters(param.sub("NewtonParameters"));
template<class GOS , class TrlV , class TstV >
set a threshold, when the linear operator is reassembled
We allow to keep the linear operator over several newton iterations. If the reduction in the newton drops below a given threshold the linear operator is reassembled to ensure convergence.
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
helper function to get the different strategies from their name
template<class GOS , class TrlV , class TstV >
|
protectedpure virtualinherited |
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
template<class GOS , class TrlV , class TstV >
The documentation for this class was generated from the following file: