space(2rheolef)


NAME

   space -- piecewise polynomial finite element space

DESCRIPTION

   The  space  class  contains  some  numbering  for  unknowns and blocked
   degrees  of  freedoms  related  to  a   given   mesh   and   polynomial
   approximation.

SYNOPSIS

       space Q (omega, "P1");
       space V (omega, "P2", "vector");
       space T (omega, "P1d", "tensor");

PRODUCT

       space X = T*V*Q;
       space Q2 = pow(Q,2);

IMPLEMENTATION

   template <class T>
   class space_basic<T,sequential> : public smart_pointer<space_rep<T,sequential> > {
   public:

   // typedefs:

       typedef space_rep<T,sequential>   rep;
       typedef smart_pointer<rep>        base;
       typedef typename rep::size_type   size_type;
       typedef typename rep::valued_type valued_type;

   // allocators:

       space_basic (const geo_basic<T,sequential>& omega = (geo_basic<T,sequential>()),
                     std::string approx = "", std::string valued = "scalar");
       space_basic (const space_mult_list<T,sequential>& expr);
       space_basic (const space_constitution<T,sequential>& constit);

   // accessors:

       void block  (std::string dom_name);
       void unblock(std::string dom_name);
       void block  (const domain_indirect_basic<sequential>& dom);
       void unblock(const domain_indirect_basic<sequential>& dom);

       const distributor&  ownership() const;
       const communicator& comm() const;
       size_type           ndof() const;
       size_type           dis_ndof() const;

       const geo_basic<T,sequential>& get_geo() const;
       const numbering<T,sequential>& get_numbering() const;
       size_type size() const;
       valued_type           valued_tag()   const;
       const std::string&    valued()       const;
       space_component<T,sequential>       operator[] (size_type i_comp);
       space_component_const<T,sequential> operator[] (size_type i_comp) const;
       const space_constitution<T,sequential>& get_constitution() const;
       size_type degree() const;
       std::string get_approx() const;
       std::string stamp() const;

       void dis_idof (const geo_element& K, std::vector<size_type>& dis_idof) const;

       const distributor& iu_ownership() const;
       const distributor& ib_ownership() const;

       bool      is_blocked (size_type     idof) const;
       size_type        iub (size_type     idof) const;
       bool  dis_is_blocked (size_type dis_idof) const;
       size_type    dis_iub (size_type dis_idof) const;

       const distributor& ios_ownership() const;
       size_type idof2ios_dis_idof (size_type idof) const;
       size_type ios_idof2dis_idof (size_type ios_idof) const;

       const point_basic<T>& xdof (size_type idof) const;
       const disarray<point_basic<T>,sequential>& get_xdofs() const;

       template <class Function>
       T momentum (const Function& f, size_type idof) const;

       template <class Function>
       point_basic<T> vector_momentum (const Function& f, size_type idof) const;

       template <class Function>
       tensor_basic<T> tensor_momentum (const Function& f, size_type idof) const;

       disarray<size_type, sequential> build_indirect_array (
           const space_basic<T,sequential>& Wh, const std::string& dom_name) const;

       disarray<size_type, sequential> build_indirect_array (
           const space_basic<T,sequential>& Wh, const geo_basic<T,sequential>& bgd_gamma) const;

       const std::set<size_type>& ext_iu_set() const { return base::data().ext_iu_set(); }
       const std::set<size_type>& ext_ib_set() const { return base::data().ext_ib_set(); }

   // comparator:

       bool operator== (const space_basic<T,sequential>& V2) const { return base::data().operator==(V2.data()); }
       bool operator!= (const space_basic<T,sequential>& V2) const { return ! operator== (V2); }
       friend bool are_compatible (const space_basic<T,sequential>& V1, const space_basic<T,sequential>& V2) {
           return are_compatible (V1.data(), V2.data()); }
   };

