utilities.h

Go to the documentation of this file.

/*
  Copyright (C) 2014 - 2023 by the authors of the ASPECT code.

  This file is part of ASPECT.

  ASPECT is free software; you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation; either version 2, or (at your option)
  any later version.

  ASPECT 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 General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with ASPECT; see the file LICENSE.  If not see
  <http://www.gnu.org/licenses/>.
*/


#ifndef _aspect_utilities_h
#define _aspect_utilities_h

#include <aspect/global.h>

#include <array>
#include <random>
#include <deal.II/base/point.h>
#include <deal.II/base/conditional_ostream.h>
#include <deal.II/base/table_indices.h>
#include <deal.II/base/function_lib.h>
#include <deal.II/dofs/dof_handler.h>
#include <deal.II/fe/component_mask.h>

#include <aspect/coordinate_systems.h>
#include <aspect/structured_data.h>



namespace aspect
{
  template <int dim> class SimulatorAccess;

  namespace GeometryModel
  {
    template <int dim> class Interface;
  }

  namespace Utilities
  {
    using namespace dealii;
    using namespace ::Utilities;


    template <typename T>
    std::vector<T>
    possibly_extend_from_1_to_N (const std::vector<T> &values,
                                 const unsigned int N,
                                 const std::string &id_text);

    namespace MapParsing
    {
      struct Options
      {
        /* A list of valid key names that are allowed
         * to appear in the map. If this list is empty
         * it is assumed to be equal to the list of
         * required keys. If this list is longer than
         * list_of_required_keys, every key that is
         * allowed but not required will be ignored when
         * parsing the map.
         */
        std::vector<std::string> list_of_allowed_keys;

        /* A list of valid key names that are required
         * to appear in the map. Only these keys will be
         * parsed into the map structure and the order of
         * these keys determines the order of entries
         * in the output vector.
         */
        std::vector<std::string> list_of_required_keys;

        /*
         * A name that identifies the type of input property (e.g. 'density', 'viscosity')
         * that is being parsed by this function. This name is used in generating
         * error messages if the map does not conform to the expected format.
         */
        std::string property_name;

        /*
         * If true, allow multiple values
         * for each key. If false only allow a single value per key. In either
         * case each key is only allowed to appear once. Multiple values
         * for a key are delimited by a "|" character, as in
         * "key1: value1|value2|value3, key2: value1|value2".
         */
        bool allow_multiple_values_per_key;

        /*
         * Whether to allow for some keys in list_of_required_keys to be
         * not set to any values, i.e. they do not appear at all.
         * This also allows a completely empty map.
         */
        bool allow_missing_keys;

        /*
         * Whether to store the number of values
         * per key in n_values_per_key while creating
         * the map. This vector can be later accessed
         * and used (for example) to check that subsequent calls to
         * parse other input parameters have the same
         * structure.
         */
        bool store_values_per_key;

        /*
         * Whether to check the number of values
         * per key in the map against values stored
         * in n_values_per_key. This allows to
         * check that subsequent calls to
         * parse other input parameters have the same
         * structure.
         */
        bool check_values_per_key;

        /*
         * A vector of unsigned
         * integers that is used by store_values_per_key and
         * check_values_per_key to either store the current map
         * structure or check the map structure against an existing
         * map. This parameter is only used if either of these
         * two parameters are set to true
         */
        std::vector<unsigned int> n_values_per_key;

        Options() = delete;

        Options(const std::vector<std::string> &list_of_required_keys,
                const std::string &property_name)
          :
          list_of_allowed_keys(list_of_required_keys),
          list_of_required_keys(list_of_required_keys),
          property_name(property_name),
          allow_multiple_values_per_key(false),
          allow_missing_keys(false),
          store_values_per_key(false),
          check_values_per_key(false),
          n_values_per_key()
        {}
      };

      std::vector<double>
      parse_map_to_double_array(const std::string &input_string,
                                Options &options);
    }

    std::vector<double>
    parse_map_to_double_array (const std::string &key_value_map,
                               const std::vector<std::string> &list_of_keys,
                               const bool expects_background_field,
                               const std::string &property_name,
                               const bool allow_multiple_values_per_key = false,
                               const std::unique_ptr<std::vector<unsigned int>> &n_values_per_key = nullptr,
                               const bool allow_missing_keys = false);

