#include <NodalTriEvenlySpaced.h>

Inheritance diagram for Nektar::LibUtilities::NodalTriEvenlySpaced:

Public Member Functions
	~NodalTriEvenlySpaced () override

	NodalTriEvenlySpaced (const PointsKey &key)

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

void	Initialize (void)

size_t	GetPointsDim () const

size_t	GetNumPoints () const

size_t	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 (size_t 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
const MatrixSharedPtrType	v_GetI (const PointsKey &pkey) override

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

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

virtual void	v_CalculatePoints ()

virtual void	v_CalculateWeights ()

Private Member Functions
	NodalTriEvenlySpaced ()=delete

	NodalTriEvenlySpaced (const NodalTriEvenlySpaced &points)=delete

void	NodalPointReorder2d ()

void	v_CalculatePoints () final

void	v_CalculateWeights () final

void	v_CalculateDerivMatrix () final

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

Private Attributes
std::shared_ptr< NodalUtilTriangle >	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 44 of file NodalTriEvenlySpaced.h.

Constructor & Destructor Documentation

◆ ~NodalTriEvenlySpaced()

Nektar::LibUtilities::NodalTriEvenlySpaced::~NodalTriEvenlySpaced ( )

inlineoverride

Definition at line 47 of file NodalTriEvenlySpaced.h.

48 {

49 }

◆ NodalTriEvenlySpaced() [1/3]

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

inline

Definition at line 51 of file NodalTriEvenlySpaced.h.

                                               : PointsBaseType(key)
    {
    }

◆ NodalTriEvenlySpaced() [2/3]

Nektar::LibUtilities::NodalTriEvenlySpaced::NodalTriEvenlySpaced ( )

privatedelete

◆ NodalTriEvenlySpaced() [3/3]

Nektar::LibUtilities::NodalTriEvenlySpaced::NodalTriEvenlySpaced ( const NodalTriEvenlySpaced & points )

privatedelete

Member Function Documentation

◆ CalculateInterpMatrix()

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

private

Definition at line 110 of file NodalTriEvenlySpaced.cpp.

{
    Array<OneD, Array<OneD, NekDouble>> xi(2);
    xi[0] = xia;
    xi[1] = yia;
 
    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::NodalTriEvenlySpaced::Create ( const PointsKey & key )

static

Definition at line 136 of file NodalTriEvenlySpaced.cpp.

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

◆ NodalPointReorder2d()

void Nektar::LibUtilities::NodalTriEvenlySpaced::NodalPointReorder2d ( )

private

Definition at line 147 of file NodalTriEvenlySpaced.cpp.

{
    size_t npts = GetNumPoints();
    using std::vector;
    vector<int> vertex;
    vector<int> iEdge_1; // interior edge points on the bottom triangle edge
    vector<int> iEdge_2; // interior edge points on the right triangle edge
    vector<int> iEdge_3; // interior edge points on the left triangle edge
    vector<int> interiorPoints;
    vector<int> map;
 
    // Build the lattice triangle left to right - bottom to top
    for (size_t i = 0, index = 0; i < npts; ++i)
    { // y-direction
        for (size_t j = 0; j < npts - i; ++j, ++index)
        { // x-direction
 
            if (isVertex(i, j, npts))
            {
 
                vertex.push_back(index);
            }
            else if (isEdge(i, j, npts))
            { // interior edge
 
                if (isEdge_1(i, j, npts))
                { // bottom edge
 
                    iEdge_1.push_back(index);
                }
                else if (isEdge_2(i, j, npts))
                { // right edge
 
                    iEdge_2.push_back(index);
                }
                else // left edge
                {
                    // Add backwards.  This is because of counter clockwise.
                    iEdge_3.insert(iEdge_3.begin(), index);
                }
            }
            else
            { // Interior points
 
                interiorPoints.push_back(index);
            }
        }
    }
 
    // Mapping the vertex, edges, and interior points using the permutation
    // matrix, so the points are ordered anticlockwise.
    for (size_t k = 0; k < vertex.size(); ++k)
    {
 
        map.push_back(vertex[k]);
    }
 
    for (size_t k = 0; k < iEdge_1.size(); ++k)
    {
 
        map.push_back(iEdge_1[k]);
    }
 
    for (size_t k = 0; k < iEdge_2.size(); ++k)
    {
 
        map.push_back(iEdge_2[k]);
    }
 
    for (size_t k = 0; k < iEdge_3.size(); ++k)
    {
 
        map.push_back(iEdge_3[k]);
    }
 
    for (size_t k = 0; k < interiorPoints.size(); ++k)
    {
 
        map.push_back(interiorPoints[k]);
    }
 
    Array<OneD, NekDouble> points[2];
    points[0] = Array<OneD, NekDouble>(GetTotNumPoints());
    points[1] = Array<OneD, NekDouble>(GetTotNumPoints());
    for (size_t index = 0; index < map.size(); ++index)
    {
        points[0][index] = m_points[0][index];
        points[1][index] = m_points[1][index];
    }
 
    for (size_t index = 0; index < map.size(); ++index)
    {
        m_points[0][index] = points[0][map[index]];
        m_points[1][index] = points[1][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::NodalTriEvenlySpaced::v_CalculateDerivMatrix ( )

finalprivate

Definition at line 126 of file NodalTriEvenlySpaced.cpp.

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

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

◆ v_CalculatePoints()

void Nektar::LibUtilities::NodalTriEvenlySpaced::v_CalculatePoints ( )

finalprivatevirtual

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

Definition at line 70 of file NodalTriEvenlySpaced.cpp.

{
    // Allocate the storage for points
    PointsBaseType::v_CalculatePoints();
 
    // Populate m_points
    size_t npts     = GetNumPoints();
    NekDouble delta = 2.0 / (npts - 1.0);
    for (size_t i = 0, index = 0; i < npts; ++i)
    { // y-direction
        for (size_t j = 0; j < npts - i; ++j, ++index)
        { // x-direction
            NekDouble x        = -1.0 + j * delta;
            NekDouble y        = -1.0 + i * delta;
            m_points[0][index] = x;
            m_points[1][index] = y;
        }
    }
 
    NodalPointReorder2d();
 
    m_util = MemoryManager<NodalUtilTriangle>::AllocateSharedPtr(
        npts - 1, m_points[0], m_points[1]);
}

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

◆ v_CalculateWeights()

void Nektar::LibUtilities::NodalTriEvenlySpaced::v_CalculateWeights ( )

finalprivatevirtual

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

Definition at line 95 of file NodalTriEvenlySpaced.cpp.

{
    // Allocate the 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 m_util, Nektar::LibUtilities::Points< NekDouble >::m_weights, Nektar::LibUtilities::Points< NekDouble >::v_CalculateWeights(), and Nektar::UnitTests::w().

◆ v_GetI() [1/2]

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

inlineoverrideprotected

Definition at line 69 of file NodalTriEvenlySpaced.h.

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

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

◆ v_GetI() [2/2]

const MatrixSharedPtrType Nektar::LibUtilities::NodalTriEvenlySpaced::v_GetI ( const PointsKey & pkey )

inlineoverrideprotected

Definition at line 59 of file NodalTriEvenlySpaced.h.

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

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

Member Data Documentation

◆ initPointsManager

bool Nektar::LibUtilities::NodalTriEvenlySpaced::initPointsManager

staticprivate

Initial value:

= {
    PointsManager().RegisterCreator(PointsKey(0, eNodalTriEvenlySpaced),
                                    NodalTriEvenlySpaced::Create)}

Definition at line 85 of file NodalTriEvenlySpaced.h.

◆ m_util

std::shared_ptr<NodalUtilTriangle> Nektar::LibUtilities::NodalTriEvenlySpaced::m_util

private

Definition at line 87 of file NodalTriEvenlySpaced.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

◆ ~NodalTriEvenlySpaced()

◆ NodalTriEvenlySpaced() [1/3]

◆ NodalTriEvenlySpaced() [2/3]

◆ NodalTriEvenlySpaced() [3/3]

Member Function Documentation

◆ CalculateInterpMatrix()

◆ Create()

◆ NodalPointReorder2d()

◆ v_CalculateDerivMatrix()

◆ v_CalculatePoints()

◆ v_CalculateWeights()

◆ v_GetI() [1/2]

◆ v_GetI() [2/2]

Member Data Documentation

◆ initPointsManager

◆ m_util