41 namespace LibUtilities
47 : m_schemeAlgorithm( schemeAlgorithm ),
48 m_solVector( m_schemeAlgorithm->m_numsteps ),
49 m_t( m_schemeAlgorithm->m_numsteps )
57 int npoints = y[0].size();
63 for (
int i = 1; i < nsteps; i++)
66 for (
int j = 0; j < nvar; j++)
70 if (i < nMultiStepVals)
72 m_t[i] = time - i * timestep * timeLevels[i];
84 : m_schemeAlgorithm(schemeAlgorithm), m_solVector(y), m_t(t)
87 "Amount of Entries does not match number of (multi-) steps");
92 const unsigned int npoints)
93 : m_schemeAlgorithm(schemeAlgorithm),
94 m_solVector(schemeAlgorithm->m_numsteps),
95 m_t(schemeAlgorithm->m_numsteps)
100 for (
int j = 0; j < nvar; j++)
109 : m_schemeAlgorithm(schemeAlgorithm), m_solVector(m_schemeAlgorithm->m_numsteps),
110 m_t(m_schemeAlgorithm->m_numsteps)
#define ASSERTL1(condition, msg)
Assert Level 1 – Debugging which is used whether in FULLDEBUG or DEBUG compilation mode....
unsigned int GetNmultiStepValues() const
const Array< OneD, const unsigned int > & GetTimeLevelOffset() const
LUE TimeIntegrationSolutionGLM(const TimeIntegrationAlgorithmGLM *schemeAlgorithm, const DoubleArray &y, const NekDouble time, const NekDouble timestep)
Array< OneD, NekDouble > m_t
const TimeIntegrationAlgorithmGLM * m_schemeAlgorithm
The above copyright notice and this permission notice shall be included.