libMesh
Loading...
Searching...
No Matches
face_tri7.h
Go to the documentation of this file.
1// The libMesh Finite Element Library.
2// Copyright (C) 2002-2026 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner
3
4// This library is free software; you can redistribute it and/or
5// modify it under the terms of the GNU Lesser General Public
6// License as published by the Free Software Foundation; either
7// version 2.1 of the License, or (at your option) any later version.
8
9// This library is distributed in the hope that it will be useful,
10// but WITHOUT ANY WARRANTY; without even the implied warranty of
11// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12// Lesser General Public License for more details.
13
14// You should have received a copy of the GNU Lesser General Public
15// License along with this library; if not, write to the Free Software
16// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
18
19
20#ifndef LIBMESH_FACE_TRI7_H
21#define LIBMESH_FACE_TRI7_H
22
23// Local includes
24#include "libmesh/libmesh_common.h"
25#include "libmesh/face_tri.h"
26#include "libmesh/face_tri3.h"
27#include "libmesh/fe_reference_element_traits.h"
28
29namespace libMesh
30{
31
63class Tri7 : public Tri
64{
65public:
66
70 explicit
71 Tri7 (Elem * p=nullptr) :
73
74 Tri7 (Tri7 &&) = delete;
75 Tri7 (const Tri7 &) = delete;
76 Tri7 & operator= (const Tri7 &) = delete;
77 Tri7 & operator= (Tri7 &&) = delete;
78 virtual ~Tri7() = default;
79
83 virtual ElemType type () const override { return TRI7; }
84
88 virtual unsigned int n_nodes() const override { return num_nodes; }
89
93 virtual unsigned int n_sub_elem() const override { return 4; }
94
98 virtual bool is_vertex(const unsigned int i) const override;
99
103 virtual bool is_edge(const unsigned int i) const override;
104
108 virtual bool is_face(const unsigned int i) const override;
109
114 virtual bool is_node_on_side(const unsigned int n,
115 const unsigned int s) const override;
116
117 virtual std::vector<unsigned int> nodes_on_side(const unsigned int s) const override;
118
119 virtual std::vector<unsigned int> nodes_on_edge(const unsigned int e) const override;
120
125 virtual bool is_node_on_edge(const unsigned int n,
126 const unsigned int e) const override
127 { return this->is_node_on_side(n,e); }
128
133 virtual bool has_affine_map () const override;
134
138 virtual Order default_order() const override;
139
143 virtual Order default_side_order() const override;
144
148 using Elem::key;
149
158 virtual dof_id_type key (const unsigned int s) const override;
159
163 virtual unsigned int local_side_node(unsigned int side,
164 unsigned int side_node) const override;
165
166 virtual std::unique_ptr<Elem> build_side_ptr (const unsigned int i) override;
167
171 virtual void build_side_ptr (std::unique_ptr<Elem> & elem,
172 const unsigned int i) override;
173
174 // Avoid hiding deprecated version with different signature
176
177 virtual void connectivity(const unsigned int sf,
178 const IOPackage iop,
179 std::vector<dof_id_type> & conn) const override;
180
184 virtual unsigned int n_second_order_adjacent_vertices (const unsigned int) const override;
185
192 virtual unsigned short int second_order_adjacent_vertex (const unsigned int n,
193 const unsigned int v) const override;
194
200 virtual std::pair<unsigned short int, unsigned short int>
201 second_order_child_vertex (const unsigned int n) const override;
202
206 static const int num_nodes = 7;
207 static const int nodes_per_side = 3;
208
215 _side_nodes = derived_side_nodes<Tri3, num_sides>();
216 static constexpr const unsigned int (&side_nodes_map)[num_sides][nodes_per_side] = _side_nodes.values;
217
222 virtual BoundingBox loose_bounding_box () const override;
223
224 virtual void permute(unsigned int perm_num) override final;
225
226 virtual void flip(BoundaryInfo *) override final;
227
228#ifdef LIBMESH_ENABLE_AMR
229 virtual
230 const std::vector<std::pair<unsigned char, unsigned char>> &
232 unsigned int n) const override
233 { return _parent_bracketing_nodes[c][n]; }
234#endif
235
236 unsigned int center_node_on_side(const unsigned short side) const override final;
237
238 ElemType side_type (const unsigned int s) const override final;
239
240protected:
241
246
247
248
249#ifdef LIBMESH_ENABLE_AMR
250
254 virtual Real embedding_matrix (const unsigned int i,
255 const unsigned int j,
256 const unsigned int k) const override
257 { return _embedding_matrix[i][j][k]; }
258
264
269 static const std::vector<std::pair<unsigned char, unsigned char>>
271
273
274#endif // LIBMESH_ENABLE_AMR
275
276private:
277
282 static const unsigned short int _second_order_adjacent_vertices[num_sides][2];
283
287 static const unsigned short int _second_order_vertex_child_number[num_nodes];
288
292 static const unsigned short int _second_order_vertex_child_index[num_nodes];
293};
294
295
296} // namespace libMesh
297
298#endif // LIBMESH_FACE_TRI6_H
void ErrorVector unsigned int
The BoundaryInfo class contains information relevant to boundary conditions including storing faces,...
Defines a Cartesian bounding box by the two corner extremum.
This is the base class from which all geometric element types are derived.
Definition elem.h:96
virtual dof_id_type key(const unsigned int s) const =0
virtual std::unique_ptr< Elem > build_side_ptr(const unsigned int i)=0
A Node is like a Point, but with more information.
Definition node.h:55
The Tri7 is an element in 2D composed of 7 nodes.
Definition face_tri7.h:64
virtual Order default_order() const override
Definition face_tri7.C:184
virtual void connectivity(const unsigned int sf, const IOPackage iop, std::vector< dof_id_type > &conn) const override
Definition face_tri7.C:252
static constexpr const unsigned int(& side_nodes_map)[num_sides][nodes_per_side]
Definition face_tri7.h:216
virtual Order default_side_order() const override
Definition face_tri7.C:191
ElemType side_type(const unsigned int s) const override final
Definition face_tri7.C:471
virtual std::pair< unsigned short int, unsigned short int > second_order_child_vertex(const unsigned int n) const override
Definition face_tri7.C:410
virtual unsigned int local_side_node(unsigned int side, unsigned int side_node) const override
Definition face_tri7.C:226
virtual BoundingBox loose_bounding_box() const override
Definition face_tri7.C:323
virtual bool has_affine_map() const override
Definition face_tri7.C:157
virtual void flip(BoundaryInfo *) override final
Flips the element (by swapping node and neighbor pointers) to have a mapping Jacobian of opposite sig...
Definition face_tri7.C:451
virtual std::vector< unsigned int > nodes_on_side(const unsigned int s) const override
Definition face_tri7.C:145
virtual const std::vector< std::pair< unsigned char, unsigned char > > & parent_bracketing_nodes(unsigned int c, unsigned int n) const override
Definition face_tri7.h:231
virtual bool is_node_on_edge(const unsigned int n, const unsigned int e) const override
Definition face_tri7.h:125
virtual bool is_edge(const unsigned int i) const override
Definition face_tri7.C:121
virtual unsigned int n_nodes() const override
Definition face_tri7.h:88
virtual bool is_face(const unsigned int i) const override
Definition face_tri7.C:128
virtual std::unique_ptr< Elem > build_side_ptr(const unsigned int i) override
Definition face_tri7.C:237
static const int nodes_per_side
Definition face_tri7.h:207
virtual bool is_node_on_side(const unsigned int n, const unsigned int s) const override
Definition face_tri7.C:135
unsigned int center_node_on_side(const unsigned short side) const override final
Definition face_tri7.C:463
Tri7(Elem *p=nullptr)
Constructor.
Definition face_tri7.h:71
Node * _nodelinks_data[num_nodes]
Data for links to nodes.
Definition face_tri7.h:245
virtual std::vector< unsigned int > nodes_on_edge(const unsigned int e) const override
Definition face_tri7.C:152
virtual unsigned int n_second_order_adjacent_vertices(const unsigned int) const override
Definition face_tri7.C:357
Tri7 & operator=(const Tri7 &)=delete
LIBMESH_ENABLE_TOPOLOGY_CACHES
Definition face_tri7.h:272
Tri7(Tri7 &&)=delete
virtual dof_id_type key() const
Don't hide Elem::key() defined in the base class.
Definition elem.C:678
virtual void permute(unsigned int perm_num) override final
Permutes the element (by swapping node and neighbor pointers) according to the specified index.
Definition face_tri7.C:438
static const int num_nodes
Geometric constants for Tri7.
Definition face_tri7.h:206
virtual unsigned int n_sub_elem() const override
Definition face_tri7.h:93
static const unsigned short int _second_order_adjacent_vertices[num_sides][2]
Matrix that tells which vertices define the location of mid-side (or second-order) nodes.
Definition face_tri7.h:282
virtual ~Tri7()=default
static constexpr NodeMapTable< num_sides, nodes_per_side > _side_nodes
This maps the node of the side to element node numbers.
Definition face_tri7.h:215
static const std::vector< std::pair< unsigned char, unsigned char > > _parent_bracketing_nodes[num_children][num_nodes]
Pairs of nodes that bracket child nodes when doing mesh refinement.
Definition face_tri7.h:270
Tri7(const Tri7 &)=delete
virtual unsigned short int second_order_adjacent_vertex(const unsigned int n, const unsigned int v) const override
Definition face_tri7.C:376
static const unsigned short int _second_order_vertex_child_number[num_nodes]
Vector that names a child sharing each second order node.
Definition face_tri7.h:287
virtual ElemType type() const override
Definition face_tri7.h:83
static const unsigned short int _second_order_vertex_child_index[num_nodes]
Vector that names the child vertex index for each second order node.
Definition face_tri7.h:292
static const Real _embedding_matrix[num_children][num_nodes][num_nodes]
Matrix that computes new nodal locations/solution values from current nodes/solution.
Definition face_tri7.h:263
virtual bool is_vertex(const unsigned int i) const override
Definition face_tri7.C:114
virtual Real embedding_matrix(const unsigned int i, const unsigned int j, const unsigned int k) const override
Matrix used to create the elements children.
Definition face_tri7.h:254
The Tri is an element in 2D composed of 3 sides.
Definition face_tri.h:48
static const int num_children
Definition face_tri.h:87
static const int num_sides
Geometric constants for all Tris.
Definition face_tri.h:86
The libMesh namespace provides an interface to certain functionality in the library.
IOPackage
libMesh interfaces with several different software packages for the purposes of creating,...
ElemType
Defines an enum for geometric element types.
uint8_t dof_id_type
Definition id_types.h:67
DIE A HORRIBLE DEATH HERE typedef LIBMESH_DEFAULT_SCALAR_TYPE Real
A fixed-size table that constexpr functions can return.
unsigned int values[Rows][Cols]