diff --git a/dune/solvers/solvers/loopsolver.cc b/dune/solvers/solvers/loopsolver.cc index 075c760ae4f4ea20014de65deaef330c8b16c64e..146d1d222e92b8e97af1819020f7e5099526ea17 100644 --- a/dune/solvers/solvers/loopsolver.cc +++ b/dune/solvers/solvers/loopsolver.cc @@ -75,7 +75,7 @@ void LoopSolver<VectorType, BitVectorType>::solve() int convRateCounter = 0; // Loop until desired tolerance or maximum number of iterations is reached - for (i=0; i<this->maxIterations_ && (error>this->tolerance_ || std::isnan(error)); i++) + for (i=0; i<this->maxIterations_ && (error>this->tolerance_ || std::isnan(error)); i++) { // Backup of the current solution for the error computation later on VectorType oldSolution = iterationStep_->getSol(); diff --git a/dune/solvers/solvers/loopsolver.hh b/dune/solvers/solvers/loopsolver.hh index 8312704b28f5f688b7882b400b1f0c31f45b842b..caede04932ee172a1f699b0acedd91b11b3e07bf 100644 --- a/dune/solvers/solvers/loopsolver.hh +++ b/dune/solvers/solvers/loopsolver.hh @@ -7,8 +7,8 @@ /** \brief A solver which consists of a single loop * - * This class basically implements a loop that calls an iteration procedure - * (which is to be supplied by the user). It also monitors convergence. + * This class basically implements a loop that calls an iteration procedure + * (which is to be supplied by the user). It also monitors convergence. */ template <class VectorType, class BitVectorType = Dune::BitSetVector<VectorType::block_type::dimension> > class LoopSolver : public IterativeSolver<VectorType, BitVectorType> @@ -24,7 +24,7 @@ public: bool useRelativeError=true, const VectorType* referenceSolution=0) : IterativeSolver<VectorType, BitVectorType>(maxIterations, - tolerance, + tolerance, errorNorm, verbosity, useRelativeError),