grid_refinement.h

Go to the documentation of this file.

// ---------------------------------------------------------------------
//
// Copyright (C) 2009 - 2023 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE.md at
// the top level directory of deal.II.
//
// ---------------------------------------------------------------------
 
#ifndef dealii_distributed_grid_refinement_h
#define dealii_distributed_grid_refinement_h
 
 
#include <deal.II/base/config.h>
 
#include <deal.II/base/exceptions.h>
 
#include <deal.II/distributed/tria.h>
 
#include <deal.II/numerics/vector_tools_common.h>
 
#include <limits>
#include <vector>
 
DEAL_II_NAMESPACE_OPEN
 
namespace internal
{
  namespace parallel
  {
    namespace distributed
    {
      namespace GridRefinement
      {
        template <typename number>
        std::pair<number, number>
        compute_global_min_and_max_at_root(
          const ::Vector<number> &criteria,
          const MPI_Comm                mpi_communicator);
 
        namespace RefineAndCoarsenFixedNumber
        {
          template <typename number>
          number
          compute_threshold(const ::Vector<number> &   criteria,
                            const std::pair<double, double> &global_min_and_max,
                            const types::global_cell_index   n_target_cells,
                            const MPI_Comm                   mpi_communicator);
        } // namespace RefineAndCoarsenFixedNumber
 
        namespace RefineAndCoarsenFixedFraction
        {
          template <typename number>
          number
          compute_threshold(const ::Vector<number> &   criteria,
                            const std::pair<double, double> &global_min_and_max,
                            const double                     target_error,
                            const MPI_Comm                   mpi_communicator);
        } // namespace RefineAndCoarsenFixedFraction
      }   // namespace GridRefinement
    }     // namespace distributed
  }       // namespace parallel
} // namespace internal
 
 
 
namespace parallel
{
  namespace distributed
  {
    namespace GridRefinement
    {
      template <int dim, typename Number, int spacedim>
      void
      refine_and_coarsen_fixed_number(
        ::Triangulation<dim, spacedim> &tria,
        const ::Vector<Number> &        criteria,
        const double                          top_fraction_of_cells,
        const double                          bottom_fraction_of_cells,
        const types::global_cell_index        max_n_cells =
          std::numeric_limits<types::global_cell_index>::max());
 
      template <int dim, typename Number, int spacedim>
      void
      refine_and_coarsen_fixed_fraction(
        ::Triangulation<dim, spacedim> &tria,
        const ::Vector<Number> &        criteria,
        const double                          top_fraction_of_error,
        const double                          bottom_fraction_of_error,
        const VectorTools::NormType norm_type = VectorTools::NormType::L1_norm);
    } // namespace GridRefinement
  }   // namespace distributed
} // namespace parallel
 
 
DEAL_II_NAMESPACE_CLOSE
 
#endif // dealii_distributed_grid_refinement_h