Skip to content
Snippets Groups Projects
Commit b9a80fd2 authored by Elias Pipping's avatar Elias Pipping Committed by Elias Pipping
Browse files

Define time as h * run

parent b9a1a417
No related branches found
No related tags found
No related merge requests found
...@@ -235,6 +235,7 @@ int main(int argc, char *argv[]) { ...@@ -235,6 +235,7 @@ int main(int argc, char *argv[]) {
auto const &neumannFunction = functions.get("neumannCondition"); auto const &neumannFunction = functions.get("neumannCondition");
for (size_t run = 1; run <= timesteps; ++run) { for (size_t run = 1; run <= timesteps; ++run) {
double const time = h * run;
if (parset.get<bool>("printProgress")) { if (parset.get<bool>("printProgress")) {
std::cout << '*'; std::cout << '*';
std::cout.flush(); std::cout.flush();
...@@ -242,12 +243,12 @@ int main(int argc, char *argv[]) { ...@@ -242,12 +243,12 @@ int main(int argc, char *argv[]) {
{ {
assemble_neumann<GridType, GridView, SmallVector, P1Basis>( assemble_neumann<GridType, GridView, SmallVector, P1Basis>(
leafView, p1Basis, neumannNodes, b4, neumannFunction, h * run); leafView, p1Basis, neumannNodes, b4, neumannFunction, time);
stiffnessMatrix.mmv(u4, b4); stiffnessMatrix.mmv(u4, b4);
// Apply Dirichlet condition // Apply Dirichlet condition
for (int i = 0; i < finestSize; ++i) for (int i = 0; i < finestSize; ++i)
if (ignoreNodes[i].count() == dim) { if (ignoreNodes[i].count() == dim) {
dirichletFunction.evaluate(h * run, u4_diff[i][0]); dirichletFunction.evaluate(time, u4_diff[i][0]);
u4_diff[i][0] /= refinement_factor; u4_diff[i][0] /= refinement_factor;
} }
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment