LifeV
|
Preconditioned relaxed solver for non linear problems. More...
#include <algorithm>
#include <lifev/core/algorithm/NonLinearLineSearch.hpp>
#include <lifev/core/array/VectorEpetra.hpp>
Go to the source code of this file.
Namespaces | |
LifeV | |
Default Physical Solver. | |
Functions | |
template<class Fct > | |
Int | NonLinearRichardson (VectorEpetra &sol, Fct &functional, Real abstol, Real reltol, UInt &maxit, Real eta_max, Int NonLinearLineSearch, UInt iter=UInt(0), UInt verboseLevel=0, std::ostream &output=std::cout, const Real &time=0) |
Preconditioned relaxed solver for non linear problems. More... | |
Preconditioned relaxed solver for non linear problems.
Given a functional this method tries to find a root near an initial guess sol. The two methods that the functional must have are evalRes and solveJac. If solveJac inverts the exact Jacobian of the functional, than this is equivalent to a Newton method. If convergence do not appens in the expected ratio, a NonLinearLineSearch algorithm is called (uadratic or parabolic).
Definition in file NonLinearRichardson.hpp.