quadratic_least_squares.h

Go to the documentation of this file.

// ------------------------------------------------------
//
// SPDX-License-Identifier: GPL-2.0-or-later
//
// SPDX-FileCopyrightText: Copyright (C) 2019-2024 by the ASPECT authors.
//
// This file is part of ASPECT.
//
// Detailed license information governing the source code and
// contributions can be found in the folder LICENSES and in
// LICENSE and CONTRIBUTING.md at the top level directory.
//
// ------------------------------------------------------

#ifndef _aspect_particle_interpolator_quadratic_least_squares_h
#define _aspect_particle_interpolator_quadratic_least_squares_h

#include <aspect/particle/interpolator/interface.h>
#include <aspect/particle/interpolator/cell_average.h>
#include <aspect/simulator_access.h>

namespace aspect
{
  namespace Particle
  {
    namespace Interpolator
    {
      template <int dim>
      class QuadraticLeastSquares : public Interface<dim>, public aspect::SimulatorAccess<dim>
      {
        public:
          std::vector<std::vector<double>>
          properties_at_points(const ParticleHandler<dim> &particle_handler,
                               const std::vector<Point<dim>> &positions,
                               const ComponentMask &selected_properties,
                               const typename parallel::distributed::Triangulation<dim>::active_cell_iterator &cell) const override;

          // avoid -Woverloaded-virtual:
          using Interface<dim>::properties_at_points;

          static
          void
          declare_parameters (ParameterHandler &prm);

          void
          parse_parameters (ParameterHandler &prm) override;

        private:
          Interpolator::CellAverage<dim> fallback_interpolator;

          ComponentMask use_quadratic_least_squares_limiter;

          ComponentMask use_boundary_extrapolation;

          double evaluate_interpolation_function(const Vector<double> &coefficients, const Point<dim> &position) const;

          std::pair<double, double> get_interpolation_bounds(const ::Vector<double> &coefficients) const;

          /*
           * Find all points that may contain the minimum or maximum values of the interpolation in the cell.
           */
          std::vector<::Point<dim>> get_critical_points(const ::Vector<double> &coefficients) const;

      };
    }
  }
}

#endif