v0.13.0
Classes | Functions | Variables
prism_polynomial_approximation.cpp File Reference
#include <MoFEM.hpp>

Go to the source code of this file.

Classes

struct  ApproxFunction
 
struct  PrismOpCheck
 
struct  PrismOpRhs
 
struct  PrismOpLhs
 
struct  PrismFE
 

Functions

int main (int argc, char *argv[])
 

Variables

static char help [] = "...\n\n"
 
static constexpr int approx_order = 6
 

Function Documentation

◆ main()

int main ( int  argc,
char *  argv[] 
)
Examples
prism_polynomial_approximation.cpp.

Definition at line 108 of file prism_polynomial_approximation.cpp.

108  {
109 
110  MoFEM::Core::Initialize(&argc, &argv, (char *)0, help);
111 
112  try {
113 
114  moab::Core mb_instance;
115  moab::Interface &moab = mb_instance;
116 
117  ParallelComm *pcomm = ParallelComm::get_pcomm(&moab, MYPCOMM_INDEX);
118  auto moab_comm_wrap =
119  boost::make_shared<WrapMPIComm>(PETSC_COMM_WORLD, false);
120  if (pcomm == NULL)
121  pcomm = new ParallelComm(&moab, moab_comm_wrap->get_comm());
122 
123  std::array<double, 18> one_prism_coords = {0, 0, 0, 1, 0, 0, 0, 1, 0,
124  0, 0, 1, 1, 0, 1, 0, 1, 1};
125  std::array<EntityHandle, 6> one_prism_nodes;
126  for (int n = 0; n != 6; ++n)
127  CHKERR moab.create_vertex(&one_prism_coords[3 * n], one_prism_nodes[n]);
128  EntityHandle one_prism;
129  CHKERR moab.create_element(MBPRISM, one_prism_nodes.data(), 6, one_prism);
130  Range one_prism_range;
131  one_prism_range.insert(one_prism);
132  Range one_prism_adj_ents;
133  for (int d = 1; d != 3; ++d)
134  CHKERR moab.get_adjacencies(one_prism_range, d, true, one_prism_adj_ents,
135  moab::Interface::UNION);
136 
137  MoFEM::Core core(moab);
138  MoFEM::Interface &m_field = core;
139 
140  PrismsFromSurfaceInterface *prisms_from_surface_interface;
141  CHKERR m_field.getInterface(prisms_from_surface_interface);
142  BitRefLevel bit_level0;
143  bit_level0.set(0);
144  CHKERR m_field.getInterface<BitRefManager>()->setEntitiesBitRefLevel(
145  one_prism_range, bit_level0);
146  CHKERR prisms_from_surface_interface->seedPrismsEntities(one_prism_range,
147  bit_level0);
148 
149  // Fields
150  CHKERR m_field.add_field("FIELD1", H1, AINSWORTH_LEGENDRE_BASE, 1);
151  CHKERR m_field.add_ents_to_field_by_type(0, MBPRISM, "FIELD1");
152 
153  CHKERR m_field.set_field_order(0, MBVERTEX, "FIELD1", 1);
154  CHKERR m_field.set_field_order(0, MBEDGE, "FIELD1", approx_order);
155  CHKERR m_field.set_field_order(0, MBTRI, "FIELD1", approx_order);
156  CHKERR m_field.set_field_order(0, MBQUAD, "FIELD1", approx_order);
157  CHKERR m_field.set_field_order(0, MBPRISM, "FIELD1", approx_order);
158  CHKERR m_field.build_fields();
159 
160  // FE
161  CHKERR m_field.add_finite_element("PRISM");
162 
163  // Define rows/cols and element data
164  CHKERR m_field.modify_finite_element_add_field_row("PRISM", "FIELD1");
165  CHKERR m_field.modify_finite_element_add_field_col("PRISM", "FIELD1");
166  CHKERR m_field.modify_finite_element_add_field_data("PRISM", "FIELD1");
167  CHKERR m_field.add_ents_to_finite_element_by_type(0, MBPRISM, "PRISM");
168 
169  // build finite elemnts
170  CHKERR m_field.build_finite_elements();
171  // //build adjacencies
172  CHKERR m_field.build_adjacencies(bit_level0);
173 
174  // Problem
175  CHKERR m_field.add_problem("TEST_PROBLEM");
176 
177  // set finite elements for problem
178  CHKERR m_field.modify_problem_add_finite_element("TEST_PROBLEM", "PRISM");
179  // set refinement level for problem
180  CHKERR m_field.modify_problem_ref_level_add_bit("TEST_PROBLEM", bit_level0);
181 
182  // build problem
183  ProblemsManager *prb_mng_ptr;
184  CHKERR m_field.getInterface(prb_mng_ptr);
185  CHKERR prb_mng_ptr->buildProblem("TEST_PROBLEM", true);
186  // partition
187  CHKERR prb_mng_ptr->partitionSimpleProblem("TEST_PROBLEM");
188  CHKERR prb_mng_ptr->partitionFiniteElements("TEST_PROBLEM");
189  // what are ghost nodes, see Petsc Manual
190  CHKERR prb_mng_ptr->partitionGhostDofs("TEST_PROBLEM");
191 
192  // Create matrices
195  ->createMPIAIJWithArrays<PetscGlobalIdx_mi_tag>("TEST_PROBLEM", A);
197  CHKERR m_field.getInterface<VecManager>()->vecCreateGhost("TEST_PROBLEM",
198  ROW, F);
200  CHKERR m_field.getInterface<VecManager>()->vecCreateGhost("TEST_PROBLEM",
201  COL, D);
202 
203  auto assemble_matrices_and_vectors = [&]() {
205  PrismFE fe(m_field);
206  MatrixDouble inv_jac;
207  fe.getOpPtrVector().push_back(
209  fe.getOpPtrVector().push_back(
211  fe.getOpPtrVector().push_back(
212  new MoFEM::OpSetInvJacH1ForFatPrism(inv_jac));
213  fe.getOpPtrVector().push_back(new PrismOpRhs(F));
214  fe.getOpPtrVector().push_back(new PrismOpLhs(A));
215  CHKERR VecZeroEntries(F);
216  CHKERR MatZeroEntries(A);
217  CHKERR m_field.loop_finite_elements("TEST_PROBLEM", "PRISM", fe);
218  CHKERR VecAssemblyBegin(F);
219  CHKERR VecAssemblyEnd(F);
220  CHKERR MatAssemblyBegin(A, MAT_FINAL_ASSEMBLY);
221  CHKERR MatAssemblyEnd(A, MAT_FINAL_ASSEMBLY);
223  };
224 
225  auto solve_problem = [&] {
227  auto solver = createKSP(PETSC_COMM_WORLD);
228  CHKERR KSPSetOperators(solver, A, A);
229  CHKERR KSPSetFromOptions(solver);
230  CHKERR KSPSetUp(solver);
231  CHKERR KSPSolve(solver, F, D);
232  CHKERR VecGhostUpdateBegin(D, INSERT_VALUES, SCATTER_FORWARD);
233  CHKERR VecGhostUpdateEnd(D, INSERT_VALUES, SCATTER_FORWARD);
234  CHKERR m_field.getInterface<VecManager>()->setLocalGhostVector(
235  "TEST_PROBLEM", COL, D, INSERT_VALUES, SCATTER_REVERSE);
237  };
238 
239  auto check_solution = [&] {
241  PrismFE fe(m_field);
242  boost::shared_ptr<VectorDouble> field_vals_ptr(new VectorDouble());
243  boost::shared_ptr<MatrixDouble> diff_field_vals_ptr(new MatrixDouble());
244  MatrixDouble inv_jac;
245  fe.getOpPtrVector().push_back(
246  new OpCalculateInvJacForFatPrism(inv_jac));
247  fe.getOpPtrVector().push_back(
248  new OpSetInvJacH1ForFatPrism(inv_jac));
249  fe.getOpPtrVector().push_back(
250  new OpCalculateScalarFieldValues("FIELD1", field_vals_ptr));
251  fe.getOpPtrVector().push_back(
252  new OpCalculateScalarFieldGradient<3>("FIELD1", diff_field_vals_ptr));
253  fe.getOpPtrVector().push_back(
254  new PrismOpCheck(field_vals_ptr, diff_field_vals_ptr));
255  CHKERR m_field.loop_finite_elements("TEST_PROBLEM", "PRISM", fe);
257  };
258 
259  CHKERR assemble_matrices_and_vectors();
260  CHKERR solve_problem();
261  CHKERR check_solution();
262  }
263  CATCH_ERRORS;
264 
266  return 0;
267 }
static Index< 'n', 3 > n
@ COL
Definition: definitions.h:136
@ ROW
Definition: definitions.h:136
#define CATCH_ERRORS
Catch errors.
Definition: definitions.h:385
@ AINSWORTH_LEGENDRE_BASE
Ainsworth Cole (Legendre) approx. base .
Definition: definitions.h:73
@ H1
continuous field
Definition: definitions.h:98
#define MYPCOMM_INDEX
default communicator number PCOMM
Definition: definitions.h:228
#define MoFEMFunctionBegin
First executable line of each MoFEM function, used for error handling. Final line of MoFEM functions ...
Definition: definitions.h:359
#define MoFEMFunctionReturn(a)
Last executable line of each PETSc function used for error handling. Replaces return()
Definition: definitions.h:429
#define CHKERR
Inline error check.
Definition: definitions.h:548
virtual MoFEMErrorCode modify_finite_element_add_field_row(const std::string &fe_name, const std::string &name_row)=0
set field row which finite element use
virtual MoFEMErrorCode add_finite_element(const std::string &fe_name, enum MoFEMTypes bh=MF_EXCL, int verb=DEFAULT_VERBOSITY)=0
add finite element
virtual MoFEMErrorCode build_finite_elements(int verb=DEFAULT_VERBOSITY)=0
Build finite elements.
virtual MoFEMErrorCode add_ents_to_finite_element_by_type(const EntityHandle entities, const EntityType type, const std::string &name, const bool recursive=true)=0
add entities to finite element
virtual MoFEMErrorCode modify_finite_element_add_field_data(const std::string &fe_name, const std::string &name_filed)=0
set finite element field data
virtual MoFEMErrorCode modify_finite_element_add_field_col(const std::string &fe_name, const std::string &name_row)=0
set field col which finite element use
virtual MoFEMErrorCode build_fields(int verb=DEFAULT_VERBOSITY)=0
virtual MoFEMErrorCode set_field_order(const EntityHandle meshset, const EntityType type, const std::string &name, const ApproximationOrder order, int verb=DEFAULT_VERBOSITY)=0
Set order approximation of the entities in the field.
virtual MoFEMErrorCode add_ents_to_field_by_type(const Range &ents, const EntityType type, const std::string &name, int verb=DEFAULT_VERBOSITY)=0
Add entities to field meshset.
virtual MoFEMErrorCode loop_finite_elements(const std::string &problem_name, const std::string &fe_name, FEMethod &method, boost::shared_ptr< NumeredEntFiniteElement_multiIndex > fe_ptr=nullptr, MoFEMTypes bh=MF_EXIST, CacheTupleWeakPtr cache_ptr=CacheTupleSharedPtr(), int verb=DEFAULT_VERBOSITY)=0
Make a loop over finite elements.
MoFEMErrorCode partitionGhostDofs(const std::string name, int verb=VERBOSE)
determine ghost nodes
MoFEMErrorCode partitionSimpleProblem(const std::string name, int verb=VERBOSE)
partition problem dofs
MoFEMErrorCode buildProblem(const std::string name, const bool square_matrix, int verb=VERBOSE)
build problem data structures
MoFEMErrorCode partitionFiniteElements(const std::string name, bool part_from_moab=false, int low_proc=-1, int hi_proc=-1, int verb=VERBOSE)
partition finite elements
virtual MoFEMErrorCode modify_problem_add_finite_element(const std::string &name_problem, const std::string &fe_name)=0
add finite element to problem, this add entities assigned to finite element to a particular problem
virtual MoFEMErrorCode add_problem(const std::string &name, enum MoFEMTypes bh=MF_EXCL, int verb=DEFAULT_VERBOSITY)=0
Add problem.
virtual MoFEMErrorCode modify_problem_ref_level_add_bit(const std::string &name_problem, const BitRefLevel &bit)=0
add ref level to problem
const Tensor1_Expr< const dTensor0< T, Dim, i >, typename promote< T, double >::V, Dim, i > d(const Tensor0< T * > &a, const Index< i, Dim > index, const Tensor1< int, Dim > &d_ijk, const Tensor1< double, Dim > &d_xyz)
Definition: dTensor0.hpp:27
UBlasMatrix< double > MatrixDouble
Definition: Types.hpp:88
std::bitset< BITREFLEVEL_SIZE > BitRefLevel
Bit structure attached to each entity identifying to what mesh entity is attached.
Definition: Types.hpp:51
UBlasVector< double > VectorDouble
Definition: Types.hpp:79
auto createKSP
CoreTmp< 0 > Core
Definition: Core.hpp:1096
DeprecatedCoreInterface Interface
Definition: Interface.hpp:1965
const double D
diffusivity
double A
static char help[]
static constexpr int approx_order
Managing BitRefLevels.
virtual MoFEMErrorCode build_adjacencies(const Range &ents, int verb=DEFAULT_VERBOSITY)=0
build adjacencies
virtual MoFEMErrorCode add_field(const std::string &name, const FieldSpace space, const FieldApproximationBase base, const FieldCoefficientsNumber nb_of_coefficients, const TagType tag_type=MB_TAG_SPARSE, const enum MoFEMTypes bh=MF_EXCL, int verb=DEFAULT_VERBOSITY)=0
Add field.
Core (interface) class.
Definition: Core.hpp:92
static MoFEMErrorCode Initialize(int *argc, char ***args, const char file[], const char help[])
Initializes the MoFEM database PETSc, MOAB and MPI.
Definition: Core.cpp:85
static MoFEMErrorCode Finalize()
Checks for options to be called at the conclusion of the program.
Definition: Core.cpp:125
Deprecated interface functions.
Matrix manager is used to build and partition problems.
Calculate inverse of jacobian for face element.
Get field gradients at integration pts for scalar filed rank 0, i.e. vector field.
Get value at integration points for scalar field.
Operator for fat prism element updating integration weights in the volume.
Transform local reference derivatives of shape functions to global derivatives.
MoFEMErrorCode seedPrismsEntities(Range &prisms, const BitRefLevel &bit, int verb=-1)
Seed prism entities by bit level.
Problem manager is used to build and partition problems.
MoFEMErrorCode getInterface(IFACE *&iface) const
Get interface refernce to pointer of interface.
Vector manager is used to create vectors \mofem_vectors.
Definition: VecManager.hpp:33

Variable Documentation

◆ approx_order

constexpr int approx_order = 6
staticconstexpr

◆ help

char help[] = "...\n\n"
static