Nektar++
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
Public Member Functions | Static Public Member Functions | Private Member Functions | Private Attributes | List of all members
Nektar::LibUtilities::NodalTriFekete Class Reference

#include <NodalTriFekete.h>

Inheritance diagram for Nektar::LibUtilities::NodalTriFekete:
Inheritance graph
[legend]
Collaboration diagram for Nektar::LibUtilities::NodalTriFekete:
Collaboration graph
[legend]

Public Member Functions

virtual ~NodalTriFekete ()
 
 NodalTriFekete (const PointsKey &key)
 
const MatrixSharedPtrType GetI (const PointsKey &pkey)
 
const MatrixSharedPtrType GetI (const Array< OneD, const NekDouble > &x, const Array< OneD, const NekDouble > &y)
 
- Public Member Functions inherited from Nektar::LibUtilities::Points< NekDouble >
virtual ~Points ()
 
virtual 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
 
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
 
virtual const MatrixSharedPtrType GetI (const Array< OneD, const DataType > &x)
 
virtual const MatrixSharedPtrType GetI (unsigned int numpoints, const Array< OneD, const DataType > &x)
 
virtual const MatrixSharedPtrType GetI (const Array< OneD, const DataType > &x, const Array< OneD, const DataType > &y, const Array< OneD, const DataType > &z)
 
virtual const MatrixSharedPtrType GetGalerkinProjection (const PointsKey &pkey)
 

Static Public Member Functions

static boost::shared_ptr
< PointsBaseType > 		Create (const PointsKey &key)
 

Private Member Functions

 NodalTriFekete ()
 
void CalculatePoints ()
 
void CalculateWeights ()
 
void CalculateDerivMatrix ()
 
void NodalPointReorder2d ()
 
void CalculateInterpMatrix (const Array< OneD, const NekDouble > &xi, const Array< OneD, const NekDouble > &yi, Array< OneD, NekDouble > &interp)
 

Private Attributes

boost::shared_ptr
< NodalUtilTriangle > 		m_util
 

Additional Inherited Members

- Public Types inherited from Nektar::LibUtilities::Points< NekDouble >
typedef NekDouble DataType
 
typedef boost::shared_ptr
< NekMatrix< DataType > > 		MatrixSharedPtrType
 
- Protected Member Functions inherited from Nektar::LibUtilities::Points< NekDouble >
 Points (const PointsKey &key)
 
- Protected Attributes inherited from Nektar::LibUtilities::Points< NekDouble >
PointsKey m_pointsKey
 
Array< OneD, DataType > m_points [3]
 
Array< OneD, DataType > m_weights
 
MatrixSharedPtrType m_derivmatrix [3]
 
NekManager< PointsKey,
NekMatrix< DataType >
, PointsKey::opLess > 		m_InterpManager
 
NekManager< PointsKey,
NekMatrix< DataType >
, PointsKey::opLess > 		m_GalerkinProjectionManager
 

Detailed Description

Definition at line 54 of file NodalTriFekete.h.

Constructor & Destructor Documentation

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

Definition at line 57 of file NodalTriFekete.h.

58  {
59  }
Nektar::LibUtilities::NodalTriFekete::NodalTriFekete ( const PointsKey &  key)
inline

Definition at line 61 of file NodalTriFekete.h.

61  :PointsBaseType(key)
62  {
63  }
Nektar::LibUtilities::PointsBaseType
Points< NekDouble > PointsBaseType
Definition: FoundationsFwd.hpp:84
Nektar::LibUtilities::NodalTriFekete::NodalTriFekete ( )
inlineprivate

Definition at line 96 of file NodalTriFekete.h.

96  :PointsBaseType(NullPointsKey)
97  {
98  }
Nektar::LibUtilities::NullPointsKey
static const PointsKey NullPointsKey(0, eNoPointsType)
Nektar::LibUtilities::PointsBaseType
Points< NekDouble > PointsBaseType
Definition: FoundationsFwd.hpp:84

Member Function Documentation

void Nektar::LibUtilities::NodalTriFekete::CalculateDerivMatrix ( )
privatevirtual

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

Definition at line 164 of file NodalTriFekete.cpp.

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

165  {
166  // Allocate the derivative matrix.
167  PointsBaseType::CalculateDerivMatrix();
168 
169  m_derivmatrix[0] = m_util->GetDerivMatrix(0);
170  m_derivmatrix[1] = m_util->GetDerivMatrix(1);
171  }
Nektar::LibUtilities::NodalTriFekete::m_util
boost::shared_ptr< NodalUtilTriangle > m_util
Definition: NodalTriFekete.h:94
Nektar::LibUtilities::Points< NekDouble >::m_derivmatrix
MatrixSharedPtrType m_derivmatrix[3]
Definition: Points.h:373
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 149 of file NodalTriFekete.cpp.

References m_util, and Vmath::Vcopy().

Referenced by GetI().

151  {
152  Array<OneD, Array<OneD, NekDouble> > xi(2);
153  xi[0] = xia;
154  xi[1] = yia;
155 
156  boost::shared_ptr<NekMatrix<NekDouble> > mat =
157  m_util->GetInterpolationMatrix(xi);
158  Vmath::Vcopy(mat->GetRows() * mat->GetColumns(), mat->GetRawPtr(),
159  1, &interp[0], 1);
160  }
Nektar::LibUtilities::NodalTriFekete::m_util
boost::shared_ptr< NodalUtilTriangle > m_util
Definition: NodalTriFekete.h:94
Vmath::Vcopy
void Vcopy(int n, const T *x, const int incx, T *y, const int incy)
Definition: Vmath.cpp:1061
void Nektar::LibUtilities::NodalTriFekete::CalculatePoints ( )
privatevirtual

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

Definition at line 55 of file NodalTriFekete.cpp.

References Nektar::MemoryManager< DataType >::AllocateSharedPtr(), ASSERTL1, Nektar::LibUtilities::Points< NekDouble >::CalculatePoints(), Nektar::LibUtilities::Points< NekDouble >::GetNumPoints(), Nektar::LibUtilities::PointsKey::GetTotNumPoints(), Nektar::LibUtilities::Points< NekDouble >::m_points, Nektar::LibUtilities::Points< NekDouble >::m_pointsKey, m_util, NodalPointReorder2d(), Nektar::LibUtilities::NodalTriFeketeData, Nektar::LibUtilities::NodalTriFeketeNPTS, Nektar::LibUtilities::perm3A_2d, Nektar::LibUtilities::perm3B_2d, and Nektar::LibUtilities::perm6_2d.

56  {
57  // Allocate the storage for points
58  PointsBaseType::CalculatePoints();
59 
60  int index=0,isum=0;
61  const int offset = 3; //offset to match Datafile
62  NekDouble b,c;
63  unsigned int numPoints = GetNumPoints();
64 
65  // initialize values
66  for(unsigned int i=0; i < numPoints-2; ++i)
67  {
68  index += NodalTriFeketeNPTS[i];
69  }
70 
71  for(unsigned int i=0; i < NodalTriFeketeNPTS[numPoints-2]; ++i, ++index)
72  {
73  if(int(NodalTriFeketeData[index][0]))
74  {
75  b = NodalTriFeketeData[index][4];
76  c = NodalTriFeketeData[index][5];
77 
78  m_points[0][isum] = 2.0*b - 1.0;
79  m_points[1][isum] = 2.0*c - 1.0;
80  isum++;
81  continue;
82  }//end symmetry1
83 
84 
85  if(int(NodalTriFeketeData[index][1]) == 1)
86  {
87  for(unsigned int j=0; j < 3; ++j)
88  {
89  b = NodalTriFeketeData[index][offset+perm3A_2d[j][1]];
90  c = NodalTriFeketeData[index][offset+perm3A_2d[j][2]];
91  m_points[0][isum] = 2.0*b - 1.0;
92  m_points[1][isum] = 2.0*c - 1.0;
93  isum++;
94  }//end j
95  continue;
96  }//end symmetry3a
97 
98  if(int(NodalTriFeketeData[index][1]) == 2)
99  {
100  for(unsigned int j=0; j < 3; ++j)
101  {
102  b = NodalTriFeketeData[index][offset+perm3B_2d[j][1]];
103  c = NodalTriFeketeData[index][offset+perm3B_2d[j][2]];
104  m_points[0][isum] = 2.0*b - 1.0;
105  m_points[1][isum] = 2.0*c - 1.0;
106  isum++;
107  }//end j
108  continue;
109  }//end symmetry3b
110 
111 
112  if(int(NodalTriFeketeData[index][2]))
113  {
114  for(unsigned int j=0; j < 6; ++j)
115  {
116  b = NodalTriFeketeData[index][offset+perm6_2d[j][1]];
117  c = NodalTriFeketeData[index][offset+perm6_2d[j][2]];
118  m_points[0][isum] = 2.0*b - 1.0;
119  m_points[1][isum] = 2.0*c - 1.0;
120  isum++;
121  }//end j
122  continue;
123  }//end symmetry6
124  }//end npts
125 
126  NodalPointReorder2d();
127 
128  ASSERTL1((static_cast<unsigned int>(isum)==m_pointsKey.GetTotNumPoints()),"sum not equal to npts");
129 
130  m_util = MemoryManager<NodalUtilTriangle>::AllocateSharedPtr(
131  numPoints - 1, m_points[0], m_points[1]);
132  }
Nektar::LibUtilities::NodalTriFekete::m_util
boost::shared_ptr< NodalUtilTriangle > m_util
Definition: NodalTriFekete.h:94
Nektar::MemoryManager::AllocateSharedPtr
static boost::shared_ptr< DataType > AllocateSharedPtr()
Allocate a shared pointer from the memory pool.
Definition: NekMemoryManager.hpp:235
Nektar::LibUtilities::perm3B_2d
static const unsigned int perm3B_2d[3][3]
Definition: NodalTriElecData.h:7
Nektar::LibUtilities::Points< NekDouble >::m_points
Array< OneD, DataType > m_points[3]
Definition: Points.h:371
Nektar::LibUtilities::NodalTriFeketeNPTS
static const unsigned int NodalTriFeketeNPTS[NodalTriFeketeAvailable]
Definition: NodalTriFeketeData.h:11
Nektar::LibUtilities::Points< NekDouble >::GetNumPoints
unsigned int GetNumPoints() const
Definition: Points.h:268
Nektar::LibUtilities::PointsKey::GetTotNumPoints
unsigned int GetTotNumPoints() const
Definition: Points.h:179
Nektar::NekDouble
double NekDouble
Definition: NektarUnivTypeDefs.hpp:44
Nektar::LibUtilities::perm3A_2d
static const unsigned int perm3A_2d[3][3]
Definition: NodalTriElecData.h:6
Nektar::LibUtilities::perm6_2d
static const unsigned int perm6_2d[6][3]
Definition: NodalTriElecData.h:8
Nektar::LibUtilities::NodalTriFeketeData
static const NekDouble NodalTriFeketeData[][6]
Definition: NodalTriFeketeData.h:12
ASSERTL1
#define ASSERTL1(condition, msg)
Assert Level 1 – Debugging which is used whether in FULLDEBUG or DEBUG compilation mode...
Definition: ErrorUtil.hpp:228
void Nektar::LibUtilities::NodalTriFekete::CalculateWeights ( )
privatevirtual

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

Definition at line 134 of file NodalTriFekete.cpp.

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

135  {
136  // Allocate the storage for points
137  PointsBaseType::CalculateWeights();
138 
139  typedef DataType T;
140 
141  // Solve the Vandermonde system of integrals for the weight vector
142  NekVector<T> w = m_util->GetWeights();
143  m_weights = Array<OneD,T>( w.GetRows(), w.GetPtr() );
144 
145  }
Nektar::LibUtilities::NodalTriFekete::m_util
boost::shared_ptr< NodalUtilTriangle > m_util
Definition: NodalTriFekete.h:94
Nektar::LibUtilities::Points< NekDouble >::m_weights
Array< OneD, DataType > m_weights
Definition: Points.h:372
boost::shared_ptr< PointsBaseType > Nektar::LibUtilities::NodalTriFekete::Create ( const PointsKey &  key)
static

Definition at line 173 of file NodalTriFekete.cpp.

174  {
175  boost::shared_ptr<PointsBaseType> returnval(MemoryManager<NodalTriFekete>::AllocateSharedPtr(key));
176  returnval->Initialize();
177  return returnval;
178  }
const MatrixSharedPtrType Nektar::LibUtilities::NodalTriFekete::GetI ( const PointsKey &  pkey)
inlinevirtual

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

Definition at line 68 of file NodalTriFekete.h.

References ASSERTL0, Nektar::LibUtilities::PointsKey::GetPointsDim(), and Nektar::LibUtilities::PointsManager().

69  {
70  ASSERTL0(pkey.GetPointsDim() == 2,
71  "Fekete Points can only interp to other 2d "
72  "point distributions");
73  Array<OneD, const NekDouble> x, y;
74  PointsManager()[pkey]->GetPoints(x, y);
75  return GetI(x, y);
76  }
Nektar::LibUtilities::NodalTriFekete::GetI
const MatrixSharedPtrType GetI(const PointsKey &pkey)
Definition: NodalTriFekete.h:68
ASSERTL0
#define ASSERTL0(condition, msg)
Definition: ErrorUtil.hpp:198
Nektar::LibUtilities::PointsManager
PointsManagerT & PointsManager(void)
Definition: ManagerAccess.cpp:110
const MatrixSharedPtrType Nektar::LibUtilities::NodalTriFekete::GetI ( const Array< OneD, const NekDouble > &  x,
const Array< OneD, const NekDouble > &  y 
)
inlinevirtual

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

Definition at line 78 of file NodalTriFekete.h.

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

81  {
82  int numpoints = x.num_elements();
83  unsigned int np = GetTotNumPoints();
84 
85  Array<OneD, NekDouble> interp(GetTotNumPoints()*numpoints);
86  CalculateInterpMatrix(x, y, interp);
87 
88  NekDouble* d = interp.data();
89  return MemoryManager<NekMatrix<NekDouble> >
90  ::AllocateSharedPtr(numpoints, np, d);
91  }
Nektar::LibUtilities::NodalTriFekete::CalculateInterpMatrix
void CalculateInterpMatrix(const Array< OneD, const NekDouble > &xi, const Array< OneD, const NekDouble > &yi, Array< OneD, NekDouble > &interp)
Definition: NodalTriFekete.cpp:149
Nektar::NekDouble
double NekDouble
Definition: NektarUnivTypeDefs.hpp:44
Nektar::LibUtilities::Points< NekDouble >::GetTotNumPoints
unsigned int GetTotNumPoints() const
Definition: Points.h:273
void Nektar::LibUtilities::NodalTriFekete::NodalPointReorder2d ( )
private

Definition at line 180 of file NodalTriFekete.cpp.

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

Referenced by CalculatePoints().

181  {
182  int i,j;
183  int cnt;
184  int istart,iend;
185 
186  const int nVerts = 3;
187  const int nEdgeInteriorPoints = GetNumPoints()-2;
188  const int nBoundaryPoints = 3*nEdgeInteriorPoints + 3;
189 
190  if(nEdgeInteriorPoints==0)
191  {
192  return;
193  }
194 
195  // group the points of edge 1 together;
196  istart = nVerts;
197  for(i = cnt = istart; i < nBoundaryPoints; i++)
198  {
199  if( fabs(m_points[1][i] + 1.0) < NekConstants::kNekZeroTol)
200  {
201  std::swap(m_points[0][cnt], m_points[0][i]);
202  std::swap(m_points[1][cnt], m_points[1][i]);
203  cnt++;
204  }
205  }
206 
207  // bubble sort edge 1 (counterclockwise numbering)
208  iend = istart + nEdgeInteriorPoints;
209  for(i = istart; i < iend; i++)
210  {
211  for(j = istart+1; j < iend; j++)
212  {
213  if(m_points[0][j] < m_points[0][j-1])
214  {
215  std::swap(m_points[0][j], m_points[0][j-1]);
216  std::swap(m_points[1][j], m_points[1][j-1]);
217  }
218  }
219  }
220 
221  // group the points of edge 2 together;
222  istart = iend;
223  for(i = cnt = istart; i < nBoundaryPoints; i++)
224  {
225  if( fabs(m_points[1][i]+m_points[0][i]) < NekConstants::kNekZeroTol)
226  {
227  std::swap(m_points[0][cnt], m_points[0][i]);
228  std::swap(m_points[1][cnt], m_points[1][i]);
229  cnt++;
230  }
231  }
232 
233  // bubble sort edge 2 (counterclockwise numbering)
234  iend = istart + nEdgeInteriorPoints;
235  for(i = istart; i < iend; i++)
236  {
237  for(j = istart+1; j < iend; j++)
238  {
239  if(m_points[1][j] < m_points[1][j-1])
240  {
241  std::swap(m_points[0][j], m_points[0][j-1]);
242  std::swap(m_points[1][j], m_points[1][j-1]);
243  }
244  }
245  }
246 
247  // group the points of edge 3 together;
248  istart = iend;
249  for(i = cnt = istart; i < nBoundaryPoints; i++)
250  {
251  if( fabs(m_points[0][i]+1.0) < NekConstants::kNekZeroTol)
252  {
253  std::swap(m_points[0][cnt], m_points[0][i]);
254  std::swap(m_points[1][cnt], m_points[1][i]);
255  cnt++;
256  }
257  }
258  // bubble sort edge 3 (counterclockwise numbering)
259  iend = istart + nEdgeInteriorPoints;
260  for(i = istart; i < iend; i++)
261  {
262  for(j = istart+1; j < iend; j++)
263  {
264  if(m_points[1][j] > m_points[1][j-1])
265  {
266  std::swap(m_points[0][j], m_points[0][j-1]);
267  std::swap(m_points[1][j], m_points[1][j-1]);
268  }
269  }
270  }
271 
272  if(GetNumPoints() < 5)
273  {
274  //at numpoints = 4 there is only one interior point so doesnt
275  //need sorting
276  return;
277  }
278 
279  //someone forgot to finish this piece of code and tell anyone
280  //that they didnt
281  //face interior nodes needs to be considered
282  //make a copy of the unsorted nodes
283  //bubble sort by smallest y
284  //which will put them into sets of ever decreasing size
285  //which can be bubble sorted by x to obtain the distrobution
286 
287  Array<OneD, NekDouble> xc(m_points[0].num_elements() - iend);
288  Array<OneD, NekDouble> yc(m_points[0].num_elements() - iend);
289  int ct = 0;
290  for(i = iend; i < m_points[0].num_elements(); i++, ct++)
291  {
292  xc[ct] = m_points[0][i];
293  yc[ct] = m_points[1][i];
294  }
295 
296  //sort smallest first
297  bool repeat = true;
298  while(repeat)
299  {
300  repeat = false;
301  for(i = 0; i < xc.num_elements() - 1; i++)
302  {
303  if(yc[i] > yc[i+1])
304  {
305  std::swap(xc[i],xc[i+1]);
306  std::swap(yc[i],yc[i+1]);
307  repeat = true;
308  }
309  }
310  }
311 
312  int offset = 0;
313  int npl = GetNumPoints() - 3;
314  while(npl > 1)
315  {
316  repeat = true;
317  while(repeat)
318  {
319  repeat = false;
320  for(i = offset; i < offset + npl - 1; i++)
321  {
322  if(xc[i] > xc[i+1])
323  {
324  std::swap(xc[i],xc[i+1]);
325  std::swap(yc[i],yc[i+1]);
326  repeat = true;
327  }
328  }
329  }
330  offset += npl;
331  npl--;
332  }
333 
334  //copy back in
335  ct = 0;
336  for(i = iend; i < m_points[0].num_elements(); i++, ct++)
337  {
338  m_points[0][i] = xc[ct];
339  m_points[1][i] = yc[ct];
340  }
341  return;
342  }
Nektar::LibUtilities::Points< NekDouble >::m_points
Array< OneD, DataType > m_points[3]
Definition: Points.h:371
Nektar::Array< OneD, const DataType >::num_elements
size_type num_elements() const
Returns the array's size.
Definition: SharedArray.hpp:226
Nektar::NekConstants::kNekZeroTol
static const NekDouble kNekZeroTol
Definition: NektarUnivConsts.hpp:51
Nektar::LibUtilities::Points< NekDouble >::GetNumPoints
unsigned int GetNumPoints() const
Definition: Points.h:268

Member Data Documentation

boost::shared_ptr<NodalUtilTriangle> Nektar::LibUtilities::NodalTriFekete::m_util
private

Definition at line 94 of file NodalTriFekete.h.

Referenced by CalculateDerivMatrix(), CalculateInterpMatrix(), CalculatePoints(), and CalculateWeights().

Generated on Wed Mar 8 2017 12:29:47 for Nektar++ by   doxygen 1.8.8