Nektar++
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
CompressibleSolver.cpp
Go to the documentation of this file.
1 ///////////////////////////////////////////////////////////////////////////////
2 //
3 // File: CompressibleSolver.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 // License for the specific language governing rights and limitations under
14 // Permission is hereby granted, free of charge, to any person obtaining a
15 // copy of this software and associated documentation files (the "Software"),
16 // to deal in the Software without restriction, including without limitation
17 // the rights to use, copy, modify, merge, publish, distribute, sublicense,
18 // and/or sell copies of the Software, and to permit persons to whom the
19 // Software is furnished to do so, subject to the following conditions:
20 //
21 // The above copyright notice and this permission notice shall be included
22 // in all copies or substantial portions of the Software.
23 //
24 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
25 // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
26 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
27 // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
28 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
29 // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
30 // DEALINGS IN THE SOFTWARE.
31 //
32 // Description: Compressible Riemann solver.
33 //
34 ///////////////////////////////////////////////////////////////////////////////
35 
37 
38 namespace Nektar
39 {
41  m_pointSolve(true)
42  {
43  m_requiresRotation = true;
44  }
45 
47  const int nDim,
48  const Array<OneD, const Array<OneD, NekDouble> > &Fwd,
49  const Array<OneD, const Array<OneD, NekDouble> > &Bwd,
51  {
52  if (m_pointSolve)
53  {
54  int expDim = nDim;
55  int nvariables = Fwd.num_elements();
56 
57  NekDouble rhouf, rhovf;
58 
59  // Check if PDE-based SC is used
60  if (expDim == 1)
61  {
62  for (int i = 0; i < Fwd[0].num_elements(); ++i)
63  {
65  Fwd [0][i], Fwd [1][i], 0.0, 0.0, Fwd [2][i],
66  Bwd [0][i], Bwd [1][i], 0.0, 0.0, Bwd [2][i],
67  flux[0][i], flux[1][i], rhouf, rhovf, flux[2][i]);
68  }
69  }
70  else if (expDim == 2)
71  {
72  if (nvariables == expDim+2)
73  {
74  for (int i = 0; i < Fwd[0].num_elements(); ++i)
75  {
77  Fwd [0][i], Fwd [1][i], Fwd [2][i], 0.0, Fwd [3][i],
78  Bwd [0][i], Bwd [1][i], Bwd [2][i], 0.0, Bwd [3][i],
79  flux[0][i], flux[1][i], flux[2][i], rhovf, flux[3][i]);
80  }
81  }
82 
83  if (nvariables > expDim+2)
84  {
85  for (int i = 0; i < Fwd[0].num_elements(); ++i)
86  {
88  Fwd [0][i], Fwd [1][i], Fwd [2][i], 0.0, Fwd [3][i], Fwd [4][i],
89  Bwd [0][i], Bwd [1][i], Bwd [2][i], 0.0, Bwd [3][i], Bwd [4][i],
90  flux[0][i], flux[1][i], flux[2][i], rhovf, flux[3][i], flux[4][i]);
91  }
92  }
93 
94  }
95  else if (expDim == 3)
96  {
97  for (int i = 0; i < Fwd[0].num_elements(); ++i)
98  {
100  Fwd [0][i], Fwd [1][i], Fwd [2][i], Fwd [3][i], Fwd [4][i],
101  Bwd [0][i], Bwd [1][i], Bwd [2][i], Bwd [3][i], Bwd [4][i],
102  flux[0][i], flux[1][i], flux[2][i], flux[3][i], flux[4][i]);
103  }
104  if (nvariables > expDim+2)
105  {
106  for (int i = 0; i < Fwd[0].num_elements(); ++i)
107  {
109  Fwd [0][i], Fwd [1][i], Fwd [2][i], Fwd [3][i], Fwd [4][i], Fwd [5][i],
110  Bwd [0][i], Bwd [1][i], Bwd [2][i], Bwd [3][i], Bwd [4][i], Bwd [5][i],
111  flux[0][i], flux[1][i], flux[2][i], flux[3][i], flux[4][i], flux[5][i]);
112  }
113  }
114  }
115  }
116  else
117  {
118  v_ArraySolve(Fwd, Bwd, flux);
119  }
120  }
121 }
virtual void v_PointSolve(NekDouble rhoL, NekDouble rhouL, NekDouble rhovL, NekDouble rhowL, NekDouble EL, NekDouble rhoR, NekDouble rhouR, NekDouble rhovR, NekDouble rhowR, NekDouble ER, NekDouble &rhof, NekDouble &rhouf, NekDouble &rhovf, NekDouble &rhowf, NekDouble &Ef)
virtual void v_PointSolveVisc(NekDouble rhoL, NekDouble rhouL, NekDouble rhovL, NekDouble rhowL, NekDouble EL, NekDouble EpsL, NekDouble rhoR, NekDouble rhouR, NekDouble rhovR, NekDouble rhowR, NekDouble ER, NekDouble EpsR, NekDouble &rhof, NekDouble &rhouf, NekDouble &rhovf, NekDouble &rhowf, NekDouble &Ef, NekDouble &Epsf)
double NekDouble
virtual void v_ArraySolve(const Array< OneD, const Array< OneD, NekDouble > > &Fwd, const Array< OneD, const Array< OneD, NekDouble > > &Bwd, Array< OneD, Array< OneD, NekDouble > > &flux)
virtual void v_Solve(const int nDim, const Array< OneD, const Array< OneD, NekDouble > > &Fwd, const Array< OneD, const Array< OneD, NekDouble > > &Bwd, Array< OneD, Array< OneD, NekDouble > > &flux)
bool m_requiresRotation
Indicates whether the Riemann solver requires a rotation to be applied to the velocity fields...
The RiemannSolver class provides an abstract interface under which solvers for various Riemann proble...
Definition: RiemannSolver.h:62