#include <NodalTetEvenlySpaced.h>

Inheritance diagram for Nektar::LibUtilities::NodalTetEvenlySpaced:

Public Member Functions
virtual	~NodalTetEvenlySpaced ()

	NodalTetEvenlySpaced (const PointsKey &key)

Public Member Functions inherited from Nektar::LibUtilities::Points< NekDouble >
virtual	~Points ()

void	Initialize (void)

unsigned int	GetPointsDim () const

unsigned int	GetNumPoints () const

unsigned int	GetTotNumPoints () const

PointsType	GetPointsType () const

const Array< OneD, const DataType > &	GetZ () const

const Array< OneD, const DataType > &	GetW () const

void	GetZW (Array< OneD, const DataType > &z, Array< OneD, const DataType > &w) const

const Array< OneD, const NekDouble > &	GetBaryWeights () const

void	GetPoints (Array< OneD, const DataType > &x) const

void	GetPoints (Array< OneD, const DataType > &x, Array< OneD, const DataType > &y) const

void	GetPoints (Array< OneD, const DataType > &x, Array< OneD, const DataType > &y, Array< OneD, const DataType > &z) const

const MatrixSharedPtrType &	GetD (Direction dir=xDir) const

const MatrixSharedPtrType	GetI (const PointsKey &key)

const MatrixSharedPtrType	GetI (const Array< OneD, const DataType > &x)

const MatrixSharedPtrType	GetI (unsigned int uint, const Array< OneD, const DataType > &x)

const MatrixSharedPtrType	GetI (const Array< OneD, const DataType > &x, const Array< OneD, const DataType > &y)

const MatrixSharedPtrType	GetI (const Array< OneD, const DataType > &x, const Array< OneD, const DataType > &y, const Array< OneD, const DataType > &z)

const MatrixSharedPtrType	GetGalerkinProjection (const PointsKey &pkey)

Static Public Member Functions
static std::shared_ptr< PointsBaseType >	Create (const PointsKey &key)

Protected Member Functions
virtual const MatrixSharedPtrType	v_GetI (const PointsKey &pkey) override

virtual const MatrixSharedPtrType	v_GetI (const Array< OneD, const NekDouble > &x, const Array< OneD, const NekDouble > &y, const Array< OneD, const NekDouble > &z) override

Protected Member Functions inherited from Nektar::LibUtilities::Points< NekDouble >
virtual void	v_Initialize (void)

virtual void	v_CalculateBaryWeights ()
	This function calculates the barycentric weights used for enhanced interpolation speed. More...

	Points (const PointsKey &key)

virtual const MatrixSharedPtrType	v_GetI (const Array< OneD, const DataType > &x)

virtual const MatrixSharedPtrType	v_GetI (unsigned int, const Array< OneD, const DataType > &x)

virtual const MatrixSharedPtrType	v_GetI (const Array< OneD, const DataType > &x, const Array< OneD, const DataType > &y)

virtual const MatrixSharedPtrType	v_GetGalerkinProjection (const PointsKey &pkey)

Private Member Functions
	NodalTetEvenlySpaced ()
	Default constructor should not be called except by Create matrix. More...

void	NodalPointReorder3d ()

virtual void	v_CalculatePoints () override

virtual void	v_CalculateWeights () override

virtual void	v_CalculateDerivMatrix () override

void	CalculateInterpMatrix (const Array< OneD, const NekDouble > &xi, const Array< OneD, const NekDouble > &yi, const Array< OneD, const NekDouble > &zi, Array< OneD, NekDouble > &interp)

Private Attributes
std::shared_ptr< NodalUtilTetrahedron >	m_util

Static Private Attributes
static bool	initPointsManager []

Additional Inherited Members
Public Types inherited from Nektar::LibUtilities::Points< NekDouble >
typedef NekDouble	DataType

typedef std::shared_ptr< NekMatrix< DataType > >	MatrixSharedPtrType

