Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

MatrixFree inverse mass matrix: Make tests more robust #15486

Merged
merged 1 commit into from
Jun 26, 2023
Merged

MatrixFree inverse mass matrix: Make tests more robust #15486

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
8 changes: 1 addition & 7 deletions tests/matrix_free/inverse_mass_10.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -150,7 +150,7 @@ class MatrixFreeTest
make_vectorized_array(random_value<Number>(1.0e-2, 1.0e-1));
// make diagonal dominant because inverse is needed
if (d1 == d2)
dyadic_coefficients[q][d1][d2] *= 1.0e2;
dyadic_coefficients[q][d1][d2] += 5.0;
}
}
inverse_dyadic_coefficients[q] = invert(dyadic_coefficients[q]);
Expand Down Expand Up @@ -220,12 +220,6 @@ test()
tria.begin(tria.n_levels() - 1)->set_refine_flag();
tria.last()->set_refine_flag();
tria.execute_coarsening_and_refinement();
typename Triangulation<dim>::active_cell_iterator cell = tria.begin_active(),
endc = tria.end();
for (; cell != endc; ++cell)
if (cell->center().norm() < 1e-8)
cell->set_refine_flag();
tria.execute_coarsening_and_refinement();

const unsigned int degree = fe_degree;
FESystem<dim> fe(FE_DGQ<dim>(degree), dim);
Expand Down
8 changes: 1 addition & 7 deletions tests/matrix_free/inverse_mass_11.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -151,7 +151,7 @@ class MatrixFreeTest
make_vectorized_array(random_value<Number>(1.0e-2, 1.0e-1));
// make diagonal dominant because inverse is needed
if (d1 == d2)
dyadic_coefficients[q][d1][d2] *= 1.0e2;
dyadic_coefficients[q][d1][d2] += 5.0;
}
}
inverse_dyadic_coefficients[q] = invert(dyadic_coefficients[q]);
Expand Down Expand Up @@ -221,12 +221,6 @@ test()
tria.begin(tria.n_levels() - 1)->set_refine_flag();
tria.last()->set_refine_flag();
tria.execute_coarsening_and_refinement();
typename Triangulation<dim>::active_cell_iterator cell = tria.begin_active(),
endc = tria.end();
for (; cell != endc; ++cell)
if (cell->center().norm() < 1e-8)
cell->set_refine_flag();
tria.execute_coarsening_and_refinement();

const unsigned int degree = fe_degree;
FESystem<dim> fe(FE_DGQ<dim>(degree), dim);
Expand Down