IMPLEMENTATION

   template <class T>
   class space_basic<T,distributed> : public smart_pointer<space_rep<T,distributed> > {
   public:

   // typedefs:

       typedef space_rep<T,distributed>  rep;
       typedef smart_pointer<rep>        base;
       typedef typename rep::size_type   size_type;
       typedef typename rep::valued_type valued_type;

   // allocators:

       space_basic (const geo_basic<T,distributed>& omega = (geo_basic<T,distributed>()),
                     std::string approx = "", std::string valued = "scalar");
       space_basic (const space_mult_list<T,distributed>&);
       space_basic (const space_constitution<T,distributed>& constit);

   // accessors:

       void block  (std::string dom_name);
       void unblock(std::string dom_name);
       void block  (const domain_indirect_basic<distributed>& dom);
       void unblock(const domain_indirect_basic<distributed>& dom);

       const distributor&  ownership() const;
       const communicator& comm() const;
       size_type           ndof() const;
       size_type           dis_ndof() const;

       const geo_basic<T,distributed>& get_geo() const;
       const numbering<T,distributed>& get_numbering() const;
       size_type size() const;
       valued_type           valued_tag()   const;
       const std::string&    valued()       const;
       space_component<T,distributed>       operator[] (size_type i_comp);
       space_component_const<T,distributed> operator[] (size_type i_comp) const;
       const space_constitution<T,distributed>& get_constitution() const;
       size_type degree() const;
       std::string get_approx() const;
       std::string stamp() const;

       void dis_idof (const geo_element& K, std::vector<size_type>& dis_idof) const;

       const distributor& iu_ownership() const;
       const distributor& ib_ownership() const;

       bool      is_blocked (size_type     idof) const;
       size_type        iub (size_type     idof) const;

       bool  dis_is_blocked (size_type dis_idof) const;
       size_type    dis_iub (size_type dis_idof) const;

       const distributor& ios_ownership() const;
       size_type idof2ios_dis_idof (size_type idof) const;
       size_type ios_idof2dis_idof (size_type ios_idof) const;

       const point_basic<T>& xdof (size_type idof) const;
       const disarray<point_basic<T>,distributed>& get_xdofs() const;

       template <class Function>
       T momentum (const Function& f, size_type idof) const;

       template <class Function>
       point_basic<T> vector_momentum (const Function& f, size_type idof) const;

       template <class Function>
       tensor_basic<T> tensor_momentum (const Function& f, size_type idof) const;

       disarray<size_type, distributed> build_indirect_array (
           const space_basic<T,distributed>& Wh, const std::string& dom_name) const;

       disarray<size_type, distributed> build_indirect_array (
           const space_basic<T,distributed>& Wh, const geo_basic<T,distributed>& bgd_gamma) const;

       const std::set<size_type>& ext_iu_set() const { return base::data().ext_iu_set(); }
       const std::set<size_type>& ext_ib_set() const { return base::data().ext_ib_set(); }

   // comparator:

       bool operator== (const space_basic<T,distributed>& V2) const { return base::data().operator==(V2.data()); }
       bool operator!= (const space_basic<T,distributed>& V2) const { return ! operator== (V2); }
       friend bool are_compatible (const space_basic<T,distributed>& V1, const space_basic<T,distributed>& V2) {
           return are_compatible (V1.data(), V2.data()); }
   };





Opportunity


Personal Opportunity - Free software gives you access to billions of dollars of software at no cost. Use this software for your business, personal use or to develop a profitable skill. Access to source code provides access to a level of capabilities/information that companies protect though copyrights. Open source is a core component of the Internet and it is available to you. Leverage the billions of dollars in resources and capabilities to build a career, establish a business or change the world. The potential is endless for those who understand the opportunity.

Business Opportunity - Goldman Sachs, IBM and countless large corporations are leveraging open source to reduce costs, develop products and increase their bottom lines. Learn what these companies know about open source and how open source can give you the advantage.





Free Software


Free Software provides computer programs and capabilities at no cost but more importantly, it provides the freedom to run, edit, contribute to, and share the software. The importance of free software is a matter of access, not price. Software at no cost is a benefit but ownership rights to the software and source code is far more significant.


Free Office Software - The Libre Office suite provides top desktop productivity tools for free. This includes, a word processor, spreadsheet, presentation engine, drawing and flowcharting, database and math applications. Libre Office is available for Linux or Windows.





Free Books


The Free Books Library is a collection of thousands of the most popular public domain books in an online readable format. The collection includes great classical literature and more recent works where the U.S. copyright has expired. These books are yours to read and use without restrictions.


Source Code - Want to change a program or know how it works? Open Source provides the source code for its programs so that anyone can use, modify or learn how to write those programs themselves. Visit the GNU source code repositories to download the source.





Education


Study at Harvard, Stanford or MIT - Open edX provides free online courses from Harvard, MIT, Columbia, UC Berkeley and other top Universities. Hundreds of courses for almost all major subjects and course levels. Open edx also offers some paid courses and selected certifications.


Linux Manual Pages - A man or manual page is a form of software documentation found on Linux/Unix operating systems. Topics covered include computer programs (including library and system calls), formal standards and conventions, and even abstract concepts.