mg_solver_impl.hpp

Go to the documentation of this file.

/*
 * Copyright (c) 2010-2015:  G-CSC, Goethe University Frankfurt
 * Author: Andreas Vogel
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
 */
 
#ifndef __H__UG__LIB_DISC__MULTI_GRID_SOLVER__MG_SOLVER_IMPL__
#define __H__UG__LIB_DISC__MULTI_GRID_SOLVER__MG_SOLVER_IMPL__
 
#include <iostream>
#include <sstream>
#include <string>
#include "common/profiler/profiler.h"
 #include "common/error.h"
#include "lib_disc/function_spaces/grid_function_util.h"
#include "lib_disc/operator/linear_operator/std_transfer.h"
#include "lib_disc/operator/linear_operator/std_injection.h"
#include "lib_grid/tools/periodic_boundary_manager.h"
#include "lib_disc/operator/linear_operator/level_preconditioner_interface.h"
#include "mg_solver.h"
 
#ifdef UG_PARALLEL
  #include "lib_algebra/parallelization/parallelization.h"
  #include "pcl/pcl_util.h"
//  the debug barrier is used to eliminate synchronization overhead from
//  profiling stats. Only used for parallel builds.
//  PCL_DEBUG_BARRIER only has an effect if PCL_DEBUG_BARRIER_ENABLED is defined.
  #define GMG_PARALLEL_DEBUG_BARRIER(comm) PCL_DEBUG_BARRIER(comm)
 
#else
  #define GMG_PARALLEL_DEBUG_BARRIER(comm)
#endif
 
#define PROFILE_GMG
#ifdef PROFILE_GMG
  #define GMG_PROFILE_FUNC()    PROFILE_FUNC_GROUP("gmg")
  #define GMG_PROFILE_BEGIN(name) PROFILE_BEGIN_GROUP(name, "gmg")
  #define GMG_PROFILE_END()   PROFILE_END()
#else
  #define GMG_PROFILE_FUNC()
  #define GMG_PROFILE_BEGIN(name)
  #define GMG_PROFILE_END()
#endif
 
namespace ug{
 
// Constructor
 
template <typename TDomain, typename TAlgebra>
AssembledMultiGridCycle<TDomain, TAlgebra>::
AssembledMultiGridCycle() :
  m_spSurfaceMat(NULL), m_pSurfaceSol(nullptr), m_spAss(NULL), m_spApproxSpace(SPNULL),
  m_topLev(GridLevel::TOP), m_surfaceLev(GridLevel::TOP),
  m_baseLev(0), m_cycleType(_V_),
  m_numPreSmooth(2), m_numPostSmooth(2),
  m_LocalFullRefLevel(0), m_GridLevelType(GridLevel::LEVEL),
  m_bUseRAP(false), m_bSmoothOnSurfaceRim(false),
  m_bCommCompOverlap(false),
  m_spPreSmootherPrototype(new Jacobi<TAlgebra>()),
  m_spPostSmootherPrototype(m_spPreSmootherPrototype),
  m_spProjectionPrototype(SPNULL),
  m_spProlongationPrototype(new StdTransfer<TDomain,TAlgebra>()),
  m_spRestrictionPrototype(m_spProlongationPrototype),
  m_spBaseSolver(new LU<TAlgebra>()),
  m_bGatheredBaseIfAmbiguous(true),
  m_bGatheredBaseUsed(true),
  m_ignoreInitForBaseSolver(false),
  m_bMatrixStructureIsConst(false),
  m_pC(nullptr),
  m_spDebugWriter(NULL), m_dbgIterCnt(0)
{};
AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
AssembledMultiGridCycle<TDomain, TAlgebra>::
AssembledMultiGridCycle(SmartPtr<ApproximationSpace<TDomain> > approxSpace) :
  m_spSurfaceMat(NULL), m_pSurfaceSol(nullptr), m_spAss(NULL), m_spApproxSpace(approxSpace),
  m_topLev(GridLevel::TOP), m_surfaceLev(GridLevel::TOP),
  m_baseLev(0), m_cycleType(_V_),
  m_numPreSmooth(2), m_numPostSmooth(2),
  m_LocalFullRefLevel(0), m_GridLevelType(GridLevel::LEVEL),
  m_bUseRAP(false), m_bSmoothOnSurfaceRim(false),
  m_bCommCompOverlap(false),
  m_spPreSmootherPrototype(new Jacobi<TAlgebra>()),
  m_spPostSmootherPrototype(m_spPreSmootherPrototype),
  m_spProjectionPrototype(new StdInjection<TDomain,TAlgebra>(m_spApproxSpace)),
  m_spProlongationPrototype(new StdTransfer<TDomain,TAlgebra>()),
  m_spRestrictionPrototype(m_spProlongationPrototype),
  m_spBaseSolver(new LU<TAlgebra>()),
  m_bGatheredBaseIfAmbiguous(true),
  m_bGatheredBaseUsed(true),
  m_ignoreInitForBaseSolver(false),
  m_bMatrixStructureIsConst(false),
  m_pC(nullptr),
  m_spDebugWriter(NULL), m_dbgIterCnt(0)
{};
AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void  AssembledMultiGridCycle<TDomain, TAlgebra>::
set_approximation_space(SmartPtr<ApproximationSpace<TDomain> > approxSpace)
{
  m_spApproxSpace = approxSpace;
  m_spProjectionPrototype = make_sp(new StdInjection<TDomain,TAlgebra>(m_spApproxSpace));
}
void  AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
SmartPtr<ILinearIterator<typename TAlgebra::vector_type> >
AssembledMultiGridCycle<TDomain, TAlgebra>::
clone()
{
  SmartPtr<AssembledMultiGridCycle<TDomain, TAlgebra> > clone(
    new AssembledMultiGridCycle<TDomain, TAlgebra>(m_spApproxSpace));
 
  clone->set_base_level(m_baseLev);
  clone->set_base_solver(m_spBaseSolver);
  clone->set_cycle_type(m_cycleType);
  clone->set_debug(m_spDebugWriter);
  clone->set_discretization(m_spAss);
  clone->set_num_postsmooth(m_numPostSmooth);
  clone->set_num_presmooth(m_numPreSmooth);
  clone->set_projection(m_spProjectionPrototype);
  clone->set_prolongation(m_spProlongationPrototype);
  clone->set_restriction(m_spRestrictionPrototype);
  clone->set_presmoother(m_spPreSmootherPrototype);
  clone->set_postsmoother(m_spPostSmootherPrototype);
  clone->set_surface_level(m_surfaceLev);
 
  for(size_t i = 0; i < m_vspProlongationPostProcess.size(); ++i)
    clone->add_prolongation_post_process(m_vspProlongationPostProcess[i]);
 
  for(size_t i = 0; i < m_vspRestrictionPostProcess.size(); ++i)
    clone->add_restriction_post_process(m_vspRestrictionPostProcess[i]);
 
  return clone;
}
AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
AssembledMultiGridCycle<TDomain, TAlgebra>::
~AssembledMultiGridCycle()
{};
AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
// apply and init
 
template <typename TDomain, typename TAlgebra>
bool AssembledMultiGridCycle<TDomain, TAlgebra>::
apply(vector_type& rC, const vector_type& rD)
{
  GMG_PROFILE_FUNC();
  GF* pC = dynamic_cast<GF*>(&rC);
  if(!pC) UG_THROW("GMG::apply: Expect Correction to be grid based.")
  const GF* pD = dynamic_cast<const GF*>(&rD);
  if(!pD) UG_THROW("GMG::apply: Expect Defect to be grid based.")
  GF& c = *pC;
  m_pC = pC;
  const GF& d = *pD;
 
  try{
//  Check if surface level has been chosen correctly
//  Please note, that the approximation space returns the global number of levels,
//  i.e. the maximum of levels among all processes.
  if(m_topLev >= (int)m_spApproxSpace->num_levels())
    UG_THROW("GMG::apply: SurfaceLevel "<<m_topLev<<" does not exist.");
 
//  Check if base level has been choose correctly
  if(m_baseLev > m_topLev)
    UG_THROW("GMG::apply: Base level must be smaller or equal to surface Level.");
 
//  debug output
  write_debug(d, "Defect_In");
  write_debug(*m_spSurfaceMat, "SurfaceStiffness", c, c);
  for(int lev = m_baseLev; lev <= m_topLev; ++lev)
  {
    LevData& ld = *m_vLevData[lev];
    ld.n_pre_calls = ld.n_post_calls = ld.n_base_calls
      = ld.n_restr_calls = ld.n_prolong_calls = 0;
  }
  
//  project defect from surface to level
  GMG_PROFILE_BEGIN(GMG_Apply_CopyDefectFromSurface);
  try{
    for(int lev = m_baseLev; lev <= m_topLev; ++lev){
      const std::vector<SurfLevelMap>& vMap = m_vLevData[lev]->vSurfLevelMap;
      LevData& ld = *m_vLevData[lev];
      for(size_t i = 0; i < vMap.size(); ++i){
        (*ld.sd)[vMap[i].levIndex] = d[vMap[i].surfIndex];
      }
    }
#ifdef UG_PARALLEL
    for(int lev = m_baseLev; lev <= m_topLev; ++lev)
      m_vLevData[lev]->sd->set_storage_type(d.get_storage_mask());
#endif
  }
  UG_CATCH_THROW("GMG::apply: Project d Surf -> Level failed.");
  GMG_PROFILE_END();
 
//  Perform one multigrid cycle
  UG_DLOG(LIB_DISC_MULTIGRID, 4, "gmg-apply lmgc (on level " << m_topLev << ")... \n");
  try{
    GMG_PROFILE_BEGIN(GMG_Apply_ResetCorrection);
  //  reset surface correction
    c.set(0.0);
 
  //  reset corr on top level
    m_vLevData[m_topLev]->sc->set(0.0);
    GMG_PROFILE_END();
 
  //  start mg-cycle
    GMG_PROFILE_BEGIN(GMG_Apply_lmgc);
    lmgc(m_topLev, m_cycleType);
    GMG_PROFILE_END();
 
  //  project top lev to surface
    GMG_PROFILE_BEGIN(GMG_Apply_AddCorrectionToSurface);
    const std::vector<SurfLevelMap>& vMap = m_vLevData[m_topLev]->vSurfLevelMap;
    LevData& ld = *m_vLevData[m_topLev];
    for(size_t i = 0; i < vMap.size(); ++i){
      c[vMap[i].surfIndex] += (*ld.sc)[vMap[i].levIndex];
    }
    #ifdef UG_PARALLEL
    c.set_storage_type(PST_CONSISTENT);
    #endif
    GMG_PROFILE_END();
  }
  UG_CATCH_THROW("GMG: lmgc failed.");
 
//  apply scaling
  GMG_PROFILE_BEGIN(GMG_Apply_Scaling);
  try{
    const number kappa = this->damping()->damping(c, d, m_spSurfaceMat.template cast_dynamic<ILinearOperator<vector_type> >());
    if(kappa != 1.0) c *= kappa;
  }
  UG_CATCH_THROW("GMG: Damping failed.")
  GMG_PROFILE_END();
 
//  debug output
  write_debug(c, "Correction_Out");
 
//  increase dbg counter
  if(m_spDebugWriter.valid()) m_dbgIterCnt++;
 
  } UG_CATCH_THROW("GMG::apply: Application failed.");
 
  UG_DLOG(LIB_DISC_MULTIGRID, 4, "gmg-apply done. \n");
  return true;
}
bool AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
bool AssembledMultiGridCycle<TDomain, TAlgebra>::
apply_update_defect(vector_type &c, vector_type& rD)
{
  GMG_PROFILE_FUNC();
 
//  NOTE:   This is the implementation of a multiplicative Multigrid. Thus, the
//      defect is kept up to date when traversing the grid. At the end of
//      the iteration the updated defect is stored in the level defects and
//      could be projected back to the surface in order to get an updated
//      surface defect. This is, however, not done. For these reasons:
//      a) A Matrix-Vector operation is not very expensive
//      b) In a 2d adaptive case, the update is difficult, but can be
//        performed. But if the implementation is incorrect, this will
//        hardly be detected.
//      c) In a 3d adaptive case, it is impossible to ensure, that assembled
//        level matrices and the surface matrix have the same couplings
//        (not even to inner points). This is due to the fact, that e.g.
//        finite volume geometries are computed using different
//        integration points. (Hanging fv used triangles as scvf in 3d,
//        while normal fv use quads). Therefore, the updated defect is
//        only approximately the correct defect. In order to return the
//        correct defect, we must recompute the defect in the
//        adaptive case.
//      d) If scaling of the correction is performed, the defect must be
//        recomputed anyway. Thus, only scale=1.0 allows optimizing.
//      e) Updated defects are only needed in LinearIterativeSolvers. In
//        Krylov-Methods (CG, BiCGStab, ...) only the correction is
//        needed. We optimize for that case.
 
//  compute correction
  if(!apply(c, rD)) return false;
 
//  update defect: d = d - A*c
  m_spSurfaceMat->matmul_minus(rD, c);
 
//  write for debugging
  const GF* pD = dynamic_cast<const GF*>(&rD);
  if(!pD) UG_THROW("GMG::apply: Expect Defect to be grid based.")
  const GF& d = *pD;
  write_debug(d, "Defect_Out");
 
  return true;
}
bool AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
bool AssembledMultiGridCycle<TDomain, TAlgebra>::
init(SmartPtr<ILinearOperator<vector_type> > J, const vector_type& u)
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - init(J, u)\n");
 
