PolycrystalUserObjectBase.C

Go to the documentation of this file.

//* This file is part of the MOOSE framework
//* https://mooseframework.inl.gov
//*
//* All rights reserved, see COPYRIGHT for full restrictions
//* https://github.com/idaholab/moose/blob/master/COPYRIGHT
//*
//* Licensed under LGPL 2.1, please see LICENSE for details
//* https://www.gnu.org/licenses/lgpl-2.1.html
 
#include "DenseMatrix.h"
#include "PolycrystalUserObjectBase.h"
#include "NonlinearSystemBase.h"
#include "MooseMesh.h"
#include "MooseVariable.h"
 
#include <vector>
#include <map>
#include <algorithm>
 
InputParameters
PolycrystalUserObjectBase::validParams()
{
  InputParameters params = FeatureFloodCount::validParams();
  params.addClassDescription("This object provides the base capability for creating proper reduced "
                             "order parameter polycrystal initial conditions.");
  params.addRequiredCoupledVarWithAutoBuild(
      "variable", "var_name_base", "op_num", "Array of coupled variables");
  params.addParam<bool>("output_adjacency_matrix",
                        false,
                        "Output the Grain Adjacency Matrix used in the coloring algorithms. "
                        "Additionally, the grain to OP assignments will be printed");
  params.addParam<MooseEnum>("coloring_algorithm",
                             PolycrystalUserObjectBase::coloringAlgorithms(),
                             PolycrystalUserObjectBase::coloringAlgorithmDescriptions());
 
  // FeatureFloodCount adds a relationship manager, but we need to extend that for PolycrystalIC
  params.clearRelationshipManagers();
 
  params.addRelationshipManager(
      "ElementSideNeighborLayers",
      Moose::RelationshipManagerType::GEOMETRIC,
 
      [](const InputParameters & /*obj_params*/, InputParameters & rm_params)
      { rm_params.set<unsigned short>("layers") = 2; }
 
  );
 
  params.addRelationshipManager("ElementSideNeighborLayers",
                                Moose::RelationshipManagerType::ALGEBRAIC);
 
  // Hide the output of the IC objects by default, it doesn't change over time
  params.set<std::vector<OutputName>>("outputs") = {"none"};
 
  params.set<bool>("allow_duplicate_execution_on_initial") = true;
 
  // This object should only be executed _before_ the initial condition
  ExecFlagEnum execute_options = MooseUtils::getDefaultExecFlagEnum();
  execute_options = EXEC_INITIAL;
  params.set<ExecFlagEnum>("execute_on") = execute_options;
 
  return params;
}
 
PolycrystalUserObjectBase::PolycrystalUserObjectBase(const InputParameters & parameters)
  : FeatureFloodCount(parameters),
    _dim(_mesh.dimension()),
    _op_num(_vars.size()),
    _coloring_algorithm(getParam<MooseEnum>("coloring_algorithm")),
    _colors_assigned(false),
    _output_adjacency_matrix(getParam<bool>("output_adjacency_matrix")),
    _num_chunks(FeatureFloodCount::invalid_proc_id)
{
  mooseAssert(_single_map_mode, "Do not turn off single_map_mode with this class");
}
 
void
PolycrystalUserObjectBase::initialSetup()
{
  if (_op_num < 1)
    mooseError("No coupled variables found");
 
  const auto first_variable_value = _mesh.queryPeriodicDimensions(*_vars[0]);
  for (unsigned int i = 1; i < _vars.size(); ++i)
    if (_mesh.queryPeriodicDimensions(*_vars[i]) != first_variable_value)
      mooseError("Coupled polycrystal variables differ in periodicity");
 
  FeatureFloodCount::initialSetup();
}
 
void
PolycrystalUserObjectBase::initialize()
{
  if (_colors_assigned && !_fe_problem.hasInitialAdaptivity())
    return;
 
  _entity_to_grain_cache.clear();
 
  FeatureFloodCount::initialize();
}
 
void
PolycrystalUserObjectBase::execute()
{
  if (!_colors_assigned)
    precomputeGrainStructure();
  // No need to rerun the object if the mesh hasn't changed
  else if (!_fe_problem.hasInitialAdaptivity())
    return;
 
  TIME_SECTION("execute", 2, "Computing Polycrystal Initial Condition");
 
  _entities_visited.resize(getNumGrains());
 
  for (const auto & current_elem : _fe_problem.getNonlinearEvaluableElementRange())
  {
    // Loop over elements or nodes
    if (_is_elemental)
      while (flood(current_elem, invalid_size_t))
        ;
    else
    {
      auto n_nodes = current_elem->n_vertices();
      for (auto i = decltype(n_nodes)(0); i < n_nodes; ++i)
      {
        const Node * current_node = current_elem->node_ptr(i);
 
        while (flood(current_node, invalid_size_t))
          ;
      }
    }
  }
}
 