Protected Attributes inherited from Nektar::LibUtilities::Points< NekDouble >
PointsKey	m_pointsKey
	Points type for this points distributions. More...

Array< OneD, DataType >	m_points [3]
	Storage for the point locations, allowing for up to a 3D points storage. More...

Array< OneD, DataType >	m_weights
	Quadrature weights for the weights. More...

Array< OneD, DataType >	m_bcweights
	Barycentric weights. More...

MatrixSharedPtrType	m_derivmatrix [3]
	Derivative matrices. More...

NekManager< PointsKey, NekMatrix< DataType >, PointsKey::opLess >	m_InterpManager

NekManager< PointsKey, NekMatrix< DataType >, PointsKey::opLess >	m_GalerkinProjectionManager

Detailed Description

Definition at line 52 of file NodalTetEvenlySpaced.h.

Constructor & Destructor Documentation

◆ ~NodalTetEvenlySpaced()

virtual Nektar::LibUtilities::NodalTetEvenlySpaced::~NodalTetEvenlySpaced ( )

inlinevirtual

Definition at line 55 of file NodalTetEvenlySpaced.h.

56 {

57 }

◆ NodalTetEvenlySpaced() [1/2]

Nektar::LibUtilities::NodalTetEvenlySpaced::NodalTetEvenlySpaced ( const PointsKey & key )

inline

Definition at line 59 of file NodalTetEvenlySpaced.h.

                                                : PointsBaseType(key)
     {
     }

◆ NodalTetEvenlySpaced() [2/2]

Nektar::LibUtilities::NodalTetEvenlySpaced::NodalTetEvenlySpaced ( )

inlineprivate

Default constructor should not be called except by Create matrix.

Definition at line 99 of file NodalTetEvenlySpaced.h.

                            : PointsBaseType(NullPointsKey)
     {
     }

Member Function Documentation

◆ CalculateInterpMatrix()

void Nektar::LibUtilities::NodalTetEvenlySpaced::CalculateInterpMatrix	(	const Array< OneD, const NekDouble > &	xi,
		const Array< OneD, const NekDouble > &	yi,
		const Array< OneD, const NekDouble > &	zi,
		Array< OneD, NekDouble > &	interp
	)

private

Definition at line 374 of file NodalTetEvenlySpaced.cpp.

 {
     Array<OneD, Array<OneD, NekDouble>> xi(3);
     xi[0] = xia;
     xi[1] = yia;
     xi[2] = zia;
  
     std::shared_ptr<NekMatrix<NekDouble>> mat =
         m_util->GetInterpolationMatrix(xi);
     Vmath::Vcopy(mat->GetRows() * mat->GetColumns(), mat->GetRawPtr(), 1,
                  &interp[0], 1);
 }

References m_util, and Vmath::Vcopy().

Referenced by v_GetI().

◆ Create()

std::shared_ptr< PointsBaseType > Nektar::LibUtilities::NodalTetEvenlySpaced::Create ( const PointsKey & key )

static

Definition at line 402 of file NodalTetEvenlySpaced.cpp.

 {
     std::shared_ptr<PointsBaseType> returnval(
         MemoryManager<NodalTetEvenlySpaced>::AllocateSharedPtr(key));
  
     returnval->Initialize();
  
     return returnval;
 }

◆ NodalPointReorder3d()

void Nektar::LibUtilities::NodalTetEvenlySpaced::NodalPointReorder3d ( )

private

Definition at line 167 of file NodalTetEvenlySpaced.cpp.

 {
     unsigned int npts = GetNumPoints();
     using std::vector;
     vector<int> vertex;
     vector<int> iEdge_01;             // interior edge 0
     vector<int> iEdge_12;             // interior edge 1
     vector<int> iEdge_20;             // interior edge 2
     vector<int> iEdge_03;             // interior edge 3
     vector<int> iEdge_13;             // interior edge 4
     vector<int> iEdge_23;             // interior edge 5
     vector<int> iFace_012;            // interior face 0
     vector<int> iFace_013;            // interior face 1
     vector<int> iFace_123;            // interior face 2
     vector<int> iFace_203;            // interior face 3
     vector<int> interiorVolumePoints; // interior volume points
     vector<int> map;
  
     // Build the lattice tetrahedron left to right - bottom to top
     for (int z = 0, index = 0; z < npts; ++z)
     {
         for (int y = 0; y < npts - z; ++y)
         {
             for (int x = 0; x < npts - z - y; ++x, ++index)
             {
  
                 if (isVertex(x, y, z, npts))
                 { // vertex
  
                     vertex.push_back(index);
                 }
                 else if (isEdge(x, y, z, npts))
                 { // interior edge
  
                     if (isEdge_01(x, y, z, npts))
                     { // interior edge 0
  
                         iEdge_01.push_back(index);
                     }
                     else if (isEdge_12(x, y, z, npts))
                     { // interior edge 1
  
                         iEdge_12.push_back(index);
                     }
                     else if (isEdge_20(x, y, z, npts))
                     { // interior edge 2
  
                         iEdge_20.insert(iEdge_20.begin(), index);
                     }
                     else if (isEdge_03(x, y, z, npts))
                     { // interior edge 3
  
                         iEdge_03.push_back(index);
                     }
                     else if (isEdge_13(x, y, z, npts))
                     { // interior edge 4
  
                         iEdge_13.push_back(index);
                     }
                     else if (isEdge_23(x, y, z, npts))
                     { // interior edge 5
  
                         iEdge_23.push_back(index);
                     }
                 }
                 else if (isFace(x, y, z, npts))
                 { // interior face
  
                     if (isFace_012(x, y, z, npts))
                     { // interior face 0
  
                         iFace_012.push_back(index);
                     }
                     else if (isFace_013(x, y, z, npts))
                     { // interior face 1
  
                         iFace_013.push_back(index);
                     }
                     else if (isFace_123(x, y, z, npts))
                     { // interior face 2
  
                         iFace_123.push_back(index);
                     }
                     else if (isFace_203(x, y, z, npts))
                     { // interior face 3
  
                         iFace_203.push_back(index);
                     }
                 }
                 else
                 { // interior volume points
  
                     interiorVolumePoints.push_back(index);
                 }
             }
         }
     }
  
     // Mapping the vertex, edges, faces, interior volume points using the
     // permutation matrix, so the points are ordered anticlockwise.
     for (unsigned int n = 0; n < vertex.size(); ++n)
     {
  
         map.push_back(vertex[n]);
     }
  
     for (unsigned int n = 0; n < iEdge_01.size(); ++n)
     {
  
         map.push_back(iEdge_01[n]);
     }
  
     for (unsigned int n = 0; n < iEdge_12.size(); ++n)
     {
  
         map.push_back(iEdge_12[n]);
     }
  
     for (unsigned int n = 0; n < iEdge_20.size(); ++n)
     {
  
         map.push_back(iEdge_20[n]);
     }
  
     for (unsigned int n = 0; n < iEdge_03.size(); ++n)
     {
  
         map.push_back(iEdge_03[n]);
     }
  
     for (unsigned int n = 0; n < iEdge_13.size(); ++n)
     {
  
         map.push_back(iEdge_13[n]);
     }
  
     for (unsigned int n = 0; n < iEdge_23.size(); ++n)
     {
  
         map.push_back(iEdge_23[n]);
     }
  
     for (unsigned int n = 0; n < iFace_012.size(); ++n)
     {
  
         map.push_back(iFace_012[n]);
     }
  
     for (unsigned int n = 0; n < iFace_013.size(); ++n)
     {
  
         map.push_back(iFace_013[n]);
     }
  
     for (unsigned int n = 0; n < iFace_123.size(); ++n)
     {
  
         map.push_back(iFace_123[n]);
     }
  
     for (unsigned int n = 0; n < iFace_203.size(); ++n)
     {
  
         map.push_back(iFace_203[n]);
     }
  
     for (unsigned int n = 0; n < interiorVolumePoints.size(); ++n)
     {
  
         map.push_back(interiorVolumePoints[n]);
     }
  
     Array<OneD, NekDouble> points[3];
     points[0] = Array<OneD, NekDouble>(GetTotNumPoints());
     points[1] = Array<OneD, NekDouble>(GetTotNumPoints());
     points[2] = Array<OneD, NekDouble>(GetTotNumPoints());
     for (unsigned int index = 0; index < map.size(); ++index)
     {
  
         points[0][index] = m_points[0][index];
         points[1][index] = m_points[1][index];
         points[2][index] = m_points[2][index];
     }
  
     for (unsigned int index = 0; index < map.size(); ++index)
     {
  
         m_points[0][index] = points[0][map[index]];
         m_points[1][index] = points[1][map[index]];
         m_points[2][index] = points[2][map[index]];
     }
 }

