From 8c51ade2f97743402830feead1db7ad5135c6ed7 Mon Sep 17 00:00:00 2001 From: Remi Lehe Date: Sun, 26 Jan 2020 14:02:32 -0800 Subject: Started cylindrical implementation --- .../FieldSolver/FiniteDifferenceSolver/EvolveB.cpp | 95 ++++++++++++++++++++-- 1 file changed, 90 insertions(+), 5 deletions(-) (limited to 'Source/FieldSolver/FiniteDifferenceSolver/EvolveB.cpp') diff --git a/Source/FieldSolver/FiniteDifferenceSolver/EvolveB.cpp b/Source/FieldSolver/FiniteDifferenceSolver/EvolveB.cpp index a78fc8602..a1f35f903 100644 --- a/Source/FieldSolver/FiniteDifferenceSolver/EvolveB.cpp +++ b/Source/FieldSolver/FiniteDifferenceSolver/EvolveB.cpp @@ -1,7 +1,11 @@ #include "WarpXAlgorithmSelection.H" -#include "FiniteDifferenceAlgorithms/YeeAlgorithm.H" -#include "FiniteDifferenceAlgorithms/CKCAlgorithm.H" #include "FiniteDifferenceSolver.H" +#ifdef WARPX_DIM_RZ + #include "FiniteDifferenceAlgorithms/YeeAlgorithm.H" +#else + #include "FiniteDifferenceAlgorithms/YeeAlgorithm.H" + #include "FiniteDifferenceAlgorithms/CKCAlgorithm.H" +#endif #include using namespace amrex; @@ -9,19 +13,27 @@ using namespace amrex; void FiniteDifferenceSolver::EvolveB ( VectorField& Bfield, VectorField const& Efield, amrex::Real const dt ) { + +#ifdef WARPX_DIM_RZ + EvolveBCylindrical( Bfield, Efield, dt ); +#else // Select algorithm (The choice of algorithm is a runtime option, // but we compile code for each algorithm, using templates) if (m_fdtd_algo == MaxwellSolverAlgo::Yee){ - EvolveBwithAlgo ( Bfield, Efield, dt ); + EvolveBCartesian ( Bfield, Efield, dt ); } else if (m_fdtd_algo == MaxwellSolverAlgo::CKC) { - EvolveBwithAlgo ( Bfield, Efield, dt ); + EvolveBCartesian ( Bfield, Efield, dt ); } else { amrex::Abort("Unknown algorithm"); } +#endif + } +#ifndef WARPX_DIM_RZ + template -void FiniteDifferenceSolver::EvolveBwithAlgo ( VectorField& Bfield, +void FiniteDifferenceSolver::EvolveBCartesian ( VectorField& Bfield, VectorField const& Efield, amrex::Real const dt ) { @@ -75,3 +87,76 @@ void FiniteDifferenceSolver::EvolveBwithAlgo ( VectorField& Bfield, } } + +#else // corresponds to ifndef WARPX_DIM_RZ + +template +void FiniteDifferenceSolver::EvolveBCylindrical ( VectorField& Bfield, + VectorField const& Efield, + amrex::Real const dt ) { + + // Loop through the grids, and over the tiles within each grid +#ifdef _OPENMP +#pragma omp parallel if (amrex::Gpu::notInLaunchRegion()) +#endif + for ( MFIter mfi(*Bfield[0], TilingIfNotGPU()); mfi.isValid(); ++mfi ) { + + // Extract field data for this grid/tile + auto const& Br = Bfield[0]->array(mfi); + auto const& Bt = Bfield[1]->array(mfi); + auto const& Bz = Bfield[2]->array(mfi); + auto const& Er = Efield[0]->array(mfi); + auto const& Et = Efield[1]->array(mfi); + auto const& Ez = Efield[2]->array(mfi); + + // Extract stencil coefficients + Real const* AMREX_RESTRICT coefs_x = stencil_coefs_x.dataPtr(); + int const n_coefs_x = stencil_coefs_x.size(); + Real const* AMREX_RESTRICT coefs_y = stencil_coefs_y.dataPtr(); + int const n_coefs_y = stencil_coefs_y.size(); + Real const* AMREX_RESTRICT coefs_z = stencil_coefs_z.dataPtr(); + int const n_coefs_z = stencil_coefs_z.size(); + + // Extract tileboxes for which to loop + const Box& tbr = mfi.tilebox(Bfield[0]->ixType().ixType()); + const Box& tbt = mfi.tilebox(Bfield[1]->ixType().ixType()); + const Box& tbz = mfi.tilebox(Bfield[2]->ixType().ixType()); + + // Loop over the cells and update the fields + amrex::ParallelFor(tbr, tbt, tbz, + + [=] AMREX_GPU_DEVICE (int i, int j, int k){ + Br(i, j, 0, 0) += dt * T_Algo::UpwardDz(Et, inv_dz, i, j, 0, 0); // Mode m = 0; + for (int m=1; m