    template <typename T>
    Table<2,T>
    parse_input_table (const std::string &input_string,
                       const unsigned int n_rows,
                       const unsigned int n_columns,
                       const std::string &property_name);

    template <int dim>
    std::vector<std::string>
    expand_dimensional_variable_names (const std::vector<std::string> &var_declarations);

    template <int dim>
    IndexSet extract_locally_active_dofs_with_component(const DoFHandler<dim> &dof_handler,
                                                        const ComponentMask &component_mask);

    template <int dim>
    std::vector<Point<dim>> get_unit_support_points(const SimulatorAccess<dim> &simulator_access);



    template <int dim>
    bool
    point_is_in_triangulation(const Mapping<dim> &mapping,
                              const parallel::distributed::Triangulation<dim> &triangulation,
                              const Point<dim> &point,
                              const MPI_Comm mpi_communicator);


    namespace Coordinates
    {

      template <int dim>
      std::array<double,dim>
      WGS84_coordinates(const ::Point<dim> &position);

      template <int dim>
      std::array<double,dim>
      cartesian_to_spherical_coordinates(const ::Point<dim> &position);

      template <int dim>
      ::Point<dim>
      spherical_to_cartesian_coordinates(const std::array<double,dim> &scoord);

      template <int dim>
      Tensor<1,dim>
      spherical_to_cartesian_vector(const Tensor<1,dim> &spherical_vector,
                                    const ::Point<dim> &position);


      template <int dim>
      std::array<double,3>
      cartesian_to_ellipsoidal_coordinates(const ::Point<3> &position,
                                           const double semi_major_axis_a,
                                           const double eccentricity);

      template <int dim>
      ::Point<3>
      ellipsoidal_to_cartesian_coordinates(const std::array<double,3> &phi_theta_d,
                                           const double semi_major_axis_a,
                                           const double eccentricity);


      CoordinateSystem
      string_to_coordinate_system (const std::string &);
    }


    template <int dim>
    bool
    polygon_contains_point(const std::vector<Point<2>> &point_list,
                           const ::Point<2> &point);

    template <int dim>
    double
    signed_distance_to_polygon(const std::vector<Point<2>> &point_list,
                               const ::Point<2> &point);


    double
    distance_to_line(const std::array<::Point<2>,2> &point_list,
                     const ::Point<2> &point);

    template <int dim>
    std::array<Tensor<1,dim>,dim-1>
    orthogonal_vectors (const Tensor<1,dim> &v);

    Tensor<2,3>
    rotation_matrix_from_axis (const Tensor<1,3> &rotation_axis,
                               const double rotation_angle);

    Tensor<2,3>
    compute_rotation_matrix_for_slice (const Tensor<1,3> &point_one,
                                       const Tensor<1,3> &point_two);

    std::pair<double,double> real_spherical_harmonic( unsigned int l, // degree
                                                      unsigned int m, // order
                                                      double theta,   // colatitude (radians)
                                                      double phi );   // longitude (radians)

    struct ThousandSep : std::numpunct<char>
    {
      protected:
        char do_thousands_sep() const override
        {
          return ',';
        }

        std::string do_grouping() const override
        {
          return "\003";  // groups of 3 digits (this string is in octal format)
        }

    };

    bool fexists(const std::string &filename);

    bool fexists(const std::string &filename,
                 const MPI_Comm comm);

    bool filename_is_url(const std::string &filename);

    std::string
    read_and_distribute_file_content(const std::string &filename,
                                     const MPI_Comm comm);

    void
    collect_and_write_file_content(const std::string &filename,
                                   const std::string &file_content,
                                   const MPI_Comm comm);

    int
    mkdirp(std::string pathname, const mode_t mode = 0755);

    void create_directory(const std::string &pathname,
                          const MPI_Comm comm,
                          bool silent);

    namespace tk
    {
      class spline
      {
        public:
          void set_points(const std::vector<double> &x,
                          const std::vector<double> &y,
                          const bool cubic_spline = true,
                          const bool monotone_spline = false);
          double operator() (double x) const;

