From 445acbcbc25f6e496926cbeb43dc986dc6134aca Mon Sep 17 00:00:00 2001
From: Elias Pipping <elias.pipping@fu-berlin.de>
Date: Tue, 11 Sep 2012 10:25:17 +0200
Subject: [PATCH] u_old_old -> u_old_old_ptr
---
src/timestepping.cc | 26 +++++++++++++-------------
1 file changed, 13 insertions(+), 13 deletions(-)
diff --git a/src/timestepping.cc b/src/timestepping.cc
index d8364346..daf4491d 100644
--- a/src/timestepping.cc
+++ b/src/timestepping.cc
@@ -2,14 +2,14 @@ template <class VectorType, class MatrixType, class FunctionType, int dim>
class TimeSteppingScheme {
public:
TimeSteppingScheme(VectorType const &_ell, MatrixType const &_A,
- VectorType const &_u_old, VectorType const *_u_old_old,
+ VectorType const &_u_old, VectorType const *_u_old_old_ptr,
Dune::BitSetVector<dim> const &_dirichletNodes,
FunctionType const &_dirichletFunction, double _time,
double _tau)
: ell(_ell),
A(_A),
u_old(_u_old),
- u_old_old(_u_old_old),
+ u_old_old_ptr(_u_old_old_ptr),
dirichletNodes(_dirichletNodes),
dirichletFunction(_dirichletFunction),
time(_time),
@@ -30,7 +30,7 @@ class TimeSteppingScheme {
VectorType const ℓ
MatrixType const &A;
VectorType const &u_old;
- VectorType const *u_old_old;
+ VectorType const *u_old_old_ptr;
Dune::BitSetVector<dim> const &dirichletNodes;
FunctionType const &dirichletFunction;
double const time;
@@ -61,8 +61,8 @@ class ImplicitEuler
// Treat as Delta u_n for now
problem_iterate = this->u_old;
- if (this->u_old_old)
- problem_iterate -= *this->u_old_old;
+ if (this->u_old_old_ptr)
+ problem_iterate -= *this->u_old_old_ptr;
for (size_t i = 0; i < this->dirichletNodes.size(); ++i)
if (this->dirichletNodes[i].count() == dim) {
@@ -105,14 +105,14 @@ class ImplicitTwoStep
MatrixType &problem_A) const {
problem_rhs = this->ell;
this->A.usmv(-4.0 / 3.0, this->u_old, problem_rhs);
- this->A.usmv(+1.0 / 3.0, *this->u_old_old, problem_rhs);
+ this->A.usmv(+1.0 / 3.0, *this->u_old_old_ptr, problem_rhs);
problem_A = this->A;
problem_A *= 2.0 / 3.0 * this->tau;
// The finite difference makes a good start (treat it as such for now)
problem_iterate = this->u_old;
- problem_iterate -= *this->u_old_old;
+ problem_iterate -= *this->u_old_old_ptr;
for (size_t i = 0; i < this->dirichletNodes.size(); ++i)
if (this->dirichletNodes[i].count() == dim) {
@@ -120,13 +120,13 @@ class ImplicitTwoStep
this->dirichletFunction.evaluate(this->time, val);
problem_iterate[i] = 0;
problem_iterate[i].axpy(-2, this->u_old[i]);
- problem_iterate[i].axpy(.5, (*this->u_old_old)[i]);
- problem_iterate[i][0] =
- 1.5 * val - 2 * this->u_old[i][0] + .5 * (*this->u_old_old)[i][0];
+ problem_iterate[i].axpy(.5, (*this->u_old_old_ptr)[i]);
+ problem_iterate[i][0] = 1.5 * val - 2 * this->u_old[i][0] +
+ .5 * (*this->u_old_old_ptr)[i][0];
} else if (this->dirichletNodes[i][1])
// Y direction described
problem_iterate[i][1] =
- -2 * this->u_old[i][1] + .5 * (*this->u_old_old)[i][1];
+ -2 * this->u_old[i][1] + .5 * (*this->u_old_old_ptr)[i][1];
// Now treat it as a velocity
problem_iterate /= this->tau;
}
@@ -136,7 +136,7 @@ class ImplicitTwoStep
solution = problem_iterate;
solution *= this->tau;
solution.axpy(2, this->u_old);
- solution.axpy(-.5, *this->u_old_old);
+ solution.axpy(-.5, *this->u_old_old_ptr);
solution *= 2.0 / 3.0;
// Check if we split correctly
@@ -145,7 +145,7 @@ class ImplicitTwoStep
test *= this->tau;
test.axpy(-1.5, solution);
test.axpy(+2, this->u_old);
- test.axpy(-.5, *this->u_old_old);
+ test.axpy(-.5, *this->u_old_old_ptr);
assert(test.two_norm() < 1e-10);
}
}
--
GitLab