Reference documentation for deal.II version 9.5.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Loading...
Searching...
No Matches
step-81.h
Go to the documentation of this file.
1,
741 *   types::material_id material)
742 *   {
743 *   return (material == 1 ? epsilon_1 : epsilon_2);
744 *   }
745 *  
746 *   template <int dim>
747 *   std::complex<double> Parameters<dim>::mu_inv(const Point<dim> & /*x*/,
748 *   types::material_id material)
749 *   {
750 *   return (material == 1 ? mu_inv_1 : mu_inv_2);
751 *   }
752 *  
753 *   template <int dim>
754 *   typename Parameters<dim>::rank2_type
755 *   Parameters<dim>::sigma(const Point<dim> & /*x*/,
756 *   types::material_id left,
757 *   types::material_id right)
758 *   {
759 *   return (left == right ? rank2_type() : sigma_tensor);
760 *   }
761 *  
762 *   template <int dim>
763 *   typename Parameters<dim>::rank1_type
764 *   Parameters<dim>::J_a(const Point<dim> &point, types::material_id /*id*/)
765 *   {
766 *   rank1_type J_a;
767 *   const auto distance = (dipole_position - point).norm() / dipole_radius;
768 *   if (distance > 1.)
769 *   return J_a;
770 *   double scale = std::cos(distance * M_PI / 2.) *
771 *   std::cos(distance * M_PI / 2.) / (M_PI / 2. - 2. / M_PI) /
772 *   dipole_radius / dipole_radius;
773 *   J_a = dipole_strength * dipole_orientation * scale;
774 *   return J_a;
775 *   }
776 *  
777 * @endcode
778 *
779 *
780 * <a name="PerfectlyMatchedLayerClass"></a>
781 * <h4>PerfectlyMatchedLayer Class</h4>
782 * The PerfectlyMatchedLayer class inherits ParameterAcceptor as well. It
783 * implements the transformation matrices used to modify the permittivity
784 * and permeability tensors supplied from the Parameters class. The
785 * actual transformation of the material tensors will be done in the
786 * assembly loop. The radii and the strength of the PML is specified, and
787 * the coefficients will be modified using transformation matrices within
788 * the PML region. The radii and strength of the PML are editable through
789 * a .prm file. The rotation function @f$T_{exer}@f$ is the same as
790 * introduced in the perfectly matched layer section of the introduction.
791 * Similarly, the matrices A, B and C are defined as follows
792 * @f[
793 * A = T_{e_xe_r}^{-1}
794 * \text{diag}\left(\frac{1}{\bar{d}^2},\frac{1}{d\bar{d}}\right)T_{e_xe_r},\qquad
795 * B = T_{e_xe_r}^{-1} \text{diag}\left(d,\bar{d}\right)T_{e_xe_r},\qquad
796 * C = T_{e_xe_r}^{-1} \text{diag}\left(\frac{1}{\bar{d}},\frac{1}{d}\right)
797 * T_{e_xe_r}.\qquad
798 * @f]
799 *
800
801 *
802 *
803 * @code
804 *   template <int dim>
805 *   class PerfectlyMatchedLayer : public ParameterAcceptor
806 *   {
807 *   public:
808 *   static_assert(dim == 2,
809 *   "The perfectly matched layer is only implemented in 2d.");
810 *  
811 *   Parameters<dim> parameters;
812 *  
813 *   using rank1_type = Tensor<1, dim, std::complex<double>>;
814 *  
815 *   using rank2_type = Tensor<2, dim, std::complex<double>>;
816 *  
817 *   PerfectlyMatchedLayer();
818 *  
819 *   std::complex<double> d(const Point<dim> point);
820 *  
821 *   std::complex<double> d_bar(const Point<dim> point);
822 *  
823 *  
824 *   rank2_type rotation(std::complex<double> d_1,
825 *   std::complex<double> d_2,
826 *   Point<dim> point);
827 *  
828 *   rank2_type a_matrix(const Point<dim> point);
829 *  
830 *   rank2_type b_matrix(const Point<dim> point);
831 *  
832 *   rank2_type c_matrix(const Point<dim> point);
833 *  
834 *   private:
835 *   double inner_radius;
836 *   double outer_radius;
837 *   double strength;
838 *   };
839 *  
840 *  
841 *   template <int dim>
842 *   PerfectlyMatchedLayer<dim>::PerfectlyMatchedLayer()
843 *   : ParameterAcceptor("PerfectlyMatchedLayer")
844 *   {
845 *   inner_radius = 12.;
846 *   add_parameter("inner radius",
847 *   inner_radius,
848 *   "inner radius of the PML shell");
849 *   outer_radius = 20.;
850 *   add_parameter("outer radius",
851 *   outer_radius,
852 *   "outer radius of the PML shell");
853 *   strength = 8.;
854 *   add_parameter("strength", strength, "strength of the PML");
855 *   }
856 *  
857 *  
858 *   template <int dim>
859 *   typename std::complex<double>
860 *   PerfectlyMatchedLayer<dim>::d(const Point<dim> point)
861 *   {
862 *   const auto radius = point.norm();
863 *   if (radius > inner_radius)
864 *   {
865 *   const double s =
866 *   strength * ((radius - inner_radius) * (radius - inner_radius)) /
867 *   ((outer_radius - inner_radius) * (outer_radius - inner_radius));
868 *   return {1.0, s};
869 *   }
870 *   else
871 *   {
872 *   return 1.0;
873 *   }
874 *   }
875 *  
876 *  
877 *   template <int dim>
878 *   typename std::complex<double>
879 *   PerfectlyMatchedLayer<dim>::d_bar(const Point<dim> point)
880 *   {
881 *   const auto radius = point.norm();
882 *   if (radius > inner_radius)
883 *   {
884 *   const double s_bar =
885 *   strength / 3. *
886 *   ((radius - inner_radius) * (radius - inner_radius) *
887 *   (radius - inner_radius)) /
888 *   (radius * (outer_radius - inner_radius) *
889 *   (outer_radius - inner_radius));
890 *   return {1.0, s_bar};
891 *   }
892 *   else
893 *   {
894 *   return 1.0;
895 *   }
896 *   }
897 *  
898 *  
899 *   template <int dim>
900 *   typename PerfectlyMatchedLayer<dim>::rank2_type
901 *   PerfectlyMatchedLayer<dim>::rotation(std::complex<double> d_1,
902 *   std::complex<double> d_2,
903 *   Point<dim> point)
904 *   {
905 *   rank2_type result;
906 *   result[0][0] = point[0] * point[0] * d_1 + point[1] * point[1] * d_2;
907 *   result[0][1] = point[0] * point[1] * (d_1 - d_2);
908 *   result[1][0] = point[0] * point[1] * (d_1 - d_2);
909 *   result[1][1] = point[1] * point[1] * d_1 + point[0] * point[0] * d_2;
910 *   return result;
911 *   }
912 *  
913 *  
914 *   template <int dim>
915 *   typename PerfectlyMatchedLayer<dim>::rank2_type
916 *   PerfectlyMatchedLayer<dim>::a_matrix(const Point<dim> point)
917 *   {
918 *   const auto d = this->d(point);
919 *   const auto d_bar = this->d_bar(point);
920 *   return invert(rotation(d * d, d * d_bar, point)) *
921 *   rotation(d * d, d * d_bar, point);
922 *   }
923 *  
924 *  
925 *   template <int dim>
926 *   typename PerfectlyMatchedLayer<dim>::rank2_type
927 *   PerfectlyMatchedLayer<dim>::b_matrix(const Point<dim> point)
928 *   {
929 *   const auto d = this->d(point);
930 *   const auto d_bar = this->d_bar(point);
931 *   return invert(rotation(d, d_bar, point)) * rotation(d, d_bar, point);
932 *   }
933 *  
934 *  
935 *   template <int dim>
936 *   typename PerfectlyMatchedLayer<dim>::rank2_type
937 *   PerfectlyMatchedLayer<dim>::c_matrix(const Point<dim> point)
938 *   {
939 *   const auto d = this->d(point);
940 *   const auto d_bar = this->d_bar(point);
941 *   return invert(rotation(1. / d_bar, 1. / d, point)) *
942 *   rotation(1. / d_bar, 1. / d, point);
943 *   }
944 *  
945 *  
946 * @endcode
947 *
948 *
949 * <a name="MaxwellClass"></a>
950 * <h4>Maxwell Class</h4>
951 * At this point we are ready to declare all the major building blocks of
952 * the finite element program which consists of the usual setup and
953 * assembly routines. Most of the structure has already been introduced
954 * in previous tutorial programs. The Maxwell class also holds private
955 * instances of the Parameters and PerfectlyMatchedLayers classes
956 * introduced above. The default values of these parameters are set to
957 * show us a standing wave with absorbing boundary conditions and a PML.
958 *
959
960 *
961 *
962 * @code
963 *   template <int dim>
964 *   class Maxwell : public ParameterAcceptor
965 *   {
966 *   public:
967 *   Maxwell();
968 *   void run();
969 *  
970 *   private:
971 *   /* run time parameters */
972 *   double scaling;
973 *   unsigned int refinements;
974 *   unsigned int fe_order;
975 *   unsigned int quadrature_order;
976 *   bool absorbing_boundary;
977 *  
978 *   void parse_parameters_callback();
979 *   void make_grid();
980 *   void setup_system();
981 *   void assemble_system();
982 *   void solve();
983 *   void output_results();
984 *  
985 *   Parameters<dim> parameters;
986 *   PerfectlyMatchedLayer<dim> perfectly_matched_layer;
987 *  
989 *   DoFHandler<dim> dof_handler;
990 *  
991 *   std::unique_ptr<FiniteElement<dim>> fe;
992 *  
993 *   AffineConstraints<double> constraints;
994 *   SparsityPattern sparsity_pattern;
995 *   SparseMatrix<double> system_matrix;
996 *   Vector<double> solution;
997 *   Vector<double> system_rhs;
998 *   };
999 *  
1000 * @endcode
1001 *
1002 *
1003 * <a name="ClassTemplateDefinitionsandImplementation"></a>
1004 * <h3>Class Template Definitions and Implementation</h3>
1005 *
1006
1007 *
1008 *
1009 * <a name="TheConstructor"></a>
1010 * <h4>The Constructor</h4>
1011 * The Constructor simply consists of default initialization a number of
1012 * discretization parameters (such as the domain size, mesh refinement,
1013 * and the order of finite elements and quadrature) and declaring a
1014 * corresponding entry via ParameterAcceptor::add_parameter(). All of
1015 * these can be modified by editing the .prm file. Absorbing boundary
1016 * conditions can be controlled with the absorbing_boundary boolean. If
1017 * absorbing boundary conditions are disabled we simply enforce
1018 * homogeneous Dirichlet conditions on the tangential component of the
1019 * electric field. In the context of time-harmonic Maxwell's equations
1020 * these are also known as perfectly conducting boundary conditions.
1021 *
1022
1023 *
1024 *
1025 * @code
1026 *   template <int dim>
1027 *   Maxwell<dim>::Maxwell()
1028 *   : ParameterAcceptor("Maxwell")
1029 *   , dof_handler(triangulation)
1030 *   {
1031 *   ParameterAcceptor::parse_parameters_call_back.connect(
1032 *   [&]() { parse_parameters_callback(); });
1033 *  
1034 *   scaling = 20;
1035 *   add_parameter("scaling", scaling, "scale of the hypercube geometry");
1036 *  
1037 *   refinements = 8;
1038 *   add_parameter("refinements",
1039 *   refinements,
1040 *   "number of refinements of the geometry");
1041 *  
1042 *   fe_order = 0;
1043 *   add_parameter("fe order", fe_order, "order of the finite element space");
1044 *  
1045 *   quadrature_order = 1;
1046 *   add_parameter("quadrature order",
1047 *   quadrature_order,
1048 *   "order of the quadrature");
1049 *  
1050 *   absorbing_boundary = true;
1051 *   add_parameter("absorbing boundary condition",
1052 *   absorbing_boundary,
1053 *   "use absorbing boundary conditions?");
1054 *   }
1055 *  
1056 *  
1057 *   template <int dim>
1058 *   void Maxwell<dim>::parse_parameters_callback()
1059 *   {
1060 *   fe = std::make_unique<FESystem<dim>>(FE_NedelecSZ<dim>(fe_order), 2);
1061 *   }
1062 *  
1063 * @endcode
1064 *
1065 * The Maxwell::make_grid() routine creates the mesh for the
1066 * computational domain which in our case is a scaled square domain.
1067 * Additionally, a material interface is introduced by setting the
1068 * material id of the upper half (@f$y>0@f$) to 1 and of the lower half
1069 * (@f$y<0@f$) of the computational domain to 2.
1070 * We are using a block decomposition into real and imaginary matrices
1071 * for the solution matrices. More details on this are available
1072 * under the Results section.
1073 *
1074
1075 *
1076 *
1077 * @code
1078 *   template <int dim>
1079 *   void Maxwell<dim>::make_grid()
1080 *   {
1081 *   GridGenerator::hyper_cube(triangulation, -scaling, scaling);
1082 *   triangulation.refine_global(refinements);
1083 *  
1084 *   if (!absorbing_boundary)
1085 *   {
1086 *   for (auto &face : triangulation.active_face_iterators())
1087 *   if (face->at_boundary())
1088 *   face->set_boundary_id(1);
1089 *   };
1090 *  
1091 *   for (auto &cell : triangulation.active_cell_iterators())
1092 *   if (cell->center()[1] > 0.)
1093 *   cell->set_material_id(1);
1094 *   else
1095 *   cell->set_material_id(2);
1096 *  
1097 *  
1098 *   std::cout << "Number of active cells: " << triangulation.n_active_cells()
1099 *   << std::endl;
1100 *   }
1101 *  
1102 * @endcode
1103 *
1104 * The Maxwell::setup_system() routine follows the usual routine of
1105 * enumerating all the degrees of freedom and setting up the matrix and
1106 * vector objects to hold the system data. Enumerating is done by using
1107 * DoFHandler::distribute_dofs().
1108 *
1109
1110 *
1111 *
1112 * @code
1113 *   template <int dim>
1114 *   void Maxwell<dim>::setup_system()
1115 *   {
1116 *   dof_handler.distribute_dofs(*fe);
1117 *   std::cout << "Number of degrees of freedom: " << dof_handler.n_dofs()
1118 *   << std::endl;
1119 *  
1120 *   solution.reinit(dof_handler.n_dofs());
1121 *   system_rhs.reinit(dof_handler.n_dofs());
1122 *  
1123 *   constraints.clear();
1124 *  
1125 *   DoFTools::make_hanging_node_constraints(dof_handler, constraints);
1126 *  
1127 *   VectorTools::project_boundary_values_curl_conforming_l2(
1128 *   dof_handler,
1129 *   0, /* real part */
1130 *   Functions::ZeroFunction<dim>(2 * dim),
1131 *   0, /* boundary id */
1132 *   constraints);
1133 *   VectorTools::project_boundary_values_curl_conforming_l2(
1134 *   dof_handler,
1135 *   dim, /* imaginary part */
1136 *   Functions::ZeroFunction<dim>(2 * dim),
1137 *   0, /* boundary id */
1138 *   constraints);
1139 *  
1140 *   constraints.close();
1141 *  
1142 *   DynamicSparsityPattern dsp(dof_handler.n_dofs(), dof_handler.n_dofs());
1143 *   DoFTools::make_sparsity_pattern(dof_handler,
1144 *   dsp,
1145 *   constraints,
1146 *   /* keep_constrained_dofs = */ true);
1147 *   sparsity_pattern.copy_from(dsp);
1148 *   system_matrix.reinit(sparsity_pattern);
1149 *   }
1150 *  
1151 * @endcode
1152 *
1153 * This is a helper function that takes the tangential component of a tensor.
1154 *
1155 * @code
1156 *   template <int dim>
1157 *   DEAL_II_ALWAYS_INLINE inline Tensor<1, dim, std::complex<double>>
1158 *   tangential_part(const Tensor<1, dim, std::complex<double>> &tensor,
1159 *   const Tensor<1, dim> & normal)
1160 *   {
1161 *   auto result = tensor;
1162 *   result[0] = normal[1] * (tensor[0] * normal[1] - tensor[1] * normal[0]);
1163 *   result[1] = -normal[0] * (tensor[0] * normal[1] - tensor[1] * normal[0]);
1164 *   return result;
1165 *   }
1166 *  
1167 *  
1168 * @endcode
1169 *
1170 * Assemble the stiffness matrix and the right-hand side:
1171 * \f{align*}{
1172 * A_{ij} = \int_\Omega (\mu_r^{-1}\nabla \times \varphi_j) \cdot
1173 * (\nabla\times\bar{\varphi}_i)\text{d}x
1174 * - \int_\Omega \varepsilon_r\varphi_j \cdot \bar{\varphi}_i\text{d}x
1175 * - i\int_\Sigma (\sigma_r^{\Sigma}(\varphi_j)_T) \cdot
1176 * (\bar{\varphi}_i)_T\text{do}x
1177 * - i\int_{\partial\Omega} (\sqrt{\mu_r^{-1}\varepsilon}(\varphi_j)_T) \cdot
1178 * (\nabla\times(\bar{\varphi}_i)_T)\text{d}x, \f} \f{align}{
1179 * F_i = i\int_\Omega J_a \cdot \bar{\varphi_i}\text{d}x - \int_\Omega
1180 * \mu_r^{-1} \cdot (\nabla \times \bar{\varphi_i}) \text{d}x.
1181 * \f}
1182 * In addition, we will be modifying the coefficients if the position of the
1183 * cell is within the PML region.
1184 *
1185
1186 *
1187 *
1188 * @code
1189 *   template <int dim>
1190 *   void Maxwell<dim>::assemble_system()
1191 *   {
1192 *   QGauss<dim> quadrature_formula(quadrature_order);
1193 *   QGauss<dim - 1> face_quadrature_formula(quadrature_order);
1194 *  
1195 *   FEValues<dim, dim> fe_values(*fe,
1196 *   quadrature_formula,
1197 *   update_values | update_gradients |
1198 *   update_quadrature_points |
1199 *   update_JxW_values);
1200 *   FEFaceValues<dim, dim> fe_face_values(*fe,
1201 *   face_quadrature_formula,
1202 *   update_values | update_gradients |
1203 *   update_quadrature_points |
1204 *   update_normal_vectors |
1205 *   update_JxW_values);
1206 *  
1207 *   const unsigned int dofs_per_cell = fe->dofs_per_cell;
1208 *  
1209 *   const unsigned int n_q_points = quadrature_formula.size();
1210 *   const unsigned int n_face_q_points = face_quadrature_formula.size();
1211 *  
1212 *   FullMatrix<double> cell_matrix(dofs_per_cell, dofs_per_cell);
1213 *   Vector<double> cell_rhs(dofs_per_cell);
1214 *   std::vector<types::global_dof_index> local_dof_indices(dofs_per_cell);
1215 *  
1216 * @endcode
1217 *
1218 * This is assembling the interior of the domain on the left hand side.
1219 * So we are assembling
1220 * \f{align*}{
1221 * \int_\Omega (\mu_r^{-1}\nabla \times \varphi_i) \cdot
1222 * (\nabla\times\bar{\varphi}_j)\text{d}x
1223 * - \int_\Omega \varepsilon_r\varphi_i \cdot \bar{\varphi}_j\text{d}x
1224 * \f}
1225 * and
1226 * \f{align}{
1227 * i\int_\Omega J_a \cdot \bar{\varphi_i}\text{d}x
1228 * - \int_\Omega \mu_r^{-1} \cdot (\nabla \times \bar{\varphi_i}) \text{d}x.
1229 * \f}
1230 * In doing so, we need test functions @f$\varphi_i@f$ and @f$\varphi_j@f$, and the
1231 * curl of these test variables. We must be careful with the signs of the
1232 * imaginary parts of these complex test variables. Moreover, we have a
1233 * conditional that changes the parameters if the cell is in the PML region.
1234 *
1235 * @code
1236 *   for (const auto &cell : dof_handler.active_cell_iterators())
1237 *   {
1238 *   fe_values.reinit(cell);
1239 *   FEValuesViews::Vector<dim> real_part(fe_values, 0);
1240 *   FEValuesViews::Vector<dim> imag_part(fe_values, dim);
1241 *  
1242 *   cell_matrix = 0.;
1243 *   cell_rhs = 0.;
1244 *  
1245 *   cell->get_dof_indices(local_dof_indices);
1246 *   const auto id = cell->material_id();
1247 *  
1248 *   const auto &quadrature_points = fe_values.get_quadrature_points();
1249 *  
1250 *   for (unsigned int q_point = 0; q_point < n_q_points; ++q_point)
1251 *   {
1252 *   const Point<dim> &position = quadrature_points[q_point];
1253 *  
1254 *   auto mu_inv = parameters.mu_inv(position, id);
1255 *   auto epsilon = parameters.epsilon(position, id);
1256 *   const auto J_a = parameters.J_a(position, id);
1257 *  
1258 *   const auto A = perfectly_matched_layer.a_matrix(position);
1259 *   const auto B = perfectly_matched_layer.b_matrix(position);
1260 *   const auto d = perfectly_matched_layer.d(position);
1261 *  
1262 *   mu_inv = mu_inv / d;
1263 *   epsilon = invert(A) * epsilon * invert(B);
1264 *  
1265 *   for (const auto i : fe_values.dof_indices())
1266 *   {
1267 *   constexpr std::complex<double> imag{0., 1.};
1268 *  
1269 *   const auto phi_i = real_part.value(i, q_point) -
1270 *   imag * imag_part.value(i, q_point);
1271 *   const auto curl_phi_i = real_part.curl(i, q_point) -
1272 *   imag * imag_part.curl(i, q_point);
1273 *  
1274 *   const auto rhs_value =
1275 *   (imag * scalar_product(J_a, phi_i)) * fe_values.JxW(q_point);
1276 *   cell_rhs(i) += rhs_value.real();
1277 *  
1278 *   for (const auto j : fe_values.dof_indices())
1279 *   {
1280 *   const auto phi_j = real_part.value(j, q_point) +
1281 *   imag * imag_part.value(j, q_point);
1282 *   const auto curl_phi_j = real_part.curl(j, q_point) +
1283 *   imag * imag_part.curl(j, q_point);
1284 *  
1285 *   const auto temp =
1286 *   (scalar_product(mu_inv * curl_phi_j, curl_phi_i) -
1287 *   scalar_product(epsilon * phi_j, phi_i)) *
1288 *   fe_values.JxW(q_point);
1289 *   cell_matrix(i, j) += temp.real();
1290 *   }
1291 *   }
1292 *   }
1293 *  
1294 * @endcode
1295 *
1296 * Now we assemble the face and the boundary. The following loops will
1297 * assemble
1298 * \f{align*}{
1299 * - i\int_\Sigma (\sigma_r^{\Sigma}(\varphi_i)_T) \cdot
1300 * (\bar{\varphi}_j)_T\text{do}x \f} and \f{align}{
1301 * - i\int_{\partial\Omega} (\sqrt{\mu_r^{-1}\varepsilon}(\varphi_i)_T)
1302 * \cdot (\nabla\times(\bar{\varphi}_j)_T)\text{d}x,
1303 * \f}
1304 * respectively. The test variables and the PML are implemented
1305 * similarly as the domain.
1306 *
1307 * @code
1308 *   for (const auto &face : cell->face_iterators())
1309 *   {
1310 *   if (face->at_boundary())
1311 *   {
1312 *   const auto id = face->boundary_id();
1313 *   if (id != 0)
1314 *   {
1315 *   fe_face_values.reinit(cell, face);
1316 *   FEValuesViews::Vector<dim> real_part(fe_face_values, 0);
1317 *   FEValuesViews::Vector<dim> imag_part(fe_face_values, dim);
1318 *  
1319 *   for (unsigned int q_point = 0; q_point < n_face_q_points;
1320 *   ++q_point)
1321 *   {
1322 *   const auto &position = quadrature_points[q_point];
1323 *  
1324 *   auto mu_inv = parameters.mu_inv(position, id);
1325 *   auto epsilon = parameters.epsilon(position, id);
1326 *  
1327 *   const auto A =
1328 *   perfectly_matched_layer.a_matrix(position);
1329 *   const auto B =
1330 *   perfectly_matched_layer.b_matrix(position);
1331 *   const auto d = perfectly_matched_layer.d(position);
1332 *  
1333 *   mu_inv = mu_inv / d;
1334 *   epsilon = invert(A) * epsilon * invert(B);
1335 *  
1336 *   const auto normal =
1337 *   fe_face_values.normal_vector(q_point);
1338 *  
1339 *   for (const auto i : fe_face_values.dof_indices())
1340 *   {
1341 *   constexpr std::complex<double> imag{0., 1.};
1342 *  
1343 *   const auto phi_i =
1344 *   real_part.value(i, q_point) -
1345 *   imag * imag_part.value(i, q_point);
1346 *   const auto phi_i_T = tangential_part(phi_i, normal);
1347 *  
1348 *   for (const auto j : fe_face_values.dof_indices())
1349 *   {
1350 *   const auto phi_j =
1351 *   real_part.value(j, q_point) +
1352 *   imag * imag_part.value(j, q_point);
1353 *   const auto phi_j_T =
1354 *   tangential_part(phi_j, normal) *
1355 *   fe_face_values.JxW(q_point);
1356 *  
1357 *   const auto prod = mu_inv * epsilon;
1358 *   const auto sqrt_prod = prod;
1359 *  
1360 *   const auto temp =
1361 *   -imag * scalar_product((sqrt_prod * phi_j_T),
1362 *   phi_i_T);
1363 *   cell_matrix(i, j) += temp.real();
1364 *   } /* j */
1365 *   } /* i */
1366 *   } /* q_point */
1367 *   }
1368 *   }
1369 *   else
1370 *   {
1371 * @endcode
1372 *
1373 * We are on an interior face:
1374 *
1375 * @code
1376 *   const auto face_index = cell->face_iterator_to_index(face);
1377 *  
1378 *   const auto id1 = cell->material_id();
1379 *   const auto id2 = cell->neighbor(face_index)->material_id();
1380 *  
1381 *   if (id1 == id2)
1382 *   continue; /* skip this face */
1383 *  
1384 *   fe_face_values.reinit(cell, face);
1385 *   FEValuesViews::Vector<dim> real_part(fe_face_values, 0);
1386 *   FEValuesViews::Vector<dim> imag_part(fe_face_values, dim);
1387 *  
1388 *   for (unsigned int q_point = 0; q_point < n_face_q_points;
1389 *   ++q_point)
1390 *   {
1391 *   const auto &position = quadrature_points[q_point];
1392 *  
1393 *   auto sigma = parameters.sigma(position, id1, id2);
1394 *  
1395 *   const auto B = perfectly_matched_layer.b_matrix(position);
1396 *   const auto C = perfectly_matched_layer.c_matrix(position);
1397 *   sigma = invert(C) * sigma * invert(B);
1398 *  
1399 *   const auto normal = fe_face_values.normal_vector(q_point);
1400 *  
1401 *   for (const auto i : fe_face_values.dof_indices())
1402 *   {
1403 *   constexpr std::complex<double> imag{0., 1.};
1404 *  
1405 *   const auto phi_i = real_part.value(i, q_point) -
1406 *   imag * imag_part.value(i, q_point);
1407 *   const auto phi_i_T = tangential_part(phi_i, normal);
1408 *  
1409 *   for (const auto j : fe_face_values.dof_indices())
1410 *   {
1411 *   const auto phi_j =
1412 *   real_part.value(j, q_point) +
1413 *   imag * imag_part.value(j, q_point);
1414 *   const auto phi_j_T = tangential_part(phi_j, normal);
1415 *  
1416 *   const auto temp =
1417 *   -imag *
1418 *   scalar_product((sigma * phi_j_T), phi_i_T) *
1419 *   fe_face_values.JxW(q_point);
1420 *   cell_matrix(i, j) += temp.real();
1421 *   } /* j */
1422 *   } /* i */
1423 *   } /* q_point */
1424 *   }
1425 *   }
1426 *  
1427 *   constraints.distribute_local_to_global(
1428 *   cell_matrix, cell_rhs, local_dof_indices, system_matrix, system_rhs);
1429 *   }
1430 *   }
1431 *  
1432 * @endcode
1433 *
1434 * We use a direct solver from the SparseDirectUMFPACK to solve the system
1435 *
1436 * @code
1437 *   template <int dim>
1438 *   void Maxwell<dim>::solve()
1439 *   {
1440 *   SparseDirectUMFPACK A_direct;
1441 *   A_direct.initialize(system_matrix);
1442 *   A_direct.vmult(solution, system_rhs);
1443 *   }
1444 *  
1445 * @endcode
1446 *
1447 * The output is written into a vtk file with 4 components
1448 *
1449 * @code
1450 *   template <int dim>
1451 *   void Maxwell<dim>::output_results()
1452 *   {
1453 *   DataOut<2> data_out;
1454 *   data_out.attach_dof_handler(dof_handler);
1455 *   data_out.add_data_vector(solution,
1456 *   {"real_Ex", "real_Ey", "imag_Ex", "imag_Ey"});
1457 *   data_out.build_patches();
1458 *   std::ofstream output("solution.vtk");
1459 *   data_out.write_vtk(output);
1460 *   }
1461 *  
1462 *  
1463 *   template <int dim>
1464 *   void Maxwell<dim>::run()
1465 *   {
1466 *   make_grid();
1467 *   setup_system();
1468 *   assemble_system();
1469 *   solve();
1470 *   output_results();
1471 *   }
1472 *  
1473 *   } // namespace Step81
1474 *  
1475 * @endcode
1476 *
1477 * The following main function calls the class @ref step_81 "step-81"(), initializes the
1478 * ParameterAcceptor, and calls the run() function.
1479 *
1480
1481 *
1482 *
1483 * @code
1484 *   int main()
1485 *   {
1486 *   try
1487 *   {
1488 *   using namespace dealii;
1489 *  
1490 *   Step81::Maxwell<2> maxwell_2d;
1491 *   ParameterAcceptor::initialize("parameters.prm");
1492 *   maxwell_2d.run();
1493 *   }
1494 *   catch (std::exception &exc)
1495 *   {
1496 *   std::cerr << std::endl
1497 *   << std::endl
1498 *   << "----------------------------------------------------"
1499 *   << std::endl;
1500 *   std::cerr << "Exception on processing: " << std::endl
1501 *   << exc.what() << std::endl
1502 *   << "Aborting!" << std::endl
1503 *   << "----------------------------------------------------"
1504 *   << std::endl;
1505 *   return 1;
1506 *   }
1507 *   catch (...)
1508 *   {
1509 *   std::cerr << std::endl
1510 *   << std::endl
1511 *   << "----------------------------------------------------"
1512 *   << std::endl;
1513 *   std::cerr << "Unknown exception!" << std::endl
1514 *   << "Aborting!" << std::endl
1515 *   << "----------------------------------------------------"
1516 *   << std::endl;
1517 *   return 1;
1518 *   }
1519 *   return 0;
1520 *   }
1521 * @endcode
1522<a name="Results"></a><h1>Results</h1>
1523
1524
1525The solution is written to a .vtk file with four components. These are the
1526real and imaginary parts of the @f$E_x@f$ and @f$E_y@f$ solution waves. With the
1527current setup, the output should read
1528
1529@code
1530Number of active cells: 4096
1531Number of degrees of freedom: 16640
1532Program ended with exit code: 0
1533@endcode
1534
1535<a name="AbsorbingboundaryconditionsandthePML"></a><h3> Absorbing boundary conditions and the PML </h3>
1536
1537
1538The following images are the outputs for the imaginary @f$E_x@f$ without the
1539interface and with the dipole centered at @f$(0,0)@f$. In order to remove the
1540interface, the surface conductivity is set to 0. First, we turn off the
1541absorbing boundary conditions and the PML. Second, we want to see the
1542effect of the PML when absorbing boundary conditions apply. So we set
1543absorbing boundary conditions to true and leave the PML strength to 0.
1544Lastly, we increase the strength of the PML to 4. Change the following in
1545the .prm file :
1546
1547@code
1548# use absorbing boundary conditions?
1549 set absorbing boundary condition = false
1550
1551# position of the dipole
1552 set dipole position = 0, 0
1553
1554# strength of the PML
1555 set strength = 0
1556
1557# surface conductivity between material 1 and material 2
1558 set sigma = 0, 0; 0, 0| 0, 0; 0, 0
1559@endcode
1560
1561Following are the output images:
1562
1563<table width="80%" align="center">
1564 <tr>
1565 <td align="center">
1566 <img src="https://www.dealii.org/images/steps/developer/step-81-nointerface_noabs_PML0.png" alt="Visualization of the solution of step-81 with no interface, Dirichlet boundary conditions and PML strength 0" height="210"/>
1567 <p> Solution with no interface, Dirichlet boundary conditions and PML strength 0.</p>
1568 </td>
1569 <td></td>
1570 <td align="center">
1571 <img src="https://www.dealii.org/images/steps/developer/step-81-nointerface_abs_PML0.png" alt="Visualization of the solution of step-81 with no interface, absorbing boundary conditions and PML strength 0" height="210">
1572 <p> Solution with no interface, absorbing boundary conditions and PML strength 0.</p>
1573 </td>
1574 <td></td>
1575 <td align="center">
1576 <img src="https://www.dealii.org/images/steps/developer/step-81-nointerface_abs_PML4.png" alt="Visualization of the solution of step-81 with no interface, absorbing boundary conditions and PML strength 4" height="210">
1577 <p> Solution with no interface, absorbing boundary conditions and PML strength 4.</p>
1578 </td>
1579 </tr>
1580</table>
1581
1582We observe that with absorbing boundary conditions and in absence of the
1583PML, there is a lot of distortion and resonance (the real parts will not be
1584generated without a PML). This is, as we stipulated, due to reflection from
1585infinity. As we see, a much more coherent image is generated with an
1586appropriate PML.
1587
1588<a name="SurfacePlasmonPolariton"></a><h3> Surface Plasmon Polariton </h3>
1589
1590Now, let's generate a standing wave by adding an interface at the center.
1591In order to observe this effect, we offset the center of the dipole to @f$(0,
15920.8)@f$ and set the surface conductivity back to @f$(0.001, 0.2)@f$:
1593
1594@code
1595# position of the dipole
1596 set dipole position = 0, 0.8
1597
1598# surface conductivity between material 1 and material 2
1599 set sigma = 0.001, 0.2; 0, 0| 0, 0; 0.001, 0.2
1600@endcode
1601
1602Once again, we will visualize the output with absorbing boundary conditions
1603and PML strength 0 and with absorbing boundary conditions and PML strength
16044. The following tables are the imaginary part of @f$E_x@f$ and the real part
1605of @f$E_x@f$.
1606
1607<table width="80%" align="center">
1608 <tr>
1609 <td align="center">
1610 <img src="https://www.dealii.org/images/steps/developer/step-81-imagEx_noabs_PML0.png" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1611 <p> Solution with an interface, Dirichlet boundary conditions and PML strength 0.</p>
1612 </td>
1613 <td></td>
1614 <td align="center">
1615 <img src="https://www.dealii.org/images/steps/developer/step-81-imagEx_abs_PML0.png" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1616 <p> Solution with an interface, absorbing boundary conditions and PML strength 0.</p>
1617 </td>
1618 <td></td>
1619 <td align="center">
1620 <img src="https://www.dealii.org/images/steps/developer/step-81-imagEx_abs_PML4.png" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 4" height="210">
1621 <p> Solution with an interface, absorbing boundary conditions and PML strength 4.</p>
1622 </td>
1623 </tr>
1624</table>
1625
1626
1627<table width="80%" align="center">
1628 <tr>
1629 <td align="center">
1630 <img src="https://www.dealii.org/images/steps/developer/step-81-realEx_noabs_PML0.png" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1631 <p> Solution with an interface, Dirichlet boundary conditions and PML strength 0.</p>
1632 </td>
1633 <td></td>
1634 <td align="center">
1635 <img src="https://www.dealii.org/images/steps/developer/step-81-realEx_abs_PML0.png" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1636 <p> Solution with an interface, absorbing boundary conditions and PML strength 0.</p>
1637 </td>
1638 <td></td>
1639 <td align="center">
1640 <img src="https://www.dealii.org/images/steps/developer/step-81-realEx_abs_PML4.png" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 4" height="210">
1641 <p> Solution with an interface, absorbing boundary conditions and PML strength 4.</p>
1642 </td>
1643 </tr>
1644</table>
1645
1646The SPP is confined near the interface that we created, however without
1647absorbing boundary conditions, we don't observe a dissipation effect. On
1648adding the absorbing boundary conditions, we observe distortion and
1649resonance and we still don't notice any dissipation. As expected, the PML
1650removes the distortion and resonance. The standing wave is also dissipating
1651and getting absorbed within the PML, and as we increase the PML strength,
1652the standing wave will dissipate more within the PML ring.
1653
1654Here are some animations to demonstrate the effect of the PML
1655<table width="80%" align="center">
1656 <tr>
1657 <td align="center">
1658 <img src="https://www.dealii.org/images/steps/developer/step-81-dirichlet_Ex.gif" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1659 <p> Solution with an interface, Dirichlet boundary conditions and PML strength 0.</p>
1660 </td>
1661 <td></td>
1662 <td align="center">
1663 <img src="https://www.dealii.org/images/steps/developer/step-81-absorbing_Ex.gif" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1664 <p> Solution with an interface, absorbing boundary conditions and PML strength 0.</p>
1665 </td>
1666 <td></td>
1667 <td align="center">
1668 <img src="https://www.dealii.org/images/steps/developer/step-81-perfectly_matched_layer_Ex.gif" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 4" height="210">
1669 <p> Solution with an interface, absorbing boundary conditions and PML strength 4.</p>
1670 </td>
1671 </tr>
1672</table>
1673
1674
1675<table width="80%" align="center">
1676 <tr>
1677 <td align="center">
1678 <img src="https://www.dealii.org/images/steps/developer/step-81-dirichlet_Ey.gif" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1679 <p> Solution with an interface, Dirichlet boundary conditions and PML strength 0.</p>
1680 </td>
1681 <td></td>
1682 <td align="center">
1683 <img src="https://www.dealii.org/images/steps/developer/step-81-absorbing_Ey.gif" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 0" height="210">
1684 <p> Solution with an interface, absorbing boundary conditions and PML strength 0.</p>
1685 </td>
1686 <td></td>
1687 <td align="center">
1688 <img src="https://www.dealii.org/images/steps/developer/step-81-perfectly_matched_layer_Ey.gif" alt="Visualization of the solution of step-81 with an interface, absorbing boundary conditions and PML strength 4" height="210">
1689 <p> Solution with an interface, absorbing boundary conditions and PML strength 4.</p>
1690 </td>
1691 </tr>
1692</table>
1693
1694<a name="Notes"></a><h3> Notes </h3>
1695
1696
1697<a name="RealandComplexMatrices"></a><h4> Real and Complex Matrices </h4>
1698
1699As is evident from the results, we are splitting our solution matrices into
1700the real and the imaginary components. We started off using the @f$H^{curl}@f$
1701conforming Nédélec Elements, and we made two copies of the Finite Elements
1702in order to represent the real and the imaginary components of our input
1703(FE_NedelecSZ was used instead of FE_Nedelec to avoid the sign conflicts
1704issues present in traditional Nédélec elements). In the assembly, we create
1705two vectors of dimension @f$dim@f$ that assist us in extracting the real and
1706the imaginary components of our finite elements.
1707
1708
1709<a name="RotationsandScaling"></a><h4> Rotations and Scaling </h4>
1710
1711As we see in our assembly, our finite element is rotated and scaled as
1712follows:
1713
1714@code
1715const auto phi_i = real_part.value(i, q_point) - 1.0i * imag_part.value(i, q_point);
1716@endcode
1717
1718This @f$\phi_i@f$ variable doesn't need to be scaled in this way, we may choose
1719any arbitrary scaling constants @f$a@f$ and @f$b@f$. If we choose this scaling, the
1720@f$\phi_j@f$ must also be modified with the same scaling, as follows:
1721
1722@code
1723const auto phi_i = a*real_part.value(i, q_point) -
1724 bi * imag_part.value(i, q_point);
1725
1726const auto phi_j = a*real_part.value(i, q_point) +
1727 bi * imag_part.value(i, q_point);
1728@endcode
1729
1730Moreover, the cell_rhs need not be the real part of the rhs_value. Say if
1731we modify to take the imaginary part of the computed rhs_value, we must
1732also modify the cell_matrix accordingly to take the imaginary part of temp.
1733However, making these changes to both sides of the equation will not affect
1734our solution, and we will still be able to generate the surface plasmon
1735polariton.
1736
1737@code
1738cell_rhs(i) += rhs_value.imag();
1739
1740cell_matrix(i) += temp.imag();
1741@endcode
1742
1743<a name="Postprocessing"></a><h4> Postprocessing </h4>
1744
1745We will create a video demonstrating the wave in motion, which is
1746essentially an implementation of @f$e^{-i\omega t}(Re(E) + i*Im(E))@f$ as we
1747increment time. This is done by slightly changing the output function to
1748generate a series of .vtk files, which will represent out solution wave as
1749we increment time. Introduce an input variable @f$t@f$ in the output_results()
1750class as output_results(unsigned int t). Then change the class itself to
1751the following:
1752
1753@code
1754template <int dim>
1755void Maxwell<dim>::output_results(unsigned int t)
1756{
1757 std::cout << "Running step:" << t << std::endl;
1758 DataOut<2> data_out;
1759 data_out.attach_dof_handler(dof_handler);
1760 Vector<double> postprocessed;
1761 postprocessed.reinit(solution);
1762 for (unsigned int i = 0; i < dof_handler.n_dofs(); ++i)
1763 {
1764 if (i % 4 == 0)
1765 {
1766 postprocessed[i] = std::cos(2 * M_PI * 0.04 * t) * solution[i] -
1767 std::sin(2 * M_PI * 0.04 * t) * solution[i + 1];
1768 }
1769 else if (i % 4 == 2)
1770 {
1771 postprocessed[i] = std::cos(2 * M_PI * 0.04 * t) * solution[i] -
1772 std::sin(2 * M_PI * 0.04 * t) * solution[i + 1];
1773 }
1774 }
1775 data_out.add_data_vector(postprocessed, {"E_x", "E_y", "null0", "null1"});
1776 data_out.build_patches();
1777 const std::string filename =
1778 "solution-" + Utilities::int_to_string(t) + ".vtk";
1779 std::ofstream output(filename);
1780 data_out.write_vtk(output);
1781 std::cout << "Done running step:" << t << std::endl;
1782}
1783@endcode
1784
1785Finally, in the run() function, replace output_results() with
1786@code
1787for (int t = 0; t <= 100; t++)
1788 {
1789 output_results(t);
1790 }
1791@endcode
1792
1793This would generate 100 solution .vtk files, which can be opened in a group
1794on Paraview and then can be saved as an animation. We used FFMPEG to
1795generate gifs.
1796
1797<a name="PossibilitiesforExtension"></a><h3> Possibilities for Extension </h3>
1798
1799
1800The example step could be extended in a number of different directions.
1801<ul>
1802 <li>
1803 The current program uses a direct solver to solve the linear system.
1804 This is efficient for two spatial dimensions where scattering problems
1805 up to a few millions degrees of freedom can be solved. In 3D, however,
1806 the increased stencil size of the Nedelec element pose a severe
1807 limiting factor on the problem size that can be computed. As an
1808 alternative, the idea to use iterative solvers can be entertained.
1809 This, however requires specialized preconditioners. For example, just
1810 using an iterative Krylov space solver (such as SolverGMRES) on above
1811 problem will requires many thousands of iterations to converge.
1812 Unfortunately, time-harmonic Maxwell's equations lack the usual notion
1813 of local smoothing properties, which renders the usual suspects, such
1814 as a geometric multigrid (see the Multigrid class), largely useless. A
1815 possible extension would be to implement an additive Schwarz preconditioner
1816 (based on domain decomposition, see for example
1817 @cite Gopalakrishnan2003), or a sweeping preconditioner (see for
1818 example @cite Ying2012).
1819 </li>
1820 <li>
1821 Another possible extension of the current program is to introduce local
1822 mesh refinement (either based on a residual estimator, or based on the
1823 dual weighted residual method, see @ref step_14 "step-14"). This is in particular of
1824 interest to counter the increased computational cost caused by the
1825 scale separation between the SPP and the dipole.
1826 </li>
1827</ul>
1828 *
1829 *
1830<a name="PlainProg"></a>
1831<h1> The plain program</h1>
1832@include "step-81.cc"
1833*/
void add_parameter(const std::string &entry, ParameterType &parameter, const std::string &documentation="", ParameterHandler &prm_=prm, const Patterns::PatternBase &pattern= *Patterns::Tools::Convert< ParameterType >::to_pattern())
Definition point.h:112
numbers::NumberTraits< Number >::real_type norm() const
Point< 3 > center
__global__ void set(Number *val, const Number s, const size_type N)
void loop(ITERATOR begin, std_cxx20::type_identity_t< ITERATOR > end, DOFINFO &dinfo, INFOBOX &info, const std::function< void(DOFINFO &, typename INFOBOX::CellInfo &)> &cell_worker, const std::function< void(DOFINFO &, typename INFOBOX::CellInfo &)> &boundary_worker, const std::function< void(DOFINFO &, DOFINFO &, typename INFOBOX::CellInfo &, typename INFOBOX::CellInfo &)> &face_worker, ASSEMBLER &assembler, const LoopControl &lctrl=LoopControl())
Definition loop.h:439
void scale(const double scaling_factor, Triangulation< dim, spacedim > &triangulation)
double norm(const FEValuesBase< dim > &fe, const ArrayView< const std::vector< Tensor< 1, dim > > > &Du)
Definition divergence.h:472
Point< spacedim > point(const gp_Pnt &p, const double tolerance=1e-10)
Definition utilities.cc:189
SymmetricTensor< 2, dim, Number > C(const Tensor< 2, dim, Number > &F)
SymmetricTensor< 2, dim, Number > d(const Tensor< 2, dim, Number > &F, const Tensor< 2, dim, Number > &dF_dt)
void run(const Iterator &begin, const std_cxx20::type_identity_t< Iterator > &end, Worker worker, Copier copier, const ScratchData &sample_scratch_data, const CopyData &sample_copy_data, const unsigned int queue_length, const unsigned int chunk_size)
::VectorizedArray< Number, width > cos(const ::VectorizedArray< Number, width > &)
const ::parallel::distributed::Triangulation< dim, spacedim > * triangulation
DEAL_II_HOST constexpr SymmetricTensor< 2, dim, Number > invert(const SymmetricTensor< 2, dim, Number > &)