LinearSolver is now called IterativeSolver

[[Imported from SVN: r1026]]

solver/common/linearsolver.cc

-// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
-// vi: set et ts=4 sw=2 sts=2:
-//#include "norms.hh"
-
-template <class OP_TYPE, class VEC_TYPE>
-inline
-void Dune::LinearSolver<OP_TYPE, VEC_TYPE>::solve()
-{
-
-  int i;
-
-  if (verbosity_ != QUIET)
-    std::cout << "--- LinearSolver ---\n";
-
-  double error = std::numeric_limits<double>::max();
-
-  double normOfOldCorrection = 0;
-
-  // Loop until desired tolerance or maximum number of iterations is reached
-  for (i=0; i<numIt && (error>tolerance_ || isnan(error)); i++) {
-
-    // Backup of the current solution for the error computation later on
-    VEC_TYPE oldSolution = iterationStep->getSol();
-
-    // Perform one iteration step
-    iterationStep->iterate();
-
-    // Compute error
-    double oldNorm = errorNorm_->compute(oldSolution, iterationStep->level());
-    oldSolution -= iterationStep->getSol();
-
-    double normOfCorrection = errorNorm_->compute(oldSolution, iterationStep->level());
-
-    error = normOfCorrection / oldNorm;
-
-    double convRate = normOfCorrection / normOfOldCorrection;
-
-    normOfOldCorrection = normOfCorrection;
-
-    // Output
-    if (verbosity_ != QUIET) {
-      std::cout << "||u^{n+1} - u^n||_L2: " << error << ",      "
-                << "convrate " << convRate << "\n";
-    }
-
-  }
-
-  if (verbosity_ != QUIET) {
-    std::cout << i << " iterations performed\n";
-    std::cout << "--------------------\n";
-  }
-
-}

solver/common/linearsolver.hh

-// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
-// vi: set et ts=4 sw=2 sts=2:
-#ifndef __DUNE_LINEAR_SOLVER_HH__
-#define __DUNE_LINEAR_SOLVER_HH__
-
-#include <dune/solver/common/solver.hh>
-#include <dune/fem/norms/norm.hh>
-
-namespace Dune {
-
-  /** \brief A generic linear solver
-   *
-   *  This class basically implements a loop that calls
-   * an iteration procedure (which is to be supplied be
-   * the user).  It also monitors convergence. */
-  template <class OperatorType, class DiscFuncType>
-  class LinearSolver : public Solver
-  {
-  public:
-    /** \brief Loop, call the iteration procedure
-     * and monitor convergence */
-    virtual void solve();
-
-    //! The maximum number of iterations
-    int numIt;
-
-    //! The iteration step used by the algorithm
-    IterationStep<OperatorType,DiscFuncType>* iterationStep;
-
-    //! The norm used to measure convergence
-    Norm<DiscFuncType>* errorNorm_;
-
-  };
-
-}
-
-#include "linearsolver.cc"
-
-#endif