Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

numbering(7rheolef) [debian man page]

numbering(7rheolef)						    rheolef-6.1 					       numbering(7rheolef)

NAME
numbering - global degree of freedom numbering SYNOPSYS
The numbering class defines methods that furnish global numbering of degrees of freedom. This numbering depends upon the degrees of poly- noms on elements and upon the continuity requirement at inter-element boundary. For instance the "P1" continuous finite element approxima- tion has one degree of freedom per vertice of the mesh, while its discontinuous counterpart has dim(basis) times the number of elements of the mesh, where dim(basis) is the size of the local finite element basis. IMPLEMENTATION
template <class T, class M = rheo_default_memory_model> class numbering : public smart_pointer<numbering_rep<T,M> > { public: // typedefs: typedef numbering_rep<T,M> rep; typedef smart_pointer<rep> base; typedef size_t size_type; // allocators: numbering (std::string name = ""); numbering (numbering_rep<T,M>* ptr); ~numbering() {} // accessors & modifiers: bool is_initialized() const { return base::operator->() != 0; } std::string name() const; size_type degree () const; void set_degree (size_type degree) const; bool is_continuous() const; bool is_discontinuous() const { return !is_continuous(); } const basis_basic<T>& get_basis() const { return base::data().get_basis(); } size_type ndof (const geo_size& gs, size_type map_dim) const; size_type dis_ndof (const geo_size& gs, size_type map_dim) const; void dis_idof (const geo_size& gs, const geo_element& K, std::vector<size_type>& dis_idof) const; void set_ios_permutations (const class geo_basic<T,M>& omega, array<size_type,M>& idof2ios_dis_idof, array<size_type,M>& ios_idof2dis_idof) const; // comparator: bool operator== (const numbering<T,M>& y) const { if (! is_initialized() && ! y.is_initialized()) return true; if (! is_initialized() || ! y.is_initialized()) return false; return name() == y.name(); } // i/o: void dump(std::ostream& out = std::cerr) const; }; rheolef-6.1 rheolef-6.1 numbering(7rheolef)

Check Out this Related Man Page

basis(7rheolef) 						    rheolef-6.1 						   basis(7rheolef)

NAME
basis - polynomial basis SYNOPSYS
The basis class defines functions that evaluates a polynomial basis and its derivatives on a point. The polynomial basis is designated by a string, e.g. "P0", "P1", "P2", "bubble",... indicating the basis. The basis depends also of the reference element: triangle, square, tetrahedron (see reference_element(2)). For instance, on a square, the "P1" string designates the common Q1 four-nodes basis on the refer- ence square. The nodes associated to the Lagrange polynomial basis are also available by its associated accessor. IMPLEMENTATION NOTE
The basis class is a see smart_pointer(2)) class on a basis_rep class that is a pure virtual base class for effective bases, e.g. basis_P1, basis_P1, etc. IMPLEMENTATION
template<class T> class basis_basic : public smart_pointer<basis_rep<T> > { public: // typedefs: typedef basis_rep<T> rep; typedef smart_pointer<rep> base; typedef typename basis_rep<T>::size_type size_type; // allocators: basis_basic (std::string name = ""); // accessors: std::string name() const; size_type degree() const; size_type size (reference_element hat_K) const; void hat_node( reference_element hat_K, std::vector<point_basic<T> >& hat_node) const; void eval( reference_element hat_K, const point_basic<T>& hat_x, std::vector<T>& values) const; void grad_eval( reference_element hat_K, const point_basic<T>& hat_x, std::vector<point_basic<T> >& values) const; }; typedef basis_basic<Float> basis; SEE ALSO
reference_element(2), smart_pointer(2) rheolef-6.1 rheolef-6.1 basis(7rheolef)
Man Page