cell_inf_hex16.C
Go to the documentation of this file.00001 // The libMesh Finite Element Library. 00002 // Copyright (C) 2002-2012 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner 00003 00004 // This library is free software; you can redistribute it and/or 00005 // modify it under the terms of the GNU Lesser General Public 00006 // License as published by the Free Software Foundation; either 00007 // version 2.1 of the License, or (at your option) any later version. 00008 00009 // This library is distributed in the hope that it will be useful, 00010 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00012 // Lesser General Public License for more details. 00013 00014 // You should have received a copy of the GNU Lesser General Public 00015 // License along with this library; if not, write to the Free Software 00016 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 00017 00018 // Local includes 00019 #include "libmesh/libmesh_config.h" 00020 00021 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS 00022 00023 // C++ includes 00024 00025 // Local includes cont'd 00026 #include "libmesh/cell_inf_hex16.h" 00027 #include "libmesh/edge_edge3.h" 00028 #include "libmesh/edge_inf_edge2.h" 00029 #include "libmesh/face_quad8.h" 00030 #include "libmesh/face_inf_quad6.h" 00031 #include "libmesh/side.h" 00032 00033 namespace libMesh 00034 { 00035 00036 00037 // ------------------------------------------------------------ 00038 // InfHex16 class static member initializations 00039 const unsigned int InfHex16::side_nodes_map[5][8] = 00040 { 00041 { 0, 1, 2, 3, 8, 9, 10, 11}, // Side 0 00042 { 0, 1, 4, 5, 8, 12, 99, 99}, // Side 1 00043 { 1, 2, 5, 6, 9, 13, 99, 99}, // Side 2 00044 { 2, 3, 6, 7, 10, 14, 99, 99}, // Side 3 00045 { 3, 0, 7, 4, 11, 15, 99, 99} // Side 4 00046 }; 00047 00048 const unsigned int InfHex16::edge_nodes_map[8][3] = 00049 { 00050 { 0, 1, 8}, // Side 0 00051 { 1, 2, 9}, // Side 1 00052 { 2, 3, 10}, // Side 2 00053 { 0, 3, 11}, // Side 3 00054 { 0, 4, 99}, // Side 4 00055 { 1, 5, 99}, // Side 5 00056 { 2, 6, 99}, // Side 6 00057 { 3, 7, 99} // Side 7 00058 }; 00059 00060 00061 // ------------------------------------------------------------ 00062 // InfHex16 class member functions 00063 00064 bool InfHex16::is_vertex(const unsigned int i) const 00065 { 00066 if (i < 4) 00067 return true; 00068 return false; 00069 } 00070 00071 bool InfHex16::is_edge(const unsigned int i) const 00072 { 00073 if (i < 4) 00074 return false; 00075 if (i > 11) 00076 return false; 00077 return true; 00078 } 00079 00080 bool InfHex16::is_face(const unsigned int i) const 00081 { 00082 if (i > 11) 00083 return true; 00084 return false; 00085 } 00086 00087 bool InfHex16::is_node_on_side(const unsigned int n, 00088 const unsigned int s) const 00089 { 00090 libmesh_assert_less (s, n_sides()); 00091 for (unsigned int i = 0; i != 8; ++i) 00092 if (side_nodes_map[s][i] == n) 00093 return true; 00094 return false; 00095 } 00096 00097 bool InfHex16::is_node_on_edge(const unsigned int n, 00098 const unsigned int e) const 00099 { 00100 libmesh_assert_less (e, n_edges()); 00101 for (unsigned int i = 0; i != 3; ++i) 00102 if (edge_nodes_map[e][i] == n) 00103 return true; 00104 return false; 00105 } 00106 00107 AutoPtr<Elem> InfHex16::build_side (const unsigned int i, 00108 bool proxy) const 00109 { 00110 libmesh_assert_less (i, this->n_sides()); 00111 00112 if (proxy) 00113 { 00114 switch (i) 00115 { 00116 // base 00117 case 0: 00118 { 00119 AutoPtr<Elem> ap(new Side<Quad8,InfHex16>(this,i)); 00120 return ap; 00121 } 00122 // ifem sides 00123 case 1: 00124 case 2: 00125 case 3: 00126 case 4: 00127 { 00128 AutoPtr<Elem> ap(new Side<InfQuad6,InfHex16>(this,i)); 00129 return ap; 00130 } 00131 default: 00132 libmesh_error(); 00133 } 00134 } 00135 00136 else 00137 { 00138 // Think of a unit cube: (-1,1) x (-1,1)x (1,1) 00139 switch (i) 00140 { 00141 case 0: // the base face 00142 { 00143 AutoPtr<Elem> face(new Quad8); 00144 00145 // Only here, the face element's normal points inward 00146 face->set_node(0) = this->get_node(0); 00147 face->set_node(1) = this->get_node(1); 00148 face->set_node(2) = this->get_node(2); 00149 face->set_node(3) = this->get_node(3); 00150 face->set_node(4) = this->get_node(8); 00151 face->set_node(5) = this->get_node(9); 00152 face->set_node(6) = this->get_node(10); 00153 face->set_node(7) = this->get_node(11); 00154 00155 return face; 00156 } 00157 00158 case 1: // connecting to another infinite element 00159 { 00160 AutoPtr<Elem> face(new InfQuad6); 00161 00162 face->set_node(0) = this->get_node(0); 00163 face->set_node(1) = this->get_node(1); 00164 face->set_node(2) = this->get_node(4); 00165 face->set_node(3) = this->get_node(5); 00166 face->set_node(4) = this->get_node(8); 00167 face->set_node(5) = this->get_node(12); 00168 00169 return face; 00170 } 00171 00172 case 2: // connecting to another infinite element 00173 { 00174 AutoPtr<Elem> face(new InfQuad6); 00175 00176 face->set_node(0) = this->get_node(1); 00177 face->set_node(1) = this->get_node(2); 00178 face->set_node(2) = this->get_node(5); 00179 face->set_node(3) = this->get_node(6); 00180 face->set_node(4) = this->get_node(9); 00181 face->set_node(5) = this->get_node(13); 00182 00183 return face; 00184 } 00185 00186 case 3: // connecting to another infinite element 00187 { 00188 AutoPtr<Elem> face(new InfQuad6); 00189 00190 face->set_node(0) = this->get_node(2); 00191 face->set_node(1) = this->get_node(3); 00192 face->set_node(2) = this->get_node(6); 00193 face->set_node(3) = this->get_node(7); 00194 face->set_node(4) = this->get_node(10); 00195 face->set_node(5) = this->get_node(14); 00196 00197 return face; 00198 } 00199 00200 case 4: // connecting to another infinite element 00201 { 00202 AutoPtr<Elem> face(new InfQuad6); 00203 00204 face->set_node(0) = this->get_node(3); 00205 face->set_node(1) = this->get_node(0); 00206 face->set_node(2) = this->get_node(7); 00207 face->set_node(3) = this->get_node(4); 00208 face->set_node(4) = this->get_node(11); 00209 face->set_node(5) = this->get_node(15); 00210 00211 return face; 00212 } 00213 00214 default: 00215 { 00216 libmesh_error(); 00217 AutoPtr<Elem> ap(NULL); return ap; 00218 } 00219 } 00220 } 00221 00222 00223 // We'll never get here. 00224 libmesh_error(); 00225 AutoPtr<Elem> ap(NULL); return ap; 00226 } 00227 00228 AutoPtr<Elem> InfHex16::build_edge (const unsigned int i) const 00229 { 00230 libmesh_assert_less (i, this->n_edges()); 00231 00232 if (i < 4) // base edges 00233 return AutoPtr<Elem>(new SideEdge<Edge3,InfHex16>(this,i)); 00234 // infinite edges 00235 return AutoPtr<Elem>(new SideEdge<InfEdge2,InfHex16>(this,i)); 00236 } 00237 00238 00239 void InfHex16::connectivity(const unsigned int sc, 00240 const IOPackage iop, 00241 std::vector<dof_id_type>& conn) const 00242 { 00243 libmesh_assert(_nodes); 00244 libmesh_assert_less (sc, this->n_sub_elem()); 00245 libmesh_assert_not_equal_to (iop, INVALID_IO_PACKAGE); 00246 00247 switch (iop) 00248 { 00249 case TECPLOT: 00250 { 00251 switch (sc) 00252 { 00253 case 0: 00254 00255 conn[0] = this->node(0)+1; 00256 conn[1] = this->node(1)+1; 00257 conn[2] = this->node(2)+1; 00258 conn[3] = this->node(3)+1; 00259 conn[4] = this->node(4)+1; 00260 conn[5] = this->node(5)+1; 00261 conn[6] = this->node(6)+1; 00262 conn[7] = this->node(7)+1; 00263 return; 00264 00265 default: 00266 libmesh_error(); 00267 00268 } 00269 } 00270 00271 default: 00272 libmesh_error(); 00273 } 00274 00275 libmesh_error(); 00276 } 00277 00278 00279 00280 00281 unsigned short int InfHex16::second_order_adjacent_vertex (const unsigned int n, 00282 const unsigned int v) const 00283 { 00284 libmesh_assert_greater_equal (n, this->n_vertices()); 00285 libmesh_assert_less (n, this->n_nodes()); 00286 libmesh_assert_less (v, 2); 00287 // note that the _second_order_adjacent_vertices matrix is 00288 // stored in \p InfHex 00289 return _second_order_adjacent_vertices[n-this->n_vertices()][v]; 00290 } 00291 00292 00293 00294 std::pair<unsigned short int, unsigned short int> 00295 InfHex16::second_order_child_vertex (const unsigned int n) const 00296 { 00297 libmesh_assert_greater_equal (n, this->n_vertices()); 00298 libmesh_assert_less (n, this->n_nodes()); 00299 /* 00300 * the _second_order_vertex_child_* vectors are 00301 * stored in cell_inf_hex.C, since they are identical 00302 * for InfHex16 and InfHex18 00303 */ 00304 return std::pair<unsigned short int, unsigned short int> 00305 (_second_order_vertex_child_number[n], 00306 _second_order_vertex_child_index[n]); 00307 } 00308 00309 00310 00311 00312 00313 #ifdef LIBMESH_ENABLE_AMR 00314 00315 const float InfHex16::_embedding_matrix[4][16][16] = 00316 { 00317 // embedding matrix for child 0 00318 { 00319 // 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 th parent Node 00320 { 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 0th child N. 00321 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 1 00322 { -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, 0.0, 0.0, 0.0}, // 2 00323 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0}, // 3 00324 { 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 4 00325 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0}, // 5 00326 { 0.0, 0.0, 0.0, 0.0, -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5}, // 6 00327 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}, // 7 00328 { 0.375, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 8 00329 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.75, 0.375, 0.25, 0.375, 0.0, 0.0, 0.0, 0.0}, // 9 00330 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.25, 0.375, 0.75, 0.0, 0.0, 0.0, 0.0}, // 10 00331 { 0.375, 0.0, 0.0, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0}, // 11 00332 { 0.0, 0.0, 0.0, 0.0, 0.375, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0}, // 12 00333 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.75, 0.375, 0.25, 0.375}, // 13 00334 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.25, 0.375, 0.75}, // 14 00335 { 0.0, 0.0, 0.0, 0.0, 0.375, 0.0, 0.0, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75} // 15 00336 }, 00337 00338 // embedding matrix for child 1 00339 { 00340 // 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 th parent Node 00341 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 0th child N. 00342 { 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 1 00343 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 2 00344 { -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, 0.0, 0.0, 0.0}, // 3 00345 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0}, // 4 00346 { 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 5 00347 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0}, // 6 00348 { 0.0, 0.0, 0.0, 0.0, -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5}, // 7 00349 { -0.125, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 8 00350 { 0.0, 0.375, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 9 00351 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.75, 0.375, 0.25, 0.0, 0.0, 0.0, 0.0}, // 10 00352 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.75, 0.375, 0.25, 0.375, 0.0, 0.0, 0.0, 0.0}, // 11 00353 { 0.0, 0.0, 0.0, 0.0, -0.125, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0}, // 12 00354 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.375, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0}, // 13 00355 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.75, 0.375, 0.25}, // 14 00356 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.75, 0.375, 0.25, 0.375} // 15 00357 }, 00358 00359 // embedding matrix for child 2 00360 { 00361 // 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 th parent Node 00362 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0}, // 0th child N. 00363 { -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, 0.0, 0.0, 0.0}, // 1 00364 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 2 00365 { 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 3 00366 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0}, // 4 00367 { 0.0, 0.0, 0.0, 0.0, -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5}, // 5 00368 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0}, // 6 00369 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 7 00370 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.25, 0.375, 0.75, 0.0, 0.0, 0.0, 0.0}, // 8 00371 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.25, 0.375, 0.75, 0.375, 0.0, 0.0, 0.0, 0.0}, // 9 00372 { 0.0, 0.0, -0.125, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0, 0.0}, // 10 00373 { -0.125, 0.0, 0.0, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0}, // 11 00374 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.25, 0.375, 0.75}, // 12 00375 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.25, 0.375, 0.75, 0.375}, // 13 00376 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.125, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0}, // 14 00377 { 0.0, 0.0, 0.0, 0.0, -0.125, 0.0, 0.0, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75} // 15 00378 }, 00379 00380 // embedding matrix for child 3 00381 { 00382 // 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 th parent Node 00383 { -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, 0.0, 0.0, 0.0}, // 0th child N. 00384 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 1 00385 { 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 2 00386 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 3 00387 { 0.0, 0.0, 0.0, 0.0, -0.25, -0.25, -0.25, -0.25, 0.0, 0.0, 0.0, 0.0, 0.5, 0.5, 0.5, 0.5}, // 4 00388 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0}, // 5 00389 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 6 00390 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0}, // 7 00391 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.75, 0.375, 0.25, 0.0, 0.0, 0.0, 0.0}, // 8 00392 { 0.0, -0.125, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}, // 9 00393 { 0.0, 0.0, 0.375, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0, 0.0, 0.0, 0.0}, // 10 00394 { -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.25, 0.375, 0.75, 0.375, 0.0, 0.0, 0.0, 0.0}, // 11 00395 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.375, 0.75, 0.375, 0.25}, // 12 00396 { 0.0, 0.0, 0.0, 0.0, 0.0, -0.125, 0.375, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0, 0.0}, // 13 00397 { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.375, -0.125, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.75, 0.0}, // 14 00398 { 0.0, 0.0, 0.0, 0.0, -0.1875, -0.1875, -0.1875, -0.1875, 0.0, 0.0, 0.0, 0.0, 0.25, 0.375, 0.75, 0.375} // 15 00399 } 00400 }; 00401 00402 00403 00404 #endif 00405 00406 } // namespace libMesh 00407 00408 #endif // ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
Site Created By: libMesh Developers
Last modified: February 05 2013 19:54:45 UTC
Hosted By: