Nektar++
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Public Member Functions | Private Member Functions | List of all members
Nektar::MultiRegions::AssemblyMapCG3D Class Reference

Constructs mappings for the C0 scalar continuous Galerkin formulation. More...

#include <AssemblyMapCG3D.h>

Inheritance diagram for Nektar::MultiRegions::AssemblyMapCG3D:
Inheritance graph
[legend]
Collaboration diagram for Nektar::MultiRegions::AssemblyMapCG3D:
Collaboration graph
[legend]

Public Member Functions

 AssemblyMapCG3D (const LibUtilities::SessionReaderSharedPtr &pSession, const std::string variable="DefaultVar")
 Default constructor.
 AssemblyMapCG3D (const LibUtilities::SessionReaderSharedPtr &pSession, const int numLocalCoeffs, const ExpList &locExp, const Array< OneD, const ExpListSharedPtr > &bndCondExp, const Array< OneD, const SpatialDomains::BoundaryConditionShPtr > &bndConditions, const PeriodicMap &periodicVerts, const PeriodicMap &periodicEdges, const PeriodicMap &periodicFaces, const bool checkIfSystemSingular, const std::string variable="DefaultVar")
 Constructor for the 3D expansion mappings with boundary conditions.
 AssemblyMapCG3D (const LibUtilities::SessionReaderSharedPtr &pSession, const int numLocalCoeffs, const ExpList &locExp)
 General constructor for expansions of all dimensions without boundary conditions.
virtual ~AssemblyMapCG3D ()
 Destructor.
- Public Member Functions inherited from Nektar::MultiRegions::AssemblyMapCG
 AssemblyMapCG (const LibUtilities::SessionReaderSharedPtr &pSession, const std::string variable="DefaultVar")
 Default constructor.
 AssemblyMapCG (const LibUtilities::SessionReaderSharedPtr &pSession, const int numLocalCoeffs, const ExpList &locExp)
 General constructor for expansions of all dimensions without boundary conditions.
virtual ~AssemblyMapCG ()
 Destructor.
map< int, vector< ExtraDirDof > > & GetExtraDirDofs ()
- Public Member Functions inherited from Nektar::MultiRegions::AssemblyMap
 AssemblyMap ()
 Default constructor.
 AssemblyMap (const LibUtilities::SessionReaderSharedPtr &pSession, const std::string variable="DefaultVar")
 Constructor with a communicator.
 AssemblyMap (AssemblyMap *oldLevelMap, const BottomUpSubStructuredGraphSharedPtr &multiLevelGraph)
 Constructor for next level in multi-level static condensation.
virtual ~AssemblyMap ()
 Destructor.
LibUtilities::CommSharedPtr GetComm ()
 Retrieves the communicator.
size_t GetHash () const
 Retrieves the hash of this map.
int GetLocalToGlobalMap (const int i) const
int GetGlobalToUniversalMap (const int i) const
int GetGlobalToUniversalMapUnique (const int i) const
const Array< OneD, const int > & GetLocalToGlobalMap ()
const Array< OneD, const int > & GetGlobalToUniversalMap ()
const Array< OneD, const int > & GetGlobalToUniversalMapUnique ()
NekDouble GetLocalToGlobalSign (const int i) const
const Array< OneD, NekDouble > & GetLocalToGlobalSign () const
void LocalToGlobal (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global) const
void LocalToGlobal (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global) const
void GlobalToLocal (const Array< OneD, const NekDouble > &global, Array< OneD, NekDouble > &loc) const
void GlobalToLocal (const NekVector< NekDouble > &global, NekVector< NekDouble > &loc) const
void Assemble (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global) const
void Assemble (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global) const
void UniversalAssemble (Array< OneD, NekDouble > &pGlobal) const
void UniversalAssemble (NekVector< NekDouble > &pGlobal) const
void UniversalAssemble (Array< OneD, NekDouble > &pGlobal, int offset) const
int GetLocalToGlobalBndMap (const int i) const
 Retrieve the global index of a given local boundary mode.
const Array< OneD, const int > & GetLocalToGlobalBndMap ()
 Retrieve the global indices of the local boundary modes.
const Array< OneD, const int > & GetGlobalToUniversalBndMap ()
const Array< OneD, const int > & GetGlobalToUniversalBndMapUnique ()
bool GetSignChange ()
 Returns true if using a modal expansion requiring a change of sign of some modes.
NekDouble GetLocalToGlobalBndSign (const int i) const
 Retrieve the sign change of a given local boundary mode.
Array< OneD, const NekDouble > GetLocalToGlobalBndSign () const
 Retrieve the sign change for all local boundary modes.
int GetBndCondCoeffsToGlobalCoeffsMap (const int i)
 Retrieves the global index corresponding to a boundary expansion mode.
const Array< OneD, const int > & GetBndCondCoeffsToGlobalCoeffsMap ()
 Retrieves the global indices corresponding to the boundary expansion modes.
NekDouble GetBndCondCoeffsToGlobalCoeffsSign (const int i)
 Returns the modal sign associated with a given boundary expansion mode.
int GetBndCondTraceToGlobalTraceMap (const int i)
 Returns the global index of the boundary trace giving the index on the boundary expansion.
const Array< OneD, const int > & GetBndCondTraceToGlobalTraceMap ()
int GetNumGlobalDirBndCoeffs () const
 Returns the number of global Dirichlet boundary coefficients.
int GetNumLocalDirBndCoeffs () const
 Returns the number of local Dirichlet boundary coefficients.
int GetNumGlobalBndCoeffs () const
 Returns the total number of global boundary coefficients.
int GetNumLocalBndCoeffs () const
 Returns the total number of local boundary coefficients.
int GetNumLocalCoeffs () const
 Returns the total number of local coefficients.
int GetNumGlobalCoeffs () const
 Returns the total number of global coefficients.
bool GetSingularSystem () const
 Retrieves if the system is singular (true) or not (false)
void GlobalToLocalBnd (const NekVector< NekDouble > &global, NekVector< NekDouble > &loc, int offset) const
void GlobalToLocalBnd (const NekVector< NekDouble > &global, NekVector< NekDouble > &loc) const
void GlobalToLocalBnd (const Array< OneD, const NekDouble > &global, Array< OneD, NekDouble > &loc, int offset) const
void GlobalToLocalBnd (const Array< OneD, const NekDouble > &global, Array< OneD, NekDouble > &loc) const
void LocalBndToGlobal (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global, int offset) const
void LocalBndToGlobal (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global) const
void LocalBndToGlobal (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global, int offset) const
void LocalBndToGlobal (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global) const
void AssembleBnd (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global, int offset) const
void AssembleBnd (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global) const
void AssembleBnd (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global, int offset) const
void AssembleBnd (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global) const
void UniversalAssembleBnd (Array< OneD, NekDouble > &pGlobal) const
void UniversalAssembleBnd (NekVector< NekDouble > &pGlobal) const
void UniversalAssembleBnd (Array< OneD, NekDouble > &pGlobal, int offset) const
int GetFullSystemBandWidth () const
int GetNumNonDirVertexModes () const
int GetNumNonDirEdgeModes () const
int GetNumNonDirFaceModes () const
int GetNumDirEdges () const
int GetNumDirFaces () const
int GetNumNonDirEdges () const
int GetNumNonDirFaces () const
void PrintStats (std::ostream &out, std::string variable) const
const Array< OneD, const int > & GetExtraDirEdges ()
boost::shared_ptr< AssemblyMap > LinearSpaceMap (const ExpList &locexp, GlobalSysSolnType solnType)
int GetBndSystemBandWidth () const
 Returns the bandwidth of the boundary system.
int GetStaticCondLevel () const
 Returns the level of static condensation for this map.
int GetNumPatches () const
 Returns the number of patches in this static condensation level.
const Array< OneD, const
unsigned int > & 		GetNumLocalBndCoeffsPerPatch ()
 Returns the number of local boundary coefficients in each patch.
const Array< OneD, const
unsigned int > & 		GetNumLocalIntCoeffsPerPatch ()
 Returns the number of local interior coefficients in each patch.
const AssemblyMapSharedPtr GetNextLevelLocalToGlobalMap () const
 Returns the local to global mapping for the next level in the multi-level static condensation.
void SetNextLevelLocalToGlobalMap (AssemblyMapSharedPtr pNextLevelLocalToGlobalMap)
const PatchMapSharedPtr & GetPatchMapFromPrevLevel (void) const
 Returns the patch map from the previous level of the multi-level static condensation.
bool AtLastLevel () const
 Returns true if this is the last level in the multi-level static condensation.
GlobalSysSolnType GetGlobalSysSolnType () const
 Returns the method of solving global systems.
PreconditionerType GetPreconType () const
NekDouble GetIterativeTolerance () const
int GetSuccessiveRHS () const
int GetLowestStaticCondLevel () const

Private Member Functions

void SetUp3DExpansionC0ContMap (const int numLocalCoeffs, const ExpList &locExp, const Array< OneD, const ExpListSharedPtr > &bndCondExp=NullExpListSharedPtrArray, const Array< OneD, const SpatialDomains::BoundaryConditionShPtr > &bndConditions=SpatialDomains::NullBoundaryConditionShPtrArray, const PeriodicMap &periodicVerts=NullPeriodicMap, const PeriodicMap &periodicEdges=NullPeriodicMap, const PeriodicMap &periodicFaces=NullPeriodicMap, const bool checkIfSystemSingular=false)
 Construct mappings for a three-dimensional scalar expansion.

Additional Inherited Members

