nedelec_transfer_impl.h

Go to the documentation of this file.

/*
 * Copyright (c) 2013-2014:  G-CSC, Goethe University Frankfurt
 * Author: Dmitry Logashenko
 * 
 * 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.
 */
 
#include "lib_disc/reference_element/reference_mapping_provider.h"
#include "lib_disc/local_finite_element/local_finite_element_provider.h"
#include "nedelec_local_ass.h"
 
namespace ug{
namespace Electromagnetism{
 
template <typename TDomain, typename TAlgebra, typename TElem>
void NedelecProlongationMatrixHelper<TDomain, TAlgebra, TElem>::GetRegularLocalCoordinate
(
  const MultiGrid * mg, 
  Vertex * v, 
  TElem * base, 
  MathVector<TElem::dim> & local 
)
{
  typedef typename reference_element_traits<TElem>::reference_element_type ref_elem_type;
  
//  Get the parent of the vertex (note that this is typically not the 'base')
  GridObject * parent = mg->get_parent (v);
  
//  Get the vertices of the parent
  Grid::vertex_traits::secure_container vrts;
  ((MultiGrid *) mg)->associated_elements (vrts, parent);
  size_t n_co = vrts.size ();
  UG_ASSERT (n_co != 0, "GetRegularLocalCoordinate: No associated vertices.")
  
//  Get the reference element for the base
  const ref_elem_type& rRefElem = Provider<ref_elem_type>::get ();
  
//  Average the local coordinates of the vertices
  local = 0.0;
  for (size_t co = 0; co < n_co; co++)
  {
    int i = GetVertexIndex (base, vrts[co]);
    if (i < 0)
      UG_THROW ("GetRegularLocalCoordinate: No (implicit) parent-child relation between the vertex and the base element.");
    local += rRefElem.corner (i);
  }
  local /= n_co;
}
void NedelecProlongationMatrixHelper<TDomain, TAlgebra, TElem>::GetRegularLocalCoordinate {…}
 
template <typename TDomain, typename TAlgebra>
void NedelecProlongationMatrixHelper<TDomain, TAlgebra, RegularEdge>::assemble_prolongation_matrix
(
  const domain_type & domain, 
  const DoFDistribution & coarseDD, 
  const DoFDistribution & fineDD, 
  matrix_type & mat, 
  std::vector<bool> & vIsRestricted 
)
{
  typedef DoFDistribution::traits<RegularEdge>::const_iterator iterator;
  
// Multiindices to access the components
  std::vector<DoFIndex> c_ind (1), f_ind (1);
 
// Get the multigrid:
  const MultiGrid * grid = coarseDD.multi_grid().get ();
  
// Get the number of the functions:
  size_t num_fct = coarseDD.num_fct ();
  UG_ASSERT (num_fct == fineDD.num_fct (), "NedelecTransfer: Coarse and find DD mismatch.");
  
// Loop over all subsets:
  for (int si = 0; si < coarseDD.num_subsets (); si++)
  {
  // Loop over all edges in the subset
    iterator e_end = coarseDD.template end<RegularEdge> (si);
    for (iterator edge_iter = coarseDD.template begin<RegularEdge> (si);
      edge_iter != e_end; ++edge_iter)
    {
      number coef;
      Edge * c_edge = * edge_iter;
      const size_t n_children = grid->num_children<Edge, Edge> (c_edge);
      
      if (n_children == 0)
        continue;
      else if (n_children == 1)
      {
        Edge * f_edge = grid->get_child<Edge, Edge> (c_edge,  0);
        
      //  Check the edge orientation:
        GridObject * corner_0 = grid->get_parent (f_edge->vertex(0));
        if (corner_0 == (GridObject *) (c_edge->vertex (0)))
          coef = 1; // the edges should have the same orientation
        else if (corner_0 == (GridObject *) (c_edge->vertex (1)))
          coef = -1; // the edges have the inverse orientation
        else
          UG_THROW ("NedelecTransfer: Cannot find out the edge orientation.");
        
      //  Add the values:
        for (size_t fct = 0; fct < num_fct; fct++)
        {
        //  Get the DoFs:
          if (coarseDD.inner_dof_indices (c_edge, fct, c_ind) != 1
              || fineDD.inner_dof_indices (f_edge, fct, f_ind) != 1)
            UG_THROW ("NedelecTransfer:"
              "More than one DoF per edge. Not the Nedelec-type-1 element?");
        //  Assemble the + or - identity matrix here:
          DoFRef (mat, f_ind[0], c_ind[0]) += coef;
          vIsRestricted [c_ind[0][0]] = true;
        }
      }
      else if (n_children == 2)
      {
        for (size_t child = 0; child < 2; child++)
        {
          Edge * f_edge = grid->get_child<Edge, Edge> (c_edge,  child);
          
        //  Check the edge orientation:
          GridObject * corner_0 = grid->get_parent (f_edge->vertex(0));
          GridObject * corner_1 = grid->get_parent (f_edge->vertex(1));
          if (corner_0 == (GridObject *) (c_edge->vertex (0))
            || corner_1 == (GridObject *) (c_edge->vertex (1)))
            coef = 0.5; // the edges should have the same orientation
          else if (corner_0 == (GridObject *) (c_edge->vertex (1))
            || corner_1 == (GridObject *) (c_edge->vertex (0)))
            coef = -0.5; // the edges have the inverse orientation
          else
            UG_THROW ("NedelecTransfer: Cannot find out the edge orientation.");
          
        //  Add the values:
          for (size_t fct = 0; fct < num_fct; fct++)
          {
          //  Get the DoFs:
            if (coarseDD.inner_dof_indices (c_edge, fct, c_ind) != 1
                || fineDD.inner_dof_indices (f_edge, fct, f_ind) != 1)
              UG_THROW ("NedelecTransfer:"
                "More than one DoF per edge. Not the Nedelec-type-1 element?");
          //  Assemble the matrix entry:
            DoFRef (mat, f_ind[0], c_ind[0]) += coef;
            vIsRestricted [c_ind[0][0]] = true;
          }
        }
      }
      else
        UG_THROW ("NedelecTransfer: Only regular refinement is supported,"
              " but some edge is subdivided into " << n_children << " ones.");
    }
  }
}
void NedelecProlongationMatrixHelper<TDomain, TAlgebra, RegularEdge>::assemble_prolongation_matrix {…}
 
template <typename TDomain, typename TAlgebra, typename TElem>
void NedelecProlongationMatrixHelper<TDomain, TAlgebra, TElem>::assemble_prolongation_matrix
(
  const domain_type & domain, 
  const DoFDistribution & coarseDD, 
  const DoFDistribution & fineDD, 
  matrix_type & mat, 
  std::vector<bool> & vIsRestricted 
)
{
  typedef typename DoFDistribution::traits<TElem>::const_iterator iterator;
  const ReferenceObjectID roid = geometry_traits<TElem>::REFERENCE_OBJECT_ID;
  
// Multiindices to access the components
  std::vector<DoFIndex> c_ind (ref_elem_type::numEdges), f_ind (1);
  
// Get the multigrid:
  const MultiGrid * grid = coarseDD.multi_grid().get ();
  
// Get position accessor for the integration:
  const typename TDomain::position_accessor_type & aaPos = domain.position_accessor ();
 
// Get the number of the functions:
  size_t num_fct = coarseDD.num_fct ();
  UG_ASSERT (num_fct == fineDD.num_fct (), "NedelecTransfer: Coarse and find DD mismatch.");
  
// Loop over all subsets:
  for (int si = 0; si < coarseDD.num_subsets (); si++)
  {
  // Loop over all the elements of the given type in the subset
    iterator e_end = coarseDD.template end<TElem> (si);
    for (iterator elem_iter = coarseDD.template begin<TElem> (si);
      elem_iter != e_end; ++elem_iter)
    {
      TElem * c_elem = * elem_iter;
      const size_t n_children = grid->num_children<Edge, TElem> (c_elem);
      
      if (n_children == 0)
        continue;
      
    // Get the corner positions:
      position_type aCorners [ref_elem_type::numCorners];
      for (size_t co = 0; co < (size_t) ref_elem_type::numCorners; co++)
        aCorners [co] = aaPos [c_elem->vertex (co)];
      
    // Loop over the child elements:
      for (size_t child = 0; child < n_children; child++)
      {
      // Get the fine grid edge:
        Edge * edge = grid->get_child<Edge, TElem> (c_elem,  child);
        
      // Get the local coordinates of the edge center w.r.t. the parent element:
        MathVector<TElem::dim> loc_0, loc_1, loc_center;
        GetRegularLocalCoordinate (grid, edge->vertex (0), c_elem, loc_0);
        GetRegularLocalCoordinate (grid, edge->vertex (1), c_elem, loc_1);
        VecAdd (loc_center, loc_0, loc_1);
        loc_center /= 2;
        
      // Get the length of the edge according to the local coordinates
        MathVector<WDim> corner_0, corner_1, edge_vec;
        DimReferenceMapping<dim, WDim> & map = ReferenceMappingProvider::get<dim, WDim> (roid);
        map.update (aCorners);
        map.local_to_global (corner_0, loc_0);
        map.local_to_global (corner_1, loc_1);
        VecSubtract (edge_vec, corner_1, corner_0);
        
      // Get the shapes and assemble the contribution to the interpolation matrix:
        MathVector<WDim> shape [ref_elem_type::numEdges];
        NedelecT1_LDisc<TDomain, TElem>::get_shapes (&domain, c_elem, aCorners, loc_center, shape);
        for (size_t fct = 0; fct < num_fct; fct++)
        {
        //  Get the DoFs:
          if (coarseDD.dof_indices (c_elem, fct, c_ind) != (size_t) ref_elem_type::numEdges
              || fineDD.inner_dof_indices (edge, fct, f_ind) != 1)
            UG_THROW ("NedelecTransfer:"
              "More than one DoF per edge. Not the Nedelec-type-1 element?");
        //  Add the contributions to the matrix entry:
          for (size_t i = 0; i < (size_t) ref_elem_type::numEdges; i++)
          {
            number coef = VecDot (shape [i], edge_vec);
            DoFRef (mat, f_ind [0], c_ind [i]) += coef;
            vIsRestricted [c_ind [i] [0]] = true;
          }
        }
      }
    }
  }
}
void NedelecProlongationMatrixHelper<TDomain, TAlgebra, TElem>::assemble_prolongation_matrix {…}
 
template <typename TDomain, typename TAlgebra>
void NedelecTransfer<TDomain, TAlgebra>::init ()
{
//  The grid element types for this dimension:
  typedef typename domain_traits<WDim>::AllElemList ElemList;
  
//  Verify the approximation space:
  check_approximation_space ();
  
//  Get the DoF distributions:
  const DoFDistribution & coarseDD = * m_spApproxSpace->dof_distribution (m_coarseLevel);
  const DoFDistribution & fineDD = * m_spApproxSpace->dof_distribution (m_fineLevel);
  
//  Get number of dofs on the grid levels:
  const size_t numFineDoFs = fineDD.num_indices ();
  const size_t numCoarseDoFs = coarseDD.num_indices ();
 
//  Assemble the prolongation matrix:
  m_vIsRestricted.clear (); m_vIsRestricted.resize (numCoarseDoFs, false);
  try
  {
    m_prolongation_matrix.resize_and_clear (numFineDoFs, numCoarseDoFs);
  }
  UG_CATCH_THROW ("NedelecTransfer: Failed to allocate the prolongation matrix.");
  boost::mpl::for_each<ElemList> (AssembleProlongationMatrix (this, coarseDD, fineDD));
 
# ifdef UG_PARALLEL
  m_prolongation_matrix.set_storage_type (PST_CONSISTENT);
# endif
 
//  Done:
  m_bInit = true;
}
void NedelecTransfer<TDomain, TAlgebra>::init () {…}
 
template <typename TDomain, typename TAlgebra>
void NedelecTransfer<TDomain, TAlgebra>::prolongate
(
  vector_type & uFine, 
  const vector_type & uCoarse 
)
{
  if (! m_bInit)
    UG_THROW("NedelecTransfer: Operator not initialized.");
  
// Some assertions
  UG_ASSERT(uFine.size () >= m_prolongation_matrix.num_rows (), "Vector ["
    << uFine.size() << "] must be >= Row size " << m_prolongation_matrix.num_rows ());
  UG_ASSERT(uCoarse.size () >= m_prolongation_matrix.num_cols (), "Vector ["
    << uCoarse.size() << "] must be >= Col size " << m_prolongation_matrix.num_cols ());
 
// Apply the prolongation matrix
  if (! m_prolongation_matrix.apply (uFine, uCoarse))
  {
    std::stringstream ss;
    ss << "NedelecTransfer::prolongate: Cannot apply matrix. ";
#ifdef UG_PARALLEL
    ss << "(Type uCoarse = " << uCoarse.get_storage_mask ();
#endif
    UG_THROW (ss.str().c_str ());
  }
 
// Set Dirichlet nodes to zero again
  try
  {
    for (size_t i = 0; i < m_vConstraint.size (); ++i)
      if (m_vConstraint[i]->type () & CT_DIRICHLET)
        m_vConstraint[i]->adjust_defect (uFine, uFine,
          m_spApproxSpace->dof_distribution (m_fineLevel), CT_DIRICHLET);
  }
  UG_CATCH_THROW("NedelecTransfer::prolongate: Error while setting dirichlet defect to zero.");
 
// Call further constraints constraints (= adjust_restrict, member of class constraint)
  try
  {
    for (int type = 1; type < CT_ALL; type = type << 1)
      for (size_t i = 0; i < m_vConstraint.size (); ++i)
        if (m_vConstraint[i]->type() & type)
          m_vConstraint[i]->adjust_prolongation (uFine, m_fineLevel, uCoarse, m_coarseLevel, type);
  }
  UG_CATCH_THROW("NedelecTransfer::prolongate: Error while setting dirichlet defect to zero.");
}
void NedelecTransfer<TDomain, TAlgebra>::prolongate {…}
 
template <typename TDomain, typename TAlgebra>
void NedelecTransfer<TDomain, TAlgebra>::do_restrict
(
  vector_type & uCoarse, 
  const vector_type & uFine 
)
{
  if (! m_bInit)
    UG_THROW("NedelecTransfer: Operator not initialized.");
  
  vector_type uTmp; uTmp.resize(uCoarse.size());
 
// Some assertions
  UG_ASSERT (uFine.size () >= m_prolongation_matrix.num_rows (), "Vector ["
    << uFine.size () << "] must be >= Row size " << m_prolongation_matrix.num_rows ());
  UG_ASSERT (uCoarse.size () >= m_prolongation_matrix.num_cols (), "Vector ["
    << uCoarse.size() << "] must be >= Col size " << m_prolongation_matrix.num_cols ());
 
// Apply the transposed prolongation matrix
  if (! m_prolongation_matrix.apply_transposed (uTmp, uFine))
    UG_THROW ("NedelecTransfer::restrict: Cannot apply transposed matrix.");
 
// Copy only restricted values:
//  This is needed for adaptive grids, where the defect that has been
//  projected from the surface should remain and only hidden (i.e.
//  indices with children) should be changed.
  for (size_t i = 0; i < uTmp.size (); ++i)
    if (m_vIsRestricted [i])
      uCoarse[i] = uTmp[i];
 
// Set dirichlet nodes to zero again
  try
  {
    for(size_t i = 0; i < m_vConstraint.size (); ++i)
      if (m_vConstraint[i]->type () & CT_DIRICHLET)
        m_vConstraint[i]->adjust_defect (uCoarse, uCoarse,
          m_spApproxSpace->dof_distribution (m_coarseLevel), CT_DIRICHLET);
  }
  UG_CATCH_THROW("NedelecTransfer::restrict: Error while setting dirichlet defect to zero.");
 
// call restrictions due to added constraints (= adjust_restrict, member of class constraint)
  try
  {
    for (int type = 1; type < CT_ALL; type = type << 1)
      for (size_t i = 0; i < m_vConstraint.size (); ++i)
        if (m_vConstraint[i]->type() & type)
          m_vConstraint[i]->adjust_restriction (uCoarse, m_coarseLevel, uFine, m_fineLevel, type);
  }
  UG_CATCH_THROW("NedelecTransfer::restrict: Error while setting dirichlet defect to zero.");
}
void NedelecTransfer<TDomain, TAlgebra>::do_restrict {…}
 
template <typename TDomain, typename TAlgebra>
void NedelecTransfer<TDomain, TAlgebra>::check_approximation_space ()
{
  if (m_spApproxSpace.invalid ())
    UG_THROW ("NedelecTransfer: Approximation space not set.");
  
  for (size_t fct = 0; fct < m_spApproxSpace->num_fct (); fct++)
    if (m_spApproxSpace->local_finite_element_id (fct). type() != LFEID::NEDELEC)
      UG_THROW ("NedelecTransfer: "
            "All the functions should be based on the Nedelec element "
            "but function #" << fct << " is not.");
}
void NedelecTransfer<TDomain, TAlgebra>::check_approximation_space () {…}
 
template <typename TDomain, typename TAlgebra>
void NedelecTransfer<TDomain, TAlgebra>::set_levels
(
  GridLevel coarseLevel, 
  GridLevel fineLevel 
)
{
  m_bInit = false;
  m_fineLevel = fineLevel;
  m_coarseLevel = coarseLevel;
 
  if(m_fineLevel.level () - m_coarseLevel.level () != 1)
    UG_THROW("NedelecTransfer: Can only project between successive level.");
 
  if(m_fineLevel.type () != GridLevel::LEVEL || m_coarseLevel.type () != GridLevel::LEVEL)
    UG_THROW("NedelecTransfer: Can only project between level dof distributions, but fine="
        << m_fineLevel << ", coarse=" << m_coarseLevel);
}
void NedelecTransfer<TDomain, TAlgebra>::set_levels {…}
 
template <typename TDomain, typename TAlgebra>
SmartPtr<ITransferOperator<TDomain, TAlgebra> > NedelecTransfer<TDomain, TAlgebra>::clone ()
{
  SmartPtr<NedelecTransfer> op (new NedelecTransfer (m_spApproxSpace));
  
  for(size_t i = 0; i < m_vConstraint.size (); ++i)
    op->add_constraint (m_vConstraint[i]);
  
  return op;
}
SmartPtr<ITransferOperator<TDomain, TAlgebra> > NedelecTransfer<TDomain, TAlgebra>::clone () {…}
 
 
} // end namespace Electromagnetism
} // end namespace ug
 
/* End of File */