--- /dev/null
+//---------------------------------------------------------------------------
+// $Id$
+// Version: $Name$
+//
+// Copyright (C) 2009, 2010, 2012, 2013 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//---------------------------------------------------------------------------
+
+
+// check ConstraintMatrix.distribute() for a trilinos vector
+//
+// we do this by creating a vector where each processor has 100
+// elements but no ghost elements. then we add constraints on each
+// processor that constrain elements within each processor's local
+// range to ones outside. these have to be added on all
+// processors. then call distribute() and verify that the result is
+// true.
+//
+// we use constraints of the form x_i = x_j with sequentially growing
+// x_j's so that we can verify the correctness analytically
+
+#include "../tests.h"
+#include <deal.II/base/logstream.h>
+#include <deal.II/lac/trilinos_vector.h>
+#include <deal.II/lac/constraint_matrix.h>
+
+#include <fstream>
+#include <sstream>
+
+
+
+void test()
+{
+ const unsigned int myid = Utilities::MPI::this_mpi_process (MPI_COMM_WORLD);
+ const unsigned int n_processes = Utilities::MPI::n_mpi_processes (MPI_COMM_WORLD);
+
+ // create a vector that consists of elements indexed from 0 to n
+ TrilinosWrappers::MPI::Vector vec;
+ {
+ IndexSet is (100*n_processes);
+ is.add_range (100*myid, 100*myid+100);
+ vec.reinit (is, MPI_COMM_WORLD);
+ }
+ Assert (vec.local_size() == 100, ExcInternalError());
+ Assert (vec.local_range().first == 100*myid, ExcInternalError());
+ Assert (vec.local_range().second == 100*myid+100, ExcInternalError());
+ for (unsigned int i=vec.local_range().first; i<vec.local_range().second; ++i)
+ vec(i) = i;
+ vec.compress();
+
+ // verify correctness so far
+ {
+ double exact_l1 = 0;
+ for (unsigned int i=0; i<vec.size(); ++i)
+ exact_l1 += i;
+ Assert (vec.l1_norm() == exact_l1, ExcInternalError());
+ }
+
+
+ // create a ConstraintMatrix with a range that exceeds the locally
+ // owned range by 50 on each side
+ IndexSet locally_relevant_range (vec.size());
+ locally_relevant_range.add_range (std::max<int> (100*myid-50, 0),
+ std::min (100*myid+150, vec.size()));
+ ConstraintMatrix cm (locally_relevant_range);
+
+ // add constraints that constrain an element in the middle of the
+ // local range of each processor against an element outside, both in
+ // the ghost range before and after
+ //
+ // note that we tell each processor about all constraints, but most
+ // of them will throw away this information since it is not for a
+ // DoF inside the locally relevant range
+ for (unsigned int p=0; p<n_processes; ++p)
+ {
+ if ((p != 0) && locally_relevant_range.is_element (p*100+10))
+ {
+ cm.add_line (p*100+10);
+ cm.add_entry (p*100+10,
+ p*100-25,
+ 1);
+ }
+
+ if ((p != n_processes-1) && locally_relevant_range.is_element (p*100+90))
+ {
+ cm.add_line (p*100+90);
+ cm.add_entry (p*100+90,
+ p*100+105,
+ 1);
+ }
+ }
+ cm.close ();
+
+ // now distribute these constraints
+ cm.distribute (vec);
+
+ // verify correctness
+ vec.compress ();
+
+ if (myid != 0)
+ Assert (vec(vec.local_range().first+10) == vec.local_range().first-25,
+ ExcInternalError());
+
+ if (myid != n_processes-1)
+ Assert (vec(vec.local_range().first+90) == vec.local_range().first+105,
+ ExcInternalError());
+
+ for (unsigned int i=vec.local_range().first; i<vec.local_range().second; ++i)
+ {
+ if ((i != vec.local_range().first+10)
+ &&
+ (i != vec.local_range().first+90))
+ {
+ double val = vec(i);
+ Assert (std::fabs(val - i) <= 1e-6, ExcInternalError());
+ }
+ }
+
+ {
+ double exact_l1 = 0;
+
+ // add up original values of vector entries
+ for (unsigned int i=0; i<vec.size(); ++i)
+ exact_l1 += i;
+
+ // but then correct for the constrained values
+ for (unsigned int p=0; p<n_processes; ++p)
+ {
+ if (p != 0)
+ exact_l1 = exact_l1 - (p*100+10) + (p*100-25);
+ if (p != n_processes-1)
+ exact_l1 = exact_l1 - (p*100+90) + (p*100+105);
+ }
+
+ const double l1_norm = vec.l1_norm();
+ Assert (l1_norm == exact_l1, ExcInternalError());
+
+ if (myid == 0)
+ deallog << "Norm = " << l1_norm << std::endl;
+ }
+}
+
+
+int main(int argc, char *argv[])
+{
+ Utilities::MPI::MPI_InitFinalize mpi_initialization(argc, argv, 1);
+
+ unsigned int myid = Utilities::MPI::this_mpi_process (MPI_COMM_WORLD);
+
+
+ deallog.push(Utilities::int_to_string(myid));
+
+ if (myid == 0)
+ {
+ std::ofstream logfile(output_file_for_mpi("trilinos_distribute_01").c_str());
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+ deallog.threshold_double(1.e-10);
+
+ test();
+ }
+ else
+ test();
+
+}
projects / dealii-svn.git / commitdiff