/usr/include/getfem/getfem_fem.h is in libgetfem++-dev 4.2.1~beta1~svn4482~dfsg-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 | /* -*- c++ -*- (enables emacs c++ mode) */
/*===========================================================================
Copyright (C) 1999-2013 Yves Renard
This file is a part of GETFEM++
Getfem++ is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version along with the GCC Runtime Library
Exception either version 3.1 or (at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License and GCC Runtime Library Exception for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
As a special exception, you may use this file as it is a part of a free
software library without restriction. Specifically, if other files
instantiate templates or use macros or inline functions from this file,
or you compile this file and link it with other files to produce an
executable, this file does not by itself cause the resulting executable
to be covered by the GNU Lesser General Public License. This exception
does not however invalidate any other reasons why the executable file
might be covered by the GNU Lesser General Public License.
===========================================================================*/
/**@file getfem_fem.h
@author Yves Renard <Yves.Renard@insa-lyon.fr>
@date December 21, 1999.
@brief Definition of the finite element methods.
This file defines the getfem::virtual_fem class, which is the common
base class of all FEM.
@section fem_list List of FEM known by getfem::fem_descriptor :
- "FEM_PK(N,K)" : classical Lagrange element PK on a simplex.
- "FEM_PK_DISCONTINUOUS(N,K,alpha)" : discontinuous Lagrange
element PK on a simplex.
- "FEM_QK(N,K)" : classical Lagrange element QK on a parellepiped.
- "FEM_QK_DISCONTINUOUS(N,K,alpha)" : discontinuous Lagrange
element QK on a parallelepiped.
- "FEM_Q2_INCOMPLETE" : incomplete Q2 element with 8 dof (serendipity
Quad 8 element)
- "FEM_PK_PRISM(N,K)" : classical Lagrange element PK on a prism.
- "FEM_PK_PRISM_DISCONTINUOUS(N,K,alpha)" : classical discontinuous
Lagrange element PK on a prism.
- "FEM_PK_WITH_CUBIC_BUBBLE(N,K)" : classical Lagrange element PK
on a simplex with an additional volumic bubble function.
- "FEM_PRODUCT(FEM1,FEM2)" : tensorial product of two polynomial
elements
- "FEM_P1_NONCONFORMING" : Nonconforming P1 method on a
triangle.
- "FEM_P1_BUBBLE_FACE(N)" : P1 method on a simplex with an
additional bubble function on face 0.
- "FEM_P1_BUBBLE_FACE_LAG" : P1 method on a simplex with an
additional lagrange dof on face 0.
- "FEM_HERMITE(N)" : Hermite element P3 on dimension N (1, 2 por 3).
- "FEM_ARGYRIS" : Argyris element on the triangle.
- "FEM_HCT_TRIANGLE" : Hsieh-Clough-Tocher element on the triangle
(composite P3 element which is C^1, 12 dof).
- "FEM_REDUCED_HCT_TRIANGLE" : Hsieh-Clough-Tocher element on the triangle
(composite P3 element which is C^1, 9 dof).
- "FEM_QUADC1_COMPOSITE" : quadrilateral element, composite P3 element
and C^1 (16 dof).
- "FEM_REDUCED_QUADC1_COMPOSITE" : quadrilateral element, composite
P3 element and C^1 (12 dof).
- "FEM_PK_HIERARCHICAL(N,K)" : PK element with a hierarchical basis
- "FEM_QK_HIERARCHICAL(N,K)" : QK element with a hierarchical basis
- "FEM_PK_PRISM_HIERARCHICAL(N,K)" : PK element on a prism with a
hierarchical basis
- "FEM_STRUCTURED_COMPOSITE(FEM, K)" : Composite fem on a grid with
K divisions
- "FEM_PK_HIERARCHICAL_COMPOSITE(N,K,S)" : PK composite element on
a grid with S subdivisions and with a hierarchical basis
- "FEM_PK_FULL_HIERARCHICAL_COMPOSITE(N,K,S)" : PK composite
element with S subdivisions and a hierarchical basis on both degree
and subdivision
*/
#ifndef GETFEM_FEM_H__
#define GETFEM_FEM_H__
#include "dal_static_stored_objects.h"
#include "bgeot_geometric_trans.h"
#include "bgeot_poly_composite.h"
#include "getfem_integration.h"
#include "dal_naming_system.h"
#include <deque>
namespace getfem {
/** @defgroup dofdescr Dof description
* This set of functions gives a pointer to dof descriptions and
* tests the compatibility between two dof descriptions.
* A dof description describes a type of dof (Lagrange type,
* Hermite type ...) in order to be able to say wether two dofs are
* to be identified or not. The construction of dof type with
* the tensorial product is taken into
* account, making the dof_description structure a little bit complex
* (this structure will probably evoluate in the future).
* @{
*/
struct dof_description;
/// Type representing a pointer on a dof_description
typedef dof_description *pdof_description;
/** @brief Description of a unique dof of lagrange type (value at the node).
* @param d the dimension of the reference element (2 for triangles, 3 for tetrahedrons ...)
*/
pdof_description lagrange_dof(dim_type d);
/** Description of a unique dof of derivative type.
* (a derivative at the node).
* @param d the dimension of the reference element.
* @param r corresponds to the variable number for which the derivative is taken (0 <= r < d)
*/
pdof_description derivative_dof(dim_type d, dim_type r);
/** Description of a unique dof of second derivative type.
* @param d the dimension of the reference element.
* @param num_der1 corresponds to the variable number for which the first derivative is taken (0 <= r < d)
* @param num_der2 corresponds to the variable number for which the second derivative is taken (0 <= r < d)
*/
pdof_description second_derivative_dof(dim_type d,
dim_type num_der1,
dim_type num_der2);
/** Description of a unique dof of normal derivative type
* (normal derivative at the node, regarding a face).
* @param d the dimension of the reference element.
*/
pdof_description normal_derivative_dof(dim_type d);
/** Description of a unique dof of mean value type.
* @param d the dimension of the reference element.
*/
pdof_description mean_value_dof(dim_type d);
pdof_description bubble1_dof(dim_type ct);
/** Description of a global dof, i.e. a numbered dof having a global scope.
* @param d the dimension of the reference element.
*/
pdof_description global_dof(dim_type d);
/// Product description of the descriptions *pnd1 and *pnd2.
pdof_description product_dof(pdof_description pnd1, pdof_description pnd2);
pdof_description to_coord_dof(pdof_description p, dim_type ct);
/// Description of a special dof for Xfem
pdof_description xfem_dof(pdof_description p, size_type ind);
/// Returns the xfem_index of dof (0 for normal dof)
size_type dof_xfem_index(pdof_description);
size_type reserve_xfem_index(void);
dim_type coord_index_of_dof(pdof_description a);
int dof_weak_compatibility(pdof_description a, pdof_description b);
/** Gives a total order on the dof description compatible with the
* identification.
*/
int dof_description_compare(pdof_description a, pdof_description b);
/// Says if the dof is linkable.
bool dof_linkable(pdof_description);
/// Says if the two dofs can be identified.
bool dof_compatibility(pdof_description, pdof_description);
/* @} */
/* ******************************************************************** */
/* Classes for description of a finite element. */
/* ******************************************************************** */
/** @defgroup pfem Finite element description
*
* @{
*/
class virtual_fem;
/** type of pointer on a fem description @see getfem::virtual_fem */
typedef boost::intrusive_ptr<const getfem::virtual_fem> pfem;
class fem_precomp_;
typedef boost::intrusive_ptr<const getfem::fem_precomp_> pfem_precomp;
class fem_interpolation_context;
/** @brief Base class for finite element description */
class virtual_fem : virtual public dal::static_stored_object {
public :
enum vec_type { VECTORIAL_NOTRANSFORM_TYPE, VECTORIAL_PRIMAL_TYPE,
VECTORIAL_DUAL_TYPE };
protected :
mutable std::vector<pdof_description> dof_types_;
/* this convex structure is "owned" by the virtual_fem
(a deep copy is made when virtual_fems are copied)
But cvs_node has to be a pointer, as bgeot::convex_structure
inherits from dal::static_stored_object
*/
boost::intrusive_ptr<bgeot::convex_structure> cvs_node;
bgeot::convex<base_node> cv_node;
mutable bgeot::pstored_point_tab pspt;
mutable bool pspt_valid;
bgeot::pconvex_ref cvr; // reference element.
dim_type ntarget_dim; // dimension of the target space
mutable dim_type dim_; // dimension of the reference element
bool is_equiv; // true if the FEM is equivalent
bool is_lag; // true if the FEM is of Lagrange type
bool is_pol; // true if the FEM is polynomial
bool is_polycomp; // true if the FEM is polynomial composite
bool real_element_defined;
short_type es_degree; // estimated polynomial degree of the FEM
short_type hier_raff; // hierarchical refinement of the FEM
vec_type vtype; // for vectorial elements, type of transformation
// from the reference element.
std::string debug_name_;
public :
/** Number of degrees of freedom.
@param cv the convex number for this FEM. This information is
rarely used, by is needed by some "special" FEMs, such as
getfem::interpolated_fem.
*/
virtual size_type nb_dof(size_type /*cv*/) const
{ return dof_types_.size(); }
/// Number of basis functions.
virtual size_type nb_base(size_type cv) const
{ return nb_dof(cv); }
/// Number of components (nb_dof() * dimension of the target space).
size_type nb_base_components(size_type cv) const
{ return nb_base(cv) * ntarget_dim; }
size_type nb_components(size_type cv) const
{ return nb_dof(cv) * ntarget_dim; }
/// Get the array of pointer on dof description.
const std::vector<pdof_description> &dof_types(void) const
{ return dof_types_; }
short_type hierarchical_raff(void) const { return hier_raff; }
/// dimension of the reference element.
dim_type dim(void) const { return dim_; }
dim_type &dim(void) { return dim_; }
/// dimension of the target space.
dim_type target_dim(void) const { return ntarget_dim; }
/// Type of vectorial element.
vec_type vectorial_type(void) const { return vtype; }
/// Return the convex of the reference element.
virtual bgeot::pconvex_ref ref_convex(size_type) const { return cvr; }
/// @internal
bgeot::pconvex_ref &mref_convex() { return cvr; }
/// Gives the convex of the reference element.
bgeot::pconvex_structure basic_structure(size_type cv) const
{ return ref_convex(cv)->structure(); }
/// Gives the convex representing the nodes on the reference element.
virtual const bgeot::convex<base_node> &node_convex(size_type) const
{ return cv_node; }
/// Gives the convex structure of the reference element nodes.
bgeot::pconvex_structure structure(size_type cv) const
{ return node_convex(cv).structure(); }
const std::string &debug_name(void) const { return debug_name_; }
std::string &debug_name(void) { return debug_name_; }
virtual bgeot::pstored_point_tab node_tab(size_type) const {
if (!pspt_valid) {
pspt = bgeot::store_point_tab(cv_node.points());
pspt_valid = true;
}
return pspt;
}
/** Gives the node corresponding to the dof i.
@param cv the convex number for this FEM. This information is
rarely used, by is needed by some "special" FEMs, such as
getfem::interpolated_fem.
@param i the local dof number (<tt>i < nb_dof(cv)</tt>)
*/
const base_node &node_of_dof(size_type cv, size_type i) const
{ return (*(node_tab(cv)))[i];}
bool is_on_real_element(void) const { return real_element_defined; }
bool is_equivalent(void) const { return is_equiv; }
bool need_G(void) const
{ return !(is_equivalent()) || real_element_defined; }
/// true if the base functions are such that @f$ \varphi_i(\textrm{node\_of\_dof(j)}) = \delta_{ij} @f$
bool is_lagrange(void) const { return is_lag; }
/// true if the base functions are polynomials
bool is_polynomial(void) const { return is_pol; }
bool is_polynomialcomp(void) const { return is_polycomp; }
bool &is_polynomialcomp(void) { return is_polycomp; }
bool &is_equivalent(void) { return is_equiv; }
bool &is_lagrange(void) { return is_lag; }
bool &is_polynomial(void) { return is_pol; }
short_type estimated_degree(void) const { return es_degree; }
short_type &estimated_degree(void) { return es_degree; }
virtual void mat_trans(base_matrix &, const base_matrix &,
bgeot::pgeometric_trans) const
{ GMM_ASSERT1(false, "This function should not be called."); }
/** Interpolate at an arbitrary point x given on the reference
element.
@param c the fem_interpolation_context, should have been
suitably initialized for the point of evaluation.
@param coeff is the vector of coefficient relatively to
the base functions, its length should be @c Qdim*this->nb_dof().
@param val contains the interpolated value, on output (its
size should be @c Qdim*this->target_dim()).
@param Qdim is the optional Q dimension, if the FEM is
considered as a "vectorized" one.
*/
template<typename CVEC, typename VVEC>
void interpolation(const fem_interpolation_context& c,
const CVEC& coeff, VVEC &val, dim_type Qdim) const;
/** Build the interpolation matrix for the interpolation at a
fixed point x, given on the reference element.
The matrix @c M is filled, such that for a given @c coeff
vector, the interpolation is given by @c M*coeff.
*/
template <typename MAT>
void interpolation(const fem_interpolation_context& c,
MAT &M, dim_type Qdim) const;
/** Interpolation of the gradient. The output is stored in the @f$
Q\times N@f$ matrix @c val.
*/
template<typename CVEC, typename VMAT>
void interpolation_grad(const fem_interpolation_context& c,
const CVEC& coeff, VMAT &val,
dim_type Qdim=1) const;
/** Interpolation of the hessian. The output is stored in the @f$
Q\times (N^2)@f$ matrix @c val.
*/
template<typename CVEC, typename VMAT>
void interpolation_hess(const fem_interpolation_context& c,
const CVEC& coeff, VMAT &val,
dim_type Qdim) const;
/** Give the value of all components of the base functions at the
* point x of the reference element. Basic function used essentially
* by fem_precomp.
*/
virtual void base_value(const base_node &x, base_tensor &t) const = 0;
/** Give the value of all gradients (on ref. element) of the components
* of the base functions at the point x of the reference element.
* Basic function used essentially by fem_precomp.
*/
virtual void grad_base_value(const base_node &x, base_tensor &t) const = 0;
/** Give the value of all hessians (on ref. element) of the components
* of the base functions at the point x of the reference element.
* Basic function used essentially by fem_precomp.
*/
virtual void hess_base_value(const base_node &x, base_tensor &t) const = 0;
/** Give the value of all components of the base functions at the
current point of the fem_interpolation_context. Used by
elementary computations. if withM is false the matrix M for
non tau-equivalent elements is not taken into account.
*/
virtual void real_base_value(const fem_interpolation_context &c,
base_tensor &t, bool withM = true) const;
/** Give the gradient of all components of the base functions at the
current point of the fem_interpolation_context. Used by
elementary computations. if withM is false the matrix M for
non tau-equivalent elements is not taken into account.
*/
virtual void real_grad_base_value(const fem_interpolation_context &c,
base_tensor &t, bool withM = true) const;
/** Give the hessian of all components of the base functions at the
current point of the fem_interpolation_context. Used by
elementary computations. if withM is false the matrix M for
non tau-equivalent elements is not taken into account.
*/
virtual void real_hess_base_value(const fem_interpolation_context &c,
base_tensor &t, bool withM = true) const;
virtual size_type index_of_global_dof(size_type, size_type) const
{ GMM_ASSERT1(false, "internal error."); }
/** internal function adding a node to an element for the creation
* of a finite element method. Important : the faces should be the faces
* on which the corresponding base function is non zero.
*/
void add_node(const pdof_description &d, const base_node &pt,
const dal::bit_vector &faces);
void add_node(const pdof_description &d, const base_node &pt);
void init_cvs_node(void);
void unfreeze_cvs_node(void);
virtual_fem &operator =(const virtual_fem &f) {
copy(f); return *this;
}
virtual_fem(void) {
ntarget_dim = 1; dim_ = 1;
is_equiv = is_pol = is_polycomp = is_lag = false;
pspt_valid = false; hier_raff = 0; real_element_defined = false;
es_degree = 5;
vtype = VECTORIAL_NOTRANSFORM_TYPE;
cvs_node = bgeot::new_convex_structure();
}
virtual_fem(const virtual_fem& f) : dal::static_stored_object()
{ copy(f); }
virtual ~virtual_fem() {}
private:
void copy(const virtual_fem &f) {
dof_types_ = f.dof_types_;
cvs_node = bgeot::new_convex_structure();
*cvs_node = *f.cvs_node; // deep copy
cv_node = f.cv_node;
cv_node.structure() = cvs_node;
pspt = 0;
pspt_valid = false;
cvr = f.cvr;
dim_ = f.dim_;
ntarget_dim = f.ntarget_dim;
vtype = f.vtype;
is_equiv = f.is_equiv;
is_lag = f.is_lag;
is_pol = f.is_pol;
is_polycomp = f.is_polycomp;
real_element_defined = f.real_element_defined;
es_degree = f.es_degree;
hier_raff = f.hier_raff;
debug_name_ = f.debug_name_;
}
};
/**
virtual_fem implementation as a vector of generic functions. The
class FUNC should provide "derivative" and "eval" member
functions (this is the case for bgeot::polynomial<T>).
*/
template <class FUNC> class fem : public virtual_fem {
protected :
std::vector<FUNC> base_;
public :
/// Gives the array of basic functions (components).
const std::vector<FUNC> &base(void) const { return base_; }
std::vector<FUNC> &base(void) { return base_; }
void base_value(const base_node &x, base_tensor &t) const {
bgeot::multi_index mi(2);
mi[1] = target_dim(); mi[0] = short_type(nb_base(0));
t.adjust_sizes(mi);
size_type R = nb_base_components(0);
base_tensor::iterator it = t.begin();
for (size_type i = 0; i < R; ++i, ++it)
*it = bgeot::to_scalar(base_[i].eval(x.begin()));
}
void grad_base_value(const base_node &x, base_tensor &t) const {
bgeot::multi_index mi(3);
dim_type n = dim();
mi[2] = n; mi[1] = target_dim(); mi[0] = short_type(nb_base(0));
t.adjust_sizes(mi);
size_type R = nb_base_components(0);
base_tensor::iterator it = t.begin();
for (dim_type j = 0; j < n; ++j)
for (size_type i = 0; i < R; ++i, ++it)
{ FUNC f = base_[i]; f.derivative(j); *it = bgeot::to_scalar(f.eval(x.begin())); }
}
void hess_base_value(const base_node &x, base_tensor &t) const {
bgeot::multi_index mi(4);
dim_type n = dim();
mi[3] = n; mi[2] = n; mi[1] = target_dim();
mi[0] = short_type(nb_base(0));
t.adjust_sizes(mi);
size_type R = nb_base_components(0);
base_tensor::iterator it = t.begin();
for (dim_type k = 0; k < n; ++k)
for (dim_type j = 0; j < n; ++j)
for (size_type i = 0; i < R; ++i, ++it) {
FUNC f = base_[i];
f.derivative(j); f.derivative(k);
*it = bgeot::to_scalar(f.eval(x.begin()));
}
}
};
/** Classical polynomial FEM. */
typedef const fem<base_poly> * ppolyfem;
/** Polynomial composite FEM */
typedef const fem<bgeot::polynomial_composite> * ppolycompfem;
/** Give a pointer on the structures describing the classical
polynomial fem of degree k on a given convex type.
@param pgt the geometric transformation (which defines the convex type).
@param k the degree of the fem.
@return a ppolyfem.
*/
pfem classical_fem(bgeot::pgeometric_trans pgt, short_type k);
/** Give a pointer on the structures describing the classical
polynomial discontinuous fem of degree k on a given convex type.
@param pgt the geometric transformation (which defines the convex type).
@param k the degree of the fem.
@param alpha the "inset" factor for the dof nodes: with alpha =
0, the nodes are located as usual (i.e. with node on the convex border),
and for 0 < alpha < 1, they converge to the center of gravity of the convex.
@return a ppolyfem.
*/
pfem classical_discontinuous_fem(bgeot::pgeometric_trans pg, short_type k, scalar_type alpha=0);
/** get a fem descriptor from its string name. */
pfem fem_descriptor(std::string name);
/** get the string name of a fem descriptor. */
std::string name_of_fem(pfem p);
pfem PK_fem(size_type n, short_type k);
pfem QK_fem(size_type n, short_type k);
pfem PK_prism_fem(size_type n, short_type k);
/**
Pre-computations on a fem (given a fixed set of points on the
reference convex, this object computes the value/gradient/hessian
of all base functions on this set of points and stores them.
*/
class fem_precomp_ : virtual public dal::static_stored_object {
protected:
pfem pf;
bgeot::pstored_point_tab pspt;
mutable std::vector<base_tensor> c; // store values of base functions
mutable std::vector<base_tensor> pc; // store gradients of base functions
mutable std::vector<base_tensor> hpc; // store hessians of base functions
public:
/// returns values of the base functions
inline const base_tensor &val(size_type i) const
{ if (c.empty()) init_val(); return c[i]; }
/// returns gradients of the base functions
inline const base_tensor &grad(size_type i) const
{ if (pc.empty()) init_grad(); return pc[i]; }
/// returns hessians of the base functions
inline const base_tensor &hess(size_type i) const
{ if (hpc.empty()) init_hess(); return hpc[i]; }
inline pfem get_pfem() const { return pf; }
inline const bgeot::stored_point_tab& get_point_tab() const
{ return *pspt; }
fem_precomp_(pfem, bgeot::pstored_point_tab);
private:
void init_val() const;
void init_grad() const;
void init_hess() const;
};
/** @brief Handles precomputations for FEM. statically allocates a
fem-precomputation object, and returns a pointer to it. The
fem_precomp_ objects are "cached", i.e. they are stored in a
global pool and if this function is called two times with the
same arguments, a pointer to the same object will be returned.
@param pf a pointer to the fem object. @param pspt a pointer to
a list of points in the reference convex.CAUTION: this array must
not be destroyed as long as the fem_precomp is used!!.
Moreover pspt is supposed to identify uniquely the set of
points. This means that you should NOT alter its content at any
time after using this function.
If you need a set of "temporary" getfem::fem_precomp_, create
them via a getfem::fem_precomp_pool structure. All memory will be
freed when this structure will be destroyed. */
pfem_precomp fem_precomp(pfem pf, bgeot::pstored_point_tab pspt,
dal::pstatic_stored_object dep);
/** Request for the removal of a pfem_precomp */
inline void delete_fem_precomp(pfem_precomp pfp)
{ dal::del_stored_object(pfp); }
/**
handle a pool (i.e. a set) of fem_precomp. The difference with
the global fem_precomp function is that these fem_precomp objects
are freed when the fem_precomp_pool is destroyed (they can eat
much memory). An example of use can be found in the
getfem::interpolation_solution functions of getfem_export.h
*/
class fem_precomp_pool {
std::set<pfem_precomp> precomps;
public :
/** Request a pfem_precomp. If not already in the pool, the
pfem_precomp is computed, and added to the pool.
@param pf a pointer to the fem object.
@param pspt a pointer to a list of points in the reference convex.CAUTION:
this array must not be destroyed as long as the fem_precomp is used!!
Moreover pspt is supposed to identify uniquely the set of
points. This means that you should NOT alter its content until
the fem_precomp_pool is destroyed.
*/
pfem_precomp operator()(pfem pf, bgeot::pstored_point_tab pspt) {
pfem_precomp p = fem_precomp(pf, pspt, 0);
precomps.insert(p);
return p;
}
void clear(void);
~fem_precomp_pool() { clear(); }
};
/** structure passed as the argument of fem interpolation
functions. This structure can be partially filled (for example
the xreal will be computed if needed as long as pgp+ii is known).
*/
class fem_interpolation_context :
public bgeot::geotrans_interpolation_context {
mutable base_matrix M_; // optional transformation matrix (for non tau-equivalent fems)
pfem pf_; // current fem
pfem_precomp pfp_; // optional fem_precomp_ (speed up the computations)
size_type convex_num_; // The element (convex) number
size_type face_num_; // Face number for boundary integration
public:
/// true if a fem_precomp_ has been supplied.
bool have_pfp() const { return pfp_ != 0; }
/// true if the pfem is available.
bool have_pf() const { return pf_ != 0; }
/// non tau-equivalent transformation matrix.
const base_matrix& M() const;
/** fill the tensor with the values of the base functions (taken
at point @c this->xref())
*/
void base_value(base_tensor& t, bool withM = true) const;
/** fill the tensor with the gradient of the base functions (taken
at point @c this->xref())
*/
void grad_base_value(base_tensor& t, bool withM = true) const;
/** fill the tensor with the hessian of the base functions (taken
at point @c this->xref())
*/
void hess_base_value(base_tensor& t, bool withM = true) const;
/** get the current FEM descriptor */
const pfem pf() const { return pf_; }
/** get the current convex number */
size_type convex_num() const;
/** get the current face number */
size_type face_num() const;
/** get the current fem_precomp_ */
pfem_precomp pfp() const { return pfp_; }
void set_pfp(pfem_precomp newpfp);
void set_pf(pfem newpf);
fem_interpolation_context();
fem_interpolation_context(bgeot::pgeotrans_precomp pgp__,
pfem_precomp pfp__, size_type ii__,
const base_matrix& G__,
size_type convex_num__,
size_type face_num__ = size_type(-1));
fem_interpolation_context(bgeot::pgeometric_trans pgt__,
pfem_precomp pfp__, size_type ii__,
const base_matrix& G__,
size_type convex_num__,
size_type face_num__ = size_type(-1));
fem_interpolation_context(bgeot::pgeometric_trans pgt__,
pfem pf__,
const base_node& xref__,
const base_matrix& G__,
size_type convex_num__,
size_type face_num__ = size_type(-1));
};
template <typename CVEC, typename VVEC>
void virtual_fem::interpolation(const fem_interpolation_context& c,
const CVEC& coeff, VVEC &val,
dim_type Qdim) const {
size_type Qmult = size_type(Qdim) / target_dim();
size_type R = nb_dof(c.convex_num());
GMM_ASSERT1(gmm::vect_size(val) == Qdim, "dimensions mismatch");
GMM_ASSERT1(gmm::vect_size(coeff) == R*Qmult,
"Wrong size for coeff vector");
gmm::clear(val);
base_tensor Z; real_base_value(c, Z);
for (size_type j = 0; j < R; ++j) {
for (size_type q = 0; q < Qmult; ++q) {
typename gmm::linalg_traits<CVEC>::value_type co = coeff[j*Qmult+q];
for (size_type r = 0; r < target_dim(); ++r)
val[r + q*target_dim()] += co * Z[j + r*R];
}
}
}
template <typename MAT>
void virtual_fem::interpolation(const fem_interpolation_context& c,
MAT &M, dim_type Qdim) const {
size_type Qmult = size_type(Qdim) / target_dim();
size_type R = nb_dof(c.convex_num());
GMM_ASSERT1(gmm::mat_nrows(M) == Qdim && gmm::mat_ncols(M) == R*Qmult,
"dimensions mismatch");
gmm::clear(M);
base_tensor Z; real_base_value(c, Z);
for (size_type j = 0; j < R; ++j) {
for (size_type q = 0; q < Qmult; ++q) {
for (size_type r = 0; r < target_dim(); ++r)
M(r+q*target_dim(), j*Qmult+q) = Z[j + r*R];
}
}
}
template<typename CVEC, typename VMAT>
void virtual_fem::interpolation_grad(const fem_interpolation_context& c,
const CVEC& coeff, VMAT &val,
dim_type Qdim) const {
// typedef typename gmm::linalg_traits<CVEC>::value_type T;
size_type Qmult = size_type(Qdim) / target_dim();
dim_type N = dim_type(c.N());
GMM_ASSERT1(gmm::mat_ncols(val) == N && gmm::mat_nrows(val) == Qdim,
"dimensions mismatch");
base_tensor t;
size_type R = nb_dof(c.convex_num());
gmm::clear(val);
real_grad_base_value(c, t);
for (size_type q = 0; q < Qmult; ++q) {
base_tensor::const_iterator it = t.begin();
for (size_type k = 0; k < N; ++k)
for (size_type r = 0; r < target_dim(); ++r)
for (size_type j = 0; j < R; ++j, ++it)
val(r + q*target_dim(), k) += coeff[j*Qmult+q] * (*it);
}
}
template<typename CVEC, typename VMAT>
void virtual_fem::interpolation_hess(const fem_interpolation_context& c,
const CVEC& coeff, VMAT &val,
dim_type Qdim) const {
// typedef typename gmm::linalg_traits<CVEC>::value_type T;
size_type Qmult = size_type(Qdim) / target_dim();
dim_type N = dim_type(c.N());
GMM_ASSERT1(gmm::mat_ncols(val) == gmm::size_type(N*N)
&& gmm::mat_nrows(val) == Qdim, "dimensions mismatch");
base_tensor t;
size_type R = nb_dof(c.convex_num());
gmm::clear(val);
real_hess_base_value(c, t);
for (size_type q = 0; q < Qmult; ++q) {
base_tensor::const_iterator it = t.begin();
for (size_type k = 0; k < size_type(N*N); ++k)
for (size_type r = 0; r < target_dim(); ++r)
for (size_type j = 0; j < R; ++j, ++it)
val(r + q*target_dim(), k) += coeff[j*Qmult+q] * (*it);
}
}
/* Functions allowing the add of a finite element method outwards
of getfem_fem.cc */
typedef dal::naming_system<virtual_fem>::param_list fem_param_list;
void inline read_poly(bgeot::base_poly &p, int d, const char *s)
{ p = bgeot::read_base_poly(short_type(d), s); }
void add_fem_name(std::string name,
dal::naming_system<virtual_fem>::pfunction f);
/* @} */
} /* end of namespace getfem. */
#endif
|