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

Test a nicer problem

parent 63f732d5
No related branches found
No related tags found
No related merge requests found
...@@ -47,10 +47,10 @@ int main() { ...@@ -47,10 +47,10 @@ int main() {
typedef Dune::BlockVector<SmallVector> VectorType; typedef Dune::BlockVector<SmallVector> VectorType;
// FIXME: Random values // FIXME: Random values
double const E = 1e8; double const E = 1e3;
double const nu = 0.3; double const nu = 0.3;
int const refinements = 1; int const refinements = 5;
size_t const solver_maxIterations = 10; size_t const solver_maxIterations = 100;
double const solver_tolerance = 1e-4; double const solver_tolerance = 1e-4;
typedef Dune::YaspGrid<dim> GridType; typedef Dune::YaspGrid<dim> GridType;
...@@ -81,13 +81,10 @@ int main() { ...@@ -81,13 +81,10 @@ int main() {
// Fill right-hand side with semi-random numbers // Fill right-hand side with semi-random numbers
for (size_t i = 0; i < f.size(); ++i) for (size_t i = 0; i < f.size(); ++i)
for (size_t j = 0; j < dim; ++j) for (size_t j = 0; j < dim; ++j)
f[i][j] = i + j; f[i][j] = 300;
VectorType u1(grid.size(grid.maxLevel(), dim)); VectorType u1(grid.size(grid.maxLevel(), dim));
// Fill initial guess with other semi-random numbers u1 = 0;
for (size_t i = 0; i < f.size(); ++i)
for (size_t j = 0; j < dim; ++j)
u1[i][j] = 17 * (j + 1);
VectorType u2 = u1; VectorType u2 = u1;
Dune::BitSetVector<VectorType::block_type::dimension> ignoreNodes( Dune::BitSetVector<VectorType::block_type::dimension> ignoreNodes(
...@@ -126,7 +123,7 @@ int main() { ...@@ -126,7 +123,7 @@ int main() {
++bounding_nodes; ++bounding_nodes;
size_t id = myVertexMapper.map(*it); size_t id = myVertexMapper.map(*it);
// std::cout << "Ignoring id #" << id << std::endl; // std::cout << "Ignoring id #" << id << std::endl;
ignoreNodes[id] = true; // ignoreNodes[id] = true;
} }
if (extremal) { if (extremal) {
++extremal_nodes; ++extremal_nodes;
......
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