#include <NodalTriFekete.h>

Inheritance diagram for Nektar::LibUtilities::NodalTriFekete:

Public Member Functions
	~NodalTriFekete () override

	NodalTriFekete (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
	NodalTriFekete ()=delete

	NodalTriFekete (const NodalTriFekete &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 47 of file NodalTriFekete.h.

Constructor & Destructor Documentation

◆ ~NodalTriFekete()

Nektar::LibUtilities::NodalTriFekete::~NodalTriFekete ( )

inlineoverride

Definition at line 50 of file NodalTriFekete.h.

51 {

52 }

◆ NodalTriFekete() [1/3]

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

inline

Definition at line 54 of file NodalTriFekete.h.

                                         : PointsBaseType(key)
    {
    }

◆ NodalTriFekete() [2/3]

Nektar::LibUtilities::NodalTriFekete::NodalTriFekete ( )

privatedelete

◆ NodalTriFekete() [3/3]

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

privatedelete

Member Function Documentation

◆ CalculateInterpMatrix()

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

private

Definition at line 137 of file NodalTriFekete.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::NodalTriFekete::Create ( const PointsKey & key )

static

Definition at line 162 of file NodalTriFekete.cpp.

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

◆ NodalPointReorder2d()

void Nektar::LibUtilities::NodalTriFekete::NodalPointReorder2d ( )

private

Definition at line 170 of file NodalTriFekete.cpp.

{
    size_t i, j;
    size_t cnt;
    size_t istart, iend;
 
    const size_t nVerts              = 3;
    const size_t nEdgeInteriorPoints = GetNumPoints() - 2;
    const size_t nBoundaryPoints     = 3 * nEdgeInteriorPoints + 3;
 
    if (nEdgeInteriorPoints == 0)
    {
        return;
    }
 
    // group the points of edge 1 together;
    istart = nVerts;
    for (i = cnt = istart; i < nBoundaryPoints; i++)
    {
        if (fabs(m_points[1][i] + 1.0) < NekConstants::kNekZeroTol)
        {
            std::swap(m_points[0][cnt], m_points[0][i]);
            std::swap(m_points[1][cnt], m_points[1][i]);
            cnt++;
        }
    }
 
    // bubble sort edge 1 (counterclockwise numbering)
    iend = istart + nEdgeInteriorPoints;
    for (i = istart; i < iend; i++)
    {
        for (j = istart + 1; j < iend; j++)
        {
            if (m_points[0][j] < m_points[0][j - 1])
            {
                std::swap(m_points[0][j], m_points[0][j - 1]);
                std::swap(m_points[1][j], m_points[1][j - 1]);
            }
        }
    }
 
    // group the points of edge 2 together;
    istart = iend;
    for (i = cnt = istart; i < nBoundaryPoints; i++)
    {
        if (fabs(m_points[1][i] + m_points[0][i]) < NekConstants::kNekZeroTol)
        {
            std::swap(m_points[0][cnt], m_points[0][i]);
            std::swap(m_points[1][cnt], m_points[1][i]);
            cnt++;
        }
    }
 
    // bubble sort edge 2 (counterclockwise numbering)
    iend = istart + nEdgeInteriorPoints;
    for (i = istart; i < iend; i++)
    {
        for (j = istart + 1; j < iend; j++)
        {
            if (m_points[1][j] < m_points[1][j - 1])
            {
                std::swap(m_points[0][j], m_points[0][j - 1]);
                std::swap(m_points[1][j], m_points[1][j - 1]);
            }
        }
    }
 
    // group the points of edge 3 together;
    istart = iend;
    for (i = cnt = istart; i < nBoundaryPoints; i++)
    {
        if (fabs(m_points[0][i] + 1.0) < NekConstants::kNekZeroTol)
        {
            std::swap(m_points[0][cnt], m_points[0][i]);
            std::swap(m_points[1][cnt], m_points[1][i]);
            cnt++;
        }
    }
    // bubble sort edge 3 (counterclockwise numbering)
    iend = istart + nEdgeInteriorPoints;
    for (i = istart; i < iend; i++)
    {
        for (j = istart + 1; j < iend; j++)
        {
            if (m_points[1][j] > m_points[1][j - 1])
            {
                std::swap(m_points[0][j], m_points[0][j - 1]);
                std::swap(m_points[1][j], m_points[1][j - 1]);
            }
        }
    }
 
    if (GetNumPoints() < 5)
    {
        // at numpoints = 4 there is only one interior point so doesnt
        // need sorting
        return;
    }
 
    // someone forgot to finish this piece of code and tell anyone
    // that they didnt
    // face interior nodes needs to be considered
    // make a copy of the unsorted nodes
    // bubble sort by smallest y
    // which will put them into sets of ever decreasing size
    // which can be bubble sorted by x to obtain the distrobution
 
    Array<OneD, NekDouble> xc(m_points[0].size() - iend);
    Array<OneD, NekDouble> yc(m_points[0].size() - iend);
    size_t ct = 0;
    for (i = iend; i < m_points[0].size(); i++, ct++)
    {
        xc[ct] = m_points[0][i];
        yc[ct] = m_points[1][i];
    }
 
    // sort smallest first
    bool repeat = true;
    while (repeat)
    {
        repeat = false;
        for (i = 0; i < xc.size() - 1; i++)
        {
            if (yc[i] > yc[i + 1])
            {
                std::swap(xc[i], xc[i + 1]);
                std::swap(yc[i], yc[i + 1]);
                repeat = true;
            }
        }
    }
 
    size_t offset = 0;
    size_t npl    = GetNumPoints() - 3;
    while (npl > 1)
    {
        repeat = true;
        while (repeat)
        {
            repeat = false;
            for (i = offset; i < offset + npl - 1; i++)
            {
                if (xc[i] > xc[i + 1])
                {
                    std::swap(xc[i], xc[i + 1]);
                    std::swap(yc[i], yc[i + 1]);
                    repeat = true;
                }
            }
        }
        offset += npl;
        npl--;
    }
 
    // copy back in
    ct = 0;
    for (i = iend; i < m_points[0].size(); i++, ct++)
    {
        m_points[0][i] = xc[ct];
        m_points[1][i] = yc[ct];
    }
    return;
}

References Nektar::LibUtilities::Points< NekDouble >::GetNumPoints(), Nektar::NekConstants::kNekZeroTol, Nektar::LibUtilities::Points< NekDouble >::m_points, and Nektar::Array< OneD, const DataType >::size().

Referenced by v_CalculatePoints().

◆ v_CalculateDerivMatrix()

void Nektar::LibUtilities::NodalTriFekete::v_CalculateDerivMatrix ( )

finalprivate

Definition at line 153 of file NodalTriFekete.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::NodalTriFekete::v_CalculatePoints ( )

finalprivatevirtual

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

Definition at line 45 of file NodalTriFekete.cpp.

{
    // Allocate the storage for points
    PointsBaseType::v_CalculatePoints();
 
    size_t index = 0, isum = 0;
    const size_t offset = 3; // offset to match Datafile
    NekDouble b, c;
    size_t numPoints = GetNumPoints();
 
    // initialize values
    for (size_t i = 0; i < numPoints - 2; ++i)
    {
        index += NodalTriFeketeNPTS[i];
    }
 
    for (size_t i = 0; i < NodalTriFeketeNPTS[numPoints - 2]; ++i, ++index)
    {
        if (int(NodalTriFeketeData[index][0]))
        {
            b = NodalTriFeketeData[index][4];
            c = NodalTriFeketeData[index][5];
 
            m_points[0][isum] = 2.0 * b - 1.0;
            m_points[1][isum] = 2.0 * c - 1.0;
            isum++;
            continue;
        } // end symmetry1
 
        if (int(NodalTriFeketeData[index][1]) == 1)
        {
            for (size_t j = 0; j < 3; ++j)
            {
                b = NodalTriFeketeData[index][offset + perm3A_2d[j][1]];
                c = NodalTriFeketeData[index][offset + perm3A_2d[j][2]];
                m_points[0][isum] = 2.0 * b - 1.0;
                m_points[1][isum] = 2.0 * c - 1.0;
                isum++;
            } // end j
            continue;
        } // end symmetry3a
 
        if (int(NodalTriFeketeData[index][1]) == 2)
        {
            for (size_t j = 0; j < 3; ++j)
            {
                b = NodalTriFeketeData[index][offset + perm3B_2d[j][1]];
                c = NodalTriFeketeData[index][offset + perm3B_2d[j][2]];
                m_points[0][isum] = 2.0 * b - 1.0;
                m_points[1][isum] = 2.0 * c - 1.0;
                isum++;
            } // end j
            continue;
        } // end symmetry3b
 
        if (int(NodalTriFeketeData[index][2]))
        {
            for (size_t j = 0; j < 6; ++j)
            {
                b = NodalTriFeketeData[index][offset + perm6_2d[j][1]];
                c = NodalTriFeketeData[index][offset + perm6_2d[j][2]];
                m_points[0][isum] = 2.0 * b - 1.0;
                m_points[1][isum] = 2.0 * c - 1.0;
                isum++;
            } // end j
            continue;
        } // end symmetry6
    }     // end npts
 
    NodalPointReorder2d();
 
    ASSERTL1((static_cast<size_t>(isum) == m_pointsKey.GetTotNumPoints()),
             "sum not equal to npts");
 
    m_util = MemoryManager<NodalUtilTriangle>::AllocateSharedPtr(
        numPoints - 1, m_points[0], m_points[1]);
}

◆ v_CalculateWeights()

void Nektar::LibUtilities::NodalTriFekete::v_CalculateWeights ( )

finalprivatevirtual

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

Definition at line 123 of file NodalTriFekete.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::NodalTriFekete::v_GetI	(	const Array< OneD, const NekDouble > &	x,
		const Array< OneD, const NekDouble > &	y
	)

inlineoverrideprotected

Definition at line 72 of file NodalTriFekete.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::NodalTriFekete::v_GetI ( const PointsKey & pkey )

inlineoverrideprotected

Definition at line 62 of file NodalTriFekete.h.

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