  // try to extract assembling routine
  SmartPtr<AssembledLinearOperator<TAlgebra> > spALO =
      J.template cast_dynamic<AssembledLinearOperator<TAlgebra> >();
  if(spALO.valid()){
    m_spAss = spALO->discretization();
  }
 
  // Store Surface Matrix
  m_spSurfaceMat = J.template cast_dynamic<matrix_type>();
 
  // Store Surface Solution
  m_pSurfaceSol = &u;
 
  // call init
  init();
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - init(J, u)\n");
  return true;
}
bool AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
bool AssembledMultiGridCycle<TDomain, TAlgebra>::
init(SmartPtr<ILinearOperator<vector_type> > L)
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - init(L)\n");
 
  // try to extract assembling routine
  SmartPtr<AssembledLinearOperator<TAlgebra> > spALO =
      L.template cast_dynamic<AssembledLinearOperator<TAlgebra> >();
  if(spALO.valid()){
    m_spAss = spALO->discretization();
  }
 
  // Store Surface Matrix
  m_spSurfaceMat = L.template cast_dynamic<matrix_type>();
 
  // Store Surface Solution
  m_pSurfaceSol = NULL;
 
  // call init
  init();
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - init(L)\n");
  return true;
}
bool AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start init_common\n");
 
  try{
 
//  Cast Operator
  if(m_spSurfaceMat.invalid())
    UG_THROW("GMG:init: Can not cast Operator to Matrix.");
 
//  Check Approx Space
  if(m_spApproxSpace.invalid())
    UG_THROW("GMG::init: Approximation Space not set.");
 
//  check that grid given
  if(m_spApproxSpace->num_levels() == 0)
    UG_THROW("GMG:init: No grid levels");
 
  if(m_spAss.invalid())
    UG_THROW("GMG::init: Discretization not set.");
 
  if(m_spBaseSolver.invalid())
    UG_THROW("GMG::init: Base Solver not set.");
 
  if(m_spPreSmootherPrototype.invalid())
    UG_THROW("GMG::init: PreSmoother not set.");
 
  if(m_spPostSmootherPrototype.invalid())
    UG_THROW("GMG::init: PostSmoother not set.");
 
  if(m_spProlongationPrototype.invalid())
    UG_THROW("GMG::init: Prolongation not set.");
 
  if(m_spRestrictionPrototype.invalid())
    UG_THROW("GMG::init: Restriction not set.");
 
//  get current toplevel
  const GF* pSol = dynamic_cast<const GF*>(m_pSurfaceSol);
  if(pSol){
    m_surfaceLev = pSol->dof_distribution()->grid_level().level();
  }
 
  int topLev = 0;
  if(m_surfaceLev != GridLevel::TOP) topLev = m_surfaceLev;
  else topLev = m_spApproxSpace->num_levels() - 1;
 
  if(m_baseLev > topLev)
    UG_THROW("GMG::init: Base Level greater than Surface level.");
 
  if(m_ApproxSpaceRevision != m_spApproxSpace->revision()
    || topLev != m_topLev)
  {
  //  remember new top level
     m_topLev = topLev;
 
  //  Allocate memory for given top level
    GMG_PROFILE_BEGIN(GMG_Init_LevelMemory);
    try{
      init_level_memory(m_baseLev, m_topLev);
    }
    UG_CATCH_THROW("GMG::init: Cannot allocate memory.");
    GMG_PROFILE_END();
 
  //  init mapping from surface level to top level in case of full refinement
    GMG_PROFILE_BEGIN(GMG_Init_IndexMappings);
    try{
      init_index_mappings();
    }
    UG_CATCH_THROW("GMG: Cannot create SurfaceToLevelMap.")
    GMG_PROFILE_END();
 
  //  Create Interpolation
    GMG_PROFILE_BEGIN(GMG_Init_Transfers);
    try{
      init_transfer();
    }
    UG_CATCH_THROW("GMG:init: Cannot init Transfer (Prolongation/Restriction).");
    GMG_PROFILE_END();
 
  //  remember revision counter of approx space
    m_ApproxSpaceRevision = m_spApproxSpace->revision();
  }
 
//  Assemble coarse grid operators
  GMG_PROFILE_BEGIN(GMG_Init_CreateLevelMatrices);
  try{
    if(m_bUseRAP){
      init_rap_operator();
    } else {
      assemble_level_operator();
    }
  }
  UG_CATCH_THROW("GMG: Initialization of Level Operator failed.");
  GMG_PROFILE_END();
 
//  Init smoother for coarse grid operators
  GMG_PROFILE_BEGIN(GMG_Init_Smoother);
  try{
    init_smoother();
  }
  UG_CATCH_THROW("GMG:init: Cannot init Smoother.");
  GMG_PROFILE_END();
 
//  Init base solver
  if(!ignore_init_for_base_solver()){
    GMG_PROFILE_BEGIN(GMG_Init_BaseSolver);
    try{
      init_base_solver();
    }
    UG_CATCH_THROW("GMG:init: Cannot init Base Solver.");
    GMG_PROFILE_END();
  }
  } UG_CATCH_THROW("GMG: Init failure for init(u)");
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop init_common\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
ignore_init_for_base_solver(bool ignore)
{
  #ifdef UG_PARALLEL
    UG_COND_THROW(ignore && (pcl::NumProcs() > 1),
            "ignore_init_for_base_solver currently only works for serial runs.")
  #endif
  m_ignoreInitForBaseSolver = ignore;
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
bool AssembledMultiGridCycle<TDomain, TAlgebra>::
ignore_init_for_base_solver() const
{
  return m_ignoreInitForBaseSolver;
}
bool AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
force_reinit()
{
  m_ApproxSpaceRevision.invalidate();
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
assemble_level_operator()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start assemble_level_operator\n");
 
  if(m_GridLevelType == GridLevel::SURFACE)
    UG_THROW("GMG: emulate_full_refined_grid currently only implemented "
        "for set_rap(true) - since assembling of on surface-level with "
        " lev < topLev is currently not supported by constraints and "
        " elem-disc loop (only top-lev or level-view poosible). It is "
        "necessary to rework that part of the assembing procedure.")
 
//  Create Projection
  try{
    if(m_pSurfaceSol) {
      UG_DLOG(LIB_DISC_MULTIGRID, 4, "  start assemble_level_operator: project sol\n");
      GMG_PROFILE_BEGIN(GMG_ProjectSolution_CopyFromSurface);
      #ifdef UG_PARALLEL
      if(!m_pSurfaceSol->has_storage_type(PST_CONSISTENT))
        UG_THROW("GMG::init: Can only project "
            "a consistent solution. Make sure to pass a consistent on.");
      #endif
 
      init_projection();
 
      for(int lev = m_baseLev; lev <= m_topLev; ++lev){
        const std::vector<SurfLevelMap>& vMap = m_vLevData[lev]->vSurfLevelMap;
        LevData& ld = *m_vLevData[lev];
        for(size_t i = 0; i < vMap.size(); ++i){
          (*ld.st)[vMap[i].levIndex] = (*m_pSurfaceSol)[vMap[i].surfIndex];
        }
      }
      GMG_PROFILE_END();
      UG_DLOG(LIB_DISC_MULTIGRID, 4, "  end   assemble_level_operator: project sol\n");
    }
  }
  UG_CATCH_THROW("GMG::init: Projection of Surface Solution failed.");
 
//  Create coarse level operators
  GMG_PROFILE_BEGIN(GMG_AssembleLevelMat_AllLevelMat);
  for(int lev = m_topLev; lev >= m_baseLev; --lev)
  {
    LevData& ld = *m_vLevData[lev];
 
  //  send solution to v-master
    SmartPtr<GF> spT = ld.st;
    #ifdef UG_PARALLEL
    ComPol_VecCopy<vector_type> cpVecCopy(ld.t.get());
    if(m_pSurfaceSol && lev > m_baseLev)
    {
      if( !ld.t->layouts()->vertical_slave().empty() ||
        !ld.t->layouts()->vertical_master().empty())
      {
        UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - send sol to v-master\n");
 
        // todo: if no ghosts present on proc one could use ld.st directly
        GMG_PROFILE_BEGIN(GMG_ProjectSolution_CopyNoghostToGhost);
        copy_noghost_to_ghost(ld.t, ld.st, ld.vMapPatchToGlobal);
        GMG_PROFILE_END();
 
        GMG_PROFILE_BEGIN(GMG_ProjectSolution_CollectAndSend);
        m_Com.receive_data(ld.t->layouts()->vertical_master(), cpVecCopy);
        m_Com.send_data(ld.t->layouts()->vertical_slave(), cpVecCopy);
        m_Com.communicate_and_resume();
        GMG_PROFILE_END();
        if(!m_bCommCompOverlap){
          GMG_PROFILE_BEGIN(GMG_ProjectSolution_RevieveAndExtract_NoOverlap);
          m_Com.wait();
          GMG_PROFILE_END();
        }
 
        spT = ld.t;
        UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - send sol to v-master\n");
      }
    }
    #endif
 
  //  In Full-Ref case we can copy the Matrix from the surface
    bool bCpyFromSurface = ((lev == m_topLev) && (lev <= m_LocalFullRefLevel));
    if(!bCpyFromSurface)
    {
      UG_DLOG(LIB_DISC_MULTIGRID, 4, "  start assemble_level_operator: assemble on lev "<<lev<<"\n");
      GMG_PROFILE_BEGIN(GMG_AssembleLevelMat_AssembleOnLevel);
      try{
      if(m_GridLevelType == GridLevel::LEVEL)
        m_spAss->ass_tuner()->set_force_regular_grid(true);
      m_spAss->assemble_jacobian(*ld.A, *ld.st, GridLevel(lev, m_GridLevelType, false));
      m_spAss->ass_tuner()->set_force_regular_grid(false);
      }
      UG_CATCH_THROW("GMG:init: Cannot init operator for level "<<lev);
      GMG_PROFILE_END();
      UG_DLOG(LIB_DISC_MULTIGRID, 4, "  end   assemble_level_operator: assemble on lev "<<lev<<"\n");
    }
    else
    {
    //  in case of full refinement we simply copy the matrix (with correct numbering)
      UG_DLOG(LIB_DISC_MULTIGRID, 4, "  start assemble_level_operator: copy mat on lev "<<lev<<"\n");
      GMG_PROFILE_BEGIN(GMG_AssembleLevelMat_CopyFromTopSurface);
 
    //  loop all mapped indices
      UG_ASSERT(m_spSurfaceMat->num_rows() == m_vSurfToLevelMap.size(),
                "Surface Matrix rows != Surf Level Indices")
 
      if (m_bMatrixStructureIsConst)
        ld.A->clear_retain_structure();
      else
        ld.A->resize_and_clear(m_spSurfaceMat->num_rows(), m_spSurfaceMat->num_cols());
      for(size_t srfRow = 0; srfRow < m_vSurfToLevelMap.size(); ++srfRow)
      {
      //  get mapped level index
        UG_ASSERT(m_vSurfToLevelMap[srfRow].level == m_topLev,
                  "All surface Indices must be on top level for full-ref.")
        const size_t lvlRow = m_vSurfToLevelMap[srfRow].index;
 
      //  loop all connections of the surface dof to other surface dofs
      //  and copy the matrix coupling into the level matrix
        typedef typename matrix_type::const_row_iterator const_row_iterator;
        const_row_iterator conn = m_spSurfaceMat->begin_row(srfRow);
        const_row_iterator connEnd = m_spSurfaceMat->end_row(srfRow);
        for( ;conn != connEnd; ++conn){
        //  get corresponding level connection index
          UG_ASSERT(m_vSurfToLevelMap[conn.index()].level == m_topLev,
                    "All surface Indices must be on top level for full-ref.")
          const size_t lvlCol = m_vSurfToLevelMap[conn.index()].index;
 
        //  copy connection to level matrix
          (*ld.A)(lvlRow, lvlCol) = conn.value();
        }
      }
 
      #ifdef UG_PARALLEL
      ld.A->set_storage_type(m_spSurfaceMat->get_storage_mask());
      ld.A->set_layouts(ld.st->layouts());
      #endif
      GMG_PROFILE_END();
      UG_DLOG(LIB_DISC_MULTIGRID, 4, "  end   assemble_level_operator: copy mat on lev "<<lev<<"\n");
    }
 
    if(m_pSurfaceSol && lev > m_baseLev)
    {
      #ifdef UG_PARALLEL
      if(m_bCommCompOverlap){
        UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - recieve sol at v-master\n");
        GMG_PROFILE_BEGIN(GMG_ProjectSolution_RecieveAndExtract_WithOverlap);
        m_Com.wait();
        GMG_PROFILE_END();
        UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop  - recieve sol at v-master\n");
      }
      #endif
 
      GMG_PROFILE_BEGIN(GMG_ProjectSolution_Transfer);
      LevData& lc = *m_vLevData[lev-1];
      try{
        ld.Projection->do_restrict(*lc.st, *spT);
        #ifdef UG_PARALLEL
        lc.st->set_storage_type(m_pSurfaceSol->get_storage_mask());
        #endif
      } UG_CATCH_THROW("GMG::init: Cannot project solution to coarse grid "
              "function of level "<<lev-1);
      GMG_PROFILE_END();
    }
  }
  GMG_PROFILE_END();
 
//  write computed level matrices for debug purpose
  for(int lev = m_baseLev; lev <= m_topLev; ++lev){
    LevData& ld = *m_vLevData[lev];
    write_debug(*ld.A, "LevelMatrix", *ld.st, *ld.st);
  }
 
//  if no ghosts are present we can simply use the whole grid. If the base
//  solver is carried out in serial (gathering to some processes), we have
//  to assemble the assemble the coarse grid matrix on the whole grid as
//  well
  if(m_bGatheredBaseUsed)
  {
    UG_DLOG(LIB_DISC_MULTIGRID, 4, "  start assemble_level_operator: ass gathered on lev "<<m_baseLev<<"\n");
    LevData& ld = *m_vLevData[m_baseLev];
 
    if(m_pSurfaceSol){
 
      #ifdef UG_PARALLEL
      if( !ld.t->layouts()->vertical_slave().empty() ||
        !ld.t->layouts()->vertical_master().empty())
      {
        UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - copy sol to gathered master\n");
 
        GMG_PROFILE_BEGIN(GMG_ProjectSolution_CopyToGatheredMaster);
        copy_noghost_to_ghost(ld.t, ld.st, ld.vMapPatchToGlobal);
 
        ComPol_VecCopy<vector_type> cpVecCopy(ld.t.get());
        m_Com.receive_data(ld.t->layouts()->vertical_master(), cpVecCopy);
        m_Com.send_data(ld.t->layouts()->vertical_slave(), cpVecCopy);
        m_Com.communicate();
        GMG_PROFILE_END();
 
        UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - copy sol to gathered master\n");
      }
      #endif
    }
 
    // only assemble on gathering proc
    if(gathered_base_master())
    {
      GMG_PROFILE_BEGIN(GMG_AssembleLevelMat_GatheredBase);
      try{
      if(m_GridLevelType == GridLevel::LEVEL)
        m_spAss->ass_tuner()->set_force_regular_grid(true);
      m_spAss->assemble_jacobian(*spGatheredBaseMat, *ld.t, GridLevel(m_baseLev, m_GridLevelType, true));
      m_spAss->ass_tuner()->set_force_regular_grid(false);
      }
      UG_CATCH_THROW("GMG:init: Cannot init operator base level operator");
      GMG_PROFILE_END();
    }
    UG_DLOG(LIB_DISC_MULTIGRID, 4, "  end   assemble_level_operator: ass gathered on lev "<<m_baseLev<<"\n");
  }
 
//  assemble missing coarse grid matrix contribution (only in adaptive case)
  try{
    assemble_rim_cpl(m_pSurfaceSol);
  }
  UG_CATCH_THROW("GMG:init: Cannot init missing coarse grid coupling.");
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop assemble_level_operator\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
assemble_rim_cpl(const vector_type* u)
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - assemble_rim_cpl " << "\n");
 
//  clear matrices
  for(int lev = m_baseLev; lev <= m_topLev; ++lev){
    LevData& ld = *m_vLevData[lev];
    ld.RimCpl_Fine_Coarse.resize_and_clear(0,0);
    ld.RimCpl_Coarse_Fine.resize_and_clear(0,0);
  }
 
//  loop all levels to compute the missing contribution
  for(int lev = m_topLev; lev > m_LocalFullRefLevel; --lev)
  {
    LevData& lc = *m_vLevData[lev-1];
    LevData& lf = *m_vLevData[lev];
 
    lc.RimCpl_Fine_Coarse.resize_and_clear(lf.sd->size(), lc.sc->size());
    if(m_bSmoothOnSurfaceRim)
      lc.RimCpl_Coarse_Fine.resize_and_clear(lc.sd->size(), lf.sc->size());
 
    for(size_t i = 0; i< lf.vShadowing.size(); ++i)
    {
      const size_t lvlRow = lf.vShadowing[i];
      const size_t srfRow = lf.vSurfShadowing[i];
 
      SetRow((*lf.A), lvlRow, 0.0);
 
      typedef typename matrix_type::const_row_iterator row_iterator;
      row_iterator conn = m_spSurfaceMat->begin_row(srfRow);
      row_iterator connEnd = m_spSurfaceMat->end_row(srfRow);
      for( ;conn != connEnd; ++conn)
      {
        const size_t srfCol = conn.index();
 
        if(m_vSurfToLevelMap[srfCol].level == lev) {
          const size_t lvlCol = m_vSurfToLevelMap[srfCol].index;
          (*lf.A)(lvlRow, lvlCol) = conn.value();
        }
        if(m_vSurfToLevelMap[srfCol].level == lev+1) {
          if(m_vSurfToLevelMap[srfCol].levelLower == lev) {
            const size_t lvlCol = m_vSurfToLevelMap[srfCol].indexLower;
            (*lf.A)(lvlRow, lvlCol) = conn.value();
          }
        }
        if(m_vSurfToLevelMap[srfCol].level == lev-1){
          const size_t lvlCol = m_vSurfToLevelMap[srfCol].index;
          (lc.RimCpl_Fine_Coarse)(lvlRow, lvlCol) = conn.value();
 
          if(m_bSmoothOnSurfaceRim){
            lc.RimCpl_Coarse_Fine(lvlCol, lvlRow) = (*m_spSurfaceMat)(srfCol, srfRow);
          }
        }
 
      }
    }
 
#ifdef UG_PARALLEL
    lc.RimCpl_Fine_Coarse.set_storage_type(m_spSurfaceMat->get_storage_mask());
    if(m_bSmoothOnSurfaceRim)
      lc.RimCpl_Coarse_Fine.set_storage_type(m_spSurfaceMat->get_storage_mask());
#endif
    write_debug(*lf.A, "LevelMatrix", *lf.st, *lf.st);
    write_debug(lc.RimCpl_Fine_Coarse, "RimCpl", *lf.sd, *lc.sc);
    if(m_bSmoothOnSurfaceRim)
      write_debug(lc.RimCpl_Coarse_Fine, "RimCpl", *lc.sd, *lf.sc);
  }
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - assemble_rim_cpl " << "\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_rap_operator()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start init_rap_operator\n");
 
  GMG_PROFILE_BEGIN(GMG_BuildRAP_ResizeLevelMat);
  for(int lev = m_topLev; lev >= m_baseLev; --lev)
  {
    LevData& ld = *m_vLevData[lev];
    if (m_bMatrixStructureIsConst)
      ld.A->clear_retain_structure();
    else
      ld.A->resize_and_clear(ld.st->size(), ld.st->size());
    #ifdef UG_PARALLEL
    ld.A->set_storage_type(m_spSurfaceMat->get_storage_mask());
    ld.A->set_layouts(ld.st->layouts());
    #endif
  }
  GMG_PROFILE_END();
 
  UG_DLOG(LIB_DISC_MULTIGRID, 4, "  start init_rap_operator: copy from surface\n");
  GMG_PROFILE_BEGIN(GMG_BuildRAP_CopyFromSurfaceMat);
  for(size_t srfRow = 0; srfRow < m_vSurfToLevelMap.size(); ++srfRow)
  {
  //  loop all connections of the surface dof to other surface dofs
  //  and copy the matrix coupling into the level matrix
    typedef typename matrix_type::const_row_iterator const_row_iterator;
    const_row_iterator conn = m_spSurfaceMat->begin_row(srfRow);
    const_row_iterator connEnd = m_spSurfaceMat->end_row(srfRow);
    for( ;conn != connEnd; ++conn)
    {
    //  get corresponding surface connection index
      const size_t srfCol = conn.index();
 
    //  get level
      int rowLevel = m_vSurfToLevelMap[srfRow].level;
      int colLevel = m_vSurfToLevelMap[srfCol].level;
 
    //  get corresponding indices
      size_t lvlRow = m_vSurfToLevelMap[srfRow].index;
      size_t lvlCol = m_vSurfToLevelMap[srfCol].index;
 
    //  if connection between different level -> adjust
      UG_ASSERT(colLevel >= 0, "Invalid colLevel: "<<colLevel)
      UG_ASSERT(rowLevel >= 0, "Invalid rowLevel: "<<rowLevel)
      if(colLevel > rowLevel){
        if(m_vSurfToLevelMap[srfCol].levelLower == rowLevel){
          lvlCol = m_vSurfToLevelMap[srfCol].indexLower;
          colLevel = rowLevel;
        } else {
          continue;
        }
      } else if(colLevel < rowLevel){
        if(m_vSurfToLevelMap[srfRow].levelLower == colLevel){
          lvlRow = m_vSurfToLevelMap[srfRow].indexLower;
          rowLevel = colLevel;
        } else {
          continue;
        }
      }
 
    //  copy connection to level matrix
      (*(m_vLevData[colLevel]->A))(lvlRow, lvlCol) = conn.value();
    }
  }
  GMG_PROFILE_END();
  UG_DLOG(LIB_DISC_MULTIGRID, 4, "  end   init_rap_operator: copy from surface\n");
 
//  write computed level matrices for debug purpose
  for(int lev = m_baseLev; lev <= m_topLev; ++lev){
    LevData& ld = *m_vLevData[lev];
    write_debug(*ld.A, "LevelMatrixFromSurf", *ld.st, *ld.st);
  }
 
//  Create coarse level operators
  UG_DLOG(LIB_DISC_MULTIGRID, 4, "  start init_rap_operator: build rap\n");
  GMG_PROFILE_BEGIN(GMG_BuildRAP_AllLevelMat);
  for(int lev = m_topLev; lev > m_baseLev; --lev)
  {
    UG_DLOG(LIB_DISC_MULTIGRID, 4, "  start init_rap_operator: build rap on lev "<<lev<<"\n");
    LevData& lf = *m_vLevData[lev];
    LevData& lc = *m_vLevData[lev-1];
 
    SmartPtr<matrix_type> spA = lf.A;
    #ifdef UG_PARALLEL
    SmartPtr<matrix_type> spGhostA = SmartPtr<matrix_type>(new matrix_type);
    ComPol_MatAddSetZeroInnerInterfaceCouplings<matrix_type> cpMatAdd(*spGhostA);
    if( !lf.t->layouts()->vertical_master().empty() ||
      !lf.t->layouts()->vertical_slave().empty())
    {
      GMG_PROFILE_BEGIN(GMG_BuildRAP_CopyNoghostToGhost);
      spGhostA->resize_and_clear(lf.t->size(), lf.t->size());
      spGhostA->set_layouts(lf.t->layouts());
      if(!lf.t->layouts()->vertical_master().empty()){
        copy_noghost_to_ghost(spGhostA, lf.A, lf.vMapPatchToGlobal);
      } else {
        *spGhostA = *lf.A;
      }
      GMG_PROFILE_END();
 
      GMG_PROFILE_BEGIN(GMG_BuildRAP_CollectAndSend);
      m_Com.send_data(spGhostA->layouts()->vertical_slave(), cpMatAdd);
      m_Com.receive_data(spGhostA->layouts()->vertical_master(), cpMatAdd);
      m_Com.communicate_and_resume();
      GMG_PROFILE_END();
      if(!m_bCommCompOverlap){
        GMG_PROFILE_BEGIN(GMG_BuildRAP_RecieveAndExtract_NoOverlap);
        m_Com.wait();
        GMG_PROFILE_END();
      }
 
      spA = spGhostA;
    }
    #endif
 
    GMG_PROFILE_BEGIN(GMG_BuildRAP_CreateRestrictionAndProlongation);
    SmartPtr<matrix_type> R = lf.Restriction->restriction(lc.st->grid_level(), lf.t->grid_level(), m_spApproxSpace);
    SmartPtr<matrix_type> P = lf.Prolongation->prolongation(lf.t->grid_level(), lc.st->grid_level(), m_spApproxSpace);
    GMG_PROFILE_END();
 
    #ifdef UG_PARALLEL
    if(m_bCommCompOverlap){
      GMG_PROFILE_BEGIN(GMG_BuildRAP_RecieveAndExtract_WithOverlap);
      m_Com.wait();
      GMG_PROFILE_END();
    }
    #endif
 
    GMG_PROFILE_BEGIN(GMG_BuildRAP_MultiplyRAP);
    AddMultiplyOf(*lc.A, *R, *spA, *P);
    GMG_PROFILE_END();
    UG_DLOG(LIB_DISC_MULTIGRID, 4, "  end   init_rap_operator: build rap on lev "<<lev<<"\n");
  }
  GMG_PROFILE_END();
  UG_DLOG(LIB_DISC_MULTIGRID, 4, "  end   init_rap_operator: build rap\n");
 
//  write computed level matrices for debug purpose
  for(int lev = m_baseLev; lev <= m_topLev; ++lev){
    LevData& ld = *m_vLevData[lev];
    write_debug(*ld.A, "LevelMatrix", *ld.st, *ld.st);
  }
 
  if(m_bGatheredBaseUsed)
  {
#ifdef UG_PARALLEL
    GMG_PROFILE_BEGIN(GMG_BuildRAP_CopyNoghostToGhost_GatheredBase);
    LevData& ld = *m_vLevData[m_baseLev];
    if(gathered_base_master()){
 
      if (m_bMatrixStructureIsConst)
        spGatheredBaseMat->clear_retain_structure();
      else
        spGatheredBaseMat->resize_and_clear(ld.t->size(), ld.t->size());
      copy_noghost_to_ghost(spGatheredBaseMat.template cast_dynamic<matrix_type>(), ld.A, ld.vMapPatchToGlobal);
    } else {
      spGatheredBaseMat = SmartPtr<MatrixOperator<matrix_type, vector_type> >(new MatrixOperator<matrix_type, vector_type>);
      *spGatheredBaseMat = *ld.A;
    }
    spGatheredBaseMat->set_storage_type(m_spSurfaceMat->get_storage_mask());
    spGatheredBaseMat->set_layouts(ld.t->layouts());
    GMG_PROFILE_END();
 
    GMG_PROFILE_BEGIN(GMG_BuildRAP_SendAndRevieve_GatheredBase);
    ComPol_MatAddSetZeroInnerInterfaceCouplings<matrix_type> cpMatAdd(*spGatheredBaseMat);
    m_Com.send_data(spGatheredBaseMat->layouts()->vertical_slave(), cpMatAdd);
    if(gathered_base_master())
      m_Com.receive_data(spGatheredBaseMat->layouts()->vertical_master(), cpMatAdd);
    m_Com.communicate();
    GMG_PROFILE_END();
 
    if(!gathered_base_master()){
      spGatheredBaseMat = SPNULL;
    }
#endif
  }
 
//  coarse grid contributions
  try{
    init_rap_rim_cpl();
  }
  UG_CATCH_THROW("GMG:init: Cannot init missing coarse grid coupling.");
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop init_rap_operator\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_rap_rim_cpl()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - init_rap_rim_cpl " << "\n");
 
//  clear matrices
  for(int lev = m_baseLev; lev <= m_topLev; ++lev){
    LevData& ld = *m_vLevData[lev];
    ld.RimCpl_Fine_Coarse.resize_and_clear(0,0);
    ld.RimCpl_Coarse_Fine.resize_and_clear(0,0);
  }
 
//  loop all levels to compute the missing contribution
  for(int lev = m_topLev; lev > m_LocalFullRefLevel; --lev)
  {
    LevData& lc = *m_vLevData[lev-1];
    LevData& lf = *m_vLevData[lev];
 
    lc.RimCpl_Fine_Coarse.resize_and_clear(lf.sd->size(), lc.sc->size());
    if(m_bSmoothOnSurfaceRim)
      lc.RimCpl_Coarse_Fine.resize_and_clear(lc.sd->size(), lf.sc->size());
 
    for(size_t i = 0; i< lf.vShadowing.size(); ++i)
    {
      const size_t lvlRow = lf.vShadowing[i];
      const size_t srfRow = lf.vSurfShadowing[i];
 
      typedef typename matrix_type::const_row_iterator const_row_iterator;
      const_row_iterator conn = m_spSurfaceMat->begin_row(srfRow);
      const_row_iterator connEnd = m_spSurfaceMat->end_row(srfRow);
      for( ;conn != connEnd; ++conn)
      {
        const size_t srfCol = conn.index();
 
        if(m_vSurfToLevelMap[srfCol].level == lev-1){
          const size_t lvlCol = m_vSurfToLevelMap[srfCol].index;
          (lc.RimCpl_Fine_Coarse)(lvlRow, lvlCol) = conn.value();
 
          if(m_bSmoothOnSurfaceRim){
            lc.RimCpl_Coarse_Fine(lvlCol, lvlRow) = (*m_spSurfaceMat)(srfCol, srfRow);
          }
        }
      }
    }
 
#ifdef UG_PARALLEL
    lc.RimCpl_Fine_Coarse.set_storage_type(m_spSurfaceMat->get_storage_mask());
    if(m_bSmoothOnSurfaceRim)
      lc.RimCpl_Coarse_Fine.set_storage_type(m_spSurfaceMat->get_storage_mask());
#endif
    write_debug(lc.RimCpl_Fine_Coarse, "RimCpl", *lf.sd, *lc.sc);
    if(m_bSmoothOnSurfaceRim)
      write_debug(lc.RimCpl_Coarse_Fine, "RimCpl", *lc.sd, *lf.sc);
  }
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - init_rap_rim_cpl " << "\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_transfer()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start init_transfer\n");
 
//  loop all levels
  for(int lev = m_baseLev+1; lev <= m_topLev; ++lev)
  {
    LevData& lf = *m_vLevData[lev];
    LevData& lc = *m_vLevData[lev-1];
 
  //  check if same operator for prolongation and restriction used
    bool bOneOperator = false;
    if(lf.Prolongation == lf.Restriction) bOneOperator = true;
 
    lf.Prolongation->set_levels(lc.st->grid_level(), lf.t->grid_level());
    lf.Prolongation->clear_constraints();
    for(size_t i = 0; i < m_spAss->num_constraints(); ++i){
      SmartPtr<IConstraint<TAlgebra> > pp = m_spAss->constraint(i);
      lf.Prolongation->add_constraint(pp);
    }
    lf.Prolongation->init();
 
    if(!bOneOperator){
      lf.Restriction->set_levels(lc.st->grid_level(), lf.t->grid_level());
      lf.Restriction->clear_constraints();
      for(size_t i = 0; i < m_spAss->num_constraints(); ++i){
        SmartPtr<IConstraint<TAlgebra> > pp = m_spAss->constraint(i);
        lf.Restriction->add_constraint(pp);
      }
      lf.Restriction->init();
    }
  }
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop init_transfer\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_projection()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start init_projection\n");
 
  for(int lev = m_baseLev+1; lev <= m_topLev; ++lev)
  {
    LevData& lf = *m_vLevData[lev];
    LevData& lc = *m_vLevData[lev-1];
    GridLevel gw_gl; enter_debug_writer_section(gw_gl, "ProjectionInit", lev);
    lf.Projection->set_levels(lc.st->grid_level(), lf.t->grid_level());
    lf.Projection->init();
    leave_debug_writer_section(gw_gl);
  }
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop init_projection\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_smoother()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start init_smoother\n");
 
//  Init smoother
  for(int lev = m_baseLev+1; lev <= m_topLev; ++lev)
  {
    LevData& ld = *m_vLevData[lev];
 
    UG_DLOG(LIB_DISC_MULTIGRID, 4, "  init_smoother: initializing pre-smoother on lev "<<lev<<"\n");
    bool success;
    GridLevel gw_gl; enter_debug_writer_section(gw_gl, "PreSmootherInit", lev);
    try {success = ld.PreSmoother->init(ld.A, *ld.sc);}
    UG_CATCH_THROW("GMG::init: Cannot init pre-smoother for level "<<lev);
    leave_debug_writer_section(gw_gl);
    if (!success)
      UG_THROW("GMG::init: Cannot init pre-smoother for level "<<lev);
 
    UG_DLOG(LIB_DISC_MULTIGRID, 4, "  init_smoother: initializing post-smoother on lev "<<lev<<"\n");
    if(ld.PreSmoother != ld.PostSmoother)
    {
      GridLevel gw_gl; enter_debug_writer_section(gw_gl, "PostSmootherInit", lev);
      try {success = ld.PostSmoother->init(ld.A, *ld.sc);}
      UG_CATCH_THROW("GMG::init: Cannot init post-smoother for level "<<lev);
      leave_debug_writer_section(gw_gl);
      if (!success)
        UG_THROW("GMG::init: Cannot init post-smoother for level "<<lev);
    }
  }
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop init_smoother\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_base_solver()
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start init_base_solver\n");
  LevData& ld = *m_vLevData[m_baseLev];
 
//  check, if a gathering base solver is required:
  if(m_bGatheredBaseUsed)
  {
  //  only init on gathering proc
    if(!gathered_base_master()) return;
 
  //  create layout with only v-master (v-slave do not exist on gathering proc)
  //  especially: remove h-layouts and set proc-comm to process-only
    #ifdef UG_PARALLEL
    SmartPtr<AlgebraLayouts> spOneProcLayout =
        SmartPtr<AlgebraLayouts>(new AlgebraLayouts);
    spOneProcLayout->clear();
    spOneProcLayout->vertical_master() = ld.t->layouts()->vertical_master();
    spOneProcLayout->proc_comm() = pcl::ProcessCommunicator(pcl::PCD_LOCAL);
 
    spGatheredBaseMat->set_layouts(spOneProcLayout);
    spGatheredBaseCorr->set_layouts(spOneProcLayout);
 
    ld.t->set_layouts(spOneProcLayout);
    #endif
 
  //  we init the base solver with the whole grid matrix
    if(!m_pSurfaceSol)
      *ld.t = 0;
    GridLevel gw_gl; enter_debug_writer_section(gw_gl, "GatheredBaseSolverInit", m_baseLev);
    if(!m_spBaseSolver->init(spGatheredBaseMat, *ld.t))
      UG_THROW("GMG::init: Cannot init base solver on baselevel "<< m_baseLev);
    leave_debug_writer_section(gw_gl);
  }
  else
  {
#ifdef UG_PARALLEL
    if(!ld.st->layouts()->master().empty() || !ld.st->layouts()->slave().empty())
      if(!m_spBaseSolver->supports_parallel())
        UG_THROW("GMG: Base level is distributed onto more than process, "
            "but the chosen base solver "<<m_spBaseSolver->name()<<
            " does not support parallel solving. Choose a parallel"
            " base solver or construct a situation, where a single"
            " process stores the whole base grid, to cure this issue.");
#endif
 
    if(!m_pSurfaceSol)
      *ld.st = 0;
    GridLevel gw_gl; enter_debug_writer_section(gw_gl, "BaseSolverInit", m_baseLev);
    if(!m_spBaseSolver->init(ld.A, *ld.st))
      UG_THROW("GMG::init: Cannot init base solver on baselevel "<< m_baseLev);
    leave_debug_writer_section(gw_gl);
  }
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop init_base_solver\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
template <typename TElem>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_index_mappings()
{
/*  This Method is used to create a caching the transfer between surface and
 *  level grid functions. Note, that in the adaptive case the surface grid is
 *  distributed over several levels (all elements that do not have children). But
 *  even in the full refinement case the surface level and the top level may
 *  not have the same index pattern, since a different sorting may be used (however
 *  the number of indices must be equal in the full-ref case).
 *  In every case, each surface index has a corresponding index on some level
 *  of the level grid functions. In this method this index is looked up and
 *  stored in a vector (for fast access). I.e. for every surface index i, the
 *  corresponding index in the level grid function is stored in m_vSurfToLevelMap[i]
 *  together with the level of the grid function. Using this mapping copying
 *  between surface <-> levels is implemented. Note: When Shadow-Copy are present
 *  the dof manager usually assigns the same surface index to both, shadowing and
 *  shadow-copy. Thus, there exist more than one corresponding level index for
 *  such a surface index. In this case the shadowing index is used in the mapping
 *  since this index will have the correct value at the end of the multigrid
 *  cycle and at startup the projection to the level is necessary only to shadowing,
 *  because shadows will get their value by transfer between the level. In order
 *  to get the map this way, the surface loop below is only performed on
 *  SURFACE_NONCOPY elements.
 */
 
  PeriodicBoundaryManager* pbm = m_spApproxSpace->domain()->grid()->periodic_boundary_manager();
  ConstSmartPtr<SurfaceView> spSurfView = m_spApproxSpace->surface_view();
 
  std::vector<ConstSmartPtr<DoFDistribution> > vLevelDD(m_topLev+1);
  for(int lev = m_baseLev; lev <= m_topLev; ++lev)
    vLevelDD[lev] = m_spApproxSpace->dof_distribution(GridLevel(lev, m_GridLevelType, false));
 
  ConstSmartPtr<DoFDistribution> surfDD =
      m_spApproxSpace->dof_distribution(GridLevel(m_surfaceLev, GridLevel::SURFACE));
 
//  iterators for subset
  // \todo: The loop below should only be on SURFACE_NONCOPY, since the
  //     copy-shadows have the same indices as their shadowing. In such a
  //     case the child index (shadowing) must win. This could be realized by
  //     looping only non-copy elements. But it seems, that on a process
  //     the shadow-copy may exist without its shadowing. In such a case
  //     the mapping is invalid. To fix this, the loop is extended temporarily
  //     below and doubling of appearance is checked.
  typedef typename DoFDistribution::traits<TElem>::const_iterator iter_type;
  iter_type iter = surfDD->begin<TElem>(SurfaceView::ALL);
  iter_type iterEnd = surfDD->end<TElem>(SurfaceView::ALL);
 
//  vector of indices
  std::vector<size_t> vSurfInd, vLevelInd;
 
//  loop all elements of type
  for( ; iter != iterEnd; ++iter)
  {
  //  get elem
    TElem* elem = *iter;
 
  //  ignore slave (otherwise they would appear twice in map)
    if (pbm && pbm->is_slave(elem)) continue;
 
  //  get elem level
    int level = m_spApproxSpace->domain()->grid()->get_level(elem);
 
    if (m_GridLevelType == GridLevel::SURFACE)
      level = m_topLev;
 
  //  check that coarse grid covers whole domain. If this is not the case,
  //  some surface indices are mapped to grid levels below baseLev. We
  //  do not allow that.
    if(level < m_baseLev)
      UG_THROW("GMG::init: Some index of the surface grid is located on "
          "level "<<level<<", which is below the chosen baseLev "<<
          m_baseLev<<". This is not allowed, since otherwise the "
          "gmg correction would only affect parts of the domain. Use"
          "gmg:set_base_level(lvl) to cure this issue.");
 
  //  remember minimal level, that contains a surface index on this proc
    m_LocalFullRefLevel = std::min(m_LocalFullRefLevel, level);
 
  //  extract all algebra indices for the element on surface and level
    vLevelDD[level]->inner_algebra_indices(elem, vLevelInd);
    surfDD->inner_algebra_indices(elem, vSurfInd);
    UG_ASSERT(vSurfInd.size() == vLevelInd.size(), "Number of indices does not match.");
 
  //  extract shadows
    if(m_GridLevelType == GridLevel::LEVEL) {
      if(spSurfView->surface_state(elem).contains(SurfaceView::MG_SURFACE_RIM)){
        for(size_t i = 0; i < vSurfInd.size(); ++i){
          m_vLevData[level]->vShadowing.push_back(vLevelInd[i]);
          m_vLevData[level]->vSurfShadowing.push_back(vSurfInd[i]);
        }
      }
    }
 
  //  set mapping index
    for(size_t i = 0; i < vSurfInd.size(); ++i){
      if(spSurfView->surface_state(elem).contains(SurfaceView::MG_SHADOW_RIM_COPY)
        && (level != m_topLev)) {
        if(m_GridLevelType == GridLevel::LEVEL){
          m_vSurfToLevelMap[vSurfInd[i]].indexLower = vLevelInd[i];
          m_vSurfToLevelMap[vSurfInd[i]].levelLower = level;
        }
      } else {
        m_vSurfToLevelMap[vSurfInd[i]].index = vLevelInd[i];
        m_vSurfToLevelMap[vSurfInd[i]].level = level;
        m_vLevData[level]->vSurfLevelMap.push_back(SurfLevelMap(vLevelInd[i], vSurfInd[i]));
      }
    }
  }
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_index_mappings()
{
  GMG_PROFILE_FUNC();
  ConstSmartPtr<DoFDistribution> surfDD =
      m_spApproxSpace->dof_distribution(GridLevel(m_surfaceLev, GridLevel::SURFACE));
 
  m_vSurfToLevelMap.resize(0);
  m_vSurfToLevelMap.resize(surfDD->num_indices());
  for(int lev = m_baseLev; lev <= m_topLev; ++lev){
    m_vLevData[lev]->vShadowing.clear();
    m_vLevData[lev]->vSurfShadowing.clear();
    m_vLevData[lev]->vSurfLevelMap.clear();
  }
  m_LocalFullRefLevel = std::numeric_limits<int>::max();
 
  if(surfDD->max_dofs(VERTEX)) init_index_mappings<Vertex>();
  if(surfDD->max_dofs(EDGE))   init_index_mappings<Edge>();
  if(surfDD->max_dofs(FACE))   init_index_mappings<Face>();
  if(surfDD->max_dofs(VOLUME)) init_index_mappings<Volume>();
 
  if(m_baseLev > m_LocalFullRefLevel)
    UG_THROW("GMG: Base level "<<m_baseLev<<" does not cover whole grid. "
             <<"Highest full-ref level is "<<m_LocalFullRefLevel);
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
template <typename TElem>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_noghost_to_ghost_mapping(  std::vector<size_t>& vNoGhostToGhostMap,
                ConstSmartPtr<DoFDistribution> spNoGhostDD,
                ConstSmartPtr<DoFDistribution> spGhostDD)
{
  typedef typename DoFDistribution::traits<TElem>::const_iterator iter_type;
  iter_type iter = spNoGhostDD->begin<TElem>();
  iter_type iterEnd = spNoGhostDD->end<TElem>();
 
//  vector of indices
  std::vector<size_t> vGhostInd, vNoGhostInd;
 
//  loop all elements of type
  for( ; iter != iterEnd; ++iter){
  //  get elem
    TElem* elem = *iter;
 
  //  extract all algebra indices for the element
      spGhostDD->inner_algebra_indices(elem, vGhostInd);
    spNoGhostDD->inner_algebra_indices(elem, vNoGhostInd);
    UG_ASSERT(vGhostInd.size() == vNoGhostInd.size(), "Number of indices does not match.");
 
  //  set mapping index
    for(size_t i = 0; i < vNoGhostInd.size(); ++i){
      vNoGhostToGhostMap[vNoGhostInd[i]] = vGhostInd[i];
    }
  }
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_noghost_to_ghost_mapping(int lev)
{
  GMG_PROFILE_FUNC();
 
  LevData& ld = *m_vLevData[lev];
  std::vector<size_t>& vMapPatchToGlobal = ld.vMapPatchToGlobal;
  vMapPatchToGlobal.resize(0);
 
  ConstSmartPtr<DoFDistribution> spNoGhostDD = ld.st->dd();
  ConstSmartPtr<DoFDistribution> spGhostDD = ld.t->dd();
 
  if(spNoGhostDD == spGhostDD) return;
 
  vMapPatchToGlobal.resize(spNoGhostDD->num_indices());
 
  if(spNoGhostDD->max_dofs(VERTEX)) init_noghost_to_ghost_mapping<Vertex>(vMapPatchToGlobal, spNoGhostDD, spGhostDD);
  if(spNoGhostDD->max_dofs(EDGE))   init_noghost_to_ghost_mapping<Edge>(vMapPatchToGlobal, spNoGhostDD, spGhostDD);
  if(spNoGhostDD->max_dofs(FACE))   init_noghost_to_ghost_mapping<Face>(vMapPatchToGlobal, spNoGhostDD, spGhostDD);
  if(spNoGhostDD->max_dofs(VOLUME)) init_noghost_to_ghost_mapping<Volume>(vMapPatchToGlobal, spNoGhostDD, spGhostDD);
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
copy_ghost_to_noghost(SmartPtr<GF> spVecTo,
                      ConstSmartPtr<GF> spVecFrom,
                      const std::vector<size_t>& vMapPatchToGlobal)
{
  GMG_PROFILE_FUNC();
 
  if(spVecTo == spVecFrom)
    UG_THROW("GMG::copy_ghost_to_noghost: Should not be called on equal GF.");
 
  if(spVecTo->dd() == spVecFrom->dd())
  {
    for(size_t i = 0; i < spVecTo->size(); ++i)
      (*spVecTo)[i] = (*spVecFrom)[i];
  }
  else
  {
    UG_ASSERT(vMapPatchToGlobal.size() == spVecTo->size(),
          "Mapping range ("<<vMapPatchToGlobal.size()<<") != "
          "To-Vec-Size ("<<spVecTo->size()<<")");
 
    for(size_t i = 0; i < vMapPatchToGlobal.size(); ++i)
      (*spVecTo)[i] = (*spVecFrom)[ vMapPatchToGlobal[i] ];
  }
 
  #ifdef UG_PARALLEL
  spVecTo->set_storage_type(spVecFrom->get_storage_mask());
  #endif
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
copy_noghost_to_ghost(SmartPtr<GF> spVecTo,
                      ConstSmartPtr<GF> spVecFrom,
                      const std::vector<size_t>& vMapPatchToGlobal)
{
  GMG_PROFILE_FUNC();
 
  if(spVecTo == spVecFrom)
    UG_THROW("GMG::copy_noghost_to_ghost: Should not be called on equal GF.");
 
  if(spVecTo->dd() == spVecFrom->dd())
  {
    for(size_t i = 0; i < spVecTo->size(); ++i)
      (*spVecTo)[i] = (*spVecFrom)[i];
  }
  else
  {
    UG_ASSERT(vMapPatchToGlobal.size() == spVecFrom->size(),
          "Mapping domain ("<<vMapPatchToGlobal.size()<<") != "
          "From-Vec-Size ("<<spVecFrom->size()<<")");
 
    for(size_t i = 0; i < vMapPatchToGlobal.size(); ++i)
      (*spVecTo)[ vMapPatchToGlobal[i] ] = (*spVecFrom)[i];
  }
  #ifdef UG_PARALLEL
  spVecTo->set_storage_type(spVecFrom->get_storage_mask());
  #endif
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
copy_noghost_to_ghost(SmartPtr<matrix_type> spMatTo,
                      ConstSmartPtr<matrix_type> spMatFrom,
                      const std::vector<size_t>& vMapPatchToGlobal)
{
  GMG_PROFILE_FUNC();
  UG_ASSERT(vMapPatchToGlobal.size() == spMatFrom->num_rows(),
        "Mapping domain ("<<vMapPatchToGlobal.size()<<") != "
        "From-Mat-Num-Rows ("<<spMatFrom->num_rows()<<")");
  UG_ASSERT(vMapPatchToGlobal.size() == spMatFrom->num_cols(),
        "Mapping domain ("<<vMapPatchToGlobal.size()<<") != "
        "From-Mat-Num-Cols ("<<spMatFrom->num_cols()<<")");
 
  for(size_t noghostFrom = 0; noghostFrom < vMapPatchToGlobal.size(); ++noghostFrom)
  {
    typedef typename matrix_type::const_row_iterator row_iter;
    row_iter conn = spMatFrom->begin_row(noghostFrom);
    row_iter connEnd = spMatFrom->end_row(noghostFrom);
    for(; conn != connEnd; ++conn)
    {
      const typename matrix_type::value_type& block = conn.value();
      size_t noghostTo = conn.index();
 
      (*spMatTo)(vMapPatchToGlobal[noghostFrom], vMapPatchToGlobal[noghostTo])
          = block;
    }
  }
 
  #ifdef UG_PARALLEL
  spMatTo->set_storage_type(spMatFrom->get_storage_mask());
  #endif
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
// Init Level Data
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
init_level_memory(int baseLev, int topLev)
{
  GMG_PROFILE_FUNC();
 
  m_vLevData.resize(0);
  m_vLevData.resize(topLev+1);
 
  for(int lev = baseLev; lev <= topLev; ++lev)
  {
    m_vLevData[lev] = SmartPtr<LevData>(new LevData);
    LevData& ld = *m_vLevData[lev];
 
    GridLevel gl = GridLevel(lev, m_GridLevelType, false);
    ld.sc = SmartPtr<GF>(new GF(m_spApproxSpace, gl, false));
    ld.sd = SmartPtr<GF>(new GF(m_spApproxSpace, gl, false));
    ld.st = SmartPtr<GF>(new GF(m_spApproxSpace, gl, false));
 
    // TODO: all procs must call this, since a MPI-Group is created.
    //     Think about optimizing this
    #ifdef UG_PARALLEL
    GridLevel glGhosts = GridLevel(lev, m_GridLevelType, true);
    ld.t = SmartPtr<GF>(new GF(m_spApproxSpace, glGhosts, false));
    if( ld.t->layouts()->vertical_slave().empty() &&
      ld.t->layouts()->vertical_master().empty())
    #endif
    {
      ld.t = ld.st;
    }
 
    ld.A = SmartPtr<MatrixOperator<matrix_type, vector_type> >(
        new MatrixOperator<matrix_type, vector_type>);
 
    ld.PreSmoother = m_spPreSmootherPrototype->clone();
    if(m_spPreSmootherPrototype == m_spPostSmootherPrototype)
      ld.PostSmoother = ld.PreSmoother;
    else
      ld.PostSmoother = m_spPostSmootherPrototype->clone();
 
    // let the smoothers know the grid level they are on if they need to know
    ILevelPreconditioner<TAlgebra>* lpre = dynamic_cast<ILevelPreconditioner<TAlgebra>*>(ld.PreSmoother.get());
    ILevelPreconditioner<TAlgebra>* lpost = dynamic_cast<ILevelPreconditioner<TAlgebra>*>(ld.PostSmoother.get());
    if (lpre) lpre->set_grid_level(gl);
    if (lpost) lpost->set_grid_level(gl);
 
    ld.Projection = m_spProjectionPrototype->clone();
 
    ld.Prolongation = m_spProlongationPrototype->clone();
    if(m_spProlongationPrototype == m_spRestrictionPrototype)
      ld.Restriction = ld.Prolongation;
    else
      ld.Restriction = m_spRestrictionPrototype->clone();
 
    init_noghost_to_ghost_mapping(lev);
  }
 
  bool bHasVertMaster = false;
  bool bHasVertSlave = false;
  bool bHasHorrMaster = false;
  bool bHasHorrSlave = false;
  #ifdef UG_PARALLEL
  LevData& ld = *m_vLevData[baseLev];
  if( !ld.t->layouts()->vertical_master().empty()) bHasVertMaster = true;
  if( !ld.t->layouts()->vertical_slave().empty()) bHasVertSlave = true;
  if( !ld.t->layouts()->master().empty()) bHasHorrMaster = true;
  if( !ld.t->layouts()->slave().empty()) bHasHorrSlave = true;
  #endif
  bool bHasVertConn = bHasVertMaster || bHasVertSlave;
  bool bHasHorrConn = bHasHorrMaster || bHasHorrSlave;
 
  m_bGatheredBaseUsed = m_bGatheredBaseIfAmbiguous;
 
//  if no vert-interfaces are present (especially in serial or on a proc that
//  does not have parts of the base level), we cannot gather. In this case we
//  overrule the choice of the user
//  Note: levels not containing any dof, are skipped from computation anyway
  if(!bHasVertConn) m_bGatheredBaseUsed = false;
 
//  check if parallel solver is available, if not, try to use gathered
  if(!m_bGatheredBaseUsed
    && bHasHorrConn
    && !m_spBaseSolver->supports_parallel())
  {
    if(!bHasVertConn)
      UG_THROW("GMG: base level distributed in parallel, without possibility"
          " to gather on one process, but chosen base solver is not"
          " parallel. Choose a parallel base solver.")
 
    m_bGatheredBaseUsed = true;
  }
 
//  check if gathering base solver possible: If some horizontal layouts are
//  given, we know, that still the grid is distributed. But, if no
//  vertical layouts are present in addition, we can not gather the vectors
//  to on proc.
  if(m_bGatheredBaseUsed){
    if(bHasVertMaster && bHasVertSlave)
      UG_THROW("GMG: Gathered base solver expects one proc to have all "
          "v-masters and no v-slaves. Use gmg:set_gathered_base_solver_if_ambiguous(false)"
          " to avoid this error.");
 
    if(!bHasVertConn && bHasHorrConn){
      UG_THROW("GMG: Base level distributed among processes and no possibility"
          " of gathering (vert. interfaces) present, but a gathering"
          " base solving is required. Use gmg:set_gathered_base_solver_if_ambiguous(false)"
          " to avoid this error.");
    }
 
#ifdef UG_PARALLEL
    if(bHasVertSlave && (ld.t->layouts()->vertical_slave().num_interfaces() != 1))
      UG_THROW("GMG: Gathered base solver expects a v-slave containing "
          "process to send all its values to exactly on master. But "
          "more then one master detected. Use gmg:set_gathered_base_solver_if_ambiguous(false)"
          " to avoid this error.");
 
    if(bHasVertSlave && (ld.t->layouts()->vertical_slave().num_interface_elements() != ld.t->size()))
      UG_THROW("GMG: Gathered base solver expects that all indices "
          "are sent to exactly one master. But not all indices are "
          "v-slaves. Use gmg:set_gathered_base_solver_if_ambiguous(false)"
          " to avoid this error.");
#endif
  }
 
  if(m_bGatheredBaseUsed && gathered_base_master()){
    // note: we can safely call this here, since the dd has already been
    //    created in the level loop
    GridLevel glGhosts = GridLevel(baseLev, m_GridLevelType, true);
    spGatheredBaseCorr = SmartPtr<GF>(new GF(m_spApproxSpace, glGhosts, false));
 
    spGatheredBaseMat = SmartPtr<MatrixOperator<matrix_type, vector_type> >(
                new MatrixOperator<matrix_type, vector_type>);
  } else {
    spGatheredBaseCorr = SPNULL;
    spGatheredBaseMat = SPNULL;
  }
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
bool AssembledMultiGridCycle<TDomain, TAlgebra>::
gathered_base_master() const
{
  if(!m_bGatheredBaseUsed)
    UG_THROW("GMG: Should only be called when gather-base solver used.")
 
  #ifdef UG_PARALLEL
  if(!m_vLevData[m_baseLev]->t->layouts()->vertical_master().empty())
    return true;
  #endif
 
  return false;
}
bool AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
 
// Cycle - Methods
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
presmooth_and_restriction(int lev)
{
  GMG_PROFILE_FUNC();
  LevData& lf = *m_vLevData[lev];
  LevData& lc = *m_vLevData[lev-1];
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - presmooth on level "<<lev<<"\n");
  log_debug_data(lev, lf.n_restr_calls, "BeforePreSmooth");
  mg_stats_defect(*lf.sd, lev, mg_stats_type::BEFORE_PRE_SMOOTH);
 
//  PRESMOOTH
  GMG_PROFILE_BEGIN(GMG_PreSmooth);
  try{
  //  smooth several times
    for(int nu = 0; nu < m_numPreSmooth; ++nu)
    {
    //  a)  Compute t = B*d with some iterator B
      GridLevel gw_gl; enter_debug_writer_section(gw_gl, "PreSmoother", lev, lf.n_pre_calls, nu);
      if(!lf.PreSmoother->apply(*lf.st, *lf.sd))
        UG_THROW("GMG: Smoothing step "<<nu+1<<" on level "<<lev<<" failed.");
      leave_debug_writer_section(gw_gl);
 
    //  b) handle patch rim.
      if(!m_bSmoothOnSurfaceRim){
        const std::vector<size_t>& vShadowing = lf.vShadowing;
        for(size_t i = 0; i < vShadowing.size(); ++i)
          (*lf.st)[ vShadowing[i] ] = 0.0;
      } else {
        if(lev > m_LocalFullRefLevel)
          lc.RimCpl_Coarse_Fine.matmul_minus(*lc.sd, *lf.st);
        // make sure each lc.sd has the same PST
        // (if m_LocalFullRefLevel not equal on every proc)
        #ifdef UG_PARALLEL
        else
          lc.sd->set_storage_type(PST_ADDITIVE);
        #endif
      }
 
    //  c) update the defect with this correction ...
      lf.A->apply_sub(*lf.sd, *lf.st);
 
    //  d) ... and add the correction to the overall correction
      if(nu < m_numPreSmooth-1)
        (*lf.sc) += (*lf.st);
    }
  }
  UG_CATCH_THROW("GMG: Pre-Smoothing on level "<<lev<<" failed.");
  lf.n_pre_calls++;
  GMG_PROFILE_END();
 
  log_debug_data(lev, lf.n_restr_calls, "AfterPreSmooth_BeforeCom");
  mg_stats_defect(*lf.sd, lev, mg_stats_type::AFTER_PRE_SMOOTH);
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - presmooth on level "<<lev<<"\n");
 
//  PARALLEL CASE:
  SmartPtr<GF> spD = lf.sd;
  #ifdef UG_PARALLEL
  ComPol_VecAddSetZero<vector_type> cpVecAdd(lf.t.get());
  if( !lf.t->layouts()->vertical_slave().empty() ||
    !lf.t->layouts()->vertical_master().empty())
  {
    //  v-slaves indicate, that part of the parent are stored on a different proc.
    //  Thus the values of the defect must be transfered to the v-masters and will
    //  have their parents on the proc of the master and must be restricted on
    //  that process. Thus we have to transfer the defect (currently stored
    //  additive in the noghost-vectors) to the v-masters. And have to make sure
    //  that d is additive after this operation. We do that by ensuring that it
    //  is additive-unique regarding v-masters and v-slaves (v-slaves will be set to 0).
    //  We use a temporary vector including ghost, such that the no-ghost defect
    //  remains valid and can be used when the cycle comes back to this level.
 
    GMG_PROFILE_BEGIN(GMG_Restrict_CopyNoghostToGhost);
    SetLayoutValues(&(*lf.t), lf.t->layouts()->vertical_master(), 0);
    copy_noghost_to_ghost(lf.t, lf.sd, lf.vMapPatchToGlobal);
    GMG_PROFILE_END();
 
    GMG_PROFILE_BEGIN(GMG_Restrict_CollectAndSend);
    m_Com.send_data(lf.t->layouts()->vertical_slave(), cpVecAdd);
    m_Com.receive_data(lf.t->layouts()->vertical_master(), cpVecAdd);
    m_Com.communicate_and_resume();
    GMG_PROFILE_END();
    if(!m_bCommCompOverlap){
      GMG_PROFILE_BEGIN(GMG_Restrict_RecieveAndExtract_NoOverlap);
      m_Com.wait();
      GMG_PROFILE_END();
    }
 
    spD = lf.t;
  }
  #endif
 
  GMG_PROFILE_BEGIN(GMG_Restrict_OverlapedComputation);
//  reset corr on coarse level
  lc.sc->set(0.0);
 
//  update last correction
  if(m_numPreSmooth > 0)
    (*lf.sc) += (*lf.st);
  GMG_PROFILE_END();
 
  #ifdef UG_PARALLEL
  if(m_bCommCompOverlap){
    GMG_PROFILE_BEGIN(GMG_Restrict_RecieveAndExtract_WithOverlap);
    m_Com.wait();
    GMG_PROFILE_END();
  }
  #endif
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - restriction on level "<<lev<<"\n");
  log_debug_data(lev, lf.n_restr_calls, "BeforeRestrict");
 
//  RESTRICTION:
  GridLevel gw_gl; enter_debug_writer_section(gw_gl, "Restriction", lev, lf.n_restr_calls);
  GMG_PROFILE_BEGIN(GMG_Restrict_Transfer);
  try{
    lf.Restriction->do_restrict(*lc.sd, *spD);
  }
  UG_CATCH_THROW("GMG: Restriction from lev "<<lev<<" to "<<lev-1<<" failed.");
  GMG_PROFILE_END();
 
//  apply post processes
  GMG_PROFILE_BEGIN(GMG_Restrict_PostProcess);
  for(size_t i = 0; i < m_vspRestrictionPostProcess.size(); ++i)
    m_vspRestrictionPostProcess[i]->post_process(lc.sd);
  GMG_PROFILE_END();
  leave_debug_writer_section(gw_gl);
  lf.n_restr_calls++;
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - restriction on level "<<lev<<"\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
prolongation_and_postsmooth(int lev)
{
  GMG_PROFILE_FUNC();
  LevData& lf = *m_vLevData[lev];
  LevData& lc = *m_vLevData[lev-1];
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - prolongation on level "<<lev<<"\n");
  log_debug_data(lev, lf.n_prolong_calls, "BeforeProlong");
 
//  ADAPTIVE CASE:
  if(lev > m_LocalFullRefLevel)
  {
    //  write computed correction to surface
    GMG_PROFILE_BEGIN(GMG_AddCorrectionToSurface);
    try{
      const std::vector<SurfLevelMap>& vMap = lc.vSurfLevelMap;
      for(size_t i = 0; i < vMap.size(); ++i){
        (*m_pC)[vMap[i].surfIndex] += (*lc.sc)[vMap[i].levIndex];
      }
    }
    UG_CATCH_THROW("GMG::lmgc: Cannot add to surface.");
    GMG_PROFILE_END();
 
    //  in the adaptive case there is a small part of the coarse coupling that
    //  has not been used to update the defect. In order to ensure, that the
    //  defect on this level still corresponds to the updated defect, we need
    //  to add it here.
    GMG_PROFILE_BEGIN(GMG_UpdateRimDefect);
    lc.RimCpl_Fine_Coarse.matmul_minus(*lf.sd, *lc.sc);
    GMG_PROFILE_END();
  }
  log_debug_data(lev, lf.n_prolong_calls, "AfterCoarseGridDefect");
 
//  PROLONGATE:
  GridLevel gw_gl; enter_debug_writer_section(gw_gl, "Prolongation", lev, lf.n_prolong_calls);
  SmartPtr<GF> spT = lf.st;
  #ifdef UG_PARALLEL
  if( !lf.t->layouts()->vertical_slave().empty() ||
    !lf.t->layouts()->vertical_master().empty())
  {
    spT = lf.t;
  }
  #endif
  GMG_PROFILE_BEGIN(GMG_Prolongate_Transfer);
  try{
    lf.Prolongation->prolongate(*spT, *lc.sc);
  }
  UG_CATCH_THROW("GMG: Prolongation from lev "<<lev-1<<" to "<<lev<<" failed.");
  GMG_PROFILE_END();
 
//  PARALLEL CASE:
#ifdef UG_PARALLEL
  if( !lf.t->layouts()->vertical_slave().empty() ||
    !lf.t->layouts()->vertical_master().empty())
  {
    UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - copy_to_vertical_slaves\n");
 
    //  Receive values of correction for vertical slaves:
    //  If there are vertical slaves/masters on the coarser level, we now copy
    //  the correction values from the v-master DoFs to the v-slave DoFs.
    GMG_PROFILE_BEGIN(GMG_Prolongate_SendAndRecieve);
    ComPol_VecCopy<vector_type> cpVecCopy(lf.t.get());
    m_Com.receive_data(lf.t->layouts()->vertical_slave(), cpVecCopy);
    m_Com.send_data(lf.t->layouts()->vertical_master(), cpVecCopy);
    m_Com.communicate();
    GMG_PROFILE_END();
 
    GMG_PROFILE_BEGIN(GMG_Prolongate_GhostToNoghost);
    copy_ghost_to_noghost(lf.st, lf.t, lf.vMapPatchToGlobal);
    GMG_PROFILE_END();
 
    UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - copy_to_vertical_slaves\n");
  }
#endif
 
//  apply post processes
  GMG_PROFILE_BEGIN(GMG_Prolongate_PostProcess);
  for(size_t i = 0; i < m_vspProlongationPostProcess.size(); ++i)
    m_vspProlongationPostProcess[i]->post_process(lf.st);
  GMG_PROFILE_END();
  
  leave_debug_writer_section(gw_gl);
 
//  add coarse grid correction: c := c + t
  GMG_PROFILE_BEGIN(GMG_AddCoarseGridCorrection);
  (*lf.sc) += (*lf.st);
  GMG_PROFILE_END();
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - prolongation on level "<<lev<<"\n");
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - postsmooth on level "<<lev<<"\n");
  // log_debug_data(lev, lf.n_prolong_calls, "BeforePostSmooth");
 
//  POST-SMOOTH:
  GMG_PROFILE_BEGIN(GMG_PostSmooth);
  try{
  //  smooth several times
    for(int nu = 0; nu < m_numPostSmooth; ++nu)
    {
    //  update defect
      lf.A->apply_sub(*lf.sd, *lf.st);
 
      if(nu == 0){
        log_debug_data(lev, lf.n_prolong_calls, "BeforePostSmooth");
        mg_stats_defect(*lf.sd, lev, mg_stats_type::BEFORE_POST_SMOOTH);
      }
 
    //  a)  Compute t = B*d with some iterator B
      GridLevel gw_gl; enter_debug_writer_section(gw_gl, "PostSmoother", lev, lf.n_post_calls, nu);
      if(!lf.PostSmoother->apply(*lf.st, *lf.sd))
        UG_THROW("GMG: Smoothing step "<<nu+1<<" on level "<<lev<<" failed.");
      leave_debug_writer_section(gw_gl);
 
    //  b) handle patch rim
      if(!m_bSmoothOnSurfaceRim){
        const std::vector<size_t>& vShadowing = lf.vShadowing;
        for(size_t i = 0; i < vShadowing.size(); ++i)
          (*lf.st)[ vShadowing[i] ] = 0.0;
      } else {
        if(lev > m_LocalFullRefLevel)
          lc.RimCpl_Coarse_Fine.matmul_minus(*lc.sd, *lf.st);
      }
 
    //  d) ... and add the correction to the overall correction
      (*lf.sc) += (*lf.st);
    }
  }
  UG_CATCH_THROW("GMG: Post-Smoothing on level "<<lev<<" failed. ")
  GMG_PROFILE_END();
  lf.n_post_calls++;
 
//  update the defect if required. In full-ref case, the defect is not needed
//  anymore, since it will be restricted anyway. For adaptive case, however,
//  we must keep track of the defect on the surface.
//  We also need it if we want to write stats or debug data
  if(lev >= m_LocalFullRefLevel || m_mgstats.valid() || m_spDebugWriter.valid()){
    GMG_PROFILE_BEGIN(GMG_UpdateDefectAfterPostSmooth);
    lf.A->apply_sub(*lf.sd, *lf.st);
    GMG_PROFILE_END();
  }
 
  log_debug_data(lev, lf.n_prolong_calls, "AfterPostSmooth");
  mg_stats_defect(*lf.sd, lev, mg_stats_type::AFTER_POST_SMOOTH);
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - postsmooth on level "<<lev<<"\n");
  lf.n_prolong_calls++;
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
// performs the base solving
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
base_solve(int lev)
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - base_solve on level "<<lev<<"\n");
 
  try{
  LevData& ld = *m_vLevData[lev];
 
  log_debug_data(lev, ld.n_base_calls, "BeforeBaseSolver");
  
//  SOLVE BASE PROBLEM
//  Here we distinguish two possibilities:
//  a) The coarse grid problem is solved in parallel, using a parallel solver
//  b) First all vectors are gathered to one process, solved on this one
//     process and then again distributed
 
//  CASE a): We solve the problem in parallel (or normally for sequential code)
  if(!m_bGatheredBaseUsed)
  {
    UG_DLOG(LIB_DISC_MULTIGRID, 3, " GMG: entering distributed basesolver branch.\n");
 
    GMG_PROFILE_BEGIN(GMG_BaseSolver_Apply);
    GridLevel gw_gl; enter_debug_writer_section(gw_gl, "GatheredBaseSolver", lev, ld.n_base_calls);
    try{
      if(!m_spBaseSolver->apply(*ld.sc, *ld.sd))
        UG_THROW("GMG::lmgc: Base solver on base level "<<lev<<" failed.");
    }
    UG_CATCH_THROW("GMG: BaseSolver::apply failed. (case: a).")
    leave_debug_writer_section(gw_gl);
    GMG_PROFILE_END();
 
    UG_DLOG(LIB_DISC_MULTIGRID, 3, " GMG: exiting distributed basesolver branch.\n");
  }
 
//  CASE b): We gather the processes, solve on one proc and distribute again
  else
  {
    UG_DLOG(LIB_DISC_MULTIGRID, 3, " GMG: entering gathered basesolver branch.\n");
 
  //  gather the defect
    #ifdef UG_PARALLEL
    if( !ld.t->layouts()->vertical_slave().empty() ||
      !ld.t->layouts()->vertical_master().empty())
    {
      GMG_PROFILE_BEGIN(GMG_GatheredBaseSolver_Defect_CopyNoghostToGhost);
      SetLayoutValues(&(*ld.t), ld.t->layouts()->vertical_master(), 0);
      copy_noghost_to_ghost(ld.t, ld.sd, ld.vMapPatchToGlobal);
      GMG_PROFILE_END();
 
      GMG_PROFILE_BEGIN(GMG_GatheredBaseSolver_Defect_SendAndRecieve);
      ComPol_VecAddSetZero<vector_type> cpVecAdd(ld.t.get());
      m_Com.send_data(ld.t->layouts()->vertical_slave(), cpVecAdd);
      m_Com.receive_data(ld.t->layouts()->vertical_master(), cpVecAdd);
      m_Com.communicate();
      GMG_PROFILE_END();
    }
    #endif
 
  //  only solve on gathering master
    if(gathered_base_master())
    {
      UG_DLOG(LIB_DISC_MULTIGRID, 3, " GMG: Start serial base solver.\n");
      GMG_PROFILE_BEGIN(GMG_GatheredBaseSolver_Apply);
 
    //  Reset correction
      spGatheredBaseCorr->set(0.0);
 
    //  compute coarse correction
      GridLevel gw_gl; enter_debug_writer_section(gw_gl, "BaseSolver", lev, ld.n_base_calls);
      try{
        if(!m_spBaseSolver->apply(*spGatheredBaseCorr, *ld.t))
          UG_THROW("GMG::lmgc: Base solver on base level "<<lev<<" failed.");
      }
      UG_CATCH_THROW("GMG: BaseSolver::apply failed. (case: b).")
      leave_debug_writer_section(gw_gl);
 
      GMG_PROFILE_END();
      UG_DLOG(LIB_DISC_MULTIGRID, 3, " GMG gathered base solver done.\n");
    }
 
  //  broadcast the correction
    #ifdef UG_PARALLEL
    SmartPtr<GF> spC = ld.sc;
    if(gathered_base_master()) spC = spGatheredBaseCorr;
 
    GMG_PROFILE_BEGIN(GMG_GatheredBaseSolver_Correction_SendAndRecieve);
    ComPol_VecCopy<vector_type> cpVecCopy(spC.get());
    m_Com.send_data(spC->layouts()->vertical_master(), cpVecCopy);
    m_Com.receive_data(spC->layouts()->vertical_slave(), cpVecCopy);
    m_Com.communicate();
    GMG_PROFILE_END();
    if(gathered_base_master()){
      GMG_PROFILE_BEGIN(GMG_GatheredBaseSolver_Correction_CopyGhostToNoghost);
      spGatheredBaseCorr->set_storage_type(PST_CONSISTENT);
      copy_ghost_to_noghost(ld.sc, spGatheredBaseCorr, ld.vMapPatchToGlobal);
      GMG_PROFILE_END();
    } else {
      ld.sc->set_storage_type(PST_CONSISTENT);
    }
    #endif
    UG_DLOG(LIB_DISC_MULTIGRID, 3, " GMG: exiting gathered basesolver branch.\n");
  }
 
//  update the defect if required. In full-ref case, the defect is not needed
//  anymore, since it will be restricted anyway. For adaptive case, however,
//  we must keep track of the defect on the surface
  if(lev >= m_LocalFullRefLevel){
    GMG_PROFILE_BEGIN(GMG_UpdateDefectAfterBaseSolver);
    ld.A->apply_sub(*ld.sd, *ld.sc);
    GMG_PROFILE_END();
  }
 
  log_debug_data(lev, ld.n_base_calls, "AfterBaseSolver");
  ld.n_base_calls++;
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - base_solve on level "<<lev<<"\n");
  }
  UG_CATCH_THROW("GMG: Base Solver failed.");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
// performs a  multi grid cycle on the level
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
lmgc(int lev, int cycleType)
{
  GMG_PROFILE_FUNC();
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-start - lmgc on level "<<lev<<"\n");
 
//  check if already base level
  if(lev == m_baseLev) {
    base_solve(m_topLev);
    return;
  } else if(lev < m_baseLev){
    UG_THROW("GMG::lmgc: call lmgc only for lev > baseLev.");
  }
 
//  presmooth and restrict
  try{
    presmooth_and_restriction(lev);
  }
  UG_CATCH_THROW("GMG::lmgc: presmooth-restriction failed on level "<<lev);
 
  try{
//  on base level, invert only once
  if(lev-1 == m_baseLev) {
    base_solve(lev-1);
  }
//  F-cycle: one F-cycle on lev-1, followed by a V-cycle
  else if(cycleType == _F_){
    lmgc(lev-1, _F_);
    lmgc(lev-1, _V_);
  }
//  V- or W- cycle, or gamma > 2
  else {
    for(int i = 0; i < cycleType; ++i)
      lmgc(lev-1, cycleType);
  }
  }
  UG_CATCH_THROW("GMG::lmgc: Linear multi-grid cycle on level "<<lev-1<<
           " failed. (BaseLev="<<m_baseLev<<", TopLev="<<m_topLev<<").");
 
//  prolongate, add coarse-grid correction and postsmooth
  try{
    prolongation_and_postsmooth(lev);
  }
  UG_CATCH_THROW("GMG::lmgc: prolongation-postsmooth failed on level "<<lev);
 
  UG_DLOG(LIB_DISC_MULTIGRID, 3, "gmg-stop - lmgc on level "<<lev<<"\n");
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
// Debug Methods
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
write_debug(ConstSmartPtr<GF> spGF, std::string name, int cycleNo)
{
  write_debug(*spGF, name, cycleNo);
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
write_debug(const GF& rGF, std::string name, int cycleNo)
{
  PROFILE_FUNC_GROUP("debug");
 
  if(m_spDebugWriter.invalid()) return;
 
//  build name
  GridLevel gl = rGF.grid_level();
  std::stringstream ss;
  ss << "GMG_" << name << GridLevelAppendix(gl);
  ss << "_i" << std::setfill('0') << std::setw(3) << m_dbgIterCnt;
  if (cycleNo >= 0) ss << "_cycle" << std::setfill('0') << std::setw(3) << cycleNo;
  ss << ".vec";
 
//  write
  GridLevel currGL = m_spDebugWriter->grid_level();
  m_spDebugWriter->set_grid_level(gl);
  m_spDebugWriter->write_vector(rGF, ss.str().c_str());
  m_spDebugWriter->set_grid_level(currGL);
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
write_debug(const matrix_type& mat, std::string name, const GF& rTo, const GF& rFrom)
{
  GridLevel glFrom = rFrom.grid_level();
  GridLevel glTo = rTo.grid_level();
  write_debug(mat, name, glTo, glFrom);
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
write_debug(const matrix_type& mat, std::string name, const GridLevel& glTo, const GridLevel& glFrom)
{
  PROFILE_FUNC_GROUP("debug");
 
  if(m_spDebugWriter.invalid()) return;
 
//  build name
  std::stringstream ss;
  ss << "GMG_" << name << GridLevelAppendix(glTo);
  if(glFrom != glTo) ss << GridLevelAppendix(glFrom);
  ss << ".mat";
 
//  write
  GridLevel currGL = m_spDebugWriter->grid_level();
  m_spDebugWriter->set_grid_levels(glFrom, glTo);
  m_spDebugWriter->write_matrix(mat, ss.str().c_str());
  m_spDebugWriter->set_grid_level(currGL);
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
inline void AssembledMultiGridCycle<TDomain, TAlgebra>::
enter_debug_writer_section(GridLevel& dw_orig_gl, const char * sec_name, int lev, int cycleNo, int callNo)
{
  PROFILE_FUNC_GROUP("debug");
 
  if(m_spDebugWriter.invalid()) return;
  
  dw_orig_gl = m_spDebugWriter->grid_level();
  m_spDebugWriter->set_grid_level(m_vLevData[lev]->sd->grid_level());
  
  std::stringstream ss;
  ss << "GMG_" << sec_name;
  ss << "_i" << std::setfill('0') << std::setw(3) << m_dbgIterCnt;
  if (cycleNo >= 0) ss << "_cycle" << std::setfill('0') << std::setw(3) << cycleNo;
  ss << "_l" << lev;
  if (callNo >= 0) ss << "_call" << std::setfill('0') << std::setw(3) << callNo;
  m_spDebugWriter->enter_section(ss.str().c_str());
}
inline void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
inline void AssembledMultiGridCycle<TDomain, TAlgebra>::
leave_debug_writer_section(GridLevel& dw_orig_gl)
{
  if(m_spDebugWriter.invalid()) return;
  m_spDebugWriter->leave_section();
  m_spDebugWriter->set_grid_level(dw_orig_gl);
}
inline void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
log_debug_data(int lvl, int cycleNo, std::string name)
{
  if(m_spDebugWriter.valid()){
    std::string defName("Def_"); defName.append(name);
    std::string curName("Cor_"); curName.append(name);
    write_debug(m_vLevData[lvl]->sd, defName, cycleNo);
    write_debug(m_vLevData[lvl]->sc, curName, cycleNo);
  }
 
  const bool bEnableSerialNorm = false;
  const bool bEnableParallelNorm = false;
 
  if(!bEnableSerialNorm && !bEnableParallelNorm) return;
 
  std::string prefix;
  if(lvl < (int)m_vLevData.size())
    prefix.assign(2 + 2 * (m_vLevData.size() - lvl), ' ');
  prefix.append(name).append(" on lev ").append(ToString(lvl)).append(": ");
 
  LevData& ld = *m_vLevData[lvl];
  if(bEnableSerialNorm){
    UG_LOG(prefix << "local sd norm: " << sqrt(VecProd(*ld.sd, *ld.sd)) << std::endl);
    UG_LOG(prefix << "local sc norm: " << sqrt(VecProd(*ld.sc, *ld.sc)) << std::endl);
  }
  if(bEnableParallelNorm){
  #ifdef UG_PARALLEL
    uint oldStorageMask = ld.sd->get_storage_mask();
    number norm = ld.sd->norm();
    UG_LOG(prefix << "sd norm: " << norm << "\n");
    if(oldStorageMask & PST_ADDITIVE)
      ld.sd->change_storage_type(PST_ADDITIVE);
    else if(oldStorageMask & PST_CONSISTENT)
      ld.sd->change_storage_type(PST_CONSISTENT);
 
    oldStorageMask = ld.sc->get_storage_mask();
    norm = ld.sc->norm();
    UG_LOG(prefix << "sc norm: " << norm << "\n");
    if(oldStorageMask & PST_ADDITIVE)
      ld.sc->change_storage_type(PST_ADDITIVE);
    else if(oldStorageMask & PST_CONSISTENT)
      ld.sc->change_storage_type(PST_CONSISTENT);
/*
    oldStorageMask = ld.st->get_storage_mask();
    norm = ld.st->norm();
    UG_LOG(prefix << "st norm: " << norm << "\n");
    if(oldStorageMask & PST_ADDITIVE)
      ld.st->change_storage_type(PST_ADDITIVE);
    else if(oldStorageMask & PST_CONSISTENT)
      ld.st->change_storage_type(PST_CONSISTENT);
 
    oldStorageMask = ld.t->get_storage_mask();
    norm = ld.t->norm();
    UG_LOG(prefix << " t norm: " << norm << "\n");
    if(oldStorageMask & PST_ADDITIVE)
      ld.t->change_storage_type(PST_ADDITIVE);
    else if(oldStorageMask & PST_CONSISTENT)
      ld.t->change_storage_type(PST_CONSISTENT);
*/
  #endif
  }
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
void AssembledMultiGridCycle<TDomain, TAlgebra>::
mg_stats_defect(GF& gf, int lvl, typename mg_stats_type::Stage stage)
{
  if(m_mgstats.valid())
    m_mgstats->set_defect(gf, lvl, stage);
}
void AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
template <typename TDomain, typename TAlgebra>
std::string
AssembledMultiGridCycle<TDomain, TAlgebra>::
config_string() const
{
  std::stringstream ss;
  ss << "GeometricMultigrid (";
  if(m_cycleType == _V_) ss << "V-Cycle";
  else if(m_cycleType == _W_) ss << "W-Cycle";
  else if(m_cycleType == _F_) ss << "F-Cycle";
  else ss << " " << m_cycleType << "-Cycle";
  ss << ")\n";
 
  if(m_spPreSmootherPrototype==m_spPostSmootherPrototype)
    ss  << " Smoother (" << m_numPreSmooth << "x pre, " << m_numPostSmooth << "x post): "
      << ConfigShift(m_spPreSmootherPrototype->config_string());
  else
  {
    ss << " Presmoother (" << m_numPreSmooth << "x): " << ConfigShift(m_spPreSmootherPrototype->config_string());
    ss << " Postsmoother ( " << m_numPostSmooth << "x): " << ConfigShift(m_spPostSmootherPrototype->config_string());
  }
  ss << "\n";
  ss << " Basesolver ( Baselevel = " << m_baseLev << ", gathered base = " << (m_bGatheredBaseIfAmbiguous ? "true" : "false") << "): ";
  ss << ConfigShift(m_spBaseSolver->config_string());
  return ss.str();
 
}
AssembledMultiGridCycle<TDomain, TAlgebra>:: {…}
 
} // namespace ug
 
 
#endif /* __H__UG__LIB_DISC__MULTI_GRID_SOLVER__MG_SOLVER_IMPL__ */