        private:
          std::vector<double> m_x;

          std::vector<double> m_a, m_b, m_c, m_y;
      };
    }

    inline
    void
    extract_composition_values_at_q_point (const std::vector<std::vector<double>> &composition_values,
                                           const unsigned int q,
                                           std::vector<double> &composition_values_at_q_point);

    std::string
    expand_ASPECT_SOURCE_DIR (const std::string &location);

    std::string parenthesize_if_nonempty (const std::string &s);

    bool has_unique_entries (const std::vector<std::string> &strings);



    double weighted_p_norm_average (const std::vector<double> &weights,
                                    const std::vector<double> &values,
                                    const double p);


    template <typename T>
    T derivative_of_weighted_p_norm_average (const double averaged_parameter,
                                             const std::vector<double> &weights,
                                             const std::vector<double> &values,
                                             const std::vector<T> &derivatives,
                                             const double p);
    template <int dim>
    double compute_spd_factor(const double eta,
                              const SymmetricTensor<2,dim> &strain_rate,
                              const SymmetricTensor<2,dim> &dviscosities_dstrain_rate,
                              const double SPD_safety_factor);

    template <int dim>
    Point<dim> convert_array_to_point(const std::array<double,dim> &array);

    template <int dim>
    std::array<double,dim> convert_point_to_array(const Point<dim> &point);

    class Operator
    {
      public:
        enum operation
        {
          uninitialized,
          add,
          subtract,
          minimum,
          maximum,
          replace_if_valid
        };

        Operator();

        Operator(const operation op);

        double operator() (const double x, const double y) const;

        bool operator== (const operation op) const;

      private:
        operation op;
    };

    std::vector<Operator> create_model_operator_list(const std::vector<std::string> &operator_names);

    const std::string get_model_operator_options();

    template <int dim>
    SymmetricTensor<2,dim> nth_basis_for_symmetric_tensors (const unsigned int k);

    template <int dim>
    class NaturalCoordinate
    {
      public:
        NaturalCoordinate(Point<dim> &position,
                          const GeometryModel::Interface<dim> &geometry_model);

        NaturalCoordinate(const std::array<double, dim> &coord,
                          const Utilities::Coordinates::CoordinateSystem &coord_system);

        std::array<double,dim> &get_coordinates();

        const std::array<double,dim> &get_coordinates() const;

        std::array<double,dim-1> get_surface_coordinates() const;

        double get_depth_coordinate() const;

      private:
        Utilities::Coordinates::CoordinateSystem coordinate_system;

        std::array<double,dim> coordinates;
    };


    template <int dim, typename VectorType>
    void
    project_cellwise(const Mapping<dim>                                        &mapping,
                     const DoFHandler<dim>                                     &dof_handler,
                     const unsigned int                                         component_index,
                     const Quadrature<dim>                                     &quadrature,
                     const std::function<void(
                       const typename DoFHandler<dim>::active_cell_iterator &,
                       const std::vector<Point<dim>> &,
                       std::vector<double> &)>                                 &function,
                     VectorType                                                &vec_result);

    void throw_linear_solver_failure_exception(const std::string &solver_name,
                                               const std::string &function_name,
                                               const std::vector<SolverControl> &solver_controls,
                                               const std::exception &exc,
                                               const MPI_Comm mpi_communicator,
                                               const std::string &output_filename = "");

    template <int dim>
    class VectorFunctionFromVelocityFunctionObject : public Function<dim>
    {
      public:
        VectorFunctionFromVelocityFunctionObject (const unsigned int n_components,
                                                  const std::function<Tensor<1,dim> (const Point<dim> &)> &function_object);

        double value (const Point<dim>   &p,
                      const unsigned int  component = 0) const override;

        void vector_value (const Point<dim>   &p,
                           Vector<double>     &values) const override;

      private:
        const std::function<Tensor<1,dim> (const Point<dim> &)> function_object;
    };

    template <typename T>
    inline
    std::vector<std::size_t>
    compute_sorting_permutation(const std::vector<T> &vector);

    template <typename T>
    inline
    std::vector<T>
    apply_permutation(
      const std::vector<T> &vector,
      const std::vector<std::size_t> &permutation_vector);

