Sequential congute gradient solver with ILU0 preconditioner.
More...
#include <dune/pdelab/backend/istl/seqistlsolverbackend.hh>
|
| ISTLBackend_SEQ_CG_ILUn (int n_, double w_=1.0, unsigned maxiter_=5000, int verbose_=1) |
| make a linear solver object More...
|
|
void | apply (M &A, V &z, W &r, typename Dune::template FieldTraits< typename W::ElementType >::real_type reduction) |
| solve the given linear system More...
|
|
template<class V > |
Dune::template FieldTraits< typenameV::ElementType >::real_type | norm (const V &v) const |
| compute global norm of a vector More...
|
|
const Dune::PDELab::LinearSolverResult< double > & | result () const |
| Return access to result data. More...
|
|
Sequential congute gradient solver with ILU0 preconditioner.
◆ ISTLBackend_SEQ_CG_ILUn()
Dune::PDELab::ISTLBackend_SEQ_CG_ILUn::ISTLBackend_SEQ_CG_ILUn |
( |
int |
n_, |
|
|
double |
w_ = 1.0 , |
|
|
unsigned |
maxiter_ = 5000 , |
|
|
int |
verbose_ = 1 |
|
) |
| |
|
inlineexplicit |
make a linear solver object
- Parameters
-
[in] | n_ | The number of levels to be used. |
[in] | w_ | The relaxation factor. |
[in] | maxiter_ | maximum number of iterations to do |
[in] | verbose_ | print messages if true |
◆ apply()
void Dune::PDELab::ISTLBackend_SEQ_ILUn< Dune::CGSolver >::apply |
( |
M & |
A, |
|
|
V & |
z, |
|
|
W & |
r, |
|
|
typename Dune::template FieldTraits< typename W::ElementType >::real_type |
reduction |
|
) |
| |
|
inlineinherited |
solve the given linear system
- Parameters
-
[in] | A | the given matrix |
[out] | z | the solution vector to be computed |
[in] | r | right hand side |
[in] | reduction | to be achieved |
◆ norm()
template<class V >
Dune::template FieldTraits< typenameV::ElementType >::real_type Dune::PDELab::SequentialNorm::norm |
( |
const V & |
v | ) |
const |
|
inlineinherited |
compute global norm of a vector
\param[in] v the given vector
◆ result()
Return access to result data.
◆ res
The documentation for this class was generated from the following file: