Go to the documentation of this file.
20 #ifndef LIBMESH_FACE_QUAD9_H
21 #define LIBMESH_FACE_QUAD9_H
24 #include "libmesh/libmesh_common.h"
25 #include "libmesh/face_quad.h"
66 virtual ~Quad9() =
default;
76 virtual unsigned int n_nodes()
const override {
return 9; }
81 virtual unsigned int n_sub_elem()
const override {
return 4; }
86 virtual bool is_vertex(
const unsigned int i)
const override;
91 virtual bool is_edge(
const unsigned int i)
const override;
96 virtual bool is_face(
const unsigned int i)
const override;
103 const unsigned int s)
const override;
105 virtual std::vector<unsigned int>
nodes_on_side(
const unsigned int s)
const override;
112 const unsigned int e)
const override
154 unsigned int side_node)
const override;
156 virtual std::unique_ptr<Elem>
build_side_ptr (
const unsigned int i,
157 bool proxy=
true)
override;
163 const unsigned int i)
override;
167 std::vector<dof_id_type> & conn)
const override;
181 const unsigned int v)
const override;
188 virtual std::pair<unsigned short int, unsigned short int>
226 #ifdef LIBMESH_ENABLE_AMR
232 const unsigned int j,
233 const unsigned int k)
const override
244 #endif // LIBMESH_ENABLE_AMR
251 #endif // LIBMESH_FACE_QUAD9_H
virtual unsigned int which_node_am_i(unsigned int side, unsigned int side_node) const override
static const int num_sides
static const int num_children
The QUAD9 is an element in 2D composed of 9 nodes.
virtual bool is_vertex(const unsigned int i) const override
static const int num_nodes
Geometric constants for Quad9.
virtual bool has_affine_map() const override
IOPackage
libMesh interfaces with several different software packages for the purposes of creating,...
Defines a Cartesian bounding box by the two corner extremum.
virtual Order default_order() const override
LIBMESH_ENABLE_TOPOLOGY_CACHES
virtual Real volume() const override
An optimized method for approximating the area of a QUAD9 using quadrature.
The libMesh namespace provides an interface to certain functionality in the library.
virtual bool is_node_on_side(const unsigned int n, const unsigned int s) const override
virtual unsigned int n_second_order_adjacent_vertices(const unsigned int n) const override
virtual BoundingBox loose_bounding_box() const override
virtual bool is_face(const unsigned int i) const override
virtual std::unique_ptr< Elem > build_side_ptr(const unsigned int i, bool proxy=true) override
virtual float embedding_matrix(const unsigned int i, const unsigned int j, const unsigned int k) const override
Matrix used to create the elements children.
virtual bool is_node_on_edge(const unsigned int n, const unsigned int e) const override
virtual std::pair< unsigned short int, unsigned short int > second_order_child_vertex(const unsigned int n) const override
virtual dof_id_type key() const
Node * _nodelinks_data[num_nodes]
Data for links to nodes.
A Node is like a Point, but with more information.
The QUAD is an element in 2D composed of 4 sides.
static const int nodes_per_side
virtual ElemType type() const override
static const unsigned int side_nodes_map[num_sides][nodes_per_side]
This maps the node of the side to element node numbers.
virtual unsigned int n_sub_elem() const override
virtual bool is_edge(const unsigned int i) const override
virtual unsigned short int second_order_adjacent_vertex(const unsigned int n, const unsigned int v) const override
This is the base class from which all geometric element types are derived.
virtual void connectivity(const unsigned int sf, const IOPackage iop, std::vector< dof_id_type > &conn) const override
static const float _embedding_matrix[num_children][num_nodes][num_nodes]
Matrix that computes new nodal locations/solution values from current nodes/solution.
DIE A HORRIBLE DEATH HERE typedef LIBMESH_DEFAULT_SCALAR_TYPE Real
virtual unsigned int n_nodes() const override
Quad9(Elem *p=nullptr)
Constructor.
virtual std::vector< unsigned int > nodes_on_side(const unsigned int s) const override
Quad9 & operator=(const Quad9 &)=delete
ElemType
Defines an enum for geometric element types.
virtual dof_id_type key() const override
Compute a unique key for this element which is suitable for hashing (not necessarily unique,...