    std::vector<Tensor<2,3>>
    rotation_matrices_random_draw_volume_weighting(const std::vector<double> volume_fractions,
                                                   const std::vector<Tensor<2,3>> rotation_matrices,
                                                   const unsigned int n_output_matrices,
                                                   std::mt19937 &random_number_generator);

    double wrap_angle(const double angle);

    std::array<double,3> zxz_euler_angles_from_rotation_matrix(const Tensor<2,3> &rotation_matrix);

    Tensor<2,3> zxz_euler_angles_to_rotation_matrix(const double phi1,
                                                    const double theta,
                                                    const double phi2);

  }
}


// inline implementations:
#ifndef DOXYGEN
namespace aspect
{
  namespace Utilities
  {

    template <typename T>
    inline
    std::vector<T>
    possibly_extend_from_1_to_N (const std::vector<T> &values,
                                 const unsigned int N,
                                 const std::string &id_text)
    {
      if (values.size() == 1)
        {
          return std::vector<T> (N, values[0]);
        }
      else if (values.size() == N)
        {
          return values;
        }
      else
        {
          // Non-specified behavior
          AssertThrow(false,
                      ExcMessage("Length of " + id_text + " list must be " +
                                 "either one or " + Utilities::to_string(N) +
                                 ". Currently it is " + Utilities::to_string(values.size()) + "."));
        }

      // This should never happen, but return an empty vector so the compiler
      // will be happy
      return std::vector<T> ();
    }

    inline
    void
    extract_composition_values_at_q_point (const std::vector<std::vector<double>> &composition_values,
                                           const unsigned int q,
                                           std::vector<double> &composition_values_at_q_point)
    {
      Assert(q<composition_values.size(), ExcInternalError());
      Assert(composition_values_at_q_point.size() > 0,
             ExcInternalError());

      for (unsigned int k=0; k < composition_values_at_q_point.size(); ++k)
        {
          Assert(composition_values[k].size() == composition_values_at_q_point.size(),
                 ExcInternalError());
          composition_values_at_q_point[k] = composition_values[k][q];
        }
    }

    template <typename T>
    inline
    std::vector<std::size_t>
    compute_sorting_permutation(const std::vector<T> &vector)
    {
      std::vector<std::size_t> p(vector.size());
      std::iota(p.begin(), p.end(), 0);
      std::sort(p.begin(), p.end(),
                [&](std::size_t i, std::size_t j)
      {
        return vector[i] < vector[j];
      });
      return p;
    }

    template <typename T>
    inline
    std::vector<T>
    apply_permutation(
      const std::vector<T> &vector,
      const std::vector<std::size_t> &permutation_vector)
    {
      std::vector<T> sorted_vec(vector.size());
      std::transform(permutation_vector.begin(), permutation_vector.end(), sorted_vec.begin(),
                     [&](std::size_t i)
      {
        return vector[i];
      });
      return sorted_vec;
    }

    namespace Tensors
    {

      SymmetricTensor<4,3>
      rotate_full_stiffness_tensor(const Tensor<2,3> &rotation_tensor, const SymmetricTensor<4,3> &input_tensor);

      SymmetricTensor<2,6>
      rotate_voigt_stiffness_matrix(const Tensor<2,3> &rotation_tensor, const SymmetricTensor<2,6> &input_tensor);

      SymmetricTensor<2,6>
      to_voigt_stiffness_matrix(const SymmetricTensor<4,3> &input_tensor);

      SymmetricTensor<4,3>
      to_full_stiffness_tensor(const SymmetricTensor<2,6> &input_tensor);

      Tensor<1,21>
      to_voigt_stiffness_vector(const SymmetricTensor<2,6> &input_tensor);

      SymmetricTensor<2,6>
      to_voigt_stiffness_matrix(const Tensor<1,21> &input_tensor);

      Tensor<1,21>
      to_voigt_stiffness_vector(const SymmetricTensor<4,3> &input);


      template <int dim>
      const Tensor<dim,dim> &levi_civita();

      // Declare the existence of a specialization:
      template <>
      const Tensor<3,3> &levi_civita<3>();
    }

  }
}
#endif

#endif