43 #ifndef BICGSTAB_SOLVER_HPP
44 #define BICGSTAB_SOLVER_HPP 1
69 uint32_t _newton_imax;
76 double newton_Reps = 1.0e-5,
double newton_dXeps = 1.0e-6,
77 uint32_t newton_imax = 10,
bool gnewton =
false );
94 virtual void reset(
void );
117 _newton_imax = newton_imax;
123 _newton_Reps = newton_Reps;
129 _newton_dXeps = newton_dXeps;
~BiCGSTABSolver()
Destructor.
Definition: bicgstab_solver.hpp:81
void set_newton_imax(uint32_t newton_imax)
Sets maximum iteration count for Newton-Raphson steps.
Definition: bicgstab_solver.hpp:116
void set_newton_residual_eps(double newton_Reps)
Sets the accuracy request for Newton-Raphson residual.
Definition: bicgstab_solver.hpp:122
void set_eps(double eps)
Sets the accuracy request for BiCGSTAB solver.
Definition: bicgstab_solver.hpp:104
void set_newton_step_eps(double newton_dXeps)
Sets the accuracy request for Newton-Raphson step size.
Definition: bicgstab_solver.hpp:128
BiCGSTAB based solver implementation.
Definition: bicgstab_solver.hpp:62
Basis for matrix implementations.
Dense math vector class.
Definition: mvector.hpp:68
Abstract base class for linear/non-linear problem, which can be described by a non-linear system of e...
Definition: problem.hpp:54
BiCGSTABSolver(double eps=1.0e-6, uint32_t imax=10000, double newton_Reps=1.0e-5, double newton_dXeps=1.0e-6, uint32_t newton_imax=10, bool gnewton=false)
Constructor.
virtual void reset(void)
Reset solver.
void set_imax(uint32_t imax)
Sets maximum iteration count for BiCGSTAB solver.
Definition: bicgstab_solver.hpp:110
void set_gnewton(bool enable)
Enable/disable globally convergent Newton-Raphson.
Definition: bicgstab_solver.hpp:98
Abstract base class for solving linear and nonlinear problems. Different implementation may exist...
Definition: solver.hpp:57
virtual void solve(const Problem &p, Vector &X)
Solve problem p defined in geometry g. Initial guess and solution are in vector X.