- Protected Member Functions inherited from Nektar::MultiRegions::AssemblyMapCG
void SetUpUniversalC0ContMap (const ExpList &locExp, const PeriodicMap &perVerts=NullPeriodicMap, const PeriodicMap &perEdges=NullPeriodicMap, const PeriodicMap &perFaces=NullPeriodicMap)
void CalculateFullSystemBandWidth ()
 Calculate the bandwith of the full matrix system.
virtual int v_GetLocalToGlobalMap (const int i) const
virtual int v_GetGlobalToUniversalMap (const int i) const
virtual int v_GetGlobalToUniversalMapUnique (const int i) const
virtual const Array< OneD,
const int > & 		v_GetLocalToGlobalMap ()
virtual const Array< OneD,
const int > & 		v_GetGlobalToUniversalMap ()
virtual const Array< OneD,
const int > & 		v_GetGlobalToUniversalMapUnique ()
virtual NekDouble v_GetLocalToGlobalSign (const int i) const
virtual const Array< OneD,
NekDouble > & 		v_GetLocalToGlobalSign () const
virtual void v_LocalToGlobal (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global) const
virtual void v_LocalToGlobal (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global) const
virtual void v_GlobalToLocal (const Array< OneD, const NekDouble > &global, Array< OneD, NekDouble > &loc) const
virtual void v_GlobalToLocal (const NekVector< NekDouble > &global, NekVector< NekDouble > &loc) const
virtual void v_Assemble (const Array< OneD, const NekDouble > &loc, Array< OneD, NekDouble > &global) const
virtual void v_Assemble (const NekVector< NekDouble > &loc, NekVector< NekDouble > &global) const
virtual void v_UniversalAssemble (Array< OneD, NekDouble > &pGlobal) const
virtual void v_UniversalAssemble (NekVector< NekDouble > &pGlobal) const
virtual void v_UniversalAssemble (Array< OneD, NekDouble > &pGlobal, int offset) const
virtual int v_GetFullSystemBandWidth () const
virtual int v_GetNumNonDirVertexModes () const
virtual int v_GetNumNonDirEdgeModes () const
virtual int v_GetNumNonDirFaceModes () const
virtual int v_GetNumDirEdges () const
virtual int v_GetNumDirFaces () const
virtual int v_GetNumNonDirEdges () const
virtual int v_GetNumNonDirFaces () const
virtual const Array< OneD,
const int > & 		v_GetExtraDirEdges ()
virtual AssemblyMapSharedPtr v_LinearSpaceMap (const ExpList &locexp, GlobalSysSolnType solnType)
 Construct an AssemblyMapCG object which corresponds to the linear space of the current object.
- Protected Attributes inherited from Nektar::MultiRegions::AssemblyMapCG
Array< OneD, int > m_localToGlobalMap
 Integer map of local coeffs to global space.
Array< OneD, NekDouble > m_localToGlobalSign
 Integer sign of local coeffs to global space.
int m_fullSystemBandWidth
 Bandwith of the full matrix system (no static condensation).
Array< OneD, int > m_globalToUniversalMap
 Integer map of process coeffs to universal space.
Array< OneD, int > m_globalToUniversalMapUnique
 Integer map of unique process coeffs to universal space (signed)
int m_numNonDirVertexModes
 Number of non Dirichlet vertex modes.
int m_numNonDirEdgeModes
 Number of non Dirichlet edge modes.
int m_numNonDirFaceModes
 Number of non Dirichlet face modes.
int m_numDirEdges
 Number of Dirichlet edges.
int m_numDirFaces
 Number of Dirichlet faces.
int m_numNonDirEdges
 Number of Dirichlet edges.
int m_numNonDirFaces
 Number of Dirichlet faces.
Array< OneD, int > m_extraDirEdges
 Extra dirichlet edges in parallel.
int m_maxStaticCondLevel
 Maximum static condensation level.
map< int, vector< ExtraDirDof > > m_extraDirDofs
 Map indicating degrees of freedom which are Dirichlet but whose value is stored on another processor.

Detailed Description

Constructs mappings for the C0 scalar continuous Galerkin formulation.

Mappings are created for three possible global solution types:

These mappings are used by GlobalLinSys to generate the global system.

Definition at line 54 of file AssemblyMapCG3D.h.

Constructor & Destructor Documentation

Nektar::MultiRegions::AssemblyMapCG3D::AssemblyMapCG3D ( const LibUtilities::SessionReaderSharedPtr &  pSession,
const std::string  variable = "DefaultVar" 
)

Default constructor.

Definition at line 67 of file AssemblyMapCG3D.cpp.

:
AssemblyMapCG(pSession,variable)
{
}
Nektar::MultiRegions::AssemblyMapCG3D::AssemblyMapCG3D ( const LibUtilities::SessionReaderSharedPtr &  pSession,
const int  numLocalCoeffs,
const ExpList &  locExp,
const Array< OneD, const ExpListSharedPtr > &  bndCondExp,
const Array< OneD, const SpatialDomains::BoundaryConditionShPtr > &  bndConditions,
const PeriodicMap &  periodicVerts,
const PeriodicMap &  periodicEdges,
const PeriodicMap &  periodicFaces,
const bool  checkIfSystemSingular,
const std::string  variable = "DefaultVar" 
)

Constructor for the 3D expansion mappings with boundary conditions.

Definition at line 79 of file AssemblyMapCG3D.cpp.

References Nektar::MultiRegions::AssemblyMap::CalculateBndSystemBandWidth(), Nektar::MultiRegions::AssemblyMapCG::CalculateFullSystemBandWidth(), and SetUp3DExpansionC0ContMap().

:
AssemblyMapCG(pSession,variable)
{
SetUp3DExpansionC0ContMap(numLocalCoeffs,
locExp,
bndCondExp,
bndConditions,
periodicVerts,
periodicEdges,
periodicFaces,
checkIfSystemSingular);
CalculateBndSystemBandWidth();
CalculateFullSystemBandWidth();
}
Nektar::MultiRegions::AssemblyMapCG3D::AssemblyMapCG3D ( const LibUtilities::SessionReaderSharedPtr &  pSession,
const int  numLocalCoeffs,
const ExpList &  locExp 
)

General constructor for expansions of all dimensions without boundary conditions.

Definition at line 109 of file AssemblyMapCG3D.cpp.

References Nektar::MultiRegions::AssemblyMap::CalculateBndSystemBandWidth(), Nektar::MultiRegions::AssemblyMapCG::CalculateFullSystemBandWidth(), and SetUp3DExpansionC0ContMap().

:
AssemblyMapCG(pSession)
{
SetUp3DExpansionC0ContMap(numLocalCoeffs, locExp);
CalculateBndSystemBandWidth();
CalculateFullSystemBandWidth();
}
Nektar::MultiRegions::AssemblyMapCG3D::~AssemblyMapCG3D ( )
virtual

Destructor.

Definition at line 124 of file AssemblyMapCG3D.cpp.

{
}

Member Function Documentation

void Nektar::MultiRegions::AssemblyMapCG3D::SetUp3DExpansionC0ContMap ( const int  numLocalCoeffs,
const ExpList &  locExp,
const Array< OneD, const ExpListSharedPtr > &  bndCondExp = NullExpListSharedPtrArray,
const Array< OneD, const SpatialDomains::BoundaryConditionShPtr > &  bndConditions = SpatialDomains::NullBoundaryConditionShPtrArray,
const PeriodicMap &  periodicVerts = NullPeriodicMap,
const PeriodicMap &  periodicEdges = NullPeriodicMap,
const PeriodicMap &  periodicFaces = NullPeriodicMap,
const bool  checkIfSystemSingular = false 
)
private

Construct mappings for a three-dimensional scalar expansion.

Construction of the local->global map is achieved in several stages. A mesh vertex, mesh edge and mesh face renumbering is constructed in #vertReorderedGraphVertId, #edgeReorderedGraphVertId and #faceReorderedGraphVertId

The only unique identifiers of the vertices, edges and faces of the mesh are the vertex id and the mesh id (stored in their corresponding Geometry object). However, setting up a global numbering based on these id's will not lead to a suitable or optimal numbering. Mainly because:

That's why the vertices, edges and faces will be rearranged. This is done in the following way: The vertices, edges and faces of the mesh are considered as vertices of a graph (in a computer science way) (equivalently, they can also be considered as boundary degrees of freedom, whereby all boundary modes of a single edge are considered as a single DOF). We then will use algorithms to reorder these graph-vertices (or boundary DOF's).

We will use a boost graph object to store this graph the first template parameter (=OutEdgeList) is chosen to be of type std::set as in the set up of the adjacency, a similar edge might be created multiple times. And to prevent the definition of parallel edges, we use std::set (=boost::setS) rather than std::vector (=boost::vecS).

Two different containers are used to store the graph vertex id's of the different mesh vertices and edges. They are implemented as a STL map such that the graph vertex id can later be retrieved by the unique mesh vertex or edge id's which serve as the key of the map.

Therefore, the algorithm proceeds as follows:

STEP 1: Order the Dirichlet vertices and edges first

STEP 1.5: Exchange Dirichlet mesh vertices between processes and check for singular problems.

STEP 2: Now order all other vertices and edges in the graph and create a temporary numbering of domain-interior vertices and edges.

STEP 3: Reorder graph for optimisation.

STEP 4: Fill the #vertReorderedGraphVertId and #edgeReorderedGraphVertId with the optimal ordering from boost.

STEP 5: Set up an array which contains the offset information of the different graph vertices.

This basically means to identify to how many global degrees of freedom the individual graph vertices correspond. Obviously, the graph vertices corresponding to the mesh-vertices account for a single global DOF. However, the graph vertices corresponding to the element edges correspond to N-2 global DOF where N is equal to the number of boundary modes on this edge.

STEP 6: Now, all ingredients are ready to set up the actual local to global mapping.

