#include <dune/pdelab/newton/newton.hh>
◆ Result
template<class GOS , class S , class TrlV , class TstV >
◆ Strategy
template<class GOS , class TrlV , class TstV >
Enumerator |
---|
noLineSearch | don't do any line search 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
|
◆ Newton() [1/2]
template<class GOS , class S , class TrlV , class TstV = TrlV>
◆ Newton() [2/2]
template<class GOS , class S , class TrlV , class TstV = TrlV>
◆ apply() [1/2]
template<class GOS , class S , class TrlV , class TstV >
◆ apply() [2/2]
template<class GOS , class S , class TrlV , class TstV >
◆ defect()
template<class GOS , class S , class TrlV , class TstV >
|
inlineoverrideprotectedvirtualinherited |
◆ discardMatrix()
template<class GOS , class TrlV , class TstV >
Discard the stored Jacobian matrix.
◆ keepMatrix()
template<class GOS , class TrlV , class TstV >
Return whether the jacobian matrix is kept across calls to apply().
◆ line_search() [1/2]
template<class GOS , class TrlV , class TstV >
|
protectedpure virtualinherited |
◆ line_search() [2/2]
template<class GOS , class TrlV , class TstV >
|
inlineoverridevirtualinherited |
◆ prepare_step() [1/2]
template<class GOS , class TrlV , class TstV >
|
protectedpure virtualinherited |
◆ prepare_step() [2/2]
template<class GOS , class TrlV , class TstV >
|
inlineoverridevirtualinherited |
◆ result()
template<class GOS , class S , class TrlV , class TstV >
◆ setAbsoluteLimit()
template<class GOS , class TrlV , class TstV >
◆ setFixedLinearReduction()
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.
◆ setForceIteration()
template<class GOS , class TrlV , class TstV >
◆ setKeepMatrix()
template<class GOS , class TrlV , class TstV >
Set whether the jacobian matrix should be kept across calls to apply().
◆ setLineSearchDampingFactor()
template<class GOS , class TrlV , class TstV >
◆ setLineSearchMaxIterations()
template<class GOS , class TrlV , class TstV >
◆ setLineSearchStrategy() [1/2]
template<class GOS , class TrlV , class TstV >
◆ setLineSearchStrategy() [2/2]
template<class GOS , class TrlV , class TstV >
◆ setMaxIterations()
template<class GOS , class TrlV , class TstV >
◆ setMinLinearReduction()
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.
◆ setParameters()
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
MinLinearReduction = 1e-3
LineSearchDamping = 0.9
and invocation in the code:
newton.setParameters(param.sub("NewtonParameters"));
◆ setReassembleThreshold()
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.
◆ setReduction()
template<class GOS , class TrlV , class TstV >
◆ setVerbosityLevel()
template<class GOS , class TrlV , class TstV >
◆ strategyFromName()
template<class GOS , class TrlV , class TstV >
helper function to get the different strategies from their name
◆ terminate() [1/2]
template<class GOS , class TrlV , class TstV >
|
protectedpure virtualinherited |
◆ terminate() [2/2]
template<class GOS , class TrlV , class TstV >
|
inlineoverridevirtualinherited |
◆ A_
template<class GOS , class TrlV , class TstV >
◆ abs_limit_
template<class GOS , class TrlV , class TstV >
◆ gridoperator_
template<class GOS , class TrlV , class TstV >
◆ keep_matrix_
template<class GOS , class TrlV , class TstV >
◆ linear_reduction_
template<class GOS , class TrlV , class TstV >
◆ prev_defect_
template<class GOS , class TrlV , class TstV >
◆ r_
template<class GOS , class TrlV , class TstV >
◆ reassembled_
template<class GOS , class TrlV , class TstV >
◆ reduction_
template<class GOS , class TrlV , class TstV >
◆ res_
template<class GOS , class TrlV , class TstV >
◆ u_
template<class GOS , class TrlV , class TstV >
◆ verbosity_level_
template<class GOS , class TrlV , class TstV >
◆ z_
template<class GOS , class TrlV , class TstV >
The documentation for this class was generated from the following file: