Nektar++
Public Member Functions | Static Public Member Functions | Protected Member Functions | Private Member Functions | Private Attributes | Static Private Attributes | List of all members
Nektar::LibUtilities::NodalPrismEvenlySpaced Class Reference

#include <NodalPrismEvenlySpaced.h>

Inheritance diagram for Nektar::LibUtilities::NodalPrismEvenlySpaced:
[legend]

Public Member Functions

virtual ~NodalPrismEvenlySpaced ()
 
 NodalPrismEvenlySpaced (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 MatrixSharedPtrTypeGetD (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< PointsBaseTypeCreate (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_CalculatePoints ()
 
virtual void v_CalculateWeights ()
 

Private Member Functions

 NodalPrismEvenlySpaced ()=delete
 
 NodalPrismEvenlySpaced (const NodalPrismEvenlySpaced &points)=delete
 
void NodalPointReorder3d ()
 
virtual void v_CalculatePoints () override final
 
virtual void v_CalculateWeights () override final
 
virtual void v_CalculateDerivMatrix () override final
 
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< NodalUtilPrismm_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, DataTypem_points [3]
 Storage for the point locations, allowing for up to a 3D points storage. More...
 
Array< OneD, DataTypem_weights
 Quadrature weights for the weights. More...
 
Array< OneD, DataTypem_bcweights
 Barycentric weights. More...
 
MatrixSharedPtrType m_derivmatrix [3]
 Derivative matrices. More...
 
NekManager< PointsKey, NekMatrix< DataType >, PointsKey::opLessm_InterpManager
 
NekManager< PointsKey, NekMatrix< DataType >, PointsKey::opLessm_GalerkinProjectionManager
 

Detailed Description

Definition at line 47 of file NodalPrismEvenlySpaced.h.

Constructor & Destructor Documentation

◆ ~NodalPrismEvenlySpaced()

virtual Nektar::LibUtilities::NodalPrismEvenlySpaced::~NodalPrismEvenlySpaced ( )
inlinevirtual

Definition at line 50 of file NodalPrismEvenlySpaced.h.

51 {
52 }

◆ NodalPrismEvenlySpaced() [1/3]

Nektar::LibUtilities::NodalPrismEvenlySpaced::NodalPrismEvenlySpaced ( const PointsKey key)
inline

Definition at line 54 of file NodalPrismEvenlySpaced.h.

54 : PointsBaseType(key)
55 {
56 }
Points< NekDouble > PointsBaseType

◆ NodalPrismEvenlySpaced() [2/3]

Nektar::LibUtilities::NodalPrismEvenlySpaced::NodalPrismEvenlySpaced ( )
privatedelete

◆ NodalPrismEvenlySpaced() [3/3]

Nektar::LibUtilities::NodalPrismEvenlySpaced::NodalPrismEvenlySpaced ( const NodalPrismEvenlySpaced points)
privatedelete

Member Function Documentation

◆ CalculateInterpMatrix()

void Nektar::LibUtilities::NodalPrismEvenlySpaced::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 408 of file NodalPrismEvenlySpaced.cpp.

412{
413 Array<OneD, Array<OneD, NekDouble>> xi(3);
414 xi[0] = xia;
415 xi[1] = yia;
416 xi[2] = zia;
417
418 std::shared_ptr<NekMatrix<NekDouble>> mat =
419 m_util->GetInterpolationMatrix(xi);
420 Vmath::Vcopy(mat->GetRows() * mat->GetColumns(), mat->GetRawPtr(), 1,
421 &interp[0], 1);
422}
void Vcopy(int n, const T *x, const int incx, T *y, const int incy)
Definition: Vmath.cpp:1191

References m_util, and Vmath::Vcopy().

Referenced by v_GetI().

◆ Create()

std::shared_ptr< PointsBaseType > Nektar::LibUtilities::NodalPrismEvenlySpaced::Create ( const PointsKey key)
static

Definition at line 436 of file NodalPrismEvenlySpaced.cpp.

438{
439 std::shared_ptr<PointsBaseType> returnval(
441
442 returnval->Initialize();
443
444 return returnval;
445}
static std::shared_ptr< DataType > AllocateSharedPtr(const Args &...args)
Allocate a shared pointer from the memory pool.

◆ NodalPointReorder3d()

void Nektar::LibUtilities::NodalPrismEvenlySpaced::NodalPointReorder3d ( )
private

Definition at line 190 of file NodalPrismEvenlySpaced.cpp.

191{
192 size_t npts = GetNumPoints();
193 using std::vector;
194 vector<int> vertex;
195 vector<int> iEdge_01; // interior edge 0
196 vector<int> iEdge_12; // interior edge 1
197 vector<int> iEdge_23; // interior edge 2
198 vector<int> iEdge_30; // interior edge 3
199 vector<int> iEdge_04; // interior edge 4
200 vector<int> iEdge_14; // interior edge 5
201 vector<int> iEdge_25; // interior edge 6
202 vector<int> iEdge_35; // interior edge 7
203 vector<int> iEdge_45; // interior edge 8
204 vector<int> iFace_0123; // interior face 0
205 vector<int> iFace_014; // interior face 1
206 vector<int> iFace_1254; // interior face 2
207 vector<int> iFace_325; // interior face 3
208 vector<int> iFace_0354; // interior face 4
209 vector<int> interiorVolumePoints; // interior volume points
210 vector<int> map;
211
212 // Build the lattice prism left to right - bottom to top
213 for (size_t z = 0, index = 0; z < npts; ++z)
214 {
215 for (size_t y = 0; y < npts; ++y)
216 {
217 for (size_t x = 0; x < npts - z; ++x, ++index)
218 {
219 if (isVertex(x, y, z, npts))
220 {
221 vertex.push_back(index);
222 }
223 else if (isEdge(x, y, z, npts))
224 {
225 if (isEdge_01(x, y, z, npts))
226 {
227 iEdge_01.push_back(index);
228 }
229 else if (isEdge_12(x, y, z, npts))
230 {
231 iEdge_12.push_back(index);
232 }
233 else if (isEdge_23(x, y, z, npts))
234 {
235 iEdge_23.push_back(index);
236 }
237 else if (isEdge_30(x, y, z, npts))
238 {
239 iEdge_30.push_back(index);
240 }
241 else if (isEdge_04(x, y, z, npts))
242 {
243 iEdge_04.push_back(index);
244 }
245 else if (isEdge_14(x, y, z, npts))
246 {
247 iEdge_14.push_back(index);
248 }
249 else if (isEdge_25(x, y, z, npts))
250 {
251 iEdge_25.push_back(index);
252 }
253 else if (isEdge_35(x, y, z, npts))
254 {
255 iEdge_35.push_back(index);
256 }
257 else if (isEdge_45(x, y, z, npts))
258 {
259 iEdge_45.push_back(index);
260 }
261 }
262 else if (isFace(x, y, z, npts))
263 {
264 if (isFace_0123(x, y, z, npts))
265 {
266 iFace_0123.push_back(index);
267 }
268 else if (isFace_014(x, y, z, npts))
269 {
270 iFace_014.push_back(index);
271 }
272 else if (isFace_1254(x, y, z, npts))
273 {
274 iFace_1254.push_back(index);
275 }
276 else if (isFace_325(x, y, z, npts))
277 {
278 iFace_325.push_back(index);
279 }
280 else if (isFace_0354(x, y, z, npts))
281 {
282 iFace_0354.push_back(index);
283 }
284 }
285 else
286 {
287 interiorVolumePoints.push_back(index);
288 }
289 }
290 }
291 }
292
293 for (size_t n = 0; n < vertex.size(); ++n)
294 {
295 map.push_back(vertex[n]);
296 }
297
298 for (size_t n = 0; n < iEdge_01.size(); ++n)
299 {
300 map.push_back(iEdge_01[n]);
301 }
302
303 for (size_t n = 0; n < iEdge_12.size(); ++n)
304 {
305 map.push_back(iEdge_12[n]);
306 }
307
308 for (size_t n = 0; n < iEdge_23.size(); ++n)
309 {
310 map.push_back(iEdge_23[n]);
311 }
312
313 for (size_t n = 0; n < iEdge_30.size(); ++n)
314 {
315 map.push_back(iEdge_30[n]);
316 }
317
318 for (size_t n = 0; n < iEdge_04.size(); ++n)
319 {
320 map.push_back(iEdge_04[n]);
321 }
322
323 for (size_t n = 0; n < iEdge_14.size(); ++n)
324 {
325 map.push_back(iEdge_14[n]);
326 }
327
328 for (size_t n = 0; n < iEdge_25.size(); ++n)
329 {
330 map.push_back(iEdge_25[n]);
331 }
332
333 for (size_t n = 0; n < iEdge_35.size(); ++n)
334 {
335 map.push_back(iEdge_35[n]);
336 }
337
338 for (size_t n = 0; n < iEdge_45.size(); ++n)
339 {
340 map.push_back(iEdge_45[n]);
341 }
342
343 for (size_t n = 0; n < iFace_0123.size(); ++n)
344 {
345 map.push_back(iFace_0123[n]);
346 }
347
348 for (size_t n = 0; n < iFace_014.size(); ++n)
349 {
350 map.push_back(iFace_014[n]);
351 }
352
353 for (size_t n = 0; n < iFace_1254.size(); ++n)
354 {
355 map.push_back(iFace_1254[n]);
356 }
357
358 for (size_t n = 0; n < iFace_325.size(); ++n)
359 {
360 map.push_back(iFace_325[n]);
361 }
362
363 for (size_t n = 0; n < iFace_0354.size(); ++n)
364 {
365 map.push_back(iFace_0354[n]);
366 }
367
368 for (size_t n = 0; n < interiorVolumePoints.size(); ++n)
369 {
370 map.push_back(interiorVolumePoints[n]);
371 }
372
373 Array<OneD, NekDouble> points[3];
374 points[0] = Array<OneD, NekDouble>(GetTotNumPoints());
375 points[1] = Array<OneD, NekDouble>(GetTotNumPoints());
376 points[2] = Array<OneD, NekDouble>(GetTotNumPoints());
377
378 for (size_t index = 0; index < map.size(); ++index)
379 {
380 points[0][index] = m_points[0][index];
381 points[1][index] = m_points[1][index];
382 points[2][index] = m_points[2][index];
383 }
384
385 for (size_t index = 0; index < map.size(); ++index)
386 {
387 m_points[0][index] = points[0][map[index]];
388 m_points[1][index] = points[1][map[index]];
389 m_points[2][index] = points[2][map[index]];
390 }
391}
Array< OneD, DataType > m_points[3]
Storage for the point locations, allowing for up to a 3D points storage.
Definition: Points.h:361
std::vector< double > z(NPUPPER)

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

Referenced by v_CalculatePoints().

◆ v_CalculateDerivMatrix()

void Nektar::LibUtilities::NodalPrismEvenlySpaced::v_CalculateDerivMatrix ( )
finaloverrideprivatevirtual

Definition at line 426 of file NodalPrismEvenlySpaced.cpp.

427{
428 // Allocate the derivative matrix.
429 PointsBaseType::v_CalculateDerivMatrix();
430
431 m_derivmatrix[0] = m_util->GetDerivMatrix(0);
432 m_derivmatrix[1] = m_util->GetDerivMatrix(1);
433 m_derivmatrix[2] = m_util->GetDerivMatrix(2);
434}
MatrixSharedPtrType m_derivmatrix[3]
Derivative matrices.
Definition: Points.h:367

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

◆ v_CalculatePoints()

void Nektar::LibUtilities::NodalPrismEvenlySpaced::v_CalculatePoints ( )
finaloverrideprivatevirtual

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

Definition at line 160 of file NodalPrismEvenlySpaced.cpp.

161{
162 // Allocate the storage for points
164
165 // Populate m_points
166 size_t npts = GetNumPoints();
167 NekDouble delta = 2.0 / (npts - 1.0);
168 for (size_t z = 0, index = 0; z < npts; ++z)
169 {
170 for (size_t y = 0; y < npts; ++y)
171 {
172 for (size_t x = 0; x < npts - z; ++x, ++index)
173 {
174 NekDouble xi = -1.0 + x * delta;
175 NekDouble yi = -1.0 + y * delta;
176 NekDouble zi = -1.0 + z * delta;
177
178 m_points[0][index] = xi;
179 m_points[1][index] = yi;
180 m_points[2][index] = zi;
181 }
182 }
183 }
184
187 npts - 1, m_points[0], m_points[1], m_points[2]);
188}
double NekDouble

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

◆ v_CalculateWeights()

void Nektar::LibUtilities::NodalPrismEvenlySpaced::v_CalculateWeights ( )
finaloverrideprivatevirtual

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

Definition at line 393 of file NodalPrismEvenlySpaced.cpp.

394{
395 // Allocate the storage for points
397
398 typedef DataType T;
399
400 // Solve the Vandermonde system of integrals for the weight vector
401 NekVector<T> w = m_util->GetWeights();
402
403 m_weights = Array<OneD, T>(w.GetRows(), w.GetPtr());
404}
Array< OneD, DataType > m_weights
Quadrature weights for the weights.
Definition: Points.h:363
std::vector< double > w(NPUPPER)

References m_util, Nektar::LibUtilities::Points< NekDouble >::m_weights, Nektar::LibUtilities::Points< NekDouble >::v_CalculateWeights(), and Nektar::UnitTests::w().

◆ v_GetI() [1/2]

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

Definition at line 72 of file NodalPrismEvenlySpaced.h.

76 {
77 size_t numpoints = x.size();
78 size_t np = GetTotNumPoints();
79
80 Array<OneD, NekDouble> interp(GetTotNumPoints() * numpoints);
81 CalculateInterpMatrix(x, y, z, interp);
82
83 NekDouble *d = interp.data();
84 return MemoryManager<NekMatrix<NekDouble>>::AllocateSharedPtr(numpoints,
85 np, d);
86 }
void CalculateInterpMatrix(const Array< OneD, const NekDouble > &xi, const Array< OneD, const NekDouble > &yi, const Array< OneD, const NekDouble > &zi, Array< OneD, NekDouble > &interp)
std::vector< double > d(NPUPPER *NPUPPER)

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

◆ v_GetI() [2/2]

virtual const MatrixSharedPtrType Nektar::LibUtilities::NodalPrismEvenlySpaced::v_GetI ( const PointsKey pkey)
inlineoverrideprotectedvirtual

Definition at line 62 of file NodalPrismEvenlySpaced.h.

63 {
64 ASSERTL0(pkey.GetPointsDim() == 3,
65 "NodalPrismEvenlySpaced Points can only interp to "
66 "other 3d point distributions");
67 Array<OneD, const NekDouble> x, y, z;
68 PointsManager()[pkey]->GetPoints(x, y, z);
69 return GetI(x, y, z);
70 }
#define ASSERTL0(condition, msg)
Definition: ErrorUtil.hpp:215
const MatrixSharedPtrType GetI(const PointsKey &key)
Definition: Points.h:322
PointsManagerT & PointsManager(void)

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

Member Data Documentation

◆ initPointsManager

bool Nektar::LibUtilities::NodalPrismEvenlySpaced::initPointsManager
staticprivate
Initial value:
= {
bool RegisterCreator(const KeyType &key, const CreateFuncType &createFunc)
Register the given function and associate it with the key. The return value is just to facilitate cal...
Definition: NekManager.hpp:169
static std::shared_ptr< PointsBaseType > Create(const PointsKey &key)
@ eNodalPrismEvenlySpaced
3D Evenly-spaced points on a Prism
Definition: PointsType.h:88

Definition at line 89 of file NodalPrismEvenlySpaced.h.

◆ m_util

std::shared_ptr<NodalUtilPrism> Nektar::LibUtilities::NodalPrismEvenlySpaced::m_util
private