The remainder of the map consists of the element-interior degrees of freedom. This leads to the block-diagonal submatrix as each element-interior mode is globally orthogonal to modes in all other elements.

STEP 7: The boundary condition mapping is generated from the same vertex renumbering.

Definition at line 170 of file AssemblyMapCG3D.cpp.

References ASSERTL0, ASSERTL1, Nektar::MultiRegions::CuthillMckeeReordering(), Nektar::MultiRegions::DeterminePeriodicFaceOrient(), Nektar::StdRegions::eBackwards, Nektar::MultiRegions::eDirectFullMatrix, Nektar::MultiRegions::eDirectMultiLevelStaticCond, Nektar::MultiRegions::eDirectStaticCond, Nektar::SpatialDomains::eDirichlet, Nektar::StdRegions::eForwards, Nektar::MultiRegions::eIterativeFull, Nektar::MultiRegions::eIterativeMultiLevelStaticCond, Nektar::MultiRegions::eIterativeStaticCond, Nektar::LibUtilities::eModified_A, Nektar::LibUtilities::eModified_B, Nektar::SpatialDomains::eNeumann, Nektar::MultiRegions::ePETScFullMatrix, Nektar::MultiRegions::ePETScMultiLevelStaticCond, Nektar::MultiRegions::ePETScStaticCond, Nektar::MultiRegions::eXxtMultiLevelStaticCond, Nektar::MultiRegions::eXxtStaticCond, Gs::Gather(), Nektar::MultiRegions::ExpList::GetCoeff_Offset(), Nektar::MultiRegions::ExpList::GetExp(), Nektar::LocalRegions::Expansion::GetGeom(), Nektar::LocalRegions::Expansion2D::GetGeom2D(), Nektar::LocalRegions::Expansion3D::GetGeom3D(), Nektar::MultiRegions::ExpList::GetOffset_Elmt_Id(), Nektar::StdRegions::StdExpansion::GetVertexMap(), Nektar::MultiRegions::GlobalSysSolnTypeMap, Gs::gs_add, Vmath::Imax(), Gs::Init(), Nektar::iterator, Nektar::MultiRegions::AssemblyMap::m_bndCondCoeffsToGlobalCoeffsMap, Nektar::MultiRegions::AssemblyMap::m_bndCondCoeffsToGlobalCoeffsSign, Nektar::MultiRegions::AssemblyMap::m_comm, Nektar::MultiRegions::AssemblyMapCG::m_extraDirDofs, Nektar::MultiRegions::AssemblyMapCG::m_extraDirEdges, Nektar::MultiRegions::AssemblyMap::m_hash, Nektar::MultiRegions::AssemblyMap::m_localToGlobalBndMap, Nektar::MultiRegions::AssemblyMap::m_localToGlobalBndSign, Nektar::MultiRegions::AssemblyMapCG::m_localToGlobalMap, Nektar::MultiRegions::AssemblyMapCG::m_localToGlobalSign, Nektar::MultiRegions::AssemblyMap::m_lowestStaticCondLevel, Nektar::MultiRegions::AssemblyMap::m_nextLevelLocalToGlobalMap, Nektar::MultiRegions::AssemblyMapCG::m_numDirEdges, Nektar::MultiRegions::AssemblyMapCG::m_numDirFaces, Nektar::MultiRegions::AssemblyMap::m_numGlobalBndCoeffs, Nektar::MultiRegions::AssemblyMap::m_numGlobalCoeffs, Nektar::MultiRegions::AssemblyMap::m_numGlobalDirBndCoeffs, Nektar::MultiRegions::AssemblyMap::m_numLocalBndCoeffs, Nektar::MultiRegions::AssemblyMap::m_numLocalBndCoeffsPerPatch, Nektar::MultiRegions::AssemblyMap::m_numLocalCoeffs, Nektar::MultiRegions::AssemblyMap::m_numLocalDirBndCoeffs, Nektar::MultiRegions::AssemblyMap::m_numLocalIntCoeffsPerPatch, Nektar::MultiRegions::AssemblyMapCG::m_numNonDirEdgeModes, Nektar::MultiRegions::AssemblyMapCG::m_numNonDirEdges, Nektar::MultiRegions::AssemblyMapCG::m_numNonDirFaceModes, Nektar::MultiRegions::AssemblyMapCG::m_numNonDirFaces, Nektar::MultiRegions::AssemblyMapCG::m_numNonDirVertexModes, Nektar::MultiRegions::AssemblyMap::m_numPatches, Nektar::MultiRegions::AssemblyMap::m_session, Nektar::MultiRegions::AssemblyMap::m_signChange, Nektar::MultiRegions::AssemblyMap::m_solnType, Nektar::MultiRegions::AssemblyMap::m_staticCondLevel, Nektar::MultiRegions::MultiLevelBisectionReordering(), Nektar::MultiRegions::NoReordering(), Nektar::LibUtilities::ReduceMax, Nektar::LibUtilities::ReduceMin, Nektar::LibUtilities::ReduceSum, Nektar::MultiRegions::AssemblyMapCG::SetUpUniversalC0ContMap(), Nektar::MultiRegions::AssemblyMap::UniversalAssembleBnd(), Vmath::Vmax(), and Vmath::Vsum().

Referenced by AssemblyMapCG3D().

