]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Make tests more immune to roundoff by outputting every single element of gradients...
authorWolfgang Bangerth <bangerth@math.tamu.edu>
Wed, 30 Apr 2008 16:45:54 +0000 (16:45 +0000)
committerWolfgang Bangerth <bangerth@math.tamu.edu>
Wed, 30 Apr 2008 16:45:54 +0000 (16:45 +0000)
git-svn-id: https://svn.dealii.org/trunk@16016 0785d39b-7218-0410-832d-ea1e28bc413d

tests/deal.II/fe_values_view_01.cc
tests/deal.II/fe_values_view_02.cc
tests/deal.II/fe_values_view_03.cc
tests/deal.II/fe_values_view_04.cc

index e5c5a7dcdd89d8e5cf392f074066519767c5d54b..e33d74f9b19252195969e8617556792cb0595c42 100644 (file)
@@ -57,8 +57,10 @@ void test (const Triangulation<dim>& tr,
          {
            deallog << "i=" << i << ", q=" << q << std::endl;
            deallog << "   "
-                   << fe_values[single_component].value (i,q) << ' '
-                   << fe_values[single_component].gradient (i,q) << std::endl;
+                   << fe_values[single_component].value (i,q) << ' ';
+           for (unsigned int k=0; k<dim; ++k)
+             deallog << fe_values[single_component].gradient (i,q) << ' ';
+           deallog << std::endl;
            for (unsigned int k=0; k<dim; ++k)
              for (unsigned int l=0; l<dim; ++l)
                deallog << fe_values[single_component].hessian (i,q)[k][l] << std::endl;
index 3c7c18ca96d6315d715ef7a300c05a2508b8f167..cf39304971159608ce63feb6a38107f69f76d6e5 100644 (file)
@@ -62,14 +62,19 @@ void test (const Triangulation<dim>& tr,
            {
              deallog << "i=" << i << ", q=" << q << std::endl;
              deallog << "   "
-                     << fe_values[vec_components].value (i,q) << ' '
-                     << fe_values[vec_components].gradient (i,q) << ' '
-                     << fe_values[vec_components].divergence (i,q) << ' '
-                     << fe_values[vec_components].symmetric_gradient (i,q) << std::endl;
+                     << fe_values[vec_components].value (i,q) << ' ';
+             for (unsigned int k=0; k<dim; ++k)
+               deallog << fe_values[vec_components].gradient (i,q)[k] << ' ';
+             deallog << fe_values[vec_components].divergence (i,q) << ' ';
+             for (unsigned int k=0; k<dim; ++k)
+               for (unsigned int l=0; l<dim; ++l)
+                 deallog << fe_values[vec_components].symmetric_gradient (i,q)[k][l] << ' ';
+             deallog << std::endl;
              for (unsigned int k=0; k<dim; ++k)
                for (unsigned int l=0; l<dim; ++l)
-                 deallog << fe_values[vec_components].hessian (i,q)[k][l]
-                         << std::endl;
+                 for (unsigned int m=0; m<dim; ++m)
+                   deallog << fe_values[vec_components].hessian (i,q)[k][l][m]
+                           << std::endl;
                  
              for (unsigned int d=0; d<dim; ++d)
                {
index bb49131bc6d5c1ac9af4b79aa68a170e7ec39c85..767aa202919d7481d2ca148e89ed41b210868631 100644 (file)
@@ -62,8 +62,10 @@ void test (const Triangulation<dim>& tr,
              {
                deallog << "i=" << i << ", q=" << q << std::endl;
                deallog << "   "
-                       << fe_values[single_component].value (i,q) << ' '
-                       << fe_values[single_component].gradient (i,q) << std::endl;
+                       << fe_values[single_component].value (i,q) << ' ';
+               for (unsigned int k=0; k<dim; ++k)
+                 deallog << fe_values[single_component].gradient (i,q)[k] << ' ';
+               deallog << std::endl;
                for (unsigned int k=0; k<dim; ++k)
                  for (unsigned int l=0; l<dim; ++l)
                    deallog << fe_values[single_component].hessian (i,q)[k][l] << std::endl;
index 1b4dba201876f2a7baa19493d4edb0b9eb825ac9..bcc3d12a3e6d90a24c489734853762b942f157ed 100644 (file)
@@ -66,14 +66,20 @@ void test (const Triangulation<dim>& tr,
              for (unsigned int q=0; q<fe_values.n_quadrature_points; ++q)
                {
                  deallog << "i=" << i << ", q=" << q << std::endl;
-                 deallog << "   "
-                         << fe_values[vec_components].value (i,q) << ' '
-                         << fe_values[vec_components].gradient (i,q) << std::endl;
+                 deallog << "   ";
+                 for (unsigned int k=0; k<dim; ++k)
+                   deallog << fe_values[vec_components].value (i,q)[k] << ' ';
+                 for (unsigned int k=0; k<dim; ++k)
+                   for (unsigned int l=0; l<dim; ++l)
+                     deallog << fe_values[vec_components].gradient (i,q)[k][l] << ' ';
+                 deallog << std::endl;
                  for (unsigned int k=0; k<dim; ++k)
                    for (unsigned int l=0; l<dim; ++l)
-                     deallog << fe_values[vec_components].symmetric_gradient (i,q)[k][l]
-                             << fe_values[vec_components].hessian (i,q)[k][l]
-                             << std::endl;
+                     for (unsigned int m=0; m<dim; ++m)
+                       deallog << fe_values[vec_components].symmetric_gradient (i,q)[k][l]
+                               << ' '
+                               << fe_values[vec_components].hessian (i,q)[k][l][m]
+                               << std::endl;
 
                  for (unsigned int d=0; d<dim; ++d)
                    {

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.