Nektar++
BwdTrans.cpp
Go to the documentation of this file.
1///////////////////////////////////////////////////////////////////////////////
2//
3// File: BwdTrans.cpp
4//
5// For more information, please see: http://www.nektar.info
6//
7// The MIT License
8//
9// Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
10// Department of Aeronautics, Imperial College London (UK), and Scientific
11// Computing and Imaging Institute, University of Utah (USA).
12//
13// Permission is hereby granted, free of charge, to any person obtaining a
14// copy of this software and associated documentation files (the "Software"),
15// to deal in the Software without restriction, including without limitation
16// the rights to use, copy, modify, merge, publish, distribute, sublicense,
17// and/or sell copies of the Software, and to permit persons to whom the
18// Software is furnished to do so, subject to the following conditions:
19//
20// The above copyright notice and this permission notice shall be included
21// in all copies or substantial portions of the Software.
22//
23// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
24// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
25// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
26// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
27// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
28// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
29// DEALINGS IN THE SOFTWARE.
30//
31// Description: BwdTrans operator implementations
32//
33///////////////////////////////////////////////////////////////////////////////
34
38
39#include <MatrixFreeOps/Operator.hpp>
40
41using namespace std;
42
44{
45
53
54/**
55 * @brief Backward transform help class to calculate the size of the collection
56 * that is given as an input and as an output to the BwdTrans Operator. The size
57 * evaluation takes into account the conversion from the coefficient space to
58 * the physical space
59 */
60class BwdTrans_Helper : virtual public Operator
61{
62protected:
64 {
65 // expect input to be number of elements by the number of coefficients
66 m_inputSize = m_numElmt * m_stdExp->GetNcoeffs();
67 // expect input to be number of elements by the number of quad points
68 m_outputSize = m_numElmt * m_stdExp->GetTotPoints();
69 }
70};
71
72/**
73 * @brief Backward transform operator using standard matrix approach.
74 */
75class BwdTrans_StdMat final : virtual public Operator,
76 virtual public BwdTrans_Helper
77{
78public:
80
81 ~BwdTrans_StdMat() final = default;
82
83 void operator()(const Array<OneD, const NekDouble> &input,
84 Array<OneD, NekDouble> &output0,
85 [[maybe_unused]] Array<OneD, NekDouble> &output1,
86 [[maybe_unused]] Array<OneD, NekDouble> &output2,
87 [[maybe_unused]] Array<OneD, NekDouble> &wsp) override
88 {
89 Blas::Dgemm('N', 'N', m_mat->GetRows(), m_numElmt, m_mat->GetColumns(),
90 1.0, m_mat->GetRawPtr(), m_mat->GetRows(), input.get(),
91 m_stdExp->GetNcoeffs(), 0.0, output0.get(),
92 m_stdExp->GetTotPoints());
93 }
94
95 void operator()([[maybe_unused]] int dir,
96 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
97 [[maybe_unused]] Array<OneD, NekDouble> &output,
98 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
99 {
100 ASSERTL0(false, "Not valid for this operator.");
101 }
102
103protected:
105
106private:
107 BwdTrans_StdMat(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
110 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper()
111 {
113 m_stdExp->DetShapeType(), *m_stdExp);
114 m_mat = m_stdExp->GetStdMatrix(key);
115 }
116};
117
118/// Factory initialisation for the BwdTrans_StdMat operators
119OperatorKey BwdTrans_StdMat::m_typeArr[] = {
122 BwdTrans_StdMat::create, "BwdTrans_StdMat_Seg"),
125 BwdTrans_StdMat::create, "BwdTrans_StdMat_Tri"),
128 BwdTrans_StdMat::create, "BwdTrans_StdMat_NodalTri"),
131 BwdTrans_StdMat::create, "BwdTrans_StdMat_Quad"),
134 BwdTrans_StdMat::create, "BwdTrans_StdMat_Tet"),
137 BwdTrans_StdMat::create, "BwdTrans_StdMat_NodalTet"),
140 BwdTrans_StdMat::create, "BwdTrans_StdMat_Pyr"),
142 OperatorKey(ePrism, eBwdTrans, eStdMat, false), BwdTrans_StdMat::create,
143 "BwdTrans_StdMat_Prism"),
145 OperatorKey(ePrism, eBwdTrans, eStdMat, true), BwdTrans_StdMat::create,
146 "BwdTrans_StdMat_NodalPrism"),
149 BwdTrans_StdMat::create, "BwdTrans_StdMat_Hex"),
152 BwdTrans_StdMat::create, "BwdTrans_SumFac_Pyr")};
153
154/**
155 * @brief Backward transform operator using matrix free operators.
156 */
157class BwdTrans_MatrixFree final : virtual public Operator,
159 virtual public BwdTrans_Helper
160{
161public:
163
164 ~BwdTrans_MatrixFree() final = default;
165
166 void operator()(const Array<OneD, const NekDouble> &input,
167 Array<OneD, NekDouble> &output0,
168 [[maybe_unused]] Array<OneD, NekDouble> &output1,
169 [[maybe_unused]] Array<OneD, NekDouble> &output2,
170 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
171 {
172 if (m_isPadded)
173 {
174 // copy into padded vector
175 Vmath::Vcopy(m_nIn, input, 1, m_input, 1);
176 // call op
177 (*m_oper)(m_input, m_output);
178 // copy out of padded vector
179 Vmath::Vcopy(m_nOut, m_output, 1, output0, 1);
180 }
181 else
182 {
183 (*m_oper)(input, output0);
184 }
185 }
186
187 void operator()([[maybe_unused]] int dir,
188 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
189 [[maybe_unused]] Array<OneD, NekDouble> &output,
190 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
191 {
193 "BwdTrans_MatrixFree: Not valid for this operator.");
194 }
195
196private:
197 std::shared_ptr<MatrixFree::BwdTrans> m_oper;
198
199 BwdTrans_MatrixFree(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
202 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper(),
203 MatrixFreeOneInOneOut(pCollExp[0]->GetStdExp()->GetNcoeffs(),
204 pCollExp[0]->GetStdExp()->GetTotPoints(),
205 pCollExp.size())
206 {
207 // Basis vector.
208 const auto dim = pCollExp[0]->GetStdExp()->GetShapeDimension();
209 std::vector<LibUtilities::BasisSharedPtr> basis(dim);
210 for (auto i = 0; i < dim; ++i)
211 {
212 basis[i] = pCollExp[0]->GetBasis(i);
213 }
214
215 // Get shape type
216 auto shapeType = pCollExp[0]->GetStdExp()->DetShapeType();
217
218 // Generate operator string and create operator.
219 std::string op_string = "BwdTrans";
220 op_string += MatrixFree::GetOpstring(shapeType, false);
222 op_string, basis, m_nElmtPad);
223
224 m_oper = std::dynamic_pointer_cast<MatrixFree::BwdTrans>(oper);
225 ASSERTL0(m_oper, "Failed to cast pointer.");
226 }
227};
228
229/// Factory initialisation for the BwdTrans_MatrixFree operators
230OperatorKey BwdTrans_MatrixFree::m_typeArr[] = {
233 BwdTrans_MatrixFree::create, "BwdTrans_MatrixFree_Seg"),
236 BwdTrans_MatrixFree::create, "BwdTrans_MatrixFree_Quad"),
239 BwdTrans_MatrixFree::create, "BwdTrans_MatrixFree_Tri"),
242 BwdTrans_MatrixFree::create, "BwdTrans_MatrixFree_Hex"),
245 BwdTrans_MatrixFree::create, "BwdTrans_MatrixFree_Prism"),
248 BwdTrans_MatrixFree::create, "BwdTrans_MatrixFree_Tet"),
251 BwdTrans_MatrixFree::create, "BwdTrans_MatrixFree_Pyr")};
252
253/**
254 * @brief Backward transform operator using default StdRegions operator
255 */
256class BwdTrans_IterPerExp final : virtual public Operator,
257 virtual public BwdTrans_Helper
258{
259public:
261
262 ~BwdTrans_IterPerExp() final = default;
263
264 void operator()(const Array<OneD, const NekDouble> &input,
265 Array<OneD, NekDouble> &output0,
266 [[maybe_unused]] Array<OneD, NekDouble> &output1,
267 [[maybe_unused]] Array<OneD, NekDouble> &output2,
268 [[maybe_unused]] Array<OneD, NekDouble> &wsp) override
269 {
270 const int nCoeffs = m_stdExp->GetNcoeffs();
271 const int nPhys = m_stdExp->GetTotPoints();
273
274 for (int i = 0; i < m_numElmt; ++i)
275 {
276 m_stdExp->BwdTrans(input + i * nCoeffs, tmp = output0 + i * nPhys);
277 }
278 }
279
280 void operator()([[maybe_unused]] int dir,
281 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
282 [[maybe_unused]] Array<OneD, NekDouble> &output,
283 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
284 {
285 ASSERTL0(false, "Not valid for this operator.");
286 }
287
288private:
289 BwdTrans_IterPerExp(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
292 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper()
293 {
294 }
295};
296
297/// Factory initialisation for the BwdTrans_IterPerExp operators
298OperatorKey BwdTrans_IterPerExp::m_typeArr[] = {
301 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_Seg"),
304 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_Tri"),
307 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_NodalTri"),
310 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_Quad"),
313 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_Tet"),
316 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_NodalTet"),
319 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_Pyr"),
322 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_Prism"),
325 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_NodalPrism"),
328 BwdTrans_IterPerExp::create, "BwdTrans_IterPerExp_Hex"),
329};
330
331/**
332 * @brief Backward transform operator using LocalRegions implementation.
333 */
334class BwdTrans_NoCollection final : virtual public Operator,
335 virtual public BwdTrans_Helper
336{
337public:
339
340 ~BwdTrans_NoCollection() final = default;
341
342 void operator()(const Array<OneD, const NekDouble> &input,
343 Array<OneD, NekDouble> &output0,
344 [[maybe_unused]] Array<OneD, NekDouble> &output1,
345 [[maybe_unused]] Array<OneD, NekDouble> &output2,
346 [[maybe_unused]] Array<OneD, NekDouble> &wsp) override
347 {
348 const int nCoeffs = m_expList[0]->GetNcoeffs();
349 const int nPhys = m_expList[0]->GetTotPoints();
351
352 for (int i = 0; i < m_numElmt; ++i)
353 {
354 m_expList[i]->BwdTrans(input + i * nCoeffs,
355 tmp = output0 + i * nPhys);
356 }
357 }
358
359 void operator()([[maybe_unused]] int dir,
360 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
361 [[maybe_unused]] Array<OneD, NekDouble> &output,
362 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
363 {
364 ASSERTL0(false, "Not valid for this operator.");
365 }
366
367protected:
368 vector<StdRegions::StdExpansionSharedPtr> m_expList;
369
370private:
371 BwdTrans_NoCollection(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
374 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper()
375 {
376 m_expList = pCollExp;
377 }
378};
379
380/// Factory initialisation for the BwdTrans_NoCollection operators
381OperatorKey BwdTrans_NoCollection::m_typeArr[] = {
384 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_Seg"),
387 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_Tri"),
390 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_NodalTri"),
393 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_Quad"),
396 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_Tet"),
399 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_NodalTet"),
402 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_Pyr"),
405 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_Prism"),
408 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_NodalPrism"),
411 BwdTrans_NoCollection::create, "BwdTrans_NoCollection_Hex"),
412};
413
414/**
415 * @brief Backward transform operator using sum-factorisation (Segment)
416 */
417class BwdTrans_SumFac_Seg final : virtual public Operator,
418 virtual public BwdTrans_Helper
419{
420public:
422
423 ~BwdTrans_SumFac_Seg() final = default;
424
425 void operator()(const Array<OneD, const NekDouble> &input,
426 Array<OneD, NekDouble> &output0,
427 [[maybe_unused]] Array<OneD, NekDouble> &output1,
428 [[maybe_unused]] Array<OneD, NekDouble> &output2,
429 [[maybe_unused]] Array<OneD, NekDouble> &wsp) override
430 {
431 if (m_colldir0)
432 {
433 Vmath::Vcopy(m_numElmt * m_nmodes0, input.get(), 1, output0.get(),
434 1);
435 }
436 else
437 {
438 // out = B0*in;
439 Blas::Dgemm('N', 'N', m_nquad0, m_numElmt, m_nmodes0, 1.0,
440 m_base0.get(), m_nquad0, &input[0], m_nmodes0, 0.0,
441 &output0[0], m_nquad0);
442 }
443 }
444
445 void operator()([[maybe_unused]] int dir,
446 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
447 [[maybe_unused]] Array<OneD, NekDouble> &output,
448 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
449 {
450 ASSERTL0(false, "Not valid for this operator.");
451 }
452
453protected:
454 const int m_nquad0;
455 const int m_nmodes0;
456 const bool m_colldir0;
458
459private:
460 BwdTrans_SumFac_Seg(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
463 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper(),
464 m_nquad0(m_stdExp->GetNumPoints(0)),
465 m_nmodes0(m_stdExp->GetBasisNumModes(0)),
466 m_colldir0(m_stdExp->GetBasis(0)->Collocation()),
467 m_base0(m_stdExp->GetBasis(0)->GetBdata())
468 {
469 m_wspSize = 0;
470 }
471};
472
473/// Factory initialisation for the BwdTrans_SumFac_Seg operator
474OperatorKey BwdTrans_SumFac_Seg::m_type =
477 BwdTrans_SumFac_Seg::create, "BwdTrans_SumFac_Seg");
478
479/**
480 * @brief Backward transform operator using sum-factorisation (Quad)
481 */
482class BwdTrans_SumFac_Quad final : virtual public Operator,
483 virtual public BwdTrans_Helper
484{
485public:
487
488 ~BwdTrans_SumFac_Quad() final = default;
489
490 void operator()(const Array<OneD, const NekDouble> &input,
491 Array<OneD, NekDouble> &output0,
492 [[maybe_unused]] Array<OneD, NekDouble> &output1,
493 [[maybe_unused]] Array<OneD, NekDouble> &output2,
494 Array<OneD, NekDouble> &wsp) override
495 {
496 int i = 0;
497 if (m_colldir0 && m_colldir1)
498 {
499 Vmath::Vcopy(m_numElmt * m_nmodes0 * m_nmodes1, input.get(), 1,
500 output0.get(), 1);
501 }
502 else if (m_colldir0)
503 {
504 for (i = 0; i < m_numElmt; ++i)
505 {
506 Blas::Dgemm('N', 'T', m_nquad0, m_nquad1, m_nmodes1, 1.0,
507 &input[i * m_nquad0 * m_nmodes1], m_nquad0,
508 m_base1.get(), m_nquad1, 0.0,
509 &output0[i * m_nquad0 * m_nquad1], m_nquad0);
510 }
511 }
512 else if (m_colldir1)
513 {
515 1.0, m_base0.get(), m_nquad0, &input[0], m_nmodes0, 0.0,
516 &output0[0], m_nquad0);
517 }
518 else
519 {
520 ASSERTL1(wsp.size() == m_wspSize, "Incorrect workspace size");
521
522 // Those two calls correpsond to the operation
523 // out = B0*in*Transpose(B1);
525 1.0, m_base0.get(), m_nquad0, &input[0], m_nmodes0, 0.0,
526 &wsp[0], m_nquad0);
527
528 for (i = 0; i < m_numElmt; ++i)
529 {
530 Blas::Dgemm('N', 'T', m_nquad0, m_nquad1, m_nmodes1, 1.0,
531 &wsp[i * m_nquad0 * m_nmodes1], m_nquad0,
532 m_base1.get(), m_nquad1, 0.0,
533 &output0[i * m_nquad0 * m_nquad1], m_nquad0);
534 }
535 }
536 }
537
538 void operator()([[maybe_unused]] int dir,
539 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
540 [[maybe_unused]] Array<OneD, NekDouble> &output,
541 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
542 {
543 ASSERTL0(false, "Not valid for this operator.");
544 }
545
546protected:
547 const int m_nquad0;
548 const int m_nquad1;
549 const int m_nmodes0;
550 const int m_nmodes1;
551 const bool m_colldir0;
552 const bool m_colldir1;
555
556private:
557 BwdTrans_SumFac_Quad(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
560 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper(),
561 m_nquad0(m_stdExp->GetNumPoints(0)),
562 m_nquad1(m_stdExp->GetNumPoints(1)),
563 m_nmodes0(m_stdExp->GetBasisNumModes(0)),
564 m_nmodes1(m_stdExp->GetBasisNumModes(1)),
565 m_colldir0(m_stdExp->GetBasis(0)->Collocation()),
566 m_colldir1(m_stdExp->GetBasis(1)->Collocation()),
567 m_base0(m_stdExp->GetBasis(0)->GetBdata()),
568 m_base1(m_stdExp->GetBasis(1)->GetBdata())
569 {
571 }
572};
573
574/// Factory initialisation for the BwdTrans_SumFac_Quad operator
575OperatorKey BwdTrans_SumFac_Quad::m_type =
578 BwdTrans_SumFac_Quad::create, "BwdTrans_SumFac_Quad");
579
580/**
581 * @brief Backward transform operator using sum-factorisation (Tri)
582 */
583class BwdTrans_SumFac_Tri final : virtual public Operator,
584 virtual public BwdTrans_Helper
585{
586public:
588
589 ~BwdTrans_SumFac_Tri() final = default;
590
591 void operator()(const Array<OneD, const NekDouble> &input,
592 Array<OneD, NekDouble> &output0,
593 [[maybe_unused]] Array<OneD, NekDouble> &output1,
594 [[maybe_unused]] Array<OneD, NekDouble> &output2,
595 Array<OneD, NekDouble> &wsp) override
596 {
597 ASSERTL1(wsp.size() == m_wspSize, "Incorrect workspace size");
598
599 int ncoeffs = m_stdExp->GetNcoeffs();
600 int i = 0;
601 int mode = 0;
602
603 for (i = mode = 0; i < m_nmodes0; ++i)
604 {
605 Blas::Dgemm('N', 'N', m_nquad1, m_numElmt, m_nmodes1 - i, 1.0,
606 m_base1.get() + mode * m_nquad1, m_nquad1,
607 &input[0] + mode, ncoeffs, 0.0,
608 &wsp[i * m_nquad1 * m_numElmt], m_nquad1);
609 mode += m_nmodes1 - i;
610 }
611
612 // fix for modified basis by splitting top vertex mode
613 if (m_sortTopVertex)
614 {
615 for (i = 0; i < m_numElmt; ++i)
616 {
617 Blas::Daxpy(m_nquad1, input[1 + i * ncoeffs],
618 m_base1.get() + m_nquad1, 1,
619 &wsp[m_nquad1 * m_numElmt] + i * m_nquad1, 1);
620 }
621 }
622
624 m_base0.get(), m_nquad0, &wsp[0], m_nquad1 * m_numElmt, 0.0,
625 &output0[0], m_nquad0);
626 }
627
628 void operator()([[maybe_unused]] int dir,
629 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
630 [[maybe_unused]] Array<OneD, NekDouble> &output,
631 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
632 {
633 ASSERTL0(false, "Not valid for this operator.");
634 }
635
636protected:
637 const int m_nquad0;
638 const int m_nquad1;
639 const int m_nmodes0;
640 const int m_nmodes1;
644
645private:
646 BwdTrans_SumFac_Tri(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
649 : Operator(pCollExp, pGeomData, factors),
650 m_nquad0(m_stdExp->GetNumPoints(0)),
651 m_nquad1(m_stdExp->GetNumPoints(1)),
652 m_nmodes0(m_stdExp->GetBasisNumModes(0)),
653 m_nmodes1(m_stdExp->GetBasisNumModes(1)),
654 m_base0(m_stdExp->GetBasis(0)->GetBdata()),
655 m_base1(m_stdExp->GetBasis(1)->GetBdata())
656 {
658 if (m_stdExp->GetBasis(0)->GetBasisType() == LibUtilities::eModified_A)
659 {
660 m_sortTopVertex = true;
661 }
662 else
663 {
664 m_sortTopVertex = false;
665 }
666 }
667};
668
669/// Factory initialisation for the BwdTrans_SumFac_Tri operator
670OperatorKey BwdTrans_SumFac_Tri::m_type =
673 BwdTrans_SumFac_Tri::create, "BwdTrans_SumFac_Tri");
674
675/// Backward transform operator using sum-factorisation (Hex)
676class BwdTrans_SumFac_Hex final : virtual public Operator,
677 virtual public BwdTrans_Helper
678{
679public:
681
682 ~BwdTrans_SumFac_Hex() final = default;
683
684 void operator()(const Array<OneD, const NekDouble> &input,
685 Array<OneD, NekDouble> &output0,
686 [[maybe_unused]] Array<OneD, NekDouble> &output1,
687 [[maybe_unused]] Array<OneD, NekDouble> &output2,
688 Array<OneD, NekDouble> &wsp) override
689 {
691 {
693 input.get(), 1, output0.get(), 1);
694 }
695 else
696 {
697 ASSERTL1(wsp.size() == m_wspSize, "Incorrect workspace size");
698
699 // Assign second half of workspace for 2nd DGEMM operation.
700 int totmodes = m_nmodes0 * m_nmodes1 * m_nmodes2;
701
704
705 // loop over elements and do bwd trans wrt c
706 for (int n = 0; n < m_numElmt; ++n)
707 {
709 m_nmodes2, 1.0, m_base2.get(), m_nquad2,
710 &input[n * totmodes], m_nmodes0 * m_nmodes1, 0.0,
711 &wsp[n * m_nquad2], m_nquad2 * m_numElmt);
712 }
713
714 // trans wrt b
716 m_nmodes1, 1.0, m_base1.get(), m_nquad1, wsp.get(),
717 m_nquad2 * m_numElmt * m_nmodes0, 0.0, wsp2.get(),
718 m_nquad1);
719
720 // trans wrt a
722 m_nmodes0, 1.0, m_base0.get(), m_nquad0, wsp2.get(),
723 m_nquad1 * m_nquad2 * m_numElmt, 0.0, output0.get(),
724 m_nquad0);
725 }
726 }
727
728 void operator()([[maybe_unused]] int dir,
729 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
730 [[maybe_unused]] Array<OneD, NekDouble> &output,
731 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
732 {
733 ASSERTL0(false, "Not valid for this operator.");
734 }
735
736protected:
737 const int m_nquad0;
738 const int m_nquad1;
739 const int m_nquad2;
740 const int m_nmodes0;
741 const int m_nmodes1;
742 const int m_nmodes2;
746 const bool m_colldir0;
747 const bool m_colldir1;
748 const bool m_colldir2;
749
750private:
751 BwdTrans_SumFac_Hex(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
754 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper(),
755 m_nquad0(pCollExp[0]->GetNumPoints(0)),
756 m_nquad1(pCollExp[0]->GetNumPoints(1)),
757 m_nquad2(pCollExp[0]->GetNumPoints(2)),
758 m_nmodes0(pCollExp[0]->GetBasisNumModes(0)),
759 m_nmodes1(pCollExp[0]->GetBasisNumModes(1)),
760 m_nmodes2(pCollExp[0]->GetBasisNumModes(2)),
761 m_base0(pCollExp[0]->GetBasis(0)->GetBdata()),
762 m_base1(pCollExp[0]->GetBasis(1)->GetBdata()),
763 m_base2(pCollExp[0]->GetBasis(2)->GetBdata()),
764 m_colldir0(pCollExp[0]->GetBasis(0)->Collocation()),
765 m_colldir1(pCollExp[0]->GetBasis(1)->Collocation()),
766 m_colldir2(pCollExp[0]->GetBasis(2)->Collocation())
767 {
770 }
771};
772
773/// Factory initialisation for the BwdTrans_SumFac_Hex operator
774OperatorKey BwdTrans_SumFac_Hex::m_type =
777 BwdTrans_SumFac_Hex::create, "BwdTrans_SumFac_Hex");
778
779/**
780 * @brief Backward transform operator using sum-factorisation (Tet)
781 */
782class BwdTrans_SumFac_Tet final : virtual public Operator,
783 virtual public BwdTrans_Helper
784{
785public:
787
788 ~BwdTrans_SumFac_Tet() final = default;
789
790 void operator()(const Array<OneD, const NekDouble> &input,
791 Array<OneD, NekDouble> &output0,
792 [[maybe_unused]] Array<OneD, NekDouble> &output1,
793 [[maybe_unused]] Array<OneD, NekDouble> &output2,
794 Array<OneD, NekDouble> &wsp) final
795 {
796 ASSERTL1(wsp.size() == m_wspSize, "Incorrect workspace size");
797
798 Array<OneD, NekDouble> tmp = wsp;
800 tmp + m_numElmt * m_nquad2 * m_nmodes0 *
801 (2 * m_nmodes1 - m_nmodes0 + 1) / 2;
802
803 int mode = 0;
804 int mode1 = 0;
805 int cnt = 0;
806 int ncoeffs = m_stdExp->GetNcoeffs();
807
808 // Perform summation over '2' direction
809 for (int i = 0; i < m_nmodes0; ++i)
810 {
811 for (int j = 0; j < m_nmodes1 - i; ++j, ++cnt)
812 {
813 Blas::Dgemm('N', 'N', m_nquad2, m_numElmt, m_nmodes2 - i - j,
814 1.0, m_base2.get() + mode * m_nquad2, m_nquad2,
815 input.get() + mode1, ncoeffs, 0.0,
816 tmp.get() + cnt * m_nquad2 * m_numElmt, m_nquad2);
817 mode += m_nmodes2 - i - j;
818 mode1 += m_nmodes2 - i - j;
819 }
820
821 // increment mode in case m_nmodes1!=m_nmodes2
822 mode += (m_nmodes2 - m_nmodes1) * (m_nmodes2 - m_nmodes1 + 1) / 2;
823 }
824
825 // vertex mode - currently (1+c)/2 x (1-b)/2 x (1-a)/2
826 // component is evaluated
827 if (m_sortTopEdge)
828 {
829 for (int i = 0; i < m_numElmt; ++i)
830 {
831 // top singular vertex
832 // (1+c)/2 x (1+b)/2 x (1-a)/2 component
833 Blas::Daxpy(m_nquad2, input[1 + i * ncoeffs],
834 m_base2.get() + m_nquad2, 1,
835 &tmp[m_nquad2 * m_numElmt] + i * m_nquad2, 1);
836
837 // top singular vertex
838 // (1+c)/2 x (1-b)/2 x (1+a)/2 component
840 m_nquad2, input[1 + i * ncoeffs], m_base2.get() + m_nquad2,
841 1, &tmp[m_nmodes1 * m_nquad2 * m_numElmt] + i * m_nquad2,
842 1);
843 }
844 }
845
846 // Perform summation over '1' direction
847 mode = 0;
848 for (int i = 0; i < m_nmodes0; ++i)
849 {
851 1.0, m_base1.get() + mode * m_nquad1, m_nquad1,
852 tmp.get() + mode * m_nquad2 * m_numElmt,
853 m_nquad2 * m_numElmt, 0.0,
854 tmp1.get() + i * m_nquad1 * m_nquad2 * m_numElmt,
855 m_nquad1);
856 mode += m_nmodes1 - i;
857 }
858
859 // fix for modified basis by adding additional split of
860 // top and base singular vertex modes as well as singular
861 // edge
862 if (m_sortTopEdge)
863 {
864 // this could probably be a dgemv or higher if we
865 // made a specialised m_base1[m_nuqad1] array
866 // containing multiply copies
867 for (int i = 0; i < m_numElmt; ++i)
868 {
869 // sort out singular vertices and singular
870 // edge components with (1+b)/2 (1+a)/2 form
871 for (int j = 0; j < m_nquad2; ++j)
872 {
874 tmp[m_nquad2 * m_numElmt + i * m_nquad2 + j],
875 m_base1.get() + m_nquad1, 1,
876 &tmp1[m_nquad1 * m_nquad2 * m_numElmt] +
877 i * m_nquad1 * m_nquad2 + j * m_nquad1,
878 1);
879 }
880 }
881 }
882
883 // Perform summation over '0' direction
885 m_nmodes0, 1.0, m_base0.get(), m_nquad0, tmp1.get(),
886 m_nquad1 * m_nquad2 * m_numElmt, 0.0, output0.get(),
887 m_nquad0);
888 }
889
890 void operator()([[maybe_unused]] int dir,
891 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
892 [[maybe_unused]] Array<OneD, NekDouble> &output,
893 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
894 {
895 ASSERTL0(false, "Not valid for this operator.");
896 }
897
898protected:
899 const int m_nquad0;
900 const int m_nquad1;
901 const int m_nquad2;
902 const int m_nmodes0;
903 const int m_nmodes1;
904 const int m_nmodes2;
909
910private:
911 BwdTrans_SumFac_Tet(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
914 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper(),
915 m_nquad0(m_stdExp->GetNumPoints(0)),
916 m_nquad1(m_stdExp->GetNumPoints(1)),
917 m_nquad2(m_stdExp->GetNumPoints(2)),
918 m_nmodes0(m_stdExp->GetBasisNumModes(0)),
919 m_nmodes1(m_stdExp->GetBasisNumModes(1)),
920 m_nmodes2(m_stdExp->GetBasisNumModes(2)),
921 m_base0(m_stdExp->GetBasis(0)->GetBdata()),
922 m_base1(m_stdExp->GetBasis(1)->GetBdata()),
923 m_base2(m_stdExp->GetBasis(2)->GetBdata())
924 {
926 (2 * m_nmodes1 - m_nmodes0 + 1) / 2 +
928
929 if (m_stdExp->GetBasis(0)->GetBasisType() == LibUtilities::eModified_A)
930 {
931 m_sortTopEdge = true;
932 }
933 else
934 {
935 m_sortTopEdge = false;
936 }
937 }
938};
939
940/// Factory initialisation for the BwdTrans_SumFac_Tet operator
941OperatorKey BwdTrans_SumFac_Tet::m_type =
944 BwdTrans_SumFac_Tet::create, "BwdTrans_SumFac_Tet");
945
946/**
947 * @brief Backward transform operator using sum-factorisation (Prism)
948 */
949class BwdTrans_SumFac_Prism final : virtual public Operator,
950 virtual public BwdTrans_Helper
951{
952public:
954
955 ~BwdTrans_SumFac_Prism() final = default;
956
957 void operator()(const Array<OneD, const NekDouble> &input,
958 Array<OneD, NekDouble> &output0,
959 [[maybe_unused]] Array<OneD, NekDouble> &output1,
960 [[maybe_unused]] Array<OneD, NekDouble> &output2,
961 Array<OneD, NekDouble> &wsp) final
962 {
963 ASSERTL1(wsp.size() == m_wspSize, "Incorrect workspace size");
964
965 // Assign second half of workspace for 2nd DGEMM operation.
966 int totmodes = m_stdExp->GetNcoeffs();
967
970
972 int i = 0;
973 int j = 0;
974 int mode = 0;
975 int mode1 = 0;
976 int cnt = 0;
977 for (i = mode = mode1 = 0; i < m_nmodes0; ++i)
978 {
979 cnt = i * m_nquad2 * m_numElmt;
980 for (j = 0; j < m_nmodes1; ++j)
981 {
982 Blas::Dgemm('N', 'N', m_nquad2, m_numElmt, m_nmodes2 - i, 1.0,
983 m_base2.get() + mode * m_nquad2, m_nquad2,
984 input.get() + mode1, totmodes, 0.0,
985 &wsp[j * m_nquad2 * m_numElmt * m_nmodes0 + cnt],
986 m_nquad2);
987 mode1 += m_nmodes2 - i;
988 }
989 mode += m_nmodes2 - i;
990 }
991
992 // fix for modified basis by splitting top vertex mode
993 if (m_sortTopVertex)
994 {
995 for (j = 0; j < m_nmodes1; ++j)
996 {
997 for (i = 0; i < m_numElmt; ++i)
998 {
1000 input[1 + i * totmodes + j * m_nmodes2],
1001 m_base2.get() + m_nquad2, 1,
1002 &wsp[j * m_nquad2 * m_numElmt * m_nmodes0 +
1003 m_nquad2 * m_numElmt] +
1004 i * m_nquad2,
1005 1);
1006 }
1007 }
1008 // Believe this could be made into a m_nmodes1
1009 // dgemv if we made an array of m_numElmt copies
1010 // of m_base2[m_quad2] (which are of size
1011 // m_nquad2.
1012 }
1013
1014 // Perform summation over '1' direction
1016 m_nmodes1, 1.0, m_base1.get(), m_nquad1, wsp.get(),
1017 m_nquad2 * m_numElmt * m_nmodes0, 0.0, wsp2.get(),
1018 m_nquad1);
1019
1020 // Perform summation over '0' direction
1022 m_nmodes0, 1.0, m_base0.get(), m_nquad0, wsp2.get(),
1023 m_nquad1 * m_nquad2 * m_numElmt, 0.0, output0.get(),
1024 m_nquad0);
1025 }
1026
1027 void operator()([[maybe_unused]] int dir,
1028 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
1029 [[maybe_unused]] Array<OneD, NekDouble> &output,
1030 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
1031 {
1032 ASSERTL0(false, "Not valid for this operator.");
1033 }
1034
1035protected:
1036 const int m_nquad0;
1037 const int m_nquad1;
1038 const int m_nquad2;
1039 const int m_nmodes0;
1040 const int m_nmodes1;
1041 const int m_nmodes2;
1046
1047private:
1048 BwdTrans_SumFac_Prism(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
1051 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper(),
1052 m_nquad0(m_stdExp->GetNumPoints(0)),
1053 m_nquad1(m_stdExp->GetNumPoints(1)),
1054 m_nquad2(m_stdExp->GetNumPoints(2)),
1055 m_nmodes0(m_stdExp->GetBasisNumModes(0)),
1056 m_nmodes1(m_stdExp->GetBasisNumModes(1)),
1057 m_nmodes2(m_stdExp->GetBasisNumModes(2)),
1058 m_base0(m_stdExp->GetBasis(0)->GetBdata()),
1059 m_base1(m_stdExp->GetBasis(1)->GetBdata()),
1060 m_base2(m_stdExp->GetBasis(2)->GetBdata())
1061 {
1064
1065 if (m_stdExp->GetBasis(0)->GetBasisType() == LibUtilities::eModified_A)
1066 {
1067 m_sortTopVertex = true;
1068 }
1069 else
1070 {
1071 m_sortTopVertex = false;
1072 }
1073 }
1074};
1075
1076/// Factory initialisation for the BwdTrans_SumFac_Prism operator
1077OperatorKey BwdTrans_SumFac_Prism::m_type =
1080 BwdTrans_SumFac_Prism::create, "BwdTrans_SumFac_Prism");
1081
1082/**
1083 * @brief Backward transform operator using sum-factorisation (Pyr)
1084 */
1085class BwdTrans_SumFac_Pyr final : virtual public Operator,
1086 virtual public BwdTrans_Helper
1087{
1088public:
1090
1091 ~BwdTrans_SumFac_Pyr() final = default;
1092
1093 void operator()(const Array<OneD, const NekDouble> &input,
1094 Array<OneD, NekDouble> &output0,
1095 [[maybe_unused]] Array<OneD, NekDouble> &output1,
1096 [[maybe_unused]] Array<OneD, NekDouble> &output2,
1097 Array<OneD, NekDouble> &wsp) final
1098 {
1099 ASSERTL1(wsp.size() == m_wspSize, "Incorrect workspace size");
1100
1101 // Assign second half of workspace for 2nd DGEMM operation.
1102 int totmodes = m_stdExp->GetNcoeffs();
1103
1106
1108 int i = 0;
1109 int j = 0;
1110 int mode = 0;
1111 int mode1 = 0;
1112 int cnt = 0;
1113 for (i = 0; i < m_nmodes0; ++i)
1114 {
1115 for (j = 0; j < m_nmodes1; ++j, ++cnt)
1116 {
1117 int ijmax = max(i, j);
1118 Blas::Dgemm('N', 'N', m_nquad2, m_numElmt, m_nmodes2 - ijmax,
1119 1.0, m_base2.get() + mode * m_nquad2, m_nquad2,
1120 input.get() + mode1, totmodes, 0.0,
1121 wsp.get() + cnt * m_nquad2 * m_numElmt, m_nquad2);
1122 mode += m_nmodes2 - ijmax;
1123 mode1 += m_nmodes2 - ijmax;
1124 }
1125
1126 // increment mode in case order1!=order2
1127 for (j = m_nmodes1; j < m_nmodes2 - i; ++j)
1128 {
1129 int ijmax = max(i, j);
1130 mode += m_nmodes2 - ijmax;
1131 }
1132 }
1133
1134 // vertex mode - currently (1+c)/2 x (1-b)/2 x (1-a)/2
1135 // component is evaluated
1136 if (m_sortTopVertex)
1137 {
1138 for (i = 0; i < m_numElmt; ++i)
1139 {
1140 // top singular vertex
1141 // (1+c)/2 x (1+b)/2 x (1-a)/2 component
1142 Blas::Daxpy(m_nquad2, input[1 + i * totmodes],
1143 m_base2.get() + m_nquad2, 1,
1144 &wsp[m_nquad2 * m_numElmt] + i * m_nquad2, 1);
1145
1146 // top singular vertex
1147 // (1+c)/2 x (1-b)/2 x (1+a)/2 component
1149 m_nquad2, input[1 + i * totmodes], m_base2.get() + m_nquad2,
1150 1, &wsp[m_nmodes1 * m_nquad2 * m_numElmt] + i * m_nquad2,
1151 1);
1152
1153 // top singular vertex
1154 // (1+c)/2 x (1+b)/2 x (1+a)/2 component
1155 Blas::Daxpy(m_nquad2, input[1 + i * totmodes],
1156 m_base2.get() + m_nquad2, 1,
1157 &wsp[(m_nmodes1 + 1) * m_nquad2 * m_numElmt] +
1158 i * m_nquad2,
1159 1);
1160 }
1161 }
1162
1163 // Perform summation over '1' direction
1164 mode = 0;
1165 for (i = 0; i < m_nmodes0; ++i)
1166 {
1168 1.0, m_base1.get(), m_nquad1,
1169 wsp.get() + mode * m_nquad2 * m_numElmt,
1170 m_nquad2 * m_numElmt, 0.0,
1171 wsp2.get() + i * m_nquad1 * m_nquad2 * m_numElmt,
1172 m_nquad1);
1173 mode += m_nmodes1;
1174 }
1175
1176 // Perform summation over '0' direction
1178 m_nmodes0, 1.0, m_base0.get(), m_nquad0, wsp2.get(),
1179 m_nquad1 * m_nquad2 * m_numElmt, 0.0, output0.get(),
1180 m_nquad0);
1181 }
1182
1183 void operator()([[maybe_unused]] int dir,
1184 [[maybe_unused]] const Array<OneD, const NekDouble> &input,
1185 [[maybe_unused]] Array<OneD, NekDouble> &output,
1186 [[maybe_unused]] Array<OneD, NekDouble> &wsp) final
1187 {
1188 ASSERTL0(false, "Not valid for this operator.");
1189 }
1190
1191protected:
1192 const int m_nquad0;
1193 const int m_nquad1;
1194 const int m_nquad2;
1195 const int m_nmodes0;
1196 const int m_nmodes1;
1197 const int m_nmodes2;
1202
1203private:
1204 BwdTrans_SumFac_Pyr(vector<StdRegions::StdExpansionSharedPtr> pCollExp,
1207 : Operator(pCollExp, pGeomData, factors), BwdTrans_Helper(),
1208 m_nquad0(m_stdExp->GetNumPoints(0)),
1209 m_nquad1(m_stdExp->GetNumPoints(1)),
1210 m_nquad2(m_stdExp->GetNumPoints(2)),
1211 m_nmodes0(m_stdExp->GetBasisNumModes(0)),
1212 m_nmodes1(m_stdExp->GetBasisNumModes(1)),
1213 m_nmodes2(m_stdExp->GetBasisNumModes(2)),
1214 m_base0(m_stdExp->GetBasis(0)->GetBdata()),
1215 m_base1(m_stdExp->GetBasis(1)->GetBdata()),
1216 m_base2(m_stdExp->GetBasis(2)->GetBdata())
1217 {
1219
1220 if (m_stdExp->GetBasis(0)->GetBasisType() == LibUtilities::eModified_A)
1221 {
1222 m_sortTopVertex = true;
1223 }
1224 else
1225 {
1226 m_sortTopVertex = false;
1227 }
1228 }
1229};
1230
1231/// Factory initialisation for the BwdTrans_SumFac_Pyr operator
1232OperatorKey BwdTrans_SumFac_Pyr::m_type =
1235 BwdTrans_SumFac_Pyr::create, "BwdTrans_SumFac_Pyr");
1236
1237} // namespace Nektar::Collections
#define ASSERTL0(condition, msg)
Definition: ErrorUtil.hpp:208
#define NEKERROR(type, msg)
Assert Level 0 – Fundamental assert which is used whether in FULLDEBUG, DEBUG or OPT compilation mode...
Definition: ErrorUtil.hpp:202
#define ASSERTL1(condition, msg)
Assert Level 1 – Debugging which is used whether in FULLDEBUG or DEBUG compilation mode....
Definition: ErrorUtil.hpp:242
#define OPERATOR_CREATE(cname)
Definition: Operator.h:43
Backward transform help class to calculate the size of the collection that is given as an input and a...
Definition: BwdTrans.cpp:61
Backward transform operator using default StdRegions operator.
Definition: BwdTrans.cpp:258
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:280
BwdTrans_IterPerExp(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:289
Backward transform operator using matrix free operators.
Definition: BwdTrans.cpp:160
std::shared_ptr< MatrixFree::BwdTrans > m_oper
Definition: BwdTrans.cpp:197
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:187
BwdTrans_MatrixFree(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:199
Backward transform operator using LocalRegions implementation.
Definition: BwdTrans.cpp:336
BwdTrans_NoCollection(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:371
vector< StdRegions::StdExpansionSharedPtr > m_expList
Definition: BwdTrans.cpp:368
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:359
Backward transform operator using standard matrix approach.
Definition: BwdTrans.cpp:77
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:95
BwdTrans_StdMat(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:107
Backward transform operator using sum-factorisation (Hex)
Definition: BwdTrans.cpp:678
Array< OneD, const NekDouble > m_base1
Definition: BwdTrans.cpp:744
Array< OneD, const NekDouble > m_base2
Definition: BwdTrans.cpp:745
Array< OneD, const NekDouble > m_base0
Definition: BwdTrans.cpp:743
BwdTrans_SumFac_Hex(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:751
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:728
Backward transform operator using sum-factorisation (Prism)
Definition: BwdTrans.cpp:951
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:1027
BwdTrans_SumFac_Prism(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:1048
Array< OneD, const NekDouble > m_base0
Definition: BwdTrans.cpp:1042
Array< OneD, const NekDouble > m_base1
Definition: BwdTrans.cpp:1043
Array< OneD, const NekDouble > m_base2
Definition: BwdTrans.cpp:1044
Backward transform operator using sum-factorisation (Pyr)
Definition: BwdTrans.cpp:1087
Array< OneD, const NekDouble > m_base2
Definition: BwdTrans.cpp:1200
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:1183
BwdTrans_SumFac_Pyr(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:1204
Array< OneD, const NekDouble > m_base1
Definition: BwdTrans.cpp:1199
Array< OneD, const NekDouble > m_base0
Definition: BwdTrans.cpp:1198
Backward transform operator using sum-factorisation (Quad)
Definition: BwdTrans.cpp:484
Array< OneD, const NekDouble > m_base1
Definition: BwdTrans.cpp:554
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:538
Array< OneD, const NekDouble > m_base0
Definition: BwdTrans.cpp:553
BwdTrans_SumFac_Quad(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:557
Backward transform operator using sum-factorisation (Segment)
Definition: BwdTrans.cpp:419
BwdTrans_SumFac_Seg(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:460
Array< OneD, const NekDouble > m_base0
Definition: BwdTrans.cpp:457
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:445
Backward transform operator using sum-factorisation (Tet)
Definition: BwdTrans.cpp:784
BwdTrans_SumFac_Tet(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:911
Array< OneD, const NekDouble > m_base1
Definition: BwdTrans.cpp:906
Array< OneD, const NekDouble > m_base0
Definition: BwdTrans.cpp:905
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:890
Array< OneD, const NekDouble > m_base2
Definition: BwdTrans.cpp:907
Backward transform operator using sum-factorisation (Tri)
Definition: BwdTrans.cpp:585
BwdTrans_SumFac_Tri(vector< StdRegions::StdExpansionSharedPtr > pCollExp, CoalescedGeomDataSharedPtr pGeomData, StdRegions::FactorMap factors)
Definition: BwdTrans.cpp:646
Array< OneD, const NekDouble > m_base0
Definition: BwdTrans.cpp:641
Array< OneD, const NekDouble > m_base1
Definition: BwdTrans.cpp:642
void operator()(int dir, const Array< OneD, const NekDouble > &input, Array< OneD, NekDouble > &output, Array< OneD, NekDouble > &wsp) final
Definition: BwdTrans.cpp:628
unsigned int m_nElmtPad
size after padding
Array< OneD, NekDouble > m_input
padded input/output vectors
Base class for operators on a collection of elements.
Definition: Operator.h:138
StdRegions::StdExpansionSharedPtr m_stdExp
Definition: Operator.h:217
unsigned int m_numElmt
number of elements that the operator is applied on
Definition: Operator.h:219
unsigned int m_outputSize
number of modes or quadrature points that are taken as output from an operator
Definition: Operator.h:227
unsigned int m_inputSize
number of modes or quadrature points that are passed as input to an operator
Definition: Operator.h:224
tKey RegisterCreatorFunction(tKey idKey, CreatorFunction classCreator, std::string pDesc="")
Register a class with the factory.
tBaseSharedPtr CreateInstance(tKey idKey, tParam... args)
Create an instance of the class referred to by idKey.
static void Dgemm(const char &transa, const char &transb, const int &m, const int &n, const int &k, const double &alpha, const double *a, const int &lda, const double *b, const int &ldb, const double &beta, double *c, const int &ldc)
BLAS level 3: Matrix-matrix multiply C = A x B where op(A)[m x k], op(B)[k x n], C[m x n] DGEMM perfo...
Definition: Blas.hpp:383
static void Daxpy(const int &n, const double &alpha, const double *x, const int &incx, const double *y, const int &incy)
BLAS level 1: y = alpha x plus y.
Definition: Blas.hpp:135
std::tuple< LibUtilities::ShapeType, OperatorType, ImplementationType, ExpansionIsNodal > OperatorKey
Key for describing an Operator.
Definition: Operator.h:120
std::shared_ptr< CoalescedGeomData > CoalescedGeomDataSharedPtr
OperatorFactory & GetOperatorFactory()
Returns the singleton Operator factory object.
Definition: Operator.cpp:44
@ eModified_A
Principle Modified Functions .
Definition: BasisType.h:48
ConstFactorMap FactorMap
Definition: StdRegions.hpp:434
StdRegions::ConstFactorMap factors
std::shared_ptr< DNekMat > DNekMatSharedPtr
Definition: NekTypeDefs.hpp:75
double NekDouble
void Zero(int n, T *x, const int incx)
Zero vector.
Definition: Vmath.hpp:273
void Vcopy(int n, const T *x, const int incx, T *y, const int incy)
Definition: Vmath.hpp:825
STL namespace.