43 #ifndef UMFPACK_SOLVER_HPP
44 #define UMFPACK_SOLVER_HPP 1
72 uint32_t _newton_imax;
74 static void umfpack_error(
const std::string func,
int status );
76 void umfpack_decompose(
const CColMatrix &mat );
78 bool force_decomposition =
false );
84 UMFPACKSolver(
double newton_Reps = 1.0e-5,
double newton_dXeps = 1.0e-6,
85 uint32_t newton_imax = 10 );
102 virtual void reset(
void );
107 _newton_imax = newton_imax;
113 _newton_Reps = newton_Reps;
119 _newton_dXeps = newton_dXeps;
virtual void reset(void)
Reset solver.
Basis for matrix implementations.
Dense math vector class.
Definition: mvector.hpp:68
UMFPACK based solver implementation.
Definition: umfpack_solver.hpp:66
Abstract base class for linear/non-linear problem, which can be described by a non-linear system of e...
Definition: problem.hpp:54
~UMFPACKSolver()
Destructor.
void set_newton_residual_eps(double newton_Reps)
Sets the accuracy request for Newton-Raphson residual.
Definition: umfpack_solver.hpp:112
UMFPACKSolver(double newton_Reps=1.0e-5, double newton_dXeps=1.0e-6, uint32_t newton_imax=10)
Constructor.
void set_newton_imax(uint32_t newton_imax)
Sets maximum iteration count for Newton-Raphson steps.
Definition: umfpack_solver.hpp:106
virtual void solve(const Problem &p, Vector &X)
Solve problem p defined in geometry g. Initial guess and solution are in vector X.
Abstract base class for solving linear and nonlinear problems. Different implementation may exist...
Definition: solver.hpp:57
void set_newton_step_eps(double newton_dXeps)
Sets the accuracy request for Newton-Raphson step size.
Definition: umfpack_solver.hpp:118
Compressed column sparse matrix algebra.
Compressed column sparse matrix class.
Definition: ccolmatrix.hpp:75