processor_id_type
PolycrystalUserObjectBase::numberOfDistributedMergeHelpers() const
{
  mooseAssert(_num_chunks != FeatureFloodCount::invalid_proc_id,
              "prepareDataForTransfer() hasn't been called yet");
 
  return _num_chunks;
}
 
void
PolycrystalUserObjectBase::prepareDataForTransfer()
{
  FeatureFloodCount::prepareDataForTransfer();
 
  _partial_feature_sets[0].sort();
 
  // Get the largest ID seen on any rank
  auto largest_id = _partial_feature_sets[0].back()._id;
  _communicator.max(largest_id);
  mooseAssert(largest_id != invalid_size_t, "Largest ID should not be invalid");
 
  auto total_items = largest_id + 1;
 
  _num_chunks = std::min(_app.n_processors(), total_items);
 
  _partial_feature_sets.resize(_num_chunks);
  _feature_counts_per_map.resize(_num_chunks);
 
  for (auto it = _partial_feature_sets[0].begin(); it != _partial_feature_sets[0].end();
       /* No increment on it*/)
  {
    auto chunk = MooseUtils::linearPartitionChunk(total_items, _num_chunks, it->_id);
 
    if (chunk)
    {
      _partial_feature_sets[chunk].emplace_back(std::move(*it));
      it = _partial_feature_sets[0].erase(it); // it is incremented here!
    }
    else
      ++it;
  }
}
 
void
PolycrystalUserObjectBase::finalize()
{
  if (_colors_assigned && !_fe_problem.hasInitialAdaptivity())
    return;
 
  TIME_SECTION("finalize", 2, "Finalizing Polycrystal Initial Condition");
 
  // TODO: Possibly retrieve the halo thickness from the active GrainTracker object?
  constexpr unsigned int halo_thickness = 2;
 
  expandEdgeHalos(halo_thickness - 1);
 
  FeatureFloodCount::finalize();
 
  if (!_colors_assigned)
  {
    // Resize the color assignment vector here. All ranks need a copy of this
    _grain_idx_to_op.resize(_feature_count, PolycrystalUserObjectBase::INVALID_COLOR);
    if (_is_primary)
    {
      buildGrainAdjacencyMatrix();
 
      assignOpsToGrains();
 
      if (_output_adjacency_matrix)
        printGrainAdjacencyMatrix();
    }
 
    // Communicate the coloring map with all ranks
    _communicator.broadcast(_grain_to_op);
 
    for (auto & feature : _feature_sets)
      feature._var_index = _grain_to_op.at(feature._id);
  }
 
  _colors_assigned = true;
}
 
void
PolycrystalUserObjectBase::mergeSets()
{
  // When working with _distribute_merge_work all of the maps will be empty except for one
  for (const auto map_num : index_range(_partial_feature_sets))
  {
    _partial_feature_sets[map_num].sort();
 
    auto it1 = _partial_feature_sets[map_num].begin();
    auto it_end = _partial_feature_sets[map_num].end();
    while (it1 != it_end)
    {
      auto it2 = it1;
      if (++it2 == it_end)
        break;
 
      if (areFeaturesMergeable(*it1, *it2))
      {
        it1->merge(std::move(*it2));
        _partial_feature_sets[map_num].erase(it2);
      }
      else
        ++it1; // Only increment if we have a mismatch
    }
  }
}
 
void
PolycrystalUserObjectBase::restoreOriginalDataStructures(std::vector<std::list<FeatureData>> & orig)
{
  // Move all the data back into the first list
  auto & master_list = orig[0];
  for (MooseIndex(_maps_size) map_num = 1; map_num < orig.size(); ++map_num)
  {
    master_list.splice(master_list.end(), orig[map_num]);
    orig[map_num].clear();
  }
 
  orig.resize(1);
}
 
