Line data    Source code

       1             : ///////////////////////////////////////////////////////////////////////////////
       2             : // Copyright 2019 Lakshman Anumolu, Raunak Bardia.
       3             : //
       4             : // Redistribution and use in source and binary forms, with or without
       5             : // modification, are permitted provided that the following conditions are
       6             : // met:
       7             : //
       8             : // 1. Redistributions of source code must retain the above copyright notice,
       9             : // this list of conditions and the following disclaimer.
      10             : //
      11             : // 2. Redistributions in binary form must reproduce the above copyright notice,
      12             : // this list of conditions and the following disclaimer in the documentation
      13             : // and/or other materials provided with the distribution.
      14             : //
      15             : // 3. Neither the name of the copyright holder nor the names of its contributors
      16             : // may be used to endorse or promote products derived from this software without
      17             : // specific prior written permission.
      18             : //
      19             : // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
      20             : // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
      21             : // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
      22             : // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
      23             : // HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
      24             : // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
      25             : // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
      26             : // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
      27             : // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
      28             : // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
      29             : // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
      30             : ///////////////////////////////////////////////////////////////////////////////
      31             : 
      32             : #include "gals/cpu/temporal-schemes/semi-lagrangian/euler.h"
      33             : #include "gals/cpu/gradient.h"
      34             : #include "gals/cpu/interpolate.h"
      35             : 
      36             : #include <math.h>
      37             : 
      38             : template <typename T, typename T_GRID>
      39           3 : GALS::TEMPORAL_SCHEMES::SEMI_LAGRANGIAN::Euler<T, T_GRID>::Euler()
      40             : {
      41           3 : }
      42             : 
      43             : template <typename T, typename T_GRID>
      44           3 : GALS::TEMPORAL_SCHEMES::SEMI_LAGRANGIAN::Euler<T, T_GRID>::~Euler()
      45             : {
      46           3 : }
      47             : 
      48             : template <typename T, typename T_GRID>
      49           3 : void GALS::TEMPORAL_SCHEMES::SEMI_LAGRANGIAN::Euler<T, T_GRID>::compute(
      50             :     const T dt, const GALS::CPU::LevelsetVelocity<T_GRID, T> &levelset_velocity,
      51             :     GALS::CPU::Levelset<T_GRID, T> &levelset)
      52             : {
      53           3 :   const auto &grid = levelset.grid();
      54             :   const auto &velocity = levelset_velocity.velocity();
      55             :   const auto &velocity_grad = levelset_velocity.velocityGradient();
      56           6 :   const GALS::CPU::Vec3<int> num_cells = grid.numCells();
      57             :   auto &phi = levelset.phi();
      58             :   auto &psi = levelset.psi();
      59             : 
      60             :   // Compute x_root `root of the characteristic`.
      61           6 :   GALS::CPU::Array<T_GRID, GALS::CPU::Vec3<T>> x_root(grid);
      62             : 
      63          63 :   for (int i = 0; i < num_cells[0]; ++i)
      64         450 :     for (int j = 0; j < num_cells[1]; ++j)
      65        1320 :       for (int k = 0; k < num_cells[2]; ++k) x_root(i, j, k) = grid(i, j, k) - velocity(i, j, k) * dt;
      66             : 
      67             :   // Compute phi_interp_prev, psi_interp_prev at x_root.
      68           3 :   GALS::CPU::Interpolate<T, T_GRID, GALS::INTERPOLATION::Hermite<T, T_GRID>>::compute(x_root, levelset);
      69             : 
      70             :   // Compute x_root_grad.
      71           6 :   GALS::CPU::Array<T_GRID, GALS::CPU::Mat3<T>> x_root_grad(grid);
      72             : 
      73             :   const auto &identity_mat = T_GRID::identity_mat;
      74             : 
      75          63 :   for (int i = 0; i < num_cells[0]; ++i)
      76         450 :     for (int j = 0; j < num_cells[1]; ++j)
      77        1320 :       for (int k = 0; k < num_cells[2]; ++k) x_root_grad(i, j, k) = identity_mat - velocity_grad(i, j, k) * dt;
      78             : 
      79             :   const auto &phi_interp_prev = levelset.phiInterpPrev();
      80             :   const auto &psi_interp_prev = levelset.psiInterpPrev();
      81             : 
      82             :   // Update phi and psi.
      83          63 :   for (int i = 0; i < num_cells[0]; ++i)
      84         450 :     for (int j = 0; j < num_cells[1]; ++j)
      85        2430 :       for (int k = 0; k < num_cells[2]; ++k) {
      86        1110 :         phi(i, j, k) = phi_interp_prev(i, j, k);
      87        1110 :         psi(i, j, k) = x_root_grad(i, j, k).dot(psi_interp_prev(i, j, k));
      88             :       }
      89           3 : }
      90             : 
      91             : template class GALS::TEMPORAL_SCHEMES::SEMI_LAGRANGIAN::Euler<double, GALS::CPU::Grid<double, 1>>;
      92             : template class GALS::TEMPORAL_SCHEMES::SEMI_LAGRANGIAN::Euler<double, GALS::CPU::Grid<double, 2>>;
      93           3 : template class GALS::TEMPORAL_SCHEMES::SEMI_LAGRANGIAN::Euler<double, GALS::CPU::Grid<double, 3>>;