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
quadrature(7rheolef) rheolef-6.1 quadrature(7rheolef) NAME
quadrature - quadrature formulae on the reference lement SYNOPSYS
The quadrature class defines a container for a quadrature formulae on the reference element (see reference_element(2)). This container stores the nodes coordinates and the weights. THE CONSTRUCTOR TAKES TWO ARGUMENTS
the reference element K and the order r of the quadrature formulae. The formulae is exact when computing the integral of a polynom p that degree is less or equal to order r. n / ___ | p(x) dx = p(x_q) w_q / K /__ q=1 LIMITATIONS
The formulae is optimal when it uses a minimal number of nodes n. Optimal quadrature formula are hard-coded in this class. Not all refer- ence elements and orders are yet implemented. This class will be completed in the future. IMPLEMENTATION
template<class T> class quadrature { public: // typedefs: typedef typename quadrature_on_geo<T>::size_type size_type; typedef quadrature_option_type::family_type family_type; typedef typename std::vector<weighted_point<T> >::const_iterator const_iterator; // allocators: quadrature (quadrature_option_type opt = quadrature_option_type()); // modifiers: void set_order (size_type order); void set_family (family_type ft); // accessors: size_type get_order() const; family_type get_family() const; std::string get_family_name() const; size_type size (reference_element hat_K) const; const_iterator begin (reference_element hat_K) const; const_iterator end (reference_element hat_K) const; template<class U> friend std::ostream& operator<< (std::ostream&, const quadrature<U>&); protected: quadrature_option_type _options; mutable quadrature_on_geo<T> _quad [reference_element::max_variant]; mutable std::vector<bool> _initialized; void _initialize (reference_element hat_K) const; private: quadrature (const quadrature<T>&); quadrature operator= (const quadrature<T>&); }; SEE ALSO
reference_element(2) rheolef-6.1 rheolef-6.1 quadrature(7rheolef)