{
int i,j,k,l;
int cnt = 0;
int intDofCnt;
int meshVertId;
int meshVertId2;
int meshEdgeId;
int meshEdgeId2;
int meshFaceId;
int globalId;
int nEdgeInteriorCoeffs;
int nFaceInteriorCoeffs;
int firstNonDirGraphVertId;
int nLocBndCondDofs = 0;
int nLocDirBndCondDofs = 0;
int graphVertId = 0;
LocalRegions::Expansion3DSharedPtr locExpansion;
LocalRegions::Expansion2DSharedPtr bndCondFaceExp;
LibUtilities::BasisType bType;
StdRegions::Orientation edgeOrient;
StdRegions::Orientation faceOrient;
Array<OneD, unsigned int> edgeInteriorMap;
Array<OneD, int> edgeInteriorSign;
Array<OneD, unsigned int> faceInteriorMap;
Array<OneD, int> faceInteriorSign;
PeriodicMap::const_iterator pIt;
const LocalRegions::ExpansionVector &locExpVector = *(locExp.GetExp());
m_signChange = false;
//m_systemSingular = false;
map<int,int> vertReorderedGraphVertId;
map<int,int> edgeReorderedGraphVertId;
map<int,int> faceReorderedGraphVertId;
map<int,int>::iterator mapIt;
map<int,int>::const_iterator mapConstIt;
map<int,pair<int, StdRegions::Orientation> >::const_iterator mapFaceIt;
bool systemSingular = (checkIfSystemSingular)? true: false;
/**
* STEP 1: Order the Dirichlet vertices and edges first
*/
for(i = 0; i < bndCondExp.num_elements(); i++)
{
// Check to see if any value on face has Dirichlet value.
cnt = 0;
for(j = 0; j < bndCondExp[i]->GetNumElmts(); j++)
{
bndCondFaceExp = bndCondExp[i]->GetExp(j)
->as<LocalRegions::Expansion2D>();
if (bndConditions[i]->GetBoundaryConditionType() ==
SpatialDomains::eDirichlet)
{
for(k = 0; k < bndCondFaceExp->GetNverts(); k++)
{
meshVertId = bndCondFaceExp->GetGeom2D()->GetVid(k);
if(vertReorderedGraphVertId.count(meshVertId) == 0)
{
vertReorderedGraphVertId[meshVertId] = graphVertId++;
}
}
for(k = 0; k < bndCondFaceExp->GetNedges(); k++)
{
meshEdgeId = bndCondFaceExp->GetGeom2D()->GetEid(k);
if(edgeReorderedGraphVertId.count(meshEdgeId) == 0)
{
edgeReorderedGraphVertId[meshEdgeId] = graphVertId++;
}
}
meshFaceId = bndCondFaceExp->GetGeom2D()->GetFid();
faceReorderedGraphVertId[meshFaceId] = graphVertId++;
nLocDirBndCondDofs += bndCondFaceExp->GetNcoeffs();
}
if (bndConditions[i]->GetBoundaryConditionType() !=
SpatialDomains::eNeumann &&
checkIfSystemSingular == true)
{
systemSingular = false;
}
nLocBndCondDofs += bndCondFaceExp->GetNcoeffs();
}
}
// Number of dirichlet edges and faces (not considering periodic BCs)
m_numDirEdges = edgeReorderedGraphVertId.size();
m_numDirFaces = faceReorderedGraphVertId.size();
/**
* STEP 1.5: Exchange Dirichlet mesh vertices between processes and
* check for singular problems.
*/
// Collate information on Dirichlet vertices from all processes
int n = m_comm->GetSize();
int p = m_comm->GetRank();
// At this point vertReorderedGraphVertId only contains
// information from Dirichlet boundaries. Therefore make a
// global list of the vert and edge information on all
// processors
Array<OneD, int> vertcounts (n, 0);
Array<OneD, int> vertoffsets(n, 0);
Array<OneD, int> edgecounts (n, 0);
Array<OneD, int> edgeoffsets(n, 0);
vertcounts[p] = vertReorderedGraphVertId.size();
edgecounts[p] = edgeReorderedGraphVertId.size();
m_comm->AllReduce(vertcounts, LibUtilities::ReduceSum);
m_comm->AllReduce(edgecounts, LibUtilities::ReduceSum);
for (i = 1; i < n; ++i)
{
vertoffsets[i] = vertoffsets[i-1] + vertcounts[i-1];
edgeoffsets[i] = edgeoffsets[i-1] + edgecounts[i-1];
}
int nTotVerts = Vmath::Vsum(n,vertcounts,1);
int nTotEdges = Vmath::Vsum(n,edgecounts,1);
Array<OneD, int> vertlist(nTotVerts, 0);
Array<OneD, int> edgelist(nTotEdges, 0);
std::map<int, int>::iterator it;
// construct list of global ids of global vertices
for (it = vertReorderedGraphVertId.begin(), i = 0;
it != vertReorderedGraphVertId.end();
++it, ++i)
{
vertlist[vertoffsets[p] + i] = it->first;
}
// construct list of global ids of global edges
for (it = edgeReorderedGraphVertId.begin(), i = 0;
it != edgeReorderedGraphVertId.end();
++it, ++i)
{
edgelist[edgeoffsets[p] + i] = it->first;
}
m_comm->AllReduce(vertlist, LibUtilities::ReduceSum);
m_comm->AllReduce(edgelist, LibUtilities::ReduceSum);
// Now we have a list of all Dirichlet vertices and edges on all
// processors.
int nExtraDirichlet = 0;
map<int, int> extraDirVertIds, extraDirEdgeIds;
// Ensure Dirchlet vertices are consistently recorded between
// processes (e.g. Dirichlet region meets Neumann region across a
// partition boundary requires vertex on partition to be Dirichlet).
//
// To do this we look over all elements and vertices in local
// partition and see if they match the values stored in the vertlist
// from othe processors and if so record the meshVertId/meshEdgeId
// and the processor it comes from.
for (i = 0; i < n; ++i)
{
if (i == p)
{
continue;
}
for(j = 0; j < locExpVector.size(); j++)
{
locExpansion = locExpVector[locExp.GetOffset_Elmt_Id(j)]
->as<LocalRegions::Expansion3D>();
for(k = 0; k < locExpansion->GetNverts(); k++)
{
meshVertId = locExpansion->GetGeom3D()->GetVid(k);
if(vertReorderedGraphVertId.count(meshVertId) == 0)
{
for (l = 0; l < vertcounts[i]; ++l)
{
if (vertlist[vertoffsets[i]+l] == meshVertId)
{
extraDirVertIds[meshVertId] = i;
vertReorderedGraphVertId[meshVertId] = graphVertId++;
nExtraDirichlet++;
}
}
}
}
for(k = 0; k < locExpansion->GetNedges(); k++)
{
meshEdgeId = locExpansion->GetGeom3D()->GetEid(k);
if(edgeReorderedGraphVertId.count(meshEdgeId) == 0)
{
for (l = 0; l < edgecounts[i]; ++l)
{
if (edgelist[edgeoffsets[i]+l] == meshEdgeId)
{
extraDirEdgeIds[meshEdgeId] = i;
edgeReorderedGraphVertId[meshEdgeId] = graphVertId++;
nExtraDirichlet += locExpansion->GetEdgeNcoeffs(k) - 2;
}
}
}
}
}
}
// Low Energy preconditioner needs to know how many extra Dirichlet
// edges are on this process so store map in array.
int m_extradiredges = extraDirEdgeIds.size();
m_extraDirEdges = Array<OneD, int>(m_extradiredges, -1);
i = 0;
for (mapConstIt = extraDirEdgeIds.begin();
mapConstIt != extraDirEdgeIds.end(); mapConstIt++)
{
meshEdgeId = mapConstIt->first;
m_extraDirEdges[i++] = meshEdgeId;
}
// Now we have a list of all vertices and edges that are Dirichlet
// and not defined on the local partition as well as which processor
// they are stored on.
//
// Make a full list of all such entities on all processors and which
// processor they belong to.
for (i = 0; i < n; ++i)
{
vertcounts [i] = 0;
vertoffsets[i] = 0;
edgecounts [i] = 0;
edgeoffsets[i] = 0;
}
vertcounts[p] = extraDirVertIds.size();
edgecounts[p] = extraDirEdgeIds.size();
m_comm->AllReduce(vertcounts, LibUtilities::ReduceSum);
m_comm->AllReduce(edgecounts, LibUtilities::ReduceSum);
nTotVerts = Vmath::Vsum(n, vertcounts, 1);
nTotEdges = Vmath::Vsum(n, edgecounts, 1);
vertoffsets[0] = edgeoffsets[0] = 0;
for (i = 1; i < n; ++i)
{
vertoffsets[i] = vertoffsets[i-1] + vertcounts[i-1];
edgeoffsets[i] = edgeoffsets[i-1] + edgecounts[i-1];
}
Array<OneD, int> vertids (nTotVerts, 0);
Array<OneD, int> edgeids (nTotEdges, 0);
Array<OneD, int> vertprocs(nTotVerts, 0);
Array<OneD, int> edgeprocs(nTotEdges, 0);
for (it = extraDirVertIds.begin(), i = 0;
it != extraDirVertIds.end(); ++it, ++i)
{
vertids [vertoffsets[p]+i] = it->first;
vertprocs[vertoffsets[p]+i] = it->second;
}
for (it = extraDirEdgeIds.begin(), i = 0;
it != extraDirEdgeIds.end(); ++it, ++i)
{
edgeids [edgeoffsets[p]+i] = it->first;
edgeprocs[edgeoffsets[p]+i] = it->second;
}
m_comm->AllReduce(vertids, LibUtilities::ReduceSum);
m_comm->AllReduce(vertprocs, LibUtilities::ReduceSum);
m_comm->AllReduce(edgeids, LibUtilities::ReduceSum);
m_comm->AllReduce(edgeprocs, LibUtilities::ReduceSum);
set<int> extraDirVerts;
set<int> extraDirEdges;
// Set up list of vertices that need to be shared to other partitions
for (i = 0; i < nTotVerts; ++i)
{
if (m_comm->GetRank() == vertprocs[i])
{
extraDirVerts.insert(vertids[i]);
}
}
// Set up list of edges that need to be shared to other partitions
for (i = 0; i < nTotEdges; ++i)
{
if (m_comm->GetRank() == edgeprocs[i])
{
extraDirEdges.insert(edgeids[i]);
}
}
// Check between processes if the whole system is singular
int s = (systemSingular ? 1 : 0);
m_comm->AllReduce(s, LibUtilities::ReduceMin);
systemSingular = (s == 1 ? true : false);
// Count the number of boundary regions on each process
Array<OneD, int> bccounts(n, 0);
bccounts[p] = bndCondExp.num_elements();
m_comm->AllReduce(bccounts, LibUtilities::ReduceSum);
// Find the process rank with the maximum number of boundary regions
int maxBCIdx = Vmath::Imax(n, bccounts, 1);
// If the system is singular, the process with the maximum number of
// BCs will set a Dirichlet vertex to make system non-singular.
// Note: we find the process with maximum boundary regions to ensure
// we do not try to set a Dirichlet vertex on a partition with no
// intersection with the boundary.
meshVertId = 0;
if(systemSingular == true && checkIfSystemSingular && maxBCIdx == p)
{
if(m_session->DefinesParameter("SingularElement"))
{
int s_eid;
m_session->LoadParameter("SingularElement", s_eid);
ASSERTL1(s_eid < locExpVector.size(),
"SingularElement Parameter is too large");
meshVertId = locExpVector[s_eid]
->as<LocalRegions::Expansion2D>()
->GetGeom2D()->GetVid(0);
}
else if (bndCondExp.num_elements() == 0)
{
// All boundaries are periodic.
meshVertId = locExpVector[0]->GetGeom()->GetVid(0);
}
else
{
// Last region i and j = 0 edge
bndCondFaceExp = bndCondExp[bndCondExp.num_elements()-1]
->GetExp(0)->as<LocalRegions::Expansion2D>();
// First vertex 0 of the edge
meshVertId = bndCondFaceExp->GetGeom2D()->GetVid(0);
}
if(vertReorderedGraphVertId.count(meshVertId) == 0)
{
vertReorderedGraphVertId[meshVertId] = graphVertId++;
}
}
m_comm->AllReduce(meshVertId, LibUtilities::ReduceSum);
// When running in parallel, we need to ensure that the singular
// mesh vertex is communicated to any periodic vertices, otherwise
// the system may diverge.
if(systemSingular == true && checkIfSystemSingular)
{
// Firstly, we check that no other processors have this
// vertex. If they do, then we mark the vertex as also being
// Dirichlet.
if (maxBCIdx != p)
{
for (i = 0; i < locExpVector.size(); ++i)
{
for (j = 0; j < locExpVector[i]->GetNverts(); ++j)
{
if (locExpVector[i]->GetGeom()->GetVid(j) !=
meshVertId)
{
continue;
}
if (vertReorderedGraphVertId.count(meshVertId) == 0)
{
vertReorderedGraphVertId[meshVertId] =
graphVertId++;
}
}
}
}
// In the case that meshVertId is periodic with other vertices,
// this process and all other processes need to make sure that
// the periodic vertices are also marked as Dirichlet.
int gId;
// At least one process (maxBCidx) will have already associated
// a graphVertId with meshVertId. Others won't even have any of
// the vertices. The logic below is designed to handle both
// cases.
if (vertReorderedGraphVertId.count(meshVertId) == 0)
{
gId = -1;
}
else
{
gId = vertReorderedGraphVertId[meshVertId];
}
for (pIt = periodicVerts.begin();
pIt != periodicVerts.end(); ++pIt)
{
// Either the vertex is local to this processor (in which
// case it will be in the pIt->first position) or else
// meshVertId might be contained within another processor's
// vertex list. The if statement below covers both cases. If
// we find it, set as Dirichlet with the vertex id gId.
if (pIt->first == meshVertId)
{
vertReorderedGraphVertId[meshVertId] =
gId < 0 ? graphVertId++ : gId;
for (i = 0; i < pIt->second.size(); ++i)
{
if (pIt->second[i].isLocal)
{
vertReorderedGraphVertId[pIt->second[i].id] =
gId;
}
}
}
else
{
bool found = false;
for (i = 0; i < pIt->second.size(); ++i)
{
if (pIt->second[i].id == meshVertId)
{
found = true;
break;
}
}
if (found)
{
vertReorderedGraphVertId[pIt->first] =
gId < 0 ? graphVertId++ : gId;
for (i = 0; i < pIt->second.size(); ++i)
{
if (pIt->second[i].isLocal)
{
vertReorderedGraphVertId[
pIt->second[i].id] = gId;
}
}
}
}
}
}
m_numLocalDirBndCoeffs = nLocDirBndCondDofs + nExtraDirichlet;
firstNonDirGraphVertId = graphVertId;
/**
* STEP 2: Now order all other vertices and edges in the graph and
* create a temporary numbering of domain-interior vertices and
* edges.
*/
typedef boost::adjacency_list<
boost::setS, boost::vecS, boost::undirectedS> BoostGraph;
BoostGraph boostGraphObj;
map<int, int> vertTempGraphVertId;
map<int, int> edgeTempGraphVertId;
map<int, int> faceTempGraphVertId;
map<int, int> vwgts_map;
Array<OneD, int> localVerts;
Array<OneD, int> localEdges;
Array<OneD, int> localFaces;
int tempGraphVertId = 0;
int localVertOffset = 0;
int localEdgeOffset = 0;
int localFaceOffset = 0;
int nTotalVerts = 0;
int nTotalEdges = 0;
int nTotalFaces = 0;
int nVerts;
int nEdges;
int nFaces;
int vertCnt;
int edgeCnt;
int faceCnt;
m_numNonDirVertexModes = 0;
m_numNonDirEdges = 0;
m_numNonDirFaces = 0;
m_numNonDirFaceModes = 0;
m_numNonDirFaceModes = 0;
m_numLocalBndCoeffs = 0;
map<int,int> EdgeSize;
map<int,int> FaceSize;
/// - Count verts, edges, face and add up edges and face sizes
for(i = 0; i < locExpVector.size(); ++i)
{
if((locExpansion = locExpVector[locExp.GetOffset_Elmt_Id(i)]
->as<LocalRegions::Expansion3D>()))
{
nTotalVerts += locExpansion->GetNverts();
nTotalEdges += locExpansion->GetNedges();
nTotalFaces += locExpansion->GetNfaces();
nEdges = locExpansion->GetNedges();
for(j = 0; j < nEdges; ++j)
{
nEdgeInteriorCoeffs = locExpansion->GetEdgeNcoeffs(j) - 2;
meshEdgeId = locExpansion->GetGeom3D()->GetEid(j);
EdgeSize[meshEdgeId] = nEdgeInteriorCoeffs;
}
nFaces = locExpansion->GetNfaces();
faceCnt = 0;
for(j = 0; j < nFaces; ++j)
{
nFaceInteriorCoeffs = locExpansion->GetFaceIntNcoeffs(j);
meshFaceId = locExpansion->GetGeom3D()->GetFid(j);
FaceSize[meshFaceId] = nFaceInteriorCoeffs;
}
}
}
/// - Periodic vertices
for (pIt = periodicVerts.begin(); pIt != periodicVerts.end(); ++pIt)
{
meshVertId = pIt->first;
// This periodic vertex is joined to a Dirichlet condition.
if (vertReorderedGraphVertId.count(pIt->first) != 0)
{
for (i = 0; i < pIt->second.size(); ++i)
{
meshVertId2 = pIt->second[i].id;
if (vertReorderedGraphVertId.count(meshVertId2) == 0 &&
pIt->second[i].isLocal)
{
vertReorderedGraphVertId[meshVertId2] =
vertReorderedGraphVertId[meshVertId];
}
}
continue;
}
// One of the attached vertices is Dirichlet.
bool isDirichlet = false;
for (i = 0; i < pIt->second.size(); ++i)
{
if (!pIt->second[i].isLocal)
{
continue;
}
meshVertId2 = pIt->second[i].id;
if (vertReorderedGraphVertId.count(meshVertId2) > 0)
{
isDirichlet = true;
break;
}
}
if (isDirichlet)
{
vertReorderedGraphVertId[meshVertId] =
vertReorderedGraphVertId[pIt->second[i].id];
for (j = 0; j < pIt->second.size(); ++j)
{
meshVertId2 = pIt->second[i].id;
if (j == i || !pIt->second[j].isLocal ||
vertReorderedGraphVertId.count(meshVertId2) > 0)
{
continue;
}
vertReorderedGraphVertId[meshVertId2] =
vertReorderedGraphVertId[pIt->second[i].id];
}
continue;
}
// Otherwise, see if a vertex ID has already been set.
for (i = 0; i < pIt->second.size(); ++i)
{
if (!pIt->second[i].isLocal)
{
continue;
}
if (vertTempGraphVertId.count(pIt->second[i].id) > 0)
{
break;
}
}
if (i == pIt->second.size())
{
vertTempGraphVertId[meshVertId] = tempGraphVertId++;
m_numNonDirVertexModes += 1;
}
else
{
vertTempGraphVertId[meshVertId] =
vertTempGraphVertId[pIt->second[i].id];
}
}
// Store the temporary graph vertex id's of all element edges and
// vertices in these 3 arrays below
localVerts = Array<OneD, int>(nTotalVerts,-1);
localEdges = Array<OneD, int>(nTotalEdges,-1);
localFaces = Array<OneD, int>(nTotalFaces,-1);
// Set up vertex numbering
for(i = 0; i < locExpVector.size(); ++i)
{
if((locExpansion = locExpVector[locExp.GetOffset_Elmt_Id(i)]
->as<LocalRegions::Expansion3D>()))
{
vertCnt = 0;
nVerts = locExpansion->GetNverts();
for(j = 0; j < nVerts; ++j)
{
meshVertId = locExpansion->GetGeom3D()->GetVid(j);
if(vertReorderedGraphVertId.count(meshVertId) == 0)
{
if(vertTempGraphVertId.count(meshVertId) == 0)
{
boost::add_vertex(boostGraphObj);
vertTempGraphVertId[meshVertId] = tempGraphVertId++;
m_numNonDirVertexModes+=1;
}
localVerts[localVertOffset+vertCnt++] = vertTempGraphVertId[meshVertId];
vwgts_map[ vertTempGraphVertId[meshVertId] ] = 1;
}
}
}
else
{
ASSERTL0(false,"dynamic cast to a local 3D expansion failed");
}
localVertOffset+=nVerts;
}
/// - Periodic edges
for (pIt = periodicEdges.begin(); pIt != periodicEdges.end(); ++pIt)
{
meshEdgeId = pIt->first;
// This periodic edge is joined to a Dirichlet condition.
if (edgeReorderedGraphVertId.count(pIt->first) != 0)
{
for (i = 0; i < pIt->second.size(); ++i)
{
meshEdgeId2 = pIt->second[i].id;
if (edgeReorderedGraphVertId.count(meshEdgeId2) == 0 &&
pIt->second[i].isLocal)
{
edgeReorderedGraphVertId[meshEdgeId2] =
edgeReorderedGraphVertId[meshEdgeId];
}
}
continue;
}
// One of the attached edges is Dirichlet.
bool isDirichlet = false;
for (i = 0; i < pIt->second.size(); ++i)
{
if (!pIt->second[i].isLocal)
{
continue;
}
meshEdgeId2 = pIt->second[i].id;
if (edgeReorderedGraphVertId.count(meshEdgeId2) > 0)
{
isDirichlet = true;
break;
}
}
if (isDirichlet)
{
edgeReorderedGraphVertId[meshEdgeId] =
edgeReorderedGraphVertId[pIt->second[i].id];
for (j = 0; j < pIt->second.size(); ++j)
{
meshEdgeId2 = pIt->second[i].id;
if (j == i || !pIt->second[j].isLocal ||
edgeReorderedGraphVertId.count(meshEdgeId2) > 0)
{
continue;
}
edgeReorderedGraphVertId[meshEdgeId2] =
edgeReorderedGraphVertId[pIt->second[i].id];
}
continue;
}
// Otherwise, see if a edge ID has already been set.
for (i = 0; i < pIt->second.size(); ++i)
{
if (!pIt->second[i].isLocal)
{
continue;
}
if (edgeTempGraphVertId.count(pIt->second[i].id) > 0)
{
break;
}
}
if (i == pIt->second.size())
{
edgeTempGraphVertId[meshEdgeId] = tempGraphVertId++;
nEdgeInteriorCoeffs = EdgeSize[meshEdgeId];
m_numNonDirEdgeModes+=nEdgeInteriorCoeffs;
m_numNonDirEdges++;
}
else
{
edgeTempGraphVertId[meshEdgeId] = edgeTempGraphVertId[pIt->second[i].id];
}
}
// Set up edge numbering
for(i = 0; i < locExpVector.size(); ++i)
{
if((locExpansion = locExpVector[locExp.GetOffset_Elmt_Id(i)]
->as<LocalRegions::Expansion3D>()))
{
edgeCnt = 0;
nEdges = locExpansion->GetNedges();
for(j = 0; j < nEdges; ++j)
{
nEdgeInteriorCoeffs = locExpansion->GetEdgeNcoeffs(j) - 2;
meshEdgeId = locExpansion->GetGeom3D()->GetEid(j);
if(edgeReorderedGraphVertId.count(meshEdgeId) == 0)
{
if(edgeTempGraphVertId.count(meshEdgeId) == 0)
{
boost::add_vertex(boostGraphObj);
edgeTempGraphVertId[meshEdgeId] = tempGraphVertId++;
m_numNonDirEdgeModes+=nEdgeInteriorCoeffs;
m_numNonDirEdges++;
}
localEdges[localEdgeOffset+edgeCnt++] = edgeTempGraphVertId[meshEdgeId];
vwgts_map[ edgeTempGraphVertId[meshEdgeId] ] = nEdgeInteriorCoeffs;
}
}
}
else
{
ASSERTL0(false,"dynamic cast to a local 3D expansion failed");
}
localEdgeOffset+=nEdges;
}
/// - Periodic faces
for (pIt = periodicFaces.begin(); pIt != periodicFaces.end(); ++pIt)
{
if (!pIt->second[0].isLocal)
{
// The face mapped to is on another process.
meshFaceId = pIt->first;
ASSERTL0(faceReorderedGraphVertId.count(meshFaceId) == 0,
"This periodic boundary edge has been specified before");
faceTempGraphVertId[meshFaceId] = tempGraphVertId++;
nFaceInteriorCoeffs = FaceSize[meshFaceId];
m_numNonDirFaceModes+=nFaceInteriorCoeffs;
m_numNonDirFaces++;
}
else if (pIt->first < pIt->second[0].id)
{
ASSERTL0(faceReorderedGraphVertId.count(pIt->first) == 0,
"This periodic boundary face has been specified before");
ASSERTL0(faceReorderedGraphVertId.count(pIt->second[0].id) == 0,
"This periodic boundary face has been specified before");
faceTempGraphVertId[pIt->first] = tempGraphVertId;
faceTempGraphVertId[pIt->second[0].id] = tempGraphVertId++;
nFaceInteriorCoeffs = FaceSize[pIt->first];
m_numNonDirFaceModes+=nFaceInteriorCoeffs;
m_numNonDirFaces++;
}
}
// setup face numbering
for(i = 0; i < locExpVector.size(); ++i)
{
if((locExpansion = locExpVector[locExp.GetOffset_Elmt_Id(i)]
->as<LocalRegions::Expansion3D>()))
{
nFaces = locExpansion->GetNfaces();
faceCnt = 0;
for(j = 0; j < nFaces; ++j)
{
nFaceInteriorCoeffs = locExpansion->GetFaceIntNcoeffs(j);
meshFaceId = locExpansion->GetGeom3D()->GetFid(j);
if(faceReorderedGraphVertId.count(meshFaceId) == 0)
{
if(faceTempGraphVertId.count(meshFaceId) == 0)
{
boost::add_vertex(boostGraphObj);
faceTempGraphVertId[meshFaceId] = tempGraphVertId++;
m_numNonDirFaceModes+=nFaceInteriorCoeffs;
m_numNonDirFaces++;
}
localFaces[localFaceOffset+faceCnt++] = faceTempGraphVertId[meshFaceId];
vwgts_map[ faceTempGraphVertId[meshFaceId] ] = nFaceInteriorCoeffs;
}
}
m_numLocalBndCoeffs += locExpansion->NumBndryCoeffs();
}
else
{
ASSERTL0(false,"dynamic cast to a local 3D expansion failed");
}
localFaceOffset+=nFaces;
}
localVertOffset=0;
localEdgeOffset=0;
localFaceOffset=0;
for(i = 0; i < locExpVector.size(); ++i)
{
if((locExpansion = locExpVector[locExp.GetOffset_Elmt_Id(i)]
->as<LocalRegions::Expansion3D>()))
{
nVerts = locExpansion->GetNverts();
nEdges = locExpansion->GetNedges();
nFaces = locExpansion->GetNfaces();
// Now loop over all local faces, edges and vertices of this
// element and define that all other faces, edges and
// verices of this element are adjacent to them.
// Vertices
for(j = 0; j < nVerts; j++)
{
if(localVerts[j+localVertOffset]==-1)
{
break;
}
// associate to other vertices
for(k = 0; k < nVerts; k++)
{
if(localVerts[k+localVertOffset]==-1)
{
break;
}
if(k!=j)
{
boost::add_edge( (size_t) localVerts[j+localVertOffset],
(size_t) localVerts[k+localVertOffset],boostGraphObj);
}
}
// associate to other edges
for(k = 0; k < nEdges; k++)
{
if(localEdges[k+localEdgeOffset]==-1)
{
break;
}
boost::add_edge( (size_t) localVerts[j+localVertOffset],
(size_t) localEdges[k+localEdgeOffset],boostGraphObj);
}
// associate to other faces
for(k = 0; k < nFaces; k++)
{
if(localFaces[k+localFaceOffset]==-1)
{
break;
}
boost::add_edge( (size_t) localVerts[j+localVertOffset],
(size_t) localFaces[k+localFaceOffset],boostGraphObj);
}
}
// Edges
for(j = 0; j < nEdges; j++)
{
if(localEdges[j+localEdgeOffset]==-1)
{
break;
}
// Associate to other edges
for(k = 0; k < nEdges; k++)
{
if(localEdges[k+localEdgeOffset]==-1)
{
break;
}
if(k!=j)
{
boost::add_edge( (size_t) localEdges[j+localEdgeOffset],
(size_t) localEdges[k+localEdgeOffset],boostGraphObj);
}
}
// Associate to vertices
for(k = 0; k < nVerts; k++)
{
if(localVerts[k+localVertOffset]==-1)
{
break;
}
boost::add_edge( (size_t) localEdges[j+localEdgeOffset],
(size_t) localVerts[k+localVertOffset],boostGraphObj);
}
// Associate to faces
for(k = 0; k < nFaces; k++)
{
if(localFaces[k+localFaceOffset]==-1)
{
break;
}
boost::add_edge( (size_t) localEdges[j+localEdgeOffset],
(size_t) localFaces[k+localFaceOffset],boostGraphObj);
}
}
// Faces
for(j = 0; j < nFaces; j++)
{
if(localFaces[j+localFaceOffset]==-1)
{
break;
}
// Associate to other faces
for(k = 0; k < nFaces; k++)
{
if(localFaces[k+localFaceOffset]==-1)
{
break;
}
if(k!=j)
{
boost::add_edge( (size_t) localFaces[j+localFaceOffset],
(size_t) localFaces[k+localFaceOffset],boostGraphObj);
}
}
// Associate to vertices
for(k = 0; k < nVerts; k++)
{
if(localVerts[k+localVertOffset]==-1)
{
break;
}
boost::add_edge( (size_t) localFaces[j+localFaceOffset],
(size_t) localVerts[k+localVertOffset],boostGraphObj);
}
// Associate to edges
for(k = 0; k < nEdges; k++)
{
if(localEdges[k+localEdgeOffset]==-1)
{
break;
}
boost::add_edge( (size_t) localFaces[j+localFaceOffset],
(size_t) localEdges[k+localEdgeOffset],boostGraphObj);
}
}
}
else
{
ASSERTL0(false,"dynamic cast to a local 3D expansion failed");
}
localVertOffset+=nVerts;
localEdgeOffset+=nEdges;
localFaceOffset+=nFaces;
}
// Container to store vertices of the graph which correspond to
// degrees of freedom along the boundary.
set<int> partVerts;
if (m_solnType == eIterativeMultiLevelStaticCond)
{
vector<long> procVerts, procEdges, procFaces;
set <int> foundVerts, foundEdges, foundFaces;
// Loop over element and construct the procVerts and procEdges
// vectors, which store the geometry IDs of mesh vertices and
// edges respectively which are local to this process.
for(i = cnt = 0; i < locExpVector.size(); ++i)
{
int elmtid = locExp.GetOffset_Elmt_Id(i);
if((locExpansion = locExpVector[elmtid]
->as<LocalRegions::Expansion3D>()))
{
for (j = 0; j < locExpansion->GetNverts(); ++j)
{
int vid = locExpansion->GetGeom3D()->GetVid(j)+1;
if (foundVerts.count(vid) == 0)
{
procVerts.push_back(vid);
foundVerts.insert(vid);
}
}
for (j = 0; j < locExpansion->GetNedges(); ++j)
{
int eid = locExpansion->GetGeom3D()->GetEid(j)+1;
if (foundEdges.count(eid) == 0)
{
procEdges.push_back(eid);
foundEdges.insert(eid);
}
}
for (j = 0; j < locExpansion->GetNfaces(); ++j)
{
int fid = locExpansion->GetGeom3D()->GetFid(j)+1;
if (foundFaces.count(fid) == 0)
{
procFaces.push_back(fid);
foundFaces.insert(fid);
}
}
}
else
{
ASSERTL0(false,
"dynamic cast to a local 3D expansion failed");
}
}
int unique_verts = foundVerts.size();
int unique_edges = foundEdges.size();
int unique_faces = foundFaces.size();
// Now construct temporary GS objects. These will be used to
// populate the arrays tmp3 and tmp4 with the multiplicity of
// the vertices and edges respectively to identify those
// vertices and edges which are located on partition boundary.
Array<OneD, long> vertArray(unique_verts, &procVerts[0]);
Array<OneD, long> edgeArray(unique_edges, &procEdges[0]);
Array<OneD, long> faceArray(unique_faces, &procFaces[0]);
Gs::gs_data *tmp1 = Gs::Init(vertArray, m_comm);
Gs::gs_data *tmp2 = Gs::Init(edgeArray, m_comm);
Gs::gs_data *tmp3 = Gs::Init(faceArray, m_comm);
Array<OneD, NekDouble> tmp4(unique_verts, 1.0);
Array<OneD, NekDouble> tmp5(unique_edges, 1.0);
Array<OneD, NekDouble> tmp6(unique_faces, 1.0);
Gs::Gather(tmp4, Gs::gs_add, tmp1);
Gs::Gather(tmp5, Gs::gs_add, tmp2);
Gs::Gather(tmp6, Gs::gs_add, tmp3);
// Finally, fill the partVerts set with all non-Dirichlet
// vertices which lie on a partition boundary.
for (i = 0; i < unique_verts; ++i)
{
if (tmp4[i] > 1.0)
{
if (vertReorderedGraphVertId.count(procVerts[i]-1) == 0)
{
partVerts.insert(vertTempGraphVertId[procVerts[i]-1]);
}
}
}
for (i = 0; i < unique_edges; ++i)
{
if (tmp5[i] > 1.0)
{
if (edgeReorderedGraphVertId.count(procEdges[i]-1) == 0)
{
partVerts.insert(edgeTempGraphVertId[procEdges[i]-1]);
}
}
}
for (i = 0; i < unique_faces; ++i)
{
if (tmp6[i] > 1.0)
{
if (faceReorderedGraphVertId.count(procFaces[i]-1) == 0)
{
partVerts.insert(faceTempGraphVertId[procFaces[i]-1]);
}
}
}
}
/**
* STEP 3: Reorder graph for optimisation.
*/
BottomUpSubStructuredGraphSharedPtr bottomUpGraph;
int nGraphVerts = tempGraphVertId;
Array<OneD, int> perm(nGraphVerts);
Array<OneD, int> iperm(nGraphVerts);
Array<OneD, int> vwgts(nGraphVerts);
ASSERTL1(vwgts_map.size()==nGraphVerts,"Non matching dimensions");
for(i = 0; i < nGraphVerts; ++i)
{
vwgts[i] = vwgts_map[i];
}
if(nGraphVerts)
{
switch(m_solnType)
{
case eDirectFullMatrix:
case eIterativeFull:
case eIterativeStaticCond:
case ePETScStaticCond:
case ePETScFullMatrix:
case eXxtStaticCond:
{
NoReordering(boostGraphObj,perm,iperm);
}
break;
case eDirectStaticCond:
{
CuthillMckeeReordering(boostGraphObj,perm,iperm);
}
break;
case ePETScMultiLevelStaticCond:
case eDirectMultiLevelStaticCond:
case eIterativeMultiLevelStaticCond:
case eXxtMultiLevelStaticCond:
{
MultiLevelBisectionReordering(boostGraphObj,perm,iperm,bottomUpGraph,partVerts);
}
break;
default:
{
ASSERTL0(false,"Unrecognised solution type: " + std::string(MultiRegions::GlobalSysSolnTypeMap[m_solnType]));
}
}
}
// For parallel multi-level static condensation determine the lowest
// static condensation level amongst processors.
if (m_solnType == eIterativeMultiLevelStaticCond)
{
m_lowestStaticCondLevel = bottomUpGraph->GetNlevels()-1;
m_comm->AllReduce(m_lowestStaticCondLevel,
LibUtilities::ReduceMax);
}
else
{
m_lowestStaticCondLevel = 0;
}
/**
* STEP 4: Fill the #vertReorderedGraphVertId and
* #edgeReorderedGraphVertId with the optimal ordering from boost.
*/
for(mapIt = vertTempGraphVertId.begin(); mapIt != vertTempGraphVertId.end(); mapIt++)
{
vertReorderedGraphVertId[mapIt->first] = iperm[mapIt->second] + graphVertId;
}
for(mapIt = edgeTempGraphVertId.begin(); mapIt != edgeTempGraphVertId.end(); mapIt++)
{
edgeReorderedGraphVertId[mapIt->first] = iperm[mapIt->second] + graphVertId;
}
for(mapIt = faceTempGraphVertId.begin(); mapIt != faceTempGraphVertId.end(); mapIt++)
{
faceReorderedGraphVertId[mapIt->first] = iperm[mapIt->second] + graphVertId;
}
/**
* STEP 5: Set up an array which contains the offset information of
* the different graph vertices.
*
* This basically means to identify to how many global degrees of
* freedom the individual graph vertices correspond. Obviously,
* the graph vertices corresponding to the mesh-vertices account
* for a single global DOF. However, the graph vertices
* corresponding to the element edges correspond to N-2 global DOF
* where N is equal to the number of boundary modes on this edge.
*/
Array<OneD, int> graphVertOffset(vertReorderedGraphVertId.size()+
edgeReorderedGraphVertId.size()+
faceReorderedGraphVertId.size()+1);
graphVertOffset[0] = 0;
for(i = 0; i < locExpVector.size(); ++i)
{
locExpansion = locExpVector[locExp.GetOffset_Elmt_Id(i)]
->as<LocalRegions::Expansion3D>();
for(j = 0; j < locExpansion->GetNverts(); ++j)
{
meshVertId = locExpansion->GetGeom3D()->GetVid(j);
graphVertOffset[vertReorderedGraphVertId[meshVertId]+1] = 1;
}
for(j = 0; j < locExpansion->GetNedges(); ++j)
{
nEdgeInteriorCoeffs = locExpansion->GetEdgeNcoeffs(j) - 2;
meshEdgeId = locExpansion->GetGeom3D()->GetEid(j);
graphVertOffset[edgeReorderedGraphVertId[meshEdgeId]+1] = nEdgeInteriorCoeffs;
bType = locExpansion->GetEdgeBasisType(j);
// need a sign vector for modal expansions if nEdgeCoeffs >=4
if( (nEdgeInteriorCoeffs+2 >= 4)&&
( (bType == LibUtilities::eModified_A)||
(bType == LibUtilities::eModified_B) ) )
{
m_signChange = true;
}
}
for(j = 0; j < locExpansion->GetNfaces(); ++j)
{
nFaceInteriorCoeffs = locExpansion->GetFaceIntNcoeffs(j);
meshFaceId = locExpansion->GetGeom3D()->GetFid(j);
graphVertOffset[faceReorderedGraphVertId[meshFaceId]+1] = nFaceInteriorCoeffs;
}
}
for(i = 1; i < graphVertOffset.num_elements(); i++)
{
graphVertOffset[i] += graphVertOffset[i-1];
}
// Allocate the proper amount of space for the class-data
m_numLocalCoeffs = numLocalCoeffs;
m_numGlobalDirBndCoeffs = graphVertOffset[firstNonDirGraphVertId];
m_localToGlobalMap = Array<OneD, int>(m_numLocalCoeffs,-1);
m_localToGlobalBndMap = Array<OneD, int>(m_numLocalBndCoeffs,-1);
m_bndCondCoeffsToGlobalCoeffsMap = Array<OneD,int>(nLocBndCondDofs,-1);
// If required, set up the sign-vector
if(m_signChange)
{
m_localToGlobalSign = Array<OneD, NekDouble>(m_numLocalCoeffs,1.0);
m_localToGlobalBndSign = Array<OneD, NekDouble>(m_numLocalBndCoeffs,1.0);
m_bndCondCoeffsToGlobalCoeffsSign = Array<OneD,NekDouble>(nLocBndCondDofs,1.0);
}
m_staticCondLevel = 0;
m_numPatches = locExpVector.size();
m_numLocalBndCoeffsPerPatch = Array<OneD, unsigned int>(m_numPatches);
m_numLocalIntCoeffsPerPatch = Array<OneD, unsigned int>(m_numPatches);
for(i = 0; i < m_numPatches; ++i)
{
m_numLocalBndCoeffsPerPatch[i] = (unsigned int)
locExpVector[locExp.GetOffset_Elmt_Id(i)]->NumBndryCoeffs();
m_numLocalIntCoeffsPerPatch[i] = (unsigned int)
locExpVector[locExp.GetOffset_Elmt_Id(i)]->GetNcoeffs() -
locExpVector[locExp.GetOffset_Elmt_Id(i)]->NumBndryCoeffs();
}
/**
* STEP 6: Now, all ingredients are ready to set up the actual
* local to global mapping.
*
* The remainder of the map consists of the element-interior
* degrees of freedom. This leads to the block-diagonal submatrix
* as each element-interior mode is globally orthogonal to modes
* in all other elements.
*/
cnt = 0;
// Loop over all the elements in the domain
for(i = 0; i < locExpVector.size(); ++i)
{
locExpansion = locExpVector[i]->as<LocalRegions::Expansion3D>();
cnt = locExp.GetCoeff_Offset(i);
for(j = 0; j < locExpansion->GetNverts(); ++j)
{
meshVertId = locExpansion->GetGeom3D()->GetVid(j);
// Set the global DOF for vertex j of element i
m_localToGlobalMap[cnt+locExpansion->GetVertexMap(j)] =
graphVertOffset[vertReorderedGraphVertId[meshVertId]];
}
for(j = 0; j < locExpansion->GetNedges(); ++j)
{
nEdgeInteriorCoeffs = locExpansion->GetEdgeNcoeffs(j)-2;
edgeOrient = locExpansion->GetGeom3D()->GetEorient(j);
meshEdgeId = locExpansion->GetGeom3D()->GetEid(j);
pIt = periodicEdges.find(meshEdgeId);
// See if this edge is periodic. If it is, then we map all
// edges to the one with lowest ID, and align all
// coefficients to this edge orientation.
if (pIt != periodicEdges.end())
{
int minId = pIt->second[0].id;
int minIdK = 0;
for (k = 1; k < pIt->second.size(); ++k)
{
if (pIt->second[k].id < minId)
{
minId = min(minId, pIt->second[k].id);
minIdK = k;
}
}
if( meshEdgeId != min(minId, meshEdgeId))
{
if (pIt->second[minIdK].orient == StdRegions::eBackwards)
{
// Swap edge orientation
edgeOrient = (edgeOrient == StdRegions::eForwards) ?
StdRegions::eBackwards : StdRegions::eForwards;
}
}
}
locExpansion->GetEdgeInteriorMap(j,edgeOrient,edgeInteriorMap,edgeInteriorSign);
// Set the global DOF's for the interior modes of edge j
for(k = 0; k < nEdgeInteriorCoeffs; ++k)
{
m_localToGlobalMap[cnt+edgeInteriorMap[k]] =
graphVertOffset[edgeReorderedGraphVertId[meshEdgeId]]+k;
}
// Fill the sign vector if required
if(m_signChange)
{
for(k = 0; k < nEdgeInteriorCoeffs; ++k)
{
m_localToGlobalSign[cnt+edgeInteriorMap[k]] = (NekDouble) edgeInteriorSign[k];
}
}
}
for(j = 0; j < locExpansion->GetNfaces(); ++j)
{
nFaceInteriorCoeffs = locExpansion->GetFaceIntNcoeffs(j);
faceOrient = locExpansion->GetGeom3D()->GetFaceOrient(j);
meshFaceId = locExpansion->GetGeom3D()->GetFid(j);
pIt = periodicFaces.find(meshFaceId);
if (pIt != periodicFaces.end() &&
meshFaceId == min(meshFaceId, pIt->second[0].id))
{
faceOrient = DeterminePeriodicFaceOrient(faceOrient,pIt->second[0].orient);
}
locExpansion->GetFaceInteriorMap(j,faceOrient,faceInteriorMap,faceInteriorSign);
// Set the global DOF's for the interior modes of face j
for(k = 0; k < nFaceInteriorCoeffs; ++k)
{
m_localToGlobalMap[cnt+faceInteriorMap[k]] =
graphVertOffset[faceReorderedGraphVertId[meshFaceId]]+k;
}
if(m_signChange)
{
for(k = 0; k < nFaceInteriorCoeffs; ++k)
{
m_localToGlobalSign[cnt+faceInteriorMap[k]] = (NekDouble) faceInteriorSign[k];
}
}
}
}
// Set up the mapping for the boundary conditions
cnt = 0;
int offset = 0;
for(i = 0; i < bndCondExp.num_elements(); i++)
{
set<int> foundExtraVerts, foundExtraEdges;
for(j = 0; j < bndCondExp[i]->GetNumElmts(); j++)
{
bndCondFaceExp = bndCondExp[i]->GetExp(j)
->as<LocalRegions::Expansion2D>();
cnt = offset + bndCondExp[i]->GetCoeff_Offset(j);
for(k = 0; k < bndCondFaceExp->GetNverts(); k++)
{
meshVertId = bndCondFaceExp->GetGeom2D()->GetVid(k);
m_bndCondCoeffsToGlobalCoeffsMap[cnt+bndCondFaceExp->GetVertexMap(k)] = graphVertOffset[vertReorderedGraphVertId[meshVertId]];
if (bndConditions[i]->GetBoundaryConditionType() !=
SpatialDomains::eDirichlet)
{
continue;
}
set<int>::iterator iter = extraDirVerts.find(meshVertId);
if (iter != extraDirVerts.end() &&
foundExtraVerts.count(meshVertId) == 0)
{
int loc = bndCondExp[i]->GetCoeff_Offset(j) +
bndCondFaceExp->GetVertexMap(k);
int gid = graphVertOffset[
vertReorderedGraphVertId[meshVertId]];
ExtraDirDof t(loc, gid, 1.0);
m_extraDirDofs[i].push_back(t);
foundExtraVerts.insert(meshVertId);
}
}
for(k = 0; k < bndCondFaceExp->GetNedges(); k++)
{
nEdgeInteriorCoeffs = bndCondFaceExp->GetEdgeNcoeffs(k)-2;
edgeOrient = bndCondFaceExp->GetGeom2D()->GetEorient(k);
meshEdgeId = bndCondFaceExp->GetGeom2D()->GetEid(k);
pIt = periodicEdges.find(meshEdgeId);
// See if this edge is periodic. If it is, then we map
// all edges to the one with lowest ID, and align all
// coefficients to this edge orientation.
if (pIt != periodicEdges.end())
{
int minId = pIt->second[0].id;
int minIdL = 0;
for (l = 1; l < pIt->second.size(); ++l)
{
if (pIt->second[l].id < minId)
{
minId = min(minId, pIt->second[l].id);
minIdL = l;
}
}
if (pIt->second[minIdL].orient == StdRegions::eBackwards &&
meshEdgeId != min(minId, meshEdgeId))
{
edgeOrient = (edgeOrient == StdRegions::eForwards) ? StdRegions::eBackwards : StdRegions::eForwards;
}
}
bndCondFaceExp->GetEdgeInteriorMap(
k,edgeOrient,edgeInteriorMap,edgeInteriorSign);
for(l = 0; l < nEdgeInteriorCoeffs; ++l)
{
m_bndCondCoeffsToGlobalCoeffsMap[cnt+edgeInteriorMap[l]] =
graphVertOffset[edgeReorderedGraphVertId[meshEdgeId]]+l;
}
// Fill the sign vector if required
if(m_signChange)
{
for(l = 0; l < nEdgeInteriorCoeffs; ++l)
{
m_bndCondCoeffsToGlobalCoeffsSign[cnt+edgeInteriorMap[l]] = (NekDouble) edgeInteriorSign[l];
}
}
if (bndConditions[i]->GetBoundaryConditionType() !=
SpatialDomains::eDirichlet)
{
continue;
}
set<int>::iterator iter = extraDirEdges.find(meshEdgeId);
if (iter != extraDirEdges.end() &&
foundExtraEdges.count(meshEdgeId) == 0 &&
nEdgeInteriorCoeffs > 0)
{
for(l = 0; l < nEdgeInteriorCoeffs; ++l)
{
int loc = bndCondExp[i]->GetCoeff_Offset(j) +
edgeInteriorMap[l];
int gid = graphVertOffset[
edgeReorderedGraphVertId[meshEdgeId]]+l;
ExtraDirDof t(loc, gid, edgeInteriorSign[l]);
m_extraDirDofs[i].push_back(t);
}
foundExtraEdges.insert(meshEdgeId);
}
}
meshFaceId = bndCondFaceExp->GetGeom2D()->GetFid();
intDofCnt = 0;
for(k = 0; k < bndCondFaceExp->GetNcoeffs(); k++)
{
if(m_bndCondCoeffsToGlobalCoeffsMap[cnt+k] == -1)
{
m_bndCondCoeffsToGlobalCoeffsMap[cnt+k] =
graphVertOffset[faceReorderedGraphVertId[meshFaceId]]+intDofCnt;
intDofCnt++;
}
}
}
offset += bndCondExp[i]->GetNcoeffs();
}
globalId = Vmath::Vmax(m_numLocalCoeffs,&m_localToGlobalMap[0],1)+1;
m_numGlobalBndCoeffs = globalId;
/**
* STEP 7: The boundary condition mapping is generated from the
* same vertex renumbering.
*/
cnt=0;
for(i = 0; i < m_numLocalCoeffs; ++i)
{
if(m_localToGlobalMap[i] == -1)
{
m_localToGlobalMap[i] = globalId++;
}
else
{
if(m_signChange)
{
m_localToGlobalBndSign[cnt]=m_localToGlobalSign[i];
}
m_localToGlobalBndMap[cnt++]=m_localToGlobalMap[i];
}
}
m_numGlobalCoeffs = globalId;
SetUpUniversalC0ContMap(locExp, periodicVerts, periodicEdges, periodicFaces);
// Since we can now have multiple entries to m_extraDirDofs due to
// periodic boundary conditions we make a call to work out the
// multiplicity of all entries and invert (Need to be after
// SetupUniversalC0ContMap)
Array<OneD, NekDouble> valence(m_numGlobalBndCoeffs,0.0);
// Fill in Dirichlet coefficients that are to be sent to other
// processors with a value of 1
map<int, vector<ExtraDirDof> >::iterator Tit;
// Generate valence for extraDirDofs
for (Tit = m_extraDirDofs.begin(); Tit != m_extraDirDofs.end(); ++Tit)
{
for (i = 0; i < Tit->second.size(); ++i)
{
valence[Tit->second[i].get<1>()] = 1.0;
}
}
UniversalAssembleBnd(valence);
// Set third argument of tuple to inverse of valence.
for (Tit = m_extraDirDofs.begin(); Tit != m_extraDirDofs.end(); ++Tit)
{
for (i = 0; i < Tit->second.size(); ++i)
{
boost::get<2>(Tit->second.at(i)) /= valence[Tit->second.at(i).get<1>()];
}
}
// Set up the local to global map for the next level when using
// multi-level static condensation
if ((m_solnType == eDirectMultiLevelStaticCond ||
m_solnType == eIterativeMultiLevelStaticCond) && nGraphVerts)
{
if (m_staticCondLevel < (bottomUpGraph->GetNlevels()-1))
{
Array<OneD, int> vwgts_perm(nGraphVerts);
for(i = 0; i < nGraphVerts; ++i)
{
vwgts_perm[i] = vwgts[perm[i]];
}
bottomUpGraph->ExpandGraphWithVertexWeights(vwgts_perm);
m_nextLevelLocalToGlobalMap = MemoryManager<
AssemblyMap>::AllocateSharedPtr(this,bottomUpGraph);
}
}
m_hash = boost::hash_range(m_localToGlobalMap.begin(),
m_localToGlobalMap.end());
// Add up hash values if parallel
int hash = m_hash;
m_comm->GetRowComm()->AllReduce(hash,
LibUtilities::ReduceSum);
m_hash = hash;
}
Generated on Sun Mar 15 2015 00:11:57 for Nektar++ by   doxygen 1.8.1.2