A linear solver based on the ISTL AMG preconditioner and the ISTL BiCGSTAB solver.
More...
#include <dumux/linear/amgbackend.hh>
A linear solver based on the ISTL AMG preconditioner and the ISTL BiCGSTAB solver.
|
| | AMGBiCGSTABBackend (const std::string ¶mGroup="") |
| | Construct the backend for the sequential case only.
|
| | AMGBiCGSTABBackend (const typename LinearSolverTraits::GridView &gridView, const typename LinearSolverTraits::DofMapper &dofMapper, const std::string ¶mGroup="") |
| | Construct the backend for parallel or sequential runs.
|
| template<class Matrix, class Vector> |
| bool | solve (Matrix &A, Vector &x, Vector &b) |
| | Solve a linear system.
|
| void | reset () |
| | reset the linear solver
|
| std::string | name () const |
| | The name of the solver.
|
| const Dune::InverseOperatorResult & | result () const |
| | The result containing the convergence history.
|
| template<class Matrix, class Vector> |
| bool | solve (const Matrix &A, Vector &x, const Vector &b) |
| | Solve the linear system Ax = b.
|
| const std::string & | paramGroup () const |
| | the parameter group for getting parameter from the parameter tree
|
| int | verbosity () const |
| | the verbosity level
|
| void | setVerbosity (int v) |
| | set the verbosity level
|
| int | maxIter () const |
| | the maximum number of linear solver iterations
|
| void | setMaxIter (int i) |
| | set the maximum number of linear solver iterations
|
| double | residReduction () const |
| | the linear solver residual reduction
|
| void | setResidualReduction (double r) |
| | set the linear solver residual reduction
|
| double | relaxation () const |
| | the linear solver relaxation factor
|
| void | setRelaxation (double r) |
| | set the linear solver relaxation factor
|
| int | precondIter () const |
| | the number of preconditioner iterations
|
| void | setPrecondIter (int i) |
| | set the number of preconditioner iterations
|
| int | precondVerbosity () const |
| | the preconditioner verbosity
|
| void | setPrecondVerbosity (int verbosityLevel) |
| | set the preconditioner verbosity
|
◆ Scalar
export Scalar type (might be needed to set parameters from output) TODO: Do we need this?
◆ AMGBiCGSTABBackend() [1/2]
Construct the backend for the sequential case only.
- Parameters
-
| paramGroup | the parameter group for parameter lookup |
◆ AMGBiCGSTABBackend() [2/2]
| Dumux::AMGBiCGSTABBackend< LinearSolverTraits >::AMGBiCGSTABBackend |
( |
const typename LinearSolverTraits::GridView & | gridView, |
|
|
const typename LinearSolverTraits::DofMapper & | dofMapper, |
|
|
const std::string & | paramGroup = "" ) |
|
inline |
Construct the backend for parallel or sequential runs.
- Parameters
-
| gridView | the grid view on which we are performing the multi-grid |
| dofMapper | an index mapper for dof entities |
| paramGroup | the parameter group for parameter lookup |
◆ maxIter()
| int Dumux::LinearSolver::maxIter |
( |
| ) |
const |
|
inlineinherited |
the maximum number of linear solver iterations
◆ name()
◆ paramGroup()
| const std::string & Dumux::LinearSolver::paramGroup |
( |
| ) |
const |
|
inlineinherited |
the parameter group for getting parameter from the parameter tree
◆ precondIter()
| int Dumux::LinearSolver::precondIter |
( |
| ) |
const |
|
inlineinherited |
the number of preconditioner iterations
◆ precondVerbosity()
| int Dumux::LinearSolver::precondVerbosity |
( |
| ) |
const |
|
inlineinherited |
the preconditioner verbosity
◆ relaxation()
| double Dumux::LinearSolver::relaxation |
( |
| ) |
const |
|
inlineinherited |
the linear solver relaxation factor
◆ reset()
◆ residReduction()
| double Dumux::LinearSolver::residReduction |
( |
| ) |
const |
|
inlineinherited |
the linear solver residual reduction
◆ result()
The result containing the convergence history.
◆ setMaxIter()
| void Dumux::LinearSolver::setMaxIter |
( |
int | i | ) |
|
|
inlineinherited |
set the maximum number of linear solver iterations
◆ setPrecondIter()
| void Dumux::LinearSolver::setPrecondIter |
( |
int | i | ) |
|
|
inlineinherited |
set the number of preconditioner iterations
◆ setPrecondVerbosity()
| void Dumux::LinearSolver::setPrecondVerbosity |
( |
int | verbosityLevel | ) |
|
|
inlineinherited |
set the preconditioner verbosity
◆ setRelaxation()
| void Dumux::LinearSolver::setRelaxation |
( |
double | r | ) |
|
|
inlineinherited |
set the linear solver relaxation factor
◆ setResidualReduction()
| void Dumux::LinearSolver::setResidualReduction |
( |
double | r | ) |
|
|
inlineinherited |
set the linear solver residual reduction
◆ setVerbosity()
| void Dumux::LinearSolver::setVerbosity |
( |
int | v | ) |
|
|
inlineinherited |
◆ solve() [1/2]
template<class Matrix, class Vector>
Solve a linear system.
- Parameters
-
| A | the matrix |
| x | the seeked solution vector, containing the initial solution upon entry |
| b | the right hand side vector |
◆ solve() [2/2]
template<class Matrix, class Vector>
| bool Dumux::LinearSolver::solve |
( |
const Matrix & | A, |
|
|
Vector & | x, |
|
|
const Vector & | b ) |
|
inlineinherited |
Solve the linear system Ax = b.
- Note
- This has to be overloaded by the actual solver
◆ verbosity()
| int Dumux::LinearSolver::verbosity |
( |
| ) |
const |
|
inlineinherited |
The documentation for this class was generated from the following file: