MoFEM Namespace Reference

implementation of Data Operators for Forces and Sources More...

Namespaces
	Exceptions
	Exceptions and handling errors data structures.
	Types
	Types.

Classes
struct	AccelerationCubitBcData
	Definition of the acceleration bc data structure. More...
struct	BaseFEEntity
	Keeps basic information about entity on the finite element. More...
struct	BaseFunction
	Base class if inherited used to calculate base functions. More...
struct	BaseFunctionCtx
	Base class used to exchange data between element data structures and class calculating base functions. More...
struct	BasicEntity
	this struct keeps basic methods for moab entity More...
struct	BasicEntityData
	Basic data. like access to moab interface and basic tag handlers. More...
struct	BasicMethod
	Data structure to exchange data between mofem and User Loop Methods.It allows to exchange data between MoFEM and user functions. It stores information about multi-indices. More...
struct	BasicMethodPtr
struct	BitFEId_mi_tag
struct	BitFieldId_mi_tag
struct	BitFieldId_space_mi_tag
struct	BitLevelCoupler
	Interface set parent for vertices, edges, triangles and tetrahedrons.FIXME: Not tested, slow, bugs. More...
struct	BitProblemId_mi_tag
struct	BitRefManager
	Managing BitRefLevels. More...
struct	Block_BodyForces
	Body force data structure. More...
struct	BlockData
struct	BlockSetAttributes
	Arbitrary block attributes data structure. More...
struct	BuildFiniteElements
struct	CfgCubitBcData
	Definition of the cfd_bc data structure. More...
struct	ComposedProblemsData
struct	Composite_Cubit_msId_And_MeshSetType_mi_tag
struct	Composite_Ent_And_EntDofIdx_mi_tag
struct	Composite_Ent_and_ShortId_mi_tag
struct	Composite_Ent_Order_And_CoeffIdx_mi_tag
struct	Composite_EntType_and_ParentEntType_mi_tag
struct	Composite_EntType_and_Space_mi_tag
struct	Composite_mi_tag
struct	Composite_Name_And_Ent_And_EntDofIdx_mi_tag
struct	Composite_Name_And_Ent_mi_tag
struct	Composite_Name_And_Part_mi_tag
struct	Composite_Name_And_Type_mi_tag
struct	Composite_Name_Ent_And_Part_mi_tag
struct	Composite_Name_Ent_Order_And_CoeffIdx_mi_tag
struct	Composite_Name_Type_And_Side_Number_mi_tag
struct	Composite_ParentEnt_And_BitsOfRefinedEdges_mi_tag
struct	Composite_ParentEnt_And_EntType_mi_tag
struct	Composite_Part_And_Order_mi_tag
struct	Composite_SeriesID_And_Step_mi_tag
struct	Composite_SeriesName_And_Step_mi_tag
struct	Composite_SeriesName_And_Time_mi_tag
struct	Composite_Unique_mi_tag
struct	CoordSys
	Structure for Coordinate system of two-point tensorScientific computing applications deal in physical quantities expressed as tensors: scalars such as temperature, vectors such as velocity, and second-order tensors such as stress. In practice, these are formally tensor fields: a tensor field assigns a tensor to each point in a mathematical space (typically a Euclidean space or manifold). More...
struct	CoordSysName_mi_tag
struct	CoordSystemsManager
struct	Core
	Core (interface) class. More...
struct	CoreInterface
	InterfaceThis interface is used by user to: More...
struct	CreateRowComressedADJMatrix
	Create compressed matrix. More...
struct	CubitMeshSets
	this struct keeps basic methods for moab meshset about material and boundary conditions More...
struct	CubitMeshSets_change_add_bit_to_cubit_bc_type
	change meshset type More...
struct	CubitMeshSets_change_attributes
struct	CubitMeshSets_change_attributes_data_structure
struct	CubitMeshSets_change_bc_data_structure
struct	CubitMeshSets_change_name
	change meshset name More...
struct	CubitMeshSets_mask_meshset_mi_tag
struct	CubitMeshSets_mi_tag
	MultiIndex Tag for field id. More...
struct	CubitMeshSets_name
struct	CutMeshInterface
	Interface to cut meshes. More...
struct	DataForcesAndSourcesCore
	data structure for finite element entityIt keeps that about indices of degrees of freedom, dofs data, base functions functions, entity side number, type of entities, approximation order, etc. More...
struct	DataOperator
	base operator to do operations at Gauss Pt. level More...
struct	DefaultElementAdjacency
	default adjacency map More...
struct	DeprecatedCoreInterface
	Deprecated interface functions. More...
struct	DerivedDataForcesAndSourcesCore
	this class derive data form other data structure More...
struct	DisplacementCubitBcData
	Definition of the displacement bc data structure. More...
struct	DMCtx
	PETSc Discrete Manager data structure. More...
struct	Dof_shared_ptr_change
struct	DOF_Unique_mi_tag
struct	DofEntity
	keeps information about DOF on the entity More...
struct	DofEntity_active_change
struct	DofMethod
	Data structure to exchange data between mofem and User Loop Methods on entities.It allows to exchange data between MoFEM and user functions. It stores information about multi-indices. More...
struct	EdgeElementForcesAndSourcesCore
	Edge finite elementUser is implementing own operator at Gauss points level, by own object derived from EdgeElementForcesAndSourcesCoreL::UserDataOperator. Arbitrary number of operator added pushing objects to rowOpPtrVector and rowColOpPtrVector. More...
struct	EdgePolynomialBase
	Calculate base functions on tetrahedral. More...
struct	Ent_Ent_mi_tag
struct	Ent_FiniteElement_mi_tag
struct	Ent_mi_tag
struct	Ent_Owner_mi_tag
struct	Ent_ParallelStatus
struct	EntDofIdx_mi_tag
struct	EntFiniteElement
	Finite element data for entity. More...
struct	Entity_update_pcomm_data
struct	EntityMethod
	Data structure to exchange data between mofem and User Loop Methods on entities.It allows to exchange data between MoFEM and user functions. It stores information about multi-indices. More...
struct	EntPolynomialBaseCtx
	Class used to pass element data to calculate base functions on tet,triangle,edge. More...
struct	EntType_mi_tag
struct	EqBit
struct	FaceElementForcesAndSourcesCore
	Face finite elementUser is implementing own operator at Gauss point level, by own object derived from FaceElementForcesAndSourcesCoreL::UserDataOperator. Arbitrary number of operator added pushing objects to OpPtrVector. More...
struct	FatPrismElementForcesAndSourcesCore
	FatPrism finite elementUser is implementing own operator at Gauss points level, by own object derived from FatPrismElementForcesAndSourcesCoreL::UserDataOperator. Arbitrary number of operator added pushing objects to rowOpPtrVector and rowColOpPtrVector. More...
struct	FatPrismPolynomialBase
	Calculate base functions on tetrahedralFIXME: Need moab and mofem finite element structure to work (that not perfect) More...
struct	FatPrismPolynomialBaseCtx
	Class used to pass element data to calculate base functions on fat prism. More...
struct	FE_Unique_mi_tag
struct	FEDofEntity
	keeps information about indexed dofs for the finite element More...
struct	FEEnt_mi_tag
struct	FEMethod
	structure for User Loop Methods on finite elementsIt can be used to calculate stiffness matrices, residuals, load vectors etc. It is low level class however in some class users looking for speed and efficiency, can use it directly. More...
struct	FENumeredDofEntity
	keeps information about indexed dofs for the finite element More...
struct	Field
	Provide data structure for (tensor) field approximation.The Field is intended to provide support for fields, with a strong bias towards supporting first and best the capabilities required for scientific computing applications. Since we work with discrete spaces, data structure has to carry information about type of approximation space, its regularity. More...
struct	FieldBlas
	Basic algebra on fields. More...
struct	FieldChangeCoordinateSystem
	Set field coordinate system. More...
struct	FieldEntity
	Struct keeps handle to entity in the field. More...
struct	FieldEntity_change_order
	structure to change FieldEntity order More...
struct	FieldEntityEntFiniteElementAdjacencyMap
	FieldEntityEntFiniteElementAdjacencyMap of mofem finite element and entities. More...
struct	FieldEntityEntFiniteElementAdjacencyMap_change_ByWhat
struct	FieldEvaluatorInterface
	Field evaluator interface. More...
struct	FieldName_mi_tag
	MultiIndex Tag for field name. More...
struct	FieldSeries
	Structure for recording (time) series. More...
struct	FieldSeriesStep
	Structure for keeping time and step. More...
struct	FiniteElement
	Finite element definition. More...
struct	FiniteElement_change_bit_add
	Add field to data. More...
struct	FiniteElement_change_bit_off
	Unset field from data. More...
struct	FiniteElement_col_change_bit_add
	Add field to column. More...
struct	FiniteElement_col_change_bit_off
	Unset field from column. More...
struct	FiniteElement_Meshset_mi_tag
struct	FiniteElement_name_mi_tag
struct	FiniteElement_row_change_bit_add
	Add field to row. More...
struct	FiniteElement_row_change_bit_off
	Unset field from row. More...
struct	FlatPrismElementForcesAndSourcesCore
	FlatPrism finite elementUser is implementing own operator at Gauss points level, by own object derived from FlatPrismElementForcesAndSourcesCoreL::UserDataOperator. Arbitrary number of operator added pushing objects to rowOpPtrVector and rowColOpPtrVector. More...
struct	FlatPrismPolynomialBase
	Calculate base functions on tetrahedralFIXME: Need moab and mofem finite element structure to work (that not perfect) More...
struct	FlatPrismPolynomialBaseCtx
	Class used to pass element data to calculate base functions on flat prism. More...
struct	ForceCubitBcData
	Definition of the force bc data structure. More...
struct	ForcesAndSourcesCore
	structure to get information form mofem into DataForcesAndSourcesCore More...
struct	GenericAttributeData
	Generic attribute data structure. More...
struct	GenericCubitBcData
	Generic bc data structure. More...
struct	HashBit
struct	HeatFluxCubitBcData
	Definition of the heat flux bc data structure. More...
struct	HelmholtzElement
	struture grouping operators and data used for helmholtz problemsIn order to assemble matrices and right hand side vectors, the loops over elements, enetities over that elememnts and finally loop over intergration points are executed. More...
struct	Idx_mi_tag
struct	IdxDataType
struct	IdxDataTypePtr
struct	IntegratedJacobiPolynomial
struct	IntegratedJacobiPolynomialCtx
struct	Interface
struct	interface_DofEntity
	Interface to DofEntity. More...
struct	interface_EntFiniteElement
	interface to EntFiniteElement More...
struct	interface_Field
	Pointer interface for MoFEM::Field. More...
struct	interface_FieldEntity
	Interface to FieldEntityinterface to FieldEntity. More...
struct	interface_FieldSeries
struct	interface_FiniteElement
	Inetface for FE. More...
struct	interface_NumeredDofEntity
	interface to NumeredDofEntity More...
struct	interface_NumeredEntFiniteElement
	interface for NumeredEntFiniteElement More...
struct	interface_RefElement
	intrface to RefElement More...
struct	interface_RefEntity
	interface to RefEntity More...
struct	ISManager
	Section manager is used to create indexes and sectionsFIXME: ISManager is not properly testsed by atom tests. More...
struct	JacobiPolynomial
	Calculating Legendre base functions. More...
struct	JacobiPolynomialCtx
	Class used to give arguments to Legendre base functions. More...
struct	KernelLobattoPolynomial
	Calculating Lobatto base functions. More...
struct	KernelLobattoPolynomialCtx
	Class used to give arguments to Kernel Lobatto base functions. More...
struct	KeyFromKey
struct	KspCtx
	Interface for linear (KSP) solver. More...
struct	KspMethod
	data structure for ksp (linear solver) contextStruture stores context data which are set in functions run by PETSc SNES functions. More...
struct	LegendrePolynomial
	Calculating Legendre base functions. More...
struct	LegendrePolynomialCtx
	Class used to give arguments to Legendre base functions. More...
struct	LengthMapData
struct	LobattoPolynomial
	Calculating Lobatto base functions. More...
struct	LobattoPolynomialCtx
	Class used to give arguments to Lobatto base functions. More...
struct	LtBit
struct	Mat_Elastic
	Elastic material data structure. More...
struct	Mat_Elastic_EberleinHolzapfel1
	Mat_Elastic with Fibres. More...
struct	Mat_Elastic_TransIso
	Transverse Isotropic material data structure. More...
struct	Mat_Interf
	Linear interface data structure. More...
struct	Mat_Moisture
	moisture transport material data structure More...
struct	Mat_Thermal
	Thermal material data structure. More...
struct	MatrixManager
	Matrix manager is used to build and partition problems. More...
struct	MedInterface
	Interface for load MED files. More...
struct	MeshRefinement
	Mesh refinement interface. More...
struct	Meshset_mi_tag
struct	MeshsetsManager
	Interface for managing meshsets containing materials and boundary conditions. More...
struct	MOFEMuuid
	MoFEM interface unique ID. More...
struct	NodeMergerInterface
	Merge node by collapsing edge between them. More...
struct	NormElement
	finite element to appeximate analytical solution on surface More...
struct	NumeredDofEntity
	keeps information about indexed dofs for the problemFIXME: Is too many iterator, this has to be manage more efficiently, some iterators could be moved to multi_indices views. More...
struct	NumeredDofEntity_local_idx_change
struct	NumeredDofEntity_mofem_index_change
struct	NumeredDofEntity_part_and_all_indices_change
struct	NumeredDofEntity_part_and_glob_idx_change
struct	NumeredDofEntity_part_and_indices_change
struct	NumeredDofEntity_part_and_mofem_glob_idx_change
struct	NumeredEntFiniteElement
	Partitioned (Indexed) Finite Element in Problem. More...
struct	NumeredEntFiniteElement_change_part
	Change finite element part. More...
struct	OpCalculateHcurlVectorCurl
	Calculate curl of vector field. More...
struct	OpCalculateHdivVectorDivergence
	Calculate divergence of vector field. More...
struct	OpCalculateHdivVectorField
	Get vector field for H-div approximation. More...
struct	OpCalculateHdivVectorField_General
	Get vector field for H-div approximation. More...
struct	OpCalculateHdivVectorField_General< Tensor_Dim, double, ublas::row_major, DoubleAllocator >
	Get vector field for H-div approximation. More...
struct	OpCalculateHTensorTensorField
	Calculate tenor field using vectorial base, i.e. Hdiv/Hcurl. More...
struct	OpCalculateHVecTensorDivergence
	Calculate divergence of tonsorial field using vectorial base. More...
struct	OpCalculateHVecTensorField
	Calculate tenor field using vectorial base, i.e. Hdiv/Hcurl. More...
struct	OpCalculateInvJacForFace
	Calculate inverse of jacobian for face element. More...
struct	OpCalculateInvJacForFatPrism
	Calculate inverse of jacobian for face element. More...
struct	OpCalculateInvJacForFlatPrism
	Calculate inverse of jacobian for face element. More...
struct	OpCalculateScalarFieldGradient
	Get field gradients at integration pts for scalar filed rank 0, i.e. vector field. More...
struct	OpCalculateScalarFieldGradient_General
	Evaluate field gradient values for scalar field, i.e. gradient is tensor rank 1 (vector) More...
struct	OpCalculateScalarFieldGradient_General< Tensor_Dim, double, ublas::row_major, DoubleAllocator >
	Evaluate field gradient values for scalar field, i.e. gradient is tensor rank 1 (vector), specialization mofem_forces_and_sources_user_data_operators. More...
struct	OpCalculateScalarFieldValues
	Get value at integration points for scalar field. More...
struct	OpCalculateScalarFieldValues_General
	Calculate field values for tenor field rank 0, i.e. scalar field. More...
struct	OpCalculateTensor2FieldValues
	Get values at integration pts for tensor filed rank 2, i.e. matrix field. More...
struct	OpCalculateTensor2FieldValues_General
	Calculate field values for tenor field rank 2. More...
struct	OpCalculateTensor2FieldValues_General< Tensor_Dim0, Tensor_Dim1, double, ublas::row_major, DoubleAllocator >
struct	OpCalculateTensor2FieldValuesDot
	Get time direvarive values at integration pts for tensor filed rank 2, i.e. matrix field. More...
struct	OpCalculateTensor2SymmetricFieldValues
struct	OpCalculateTensor2SymmetricFieldValuesDot
struct	OpCalculateVectorFieldGradient
	Get field gradients at integration pts for scalar filed rank 0, i.e. vector field. More...
struct	OpCalculateVectorFieldGradient_General
	Evaluate field gradient values for vector field, i.e. gradient is tensor rank 2. More...
struct	OpCalculateVectorFieldGradient_General< Tensor_Dim0, Tensor_Dim1, double, ublas::row_major, DoubleAllocator >
struct	OpCalculateVectorFieldGradientDot
	Get field gradients time derivative at integration pts for scalar filed rank 0, i.e. vector field mofem_forces_and_sources_user_data_operators. More...
struct	OpCalculateVectorFieldValues
	Get values at integration pts for tensor filed rank 1, i.e. vector field. More...
struct	OpCalculateVectorFieldValues_General
	Calculate field values for tenor field rank 1, i.e. vector field. More...
struct	OpCalculateVectorFieldValues_General< Tensor_Dim, double, ublas::row_major, DoubleAllocator >
	Calculate field values (template specialization) for tensor field rank 1, i.e. vector field mofem_forces_and_sources_user_data_operators. More...
struct	OpCalculateVectorFieldValuesDot
	Get time direvatives of values at integration pts for tensor filed rank 1, i.e. vector field mofem_forces_and_sources_user_data_operators. More...
struct	OpGetCoordsAndNormalsOnFace
	Calculate normals at Gauss points of triangle element. More...
struct	OpGetCoordsAndNormalsOnPrism
	calculate normals at Gauss points of triangle element More...
struct	OpGetDataAndGradient
	Get field values and gradients at Gauss points. More...
struct	OpGetHoTangentOnEdge
	Calculate tangent vector on edge form HO geometry approximation. More...
struct	OpSetContravariantPiolaTransform
	apply contravariant (Piola) transfer to Hdiv space More...
struct	OpSetContravariantPiolaTransformOnTriangle
	transform Hdiv base fluxes from reference element to physical triangle More...
struct	OpSetCovariantPiolaTransform
	apply covariant transfer to Hcurl space More...
struct	OpSetCovariantPiolaTransformOnEdge
	transform Hcurl base fluxes from reference element to physical edge More...
struct	OpSetCovariantPiolaTransformOnTriangle
	transform Hcurl base fluxes from reference element to physical triangle More...
struct	OpSetHoContravariantPiolaTransform
	Apply contravariant (Piola) transfer to Hdiv space for HO geometr. More...
struct	OpSetHoCovariantPiolaTransform
	Apply covariant (Piola) transfer to Hcurl space for HO geometry. More...
struct	OpSetHoInvJacH1
	transform local reference derivatives of shape function to global derivatives if higher order geometry is given More...
struct	OpSetHoInvJacHdivAndHcurl
	transform local reference derivatives of shape function to global derivatives if higher order geometry is given More...
struct	OpSetInvJacH1
	Transform local reference derivatives of shape function to global derivatives. More...
struct	OpSetInvJacH1ForFace
	Transform local reference derivatives of shape functions to global derivatives. More...
struct	OpSetInvJacH1ForFatPrism
	Transform local reference derivatives of shape functions to global derivatives. More...
struct	OpSetInvJacH1ForFlatPrism
	Transform local reference derivatives of shape functions to global derivatives. More...
struct	OpSetInvJacHcurlFace
	brief Transform local reference derivatives of shape function to global derivatives for face More...
struct	OpSetInvJacHdivAndHcurl
	brief Transform local reference derivatives of shape function to global derivatives More...
struct	Order_mi_tag
	MultiIndex Tag for field order. More...
struct	PairNameFEMethodPtr
struct	ParentEntType_mi_tag
struct	Part_mi_tag
struct	PetscGlobalIdx_mi_tag
struct	PetscLocalIdx_mi_tag
struct	PressureCubitBcData
	Definition of the pressure bc data structure. More...
struct	PrismInterface
	Make interface on given faces and create flat prism in that space. More...
struct	PrismsFromSurfaceInterface
	merge node from two bit levels More...
struct	Problem
	keeps basic data about problemThis is low level structure with information about problem, what elements compose problem and what DOFs are on rows and columns. More...
struct	Problem_mi_tag
struct	ProblemChangeRefLevelBitAdd
	add ref level to problem More...
struct	ProblemChangeRefLevelBitDofMaskAdd
	set prof dof bit ref mask More...
struct	ProblemChangeRefLevelBitDofMaskSet
	set prof dof bit ref mask More...
struct	ProblemChangeRefLevelBitSet
	set ref level to problem More...
struct	ProblemClearComposedProblemData
	Clear composed problem data structure. More...
struct	ProblemClearNumeredFiniteElementsChange
	clear problem finite elements More...
struct	ProblemClearSubProblemData
	Clear sub-problem data structure. More...
struct	ProblemFiniteElementChangeBitAdd
	add finite element to problem More...
struct	ProblemFiniteElementChangeBitUnSet
	remove finite element from problem More...
struct	ProblemsManager
	Problem manager is used to build and partition problems. More...
struct	ProblemZeroNbColsChange
	zero nb. of DOFs in col More...
struct	ProblemZeroNbRowsChange
	zero nb. of DOFs in row More...
struct	Proc_mi_tag
struct	Projection10NodeCoordsOnField
	Projection of edge entities with one mid-node on hierarchical basis. More...
struct	ProjectionFieldOn10NodeTet
struct	RefElement
	keeps data about abstract refined finite element More...
struct	RefElement_EDGE
	keeps data about abstract EDGE finite element More...
struct	RefElement_MESHSET
	keeps data about abstract MESHSET finite element More...
struct	RefElement_PRISM
	keeps data about abstract PRISM finite element More...
struct	RefElement_TET
	keeps data about abstract TET finite element More...
struct	RefElement_TRI
	keeps data about abstract TRI finite element More...
struct	RefElement_VERTEX
	keeps data about abstract VERTEX finite element More...
struct	RefEntity
	Struct keeps handle to refined handle. More...
struct	RefEntity_change_left_shift
	ref mofem entity, left shift More...
struct	RefEntity_change_parent
	change parentUse this function with care. Some other multi-indices can deponent on this. More...
struct	RefEntity_change_right_shift
	ref mofem entity, right shift More...
struct	SaveData
struct	SeriesID_mi_tag
struct	SeriesName_mi_tag
struct	SeriesRecorder
struct	SetBitRefLevelTool
	tool class with methods used more than twp times More...
struct	SetOtherGlobalGhostVector
struct	SetOtherLocalGhostVector
struct	SideNumber_mi_tag
struct	Simple
	Simple interface for fast problem set-up. More...
struct	SmartPetscObj
	intrusive_ptr for managing petsc objects More...
struct	SnesCtx
	Interface for nonlinear (SNES) solver. More...
struct	SnesMethod
	data structure for snes (nonlinear solver) contextStructure stores context data which are set in functions run by PETSc SNES functions. More...
struct	Space_mi_tag
struct	TemperatureCubitBcData
	Definition of the temperature bc data structure. More...
struct	TetGenInterface
	TetGen interface. More...
struct	TetPolynomialBase
	Calculate base functions on tetrahedral. More...
struct	Tools
	Auxiliary tools. More...
struct	TriPolynomialBase
	Calculate base functions on triangle. More...
struct	TsCtx
	Interface for Time Stepping (TS) solver. More...
struct	TSMethod
	data structure for TS (time stepping) contextStructure stores context data which are set in functions run by PETSc Time Stepping functions. More...
struct	Unique_Ent_mi_tag
struct	Unique_FiniteElement_mi_tag
struct	Unique_mi_tag
struct	UnknownInterface
	base class for all interface classes More...
struct	UpdateMeshsets
struct	VecManager
	Vector manager is used to create vectors \mofem_vectors. More...
struct	VelocityCubitBcData
	Definition of the velocity bc data structure. More...
struct	Version
struct	VertexElementForcesAndSourcesCore
	Vertex finite elementUser is implementing own operator at Gauss points level, by own object derived from VertexElementForcesAndSourcesCoreL::UserDataOperator. Arbitrary number of operator added pushing objects to rowOpPtrVector and rowColOpPtrVector. More...
struct	VolumeElementForcesAndSourcesCore
	Volume finite elementUser is implementing own operator at Gauss point level, by class derived from VolumeElementForcesAndSourcesCore::UserDataOperator. Arbitrary number of operator can be added by pushing objects to OpPtrVector. More...
struct	VolumeElementForcesAndSourcesCoreOnSide
	Volume element used to integrate on skeleton. More...

Typedefs
typedef ublas::unbounded_array< boost::shared_ptr< const FEDofEntity >, std::allocator< boost::shared_ptr< const FEDofEntity > > >	DofsAllocator
typedef ublas::vector< boost::shared_ptr< const FEDofEntity >, DofsAllocator >	VectorDofs
typedef multi_index_container< LengthMapData, indexed_by< ordered_non_unique< member< LengthMapData, double, &LengthMapData::lEngth > >, hashed_unique< member< LengthMapData, EntityHandle, &LengthMapData::eDge > >, ordered_non_unique< member< LengthMapData, double, &LengthMapData::qUality > > > >	LengthMapData_multi_index
typedef CubitMeshSet_multiIndex::index< CubitMeshSets_mi_tag >::type	CubitMeshsetByType
typedef CubitMeshSet_multiIndex::index< CubitMeshSets_mask_meshset_mi_tag >::type	CubitMeshsetByMask
typedef CubitMeshSet_multiIndex::index< CubitMeshSets_name >::type	CubitMeshsetByName
typedef CubitMeshSet_multiIndex::index< CubitMeshSets_mi_tag >::type	CubitMeshsetById
typedef multi_index_container< CubitMeshSets, indexed_by< hashed_unique< tag< Meshset_mi_tag >, member< CubitMeshSets, EntityHandle, &CubitMeshSets::meshset > >, ordered_non_unique< tag< CubitMeshSets_mi_tag >, const_mem_fun< CubitMeshSets, unsigned long int, &CubitMeshSets::getBcTypeULong > >, ordered_non_unique< tag< CubitMeshSets_mask_meshset_mi_tag >, const_mem_fun< CubitMeshSets, unsigned long int, &CubitMeshSets::getMaksedBcTypeULong > >, ordered_non_unique< tag< CubitMeshSets_name >, const_mem_fun< CubitMeshSets, std::string, &CubitMeshSets::getName > >, hashed_unique< tag< Composite_Cubit_msId_And_MeshSetType_mi_tag >, composite_key< CubitMeshSets, const_mem_fun< CubitMeshSets, int, &CubitMeshSets::getMeshsetId >, const_mem_fun< CubitMeshSets, unsigned long int, &CubitMeshSets::getMaksedBcTypeULong > > > > >	CubitMeshSet_multiIndex
	Stores data about meshsets (see CubitMeshSets) storing data about boundary conditions, interfaces, sidesets, nodests, blocksets. More...
