v0.13.2
Loading...
Searching...
No Matches
Classes | Typedefs | Functions | Variables
quad_polynomial_approximation.cpp File Reference
#include <MoFEM.hpp>

Go to the source code of this file.

Classes

struct  ApproxFunction
 
struct  QuadOpCheck
 
struct  QuadOpRhs
 
struct  QuadOpLhs
 

Typedefs

using Ele = FaceElementForcesAndSourcesCore
 
using OpEle = FaceElementForcesAndSourcesCore::UserDataOperator
 
using EntData = EntitiesFieldData::EntData
 

Functions

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

Variables

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

Typedef Documentation

◆ Ele

Examples
reaction_diffusion.cpp.

Definition at line 13 of file quad_polynomial_approximation.cpp.

◆ EntData

Definition at line 15 of file quad_polynomial_approximation.cpp.

◆ OpEle

using OpEle = FaceElementForcesAndSourcesCore::UserDataOperator

Definition at line 14 of file quad_polynomial_approximation.cpp.

Function Documentation

◆ main()

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

Definition at line 83 of file quad_polynomial_approximation.cpp.

83 {
84
85 MoFEM::Core::Initialize(&argc, &argv, (char *)0, help);
86
87 try {
88
89 // Declare elements
90 enum bases {
91 AINSWORTH,
92 AINSWORTH_LOBATTO,
93 DEMKOWICZ,
94 BERNSTEIN,
95 LASBASETOP
96 };
97 const char *list_bases[] = {"ainsworth", "ainsworth_labatto", "demkowicz",
98 "bernstein"};
99 PetscBool flg;
100 PetscInt choice_base_value = AINSWORTH;
101 CHKERR PetscOptionsGetEList(PETSC_NULL, NULL, "-base", list_bases,
102 LASBASETOP, &choice_base_value, &flg);
103
104 if (flg != PETSC_TRUE)
105 SETERRQ(PETSC_COMM_SELF, MOFEM_IMPOSSIBLE_CASE, "base not set");
107 if (choice_base_value == AINSWORTH)
109 if (choice_base_value == AINSWORTH_LOBATTO)
111 else if (choice_base_value == DEMKOWICZ)
113 else if (choice_base_value == BERNSTEIN)
115
116 enum spaces { H1SPACE, L2SPACE, LASBASETSPACE };
117 const char *list_spaces[] = {"h1", "l2"};
118 PetscInt choice_space_value = H1SPACE;
119 CHKERR PetscOptionsGetEList(PETSC_NULL, NULL, "-space", list_spaces,
120 LASBASETSPACE, &choice_space_value, &flg);
121 if (flg != PETSC_TRUE)
122 SETERRQ(PETSC_COMM_SELF, MOFEM_IMPOSSIBLE_CASE, "space not set");
123 FieldSpace space = H1;
124 if (choice_space_value == H1SPACE)
125 space = H1;
126 else if (choice_space_value == L2SPACE)
127 space = L2;
128
129 moab::Core mb_instance;
130 moab::Interface &moab = mb_instance;
131
132 std::array<double, 12> one_quad_coords = {0, 0, 0,
133
134 2, 0, 0,
135
136 1, 1, 0,
137
138 0, 1, 0};
139
140 std::array<EntityHandle, 4> one_quad_nodes;
141 for (int n = 0; n != 4; ++n)
142 CHKERR moab.create_vertex(&one_quad_coords[3 * n], one_quad_nodes[n]);
143 EntityHandle one_quad;
144 CHKERR moab.create_element(MBQUAD, one_quad_nodes.data(), 4, one_quad);
145 Range one_quad_range;
146 one_quad_range.insert(one_quad);
147 Range one_quad_adj_ents;
148 CHKERR moab.get_adjacencies(one_quad_range, 1, true, one_quad_adj_ents,
149 moab::Interface::UNION);
150
151 MoFEM::Core core(moab);
152 MoFEM::Interface &m_field = core;
153
154 BitRefLevel bit_level0 = BitRefLevel().set(0);
155 CHKERR m_field.getInterface<BitRefManager>()->setBitRefLevelByDim(
156 0, 2, bit_level0);
157
158 // Fields
159 CHKERR m_field.add_field("FIELD1", space, base, 1);
160 CHKERR m_field.add_ents_to_field_by_type(0, MBQUAD, "FIELD1");
161
162 CHKERR m_field.set_field_order(0, MBVERTEX, "FIELD1", 1);
163 CHKERR m_field.set_field_order(0, MBEDGE, "FIELD1", approx_order + 1);
164 CHKERR m_field.set_field_order(0, MBQUAD, "FIELD1", approx_order + 1);
165 CHKERR m_field.build_fields();
166
167 // FE
168 CHKERR m_field.add_finite_element("QUAD");
169
170 // Define rows/cols and element data
171 CHKERR m_field.modify_finite_element_add_field_row("QUAD", "FIELD1");
172 CHKERR m_field.modify_finite_element_add_field_col("QUAD", "FIELD1");
173 CHKERR m_field.modify_finite_element_add_field_data("QUAD", "FIELD1");
174 CHKERR m_field.add_ents_to_finite_element_by_type(0, MBQUAD, "QUAD");
175
176 // build finite elemnts
178 // //build adjacencies
179 CHKERR m_field.build_adjacencies(bit_level0);
180
181 // Problem
182 CHKERR m_field.add_problem("TEST_PROBLEM");
183
184 // set finite elements for problem
185 CHKERR m_field.modify_problem_add_finite_element("TEST_PROBLEM", "QUAD");
186 // set refinement level for problem
187 CHKERR m_field.modify_problem_ref_level_add_bit("TEST_PROBLEM", bit_level0);
188
189 // build problem
190 ProblemsManager *prb_mng_ptr;
191 CHKERR m_field.getInterface(prb_mng_ptr);
192 CHKERR prb_mng_ptr->buildProblem("TEST_PROBLEM", true);
193 // partition
194 CHKERR prb_mng_ptr->partitionSimpleProblem("TEST_PROBLEM");
195 CHKERR prb_mng_ptr->partitionFiniteElements("TEST_PROBLEM");
196 // what are ghost nodes, see Petsc Manual
197 CHKERR prb_mng_ptr->partitionGhostDofs("TEST_PROBLEM");
198
199 // Create matrices
202 ->createMPIAIJWithArrays<PetscGlobalIdx_mi_tag>("TEST_PROBLEM", A);
204 CHKERR m_field.getInterface<VecManager>()->vecCreateGhost("TEST_PROBLEM",
205 ROW, F);
207 CHKERR m_field.getInterface<VecManager>()->vecCreateGhost("TEST_PROBLEM",
208 COL, D);
209
210 auto rule = [&](int, int, int p) { return 2 * (p + 1); };
211
212 auto assemble_matrices_and_vectors = [&]() {
214 Ele fe(m_field);
215 fe.getRuleHook = rule;
216 auto jac_ptr = boost::make_shared<MatrixDouble>();
217 auto inv_jac_ptr = boost::make_shared<MatrixDouble>();
218 auto det_ptr = boost::make_shared<VectorDouble>();
219 fe.getOpPtrVector().push_back(new OpCalculateHOJac<2>(jac_ptr));
220 fe.getOpPtrVector().push_back(
221 new OpInvertMatrix<2>(jac_ptr, det_ptr, inv_jac_ptr));
222 fe.getOpPtrVector().push_back(
223 new OpSetHOInvJacToScalarBases<2>(H1, inv_jac_ptr));
224 fe.getOpPtrVector().push_back(
225 new OpSetHOInvJacToScalarBases<2>(L2, inv_jac_ptr));
226 fe.getOpPtrVector().push_back(new OpSetHOWeightsOnFace());
227 fe.getOpPtrVector().push_back(new QuadOpRhs(F));
228 fe.getOpPtrVector().push_back(new QuadOpLhs(A));
229 CHKERR VecZeroEntries(F);
230 CHKERR MatZeroEntries(A);
231 CHKERR m_field.loop_finite_elements("TEST_PROBLEM", "QUAD", fe);
232 CHKERR VecAssemblyBegin(F);
233 CHKERR VecAssemblyEnd(F);
234 CHKERR MatAssemblyBegin(A, MAT_FINAL_ASSEMBLY);
235 CHKERR MatAssemblyEnd(A, MAT_FINAL_ASSEMBLY);
237 };
238
239 auto solve_problem = [&] {
241 auto solver = createKSP(PETSC_COMM_WORLD);
242 CHKERR KSPSetOperators(solver, A, A);
243 CHKERR KSPSetFromOptions(solver);
244 CHKERR KSPSetUp(solver);
245 CHKERR KSPSolve(solver, F, D);
246 CHKERR VecGhostUpdateBegin(D, INSERT_VALUES, SCATTER_FORWARD);
247 CHKERR VecGhostUpdateEnd(D, INSERT_VALUES, SCATTER_FORWARD);
248 CHKERR m_field.getInterface<VecManager>()->setLocalGhostVector(
249 "TEST_PROBLEM", COL, D, INSERT_VALUES, SCATTER_REVERSE);
251 };
252
253 auto check_solution = [&] {
255 Ele fe(m_field);
256 fe.getRuleHook = rule;
257 auto field_vals_ptr = boost::make_shared<VectorDouble>();
258 auto diff_field_vals_ptr = boost::make_shared<MatrixDouble>();
259 auto jac_ptr = boost::make_shared<MatrixDouble>();
260 auto inv_jac_ptr = boost::make_shared<MatrixDouble>();
261 auto det_ptr = boost::make_shared<VectorDouble>();
262
263 fe.getOpPtrVector().push_back(
264 new OpCalculateScalarFieldValues("FIELD1", field_vals_ptr));
265 fe.getOpPtrVector().push_back(new OpCalculateHOJac<2>(jac_ptr));
266 fe.getOpPtrVector().push_back(
267 new OpInvertMatrix<2>(jac_ptr, det_ptr, inv_jac_ptr));
268 fe.getOpPtrVector().push_back(
269 new OpSetHOInvJacToScalarBases<2>(H1, inv_jac_ptr));
270 fe.getOpPtrVector().push_back(
271 new OpSetHOInvJacToScalarBases<2>(L2, inv_jac_ptr));
272 fe.getOpPtrVector().push_back(new OpSetHOWeightsOnFace());
273 fe.getOpPtrVector().push_back(new OpCalculateScalarFieldGradient<2>(
274 "FIELD1", diff_field_vals_ptr, space == L2 ? MBQUAD : MBVERTEX));
275 fe.getOpPtrVector().push_back(
276 new QuadOpCheck(field_vals_ptr, diff_field_vals_ptr));
277 CHKERR m_field.loop_finite_elements("TEST_PROBLEM", "QUAD", fe);
279 };
280
281 CHKERR assemble_matrices_and_vectors();
282 CHKERR solve_problem();
283 CHKERR check_solution();
284 }
286
288 return 0;
289}
static Index< 'p', 3 > p
@ COL
Definition: definitions.h:123
@ ROW
Definition: definitions.h:123
#define CATCH_ERRORS
Catch errors.
Definition: definitions.h:372
FieldApproximationBase
approximation base
Definition: definitions.h:58
@ AINSWORTH_LEGENDRE_BASE
Ainsworth Cole (Legendre) approx. base .
Definition: definitions.h:60
@ AINSWORTH_LOBATTO_BASE
Definition: definitions.h:62
@ DEMKOWICZ_JACOBI_BASE
Definition: definitions.h:66
@ AINSWORTH_BERNSTEIN_BEZIER_BASE
Definition: definitions.h:64
FieldSpace
approximation spaces
Definition: definitions.h:82
@ L2
field with C-1 continuity
Definition: definitions.h:88
@ H1
continuous field
Definition: definitions.h:85
#define MoFEMFunctionBegin
First executable line of each MoFEM function, used for error handling. Final line of MoFEM functions ...
Definition: definitions.h:346
@ MOFEM_IMPOSSIBLE_CASE
Definition: definitions.h:35
#define MoFEMFunctionReturn(a)
Last executable line of each PETSc function used for error handling. Replaces return()
Definition: definitions.h:416
#define CHKERR
Inline error check.
Definition: definitions.h:535
FTensor::Index< 'n', SPACE_DIM > n
@ F
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 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 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_row(const std::string &fe_name, const std::string name_row)=0
set field row 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 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
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
double D
std::bitset< BITREFLEVEL_SIZE > BitRefLevel
Bit structure attached to each entity identifying to what mesh entity is attached.
Definition: Types.hpp:40
auto createKSP(MPI_Comm comm)
PetscErrorCode PetscOptionsGetEList(PetscOptions *, const char pre[], const char name[], const char *const *list, PetscInt next, PetscInt *value, PetscBool *set)
constexpr AssemblyType 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:82
static MoFEMErrorCode Initialize(int *argc, char ***args, const char file[], const char help[])
Initializes the MoFEM database PETSc, MOAB and MPI.
Definition: Core.cpp:72
static MoFEMErrorCode Finalize()
Checks for options to be called at the conclusion of the program.
Definition: Core.cpp:112
Deprecated interface functions.
Matrix manager is used to build and partition problems.
Get field gradients at integration pts for scalar filed rank 0, i.e. vector field.
Get value at integration points for scalar field.
Set inverse jacobian to base functions.
Modify integration weights on face to take in account higher-order geometry.
Problem manager is used to build and partition problems.
intrusive_ptr for managing petsc objects
MoFEMErrorCode getInterface(IFACE *&iface) const
Get interface refernce to pointer of interface.
Vector manager is used to create vectors \mofem_vectors.
Definition: VecManager.hpp:23

Variable Documentation

◆ approx_order

constexpr int approx_order = 6
staticconstexpr

◆ help

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

Definition at line 17 of file quad_polynomial_approximation.cpp.