References Nektar::LibUtilities::Points< NekDouble >::GetNumPoints(), Nektar::LibUtilities::Points< NekDouble >::GetTotNumPoints(), and Nektar::LibUtilities::Points< NekDouble >::m_points.

Referenced by v_CalculatePoints().

◆ v_CalculateDerivMatrix()

void Nektar::LibUtilities::NodalTetEvenlySpaced::v_CalculateDerivMatrix ( )

overrideprivatevirtual

Reimplemented from Nektar::LibUtilities::Points< NekDouble >.

Definition at line 392 of file NodalTetEvenlySpaced.cpp.

 {
     // Allocate the derivative matrix.
     PointsBaseType::v_CalculateDerivMatrix();
  
     m_derivmatrix[0] = m_util->GetDerivMatrix(0);
     m_derivmatrix[1] = m_util->GetDerivMatrix(1);
     m_derivmatrix[2] = m_util->GetDerivMatrix(2);
 }

References Nektar::LibUtilities::Points< NekDouble >::m_derivmatrix, m_util, and Nektar::LibUtilities::Points< NekDouble >::v_CalculateDerivMatrix().

◆ v_CalculatePoints()

void Nektar::LibUtilities::NodalTetEvenlySpaced::v_CalculatePoints ( )

overrideprivatevirtual

Reimplemented from Nektar::LibUtilities::Points< NekDouble >.

Definition at line 137 of file NodalTetEvenlySpaced.cpp.

 {
     // Allocate the storage for points
     PointsBaseType::v_CalculatePoints();
  
     // Populate m_points
     unsigned int npts = GetNumPoints();
     NekDouble delta   = 2.0 / (npts - 1.0);
     for (unsigned int z = 0, index = 0; z < npts; ++z)
     {
         for (unsigned int y = 0; y < npts - z; ++y)
         {
             for (unsigned int x = 0; x < npts - z - y; ++x, ++index)
             {
                 NekDouble xi = -1.0 + x * delta;
                 NekDouble yi = -1.0 + y * delta;
                 NekDouble zi = -1.0 + z * delta;
  
                 m_points[0][index] = xi;
                 m_points[1][index] = yi;
                 m_points[2][index] = zi;
             }
         }
     }
  
     NodalPointReorder3d();
     m_util = MemoryManager<NodalUtilTetrahedron>::AllocateSharedPtr(
         npts - 1, m_points[0], m_points[1], m_points[2]);
 }

References Nektar::MemoryManager< DataType >::AllocateSharedPtr(), Nektar::LibUtilities::Points< NekDouble >::GetNumPoints(), Nektar::LibUtilities::Points< NekDouble >::m_points, m_util, NodalPointReorder3d(), and Nektar::LibUtilities::Points< NekDouble >::v_CalculatePoints().

◆ v_CalculateWeights()

void Nektar::LibUtilities::NodalTetEvenlySpaced::v_CalculateWeights ( )

overrideprivatevirtual

Reimplemented from Nektar::LibUtilities::Points< NekDouble >.