typedef multi_index_container< boost::shared_ptr< CoordSys >, indexed_by< ordered_unique< tag< Meshset_mi_tag >, member< CoordSys, EntityHandle,&CoordSys::meshSet > >, ordered_unique< tag< CoordSysName_mi_tag >, const_mem_fun< CoordSys, boost::string_ref,&CoordSys::getNameRef > > > >	CoordSys_multiIndex
typedef DofEntity_multiIndex::index< FieldName_mi_tag >::type	DofEntityByFieldName
	Dof multi-index by field name. More...
typedef DofEntity_multiIndex::index< Ent_mi_tag >::type	DofEntityByEnt
	Dof multi-index by entity. More...
typedef DofEntity_multiIndex::index< Composite_Name_And_Ent_mi_tag >::type	DofEntityByNameAndEnt
	Dof multi-index by field name and entity. More...
typedef DofEntity_multiIndex::index< Composite_Name_And_Type_mi_tag >::type	DofEntityByNameAndType
	Dof multi-index by field name and entity type. More...
typedef multi_index_container< boost::shared_ptr< DofEntity >, indexed_by< ordered_unique< const_mem_fun< DofEntity, const UId &, &DofEntity::getGlobalUniqueId > > > >	DofEntity_multiIndex_uid_view
	multi-index view on DofEntity by uid More...
typedef std::vector< boost::weak_ptr< DofEntity > >	DofEntity_vector_view
	vector view on DofEntity by uid More...
typedef multi_index_container< boost::shared_ptr< DofEntity >, indexed_by< ordered_unique< const_mem_fun< DofEntity, const UId &, &DofEntity::getGlobalUniqueId > >, ordered_non_unique< const_mem_fun< DofEntity, char, &DofEntity::getActive > > > >	DofEntity_multiIndex_active_view
	multi-index view on DofEntity activity More...
typedef FEDofEntity_multiIndex::index< FieldName_mi_tag >::type	FEDofEntityByFieldName
	Finite element DoF multi-index by field name. More...
typedef FEDofEntity_multiIndex::index< Composite_Name_And_Ent_mi_tag >::type	FEDofEntityByNameAndEnt
	Dof entity multi-index by field name and entity. More...
typedef FEDofEntity_multiIndex::index< Composite_Name_And_Type_mi_tag >::type	FEDofEntityByNameAndType
	Dof entity multi-index by field name and entity type. More...
typedef FENumeredDofEntity_multiIndex::index< FieldName_mi_tag >::type	FENumeredDofEntityByFieldName
	Finite element numbered DoF multi-index by field name. More...
typedef FENumeredDofEntity_multiIndex::index< Composite_Name_And_Ent_mi_tag >::type	FENumeredDofEntityByNameAndEnt
	Dof entity multi-index by field name and entity. More...
typedef FENumeredDofEntity_multiIndex::index< Composite_Name_And_Type_mi_tag >::type	FENumeredDofEntityByNameAndType
	Dof entity multi-index by field name and entity type. More...
typedef FENumeredDofEntity_multiIndex::index< Unique_mi_tag >::type	FENumeredDofEntityByUId
	Dof entity multi-index by UId. More...
typedef FENumeredDofEntity_multiIndex::index< Ent_mi_tag >::type	FENumeredDofEntityByEnt
	Numbered DoF multi-index by entity. More...
typedef NumeredDofEntity_multiIndex::index< FieldName_mi_tag >::type	NumeredDofEntityByFieldName
	Numbered DoF multi-index by field name. More...
typedef NumeredDofEntity_multiIndex::index< Unique_mi_tag >::type	NumeredDofEntityByUId
	Numbered DoF multi-index by UId. More...
typedef NumeredDofEntity_multiIndex::index< PetscLocalIdx_mi_tag >::type	NumeredDofEntityByLocalIdx
	Numbered DoF multi-index by local index. More...
typedef NumeredDofEntity_multiIndex::index< Ent_mi_tag >::type	NumeredDofEntityByEnt
	Numbered DoF multi-index by entity. More...
typedef NumeredDofEntity_multiIndex::index< Composite_Name_Ent_And_Part_mi_tag >::type	NumeredDofEntityByNameEntAndPart
	Numbered DoF multi-index by name entity and partition. More...
typedef multi_index_container< boost::shared_ptr< NumeredDofEntity >, indexed_by< ordered_unique< const_mem_fun< NumeredDofEntity::interface_type_DofEntity, const UId &, &NumeredDofEntity::getGlobalUniqueId > > > >	NumeredDofEntity_multiIndex_uid_view_ordered
typedef multi_index_container< boost::shared_ptr< NumeredDofEntity >, indexed_by< hashed_unique< const_mem_fun< NumeredDofEntity, DofIdx, &NumeredDofEntity::getDofIdx > > > >	NumeredDofEntity_multiIndex_idx_view_hashed
typedef multi_index_container< boost::shared_ptr< NumeredDofEntity >, indexed_by< ordered_non_unique< const_mem_fun< NumeredDofEntity, DofIdx, &NumeredDofEntity::getPetscLocalDofIdx > > > >	NumeredDofEntity_multiIndex_petsc_local_dof_view_ordered_non_unique
typedef multi_index_container< boost::shared_ptr< NumeredDofEntity >, indexed_by< ordered_non_unique< const_mem_fun< NumeredDofEntity::interface_type_DofEntity, FieldCoefficientsNumber, &NumeredDofEntity::getDofCoeffIdx > > > >	NumeredDofEntity_multiIndex_coeff_idx_ordered_non_unique
typedef multi_index_container< boost::shared_ptr< RefEntity >, indexed_by< ordered_unique< tag< Ent_mi_tag >, member< RefEntity::BasicEntity, EntityHandle, &RefEntity::ent > >, ordered_non_unique< tag< Ent_Ent_mi_tag >, const_mem_fun< RefEntity, EntityHandle, &RefEntity::getParentEnt > >, ordered_non_unique< tag< EntType_mi_tag >, const_mem_fun< RefEntity::BasicEntity, EntityType, &RefEntity::getEntType > >, ordered_non_unique< tag< ParentEntType_mi_tag >, const_mem_fun< RefEntity, EntityType, &RefEntity::getParentEntType > >, ordered_non_unique< tag< Composite_EntType_and_ParentEntType_mi_tag >, composite_key< RefEntity, const_mem_fun< RefEntity::BasicEntity, EntityType, &RefEntity::getEntType >, const_mem_fun< RefEntity, EntityType, &RefEntity::getParentEntType > > >, ordered_non_unique< tag< Composite_ParentEnt_And_EntType_mi_tag >, composite_key< RefEntity, const_mem_fun< RefEntity::BasicEntity, EntityType, &RefEntity::getEntType >, const_mem_fun< RefEntity, EntityHandle, &RefEntity::getParentEnt > > > > >	RefEntity_multiIndex
typedef multi_index_container< boost::shared_ptr< RefEntity >, indexed_by< hashed_non_unique< const_mem_fun< RefEntity, EntityHandle, &RefEntity::getParentEnt > >, hashed_unique< tag< Composite_EntType_and_ParentEntType_mi_tag >, composite_key< boost::shared_ptr< RefEntity >, const_mem_fun< RefEntity, EntityHandle, &RefEntity::getRefEnt >, const_mem_fun< RefEntity, EntityHandle, &RefEntity::getParentEnt > > > > >	RefEntity_multiIndex_view_by_hashed_parent_entity
	multi-index view of RefEntity by parent entity More...
typedef multi_index_container< boost::shared_ptr< RefEntity >, indexed_by< sequenced<>, ordered_unique< tag< Ent_mi_tag >, member< RefEntity::BasicEntity, EntityHandle, &RefEntity::ent > > > >	RefEntity_multiIndex_view_sequence_ordered_view
typedef FieldEntity_multiIndex::index< FieldName_mi_tag >::type	FieldEntityByFieldName
	Entity index by field name. More...
typedef multi_index_container< boost::shared_ptr< FieldEntity >, indexed_by< sequenced<>, ordered_non_unique< tag< Ent_mi_tag >, const_mem_fun< FieldEntity, EntityHandle, &FieldEntity::getEnt > > > >	FieldEntity_multiIndex_ent_view
typedef multi_index_container< boost::shared_ptr< FieldEntity >, indexed_by< sequenced<>, ordered_non_unique< tag< Composite_EntType_and_Space_mi_tag >, composite_key< FieldEntity, const_mem_fun< FieldEntity::interface_type_RefEntity, EntityType, &FieldEntity::getEntType >, const_mem_fun< FieldEntity::interface_type_Field, FieldSpace, &FieldEntity::getSpace > > > > >	FieldEntity_multiIndex_spaceType_view
typedef std::vector< boost::weak_ptr< FieldEntity > >	FieldEntity_vector_view
typedef multi_index_container< boost::shared_ptr< RefElement >, indexed_by< ordered_unique< tag< Ent_mi_tag >, const_mem_fun< RefElement::interface_type_RefEntity, EntityHandle, &RefElement::getRefEnt > >, ordered_non_unique< tag< EntType_mi_tag >, const_mem_fun< RefElement::interface_type_RefEntity, EntityType, &RefElement::getEntType > > > >	RefElement_multiIndex
typedef multi_index_container< boost::shared_ptr< RefElement >, indexed_by< ordered_unique< tag< Ent_mi_tag >, const_mem_fun< RefElement::interface_type_RefEntity, EntityHandle, &RefElement::getRefEnt > >, ordered_non_unique< tag< Ent_Ent_mi_tag >, const_mem_fun< RefElement::interface_type_RefEntity, EntityHandle, &RefElement::getParentEnt > >, ordered_non_unique< tag< Composite_ParentEnt_And_BitsOfRefinedEdges_mi_tag >, composite_key< RefElement, const_mem_fun< RefElement::interface_type_RefEntity, EntityHandle, &RefElement::getParentEnt >, const_mem_fun< RefElement, int, &RefElement::getBitRefEdgesUlong > > > > >	RefElement_multiIndex_parents_view
typedef boost::function< MoFEMErrorCode(Interface &moab, const Field &field_ptr, const EntFiniteElement &fe_ptr, Range &adjacency)>	ElementAdjacencyFunct
	user adjacency function More...
typedef EntFiniteElement_multiIndex::index< FiniteElement_name_mi_tag >::type	EntFiniteElementByName
	Entity finite element multi-index by finite element name. More...
typedef NumeredEntFiniteElement_multiIndex::index< FiniteElement_name_mi_tag >::type	NumeredEntFiniteElementbyName
	Entity finite element multi-index by finite element name. More...
typedef NumeredEntFiniteElement_multiIndex::index< Composite_Name_And_Part_mi_tag >::type	NumeredEntFiniteElementbyNameAndPart
	Entity finite element multi-index by finite element name and partition. More...
typedef boost::function< int(const int order)>	FieldOrderFunct
	user adjacency function More...
typedef FieldOrderFunct	FieldOrderTable[MBMAXTYPE]
	user adjacency function table More...
typedef multi_index_container< boost::shared_ptr< Field >, indexed_by< ordered_unique< tag< BitFieldId_mi_tag >, const_mem_fun< Field, const BitFieldId &, &Field::getId >, LtBit< BitFieldId > > > >	Field_multiIndex_view
typedef multi_index_container< FieldSeries, indexed_by< ordered_unique< tag< SeriesID_mi_tag >, const_mem_fun< FieldSeries, EntityID, &FieldSeries::get_meshset_id > >, ordered_unique< tag< SeriesName_mi_tag >, const_mem_fun< FieldSeries, boost::string_ref, &FieldSeries::getNameRef > > > >	Series_multiIndex
	Series multi index. More...
typedef multi_index_container< FieldSeriesStep, indexed_by< ordered_unique< tag< Composite_SeriesID_And_Step_mi_tag >, composite_key< FieldSeriesStep, const_mem_fun< FieldSeriesStep::interface_type_FieldSeries, EntityID, &FieldSeriesStep::get_meshset_id >, member< FieldSeriesStep, int, &FieldSeriesStep::step_number > > >, ordered_unique< tag< Composite_SeriesName_And_Step_mi_tag >, composite_key< FieldSeriesStep, const_mem_fun< FieldSeriesStep::interface_type_FieldSeries, boost::string_ref, &FieldSeriesStep::getNameRef >, member< FieldSeriesStep, int, &FieldSeriesStep::step_number > > >, ordered_non_unique< tag< SeriesName_mi_tag >, const_mem_fun< FieldSeriesStep::interface_type_FieldSeries, boost::string_ref, &FieldSeriesStep::getNameRef > >, ordered_non_unique< tag< Composite_SeriesName_And_Time_mi_tag >, composite_key< FieldSeriesStep, const_mem_fun< FieldSeriesStep::interface_type_FieldSeries, boost::string_ref, &FieldSeriesStep::getNameRef >, const_mem_fun< FieldSeriesStep, double, &FieldSeriesStep::get_time > > > > >	SeriesStep_multiIndex
	Step multi index. More...
typedef std::vector< PairNameFEMethodPtr >	FEMethodsSequence
typedef std::vector< BasicMethodPtr >	BasicMethodsSequence

Functions
PetscErrorCode	PetscOptionsGetInt (PetscOptions *, const char pre[], const char name[], PetscInt *ivalue, PetscBool *set)
PetscErrorCode	PetscOptionsGetReal (PetscOptions *, const char pre[], const char name[], PetscReal *dval, PetscBool *set)
PetscErrorCode	PetscOptionsGetScalar (PetscOptions *, const char pre[], const char name[], PetscScalar *dval, PetscBool *set)
PetscErrorCode	PetscOptionsGetString (PetscOptions *, const char pre[], const char name[], char str[], size_t size, PetscBool *set)
PetscErrorCode	PetscOptionsGetBool (PetscOptions *, const char pre[], const char name[], PetscBool *bval, PetscBool *set)
PetscErrorCode	PetscOptionsGetRealArray (PetscOptions *, const char pre[], const char name[], PetscReal dval[], PetscInt *nmax, PetscBool *set)
PetscErrorCode	PetscOptionsGetEList (PetscOptions *, const char pre[], const char name[], const char *const *list, PetscInt next, PetscInt *value, PetscBool *set)
PetscErrorCode	PetscOptionsGetIntArray (PetscOptions options, const char pre[], const char name[], PetscInt dvalue[], PetscInt *nmax, PetscBool *set)
PetscErrorCode	PetscOptionsGetScalarArray (PetscOptions options, const char pre[], const char name[], PetscScalar dvalue[], PetscInt *nmax, PetscBool *set)
template<typename T1 >
auto	getVectorAdaptor (T1 ptr, const size_t n)
	Get Vector adaptor. More...
template<typename T1 >
auto	getMatrixAdaptor (T1 ptr, const size_t n, const size_t m)
	Get Matrix adaptor. More...
template<class X >
std::string	toString (X x)
template<class T , class A >
static FTensor::Tensor0< FTensor::PackPtr< double *, 1 > >	getFTensor0FromVec (ublas::vector< T, A > &data)
	Get tensor rank 0 (scalar) form data vectorExample how to use it. More...
template<>
FTensor::Tensor0< FTensor::PackPtr< double *, 1 > >	getFTensor0FromVec< double, DoubleAllocator > (ublas::vector< double, DoubleAllocator > &data)
template<int Tensor_Dim, class T , class L , class A >
static FTensor::Tensor1< FTensor::PackPtr< T *, 1 >, Tensor_Dim >	getFTensor1FromMat (ublas::matrix< T, L, A > &data)
	Get tensor rank 1 (vector) form data matrix. More...
template<int Tensor_Dim>
static FTensor::Tensor1< FTensor::PackPtr< double *, 1 >, Tensor_Dim >	getFTensor1FromMat (MatrixDouble &data)
	Get tensor rank 1 (vector) form data matrix (specialization) More...
template<>
FTensor::Tensor1< FTensor::PackPtr< double *, 1 >, 3 >	getFTensor1FromMat< 3, double, ublas::row_major, DoubleAllocator > (MatrixDouble &data)
template<>
FTensor::Tensor1< FTensor::PackPtr< double *, 1 >, 2 >	getFTensor1FromMat< 2, double, ublas::row_major, DoubleAllocator > (MatrixDouble &data)
template<int Tensor_Dim0, int Tensor_Dim1, class T , class L , class A >
static FTensor::Tensor2< FTensor::PackPtr< T *, 1 >, Tensor_Dim0, Tensor_Dim1 >	getFTensor2FromMat (ublas::matrix< T, L, A > &data)
	Get tensor rank 2 (matrix) form data matrix. More...
template<>
FTensor::Tensor2< FTensor::PackPtr< double *, 1 >, 3, 3 >	getFTensor2FromMat (MatrixDouble &data)
template<>
FTensor::Tensor2< FTensor::PackPtr< double *, 1 >, 3, 2 >	getFTensor2FromMat (MatrixDouble &data)
template<int Tensor_Dim0, int Tensor_Dim1>
static FTensor::Tensor2< FTensor::PackPtr< double *, 1 >, Tensor_Dim0, Tensor_Dim1 >	getFTensor2FromMat (MatrixDouble &data)
	Get tensor rank 2 (matrix) form data matrix (specialization) More...
template<int Tensor_Dim, class T , class L , class A >
static FTensor::Tensor2_symmetric< FTensor::PackPtr< T *, 1 >, Tensor_Dim >	getFTensor2SymmetricFromMat (ublas::matrix< T, L, A > &data)
	Get symmetric tensor rank 2 (matrix) form data matrix. More...
template<>
FTensor::Tensor2_symmetric< FTensor::PackPtr< double *, 1 >, 3 >	getFTensor2SymmetricFromMat (MatrixDouble &data)
	Get symmetric tensor rank 2 form matrix of for dimension 3. More...
template<int Tensor_Dim>
static FTensor::Tensor2_symmetric< FTensor::PackPtr< double *, 1 >, Tensor_Dim >	getFTensor2SymmetricFromMat (MatrixDouble &data)
	Get symmetric tensor rank 2 form matrix. More...
template<class T >
static double	dEterminant (T &t)
	Calculate the determinant of a 3x3 matrix or a tensor of rank 2. More...
template<int Tensor_Dim, class T , class L , class A >
MoFEMErrorCode	invertTensor3by3 (ublas::matrix< T, L, A > &jac_data, ublas::vector< T, A > &det_data, ublas::matrix< T, L, A > &inv_jac_data)
	Calculate inverse of tensor rank 2 at integration points. More...
template<>
MoFEMErrorCode	invertTensor3by3< 3, double, ublas::row_major, DoubleAllocator > (MatrixDouble &jac_data, VectorDouble &det_data, MatrixDouble &inv_jac_data)
template<class T1 , class T2 >
MoFEMErrorCode	determinantTensor3by3 (T1 &t, T2 &det)
	Calculate determinant. More...
template<class T1 , class T2 , class T3 >
MoFEMErrorCode	invertTensor3by3 (T1 &t, T2 &det, T3 &inv_t)
	Calculate matrix inverse. More...
void	tet_type_6 (moab::Interface &moab, const EntityHandle *conn, const EntityHandle *edge_new_nodes, EntityHandle *new_tets_conn)
int	tet_type_5 (moab::Interface &moab, const EntityHandle *conn, const EntityHandle *edge_new_nodes, EntityHandle *new_tets_conn)
int	tet_type_4 (const EntityHandle *conn, const int *split_edges, const EntityHandle *edge_new_nodes, EntityHandle *new_tets_conn)
int	tet_type_3 (const EntityHandle *conn, const int *split_edges, const EntityHandle *edge_new_nodes, EntityHandle *new_tets_conn)
int	tet_type_2 (const EntityHandle *conn, const int *split_edges, const EntityHandle *edge_new_nodes, EntityHandle *new_tets_conn)
void	tet_type_1 (const EntityHandle *conn, const int split_edge, const EntityHandle edge_new_node, EntityHandle *new_tets_conn)
MoFEMErrorCode	tri_type_3 (const EntityHandle *conn, const BitRefEdges split_edges, const EntityHandle *edge_new_nodes, EntityHandle *new_tris_conn)
MoFEMErrorCode	prism_type_1 (const EntityHandle *conn, const BitRefEdges split_edges, const EntityHandle *edge_new_nodes, EntityHandle *new_prism_conn)
MoFEMErrorCode	prism_type_2 (const EntityHandle *conn, const BitRefEdges split_edges, const EntityHandle *edge_new_nodes, EntityHandle *new_prism_conn)
MoFEMErrorCode	prism_type_3 (const EntityHandle *conn, const BitRefEdges split_edges, const EntityHandle *edge_new_nodes, EntityHandle *new_prism_conn)
MoFEMErrorCode	Hcurl_Ainsworth_EdgeBaseFunctions_MBTET (int *sense, int *p, double *N, double *diffN, double *edgeN[], double *diff_edgeN[], int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Edge based H-curl base functions on tetrahedral. More...
MoFEMErrorCode	Hcurl_Ainsworth_EdgeBaseFunctions_MBTET_ON_EDGE (int sense, int p, double *N, double *diffN, double *edgeN, double *diff_edgeN, int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Edge based H-curl base functions on edge. More...
MoFEMErrorCode	Hcurl_Ainsworth_EdgeBaseFunctions_MBTET_ON_FACE (int *sense, int *p, double *N, double *diffN, double *edgeN[], double *diff_edgeN[], int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Edge based H-curl base functions on face. More...
MoFEMErrorCode	Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET (int *faces_nodes, int *p, double *N, double *diffN, double *phi_f_e[4][3], double *diff_phi_f_e[4][3], int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face edge base functions of Hcurl space on tetrahedral. More...
MoFEMErrorCode	Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET_ON_FACE (int *faces_nodes, int p, double *N, double *diffN, double *phi_f_e[3], double *diff_phi_f_e[3], int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face edge base functions of Hcurl space. More...
MoFEMErrorCode	Hcurl_Ainsworth_BubbleFaceFunctions_MBTET (int *faces_nodes, int *p, double *N, double *diffN, double *phi_f[4], double *diff_phi_f[4], int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face edge base functions of Hcurl space on face on tetrahedral. More...
MoFEMErrorCode	Hcurl_Ainsworth_BubbleFaceFunctions_MBTET_ON_FACE (int *faces_nodes, int p, double *N, double *diffN, double *phi_f, double *diff_phi_f, int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face edge base functions of Hcurl space on face. More...
MoFEMErrorCode	Hcurl_Ainsworth_FaceInteriorFunctions_MBTET (int *faces_nodes, int p, double *N, double *diffN, double *phi_v, double *diff_phi_v, int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face base interior function. More...
MoFEMErrorCode	Hcurl_Ainsworth_VolumeInteriorFunctions_MBTET (int p, double *N, double *diffN, double *phi_v, double *diff_phi_v, int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Volume interior function. More...
MoFEMErrorCode	Hcurl_Ainsworth_FaceFunctions_MBTET (int *face_nodes, int *p, double *N, double *diffN, double *phi_f[4], double *diff_phi_f[4], int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face H-curl functions. More...
MoFEMErrorCode	Hcurl_Ainsworth_FaceFunctions_MBTET_ON_FACE (int *faces_nodes, int p, double *N, double *diffN, double *phi_f, double *diff_phi_f, int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face H-curl functions. More...
MoFEMErrorCode	Hcurl_Ainsworth_VolumeFunctions_MBTET (int p, double *N, double *diffN, double *phi_v, double *diff_phi_v, int nb_integration_pts, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	H-curl volume base functions. More...
MoFEMErrorCode	Hcurl_Demkowicz_EdgeBaseFunctions_MBTET (int *sense, int *p, double *n, double *diff_n, double *phi[], double *diff_phi[], int nb_integration_pts)
	Edge based H-curl base functions on tetrahedral. More...
MoFEMErrorCode	Hcurl_Demkowicz_EdgeBaseFunctions_MBTRI (int *sense, int *p, double *n, double *diff_n, double *phi[], double *diff_phi[], int nb_integration_pts)
	Edge based H-curl base functions on teriangle. More...
MoFEMErrorCode	Hcurl_Demkowicz_EdgeBaseFunctions_MBEDGE (int sense, int p, double *n, double *diff_n, double *phi, double *diff_phi, int nb_integration_pts)
	Edge based H-curl base functions on edge. More...
MoFEMErrorCode	Hcurl_Demkowicz_FaceBaseFunctions_MBTET (int *faces_nodes, int *p, double *n, double *diff_n, double *phi[], double *diff_phi[], int nb_integration_pts)
	Face base interior function. More...
MoFEMErrorCode	Hcurl_Demkowicz_FaceBaseFunctions_MBTRI (int *faces_nodes, int p, double *n, double *diff_n, double *phi, double *diff_phi, int nb_integration_pts)
	Face base interior function. More...
MoFEMErrorCode	Hcurl_Demkowicz_VolumeBaseFunctions_MBTET (int p, double *n, double *diff_n, double *phi, double *diff_phi, int nb_integration_pts)
	Volume base interior function. More...
MoFEMErrorCode	Hdiv_Ainsworth_EdgeFaceShapeFunctions_MBTET (int *faces_nodes, int *p, double *N, double *diffN, double *phi_f_e[4][3], double *diff_phi_f_e[4][3], int gdim, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Hdiv base functions, Edge-based face functions by Ainsworth [1]. More...
MoFEMErrorCode	Hdiv_Ainsworth_EdgeFaceShapeFunctions_MBTET_ON_FACE (int *faces_nodes, int p, double *N, double *diffN, double *phi_f_e[3], double *diff_phi_f_e[3], int gdim, int nb, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Hdiv base functions, Edge-based face functions by Ainsworth [1]. More...
MoFEMErrorCode	Hdiv_Ainsworth_FaceBubbleShapeFunctions (int *faces_nodes, int *p, double *N, double *diffN, double *phi_f[], double *diff_phi_f[], int gdim, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face bubble functions by Ainsworth [1]. More...
MoFEMErrorCode	Hdiv_Ainsworth_FaceBubbleShapeFunctions_ON_FACE (int *faces_nodes, int p, double *N, double *diffN, double *phi_f, double *diff_phi_f, int gdim, int nb, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Face bubble functions by Ainsworth [1]. More...
MoFEMErrorCode	Hdiv_Ainsworth_EdgeBasedVolumeShapeFunctions_MBTET (int p, double *N, double *diffN, double *phi_v_e[6], double *diff_phi_v_e[6], int gdim, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Hdiv base function, Edge-based interior (volume) functions by Ainsworth [1]. More...
MoFEMErrorCode	Hdiv_Ainsworth_FaceBasedVolumeShapeFunctions_MBTET (int p, double *N, double *diffN, double *phi_v_f[], double *diff_phi_v_f[], int gdim, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
MoFEMErrorCode	Hdiv_Ainsworth_VolumeBubbleShapeFunctions_MBTET (int p, double *N, double *diffN, double *phi_v, double *diff_phi_v, int gdim, PetscErrorCode(*base_polynomials)(int p, double s, double *diff_s, double *L, double *diffL, const int dim))
	Interior bubble functions by Ainsworth [1]. More...
MoFEMErrorCode	Hdiv_Demkowicz_Face_MBTET_ON_FACE (int *faces_nodes, int p, double *N, double *diffN, double *phi_f, double *diff_phi_f, int gdim, int nb)
MoFEMErrorCode	Hdiv_Demkowicz_Interior_MBTET (int p, double *N, double *diffN, int p_face[], double *phi_f[4], double *diff_phi_f[4], double *phi_v, double *diff_phi_v, int gdim)
template<class TYPE >
static MoFEMErrorCode	get_value (MatrixDouble &pts_x, MatrixDouble &pts_t, TYPE *ctx)
static void	constructor_data (DataForcesAndSourcesCore *data, const EntityType type)
static void	constructor_derived_data (DerivedDataForcesAndSourcesCore *derived_data, const boost::shared_ptr< DataForcesAndSourcesCore > &data_ptr)
std::ostream &	operator<< (std::ostream &os, const DataForcesAndSourcesCore::EntData &e)
std::ostream &	operator<< (std::ostream &os, const DataForcesAndSourcesCore &e)
template<typename ENTMULTIINDEX >
static int	getMaxOrder (const ENTMULTIINDEX &multi_index)
static MoFEMErrorCode	get_porblem_row_indices (const ForcesAndSourcesCore *fe_ptr, const EntityType type, const int side, const std::string field_name, VectorInt &indices)
static MoFEMErrorCode	get_porblem_col_indices (const ForcesAndSourcesCore *fe_ptr, const EntityType type, const int side, const std::string field_name, VectorInt &indices)
template<class T >
static auto	get_sub_iface_options_imp (T *const ptr, int) -> decltype(ptr->getSubInterfaceOptions())
template<class T >
static auto	get_sub_iface_options_imp (T *const ptr, long) -> MoFEMErrorCode
static med_geometrie_element	moab2med_element_type (const EntityType type)
std::ostream &	operator<< (std::ostream &os, const MedInterface::FieldData &field_data)
static auto	min_non_abs (const double a, const double b)
int	fNBENTITY_GENERIC (int P)
int	fNBENTITYSET_NOFIELD (int P)
int	fNBVERTEX_L2 (int P)
int	fNBVOLUMETET_L2 (int P)
int	fNBFACETRI_L2 (int P)
int	fNBEDGE_L2 (int P)
int	fNBVERTEX_H1 (int P)
	number of approx. functions for H1 space on vertex More...
int	fNBEDGE_H1 (int P)
	number of approx. functions for H1 space on edge More...
int	fNBFACETRI_H1 (int P)
	number of approx. functions for H1 space on face More...
int	fNBFACEQUAD_H1 (int P)
int	fNBVOLUMETET_H1 (int P)
	number of approx. functions for H1 space on volume More...
int	fNBVOLUMEPRISM_H1 (int P)
int	fNBVERTEX_HCURL (int P)
	number of approx. functions for HCURL space on vertex More...
int	fNBEDGE_AINSWORTH_HCURL (int P)
int	fNBFACETRI_AINSWORTH_HCURL (int P)
int	fNBVOLUMETET_AINSWORTH_HCURL (int P)
int	fNBEDGE_DEMKOWICZ_HCURL (int P)
int	fNBFACETRI_DEMKOWICZ_HCURL (int P)
int	fNBVOLUMETET_DEMKOWICZ_HCURL (int P)
int	fNBVERTEX_HDIV (int P)
	number of approx. functions for HDIV space on vertex More...
int	fNBEDGE_HDIV (int P)
	number of approx. functions for HDIV space on edge More...
int	fNBFACETRI_AINSWORTH_HDIV (int P)
	number of approx. functions for HDIV space on face More...
int	fNBVOLUMETET_AINSWORTH_HDIV (int P)
	number of approx. functions for HDIV space on volume More...
int	fNBFACETRI_DEMKOWICZ_HDIV (int P)
int	fNBVOLUMETET_DEMKOWICZ_HDIV (int P)
	number of approx. functions for HDIV space on volume More...
MoFEMErrorCode	test_moab (Interface &moab, const EntityHandle ent)
	Test MoAB entity handle if has structure as is assumed by MoFEM. More...
struct	__attribute__ ((__packed__)) SideNumber
	keeps information about side number for the finite element More...
std::ostream &	operator<< (std::ostream &os, const CubitMeshSets &e)
std::ostream &	operator<< (std::ostream &os, const DisplacementCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const ForceCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const VelocityCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const AccelerationCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const TemperatureCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const PressureCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const HeatFluxCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const CfgCubitBcData &e)
std::ostream &	operator<< (std::ostream &os, const BlockSetAttributes &e)
std::ostream &	operator<< (std::ostream &os, const Mat_Elastic &e)
std::ostream &	operator<< (std::ostream &os, const Mat_Elastic_EberleinHolzapfel1 &e)
std::ostream &	operator<< (std::ostream &os, const Mat_Thermal &e)
std::ostream &	operator<< (std::ostream &os, const Mat_Moisture &e)
std::ostream &	operator<< (std::ostream &os, const Block_BodyForces &e)
std::ostream &	operator<< (std::ostream &os, const Mat_Elastic_TransIso &e)
std::ostream &	operator<< (std::ostream &os, const Mat_Interf &e)
std::ostream &	operator<< (std::ostream &os, const Field &e)
std::ostream &	operator<< (std::ostream &os, const FieldEntityEntFiniteElementAdjacencyMap &e)
MoFEMErrorCode	test_moab (moab::Interface &moab, const EntityHandle ent)
std::ostream &	operator<< (std::ostream &os, const DofEntity &e)
std::ostream &	operator<< (std::ostream &os, const NumeredDofEntity &e)
std::ostream &	operator<< (std::ostream &os, const FEDofEntity &e)
std::ostream &	operator<< (std::ostream &os, const FENumeredDofEntity &e)
void *	get_tag_ptr (moab::Interface &moab, Tag th, EntityHandle ent, int *tag_size)
MoFEMErrorCode	getParentEnt (moab::Interface &moab, Range ents, std::vector< EntityHandle > vec_patent_ent)
std::ostream &	operator<< (std::ostream &os, const RefEntity &e)
std::ostream &	operator<< (std::ostream &os, const FieldEntity &e)
std::ostream &	operator<< (std::ostream &os, const RefElement &e)
std::ostream &	operator<< (std::ostream &os, const RefElement_TET &e)
std::ostream &	operator<< (std::ostream &os, const RefElement_TRI &e)
std::ostream &	operator<< (std::ostream &os, const RefElement_EDGE &e)
std::ostream &	operator<< (std::ostream &os, const RefElement_VERTEX &e)
std::ostream &	operator<< (std::ostream &os, const FiniteElement &e)
std::ostream &	operator<< (std::ostream &os, const EntFiniteElement &e)
std::ostream &	operator<< (std::ostream &os, const Problem &e)
std::ostream &	operator<< (std::ostream &os, const FieldSeries &e)
std::ostream &	operator<< (std::ostream &os, const FieldSeriesStep &e)
template<typename T >
PetscObject	getPetscObject (T obj)
PetscErrorCode	DMRegister_MoFEM (const char sname[])
	Register MoFEM problem. More...
PetscErrorCode	DMMoFEMCreateMoFEM (DM dm, MoFEM::Interface *m_field_ptr, const char problem_name[], const MoFEM::BitRefLevel bit_level, const MoFEM::BitRefLevel bit_mask=MoFEM::BitRefLevel().set())
	Must be called by user to set MoFEM data structures. More...
PetscErrorCode	DMMoFEMCreateSubDM (DM subdm, DM dm, const char problem_name[])
	Must be called by user to set Sub DM MoFEM data structures. More...
PetscErrorCode	DMoFEMGetInterfacePtr (DM dm, MoFEM::Interface **m_field_ptr)
	Get pointer to MoFEM::Interface. More...
PetscErrorCode	DMMoFEMGetProblemPtr (DM dm, const MoFEM::Problem **problem_ptr)
	Get pointer to problem data structure. More...
PetscErrorCode	DMMoFEMSetDestroyProblem (DM dm, PetscBool destroy_problem)
PetscErrorCode	DMMoFEMGetDestroyProblem (DM dm, PetscBool *destroy_problem)
PetscErrorCode	DMMoFEMSetSquareProblem (DM dm, PetscBool square_problem)
	set squared problemIt if true is assumed that matrix has the same indexing on rows and columns. This reduces interprocessor communication. More...
PetscErrorCode	DMMoFEMGetSquareProblem (DM dm, PetscBool *square_problem)
	get squared problemIt if true is assumed that matrix has the same indexing on rows and columns. This reduces interprocessor communication. More...
PetscErrorCode	DMMoFEMResolveSharedEntities (DM dm, const char fe_name[])
	Resolve shared entities. More...
PetscErrorCode	DMMoFEMGetProblemFiniteElementLayout (DM dm, const char fe_name[], PetscLayout *layout)
	Get finite elements layout in the problem. More...
PetscErrorCode	DMMoFEMAddElement (DM dm, const char fe_name[])
	add element to dm More...
PetscErrorCode	DMMoFEMUnSetElement (DM dm, const char fe_name[])
	unset element from dm More...
PetscErrorCode	DMoFEMMeshToLocalVector (DM dm, Vec l, InsertMode mode, ScatterMode scatter_mode)
	set local (or ghosted) vector values on mesh for partition only More...
PetscErrorCode	DMoFEMMeshToGlobalVector (DM dm, Vec g, InsertMode mode, ScatterMode scatter_mode)
	set ghosted vector values on all existing mesh entities More...
PetscErrorCode	DMoFEMPreProcessFiniteElements (DM dm, MoFEM::FEMethod *method)
	execute finite element method for each element in dm (problem) More...
PetscErrorCode	DMoFEMPostProcessFiniteElements (DM dm, MoFEM::FEMethod *method)
	execute finite element method for each element in dm (problem) More...
PetscErrorCode	DMoFEMLoopFiniteElementsUpAndLowRank (DM dm, const char fe_name[], MoFEM::FEMethod *method, int low_rank, int up_rank)
	Executes FEMethod for finite elements in DM. More...
PetscErrorCode	DMoFEMLoopFiniteElementsUpAndLowRank (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method, int low_rank, int up_rank)
	Executes FEMethod for finite elements in DM. More...
PetscErrorCode	DMoFEMLoopFiniteElements (DM dm, const char fe_name[], MoFEM::FEMethod *method)
	Executes FEMethod for finite elements in DM. More...
PetscErrorCode	DMoFEMLoopFiniteElements (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method)
	Executes FEMethod for finite elements in DM. More...
PetscErrorCode	DMoFEMLoopDofs (DM dm, const char field_name[], MoFEM::DofMethod *method)
	execute method for dofs on field in problem More...
PetscErrorCode	DMMoFEMKSPSetComputeRHS (DM dm, const char fe_name[], MoFEM::FEMethod *method, MoFEM::BasicMethod *pre_only, MoFEM::BasicMethod *post_only)
	Set compute operator for KSP solver via sub-matrix and IS. More...
PetscErrorCode	DMMoFEMKSPSetComputeRHS (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method, boost::shared_ptr< MoFEM::BasicMethod > pre_only, boost::shared_ptr< MoFEM::BasicMethod > post_only)
	set KSP right hand side evaluation function More...
PetscErrorCode	DMMoFEMKSPSetComputeOperators (DM dm, const char fe_name[], MoFEM::FEMethod *method, MoFEM::BasicMethod *pre_only, MoFEM::BasicMethod *post_only)
	Set KSP operators and push mofem finite element methods. More...
PetscErrorCode	DMMoFEMKSPSetComputeOperators (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method, boost::shared_ptr< MoFEM::BasicMethod > pre_only, boost::shared_ptr< MoFEM::BasicMethod > post_only)
	Set KSP operators and push mofem finite element methods. More...
PetscErrorCode	DMMoFEMSNESSetFunction (DM dm, const char fe_name[], MoFEM::FEMethod *method, MoFEM::BasicMethod *pre_only, MoFEM::BasicMethod *post_only)
	set SNES residual evaluation function More...
PetscErrorCode	DMMoFEMSNESSetFunction (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method, boost::shared_ptr< MoFEM::BasicMethod > pre_only, boost::shared_ptr< MoFEM::BasicMethod > post_only)
	set SNES residual evaluation function More...
PetscErrorCode	DMMoFEMSNESSetJacobian (DM dm, const char fe_name[], MoFEM::FEMethod *method, MoFEM::BasicMethod *pre_only, MoFEM::BasicMethod *post_only)
	set SNES Jacobian evaluation function More...
PetscErrorCode	DMMoFEMSNESSetJacobian (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method, boost::shared_ptr< MoFEM::BasicMethod > pre_only, boost::shared_ptr< MoFEM::BasicMethod > post_only)
	set SNES Jacobian evaluation function More...
PetscErrorCode	DMMoFEMTSSetIFunction (DM dm, const char fe_name[], MoFEM::FEMethod *method, MoFEM::BasicMethod *pre_only, MoFEM::BasicMethod *post_only)
	set TS implicit function evaluation function More...
PetscErrorCode	DMMoFEMTSSetIFunction (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method, boost::shared_ptr< MoFEM::BasicMethod > pre_only, boost::shared_ptr< MoFEM::BasicMethod > post_only)
	set TS implicit function evaluation function More...
PetscErrorCode	DMMoFEMTSSetIJacobian (DM dm, const std::string &fe_name, boost::shared_ptr< MoFEM::FEMethod > method, boost::shared_ptr< MoFEM::BasicMethod > pre_only, boost::shared_ptr< MoFEM::BasicMethod > post_only)
	set TS Jacobian evaluation function More...
PetscErrorCode	DMMoFEMTSSetIJacobian (DM dm, const char fe_name[], MoFEM::FEMethod *method, MoFEM::BasicMethod *pre_only, MoFEM::BasicMethod *post_only)
	set TS Jacobian evaluation function More...
PetscErrorCode	DMMoFEMGetKspCtx (DM dm, MoFEM::KspCtx **ksp_ctx)
	get MoFEM::KspCtx data structure More...
PetscErrorCode	DMMoFEMGetKspCtx (DM dm, const boost::shared_ptr< MoFEM::KspCtx > &ksp_ctx)
	get MoFEM::KspCtx data structure More...
PetscErrorCode	DMMoFEMSetKspCtx (DM dm, boost::shared_ptr< MoFEM::KspCtx > &ksp_ctx)
	set MoFEM::KspCtx data structure More...
PetscErrorCode	DMMoFEMGetSnesCtx (DM dm, MoFEM::SnesCtx **snes_ctx)
	get MoFEM::SnesCtx data structure More...
PetscErrorCode	DMMoFEMGetSnesCtx (DM dm, const boost::shared_ptr< MoFEM::SnesCtx > &snes_ctx)
	get MoFEM::SnesCtx data structure More...
PetscErrorCode	DMMoFEMSetSnesCtx (DM dm, boost::shared_ptr< MoFEM::SnesCtx > &snes_ctx)
	Set MoFEM::SnesCtx data structure. More...
PetscErrorCode	DMMoFEMGetTsCtx (DM dm, MoFEM::TsCtx **ts_ctx)
	get MoFEM::TsCtx data structure More...
PetscErrorCode	DMMoFEMGetTsCtx (DM dm, const boost::shared_ptr< MoFEM::TsCtx > &ts_ctx)
	get MoFEM::TsCtx data structure More...
PetscErrorCode	DMMoFEMSetTsCtx (DM dm, boost::shared_ptr< MoFEM::TsCtx > &ts_ctx)
	Set MoFEM::TsCtx data structureIt take over pointer, do not delete it, DM will destroy pointer when is destroyed. More...
PetscErrorCode	DMMoFEMSetIsPartitioned (DM dm, PetscBool is_partitioned)
PetscErrorCode	DMMoFEMGetIsPartitioned (DM dm, PetscBool *is_partitioned)
PetscErrorCode	DMSetOperators_MoFEM (DM dm)
	Set operators for MoFEM dm. More...
PetscErrorCode	DMCreate_MoFEM (DM dm)
	Create dm data structure with MoFEM data structure. More...
PetscErrorCode	DMDestroy_MoFEM (DM dm)
	Destroys dm with MoFEM data structure. More...
PetscErrorCode	DMCreateGlobalVector_MoFEM (DM dm, Vec *g)
	DMShellSetCreateGlobalVectorsets the routine to create a global vector associated with the shell DM. More...
PetscErrorCode	DMCreateLocalVector_MoFEM (DM dm, Vec *l)
	DMShellSetCreateLocalVectorsets the routine to create a local vector associated with the shell DM. More...
PetscErrorCode	DMCreateMatrix_MoFEM (DM dm, Mat *M)
PetscErrorCode	DMSetFromOptions_MoFEM (DM dm)
PetscErrorCode	DMSetUp_MoFEM (DM dm)
PetscErrorCode	DMSubDMSetUp_MoFEM (DM subdm)
PetscErrorCode	DMMoFEMAddSubFieldRow (DM dm, const char field_name[], EntityType lo_type=MBVERTEX, EntityType hi_type=MBMAXTYPE)
PetscErrorCode	DMMoFEMAddSubFieldCol (DM dm, const char field_name[], EntityType lo_type=MBVERTEX, EntityType hi_type=MBMAXTYPE)
PetscErrorCode	DMMoFEMGetIsSubDM (DM dm, PetscBool *is_sub_dm)
PetscErrorCode	DMMoFEMGetSubRowIS (DM dm, IS *is)
	get sub problem is More...
PetscErrorCode	DMMoFEMGetSubColIS (DM dm, IS *is)
	get sub problem is More...
PetscErrorCode	DMMoFEMAddRowCompositeProblem (DM dm, const char prb_name[])
	Add problem to composite DM on rowThis create block on row with DOFs from problem of given name. More...
PetscErrorCode	DMMoFEMAddColCompositeProblem (DM dm, const char prb_name[])
	Add problem to composite DM on colThis create block on col with DOFs from problem of given name. More...
PetscErrorCode	DMMoFEMGetIsCompDM (DM dm, PetscBool *is_comp_dm)
	Get if this DM is composite DM. More...
PetscErrorCode	DMGlobalToLocalBegin_MoFEM (DM dm, Vec, InsertMode, Vec)
PetscErrorCode	DMGlobalToLocalEnd_MoFEM (DM dm, Vec, InsertMode, Vec)
PetscErrorCode	DMLocalToGlobalBegin_MoFEM (DM, Vec, InsertMode, Vec)
PetscErrorCode	DMLocalToGlobalEnd_MoFEM (DM, Vec, InsertMode, Vec)
PetscErrorCode	DMCreateFieldIS_MoFEM (DM dm, PetscInt *numFields, char ***fieldNames, IS **fields)
PetscErrorCode	DMMoFEMGetFieldIS (DM dm, RowColData rc, const char field_name[], IS *is)
	get field is in the problem More...
PetscErrorCode	DMMoFEMSetVerbosity (DM dm, const int verb)
	Set verbosity level. More...
template<class S , class T0 , class T1 , class T2 >
static PetscErrorCode	DMMoFEMKSPSetComputeRHS (DM dm, S fe_name, T0 method, T1 pre_only, T2 post_only)
template<class S , class T0 , class T1 , class T2 >
static PetscErrorCode	DMMoFEMKSPSetComputeOperators (DM dm, S fe_name, T0 method, T1 pre_only, T2 post_only)
template<class S , class T0 , class T1 , class T2 >
static PetscErrorCode	DMMoFEMSNESSetFunction (DM dm, S fe_name, T0 method, T1 pre_only, T2 post_only)
template<class S , class T0 , class T1 , class T2 >
static PetscErrorCode	DMMoFEMSNESSetJacobian (DM dm, S fe_name, T0 method, T1 pre_only, T2 post_only)
template<class S , class T0 , class T1 , class T2 >
static PetscErrorCode	DMMoFEMTSSetIFunction (DM dm, S fe_name, T0 method, T1 pre_only, T2 post_only)
template<class S , class T0 , class T1 , class T2 >
static PetscErrorCode	DMMoFEMTSSetIJacobian (DM dm, S fe_name, T0 method, T1 pre_only, T2 post_only)
PetscErrorCode	KspRhs (KSP ksp, Vec f, void *ctx)
	Run over elements in the lists. More...
PetscErrorCode	KspMat (KSP ksp, Mat A, Mat B, void *ctx)
	Run over elenents in the list. More...
PetscErrorCode	SnesRhs (SNES snes, Vec x, Vec f, void *ctx)
	This is MoFEM implementation for the right hand side (residual vector) evaluation in SNES solver. More...
PetscErrorCode	SnesMat (SNES snes, Vec x, Mat A, Mat B, void *ctx)
	This is MoFEM implementation for the left hand side (tangent matrix) evaluation in SNES solver. More...
MoFEMErrorCode	SnesMoFEMSetAssemblyType (SNES snes, MatAssemblyType type)
	Set assembly type at the end of SnesMat. More...
MoFEMErrorCode	SnesMoFEMSetBehavior (SNES snes, MoFEMTypes bh)
	Set behavior if finite element in sequence does not exist. More...
PetscErrorCode	TsSetIFunction (TS ts, PetscReal t, Vec u, Vec u_t, Vec F, void *ctx)
	Set IFunction for TS solver. More...
PetscErrorCode	TsSetIJacobian (TS ts, PetscReal t, Vec u, Vec u_t, PetscReal a, Mat A, Mat B, void *ctx)
	Set function evaluating jacobina in TS solver. More...
PetscErrorCode	TsMonitorSet (TS ts, PetscInt step, PetscReal t, Vec u, void *ctx)
	Set monitor for TS solver. More...
PetscErrorCode	TSSetRHSFunction (TS ts, PetscReal t, Vec u, Vec F, void *ctx)
	TS solver function. More...
PetscErrorCode	TSSetRHSJacobian (TS ts, PetscReal t, Vec u, Mat A, Mat B, void *ctx)
	TS solver function. More...

Variables
DEPRECATED typedef DataForcesAndSourcesCore	DataForcesAndSurcesCore
DEPRECATED typedef DerivedDataForcesAndSourcesCore	DerivedDataForcesAndSurcesCore
DEPRECATED typedef EdgeElementForcesAndSourcesCore	EdgeElementForcesAndSurcesCore
	Use EdgeElementForcesAndSourcesCore. More...
DEPRECATED typedef FaceElementForcesAndSourcesCore	FaceElementForcesAndSurcesCore
DEPRECATED typedef FatPrismElementForcesAndSourcesCore	FatPrismElementForcesAndSurcesCore
DEPRECATED typedef FlatPrismElementForcesAndSourcesCore	FlatPrismElementForcesAndSurcesCore
	USe FlatPrismElementForcesAndSourcesCore. More...
DEPRECATED typedef ForcesAndSourcesCore	ForcesAndSurcesCore
DEPRECATED typedef VertexElementForcesAndSourcesCore	VertexElementForcesAndSurcesCore
DEPRECATED typedef VolumeElementForcesAndSourcesCore	VolumeElementForcesAndSurcesCore
DEPRECATED typedef DofMethod	EntMethod
DEPRECATED typedef Problem	MoFEMProblem
const EntityHandle	no_handle = 0
	No entity handle is indicated by zero handle, i.e. root meshset. More...
static const MOFEMuuid	IDD_UNKNOWN_BASE_FUNCTION
static const MOFEMuuid	IDD_TET_BASE_FUNCTION
static const MOFEMuuid	IDD_TRI_BASE_FUNCTION
static const MOFEMuuid	IDD_EDGE_BASE_FUNCTION
static const MOFEMuuid	IDD_FATPRISM_BASE_FUNCTION
static const MOFEMuuid	IDD_FLATPRISM_BASE_FUNCTION = MOFEMuuid(BitIntefaceId(FLATPRISM_BASE_FUNCTION_INTERFACE))
static const int	edges_conn [] = {0, 1, 1, 2, 2, 0, 0, 3, 1, 3, 2, 3}
static const int	oposite_edge [] = {5, 3, 4, 1, 2, 0}
static const int	edge_permutations [6][6]
static const int	edge_mirror_cross [6] = {0, 3, 4, 1, 2, 5}
static const int	edge_mirror_vertical [6] = {0, 4, 3, 2, 1, 5}
static const int	cyclic_node_rotate_face_3 [3][4]
static const int	cyclic_edge_rotate_face_3 [3][6]
static const char	edge_bits_mark [] = {1, 2, 4, 8, 16, 32}
static const MOFEMuuid	IDD_JACOBI_BASE_FUNCTION
static const MOFEMuuid	IDD_INTEGRATED_JACOBI_BASE_FUNCTION
static const MOFEMuuid	IDD_LEGENDRE_BASE_FUNCTION = MOFEMuuid(BitIntefaceId(LEGENDRE_BASE_FUNCTION_INTERFACE))
static const MOFEMuuid	IDD_LOBATTO_BASE_FUNCTION = MOFEMuuid(BitIntefaceId(LOBATTO_BASE_FUNCTION_INTERFACE))
static const MOFEMuuid	IDD_KERNEL_BASE_FUNCTION = MOFEMuuid(BitIntefaceId(KERNEL_BASE_FUNCTION_INTERFACE))
static const MOFEMuuid	IDD_MOFEMBitLevelCoupler = MOFEMuuid( BitIntefaceId(BITLEVELCOUPLER_INTERFACE) )
static const MOFEMuuid	IDD_MOFEMBitRefManager
static const MOFEMuuid	IDD_MOFEMCoordsSystemsManager = MOFEMuuid( BitIntefaceId(COORDSSYSTEMMANAGER_INTERFACE) )
static const MOFEMuuid	IDD_MOFEMCutMesh
static const MOFEMuuid	IDD_MOFEMFieldBlas
static const MOFEMuuid	IDD_MOFEMFieldEvaluator
static const MOFEMuuid	IDD_MOFEMCoreInterface
static const MOFEMuuid	IDD_MOFEMDeprecatedCoreInterface
static const MOFEMuuid	IDD_MOFEMISManager
static const MOFEMuuid	IDD_MOFEMKspMethod
static const MOFEMuuid	IDD_MOFEMSnesMethod
static const MOFEMuuid	IDD_MOFEMTsMethod = MOFEMuuid(BitIntefaceId(TS_METHOD))
static const MOFEMuuid	IDD_MOFEMBasicMethod
static const MOFEMuuid	IDD_MOFEMFEMethod = MOFEMuuid(BitIntefaceId(FE_METHOD))
static const MOFEMuuid	IDD_MOFEMEntityMethod
static const MOFEMuuid	IDD_MOFEMDofMethod
static const MOFEMuuid	IDD_MOFEMMatrixManager
static const MOFEMuuid	IDD_MOFEMMedInterface
static const MOFEMuuid	IDD_MOFEMMeshRefine
static const MOFEMuuid	IDD_MOFEMMeshsetsManager
static const MOFEMuuid	IDD_MOFEMNodeMerger
static const MOFEMuuid	IDD_MOFEMPrismInterface
static const MOFEMuuid	IDD_MOFEMPrismsFromSurface = MOFEMuuid(BitIntefaceId(PRISMSFROMSURFACE_INTERFACE))
static const MOFEMuuid	IDD_MOFEMProblemsManager
static const MOFEMuuid	IDD_MOFEMSeriesRecorder
static const MOFEMuuid	IDD_MOFEMSimple
static const MOFEMuuid	IDD_MOFEMTetGegInterface
static const MOFEMuuid	IDD_MOFEMTools = MOFEMuuid(BitIntefaceId(TOOLS))
static const MOFEMuuid	IDD_MOFEMUnknown
static const MOFEMuuid	IDD_MOFEMVEC = MOFEMuuid( BitIntefaceId(VECMANAGER_INTERFACE) )
const int	prism_adj_edges [] = {6, 7, 8, -1, -1, -1, 0, 1, 2}
const int	prism_edges_conn [6][2]
static moab::Error	error
auto	createSmartDM
	Creates smart DM object. More...
auto	createSmartGhostVector
	Create smart ghost vector. More...
auto	smartVectorDuplicate
	Create duplicate vector of smart vector. More...
static const MOFEMuuid	IDD_DMCTX = MOFEMuuid(BitIntefaceId(DMCTX_INTERFACE))

Detailed Description

implementation of Data Operators for Forces and Sources

Create adjacent matrices using different indices.

name space of MoFEM library functions and classes

file DataOperators.cpp

The MoFEM package is copyrighted by Lukasz Kaczmarczyk. It can be freely used for educational and research purposes by other institutions. If you use this softwre pleas cite my work.

MoFEM 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.

MoFEM 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 for more details.

You should have received a copy of the GNU Lesser General Public License along with MoFEM. If not, see http://www.gnu.org/licenses/

MoFEM 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.

MoFEM 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 for more details.

You should have received a copy of the GNU Lesser General Public License along with MoFEM. If not, see http://www.gnu.org/licenses/

MoFEM 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 for more details.

You should have received a copy of the GNU Lesser General Public License along with MoFEM. If not, see http://www.gnu.org/licenses/

Typedef Documentation

BasicMethodsSequence

typedef std::vector<BasicMethodPtr> MoFEM::BasicMethodsSequence

Definition at line 108 of file AuxPETSc.hpp.

CoordSys_multiIndex

typedef multi_index_container< boost::shared_ptr<CoordSys>, indexed_by< ordered_unique< tag<Meshset_mi_tag>, member<CoordSys,EntityHandle,&CoordSys::meshSet> >, ordered_unique< tag<CoordSysName_mi_tag>, const_mem_fun<CoordSys,boost::string_ref,&CoordSys::getNameRef> > > > MoFEM::CoordSys_multiIndex

Definition at line 140 of file CoordSysMultiIndices.hpp.

CubitMeshSet_multiIndex

MoFEM::CubitMeshSet_multiIndex

Stores data about meshsets (see CubitMeshSets) storing data about boundary conditions, interfaces, sidesets, nodests, blocksets.

Parameters

Meshset_mi_tag	index by meshset handle
CubitMeshSets_mi_tag	index by bc type, see CubitBC
CubitMeshSets_mask_meshset_mi_tag	index by NODESET, SIDESET, BLOCKSET only
CubitMeshSets_name	index by meshset name
Composite_Cubit_msId_And_MeshSetType_mi_tag	index by meshset id and type NODESET, SIDESET or BLOCKSET

Example:

  MeshsetsManager *m_mng;
  ierr = m_field.getInterface(m_mng); CHKERRG(ierr);
  CubitMeshSet_multiIndex &meshsets_index = m_mng->etMeshsetsMultindex();

  CubitMeshSet_multiIndex::index<CubitMeshSets_mask_meshset_mi_tag>::type::iterator
mit,hi_mit; mit =
meshsets_index.get<CubitMeshSets_mask_meshset_mi_tag>().lower_bound(BLOCKSET);
  hi_mit =
meshsets_index.get<CubitMeshSets_mask_meshset_mi_tag>().upper_bound(BLOCKSET);
  // Make a loop over all BLOCKSET
  for(;mit!=hi_mit;mit++) {
    int id = mit->getMeshsetId();            // get blockset id
    EntityHandle handle = mit->getMeshset(); // get block meshset
    std::vector< double > attributes;
    // get block attributes
    ierr = mit->getAttributes(attributes); CHKERRG(ierr);
    // do something
  }

Definition at line 396 of file BCMultiIndices.hpp.

CubitMeshsetById

typedef CubitMeshSet_multiIndex::index<CubitMeshSets_mi_tag>::type MoFEM::CubitMeshsetById

Definition at line 34 of file MeshsetsManager.hpp.

CubitMeshsetByMask

typedef CubitMeshSet_multiIndex::index<CubitMeshSets_mask_meshset_mi_tag>::type MoFEM::CubitMeshsetByMask

Definition at line 28 of file MeshsetsManager.hpp.

CubitMeshsetByName

typedef CubitMeshSet_multiIndex::index<CubitMeshSets_name>::type MoFEM::CubitMeshsetByName

Definition at line 31 of file MeshsetsManager.hpp.

CubitMeshsetByType

typedef CubitMeshSet_multiIndex::index<CubitMeshSets_mi_tag>::type MoFEM::CubitMeshsetByType

Definition at line 25 of file MeshsetsManager.hpp.

DofsAllocator

typedef ublas::unbounded_array< boost::shared_ptr<const FEDofEntity>, std::allocator<boost::shared_ptr<const FEDofEntity> > > MoFEM::DofsAllocator

Definition at line 32 of file DataStructures.hpp.

FEMethodsSequence

typedef std::vector<PairNameFEMethodPtr> MoFEM::FEMethodsSequence

Definition at line 107 of file AuxPETSc.hpp.

Field_multiIndex_view

typedef multi_index_container< boost::shared_ptr<Field>, indexed_by< ordered_unique<tag<BitFieldId_mi_tag>, const_mem_fun<Field, const BitFieldId &, &Field::getId>, LtBit<BitFieldId> > > > MoFEM::Field_multiIndex_view

Definition at line 538 of file FieldMultiIndices.hpp.

FieldEntity_multiIndex_ent_view

typedef multi_index_container< boost::shared_ptr<FieldEntity>, indexed_by< sequenced<>, ordered_non_unique< tag<Ent_mi_tag>, const_mem_fun<FieldEntity, EntityHandle, &FieldEntity::getEnt> > > > MoFEM::FieldEntity_multiIndex_ent_view

Definition at line 863 of file EntsMultiIndices.hpp.

FieldEntity_multiIndex_spaceType_view

typedef multi_index_container< boost::shared_ptr<FieldEntity>, indexed_by< sequenced<>, ordered_non_unique< tag<Composite_EntType_and_Space_mi_tag>, composite_key<FieldEntity, const_mem_fun<FieldEntity::interface_type_RefEntity, EntityType, &FieldEntity::getEntType>, const_mem_fun<FieldEntity::interface_type_Field, FieldSpace, &FieldEntity::getSpace> > > > > MoFEM::FieldEntity_multiIndex_spaceType_view

Definition at line 884 of file EntsMultiIndices.hpp.

FieldEntity_vector_view

typedef std::vector<boost::weak_ptr<FieldEntity> > MoFEM::FieldEntity_vector_view

Definition at line 886 of file EntsMultiIndices.hpp.

LengthMapData_multi_index

typedef multi_index_container< LengthMapData, indexed_by< ordered_non_unique< member<LengthMapData, double, &LengthMapData::lEngth> >, hashed_unique< member<LengthMapData, EntityHandle, &LengthMapData::eDge> >, ordered_non_unique< member<LengthMapData, double, &LengthMapData::qUality> > > > MoFEM::LengthMapData_multi_index

Definition at line 1998 of file CutMeshInterface.cpp.

NumeredDofEntity_multiIndex_coeff_idx_ordered_non_unique

typedef multi_index_container< boost::shared_ptr<NumeredDofEntity>, indexed_by<ordered_non_unique<const_mem_fun< NumeredDofEntity::interface_type_DofEntity, FieldCoefficientsNumber, &NumeredDofEntity::getDofCoeffIdx> > > > MoFEM::NumeredDofEntity_multiIndex_coeff_idx_ordered_non_unique

Definition at line 740 of file DofsMultiIndices.hpp.

NumeredDofEntity_multiIndex_idx_view_hashed

typedef multi_index_container< boost::shared_ptr<NumeredDofEntity>, indexed_by<hashed_unique<const_mem_fun<NumeredDofEntity, DofIdx, &NumeredDofEntity::getDofIdx> > > > MoFEM::NumeredDofEntity_multiIndex_idx_view_hashed

Definition at line 727 of file DofsMultiIndices.hpp.

NumeredDofEntity_multiIndex_petsc_local_dof_view_ordered_non_unique

typedef multi_index_container< boost::shared_ptr<NumeredDofEntity>, indexed_by<ordered_non_unique<const_mem_fun< NumeredDofEntity, DofIdx, &NumeredDofEntity::getPetscLocalDofIdx> > > > MoFEM::NumeredDofEntity_multiIndex_petsc_local_dof_view_ordered_non_unique

Definition at line 733 of file DofsMultiIndices.hpp.

NumeredDofEntity_multiIndex_uid_view_ordered

typedef multi_index_container< boost::shared_ptr<NumeredDofEntity>, indexed_by<ordered_unique< const_mem_fun<NumeredDofEntity::interface_type_DofEntity, const UId &, &NumeredDofEntity::getGlobalUniqueId> > > > MoFEM::NumeredDofEntity_multiIndex_uid_view_ordered

Definition at line 721 of file DofsMultiIndices.hpp.

RefElement_multiIndex_parents_view

typedef multi_index_container< boost::shared_ptr<RefElement>, indexed_by< ordered_unique<tag<Ent_mi_tag>, const_mem_fun<RefElement::interface_type_RefEntity, EntityHandle, &RefElement::getRefEnt> >, ordered_non_unique< tag<Ent_Ent_mi_tag>, const_mem_fun<RefElement::interface_type_RefEntity, EntityHandle, &RefElement::getParentEnt> >, ordered_non_unique< tag<Composite_ParentEnt_And_BitsOfRefinedEdges_mi_tag>, composite_key< RefElement, const_mem_fun<RefElement::interface_type_RefEntity, EntityHandle, &RefElement::getParentEnt>, const_mem_fun<RefElement, int, &RefElement::getBitRefEdgesUlong> > > > > MoFEM::RefElement_multiIndex_parents_view

Definition at line 213 of file FEMultiIndices.hpp.

RefEntity_multiIndex_view_sequence_ordered_view

typedef multi_index_container< boost::shared_ptr<RefEntity>, indexed_by<sequenced<>, ordered_unique<tag<Ent_mi_tag>, member<RefEntity::BasicEntity, EntityHandle, &RefEntity::ent> > > > MoFEM::RefEntity_multiIndex_view_sequence_ordered_view

Definition at line 468 of file EntsMultiIndices.hpp.

VectorDofs

typedef ublas::vector<boost::shared_ptr<const FEDofEntity>, DofsAllocator> MoFEM::VectorDofs

Definition at line 34 of file DataStructures.hpp.

Function Documentation

constructor_data()

static void MoFEM::constructor_data ( DataForcesAndSourcesCore *  data, const EntityType  type  )

static

Definition at line 40 of file DataStructures.cpp.

                                                    {

  using EntData = DataForcesAndSourcesCore::EntData;

  data->dataOnEntities[MBENTITYSET].push_back(new EntData());

  switch (type) {
  case MBENTITYSET:
    break;
  case MBTET: 
    data->dataOnEntities[MBVERTEX].push_back(new EntData());
    for (int ee = 0; ee != 6; ++ee) {
      data->dataOnEntities[MBEDGE].push_back(new EntData());
    }
    for (int ff = 0; ff != 4; ++ff) {
      data->dataOnEntities[MBTRI].push_back(new EntData());
    }
    data->dataOnEntities[MBTET].push_back(new EntData());
  break;
  case MBTRI:
    data->dataOnEntities[MBVERTEX].push_back(new EntData());
    for (int ee = 0; ee != 3; ++ee) {
      data->dataOnEntities[MBEDGE].push_back(new EntData());
    }
    data->dataOnEntities[MBTRI].push_back(new EntData());
  break;
  case MBEDGE:
    data->dataOnEntities[MBVERTEX].push_back(new EntData());
    data->dataOnEntities[MBEDGE].push_back(new EntData());
    break;
  case MBVERTEX:
    data->dataOnEntities[MBVERTEX].push_back(new EntData());
    break;
  case MBPRISM:
    data->dataOnEntities[MBVERTEX].push_back(new EntData());
    for (int ee = 0; ee != 9; ++ee) {
      data->dataOnEntities[MBEDGE].push_back(new EntData());
    }
    for (int qq = 0; qq != 5; ++qq) {
      data->dataOnEntities[MBQUAD].push_back(new EntData());
    }
    for (int ff = 0; ff != 5; ++ff) {
      data->dataOnEntities[MBTRI].push_back(new EntData());
    }
    data->dataOnEntities[MBPRISM].push_back(new EntData());
  break;
  default:
    throw MoFEMException(MOFEM_NOT_IMPLEMENTED);
  }
}

constructor_derived_data()

static void MoFEM::constructor_derived_data ( DerivedDataForcesAndSourcesCore *  derived_data, const boost::shared_ptr< DataForcesAndSourcesCore > &  data_ptr  )

static

Definition at line 104 of file DataStructures.cpp.

                                                               {

  using EntData = DataForcesAndSourcesCore::EntData;
  using DerivedEntData = DerivedDataForcesAndSourcesCore::DerivedEntData;

  for (int tt = MBVERTEX; tt != MBMAXTYPE; ++tt) {
    auto &ent_data = data_ptr->dataOnEntities[tt];
    auto &derived_ent_data = derived_data->dataOnEntities[tt];
    for (auto &e : ent_data) {
      boost::shared_ptr<EntData> ent_data_ptr(data_ptr, &e);
      derived_ent_data.push_back(new DerivedEntData(ent_data_ptr));
    }
  }
}

dEterminant()

template<class T >

static double MoFEM::dEterminant ( T &  t )

static

Calculate the determinant of a 3x3 matrix or a tensor of rank 2.

Template Parameters

T

Parameters

t

Returns

double

Examples

EshelbianOperators.cpp, and EshelbianPlasticity.cpp.

Definition at line 334 of file Templates.hpp.

                                                          {
  return t(0, 0) * t(1, 1) * t(2, 2) + t(1, 0) * t(2, 1) * t(0, 2) +
         t(2, 0) * t(0, 1) * t(1, 2) - t(0, 0) * t(2, 1) * t(1, 2) -
         t(2, 0) * t(1, 1) * t(0, 2) - t(1, 0) * t(0, 1) * t(2, 2);
}

DMMoFEMGetDestroyProblem()

PetscErrorCode MoFEM::DMMoFEMGetDestroyProblem	(	DM	dm,
		PetscBool *	destroy_problem
	)

Get if problem will be destroyed with DM

Parameters

dm	the DM object
destroy	return if PETSC_TRUE problem is destroyed

Returns

error code

Definition at line 358 of file DMMMoFEM.cpp.

                                                                           {
  MoFEMFunctionBeginHot;
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBeginHot;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  *destroy_problem = dm_field->destroyProblem;
  MoFEMFunctionReturnHot(0);
}

DMMoFEMGetSubColIS()

PetscErrorCode MoFEM::DMMoFEMGetSubColIS	(	DM	dm,
		IS *	is
	)

get sub problem is

Parameters

dm	has to be created with DMMoFEMSetSquareProblem
is	return is on the row

Returns

error code

Returns IS with global indices of the DM used to create SubDM

Definition at line 260 of file DMMMoFEM.cpp.

                                                 {
  MoFEMFunctionBegin;
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBeginHot;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (dm_field->isSubDM != PETSC_TRUE) {
    SETERRQ(PETSC_COMM_SELF, MOFEM_NOT_IMPLEMENTED,
            "This DM is not created as a SubDM");
  }
  if (dm_field->isProblemBuild != PETSC_TRUE) {
    SETERRQ(PETSC_COMM_SELF, MOFEM_NOT_IMPLEMENTED, "Problem is not build");
  }
  boost::shared_ptr<Problem::SubProblemData> sub_data =
      dm_field->problemPtr->getSubData();
  CHKERR sub_data->getColIs(is);
  MoFEMFunctionReturn(0);
}

DMMoFEMGetSubRowIS()

PetscErrorCode MoFEM::DMMoFEMGetSubRowIS	(	DM	dm,
		IS *	is
	)

get sub problem is

Parameters

dm	has to be created with DMMoFEMSetSquareProblem
is	return is on the row

Returns

error code

Returns IS with global indices of the DM used to create SubDM

Examples

analytical_poisson_field_split.cpp.

Definition at line 242 of file DMMMoFEM.cpp.

                                                 {
  MoFEMFunctionBegin;
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBeginHot;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (dm_field->isSubDM != PETSC_TRUE) {
    SETERRQ(PETSC_COMM_SELF, MOFEM_NOT_IMPLEMENTED,
            "This DM is not created as a SubDM");
  }
  if (dm_field->isProblemBuild != PETSC_TRUE) {
    SETERRQ(PETSC_COMM_SELF, MOFEM_NOT_IMPLEMENTED, "Problem is not build");
  }
  boost::shared_ptr<Problem::SubProblemData> sub_data =
      dm_field->problemPtr->getSubData();
  CHKERR sub_data->getRowIs(is);
  MoFEMFunctionReturn(0);
}

DMMoFEMKSPSetComputeOperators()

template<class S , class T0 , class T1 , class T2 >

static PetscErrorCode MoFEM::DMMoFEMKSPSetComputeOperators ( DM  dm, S  fe_name, T0  method, T1  pre_only, T2  post_only  )

static

Definition at line 563 of file DMMMoFEM.cpp.

                                                                               {
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBegin;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (pre_only) {
    dm_field->kspCtx->get_preProcess_to_do_Mat().push_back(pre_only);
  }
  if (method) {
    dm_field->kspCtx->get_loops_to_do_Mat().push_back(
        PairNameFEMethodPtr(fe_name, method));
  }
  if (post_only) {
    dm_field->kspCtx->get_postProcess_to_do_Mat().push_back(post_only);
  }
  CHKERR DMKSPSetComputeOperators(dm, KspMat, dm_field->kspCtx.get());
  MoFEMFunctionReturn(0);
}

DMMoFEMKSPSetComputeRHS()

template<class S , class T0 , class T1 , class T2 >

static PetscErrorCode MoFEM::DMMoFEMKSPSetComputeRHS ( DM  dm, S  fe_name, T0  method, T1  pre_only, T2  post_only  )

static

Definition at line 522 of file DMMMoFEM.cpp.

                                                                         {
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBegin;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (pre_only) {
    dm_field->kspCtx->get_preProcess_to_do_Rhs().push_back(pre_only);
  }
  if (method) {
    dm_field->kspCtx->get_loops_to_do_Rhs().push_back(
        PairNameFEMethodPtr(fe_name, method));
  }
  if (post_only) {
    dm_field->kspCtx->get_postProcess_to_do_Rhs().push_back(post_only);
  }
  CHKERR DMKSPSetComputeRHS(dm, KspRhs, dm_field->kspCtx.get());
  MoFEMFunctionReturn(0);
}

DMMoFEMSetDestroyProblem()

PetscErrorCode MoFEM::DMMoFEMSetDestroyProblem	(	DM	dm,
		PetscBool	destroy_problem
	)

If this is set to PETSC_TRUE problem is deleted with DM

Parameters

dm	the DM object
destroy	if PETSC_TRUE problem is destroyed

Returns

error code

Examples

EshelbianPlasticity.cpp.

Definition at line 349 of file DMMMoFEM.cpp.

                                                                          {
  MoFEMFunctionBeginHot;
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBeginHot;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  dm_field->destroyProblem = destroy_problem;
  MoFEMFunctionReturnHot(0);
}

DMMoFEMSetVerbosity()

PetscErrorCode MoFEM::DMMoFEMSetVerbosity	(	DM	dm,
		const int	verb
	)

Set verbosity level.

Parameters

dm
verb	see VERBOSITY_LEVELS for list of the levels

Returns

PetscErrorCode

Definition at line 1155 of file DMMMoFEM.cpp.

                                                          {
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBeginHot;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  dm_field->verbosity = verb;
  MoFEMFunctionReturnHot(0);
}

DMMoFEMSNESSetFunction()

template<class S , class T0 , class T1 , class T2 >

static PetscErrorCode MoFEM::DMMoFEMSNESSetFunction ( DM  dm, S  fe_name, T0  method, T1  pre_only, T2  post_only  )

static

Definition at line 603 of file DMMMoFEM.cpp.

                                                                        {
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBegin;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (pre_only) {
    dm_field->snesCtx->get_preProcess_to_do_Rhs().push_back(pre_only);
  }
  if (method) {
    dm_field->snesCtx->get_loops_to_do_Rhs().push_back(
        PairNameFEMethodPtr(fe_name, method));
  }
  if (post_only) {
    dm_field->snesCtx->get_postProcess_to_do_Rhs().push_back(post_only);
  }
  CHKERR DMSNESSetFunction(dm, SnesRhs, dm_field->snesCtx.get());
  MoFEMFunctionReturn(0);
}

DMMoFEMSNESSetJacobian()

template<class S , class T0 , class T1 , class T2 >

static PetscErrorCode MoFEM::DMMoFEMSNESSetJacobian ( DM  dm, S  fe_name, T0  method, T1  pre_only, T2  post_only  )

static

Definition at line 644 of file DMMMoFEM.cpp.

                                                                        {
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBegin;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (pre_only) {
    dm_field->snesCtx->get_preProcess_to_do_Mat().push_back(pre_only);
  }
  if (method) {
    dm_field->snesCtx->get_loops_to_do_Mat().push_back(
        PairNameFEMethodPtr(fe_name, method));
  }
  if (post_only) {
    dm_field->snesCtx->get_postProcess_to_do_Mat().push_back(post_only);
  }
  CHKERR DMSNESSetJacobian(dm, SnesMat, dm_field->snesCtx.get());
  MoFEMFunctionReturn(0);
}

DMMoFEMTSSetIFunction()

template<class S , class T0 , class T1 , class T2 >

static PetscErrorCode MoFEM::DMMoFEMTSSetIFunction ( DM  dm, S  fe_name, T0  method, T1  pre_only, T2  post_only  )

static

Definition at line 685 of file DMMMoFEM.cpp.

                                                                       {
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBegin;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (pre_only) {
    dm_field->tsCtx->get_preProcess_to_do_IFunction().push_back(pre_only);
  }
  if (method) {
    dm_field->tsCtx->get_loops_to_do_IFunction().push_back(
        PairNameFEMethodPtr(fe_name, method));
  }
  if (post_only) {
    dm_field->tsCtx->get_postProcess_to_do_IFunction().push_back(post_only);
  }
  CHKERR DMTSSetIFunction(dm, TsSetIFunction, dm_field->tsCtx.get());
  MoFEMFunctionReturn(0);
}

DMMoFEMTSSetIJacobian()

template<class S , class T0 , class T1 , class T2 >

static PetscErrorCode MoFEM::DMMoFEMTSSetIJacobian ( DM  dm, S  fe_name, T0  method, T1  pre_only, T2  post_only  )

static

Definition at line 728 of file DMMMoFEM.cpp.

                                                                       {
  PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
  MoFEMFunctionBegin;
  DMCtx *dm_field = static_cast<DMCtx *>(dm->data);
  if (pre_only) {
    dm_field->tsCtx->get_preProcess_to_do_IJacobian().push_back(pre_only);
  }
  if (method) {
    dm_field->tsCtx->get_loops_to_do_IJacobian().push_back(
        PairNameFEMethodPtr(fe_name, method));
  }
  if (post_only) {
    dm_field->tsCtx->get_postProcess_to_do_IJacobian().push_back(post_only);
  }
  CHKERR DMTSSetIJacobian(dm, TsSetIJacobian, dm_field->tsCtx.get());
  MoFEMFunctionReturn(0);
}

fNBEDGE_AINSWORTH_HCURL()

int MoFEM::fNBEDGE_AINSWORTH_HCURL

(

int

P

)

Definition at line 61 of file CoreDataStructures.hpp.

{ return NBEDGE_AINSWORTH_HCURL(P); }

fNBEDGE_DEMKOWICZ_HCURL()

int MoFEM::fNBEDGE_DEMKOWICZ_HCURL

(

int

P

)

Definition at line 69 of file CoreDataStructures.hpp.

{ return NBEDGE_DEMKOWICZ_HCURL(P); }

fNBEDGE_H1()

int MoFEM::fNBEDGE_H1

(

int

P

)

number of approx. functions for H1 space on edge

Definition at line 48 of file CoreDataStructures.hpp.

{ return NBEDGE_H1(P); }

fNBEDGE_HDIV()

int MoFEM::fNBEDGE_HDIV

(

int

P

)

number of approx. functions for HDIV space on edge

Definition at line 85 of file CoreDataStructures.hpp.

                               {
  (void)P;
  return NBEDGE_HDIV(P);
}

fNBEDGE_L2()

int MoFEM::fNBEDGE_L2

(

int

P

)

Definition at line 43 of file CoreDataStructures.hpp.

{ return NBEDGE_L2(P); }

fNBENTITY_GENERIC()

int MoFEM::fNBENTITY_GENERIC

(

int

P

)

Definition at line 28 of file CoreDataStructures.hpp.

                                    {
  (void)P;
  return 0;
}

fNBENTITYSET_NOFIELD()

int MoFEM::fNBENTITYSET_NOFIELD

(

int

P

)

Definition at line 32 of file CoreDataStructures.hpp.

                                       {
  (void)P;
  return 1;
}

fNBFACEQUAD_H1()

int MoFEM::fNBFACEQUAD_H1

(

int

P

)

Definition at line 51 of file CoreDataStructures.hpp.

{ return NBFACEQUAD_H1(P); }

fNBFACETRI_AINSWORTH_HCURL()

int MoFEM::fNBFACETRI_AINSWORTH_HCURL

(

int

P

)

Definition at line 62 of file CoreDataStructures.hpp.

                                             {
  return NBFACETRI_AINSWORTH_HCURL(P);
}

fNBFACETRI_AINSWORTH_HDIV()

int MoFEM::fNBFACETRI_AINSWORTH_HDIV

(

int

P

)

number of approx. functions for HDIV space on face

Definition at line 90 of file CoreDataStructures.hpp.

                                            {
  return NBFACETRI_AINSWORTH_HDIV(P);
}

fNBFACETRI_DEMKOWICZ_HCURL()

int MoFEM::fNBFACETRI_DEMKOWICZ_HCURL

(

int

P

)

Definition at line 70 of file CoreDataStructures.hpp.

                                             {
  return NBFACETRI_DEMKOWICZ_HCURL(P);
}

fNBFACETRI_DEMKOWICZ_HDIV()

int MoFEM::fNBFACETRI_DEMKOWICZ_HDIV

(

int

P

)

Definition at line 98 of file CoreDataStructures.hpp.

                                            {
  return NBFACETRI_DEMKOWICZ_HDIV(P);
}

fNBFACETRI_H1()

int MoFEM::fNBFACETRI_H1

(

int

P

)

number of approx. functions for H1 space on face

Definition at line 50 of file CoreDataStructures.hpp.

{ return NBFACETRI_H1(P); }

fNBFACETRI_L2()

int MoFEM::fNBFACETRI_L2

(

int

P

)

Definition at line 42 of file CoreDataStructures.hpp.

{ return NBFACETRI_L2(P); }

fNBVERTEX_H1()

int MoFEM::fNBVERTEX_H1

(

int

P

)

number of approx. functions for H1 space on vertex

Definition at line 46 of file CoreDataStructures.hpp.

{ return (P == 1) ? 1 : 0; }

fNBVERTEX_HCURL()

int MoFEM::fNBVERTEX_HCURL

(

int

P

)

number of approx. functions for HCURL space on vertex

Definition at line 57 of file CoreDataStructures.hpp.

                                  {
  (void)P;
  return 0;
}

fNBVERTEX_HDIV()

int MoFEM::fNBVERTEX_HDIV

(

int

P

)

number of approx. functions for HDIV space on vertex

zero number of digrees of freedom on vertex for that space

Definition at line 80 of file CoreDataStructures.hpp.

                                 {
  (void)P;
  return 0;
}

fNBVERTEX_L2()

int MoFEM::fNBVERTEX_L2

(

int

P

)

Definition at line 37 of file CoreDataStructures.hpp.

                               {
  (void)P;
  return 0;
}

fNBVOLUMEPRISM_H1()

int MoFEM::fNBVOLUMEPRISM_H1

(

int

P

)

Definition at line 54 of file CoreDataStructures.hpp.

{ return NBVOLUMEPRISM_H1(P); }

fNBVOLUMETET_AINSWORTH_HCURL()

int MoFEM::fNBVOLUMETET_AINSWORTH_HCURL

(

int

P

)

Definition at line 65 of file CoreDataStructures.hpp.

                                               {
  return NBVOLUMETET_AINSWORTH_HCURL(P);
}

fNBVOLUMETET_AINSWORTH_HDIV()

int MoFEM::fNBVOLUMETET_AINSWORTH_HDIV

(

int

P

)

number of approx. functions for HDIV space on volume

Definition at line 94 of file CoreDataStructures.hpp.

                                              {
  return NBVOLUMETET_AINSWORTH_HDIV(P);
}

fNBVOLUMETET_DEMKOWICZ_HCURL()

int MoFEM::fNBVOLUMETET_DEMKOWICZ_HCURL

(

int

P

)

Definition at line 73 of file CoreDataStructures.hpp.

                                               {
  return NBVOLUMETET_DEMKOWICZ_HCURL(P);
}

fNBVOLUMETET_DEMKOWICZ_HDIV()

int MoFEM::fNBVOLUMETET_DEMKOWICZ_HDIV

(

int

P

)

number of approx. functions for HDIV space on volume

Definition at line 102 of file CoreDataStructures.hpp.

                                              {
  return NBVOLUMETET_DEMKOWICZ_HDIV(P);
}

fNBVOLUMETET_H1()

int MoFEM::fNBVOLUMETET_H1

(

int

P

)

number of approx. functions for H1 space on volume

Definition at line 53 of file CoreDataStructures.hpp.

{ return NBVOLUMETET_H1(P); }

fNBVOLUMETET_L2()

int MoFEM::fNBVOLUMETET_L2

(

int

P

)

Definition at line 41 of file CoreDataStructures.hpp.

{ return NBVOLUMETET_L2(P); }

get_porblem_col_indices()

static MoFEMErrorCode MoFEM::get_porblem_col_indices ( const ForcesAndSourcesCore *  fe_ptr, const EntityType  type, const int  side, const std::string  field_name, VectorInt &  indices  )

static

Definition at line 1095 of file ForcesAndSourcesCore.cpp.

                                                                        {
  MoFEMFunctionBegin;
  switch (type) {
  case MBVERTEX:
    CHKERR fe_ptr->getProblemNodesColIndices(field_name, indices);
    break;
  default:
    CHKERR fe_ptr->getProblemTypeColIndices(field_name, type, side, indices);
  }
  MoFEMFunctionReturn(0);
}

get_porblem_row_indices()

static MoFEMErrorCode MoFEM::get_porblem_row_indices ( const ForcesAndSourcesCore *  fe_ptr, const EntityType  type, const int  side, const std::string  field_name, VectorInt &  indices  )

static

Definition at line 1080 of file ForcesAndSourcesCore.cpp.

                                                                        {
  MoFEMFunctionBegin;
  switch (type) {
  case MBVERTEX:
    CHKERR fe_ptr->getProblemNodesRowIndices(field_name, indices);
    break;
  default:
    CHKERR fe_ptr->getProblemTypeRowIndices(field_name, type, side, indices);
  }
  MoFEMFunctionReturn(0);
}

get_sub_iface_options_imp() [1/2]

template<class T >

static auto MoFEM::get_sub_iface_options_imp ( T *const  ptr, int    ) -> decltype(ptr->getSubInterfaceOptions())

static

Definition at line 72 of file Core.cpp.

                                               {
  return ptr->getSubInterfaceOptions();
};

get_sub_iface_options_imp() [2/2]

template<class T >

static auto MoFEM::get_sub_iface_options_imp ( T *const  ptr, long    ) -> MoFEMErrorCode

static

Definition at line 80 of file Core.cpp.

                                                                            {
  return 0;
};

get_tag_ptr()

void* MoFEM::get_tag_ptr	(	moab::Interface &	moab,
		Tag	th,
		EntityHandle	ent,
		int *	tag_size
	)

Definition at line 26 of file EntsMultiIndices.cpp.

                                        {
  ApproximationOrder *ret_val;
  rval = moab.tag_get_by_ptr(th, &ent, 1, (const void **)&ret_val, tag_size);
  if (rval != MB_SUCCESS) {
    *tag_size = 0;
    return NULL;
  } else {
    return ret_val;
  }
}

get_value()

template<class TYPE >

static MoFEMErrorCode MoFEM::get_value ( MatrixDouble &  pts_x, MatrixDouble &  pts_t, TYPE *  ctx  )

static

Definition at line 53 of file JacobiPolynomial.cpp.

                                           {
  MoFEMFunctionBeginHot;
  ctx->baseFunPtr->resize(pts_x.size2(), ctx->P + 1, false);
  ctx->baseDiffFunPtr->resize(pts_x.size2(), ctx->dIm * (ctx->P + 1), false);
  if (pts_x.size1() != pts_t.size1() || pts_x.size2() != pts_t.size2()) {
    SETERRQ(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
            "Inconsistent size of arguments");
  }
  double *l = NULL;
  double *diff_l = NULL;
  for (unsigned int gg = 0; gg < pts_x.size2(); gg++) {
    if (ctx->baseFunPtr)
      l = &((*ctx->baseFunPtr)(gg, 0));
    if (ctx->baseDiffFunPtr)
      diff_l = &((*ctx->baseDiffFunPtr)(gg, 0));
    ierr = (ctx->basePolynomialsType1)(ctx->P, ctx->aLpha, pts_x(0, gg),
                                       pts_t(0, gg), ctx->diffX, ctx->diffT, l,
                                       diff_l, ctx->dIm);
    CHKERRG(ierr);
  }
  MoFEMFunctionReturnHot(0);
}

getFTensor0FromVec< double, DoubleAllocator >()

template<>

FTensor::Tensor0<FTensor::PackPtr<double *, 1> > MoFEM::getFTensor0FromVec< double, DoubleAllocator >

(

ublas::vector< double, DoubleAllocator > &

data

)

Deprecated:

Name change to getFTensor0FromVec

Definition at line 158 of file Templates.hpp.

                                                {
  return FTensor::Tensor0<FTensor::PackPtr<double *, 1>>(&*data.data().begin());
}

getFTensor1FromMat< 2, double, ublas::row_major, DoubleAllocator >()

template<>

FTensor::Tensor1<FTensor::PackPtr<double *, 1>, 2> MoFEM::getFTensor1FromMat< 2, double, ublas::row_major, DoubleAllocator >

(

MatrixDouble &

data

)

Definition at line 197 of file Templates.hpp.

                        {
  if (data.size1() != 2) {
    THROW_MESSAGE("Wrong size of data matrix");
  }
  return FTensor::Tensor1<FTensor::PackPtr<double *, 1>, 2>(&data(0, 0),
                                                            &data(1, 0));
}

getFTensor1FromMat< 3, double, ublas::row_major, DoubleAllocator >()

template<>

FTensor::Tensor1<FTensor::PackPtr<double *, 1>, 3> MoFEM::getFTensor1FromMat< 3, double, ublas::row_major, DoubleAllocator >

(

MatrixDouble &

data

)

Definition at line 186 of file Templates.hpp.

                        {
  if (data.size1() != 3) {
    THROW_MESSAGE("Wrong size of data matrix");
  }
  return FTensor::Tensor1<FTensor::PackPtr<double *, 1>, 3>(
      &data(0, 0), &data(1, 0), &data(2, 0));
}

getFTensor2FromMat()

template<>

FTensor::Tensor2<FTensor::PackPtr<double *, 1>, 3, 2> MoFEM::getFTensor2FromMat

(

MatrixDouble &

data

)

Template specialization for getFTensor2FromMat

Definition at line 249 of file Templates.hpp.

                                       {
  if (data.size1() != 6) {
    THROW_MESSAGE("Wrong size of data matrix");
  }
  return FTensor::Tensor2<FTensor::PackPtr<double *, 1>, 3, 2>(
      &data(0, 0), &data(1, 0), &data(2, 0), &data(3, 0), &data(4, 0),
      &data(5, 0));
}

getFTensor2SymmetricFromMat() [1/2]

template<>

FTensor::Tensor2_symmetric<FTensor::PackPtr<double *, 1>, 3> MoFEM::getFTensor2SymmetricFromMat

(

MatrixDouble &

data

)

Get symmetric tensor rank 2 form matrix of for dimension 3.

Specialisation for symmetric tensor 2

Template Parameters

Definition at line 301 of file Templates.hpp.

                                                {
  if (data.size1() != 6) {
    THROW_MESSAGE("Wrong size of data matrix");
  }
  return FTensor::Tensor2_symmetric<FTensor::PackPtr<double *, 1>, 3>(
      &data(0, 0), &data(1, 0), &data(2, 0), &data(3, 0), &data(4, 0),
      &data(5, 0));
}

getFTensor2SymmetricFromMat() [2/2]

template<int Tensor_Dim>

static FTensor::Tensor2_symmetric<FTensor::PackPtr<double *, 1>, Tensor_Dim> MoFEM::getFTensor2SymmetricFromMat ( MatrixDouble &  data )

static

Get symmetric tensor rank 2 form matrix.

Specialisation for symmetric tensor 2

Template Parameters

Tensor_Dim

Parameters

data

Returns

FTensor::Tensor2_symmetric<FTensor::PackPtr<double *, 1>, Tensor_Dim>

Definition at line 322 of file Templates.hpp.

                                                {
  return getFTensor2SymmetricFromMat<Tensor_Dim, double, ublas::row_major,
                                     DoubleAllocator>(data);
}

getMatrixAdaptor()

template<typename T1 >

auto MoFEM::getMatrixAdaptor	(	T1	ptr,
		const size_t	n,
		const size_t	m
	)

Get Matrix adaptor.

double *a;
CHKERR VecGetArray(v,&a);

for(int n = 0; n != nodes; ++n) {

  auto F = getMatrixAdaptor(&a[3*3*n], 3, 3);
  MatrixDouble C = prod(F, trans(F));

}

CHKERR VecRetsoreArray(v,&a);

Examples

field_evaluator.cpp.

Definition at line 69 of file Templates.hpp.

                                                                     {
  typedef typename std::remove_pointer<T1>::type T;
  return MatrixShallowArrayAdaptor<T>(
      n, m, ublas::shallow_array_adaptor<T>(n * m, ptr));
};

getMaxOrder()

template<typename ENTMULTIINDEX >

static int MoFEM::getMaxOrder ( const ENTMULTIINDEX &  multi_index )

static

Definition at line 127 of file ForcesAndSourcesCore.cpp.

                                                                {
  int max_order = 0;
  for (auto ent_field_weak_ptr : multi_index)
    if (auto e = ent_field_weak_ptr.lock()) {
      const int order = e->getMaxOrder();
      max_order = (max_order < order) ? order : max_order;
    }
  return max_order;
}

getParentEnt()

MoFEMErrorCode MoFEM::getParentEnt	(	moab::Interface &	moab,
		Range	ents,
		std::vector< EntityHandle >	vec_patent_ent
	)

Definition at line 98 of file EntsMultiIndices.cpp.

                                                                    {

  MoFEMFunctionBegin;
  Tag th_ref_parent_handle;
  CHKERR moab.tag_get_handle("_RefParentHandle", th_ref_parent_handle);
  vec_patent_ent.resize(ents.size());
  CHKERR moab.tag_get_data(th_ref_parent_handle, ents,
                           &*vec_patent_ent.begin());
  MoFEMFunctionReturn(0);
}

getPetscObject()

template<typename T >

PetscObject MoFEM::getPetscObject

(

T

obj

)

Definition at line 23 of file AuxPETSc.hpp.

                                                               {
  return reinterpret_cast<PetscObject>(obj);
}

getVectorAdaptor()

template<typename T1 >

auto MoFEM::getVectorAdaptor	(	T1	ptr,
		const size_t	n
	)

Get Vector adaptor.

double *a;
CHKERR VecGetArray(v,&a);

for(int n = 0; n != nodes; ++n) {

  auto a = getVectorAdaptor(&a[3*n], 3);
  double dot = inner_prod(a, a);

}

CHKERR VecRetsoreArray(v,&a);

Examples

EshelbianPlasticity.cpp.

Definition at line 43 of file Templates.hpp.

                                                     {
  typedef typename std::remove_pointer<T1>::type T;
  return VectorShallowArrayAdaptor<T>(n,
                                      ublas::shallow_array_adaptor<T>(n, ptr));
};

Hcurl_Ainsworth_BubbleFaceFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_BubbleFaceFunctions_MBTET	(	int *	faces_nodes,
		int *	p,
		double *	N,
		double *	diffN,
		double *	phi_f[4],
		double *	diff_phi_f[4],
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Face edge base functions of Hcurl space on face on tetrahedral.

On each face we have P*(P-1) base functions and are 4 faces.

See NBFACETRI_AINSWORTH_EDGE_HCURL

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
N	array shape functions evaluated at each integration point
diffN	derivatives of nodal shape functions
phi_f[4]	calculated shape functions for each face
diff_phi_v[4]	derivatives of shape functions for each face
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 540 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 3> j;

  // double coords[] = { 0,0,0, 1,0,0, 0,1,0, 0,0,1 };
  // FTensor::Tensor1<double*,3> t_coords[4] = {
  //   FTensor::Tensor1<double*,3>(&coords[0],&coords[ 1],&coords[ 2]),
  //   FTensor::Tensor1<double*,3>(&coords[3],&coords[ 4],&coords[ 5]),
  //   FTensor::Tensor1<double*,3>(&coords[6],&coords[ 7],&coords[ 8]),
  //   FTensor::Tensor1<double*,3>(&coords[9],&coords[10],&coords[11])
  // };
  FTensor::Tensor1<double *, 3> t_node_diff_ksi[4] = {
      FTensor::Tensor1<double *, 3>(&diffN[0], &diffN[1], &diffN[2]),
      FTensor::Tensor1<double *, 3>(&diffN[3], &diffN[4], &diffN[5]),
      FTensor::Tensor1<double *, 3>(&diffN[6], &diffN[7], &diffN[8]),
      FTensor::Tensor1<double *, 3>(&diffN[9], &diffN[10], &diffN[11])};
  FTensor::Tensor1<double, 3> t_diff_ksi0i, t_diff_ksi0j;
  FTensor::Tensor1<double, 3> diff_beta_0ij;

  FTensor::Tensor1<double, 3> tou_0i;
  FTensor::Tensor1<double, 3> tou_0j;

  for (int ff = 0; ff != 4; ff++) {

    if (NBFACETRI_AINSWORTH_FACE_HCURL(p[ff]) == 0)
      continue;

    int n0 = faces_nodes[3 * ff + 0];
    int n1 = faces_nodes[3 * ff + 1];
    int n2 = faces_nodes[3 * ff + 2];

    // tou_0i(i) = t_coords[n1](i)-t_coords[n0](i);
    // tou_0j(i) = t_coords[n2](i)-t_coords[n0](i);
    tou_0i(i) = t_node_diff_ksi[n1](i) - t_node_diff_ksi[n0](i);
    tou_0j(i) = t_node_diff_ksi[n2](i) - t_node_diff_ksi[n0](i);

    t_diff_ksi0i(i) = t_node_diff_ksi[n1](i) - t_node_diff_ksi[n0](i);
    t_diff_ksi0j(i) = t_node_diff_ksi[n2](i) - t_node_diff_ksi[n0](i);

    double psi_l_0i[p[ff] + 1], diff_psi_l_0i[3 * p[ff] + 3];
    double psi_l_0j[p[ff] + 1], diff_psi_l_0j[3 * p[ff] + 3];

    FTensor::Tensor1<double *, 3> t_phi_f(&phi_f[ff][0], &phi_f[ff][1],
                                          &phi_f[ff][2], 3);
    FTensor::Tensor2<double *, 3, 3> t_diff_phi_f(
        &diff_phi_f[ff][0], &diff_phi_f[ff][3], &diff_phi_f[ff][6],
        &diff_phi_f[ff][1], &diff_phi_f[ff][4], &diff_phi_f[ff][7],
        &diff_phi_f[ff][2], &diff_phi_f[ff][5], &diff_phi_f[ff][8], 9);
    FTensor::Tensor1<double, 3> t_b;

    for (int ii = 0; ii != nb_integration_pts; ii++) {

      const int node_shift = ii * 4;
      const double beta_0ij =
          N[node_shift + n0] * N[node_shift + n1] * N[node_shift + n2];
      diff_beta_0ij(i) =
          t_node_diff_ksi[n0](i) * N[node_shift + n1] * N[node_shift + n2] +
          N[node_shift + n0] * t_node_diff_ksi[n1](i) * N[node_shift + n2] +
          N[node_shift + n0] * N[node_shift + n1] * t_node_diff_ksi[n2](i);

      const double ksi_0i = N[node_shift + n1] - N[node_shift + n0];
      ierr = base_polynomials(p[ff], ksi_0i, &t_diff_ksi0i(0), psi_l_0i,
                              diff_psi_l_0i, 3);
      CHKERRG(ierr);
      const double ksi_0j = N[node_shift + n2] - N[node_shift + n0];
      ierr = base_polynomials(p[ff], ksi_0j, &t_diff_ksi0j(0), psi_l_0j,
                              diff_psi_l_0j, 3);
      CHKERRG(ierr);

      int cc = 0;
      for (int oo = 0; oo <= (p[ff] - 3); oo++) {
        FTensor::Tensor1<double *, 3> t_diff_psi_l_0i(
            &diff_psi_l_0i[0], &diff_psi_l_0i[p[ff] + 1],
            &diff_psi_l_0i[2 * p[ff] + 2], 1);
        for (int pp0 = 0; pp0 <= oo; pp0++) {
          const int pp1 = oo - pp0;
          if (pp1 >= 0) {
            FTensor::Tensor1<double *, 3> t_diff_psi_l_0j(
                &diff_psi_l_0j[pp1], &diff_psi_l_0j[p[ff] + 1 + pp1],
                &diff_psi_l_0j[2 * p[ff] + 2 + pp1], 1);
            // base functions
            const double a = beta_0ij * psi_l_0i[pp0] * psi_l_0j[pp1];
            t_phi_f(i) = a * tou_0i(i);
            ++t_phi_f;
            ++cc;
            t_phi_f(i) = a * tou_0j(i);
            ++t_phi_f;
            ++cc;
            // diff base functions
            t_b(j) = diff_beta_0ij(j) * psi_l_0i[pp0] * psi_l_0j[pp1] +
                     beta_0ij * t_diff_psi_l_0i(j) * psi_l_0j[pp1] +
                     beta_0ij * psi_l_0i[pp0] * t_diff_psi_l_0j(j);
            t_diff_phi_f(i, j) = t_b(j) * tou_0i(i);
            ++t_diff_phi_f;
            t_diff_phi_f(i, j) = t_b(j) * tou_0j(i);
            ++t_diff_phi_f;
            ++t_diff_psi_l_0i;
          }
        }
      }
      const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_FACE_HCURL(p[ff]);
      if (cc != nb_base_fun_on_face) {
        SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
                 "Wrong number of base functions %d != %d", cc,
                 nb_base_fun_on_face);
      }
    }
  }
  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_BubbleFaceFunctions_MBTET_ON_FACE()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_BubbleFaceFunctions_MBTET_ON_FACE	(	int *	faces_nodes,
		int	p,
		double *	N,
		double *	diffN,
		double *	phi_f,
		double *	diff_phi_f,
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Face edge base functions of Hcurl space on face.

On each face we have P*(P-1) base functions and are 4 faces.

See NBFACETRI_AINSWORTH_EDGE_HCURL

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
N	array shape functions evaluated at each integration point
diffN	derivatives of nodal shape functions
phi_f[4]	calculated shape functions for each face
diff_phi_v[4]	derivatives of shape functions for each face
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 659 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  double zero = 0;
  FTensor::Tensor2<double *, 3, 3> t_node_diff_ksi(&diffN[0], &diffN[1], &zero,
                                                   &diffN[2], &diffN[3], &zero,
                                                   &diffN[4], &diffN[5], &zero);

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 2> j;

  if (NBFACETRI_AINSWORTH_FACE_HCURL(p) == 0)
    MoFEMFunctionReturnHot(0);

  FTensor::Number<0> N0;
  FTensor::Number<1> N1;
  FTensor::Number<2> N2;

  const int node0 = faces_nodes[0];
  const int node1 = faces_nodes[1];
  const int node2 = faces_nodes[2];

  FTensor::Tensor1<double, 3> tou_0i;
  FTensor::Tensor1<double, 3> tou_0j;

  tou_0i(i) = t_node_diff_ksi(N1, i) - t_node_diff_ksi(N0, i);
  ;
  tou_0j(i) = t_node_diff_ksi(N2, i) - t_node_diff_ksi(N0, i);
  ;

  double psi_l_0i[p + 1], psi_l_0j[p + 1];
  double diff_psi_l_0i[2 * p + 2], diff_psi_l_0j[2 * p + 2];
  FTensor::Tensor1<double *, 3> t_phi_f(&phi_f[0], &phi_f[1], &phi_f[2], 3);
  FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2> t_diff_phi_f(
      &diff_phi_f[HVEC0_0], &diff_phi_f[HVEC0_1], &diff_phi_f[HVEC1_0],
      &diff_phi_f[HVEC1_1], &diff_phi_f[HVEC2_0], &diff_phi_f[HVEC2_1]);

  double diff_ksi_0i[] = {t_node_diff_ksi(node1, 0) - t_node_diff_ksi(node0, 0),
                          t_node_diff_ksi(node1, 1) -
                              t_node_diff_ksi(node0, 1)};
  double diff_ksi_0j[] = {t_node_diff_ksi(node2, 0) - t_node_diff_ksi(node0, 0),
                          t_node_diff_ksi(node2, 1) -
                              t_node_diff_ksi(node0, 1)};

  for (int ii = 0; ii != nb_integration_pts; ii++) {

    const int node_shift = ii * 3;
    const double n0 = N[node_shift + node0];
    const double n1 = N[node_shift + node1];
    const double n2 = N[node_shift + node2];

    const double beta_0ij = n0 * n1 * n2;
    FTensor::Tensor1<double, 2> diff_beta_0ij(
        t_node_diff_ksi(node0, 0) * n1 * n2 +
            n0 * t_node_diff_ksi(node1, 0) * n2 +
            n0 * n1 * t_node_diff_ksi(node2, 0),
        t_node_diff_ksi(node0, 1) * n1 * n2 +
            n0 * t_node_diff_ksi(node1, 1) * n2 +
            n0 * n1 * t_node_diff_ksi(node2, 1));

    const double ksi_0i = N[node_shift + node1] - N[node_shift + node0];
    ierr = base_polynomials(p, ksi_0i, diff_ksi_0i, psi_l_0i, diff_psi_l_0i, 2);
    CHKERRG(ierr);
    const double ksi_0j = N[node_shift + node2] - N[node_shift + node0];
    ierr = base_polynomials(p, ksi_0j, diff_ksi_0j, psi_l_0j, diff_psi_l_0j, 2);
    CHKERRG(ierr);

    int cc = 0;
    FTensor::Tensor1<double, 2> t_diff_a;
    for (int oo = 0; oo <= (p - 3); oo++) {
      for (int pp0 = 0; pp0 <= oo; pp0++) {
        const int pp1 = oo - pp0;
        if (pp1 >= 0) {
          FTensor::Tensor1<double, 2> t_diff_psi_l_0i(
              diff_psi_l_0i[0 + pp0], diff_psi_l_0i[p + 1 + pp0]);
          FTensor::Tensor1<double, 2> t_diff_psi_l_0j(
              diff_psi_l_0j[0 + pp1], diff_psi_l_0j[p + 1 + pp1]);
          const double a = beta_0ij * psi_l_0i[pp0] * psi_l_0j[pp1];
          t_diff_a(j) = diff_beta_0ij(j) * psi_l_0i[pp0] * psi_l_0j[pp1] +
                        beta_0ij * psi_l_0i[pp0] * t_diff_psi_l_0j(j) +
                        beta_0ij * psi_l_0j[pp1] * t_diff_psi_l_0i(j);

          t_phi_f(i) = a * tou_0i(i);
          t_diff_phi_f(i, j) = tou_0i(i) * t_diff_a(j);
          ++t_phi_f;
          ++t_diff_phi_f;
          ++cc;
          t_phi_f(i) = a * tou_0j(i);
          t_diff_phi_f(i, j) = tou_0j(i) * t_diff_a(j);
          ++t_phi_f;
          ++t_diff_phi_f;
          ++cc;
        }
      }
    }

    const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_FACE_HCURL(p);
    if (cc != nb_base_fun_on_face) {
      SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
               "Wrong number of base functions %d != %d", cc,
               nb_base_fun_on_face);
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET	(	int *	faces_nodes,
		int *	p,
		double *	N,
		double *	diffN,
		double *	phi_f_e[4][3],
		double *	diff_phi_f_e[4][3],
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Face edge base functions of Hcurl space on tetrahedral.

On each edge we have (P-1) base functions, and each face has 3 edges and are 4 faces on tetrahedral.

See NBFACETRI_AINSWORTH_EDGE_HCURL

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
N	array shape functions evaluated at each integration point
diffN	derivatives of nodal shape functions
phi_f[4]	calculated shape functions for each face
diff_phi_v[4]	derivatives of shape functions for each face
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 359 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;
  const int edges[3][2] = {{0, 1}, {1, 2}, {2, 0}};

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 3> j;

  FTensor::Tensor1<double *, 3> t_node_diff_ksi[4] = {
      FTensor::Tensor1<double *, 3>(&diffN[0], &diffN[1], &diffN[2]),
      FTensor::Tensor1<double *, 3>(&diffN[3], &diffN[4], &diffN[5]),
      FTensor::Tensor1<double *, 3>(&diffN[6], &diffN[7], &diffN[8]),
      FTensor::Tensor1<double *, 3>(&diffN[9], &diffN[10], &diffN[11])};
  FTensor::Tensor1<double, 3> t_edge_diff_ksi;
  FTensor::Tensor1<double, 3> t_diff_beta_e;

  for (int ff = 0; ff != 4; ff++) {

    const int o_nodes[3] = {faces_nodes[3 * ff + 2], faces_nodes[3 * ff + 0],
                            faces_nodes[3 * ff + 1]};
    FTensor::Tensor1<double *, 3> t_opposite_node_diff[3] = {
        FTensor::Tensor1<double *, 3>(&diffN[3 * o_nodes[0] + 0],
                                      &diffN[3 * o_nodes[0] + 1],
                                      &diffN[3 * o_nodes[0] + 2]),
        FTensor::Tensor1<double *, 3>(&diffN[3 * o_nodes[1] + 0],
                                      &diffN[3 * o_nodes[1] + 1],
                                      &diffN[3 * o_nodes[1] + 2]),
        FTensor::Tensor1<double *, 3>(&diffN[3 * o_nodes[2] + 0],
                                      &diffN[3 * o_nodes[2] + 1],
                                      &diffN[3 * o_nodes[2] + 2])};
    double psi_l[p[ff] + 1], diff_psi_l[3 * p[ff] + 3];

    const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_EDGE_HCURL(p[ff]);
    // cerr << nb_base_fun_on_face << " " << p[ff] << endl;
    if (nb_base_fun_on_face == 0)
      continue;

    for (int ee = 0; ee != 3; ee++) {

      FTensor::Tensor1<double *, 3> t_face_edge_base(
          &phi_f_e[ff][ee][0], &phi_f_e[ff][ee][1], &phi_f_e[ff][ee][2], 3);
      FTensor::Tensor2<double *, 3, 3> t_diff_face_edge_base(
          &diff_phi_f_e[ff][ee][0], &diff_phi_f_e[ff][ee][3],
          &diff_phi_f_e[ff][ee][6], &diff_phi_f_e[ff][ee][1],
          &diff_phi_f_e[ff][ee][4], &diff_phi_f_e[ff][ee][7],
          &diff_phi_f_e[ff][ee][2], &diff_phi_f_e[ff][ee][5],
          &diff_phi_f_e[ff][ee][8], 9);
      const int en[] = {faces_nodes[3 * ff + edges[ee][0]],
                        faces_nodes[3 * ff + edges[ee][1]]};
      t_edge_diff_ksi(i) =
          t_node_diff_ksi[en[1]](i) - t_node_diff_ksi[en[0]](i);

      for (int ii = 0; ii != nb_integration_pts; ii++) {

        const int node_shift = ii * 4;
        const double n[] = {N[node_shift + faces_nodes[3 * ff + edges[ee][0]]],
                            N[node_shift + faces_nodes[3 * ff + edges[ee][1]]]};
        const double ksi_0i = n[1] - n[0];
        ierr = base_polynomials(p[ff], ksi_0i, &t_edge_diff_ksi(0), psi_l,
                                diff_psi_l, 3);
        CHKERRG(ierr);
        FTensor::Tensor1<double *, 3> t_diff_psi_l(
            &diff_psi_l[0], &diff_psi_l[p[ff] + 1], &diff_psi_l[2 * p[ff] + 2],
            1);

        const double beta_e = n[0] * n[1];
        t_diff_beta_e(j) =
            t_node_diff_ksi[en[0]](j) * n[1] + n[0] * t_node_diff_ksi[en[1]](j);

        for (int ll = 0; ll != nb_base_fun_on_face; ll++) {
          // if(ll == nb_base_fun_on_face-1) cerr << psi_l[ll] << endl;

          t_face_edge_base(i) =
              beta_e * psi_l[ll] * t_opposite_node_diff[ee](i);
          ++t_face_edge_base;

          t_diff_face_edge_base(i, j) =
              (beta_e * t_diff_psi_l(j) + t_diff_beta_e(j) * psi_l[ll]) *
              t_opposite_node_diff[ee](i);

          ++t_diff_face_edge_base;
          ++t_diff_psi_l;
        }
      }
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET_ON_FACE()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET_ON_FACE	(	int *	faces_nodes,
		int	p,
		double *	N,
		double *	diffN,
		double *	phi_f_e[3],
		double *	diff_phi_f_e[3],
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Face edge base functions of Hcurl space.

On each edge we have (P-1) base functions, and each face has 3 edges and are 4 faces on tetrahedral.

See NBFACETRI_AINSWORTH_EDGE_HCURL

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
N	array shape functions evaluated at each integration point
diffN	derivatives of nodal shape functions
phi_f[4]	calculated shape functions for each face
diff_phi_v[4]	derivatives of shape functions for each face
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 454 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_EDGE_HCURL(p);
  if (nb_base_fun_on_face == 0)
    MoFEMFunctionReturnHot(0);

  const int edges[3][2] = {{0, 1}, {1, 2}, {2, 0}};

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 2> j;

  const int o_nodes[3] = {2, 0, 1};
  FTensor::Tensor2<double, 3, 3> t_opposite_node_diff(
      diffN[2 * o_nodes[0] + 0], diffN[2 * o_nodes[0] + 1], 0.,
      diffN[2 * o_nodes[1] + 0], diffN[2 * o_nodes[1] + 1], 0.,
      diffN[2 * o_nodes[2] + 0], diffN[2 * o_nodes[2] + 1], 0.);
  double psi_l[p + 1];
  double diff_psi_l[2 * p + 2];

  FTensor::Tensor1<double *, 3> t_face_edge_base[3] = {
      FTensor::Tensor1<double *, 3>(&phi_f_e[0][HVEC0], &phi_f_e[0][HVEC1],
                                    &phi_f_e[0][HVEC2], 3),
      FTensor::Tensor1<double *, 3>(&phi_f_e[1][HVEC0], &phi_f_e[1][HVEC1],
                                    &phi_f_e[1][HVEC2], 3),
      FTensor::Tensor1<double *, 3>(&phi_f_e[2][HVEC0], &phi_f_e[2][HVEC1],
                                    &phi_f_e[2][HVEC2], 3),
  };
  FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2> t_diff_face_edge_base[3] = {
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_phi_f_e[0][HVEC0_0], &diff_phi_f_e[0][HVEC0_1],
          &diff_phi_f_e[0][HVEC1_0], &diff_phi_f_e[0][HVEC1_1],
          &diff_phi_f_e[0][HVEC2_0], &diff_phi_f_e[0][HVEC2_1]),
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_phi_f_e[1][HVEC0_0], &diff_phi_f_e[1][HVEC0_1],
          &diff_phi_f_e[1][HVEC1_0], &diff_phi_f_e[1][HVEC1_1],
          &diff_phi_f_e[1][HVEC2_0], &diff_phi_f_e[1][HVEC2_1]),
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_phi_f_e[2][HVEC0_0], &diff_phi_f_e[2][HVEC0_1],
          &diff_phi_f_e[2][HVEC1_0], &diff_phi_f_e[2][HVEC1_1],
          &diff_phi_f_e[2][HVEC2_0], &diff_phi_f_e[2][HVEC2_1])};

  for (int ee = 0; ee != 3; ee++) {

    const int node0 = faces_nodes[edges[ee][0]];
    const int node1 = faces_nodes[edges[ee][1]];
    double diff_ksi0i[] = {diffN[2 * node1 + 0] - diffN[2 * node0 + 0],
                           diffN[2 * node1 + 1] - diffN[2 * node0 + 1]};

    for (int ii = 0; ii != nb_integration_pts; ii++) {

      const int node_shift = ii * 3;
      const double n0 = N[node_shift + node0];
      const double n1 = N[node_shift + node1];
      const double ksi_0i = n1 - n0;
      ierr = base_polynomials(p, ksi_0i, diff_ksi0i, psi_l, diff_psi_l, 2);
      CHKERRG(ierr);
      const double beta_e = n0 * n1;
      FTensor::Tensor1<double, 2> t_diff_beta_e(
          diffN[2 * node0 + 0] * n1 + n0 * diffN[2 * node1 + 0],
          diffN[2 * node0 + 1] * n1 + n0 * diffN[2 * node1 + 1]);
      FTensor::Tensor1<double *, 2> t_diff_psi_l(&diff_psi_l[0],
                                                 &diff_psi_l[p + 1], 1);

      for (int ll = 0; ll != nb_base_fun_on_face; ll++) {
        t_face_edge_base[ee](i) =
            beta_e * psi_l[ll] * t_opposite_node_diff(ee, i);
        t_diff_face_edge_base[ee](i, j) =
            beta_e * t_opposite_node_diff(ee, i) * t_diff_psi_l(j) +
            psi_l[ll] * t_opposite_node_diff(ee, i) * t_diff_beta_e(j);
        ++t_face_edge_base[ee];
        ++t_diff_face_edge_base[ee];
        ++t_diff_psi_l;
      }
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_EdgeBaseFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_EdgeBaseFunctions_MBTET	(	int *	sense,
		int *	p,
		double *	N,
		double *	diffN,
		double *	edgeN[],
		double *	diff_edgeN[],
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Edge based H-curl base functions on tetrahedral.

Function generates hierarchical base of h-curl comforting functions on tetrahedral edge. For more details see [3].

On each tetrahedral's edge we have P+1 functions. See NBEDGE_AINSWORTH_HCURL

Parameters

sense	sense fo edge (i.e. unique orientation)
p	array of oder for each edge
N	array shape functions evaluated at each integration point
diffN	derivatives of shape functions
edgeN	base functions on edges
diff_edgeN	derivatives of edge shape functions
nb_integration_pts	number of integration points
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 15 of file Hcurl.cpp.

                                                       {
  MoFEMFunctionBeginHot;

  const int edges_nodes[6][2] = {{0, 1}, {1, 2}, {2, 0},
                                 {0, 3}, {1, 3}, {2, 3}};
  int P[6];
  for (int ee = 0; ee != 6; ee++)
    P[ee] = NBEDGE_AINSWORTH_HCURL(p[ee]);

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 3> j;

  FTensor::Tensor1<double *, 3> t_node_diff_ksi[4] = {
      FTensor::Tensor1<double *, 3>(&diffN[0], &diffN[1], &diffN[2]),
      FTensor::Tensor1<double *, 3>(&diffN[3], &diffN[4], &diffN[5]),
      FTensor::Tensor1<double *, 3>(&diffN[6], &diffN[7], &diffN[8]),
      FTensor::Tensor1<double *, 3>(&diffN[9], &diffN[10], &diffN[11])};
  double edge_diff_ksi[6][3];
  FTensor::Tensor1<double *, 3> t_edge_diff_ksi[6] = {
      FTensor::Tensor1<double *, 3>(&edge_diff_ksi[0][0], &edge_diff_ksi[0][1],
                                    &edge_diff_ksi[0][2]),
      FTensor::Tensor1<double *, 3>(&edge_diff_ksi[1][0], &edge_diff_ksi[1][1],
                                    &edge_diff_ksi[1][2]),
      FTensor::Tensor1<double *, 3>(&edge_diff_ksi[2][0], &edge_diff_ksi[2][1],
                                    &edge_diff_ksi[2][2]),
      FTensor::Tensor1<double *, 3>(&edge_diff_ksi[3][0], &edge_diff_ksi[3][1],
                                    &edge_diff_ksi[3][2]),
      FTensor::Tensor1<double *, 3>(&edge_diff_ksi[4][0], &edge_diff_ksi[4][1],
                                    &edge_diff_ksi[4][2]),
      FTensor::Tensor1<double *, 3>(&edge_diff_ksi[5][0], &edge_diff_ksi[5][1],
                                    &edge_diff_ksi[5][2])};
  for (int ee = 0; ee != 6; ee++) {
    t_edge_diff_ksi[ee](i) = (t_node_diff_ksi[edges_nodes[ee][1]](i) -
                              t_node_diff_ksi[edges_nodes[ee][0]](i)) *
                             sense[ee];
  }

  FTensor::Tensor1<double *, 3> t_edge_n[6] = {
      FTensor::Tensor1<double *, 3>(&edge_n[0][0], &edge_n[0][1], &edge_n[0][2],
                                    3),
      FTensor::Tensor1<double *, 3>(&edge_n[1][0], &edge_n[1][1], &edge_n[1][2],
                                    3),
      FTensor::Tensor1<double *, 3>(&edge_n[2][0], &edge_n[2][1], &edge_n[2][2],
                                    3),
      FTensor::Tensor1<double *, 3>(&edge_n[3][0], &edge_n[3][1], &edge_n[3][2],
                                    3),
      FTensor::Tensor1<double *, 3>(&edge_n[4][0], &edge_n[4][1], &edge_n[4][2],
                                    3),
      FTensor::Tensor1<double *, 3>(&edge_n[5][0], &edge_n[5][1], &edge_n[5][2],
                                    3)};
  FTensor::Tensor2<double *, 3, 3> t_diff_edge_n[6] = {
      FTensor::Tensor2<double *, 3, 3>(
          &diff_edge_n[0][0], &diff_edge_n[0][3], &diff_edge_n[0][6],
          &diff_edge_n[0][1], &diff_edge_n[0][4], &diff_edge_n[0][7],
          &diff_edge_n[0][2], &diff_edge_n[0][5], &diff_edge_n[0][8], 9),
      FTensor::Tensor2<double *, 3, 3>(
          &diff_edge_n[1][0], &diff_edge_n[1][3], &diff_edge_n[1][6],
          &diff_edge_n[1][1], &diff_edge_n[1][4], &diff_edge_n[1][7],
          &diff_edge_n[1][2], &diff_edge_n[1][5], &diff_edge_n[1][8], 9),
      FTensor::Tensor2<double *, 3, 3>(
          &diff_edge_n[2][0], &diff_edge_n[2][3], &diff_edge_n[2][6],
          &diff_edge_n[2][1], &diff_edge_n[2][4], &diff_edge_n[2][7],
          &diff_edge_n[2][2], &diff_edge_n[2][5], &diff_edge_n[2][8], 9),
      FTensor::Tensor2<double *, 3, 3>(
          &diff_edge_n[3][0], &diff_edge_n[3][3], &diff_edge_n[3][6],
          &diff_edge_n[3][1], &diff_edge_n[3][4], &diff_edge_n[3][7],
          &diff_edge_n[3][2], &diff_edge_n[3][5], &diff_edge_n[3][8], 9),
      FTensor::Tensor2<double *, 3, 3>(
          &diff_edge_n[4][0], &diff_edge_n[4][3], &diff_edge_n[4][6],
          &diff_edge_n[4][1], &diff_edge_n[4][4], &diff_edge_n[4][7],
          &diff_edge_n[4][2], &diff_edge_n[4][5], &diff_edge_n[4][8], 9),
      FTensor::Tensor2<double *, 3, 3>(
          &diff_edge_n[5][0], &diff_edge_n[5][3], &diff_edge_n[5][6],
          &diff_edge_n[5][1], &diff_edge_n[5][4], &diff_edge_n[5][7],
          &diff_edge_n[5][2], &diff_edge_n[5][5], &diff_edge_n[5][8], 9)};
  FTensor::Tensor1<double, 3> t_psi_e_0, t_psi_e_1;
  FTensor::Tensor2<double, 3, 3> t_diff_psi_e_0, t_diff_psi_e_1;

  for (int ii = 0; ii != nb_integration_pts; ii++) {

    const int node_shift = ii * 4;
    for (int ee = 0; ee != 6; ee++) {

      if (P[ee] == 0)
        continue;

      t_psi_e_0(i) = (N[node_shift + edges_nodes[ee][1]] *
                          t_node_diff_ksi[edges_nodes[ee][0]](i) -
                      N[node_shift + edges_nodes[ee][0]] *
                          t_node_diff_ksi[edges_nodes[ee][1]](i)) *
                     sense[ee];
      t_diff_psi_e_0(i, j) = (t_node_diff_ksi[edges_nodes[ee][1]](j) *
                                  t_node_diff_ksi[edges_nodes[ee][0]](i) -
                              t_node_diff_ksi[edges_nodes[ee][0]](j) *
                                  t_node_diff_ksi[edges_nodes[ee][1]](i)) *
                             sense[ee];

      t_psi_e_1(i) = N[node_shift + edges_nodes[ee][1]] *
                         t_node_diff_ksi[edges_nodes[ee][0]](i) +
                     N[node_shift + edges_nodes[ee][0]] *
                         t_node_diff_ksi[edges_nodes[ee][1]](i);
      t_diff_psi_e_1(i, j) = t_node_diff_ksi[edges_nodes[ee][1]](j) *
                                 t_node_diff_ksi[edges_nodes[ee][0]](i) +
                             t_node_diff_ksi[edges_nodes[ee][0]](j) *
                                 t_node_diff_ksi[edges_nodes[ee][1]](i);

      (t_edge_n[ee])(i) = t_psi_e_0(i);
      ++(t_edge_n[ee]);
      (t_edge_n[ee])(i) = t_psi_e_1(i);
      ++(t_edge_n[ee]);

      (t_diff_edge_n[ee])(i, j) = t_diff_psi_e_0(i, j);
      ++(t_diff_edge_n[ee]);
      (t_diff_edge_n[ee])(i, j) = t_diff_psi_e_1(i, j);
      ++(t_diff_edge_n[ee]);

      if (p[ee] > 1) {

        const double ksi_0i = (N[node_shift + edges_nodes[ee][1]] -
                               N[node_shift + edges_nodes[ee][0]]) *
                              sense[ee];
        double psi_l[p[ee] + 1], diff_psi_l[3 * p[ee] + 3];
        ierr = base_polynomials(p[ee], ksi_0i, &edge_diff_ksi[ee][0], psi_l,
                                diff_psi_l, 3);
        CHKERRG(ierr);
        FTensor::Tensor1<double *, 3> t_diff_psi_l(
            &diff_psi_l[0], &diff_psi_l[p[ee] + 1], &diff_psi_l[2 * p[ee] + 2],
            1);

        for (int ll = 2; ll != P[ee]; ll++) {

          const double a = (double)(2 * ll + 1) / (double)(ll + 1);
          const double b = (double)(ll) / (double)(ll + 1);

          (t_edge_n[ee])(i) = a * psi_l[ll - 1] * t_psi_e_1(i) -
                              b * psi_l[ll - 2] * t_psi_e_0(i);
          ++(t_edge_n[ee]);

          (t_diff_edge_n[ee])(i, j) =
              -b * (t_diff_psi_l(j) * t_psi_e_0(i) +
                    psi_l[ll - 2] * t_diff_psi_e_0(i, j));
          ++t_diff_psi_l;
          (t_diff_edge_n[ee])(i, j) +=
              a * (t_diff_psi_l(j) * t_psi_e_1(i) +
                   psi_l[ll - 1] * t_diff_psi_e_1(i, j));
          ++(t_diff_edge_n[ee]);
        }
      }
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_EdgeBaseFunctions_MBTET_ON_EDGE()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_EdgeBaseFunctions_MBTET_ON_EDGE	(	int	sense,
		int	p,
		double *	N,
		double *	diffN,
		double *	edgeN,
		double *	diff_edgeN,
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Edge based H-curl base functions on edge.

Function generates hierarchical base of h-curl comforting functions on tetrahedral edge. For more details see [3].

On each edge we have P+1 functions. See NBEDGE_AINSWORTH_HCURL

Parameters

sense	sense fo edge (i.e. unique orientation)
p	array of oder for each edge
N	array shape functions evaluated at each integration point
diffN	derivatives of shape functions
edgeN	base functions on edges
diff_edgeN	derivatives of edge shape functions
nb_integration_pts	number of integration points
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 174 of file Hcurl.cpp.

                                                       {
  MoFEMFunctionBeginHot;

  if (NBEDGE_AINSWORTH_HCURL(p) == 0)
    MoFEMFunctionReturnHot(0);
  if (diff_edge_n != NULL) {
    SETERRQ(PETSC_COMM_SELF, MOFEM_NOT_IMPLEMENTED,
            "Calculation of derivatives not implemented");
  }

  FTensor::Index<'i', 3> i;
  FTensor::Tensor1<double, 3> t_node_diff_ksi[2];
  t_node_diff_ksi[0](0) = diffN[0];
  t_node_diff_ksi[0](1) = 0;
  t_node_diff_ksi[0](2) = 0;
  t_node_diff_ksi[1](0) = diffN[1];
  t_node_diff_ksi[1](1) = 0;
  t_node_diff_ksi[1](2) = 0;

  FTensor::Tensor1<double *, 3> t_edge_n(&edge_n[0], &edge_n[1], &edge_n[2], 3);
  FTensor::Tensor1<double, 3> t_psi_e_0, t_psi_e_1;

  for (int ii = 0; ii != nb_integration_pts; ii++) {

    const int node_shift = ii * 2;

    t_psi_e_0(i) = (N[node_shift + 1] * t_node_diff_ksi[0](i) -
                    N[node_shift + 0] * t_node_diff_ksi[1](i)) *
                   sense;
    t_psi_e_1(i) = N[node_shift + 1] * t_node_diff_ksi[0](i) +
                   N[node_shift + 0] * t_node_diff_ksi[1](i);
    t_edge_n(i) = t_psi_e_0(i);
    ++t_edge_n;
    t_edge_n(i) = t_psi_e_1(i);
    ++t_edge_n;

    if (p > 1) {
      const double ksi_0i = (N[node_shift + 1] - N[node_shift + 0]) * sense;
      double psi_l[p + 1];
      ierr = base_polynomials(p, ksi_0i, NULL, psi_l, NULL, 3);
      CHKERRG(ierr);
      for (int ll = 2; ll != NBEDGE_AINSWORTH_HCURL(p); ll++) {
        const double a = (double)(2 * ll + 1) / (double)(ll + 1);
        const double b = (double)(ll) / (double)(ll + 1);
        t_edge_n(i) =
            a * psi_l[ll - 1] * t_psi_e_1(i) - b * psi_l[ll - 2] * t_psi_e_0(i);
        ++t_edge_n;
      }
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_EdgeBaseFunctions_MBTET_ON_FACE()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_EdgeBaseFunctions_MBTET_ON_FACE	(	int *	sense,
		int *	p,
		double *	N,
		double *	diffN,
		double *	edgeN[],
		double *	diff_edgeN[],
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Edge based H-curl base functions on face.

Function generates hierarchical base of h-curl comforting functions on tetrahedral edge. For more details see [3].

On each face's edge we have P+1 functions. See NBEDGE_AINSWORTH_HCURL

Parameters

sense	sense fo edge (i.e. unique orientation)
p	array of oder for each edge
N	array shape functions evaluated at each integration point
diffN	derivatives of shape functions
edgeN	base functions on edges
diff_edgeN	derivatives of edge shape functions
nb_integration_pts	number of integration points
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 233 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  // TODO This is not by atom tests properly

  const int edges_nodes[3][2] = {{0, 1}, {1, 2}, {2, 0}};
  int P[3];
  for (int ee = 0; ee < 3; ee++)
    P[ee] = NBEDGE_AINSWORTH_HCURL(p[ee]);

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 2> j;

  FTensor::Tensor1<double, 3> t_node_diff_ksi[3] = {
      FTensor::Tensor1<double, 3>(diffN[0], diffN[1], 0.),
      FTensor::Tensor1<double, 3>(diffN[2], diffN[3], 0.),
      FTensor::Tensor1<double, 3>(diffN[4], diffN[5], 0.),
  };
  FTensor::Tensor1<double, 2> t_2d_diff_ksi[3] = {
      FTensor::Tensor1<double, 2>(diffN[0], diffN[1]),
      FTensor::Tensor1<double, 2>(diffN[2], diffN[3]),
      FTensor::Tensor1<double, 2>(diffN[4], diffN[5])};

  FTensor::Tensor1<double *, 3> t_edge_n[3] = {
      FTensor::Tensor1<double *, 3>(&edge_n[0][0], &edge_n[0][1], &edge_n[0][2],
                                    3),
      FTensor::Tensor1<double *, 3>(&edge_n[1][0], &edge_n[1][1], &edge_n[1][2],
                                    3),
      FTensor::Tensor1<double *, 3>(&edge_n[2][0], &edge_n[2][1], &edge_n[2][2],
                                    3)};
  FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2> t_diff_edge_n[3] = {
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_edge_n[0][HVEC0_0], &diff_edge_n[0][HVEC0_1],
          &diff_edge_n[0][HVEC1_0], &diff_edge_n[0][HVEC1_1],
          &diff_edge_n[0][HVEC2_0], &diff_edge_n[0][HVEC2_1]),
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_edge_n[1][HVEC0_0], &diff_edge_n[1][HVEC0_1],
          &diff_edge_n[1][HVEC1_0], &diff_edge_n[1][HVEC1_1],
          &diff_edge_n[1][HVEC2_0], &diff_edge_n[1][HVEC2_1]),
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_edge_n[2][HVEC0_0], &diff_edge_n[2][HVEC0_1],
          &diff_edge_n[2][HVEC1_0], &diff_edge_n[2][HVEC1_1],
          &diff_edge_n[2][HVEC2_0], &diff_edge_n[2][HVEC2_1])};

  FTensor::Tensor1<double, 3> t_psi_e_0, t_psi_e_1;
  FTensor::Tensor2<double, 3, 2> t_diff_psi_e_0, t_diff_psi_e_1;

  for (int ee = 0; ee != 3; ee++) {

    if (P[ee] == 0)
      continue;
    const int node0 = edges_nodes[ee][0];
    const int node1 = edges_nodes[ee][1];
    const int sense_edge = sense[ee];

    t_diff_psi_e_0(i, j) =
        (t_node_diff_ksi[node0](i) * t_2d_diff_ksi[node1](j) -
         t_node_diff_ksi[node1](i) * t_2d_diff_ksi[node0](j)) *
        sense_edge;
    t_diff_psi_e_1(i, j) = t_node_diff_ksi[node0](i) * t_2d_diff_ksi[node1](j) +
                           t_node_diff_ksi[node1](i) * t_2d_diff_ksi[node0](j);

    for (int ii = 0; ii != nb_integration_pts; ii++) {

      const int node_shift = ii * 3;
      const double n0 = N[node_shift + node0];
      const double n1 = N[node_shift + node1];

      t_psi_e_0(i) =
          (n1 * t_node_diff_ksi[node0](i) - n0 * t_node_diff_ksi[node1](i)) *
          sense_edge;
      t_psi_e_1(i) =
          n1 * t_node_diff_ksi[node0](i) + n0 * t_node_diff_ksi[node1](i);

      (t_edge_n[ee])(i) = t_psi_e_0(i);
      (t_diff_edge_n[ee])(i, j) = t_diff_psi_e_0(i, j);
      ++(t_edge_n[ee]);
      ++(t_diff_edge_n[ee]);
      (t_edge_n[ee])(i) = t_psi_e_1(i);
      (t_diff_edge_n[ee])(i, j) = t_diff_psi_e_1(i, j);
      ++(t_edge_n[ee]);
      ++(t_diff_edge_n[ee]);

      if (p[ee] > 1) {
        const double ksi_0i = (n1 - n0) * sense_edge;
        double diff_ksi_0i[] = {
            ((t_2d_diff_ksi[node1])(0) - (t_2d_diff_ksi[node0])(0)) *
                sense_edge,
            ((t_2d_diff_ksi[node1])(1) - (t_2d_diff_ksi[node0])(1)) *
                sense_edge};

        double psi_l[p[ee] + 1], diff_psi_l[2 * p[ee] + 2];
        ierr =
            base_polynomials(p[ee], ksi_0i, diff_ksi_0i, psi_l, diff_psi_l, 2);
        CHKERRG(ierr);
        FTensor::Tensor1<double *, 2> t_diff_psi_ll_m1(
            &diff_psi_l[0 + 2 - 1], &diff_psi_l[p[ee] + 1 + 2 - 1], 1);
        FTensor::Tensor1<double *, 2> t_diff_psi_ll_m2(
            &diff_psi_l[0 + 2 - 2], &diff_psi_l[p[ee] + 1 + 2 - 2], 1);
        for (int ll = 2; ll != P[ee]; ll++) {
          const double a = (double)(2 * ll + 1) / (double)(ll + 1);
          const double b = (double)(ll) / (double)(ll + 1);
          (t_edge_n[ee])(i) = a * psi_l[ll - 1] * t_psi_e_1(i) -
                              b * psi_l[ll - 2] * t_psi_e_0(i);
          (t_diff_edge_n[ee])(i, j) = a * t_psi_e_1(i) * t_diff_psi_ll_m1(j) +
                                      a * psi_l[ll - 1] * t_diff_psi_e_1(i, j) -
                                      b * t_psi_e_0(i) * t_diff_psi_ll_m2(j) -
                                      b * psi_l[ll - 2] * t_diff_psi_e_0(i, j);
          ++(t_edge_n[ee]);
          ++(t_diff_edge_n[ee]);
          ++t_diff_psi_ll_m1;
          ++t_diff_psi_ll_m2;
        }
      }
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_FaceFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_FaceFunctions_MBTET	(	int *	face_nodes,
		int *	p,
		double *	N,
		double *	diffN,
		double *	phi_f[4],
		double *	diff_phi_f[4],
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Face H-curl functions.

Face H-curl functions are set of Eddge-Based Face functions (Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET) and Bubble-Face functions (Hcurl_Ainsworth_BubbleFaceFunctions_MBTET).

See NBVOLUMETET_AINSWORTH_FACE_HCURL

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
N	nodal shape functions
diffN	derivatives of nodal shape functions
phi_f[4]	calculated shape functions for each face
diff_phi_v[4]	derivatives of shape functions for each face
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 1052 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  try {

    MatrixDouble base_face_edge_functions[4];
    MatrixDouble diff_base_face_edge_functions[4];
    double *phi_f_e[4][3];
    double *diff_phi_f_e[4][3];
    for (int ff = 0; ff != 4; ff++) {
      if (NBFACETRI_AINSWORTH_EDGE_HCURL(p[ff]) == 0) {
        for (int ee = 0; ee != 3; ee++) {
          phi_f_e[ff][ee] = NULL;
          diff_phi_f_e[ff][ee] = NULL;
        }
      } else {
        base_face_edge_functions[ff].resize(
            3, 3 * NBFACETRI_AINSWORTH_EDGE_HCURL(p[ff]) * nb_integration_pts);
        diff_base_face_edge_functions[ff].resize(
            3, 9 * NBFACETRI_AINSWORTH_EDGE_HCURL(p[ff]) * nb_integration_pts);
        // base_face_edge_functions[ff].clear();
        // diff_base_face_edge_functions[ff].clear();
        for (int ee = 0; ee != 3; ee++) {
          phi_f_e[ff][ee] = &base_face_edge_functions[ff](ee, 0);
          diff_phi_f_e[ff][ee] = &diff_base_face_edge_functions[ff](ee, 0);
        }
      }
    }
    ierr = Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET(
        face_nodes, p, N, diffN, phi_f_e, diff_phi_f_e, nb_integration_pts,
        base_polynomials);
    CHKERRG(ierr);

    VectorDouble base_face_bubble_functions[4];
    VectorDouble diff_base_face_bubble_functions[4];
    double *phi_f_f[4];
    double *diff_phi_f_f[4];
    for (int ff = 0; ff != 4; ff++) {
      int nb_dofs = NBFACETRI_AINSWORTH_FACE_HCURL(p[ff]);
      if (nb_dofs == 0) {
        phi_f_f[ff] = NULL;
        diff_phi_f_f[ff] = NULL;
      } else {
        base_face_bubble_functions[ff].resize(3 * nb_dofs * nb_integration_pts,
                                              false);
        diff_base_face_bubble_functions[ff].resize(
            9 * nb_dofs * nb_integration_pts, false);
        phi_f_f[ff] = &*base_face_bubble_functions[ff].data().begin();
        diff_phi_f_f[ff] = &*diff_base_face_bubble_functions[ff].data().begin();
      }
    }
    ierr = Hcurl_Ainsworth_BubbleFaceFunctions_MBTET(
        face_nodes, p, N, diffN, phi_f_f, diff_phi_f_f, nb_integration_pts,
        base_polynomials);
    CHKERRG(ierr);

    FTensor::Index<'i', 3> i;
    FTensor::Index<'j', 3> j;

    for (int ff = 0; ff != 4; ff++) {

      if (NBFACETRI_AINSWORTH_EDGE_HCURL(p[ff]) == 0)
        continue;

      FTensor::Tensor1<double *, 3> t_face_edge_base[] = {
          FTensor::Tensor1<double *, 3>(&phi_f_e[ff][0][0], &phi_f_e[ff][0][1],
                                        &phi_f_e[ff][0][2], 3),
          FTensor::Tensor1<double *, 3>(&phi_f_e[ff][1][0], &phi_f_e[ff][1][1],
                                        &phi_f_e[ff][1][2], 3),
          FTensor::Tensor1<double *, 3>(&phi_f_e[ff][2][0], &phi_f_e[ff][2][1],
                                        &phi_f_e[ff][2][2], 3)};
      FTensor::Tensor2<double *, 3, 3> t_diff_face_edge_base[] = {
          FTensor::Tensor2<double *, 3, 3>(
              &diff_phi_f_e[ff][0][0], &diff_phi_f_e[ff][0][3],
              &diff_phi_f_e[ff][0][6], &diff_phi_f_e[ff][0][1],
              &diff_phi_f_e[ff][0][4], &diff_phi_f_e[ff][0][7],
              &diff_phi_f_e[ff][0][2], &diff_phi_f_e[ff][0][5],
              &diff_phi_f_e[ff][0][8], 9),
          FTensor::Tensor2<double *, 3, 3>(
              &diff_phi_f_e[ff][1][0], &diff_phi_f_e[ff][1][3],
              &diff_phi_f_e[ff][1][6], &diff_phi_f_e[ff][1][1],
              &diff_phi_f_e[ff][1][4], &diff_phi_f_e[ff][1][7],
              &diff_phi_f_e[ff][1][2], &diff_phi_f_e[ff][1][5],
              &diff_phi_f_e[ff][1][8], 9),
          FTensor::Tensor2<double *, 3, 3>(
              &diff_phi_f_e[ff][2][0], &diff_phi_f_e[ff][2][3],
              &diff_phi_f_e[ff][2][6], &diff_phi_f_e[ff][2][1],
              &diff_phi_f_e[ff][2][4], &diff_phi_f_e[ff][2][7],
              &diff_phi_f_e[ff][2][2], &diff_phi_f_e[ff][2][5],
              &diff_phi_f_e[ff][2][8], 9)};

      FTensor::Tensor1<double *, 3> t_face_base(&phi_f[ff][0], &phi_f[ff][1],
                                                &phi_f[ff][2], 3);
      FTensor::Tensor2<double *, 3, 3> t_diff_face_base(
          &diff_phi_f[ff][0], &diff_phi_f[ff][3], &diff_phi_f[ff][6],
          &diff_phi_f[ff][1], &diff_phi_f[ff][4], &diff_phi_f[ff][7],
          &diff_phi_f[ff][2], &diff_phi_f[ff][5], &diff_phi_f[ff][8], 9);

      if (NBFACETRI_AINSWORTH_FACE_HCURL(p[ff]) > 0) {
        FTensor::Tensor1<double *, 3> t_face_face_base(
            &phi_f_f[ff][0], &phi_f_f[ff][1], &phi_f_f[ff][2], 3);
        FTensor::Tensor2<double *, 3, 3> t_diff_face_face_base(
            &diff_phi_f_f[ff][0], &diff_phi_f_f[ff][3], &diff_phi_f_f[ff][6],
            &diff_phi_f_f[ff][1], &diff_phi_f_f[ff][4], &diff_phi_f_f[ff][7],
            &diff_phi_f_f[ff][2], &diff_phi_f_f[ff][5], &diff_phi_f_f[ff][8],
            9);
        for (int ii = 0; ii != nb_integration_pts; ii++) {
          int cc = 0;
          for (int oo = 0; oo <= p[ff]; oo++) {
            // Face-edge base
            if (oo > 1) {
              for (int ee = 0; ee != 3; ee++) {
                for (int ll = NBFACETRI_AINSWORTH_EDGE_HCURL(oo - 1);
                     ll != NBFACETRI_AINSWORTH_EDGE_HCURL(oo); ll++) {
                  t_face_base(i) = t_face_edge_base[ee](i);
                  ++cc;
                  ++t_face_base;
                  ++t_face_edge_base[ee];
                  t_diff_face_base(i, j) = t_diff_face_edge_base[ee](i, j);
                  ++t_diff_face_base;
                  ++t_diff_face_edge_base[ee];
                  // cerr << oo << " " << ll << " " << cc << " " <<
                  // NBFACETRI_AINSWORTH_EDGE_HCURL(oo) << endl;
                }
              }
            }
            // Face-face base
            if (oo > 2) {
              for (int ll = NBFACETRI_AINSWORTH_FACE_HCURL(oo - 1);
                   ll != NBFACETRI_AINSWORTH_FACE_HCURL(oo); ll++) {
                t_face_base(i) = t_face_face_base(i);
                ++cc;
                ++t_face_base;
                ++t_face_face_base;
                t_diff_face_base(i, j) = t_diff_face_face_base(i, j);
                ++t_diff_face_base;
                ++t_diff_face_face_base;
              }
            }
          }
          // check consistency
          const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_HCURL(p[ff]);
          if (cc != nb_base_fun_on_face) {
            SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
                     "Wrong number of base functions %d != %d", cc,
                     nb_base_fun_on_face);
          }
        }
      } else {
        for (int ii = 0; ii != nb_integration_pts; ii++) {
          int cc = 0;
          for (int oo = 0; oo <= p[ff]; oo++) {
            // Face-edge base
            if (oo > 1) {
              for (int ee = 0; ee != 3; ee++) {
                for (int ll = NBFACETRI_AINSWORTH_EDGE_HCURL(oo - 1);
                     ll != NBFACETRI_AINSWORTH_EDGE_HCURL(oo); ll++) {
                  t_face_base(i) = t_face_edge_base[ee](i);
                  ++cc;
                  ++t_face_base;
                  ++t_face_edge_base[ee];
                  t_diff_face_base(i, j) = t_diff_face_edge_base[ee](i, j);
                  ++t_diff_face_base;
                  ++t_diff_face_edge_base[ee];
                  // cerr << oo << " " << ll << " " << cc << " " <<
                  // NBFACETRI_AINSWORTH_EDGE_HCURL(oo) << endl;
                }
              }
            }
          }
          // check consistency
          const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_HCURL(p[ff]);
          if (cc != nb_base_fun_on_face) {
            SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
                     "Wrong number of base functions %d != %d", cc,
                     nb_base_fun_on_face);
          }
        }
      }
    }

  } catch (MoFEMException const &e) {
    SETERRQ(PETSC_COMM_SELF, e.errorCode, e.errorMessage);
  } catch (std::exception &ex) {
    std::ostringstream ss;
    ss << "thorw in method: " << ex.what() << " at line " << __LINE__
       << " in file " << __FILE__;
    SETERRQ(PETSC_COMM_SELF, MOFEM_STD_EXCEPTION_THROW, ss.str().c_str());
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_FaceFunctions_MBTET_ON_FACE()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_FaceFunctions_MBTET_ON_FACE	(	int *	faces_nodes,
		int	p,
		double *	N,
		double *	diffN,
		double *	phi_f,
		double *	diff_phi_f,
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Face H-curl functions.

Face H-curl functions are set of Eddge-Based Face functions (Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET) and Bubble-Face functions (Hcurl_Ainsworth_BubbleFaceFunctions_MBTET).

See NBVOLUMETET_AINSWORTH_FACE_HCURL

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
N	nodal shape functions
diffN	derivatives of nodal shape functions
phi_f[4]	calculated shape functions for each face
diff_phi_v[4]	derivatives of shape functions for each face
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 1251 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  if (NBFACETRI_AINSWORTH_EDGE_HCURL(p) == 0)
    MoFEMFunctionReturnHot(0);

  MatrixDouble base_face_edge_functions, diff_base_face_edge_functions;
  double *phi_f_e[3];
  double *diff_phi_f_e[3];
  base_face_edge_functions.resize(3, 3 * NBFACETRI_AINSWORTH_EDGE_HCURL(p) *
                                         nb_integration_pts);
  diff_base_face_edge_functions.resize(
      3, 2 * 3 * NBFACETRI_AINSWORTH_EDGE_HCURL(p) * nb_integration_pts);
  // base_face_edge_functions.clear();
  for (int ee = 0; ee != 3; ee++) {
    phi_f_e[ee] = &base_face_edge_functions(ee, 0);
    diff_phi_f_e[ee] = &diff_base_face_edge_functions(ee, 0);
  }
  ierr = Hcurl_Ainsworth_EdgeBasedFaceFunctions_MBTET_ON_FACE(
      faces_nodes, p, N, diffN, phi_f_e, diff_phi_f_e, nb_integration_pts,
      base_polynomials);
  CHKERRG(ierr);

  VectorDouble base_face_bubble_functions;
  VectorDouble diff_base_face_bubble_functions;
  double *phi_f_f, *diff_phi_f_f;
  base_face_bubble_functions.resize(3 * NBFACETRI_AINSWORTH_FACE_HCURL(p) *
                                    nb_integration_pts);
  diff_base_face_bubble_functions.resize(
      2 * 3 * NBFACETRI_AINSWORTH_FACE_HCURL(p) * nb_integration_pts);
  phi_f_f = &*base_face_bubble_functions.data().begin();
  diff_phi_f_f = &*diff_base_face_bubble_functions.data().begin();
  ierr = Hcurl_Ainsworth_BubbleFaceFunctions_MBTET_ON_FACE(
      faces_nodes, p, N, diffN, phi_f_f, diff_phi_f_f, nb_integration_pts,
      base_polynomials);
  CHKERRG(ierr);
  // cerr << diff_base_face_bubble_functions << endl;

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 2> j;

  FTensor::Tensor1<double *, 3> t_face_edge_base[] = {
      FTensor::Tensor1<double *, 3>(&phi_f_e[0][HVEC0], &phi_f_e[0][HVEC1],
                                    &phi_f_e[0][HVEC2], 3),
      FTensor::Tensor1<double *, 3>(&phi_f_e[1][HVEC0], &phi_f_e[1][HVEC1],
                                    &phi_f_e[1][HVEC2], 3),
      FTensor::Tensor1<double *, 3>(&phi_f_e[2][HVEC0], &phi_f_e[2][HVEC1],
                                    &phi_f_e[2][HVEC2], 3)};
  FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2> t_diff_face_edge_base[] = {
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_phi_f_e[0][HVEC0_0], &diff_phi_f_e[0][HVEC0_1],
          &diff_phi_f_e[0][HVEC1_0], &diff_phi_f_e[0][HVEC1_1],
          &diff_phi_f_e[0][HVEC2_0], &diff_phi_f_e[0][HVEC2_1]),
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_phi_f_e[1][HVEC0_0], &diff_phi_f_e[1][HVEC0_1],
          &diff_phi_f_e[1][HVEC1_0], &diff_phi_f_e[1][HVEC1_1],
          &diff_phi_f_e[1][HVEC2_0], &diff_phi_f_e[1][HVEC2_1]),
      FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2>(
          &diff_phi_f_e[2][HVEC0_0], &diff_phi_f_e[2][HVEC0_1],
          &diff_phi_f_e[2][HVEC1_0], &diff_phi_f_e[2][HVEC1_1],
          &diff_phi_f_e[2][HVEC2_0], &diff_phi_f_e[2][HVEC2_1])};

  FTensor::Tensor1<double *, 3> t_face_base(&phi_f[0], &phi_f[1], &phi_f[2], 3);
  FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2> t_diff_face_base(
      &diff_phi_f[HVEC0_0], &diff_phi_f[HVEC0_1], &diff_phi_f[HVEC1_0],
      &diff_phi_f[HVEC1_1], &diff_phi_f[HVEC2_0], &diff_phi_f[HVEC2_1]);

  if (NBFACETRI_AINSWORTH_FACE_HCURL(p) > 0) {
    FTensor::Tensor1<double *, 3> t_face_face_base(
        &phi_f_f[HVEC0], &phi_f_f[HVEC1], &phi_f_f[HVEC2], 3);
    FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2> t_diff_face_face_base(
        &diff_phi_f_f[HVEC0_0], &diff_phi_f_f[HVEC0_1],
        &diff_phi_f_f[HVEC1_0], &diff_phi_f_f[HVEC1_1],
        &diff_phi_f_f[HVEC2_0], &diff_phi_f_f[HVEC2_1]);
    for (int ii = 0; ii != nb_integration_pts; ii++) {
      int cc = 0;
      for (int oo = 0; oo <= p; oo++) {
        // Face-edge base
        if (oo > 1) {
          for (int ee = 0; ee != 3; ee++) {
            for (int ll = NBFACETRI_AINSWORTH_EDGE_HCURL(oo - 1);
                 ll != NBFACETRI_AINSWORTH_EDGE_HCURL(oo); ll++) {
              t_face_base(i) = t_face_edge_base[ee](i);
              t_diff_face_base(i, j) = t_diff_face_edge_base[ee](i, j);
              ++cc;
              ++t_face_base;
              ++t_face_edge_base[ee];
              ++t_diff_face_base;
              ++t_diff_face_edge_base[ee];
            }
          }
        }
        // Face-face base
        if (oo > 2) {
          for (int ll = NBFACETRI_AINSWORTH_FACE_HCURL(oo - 1);
               ll != NBFACETRI_AINSWORTH_FACE_HCURL(oo); ll++) {
            t_face_base(i) = t_face_face_base(i);
            t_diff_face_base(i, j) = t_diff_face_face_base(i, j);
            ++cc;
            ++t_face_base;
            ++t_face_face_base;
            ++t_diff_face_base;
            ++t_diff_face_face_base;
          }
        }
      }
      // check consistency
      const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_HCURL(p);
      if (cc != nb_base_fun_on_face) {
        SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
                 "Wrong number of base functions %d != %d", cc,
                 nb_base_fun_on_face);
      }
    }
  } else {
    for (int ii = 0; ii != nb_integration_pts; ii++) {
      int cc = 0;
      for (int oo = 0; oo <= p; oo++) {
        // Face-edge base
        if (oo > 1) {
          for (int ee = 0; ee != 3; ee++) {
            for (int ll = NBFACETRI_AINSWORTH_EDGE_HCURL(oo - 1);
                 ll != NBFACETRI_AINSWORTH_EDGE_HCURL(oo); ll++) {
              t_face_base(i) = t_face_edge_base[ee](i);
              t_diff_face_base(i, j) = t_diff_face_edge_base[ee](i, j);
              ++cc;
              ++t_face_base;
              ++t_face_edge_base[ee];
              ++t_diff_face_base;
              ++t_diff_face_edge_base[ee];
              // cerr << oo << " " << ll << " " << cc << " " <<
              // NBFACETRI_AINSWORTH_EDGE_HCURL(oo) << endl;
            }
          }
        }
      }
      // check consistency
      const int nb_base_fun_on_face = NBFACETRI_AINSWORTH_HCURL(p);
      if (cc != nb_base_fun_on_face) {
        SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
                 "Wrong number of base functions %d != %d", cc,
                 nb_base_fun_on_face);
      }
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_FaceInteriorFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_FaceInteriorFunctions_MBTET	(	int *	faces_nodes,
		int	p,
		double *	N,
		double *	diffN,
		double *	phi_v,
		double *	diff_phi_v,
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Face base interior function.

On each face we have P*(P-1)/2 and are 4 faces on Tetrahedral.

See NBFACETRI_AINSWORTH_FACE_HCURL

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
N	nodal shape functions
diffN	derivatives of nodal shape functions
phi_v	calculated shape functions
diff_phi_v	derivatives of shape functions
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 772 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  if (NBVOLUMETET_AINSWORTH_FACE_HCURL(p) == 0)
    MoFEMFunctionReturnHot(0);

  const int face_opposite_nodes[] = {2, 0, 1, 3};

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 3> j;

  FTensor::Tensor1<double *, 3> t_node_diff_ksi[4] = {
      FTensor::Tensor1<double *, 3>(&diffN[0], &diffN[1], &diffN[2]),
      FTensor::Tensor1<double *, 3>(&diffN[3], &diffN[4], &diffN[5]),
      FTensor::Tensor1<double *, 3>(&diffN[6], &diffN[7], &diffN[8]),
      FTensor::Tensor1<double *, 3>(&diffN[9], &diffN[10], &diffN[11])};
  FTensor::Tensor1<double, 3> t_diff_ksi0i, t_diff_ksi0j;

  MatrixDouble m_psi_l_0i(4, p + 1);
  MatrixDouble m_psi_l_0j(4, p + 1);
  MatrixDouble m_diff_psi_l_0i(4, 3 * p + 3);
  MatrixDouble m_diff_psi_l_0j(4, 3 * p + 3);

  double *psi_l_0i[] = {&m_psi_l_0i(0, 0), &m_psi_l_0i(1, 0), &m_psi_l_0i(2, 0),
                        &m_psi_l_0i(3, 0)};
  double *psi_l_0j[] = {&m_psi_l_0j(0, 0), &m_psi_l_0j(1, 0), &m_psi_l_0j(2, 0),
                        &m_psi_l_0j(3, 0)};
  double *diff_psi_l_0i[] = {&m_diff_psi_l_0i(0, 0), &m_diff_psi_l_0i(1, 0),
                             &m_diff_psi_l_0i(2, 0), &m_diff_psi_l_0i(3, 0)};
  double *diff_psi_l_0j[] = {&m_diff_psi_l_0j(0, 0), &m_diff_psi_l_0j(1, 0),
                             &m_diff_psi_l_0j(2, 0), &m_diff_psi_l_0j(3, 0)};
  double beta_f[4];

  FTensor::Tensor1<double, 3> t_diff_beta_f[4];

  FTensor::Tensor1<double *, 3> t_phi_v(&phi_v[0], &phi_v[1], &phi_v[2], 3);
  FTensor::Tensor2<double *, 3, 3> t_diff_phi_v(
      &diff_phi_v[0], &diff_phi_v[3], &diff_phi_v[6], &diff_phi_v[1],
      &diff_phi_v[4], &diff_phi_v[7], &diff_phi_v[2], &diff_phi_v[5],
      &diff_phi_v[8], 9);

  for (int ii = 0; ii != nb_integration_pts; ii++) {

    for (int ff = 0; ff != 4; ff++) {

      t_diff_ksi0i(i) = t_node_diff_ksi[faces_nodes[3 * ff + 1]](i) -
                        t_node_diff_ksi[faces_nodes[3 * ff + 0]](i);
      t_diff_ksi0j(i) = t_node_diff_ksi[faces_nodes[3 * ff + 2]](i) -
                        t_node_diff_ksi[faces_nodes[3 * ff + 0]](i);

      const int node_shift = ii * 4;

      beta_f[ff] = N[node_shift + faces_nodes[3 * ff + 0]] *
                   N[node_shift + faces_nodes[3 * ff + 1]] *
                   N[node_shift + faces_nodes[3 * ff + 2]];

      t_diff_beta_f[ff](j) = t_node_diff_ksi[faces_nodes[3 * ff + 0]](j) *
                                 N[node_shift + faces_nodes[3 * ff + 1]] *
                                 N[node_shift + faces_nodes[3 * ff + 2]] +
                             N[node_shift + faces_nodes[3 * ff + 0]] *
                                 t_node_diff_ksi[faces_nodes[3 * ff + 1]](j) *
                                 N[node_shift + faces_nodes[3 * ff + 2]] +
                             N[node_shift + faces_nodes[3 * ff + 0]] *
                                 N[node_shift + faces_nodes[3 * ff + 1]] *
                                 t_node_diff_ksi[faces_nodes[3 * ff + 2]](j);

      const double ksi_0i = N[node_shift + faces_nodes[3 * ff + 1]] -
                            N[node_shift + faces_nodes[3 * ff + 0]];
      ierr = base_polynomials(p, ksi_0i, &t_diff_ksi0i(0), psi_l_0i[ff],
                              diff_psi_l_0i[ff], 3);
      CHKERRG(ierr);

      const double ksi_0j = N[node_shift + faces_nodes[3 * ff + 2]] -
                            N[node_shift + faces_nodes[3 * ff + 0]];
      ierr = base_polynomials(p, ksi_0j, &t_diff_ksi0j(0), psi_l_0j[ff],
                              diff_psi_l_0j[ff], 3);
      CHKERRG(ierr);
    }

    int cc = 0;
    for (int oo = 0; oo <= (p - 3); oo++) {
      FTensor::Tensor1<double *, 3> t_diff_psi_l_0i[] = {
          FTensor::Tensor1<double *, 3>(&diff_psi_l_0i[0][0],
                                        &diff_psi_l_0i[0][p + 1],
                                        &diff_psi_l_0i[0][2 * p + 2], 1),
          FTensor::Tensor1<double *, 3>(&diff_psi_l_0i[1][0],
                                        &diff_psi_l_0i[1][p + 1],
                                        &diff_psi_l_0i[1][2 * p + 2], 1),
          FTensor::Tensor1<double *, 3>(&diff_psi_l_0i[2][0],
                                        &diff_psi_l_0i[2][p + 1],
                                        &diff_psi_l_0i[2][2 * p + 2], 1),
          FTensor::Tensor1<double *, 3>(&diff_psi_l_0i[3][0],
                                        &diff_psi_l_0i[3][p + 1],
                                        &diff_psi_l_0i[3][2 * p + 2], 1),
      };
      for (int pp0 = 0; pp0 <= oo; pp0++) {
        const int pp1 = oo - pp0;
        if (pp1 >= 0) {
          for (int ff = 0; ff != 4; ff++) {
            FTensor::Tensor1<double *, 3> t_diff_psi_l_0j(
                &m_diff_psi_l_0j(ff, pp1), &m_diff_psi_l_0j(ff, p + 1 + pp1),
                &m_diff_psi_l_0j(ff, 2 * p + 2 + pp1), 1);
            const double t = psi_l_0i[ff][pp0] * psi_l_0j[ff][pp1];
            const double a = beta_f[ff] * t;
            t_phi_v(i) = a * t_node_diff_ksi[face_opposite_nodes[ff]](i);
            ++t_phi_v;
            ++cc;
            t_diff_phi_v(i, j) =
                (t_diff_beta_f[ff](j) * t +
                 beta_f[ff] * t_diff_psi_l_0i[ff](j) * psi_l_0j[ff][pp1] +
                 beta_f[ff] * psi_l_0i[ff][pp0] * t_diff_psi_l_0j(j)) *
                t_node_diff_ksi[face_opposite_nodes[ff]](i);
            ++t_diff_phi_v;
            ++t_diff_psi_l_0i[ff];
          }
        }
      }
    }

    const int nb_base_fun_on_face = NBVOLUMETET_AINSWORTH_FACE_HCURL(p);
    if (cc != nb_base_fun_on_face) {
      SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
               "Wrong number of base functions %d != %d", cc,
               nb_base_fun_on_face);
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_VolumeFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_VolumeFunctions_MBTET	(	int	p,
		double *	N,
		double *	diffN,
		double *	phi_v,
		double *	diff_phi_v,
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

H-curl volume base functions.

Volume base functions are collection of iace interior base functions and volume interior base functions.

Parameters

p	approximation order
N	nodal shape functions
diffN	derivatives of nodal shape functions
phi_v	calculated shape functions
diff_phi_v	derivatives of shape functions
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 1406 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  VectorDouble base_face_inetrior_functions(
      3 * NBVOLUMETET_AINSWORTH_FACE_HCURL(p) * nb_integration_pts);
  VectorDouble diff_base_face_inetrior_functions(
      9 * NBVOLUMETET_AINSWORTH_FACE_HCURL(p) * nb_integration_pts);
  // base_face_inetrior_functions.clear();
  // diff_base_face_inetrior_functions.clear();
  double *phi_v_f = &*base_face_inetrior_functions.data().begin();
  double *diff_phi_v_f = &*diff_base_face_inetrior_functions.data().begin();
  int faces_nodes[] = {0, 1, 3, 1, 2, 3, 0, 2, 3, 0, 1, 2};
  ierr = Hcurl_Ainsworth_FaceInteriorFunctions_MBTET(
      faces_nodes, p, N, diffN, phi_v_f, diff_phi_v_f, nb_integration_pts,
      base_polynomials);
  CHKERRG(ierr);

  VectorDouble base_interior_functions(3 * NBVOLUMETET_AINSWORTH_TET_HCURL(p) *
                                       nb_integration_pts);
  VectorDouble diff_base_interior_functions(
      9 * NBVOLUMETET_AINSWORTH_TET_HCURL(p) * nb_integration_pts);
  // base_interior_functions.clear();
  // diff_base_interior_functions.clear();
  double *phi_v_v = &*base_interior_functions.data().begin();
  double *diff_phi_v_v = &*diff_base_interior_functions.data().begin();
  ierr = Hcurl_Ainsworth_VolumeInteriorFunctions_MBTET(
      p, N, diffN, phi_v_v, diff_phi_v_v, nb_integration_pts, base_polynomials);
  CHKERRG(ierr);

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 3> j;

  FTensor::Tensor1<double *, 3> t_face_interior(&phi_v_f[0], &phi_v_f[1],
                                                &phi_v_f[2], 3);
  FTensor::Tensor2<double *, 3, 3> t_diff_face_interior(
      &diff_phi_v_f[0], &diff_phi_v_f[3], &diff_phi_v_f[6], &diff_phi_v_f[1],
      &diff_phi_v_f[4], &diff_phi_v_f[7], &diff_phi_v_f[2], &diff_phi_v_f[5],
      &diff_phi_v_f[8], 9);

  FTensor::Tensor1<double *, 3> t_phi_v(&phi_v[0], &phi_v[1], &phi_v[2], 3);
  FTensor::Tensor2<double *, 3, 3> t_diff_phi_v(
      &diff_phi_v[0], &diff_phi_v[3], &diff_phi_v[6], &diff_phi_v[1],
      &diff_phi_v[4], &diff_phi_v[7], &diff_phi_v[2], &diff_phi_v[5],
      &diff_phi_v[8], 9);

  if (NBVOLUMETET_AINSWORTH_TET_HCURL(p) > 0) {
    FTensor::Tensor1<double *, 3> t_volume_interior(&phi_v_v[0], &phi_v_v[1],
                                                    &phi_v_v[2], 3);
    FTensor::Tensor2<double *, 3, 3> t_diff_volume_interior(
        &diff_phi_v_v[0], &diff_phi_v_v[3], &diff_phi_v_v[6], &diff_phi_v_v[1],
        &diff_phi_v_v[4], &diff_phi_v_v[7], &diff_phi_v_v[2], &diff_phi_v_v[5],
        &diff_phi_v_v[8], 9);
    for (int ii = 0; ii != nb_integration_pts; ii++) {
      int cc = 0;
      for (int oo = 0; oo <= p; oo++) {
        for (int ll = NBVOLUMETET_AINSWORTH_FACE_HCURL(oo - 1);
             ll != NBVOLUMETET_AINSWORTH_FACE_HCURL(oo); ll++) {
          t_phi_v(i) = t_face_interior(i);
          ++t_phi_v;
          ++t_face_interior;
          ++cc;
          t_diff_phi_v(i, j) = t_diff_face_interior(i, j);
          ++t_diff_phi_v;
          ++t_diff_face_interior;
        }
        for (int ll = NBVOLUMETET_AINSWORTH_TET_HCURL(oo - 1);
             ll != NBVOLUMETET_AINSWORTH_TET_HCURL(oo); ll++) {
          t_phi_v(i) = t_volume_interior(i);
          ++t_phi_v;
          ++t_volume_interior;
          ++cc;
          t_diff_phi_v(i, j) = t_diff_volume_interior(i, j);
          ++t_diff_phi_v;
          ++t_diff_volume_interior;
        }
      }
      // check consistency
      const int nb_base_fun_on_face = NBVOLUMETET_AINSWORTH_HCURL(p);
      if (cc != nb_base_fun_on_face) {
        SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
                 "Wrong number of base functions %d != %d", cc,
                 nb_base_fun_on_face);
      }
    }
  } else {
    for (int ii = 0; ii != nb_integration_pts; ii++) {
      int cc = 0;
      for (int oo = 0; oo <= p; oo++) {
        for (int ll = NBVOLUMETET_AINSWORTH_FACE_HCURL(oo - 1);
             ll != NBVOLUMETET_AINSWORTH_FACE_HCURL(oo); ll++) {
          t_phi_v(i) = t_face_interior(i);
          ++t_phi_v;
          ++t_face_interior;
          ++cc;
          t_diff_phi_v(i, j) = t_diff_face_interior(i, j);
          ++t_diff_phi_v;
          ++t_diff_face_interior;
        }
      }
      // check consistency
      const int nb_base_fun_on_face = NBVOLUMETET_AINSWORTH_HCURL(p);
      if (cc != nb_base_fun_on_face) {
        SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
                 "Wrong number of base functions %d != %d", cc,
                 nb_base_fun_on_face);
      }
    }
  }

  MoFEMFunctionReturnHot(0);
}

Hcurl_Ainsworth_VolumeInteriorFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Ainsworth_VolumeInteriorFunctions_MBTET	(	int	p,
		double *	N,
		double *	diffN,
		double *	phi_v,
		double *	diff_phi_v,
		int	nb_integration_pts,
		PetscErrorCode(*)(int p, double s, double *diff_s, double *L, double *diffL, const int dim)	base_polynomials
	)

Volume interior function.

On volume have (P-3)*(P-2)*(P-1)/2.

See NBVOLUMETET_AINSWORTH_TET_HCURL

Parameters

p	approximation order
N	nodal shape functions
diffN	derivatives of nodal shape functions
phi_v	calculated shape functions
diff_phi_v	derivatives of shape functions
nb_integration_pts	number of shape functions
base_polynomials	polynomial base function (f.e. Legendre of Lobatto)

Returns

error code

Definition at line 908 of file Hcurl.cpp.

                                                       {

  MoFEMFunctionBeginHot;

  if (NBVOLUMETET_AINSWORTH_TET_HCURL(p) == 0)
    MoFEMFunctionReturnHot(0);

  FTensor::Index<'i', 3> i;
  FTensor::Index<'j', 3> j;
  FTensor::Number<0> N0;
  FTensor::Number<1> N1;
  FTensor::Number<2> N2;

  FTensor::Tensor1<double *, 3> t_node_diff_ksi[4] = {
      FTensor::Tensor1<double *, 3>(&diffN[0], &diffN[1], &diffN[2]),
      FTensor::Tensor1<double *, 3>(&diffN[3], &diffN[4], &diffN[5]),
      FTensor::Tensor1<double *, 3>(&diffN[6], &diffN[7], &diffN[8]),
      FTensor::Tensor1<double *, 3>(&diffN[9], &diffN[10], &diffN[11])};

  double diff_ksi0i[3], diff_ksi0j[3], diff_ksi0k[3];
  FTensor::Tensor1<double *, 3> t_diff_ksi0i(diff_ksi0i, &diff_ksi0i[1],
                                             &diff_ksi0i[2]);
  FTensor::Tensor1<double *, 3> t_diff_ksi0j(diff_ksi0j, &diff_ksi0j[1],
                                             &diff_ksi0j[2]);
  FTensor::Tensor1<double *, 3> t_diff_ksi0k(diff_ksi0k, &diff_ksi0k[1],
                                             &diff_ksi0k[2]);
  t_diff_ksi0i(i) = t_node_diff_ksi[1](i) - t_node_diff_ksi[0](i);
  t_diff_ksi0j(i) = t_node_diff_ksi[2](i) - t_node_diff_ksi[0](i);
  t_diff_ksi0k(i) = t_node_diff_ksi[3](i) - t_node_diff_ksi[0](i);

  std::vector<double> v_psi_l_0i(p + 1), v_diff_psi_l_0i(3 * p + 3);
  std::vector<double> v_psi_l_0j(p + 1), v_diff_psi_l_0j(3 * p + 3);
  std::vector<double> v_psi_l_0k(p + 1), v_diff_psi_l_0k(3 * p + 3);
  double *psi_l_0i = &*v_psi_l_0i.begin();
  double *diff_psi_l_0i = &*v_diff_psi_l_0i.begin();
  double *psi_l_0j = &*v_psi_l_0j.begin();
  double *diff_psi_l_0j = &*v_diff_psi_l_0j.begin();
  double *psi_l_0k = &*v_psi_l_0k.begin();
  double *diff_psi_l_0k = &*v_diff_psi_l_0k.begin();

  FTensor::Tensor1<double *, 3> t_phi_v(&phi_v[0], &phi_v[1], &phi_v[2], 3);
  FTensor::Tensor2<double *, 3, 3> t_diff_phi_v(
      &diff_phi_v[0], &diff_phi_v[3], &diff_phi_v[6], &diff_phi_v[1],
      &diff_phi_v[4], &diff_phi_v[7], &diff_phi_v[2], &diff_phi_v[5],
      &diff_phi_v[8], 9);
  FTensor::Tensor1<double, 3> t_b;

  for (int ii = 0; ii != nb_integration_pts; ii++) {

    const int node_shift = ii * 4;
    const int n0 = node_shift + 0;
    const int n1 = node_shift + 1;
    const int n2 = node_shift + 2;
    const int n3 = node_shift + 3;

    const double beta_v = N[n0] * N[n1] * N[n2] * N[n3];

    const double ksi_0i = N[n1] - N[n0];
    ierr = base_polynomials(p, ksi_0i, diff_ksi0i, psi_l_0i, diff_psi_l_0i, 3);
    CHKERRG(ierr);
    const double ksi_0j = N[n2] - N[n0];
    ierr = base_polynomials(p, ksi_0j, diff_ksi0j, psi_l_0j, diff_psi_l_0j, 3);
    CHKERRG(ierr);
    const double ksi_0k = N[n3] - N[n0];
    ierr = base_polynomials(p, ksi_0k, diff_ksi0k, psi_l_0k, diff_psi_l_0k, 3);
    CHKERRG(ierr);

    FTensor::Tensor1<double, 3> t_diff_beta_v;
    t_diff_beta_v(j) = t_node_diff_ksi[0](j) * N[n1] * N[n2] * N[n3] +
                       N[n0] * t_node_diff_ksi[1](j) * N[n2] * N[n3] +
                       N[n0] * N[n1] * t_node_diff_ksi[2](j) * N[n3] +
                       N[n0] * N[n1] * N[n2] * t_node_diff_ksi[3](j);

    int cc = 0;
    for (int oo = 0; oo <= (p - 4); oo++) {
      FTensor::Tensor1<double *, 3> t_diff_psi_l_0i(
          &diff_psi_l_0i[0], &diff_psi_l_0i[p + 1], &diff_psi_l_0i[2 * p + 2],
          1);
      for (int pp0 = 0; pp0 <= oo; pp0++) {
        FTensor::Tensor1<double *, 3> t_diff_psi_l_0j(
            &diff_psi_l_0j[0], &diff_psi_l_0j[p + 1], &diff_psi_l_0j[2 * p + 2],
            1);
        for (int pp1 = 0; (pp0 + pp1) <= oo; pp1++) {
          const int pp2 = oo - pp0 - pp1;
          if (pp2 >= 0) {
            FTensor::Tensor1<double *, 3> t_diff_psi_l_0k(
                &diff_psi_l_0k[0 + pp2], &diff_psi_l_0k[p + 1 + pp2],
                &diff_psi_l_0k[2 * p + 2 + pp2], 1);
            const double t = psi_l_0i[pp0] * psi_l_0j[pp1] * psi_l_0k[pp2];
            const double a = beta_v * t;
            t_phi_v(0) = a;
            t_phi_v(1) = 0;
            t_phi_v(2) = 0;
            ++t_phi_v;
            ++cc;
            t_phi_v(0) = 0;
            t_phi_v(1) = a;
            t_phi_v(2) = 0;
            ++t_phi_v;
            ++cc;
            t_phi_v(0) = 0;
            t_phi_v(1) = 0;
            t_phi_v(2) = a;
            ++t_phi_v;
            ++cc;
            t_b(j) =
                t_diff_beta_v(j) * t +
                beta_v * (t_diff_psi_l_0i(j) * psi_l_0j[pp1] * psi_l_0k[pp2] +
                          psi_l_0i[pp0] * t_diff_psi_l_0j(j) * psi_l_0k[pp2] +
                          psi_l_0i[pp0] * psi_l_0j[pp1] * t_diff_psi_l_0k(j));
            t_diff_phi_v(N0, j) = t_b(j);
            t_diff_phi_v(N1, j) = 0;
            t_diff_phi_v(N2, j) = 0;
            ++t_diff_phi_v;
            t_diff_phi_v(N0, j) = 0;
            t_diff_phi_v(N1, j) = t_b(j);
            t_diff_phi_v(N2, j) = 0;
            ++t_diff_phi_v;
            t_diff_phi_v(N0, j) = 0;
            t_diff_phi_v(N1, j) = 0;
            t_diff_phi_v(N2, j) = t_b(j);
            ++t_diff_phi_v;
          }
          ++t_diff_psi_l_0j;
        }
        ++t_diff_psi_l_0i;
      }
    }

    const int nb_base_fun_on_face = NBVOLUMETET_AINSWORTH_TET_HCURL(p);
    if (cc != nb_base_fun_on_face) {
      SETERRQ2(PETSC_COMM_SELF, MOFEM_DATA_INCONSISTENCY,
               "Wrong number of base functions %d != %d", cc,
               nb_base_fun_on_face);
    }
  }
  MoFEMFunctionReturnHot(0);
}

Hcurl_Demkowicz_EdgeBaseFunctions_MBEDGE()

MoFEMErrorCode MoFEM::Hcurl_Demkowicz_EdgeBaseFunctions_MBEDGE	(	int	sense,
		int	p,
		double *	n,
		double *	diff_n,
		double *	phi,
		double *	diff_phi,
		int	nb_integration_pts
	)

Edge based H-curl base functions on edge.

Function generates hierarchical base of h-curl comforting functions on tetrahedral edge. For more details see [3].

Parameters

sense	sense fo edge (i.e. unique orientation)
p	array of oder for each edge
n	array shape functions evaluated at each integration point
diff_n	derivatives of shape functions
phi	base functions on edges
diff_phi	derivatives of edge shape functions
nb_integration_pts	number of integration points

Returns

error code

Definition at line 2278 of file Hcurl.cpp.

                                              {
  MoFEMFunctionBegin;

  FTensor::Tensor1<double, 3> t_grad_n[2];
  for (int nn = 0; nn != 2; ++nn) {
    t_grad_n[nn] = FTensor::Tensor1<double, 3>(diff_n[nn], 0., 0.);
  };

  HcurlEdgeBase h_curl_base_on_edge;

  FTensor::Tensor1<double *, 3> t_phi(&phi[HVEC0], &phi[HVEC1],
                                      &phi[HVEC2], 3);

  if (diff_phi != NULL) {
    SETERRQ(PETSC_COMM_WORLD, MOFEM_DATA_INCONSISTENCY,
            "Not implemented direvatives for edge for Hcurl Demkowicz base");
  }

  int n0_idx = 0;
  int n1_idx = 1;
  if (sense == -1) {
    int n_tmp = n0_idx;
    n0_idx = n1_idx;
    n1_idx = n_tmp;
  }

  CHKERR h_curl_base_on_edge(1, p, nb_integration_pts, n0_idx, n1_idx, n,
                             t_grad_n, t_phi);

  MoFEMFunctionReturn(0);
}

Hcurl_Demkowicz_EdgeBaseFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Demkowicz_EdgeBaseFunctions_MBTET	(	int *	sense,
		int *	p,
		double *	n,
		double *	diff_n,
		double *	phi[],
		double *	diff_phi[],
		int	nb_integration_pts
	)

Edge based H-curl base functions on tetrahedral.

Function generates hierarchical base of h-curl comforting functions on tetrahedral edge. For more details see [3].

Parameters

sense	sense fo edge (i.e. unique orientation)
p	array of oder for each edge
n	array shape functions evaluated at each integration point
diff_n	derivatives of shape functions
phi	base functions on edges
diff_phi	derivatives of edge shape functions
nb_integration_pts	number of integration points

Returns

error code

Definition at line 2191 of file Hcurl.cpp.

                                                {

  const int e_nodes[6][2] = {{0, 1}, {1, 2}, {2, 0}, {0, 3}, {1, 3}, {2, 3}};

  MoFEMFunctionBegin;

  FTensor::Tensor1<double, 3> t_grad_n[4];
  for (int nn = 0; nn != 4; ++nn) {
    t_grad_n[nn] = FTensor::Tensor1<double, 3>(
        diff_n[3 * nn + 0], diff_n[3 * nn + 1], diff_n[3 * nn + 2]);
    // cerr << t_grad_n[nn](0) << "  " << t_grad_n[nn](1) << " " << t_grad_n[nn](2)
    //      << endl;
  };


  HcurlEdgeBase h_curl_base_on_edge;

  for (int ee = 0; ee != 6; ++ee) {

    FTensor::Tensor1<double *, 3> t_phi(&phi[ee][HVEC0], &phi[ee][HVEC1],
                                        &phi[ee][HVEC2], 3);

    FTensor::Tensor2<double *, 3, 3> t_diff_phi(
        &diff_phi[ee][HVEC0_0], &diff_phi[ee][HVEC0_1],
        &diff_phi[ee][HVEC0_2], &diff_phi[ee][HVEC1_0],
        &diff_phi[ee][HVEC1_1], &diff_phi[ee][HVEC1_2],
        &diff_phi[ee][HVEC2_0], &diff_phi[ee][HVEC2_1],
        &diff_phi[ee][HVEC2_2], 9);

    int n0_idx = e_nodes[ee][0];
    int n1_idx = e_nodes[ee][1];
    if(sense[ee]==-1) {
      int n_tmp = n0_idx;
      n0_idx = n1_idx;
      n1_idx = n_tmp;
    }

    CHKERR h_curl_base_on_edge(4, p[ee], nb_integration_pts, n0_idx, n1_idx, n,
                               t_grad_n, t_phi, t_diff_phi);
  }

  MoFEMFunctionReturn(0);
}

Hcurl_Demkowicz_EdgeBaseFunctions_MBTRI()

MoFEMErrorCode MoFEM::Hcurl_Demkowicz_EdgeBaseFunctions_MBTRI	(	int *	sense,
		int *	p,
		double *	n,
		double *	diff_n,
		double *	phi[],
		double *	diff_phi[],
		int	nb_integration_pts
	)

Edge based H-curl base functions on teriangle.

Function generates hierarchical base of h-curl comforting functions on tetrahedral edge. For more details see [3].

Parameters

sense	sense fo edge (i.e. unique orientation)
p	array of oder for each edge
n	array shape functions evaluated at each integration point
diff_n	derivatives of shape functions
phi	base functions on edges
diff_phi	derivatives of edge shape functions
nb_integration_pts	number of integration points

Returns

error code

Definition at line 2237 of file Hcurl.cpp.

                                                {

  const int e_nodes[3][2] = {{0, 1}, {1, 2}, {2, 0}};

  MoFEMFunctionBegin;

  FTensor::Tensor1<double, 3> t_grad_n[3];
  for (int nn = 0; nn != 3; ++nn) {
    t_grad_n[nn] =
        FTensor::Tensor1<double, 3>(diff_n[2 * nn + 0], diff_n[2 * nn + 1], 0.);
  };

  HcurlEdgeBase h_curl_base_on_edge;

  for (int ee = 0; ee != 3; ++ee) {

    FTensor::Tensor1<double *, 3> t_phi(&phi[ee][HVEC0], &phi[ee][HVEC1],
                                        &phi[ee][HVEC2], 3);

    FTensor::Tensor2<FTensor::PackPtr<double *, 6>, 3, 2> t_diff_phi(
        &diff_phi[ee][HVEC0_0], &diff_phi[ee][HVEC0_1],
        &diff_phi[ee][HVEC1_0], &diff_phi[ee][HVEC1_1],
        &diff_phi[ee][HVEC2_0], &diff_phi[ee][HVEC2_1]);

    int n0_idx = e_nodes[ee][0];
    int n1_idx = e_nodes[ee][1];
    if(sense[ee]==-1) {
      int n_tmp = n0_idx;
      n0_idx = n1_idx;
      n1_idx = n_tmp;
    }

    CHKERR h_curl_base_on_edge(3, p[ee], nb_integration_pts, n0_idx, n1_idx, n,
                               t_grad_n, t_phi, t_diff_phi);
  }

  MoFEMFunctionReturn(0);
}

Hcurl_Demkowicz_FaceBaseFunctions_MBTET()

MoFEMErrorCode MoFEM::Hcurl_Demkowicz_FaceBaseFunctions_MBTET	(	int *	faces_nodes,
		int *	p,
		double *	n,
		double *	diff_n,
		double *	phi[],
		double *	diff_phi[],
		int	nb_integration_pts
	)

Face base interior function.

Parameters

face_nodes	array [4*3] of local indices of face nodes
p	approximation order
n	nodal shape functions
diff_n	derivatives of nodal shape functions
phi	calculated shape functions
diff_phi	derivatives of shape functions
nb_integration_pts	number of shape functions

Returns

error code

Definition at line 2717 of file Hcurl.cpp.

                                                                       {
  MoFEMFunctionBegin;

  FTensor::Tensor1<double, 3> t_grad_n[4];
  for (int nn = 0; nn != 4; ++nn) {
    t_grad_n[nn] = FTensor::Tensor1<double, 3>(
        diff_n[3 * nn + 0], diff_n[3 * nn + 1], diff_n[3 * nn + 2]);
  };

  HcurlFaceBase h_curl_face_base;

  for (int ff = 0; ff != 4; ++ff) {

    if (p[ff] < 2)
      continue;

    FTensor::Tensor1<double *, 3> t_phi(&phi[ff][HVEC0], &phi[ff][HVEC1],
                                        &phi[ff][HVEC2], 3);

    FTensor::Tensor2<double *, 3, 3> t_diff_phi(
        &diff_phi[ff][HVEC0_0], &diff_phi[ff][HVEC0_1],
        &diff_phi[ff][HVEC0_2], &diff_phi[ff][HVEC1_0],
        &diff_phi[ff][HVEC1_1], &diff_phi[ff][HVEC1_2],
        &diff_phi[ff][HVEC2_0], &diff_phi[ff][HVEC2_1],
        &diff_phi[ff][