📄 cell_hex8.h
字号:
// $Id: cell_hex8.h 2501 2007-11-20 02:33:29Z benkirk $// The libMesh Finite Element Library.// Copyright (C) 2002-2007 Benjamin S. Kirk, John W. Peterson // This library is free software; you can redistribute it and/or// modify it under the terms of the GNU Lesser General Public// License as published by the Free Software Foundation; either// version 2.1 of the License, or (at your option) any later version. // This library is distributed in the hope that it will be useful,// but WITHOUT ANY WARRANTY; without even the implied warranty of// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU// Lesser General Public License for more details. // You should have received a copy of the GNU Lesser General Public// License along with this library; if not, write to the Free Software// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA#ifndef __cell_hex8_h__#define __cell_hex8_h__// C++ includes// Local includes#include "cell_hex.h"/** * The \p Hex8 is an element in 3D composed of 8 nodes. * It is numbered like this: \verbatim HEX8: 7 6 o--------o /: /| / : / | 4 / : 5 / | o--------o | | o....|...o 2 | .3 | / | . | / |. |/ o--------o 0 1 \endverbatim */// ------------------------------------------------------------// Hex class definitionclass Hex8 : public Hex{public: /** * Constructor. By default this element has no parent. */ Hex8 (Elem* p=NULL); /** * @returns \p HEX8 */ ElemType type () const { return HEX8; } /** * @returns 8 */ unsigned int n_nodes() const { return 8; } /** * @returns 1 */ unsigned int n_sub_elem() const { return 1; } /** * @returns true iff the specified (local) node number is a vertex. */ virtual bool is_vertex(const unsigned int i) const; /** * @returns true iff the specified (local) node number is an edge. */ virtual bool is_edge(const unsigned int i) const; /** * @returns true iff the specified (local) node number is a face. */ virtual bool is_face(const unsigned int i) const; /* * @returns true iff the specified (local) node number is on the * specified side */ virtual bool is_node_on_side(const unsigned int n, const unsigned int s) const; /* * @returns true iff the specified (local) node number is on the * specified edge */ virtual bool is_node_on_edge(const unsigned int n, const unsigned int e) const; /* * @returns true iff the element map is definitely affine within * numerical tolerances */ virtual bool has_affine_map () const; /** * @returns FIRST */ Order default_order() const { return FIRST; } /** * Builds a QUAD4 built coincident with face i. * The \p AutoPtr<Elem> handles the memory aspect. */ AutoPtr<Elem> build_side (const unsigned int i, bool proxy) const; /** * Builds a EDGE2 built coincident with edge i. * The \p AutoPtr<Elem> handles the memory aspect. */ AutoPtr<Elem> build_edge (const unsigned int i) const; virtual void connectivity(const unsigned int sc, const IOPackage iop, std::vector<unsigned int>& conn) const; /** * This maps the \f$ j^{th} \f$ node of the \f$ i^{th} \f$ side to * element node numbers. */ static const unsigned int side_nodes_map[6][4]; /** * This maps the \f$ j^{th} \f$ node of the \f$ i^{th} \f$ edge to * element node numbers. */ static const unsigned int edge_nodes_map[12][2]; /** * A specialization for computing the area of a hexahedron * with flat sides. */ virtual Real volume () const; protected: #ifdef ENABLE_AMR /** * Matrix used to create the elements children. */ float embedding_matrix (const unsigned int i, const unsigned int j, const unsigned int k) const { return _embedding_matrix[i][j][k]; } /** * Matrix that computes new nodal locations/solution values * from current nodes/solution. */ static const float _embedding_matrix[8][8][8]; #endif};// ------------------------------------------------------------// Hex8 class member functionsinlineHex8::Hex8(Elem* p) : Hex(Hex8::n_nodes(), p) {}#endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -