diff --git a/dune/solvers/iterationsteps/projectedblockgsstep.cc b/dune/solvers/iterationsteps/projectedblockgsstep.cc index 1f76e4488c43a53b44c5c99db8dd461732045772..c80db8d42f36b46d22da9d36e331356b0889baf9 100644 --- a/dune/solvers/iterationsteps/projectedblockgsstep.cc +++ b/dune/solvers/iterationsteps/projectedblockgsstep.cc @@ -6,7 +6,7 @@ inline void ProjectedBlockGSStep<MatrixType, VectorType>::iterate() { assert(hasObstacle_!=nullptr); - + if (hasObstacle_->size()!= (unsigned int)this->x_->size()) DUNE_THROW(SolverError, "Size of hasObstacle (" << hasObstacle_->size() << ") doesn't match solution vector (" << this->x_->size() << ")"); @@ -49,7 +49,7 @@ void ProjectedBlockGSStep<MatrixType, VectorType>::iterate() // Solve the local constraint minimization problem // We use a projected Gauss-Seidel, for lack of anything better assert(obstacles_!=nullptr); - + Obstacle defectObstacle = (*obstacles_)[i]; defectObstacle -= x;