Definition at line 360 of file NodalTetEvenlySpaced.cpp.

 {
     // Allocate storage for points
     PointsBaseType::v_CalculateWeights();
  
     typedef DataType T;
  
     // Solve the Vandermonde system of integrals for the weight vector
     NekVector<T> w = m_util->GetWeights();
     m_weights      = Array<OneD, T>(w.GetRows(), w.GetPtr());
 }

References Nektar::NekVector< DataType >::GetPtr(), Nektar::NekVector< DataType >::GetRows(), m_util, Nektar::LibUtilities::Points< NekDouble >::m_weights, and Nektar::LibUtilities::Points< NekDouble >::v_CalculateWeights().

◆ v_GetI() [1/2]

virtual const MatrixSharedPtrType Nektar::LibUtilities::NodalTetEvenlySpaced::v_GetI	(	const Array< OneD, const NekDouble > &	x,
		const Array< OneD, const NekDouble > &	y,
		const Array< OneD, const NekDouble > &	z
	)

inlineoverrideprotectedvirtual

Reimplemented from Nektar::LibUtilities::Points< NekDouble >.

Definition at line 77 of file NodalTetEvenlySpaced.h.

     {
         size_t numpoints = x.size();
         unsigned int np  = GetTotNumPoints();
  
         Array<OneD, NekDouble> interp(GetTotNumPoints() * numpoints);
         CalculateInterpMatrix(x, y, z, interp);
  
         NekDouble *d = interp.data();
         return MemoryManager<NekMatrix<NekDouble>>::AllocateSharedPtr(numpoints,
                                                                       np, d);
     }

References CalculateInterpMatrix(), and Nektar::LibUtilities::Points< NekDouble >::GetTotNumPoints().

◆ v_GetI() [2/2]

virtual const MatrixSharedPtrType Nektar::LibUtilities::NodalTetEvenlySpaced::v_GetI ( const PointsKey & pkey )

inlineoverrideprotectedvirtual

Reimplemented from Nektar::LibUtilities::Points< NekDouble >.

Definition at line 67 of file NodalTetEvenlySpaced.h.

     {
         ASSERTL0(pkey.GetPointsDim() == 3,
                  "NodalTetEvenlySpaced Points can only interp to other "
                  "3d point distributions");
         Array<OneD, const NekDouble> x, y, z;
         PointsManager()[pkey]->GetPoints(x, y, z);
         return GetI(x, y, z);
     }

References ASSERTL0, Nektar::LibUtilities::Points< NekDouble >::GetI(), Nektar::LibUtilities::PointsKey::GetPointsDim(), and Nektar::LibUtilities::PointsManager().

Member Data Documentation

◆ initPointsManager

bool Nektar::LibUtilities::NodalTetEvenlySpaced::initPointsManager

staticprivate

Initial value:

= {
    PointsManager().RegisterCreator(PointsKey(0, eNodalTetEvenlySpaced),
                                    NodalTetEvenlySpaced::Create)}

Definition at line 94 of file NodalTetEvenlySpaced.h.

◆ m_util

std::shared_ptr<NodalUtilTetrahedron> Nektar::LibUtilities::NodalTetEvenlySpaced::m_util

private

Definition at line 96 of file NodalTetEvenlySpaced.h.

Referenced by CalculateInterpMatrix(), v_CalculateDerivMatrix(), v_CalculatePoints(), and v_CalculateWeights().

Public Member Functions

Static Public Member Functions

Protected Member Functions

Private Member Functions

Private Attributes

Static Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ ~NodalTetEvenlySpaced()

◆ NodalTetEvenlySpaced() [1/2]

◆ NodalTetEvenlySpaced() [2/2]

Member Function Documentation

◆ CalculateInterpMatrix()

◆ Create()

◆ NodalPointReorder3d()

◆ v_CalculateDerivMatrix()

◆ v_CalculatePoints()

◆ v_CalculateWeights()

◆ v_GetI() [1/2]

◆ v_GetI() [2/2]

Member Data Documentation

◆ initPointsManager

◆ m_util