]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
New tests.
authorwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Mon, 27 Jun 2005 21:05:25 +0000 (21:05 +0000)
committerwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Mon, 27 Jun 2005 21:05:25 +0000 (21:05 +0000)
git-svn-id: https://svn.dealii.org/trunk@10954 0785d39b-7218-0410-832d-ea1e28bc413d

tests/bits/petsc_slowness_01.cc [new file with mode: 0644]
tests/bits/petsc_slowness_02.cc [new file with mode: 0644]
tests/bits/petsc_slowness_03.cc [new file with mode: 0644]
tests/bits/petsc_slowness_04.cc [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_01.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_02.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_03.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_04.output [new file with mode: 0644]

diff --git a/tests/bits/petsc_slowness_01.cc b/tests/bits/petsc_slowness_01.cc
new file mode 100644 (file)
index 0000000..8dce923
--- /dev/null
@@ -0,0 +1,145 @@
+//----------------------------  petsc_slowness_01.cc  ---------------------------
+//    $Id$
+//    Version: $Name$ 
+//
+//    Copyright (C) 2005 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.
+//
+//----------------------------  petsc_slowness_01.cc  ---------------------------
+
+
+// this is part of a whole suite of tests that checks the relative speed of
+// using PETSc for sparse matrices as compared to the speed of our own
+// library. the tests therefore may not all actually use PETSc, but they are
+// meant to compare it
+//
+// the tests build the 5-point stencil matrix for a uniform grid of size N*N
+
+#include "../tests.h"
+#include <lac/sparse_matrix.h>
+#include <lac/vector.h>
+#include <lac/petsc_sparse_matrix.h>
+#include <fstream>
+#include <iostream>
+
+
+void test ()
+{
+  const unsigned int N = 200;
+
+                                   // first build the sparsity pattern
+  SparsityPattern sparsity (N*N, N*N, 5);
+  for(unsigned int i=0; i<N; i++)
+    for(unsigned int j=0; j<N; j++)
+      {
+        const unsigned int global = i*N+j;
+        sparsity.add(global, global);
+        if (j>0)
+          {
+            sparsity.add(global-1, global);
+            sparsity.add(global, global-1);
+          }
+        if (j<N-1)
+          {
+            sparsity.add(global+1, global);
+            sparsity.add(global, global+1);
+          }
+        if (i>0)
+          {
+            sparsity.add(global-N, global);
+            sparsity.add(global, global-N);
+          }
+        if (i<N-1)
+          {
+            sparsity.add(global+N, global);
+            sparsity.add(global, global+N);
+          }
+      }
+  sparsity.compress();
+  
+
+                                   // next build the sparse matrix itself
+  SparseMatrix<double> matrix (sparsity);
+  for(unsigned int i=0; i<N; i++)
+    for(unsigned int j=0; j<N; j++)
+      {
+        const unsigned int global = i*N+j;
+        matrix.add(global, global, 4);
+        if (j>0)
+          {
+            matrix.add(global-1, global, -1);
+            matrix.add(global, global-1, -1);
+          }
+        if (j<N-1)
+          {
+            matrix.add(global+1, global, -1);
+            matrix.add(global, global+1, -1);
+          }
+        if (i>0)
+          {
+            matrix.add(global-N, global, -1);
+            matrix.add(global, global-N, -1);
+          }
+        if (i<N-1)
+          {
+            matrix.add(global+N, global, -1);
+            matrix.add(global, global+N, -1);
+          }
+      }
+  
+                                   // then do a single matrix-vector
+                                   // multiplication with subsequent formation
+                                   // of the matrix norm
+  Vector<double> v1(N*N), v2(N*N);
+  for (unsigned int i=0; i<N*N; ++i)
+    v1(i) = i;
+  matrix.vmult (v2, v1);
+  
+  deallog << v1*v2 << std::endl;
+}
+
+
+
+int main (int argc,char **argv) 
+{
+  std::ofstream logfile("petsc_slowness_01.output");
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+
+  try
+    {
+      PetscInitialize(&argc,&argv,0,0);
+      {
+        test ();
+      }
+      PetscFinalize();
+    }
+  catch (std::exception &exc)
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Exception on processing: " << std::endl
+               << exc.what() << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      
+      return 1;
+    }
+  catch (...) 
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Unknown exception!" << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      return 1;
+    };
+}
diff --git a/tests/bits/petsc_slowness_02.cc b/tests/bits/petsc_slowness_02.cc
new file mode 100644 (file)
index 0000000..1ffedb6
--- /dev/null
@@ -0,0 +1,116 @@
+//----------------------------  petsc_slowness_02.cc  ---------------------------
+//    $Id$
+//    Version: $Name$ 
+//
+//    Copyright (C) 2005 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.
+//
+//----------------------------  petsc_slowness_02.cc  ---------------------------
+
+
+// this is part of a whole suite of tests that checks the relative speed of
+// using PETSc for sparse matrices as compared to the speed of our own
+// library. the tests therefore may not all actually use PETSc, but they are
+// meant to compare it
+//
+// the tests build the 5-point stencil matrix for a uniform grid of size N*N
+
+#include "../tests.h"
+#include <lac/sparse_matrix.h>
+#include <lac/petsc_sparse_matrix.h>
+#include <lac/petsc_vector.h>
+#include <fstream>
+#include <iostream>
+
+
+void test ()
+{
+  const unsigned int N = 200;
+
+                                   // build the sparse matrix 
+  PETScWrappers::SparseMatrix matrix (N*N, N*N, 5);
+  for(unsigned int i=0; i<N; i++)
+    for(unsigned int j=0; j<N; j++)
+      {
+        const unsigned int global = i*N+j;
+        matrix.add(global, global, 4);
+        if (j>0)
+          {
+            matrix.add(global-1, global, -1);
+            matrix.add(global, global-1, -1);
+          }
+        if (j<N-1)
+          {
+            matrix.add(global+1, global, -1);
+            matrix.add(global, global+1, -1);
+          }
+        if (i>0)
+          {
+            matrix.add(global-N, global, -1);
+            matrix.add(global, global-N, -1);
+          }
+        if (i<N-1)
+          {
+            matrix.add(global+N, global, -1);
+            matrix.add(global, global+N, -1);
+          }
+      }
+  matrix.compress ();
+  
+  
+                                   // then do a single matrix-vector
+                                   // multiplication with subsequent formation
+                                   // of the matrix norm
+  PETScWrappers::Vector v1(N*N), v2(N*N);
+  for (unsigned int i=0; i<N*N; ++i)
+    v1(i) = i;
+  matrix.vmult (v2, v1);
+  
+  deallog << v1*v2 << std::endl;
+}
+
+
+
+int main (int argc,char **argv) 
+{
+  std::ofstream logfile("petsc_slowness_02.output");
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+
+  try
+    {
+      PetscInitialize(&argc,&argv,0,0);
+      {
+        test ();
+      }
+      PetscFinalize();
+    }
+  catch (std::exception &exc)
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Exception on processing: " << std::endl
+               << exc.what() << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      
+      return 1;
+    }
+  catch (...) 
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Unknown exception!" << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      return 1;
+    };
+}
diff --git a/tests/bits/petsc_slowness_03.cc b/tests/bits/petsc_slowness_03.cc
new file mode 100644 (file)
index 0000000..1810a40
--- /dev/null
@@ -0,0 +1,119 @@
+//----------------------------  petsc_slowness_03.cc  ---------------------------
+//    $Id$
+//    Version: $Name$ 
+//
+//    Copyright (C) 2005 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.
+//
+//----------------------------  petsc_slowness_03.cc  ---------------------------
+
+
+// this is part of a whole suite of tests that checks the relative speed of
+// using PETSc for sparse matrices as compared to the speed of our own
+// library. the tests therefore may not all actually use PETSc, but they are
+// meant to compare it
+//
+// the tests build the 5-point stencil matrix for a uniform grid of size N*N
+
+#include "../tests.h"
+#include <lac/sparse_matrix.h>
+#include <lac/petsc_parallel_sparse_matrix.h>
+#include <lac/petsc_parallel_vector.h>
+#include <fstream>
+#include <iostream>
+
+
+void test ()
+{
+  const unsigned int N = 200;
+
+                                   // build the sparse matrix 
+  PETScWrappers::MPI::SparseMatrix matrix (PETSC_COMM_WORLD,
+                                           N*N, N*N,
+                                           N*N, N*N,
+                                           5);
+  for(unsigned int i=0; i<N; i++)
+    for(unsigned int j=0; j<N; j++)
+      {
+        const unsigned int global = i*N+j;
+        matrix.add(global, global, 4);
+        if (j>0)
+          {
+            matrix.add(global-1, global, -1);
+            matrix.add(global, global-1, -1);
+          }
+        if (j<N-1)
+          {
+            matrix.add(global+1, global, -1);
+            matrix.add(global, global+1, -1);
+          }
+        if (i>0)
+          {
+            matrix.add(global-N, global, -1);
+            matrix.add(global, global-N, -1);
+          }
+        if (i<N-1)
+          {
+            matrix.add(global+N, global, -1);
+            matrix.add(global, global+N, -1);
+          }
+      }
+  matrix.compress ();
+  
+                                   // then do a single matrix-vector
+                                   // multiplication with subsequent formation
+                                   // of the matrix norm
+  PETScWrappers::MPI::Vector v1(PETSC_COMM_WORLD, N*N, N*N);
+  PETScWrappers::MPI::Vector v2(PETSC_COMM_WORLD, N*N, N*N);
+  for (unsigned int i=0; i<N*N; ++i)
+    v1(i) = i;
+  matrix.vmult (v2, v1);
+  
+  deallog << v1*v2 << std::endl;
+}
+
+
+
+int main (int argc,char **argv) 
+{
+  std::ofstream logfile("petsc_slowness_03.output");
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+
+  try
+    {
+      PetscInitialize(&argc,&argv,0,0);
+      {
+        test ();
+      }
+      PetscFinalize();
+    }
+  catch (std::exception &exc)
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Exception on processing: " << std::endl
+               << exc.what() << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      
+      return 1;
+    }
+  catch (...) 
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Unknown exception!" << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      return 1;
+    };
+}
diff --git a/tests/bits/petsc_slowness_04.cc b/tests/bits/petsc_slowness_04.cc
new file mode 100644 (file)
index 0000000..cbbac41
--- /dev/null
@@ -0,0 +1,150 @@
+//----------------------------  petsc_slowness_03.cc  ---------------------------
+//    $Id$
+//    Version: $Name$ 
+//
+//    Copyright (C) 2005 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.
+//
+//----------------------------  petsc_slowness_03.cc  ---------------------------
+
+
+// this is part of a whole suite of tests that checks the relative speed of
+// using PETSc for sparse matrices as compared to the speed of our own
+// library. the tests therefore may not all actually use PETSc, but they are
+// meant to compare it
+//
+// the tests build the 5-point stencil matrix for a uniform grid of size N*N
+//
+// this test does the same as the _03 test, except that it does not allocate
+// the entries in consecutive order, but in pseudo-random order. the reason is
+// that in usual finite element programs, we do not write to the elements of a
+// matrix in a consecutive fashion, but rather according to the order of
+// degrees of freedom in the sequence of cells that we traverse
+
+#include "../tests.h"
+#include <lac/sparse_matrix.h>
+#include <lac/petsc_parallel_sparse_matrix.h>
+#include <lac/petsc_parallel_vector.h>
+#include <fstream>
+#include <iostream>
+
+
+void test ()
+{
+  const unsigned int N = 200;
+
+                                   // first find a random permutation of the
+                                   // indices
+  std::vector<unsigned int> permutation (N);
+  {
+    std::vector<unsigned int> unused_indices (N);
+    for (unsigned int i=0; i<N; i++)
+      unused_indices[i] = i;
+
+    for (unsigned int i=0; i<N; i++)
+      {
+                                         // pick a random element among the
+                                         // unused indices
+        const unsigned int k = rand() % (N-i);
+        permutation[i] = unused_indices[k];
+        
+                                         // then swap this used element to the
+                                         // end where we won't consider it any
+                                         // more
+        std::swap (unused_indices[k], unused_indices[N-i-1]);
+      }    
+  }
+  
+                                   // build the sparse matrix 
+  PETScWrappers::MPI::SparseMatrix matrix (PETSC_COMM_WORLD,
+                                           N*N, N*N,
+                                           N*N, N*N,
+                                           5);
+  for(unsigned int i_=0; i_<N; i_++)
+    for(unsigned int j_=0; j_<N; j_++)
+      {
+        const unsigned int i=permutation[i_];
+        const unsigned int j=permutation[j_];
+        
+        const unsigned int global = i*N+j;
+        matrix.add(global, global, rand());
+        if (j>0)
+          {
+            matrix.add(global-1, global, rand());
+            matrix.add(global, global-1, rand());
+          }
+        if (j<N-1)
+          {
+            matrix.add(global+1, global, rand());
+            matrix.add(global, global+1, rand());
+          }
+        if (i>0)
+          {
+            matrix.add(global-N, global, rand());
+            matrix.add(global, global-N, rand());
+          }
+        if (i<N-1)
+          {
+            matrix.add(global+N, global, rand());
+            matrix.add(global, global+N, rand());
+          }
+      }
+  matrix.compress ();
+  
+                                   // then do a single matrix-vector
+                                   // multiplication with subsequent formation
+                                   // of the matrix norm
+  PETScWrappers::MPI::Vector v1(PETSC_COMM_WORLD, N*N, N*N);
+  PETScWrappers::MPI::Vector v2(PETSC_COMM_WORLD, N*N, N*N);
+  for (unsigned int i=0; i<N*N; ++i)
+    v1(i) = i;
+  matrix.vmult (v2, v1);
+  
+  deallog << v1*v2 << std::endl;
+}
+
+
+
+int main (int argc,char **argv) 
+{
+  std::ofstream logfile("petsc_slowness_04.output");
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+
+  try
+    {
+      PetscInitialize(&argc,&argv,0,0);
+      {
+        test ();
+      }
+      PetscFinalize();
+    }
+  catch (std::exception &exc)
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Exception on processing: " << std::endl
+               << exc.what() << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      
+      return 1;
+    }
+  catch (...) 
+    {
+      std::cerr << std::endl << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      std::cerr << "Unknown exception!" << std::endl
+               << "Aborting!" << std::endl
+               << "----------------------------------------------------"
+               << std::endl;
+      return 1;
+    };
+}
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_01.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_01.output
new file mode 100644 (file)
index 0000000..0d89007
--- /dev/null
@@ -0,0 +1,2 @@
+
+DEAL::-8.42635e+13
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_02.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_02.output
new file mode 100644 (file)
index 0000000..0d89007
--- /dev/null
@@ -0,0 +1,2 @@
+
+DEAL::-8.42635e+13
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_03.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_03.output
new file mode 100644 (file)
index 0000000..0528791
--- /dev/null
@@ -0,0 +1,2 @@
+
+DEAL::2.04928e+23
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_04.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/petsc_slowness_04.output
new file mode 100644 (file)
index 0000000..0528791
--- /dev/null
@@ -0,0 +1,2 @@
+
+DEAL::2.04928e+23

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.