bool
PolycrystalUserObjectBase::isNewFeatureOrConnectedRegion(const DofObject * dof_object,
                                                         std::size_t & current_index,
                                                         FeatureData *& feature,
                                                         Status & status,
                                                         unsigned int & new_id)
{
  mooseAssert(_t_step == 0, "PolyIC only works if we begin in the initial condition");
 
  // Retrieve the id of the current entity
  auto entity_id = dof_object->id();
  auto grains_it = _entity_to_grain_cache.lower_bound(entity_id);
 
  if (grains_it == _entity_to_grain_cache.end() || grains_it->first != entity_id)
  {
    std::vector<unsigned int> grain_ids;
 
    if (_is_elemental)
      getGrainsBasedOnElem(*static_cast<const Elem *>(dof_object), grain_ids);
    else
      getGrainsBasedOnPoint(*static_cast<const Node *>(dof_object), grain_ids);
 
    grains_it = _entity_to_grain_cache.emplace_hint(grains_it, entity_id, std::move(grain_ids));
  }
 
  auto saved_grain_id = invalid_id;
  if (current_index == invalid_size_t)
  {
    for (auto grain_id : grains_it->second)
    {
      auto map_it = _grain_to_op.find(grain_id);
      mooseAssert(!_colors_assigned || map_it != _grain_to_op.end(), "grain_id missing");
      auto map_num = _colors_assigned ? map_it->second : grain_id;
 
      if (_entities_visited[map_num].find(entity_id) == _entities_visited[map_num].end())
      {
        saved_grain_id = grain_id;
        current_index = map_num;
        break;
      }
    }
 
    if (current_index == invalid_size_t)
      return false;
  }
  else if (_entities_visited[current_index].find(entity_id) !=
           _entities_visited[current_index].end())
    return false;
 
  if (!feature)
  {
    new_id = saved_grain_id;
    status &= ~Status::INACTIVE;
 
    return true;
  }
  else
  {
    const auto & grain_ids = grains_it->second;
    if (std::find(grain_ids.begin(), grain_ids.end(), feature->_id) != grain_ids.end())
      return true;
 
    if (_is_elemental)
    {
      Elem * elem = _mesh.queryElemPtr(entity_id);
      mooseAssert(elem, "Element is nullptr");
 
      std::vector<const Elem *> all_active_neighbors;
      MeshBase & mesh = _mesh.getMesh();
 
      for (auto i = decltype(elem->n_neighbors())(0); i < elem->n_neighbors(); ++i)
      {
        const Elem * neighbor_ancestor = nullptr;
 
        neighbor_ancestor = elem->neighbor_ptr(i);
 
        if (neighbor_ancestor)
        {
          if (neighbor_ancestor->is_remote())
            continue;
 
          neighbor_ancestor->active_family_tree_by_neighbor(all_active_neighbors, elem, false);
        }
        else // if (expand_halos_only /*&& feature->_periodic_nodes.empty()*/)
        {
          neighbor_ancestor = elem->topological_neighbor(i, mesh, *_point_locator, _pbs);
 
          if (neighbor_ancestor)
          {
            if (neighbor_ancestor->is_remote())
              continue;
 
            neighbor_ancestor->active_family_tree_by_topological_neighbor(
                all_active_neighbors, elem, mesh, *_point_locator, _pbs, false);
          }
        }
      }
 
      for (const auto neighbor : all_active_neighbors)
      {
        // Retrieve the id of the current entity
        auto neighbor_id = neighbor->id();
        auto neighbor_it = _entity_to_grain_cache.lower_bound(neighbor_id);
 
        if (neighbor_it == _entity_to_grain_cache.end() || neighbor_it->first != neighbor_id)
        {
          std::vector<unsigned int> more_grain_ids;
 
          getGrainsBasedOnElem(*static_cast<const Elem *>(neighbor), more_grain_ids);
 
          neighbor_it = _entity_to_grain_cache.emplace_hint(
              neighbor_it, neighbor_id, std::move(more_grain_ids));
        }
 
        const auto & more_grain_ids = neighbor_it->second;
        if (std::find(more_grain_ids.begin(), more_grain_ids.end(), feature->_id) !=
            more_grain_ids.end())
          return true;
      }
    }
 
    return false;
  }
}
 
bool
PolycrystalUserObjectBase::areFeaturesMergeable(const FeatureData & f1,
                                                const FeatureData & f2) const
{
  if (f1._id != f2._id)
    return false;
 
  mooseAssert(f1._var_index == f2._var_index, "Feature should be mergeable but aren't");
  return true;
}
 
void
PolycrystalUserObjectBase::buildGrainAdjacencyMatrix()
{
  mooseAssert(_is_primary, "This routine should only be called on the primary rank");
 
  _adjacency_matrix = std::make_unique<DenseMatrix<Real>>(_feature_count, _feature_count);
  for (MooseIndex(_feature_sets) i = 0; i < _feature_sets.size(); ++i)
  {
    for (MooseIndex(_feature_sets) j = i + 1; j < _feature_sets.size(); ++j)
    {
      if (_feature_sets[i].boundingBoxesIntersect(_feature_sets[j]) &&
          _feature_sets[i].halosIntersect(_feature_sets[j]))
      {
        // Our grain adjacency matrix is symmetrical
        (*_adjacency_matrix)(i, j) = 1;
        (*_adjacency_matrix)(j, i) = 1;
      }
    }
  }
}
 
void
PolycrystalUserObjectBase::assignOpsToGrains()
{
  mooseAssert(_is_primary, "This routine should only be called on the primary rank");
 
  TIME_SECTION("assignOpsToGrains", 2, "Assigning OPs to grains");
 
  // Use a simple backtracking coloring algorithm
  if (_coloring_algorithm == "bt")
  {
    paramInfo("coloring_algorithm",
              "The backtracking algorithm has exponential complexity. If you are using very few "
              "order parameters,\nor you have several hundred grains or more, you should use one "
              "of the PETSc coloring algorithms such as \"jp\".");
 
    if (!colorGraph(0))
      paramError("op_num",
                 "Unable to find a valid grain to op coloring, Make sure you have created enough "
                 "variables to hold a\nvalid polycrystal initial condition (no grains represented "
                 "by the same variable should be allowed to\ntouch, ~8 for 2D, ~25 for 3D)?");
  }
  else // PETSc Coloring algorithms
  {
    const std::string & ca_str = _coloring_algorithm;
    Real * am_data = _adjacency_matrix->get_values().data();
 
    try
    {
      Moose::PetscSupport::colorAdjacencyMatrix(
          am_data, _feature_count, _vars.size(), _grain_idx_to_op, ca_str.c_str());
    }
    catch (std::runtime_error & e)
    {
      paramError("op_num",
                 "Unable to find a valid grain to op coloring, Make sure you have created enough "
                 "variables to hold a\nvalid polycrystal initial condition (no grains represented "
                 "by the same variable should be allowed to\ntouch, ~8 for 2D, ~25 for 3D)?");
    }
  }
 
  mooseAssert(_grain_to_op.empty(), "grain_to_op data structure should be empty here");
  for (MooseIndex(_grain_idx_to_op) i = 0; i < _grain_idx_to_op.size(); ++i)
    _grain_to_op.emplace_hint(_grain_to_op.end(), _feature_sets[i]._id, _grain_idx_to_op[i]);
}
 
bool
PolycrystalUserObjectBase::colorGraph(unsigned int vertex)
{
  // Base case: All grains are assigned
  if (vertex == _feature_count)
    return true;
 
  // Consider this grain and try different ops
  for (unsigned int color_idx = 0; color_idx < _op_num; ++color_idx)
  {
    // We'll try to spread these colors around a bit rather than
    // packing them all on the first few colors if we have several colors.
    unsigned int color = (vertex + color_idx) % _op_num;
 
    if (isGraphValid(vertex, color))
    {
      _grain_idx_to_op[vertex] = color;
 
      if (colorGraph(vertex + 1))
        return true;
 
      // Backtrack...
      _grain_idx_to_op[vertex] = PolycrystalUserObjectBase::INVALID_COLOR;
    }
  }
 
  return false;
}
 
bool
PolycrystalUserObjectBase::isGraphValid(unsigned int vertex, unsigned int color)
{
  // See if the proposed color is valid based on the current neighbor colors
  for (unsigned int neighbor = 0; neighbor < _feature_count; ++neighbor)
    if ((*_adjacency_matrix)(vertex, neighbor) && color == _grain_idx_to_op[neighbor])
      return false;
  return true;
}
 
void
PolycrystalUserObjectBase::printGrainAdjacencyMatrix() const
{
  _console << "Grain Adjacency Matrix:\n";
  for (unsigned int i = 0; i < _adjacency_matrix->m(); i++)
  {
    for (unsigned int j = 0; j < _adjacency_matrix->n(); j++)
      _console << _adjacency_matrix->el(i, j) << "  ";
    _console << '\n';
  }
 
  _console << "Grain to OP assignments:\n";
  for (auto op : _grain_idx_to_op)
    _console << op << "  ";
  _console << '\n' << std::endl;
}
 
MooseEnum
PolycrystalUserObjectBase::coloringAlgorithms()
{
  return MooseEnum("jp power greedy bt", "jp");
}
 
std::string
PolycrystalUserObjectBase::coloringAlgorithmDescriptions()
{
  return "The grain neighbor graph coloring algorithm to use: \"jp\" (DEFAULT) Jones and "
         "Plassmann, an efficient coloring algorithm, \"power\" an alternative stochastic "
         "algorithm, \"greedy\", a greedy assignment algorithm with stochastic updates to "
         "guarantee a valid coloring, \"bt\", a back tracking algorithm that produces good "
         "distributions but may experience exponential run time in the worst case scenario "
         "(works well on medium to large 2D problems)";
}
 
const unsigned int PolycrystalUserObjectBase::INVALID_COLOR =
    std::numeric_limits<unsigned int>::max();
const unsigned int PolycrystalUserObjectBase::HALO_THICKNESS = 4;