]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Check the solvers we have.
authorwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Wed, 25 Feb 2004 21:28:41 +0000 (21:28 +0000)
committerwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Wed, 25 Feb 2004 21:28:41 +0000 (21:28 +0000)
git-svn-id: https://svn.dealii.org/trunk@8547 0785d39b-7218-0410-832d-ea1e28bc413d

13 files changed:
tests/bits/Makefile
tests/bits/deal_solver_01.cc [new file with mode: 0644]
tests/bits/deal_solver_02.cc [new file with mode: 0644]
tests/bits/deal_solver_03.cc [new file with mode: 0644]
tests/bits/deal_solver_04.cc [new file with mode: 0644]
tests/bits/deal_solver_05.cc [new file with mode: 0644]
tests/bits/deal_solver_06.cc [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_01.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_02.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_03.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_04.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_05.output [new file with mode: 0644]
tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_06.output [new file with mode: 0644]

index 5492e761d5e55c4f94b0e82391f28377b0fd1aa5..5199180e4f445cdf9339730ce0064048b632cf82 100644 (file)
@@ -49,7 +49,8 @@ tests_x = anna_? \
           find_cell_* \
           sparse_matrix_* \
          full_matrix_vector_* \
-         solver_selector
+         solver_selector \
+         deal_solver_*
 
 ifeq ($(USE_CONTRIB_PETSC),yes)
   tests_x += vector_* petsc_*
diff --git a/tests/bits/deal_solver_01.cc b/tests/bits/deal_solver_01.cc
new file mode 100644 (file)
index 0000000..35e9b1e
--- /dev/null
@@ -0,0 +1,92 @@
+//----------------------------  deal_solver_01.cc  ---------------------------
+//    deal_solver_01.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+//    Version: 
+//
+//    Copyright (C) 2004 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.
+//
+//----------------------------  deal_solver_01.cc  ---------------------------
+
+// test the CG solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+            VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+  deallog << "Solver type: " << typeid(solver).name() << std::endl;
+  
+  u = 0.;
+  f = 1.;
+  try 
+    {
+      solver.solve(A,u,f,P);
+    }
+  catch (std::exception& e)
+    {
+      deallog << e.what() << std::endl;
+      abort ();
+    }
+
+  deallog << "Solver stopped after " << solver.control().last_step()
+          << " iterations" << std::endl;
+}
+
+
+int main()
+{
+  std::ofstream logfile("deal_solver_01.output");
+  logfile.precision(4);
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+  
+  GrowingVectorMemory<> mem;
+  SolverControl control(100, 1.e-3);
+
+  const unsigned int size = 32;
+  unsigned int dim = (size-1)*(size-1);
+
+  deallog << "Size " << size << " Unknowns " << dim << std::endl;
+      
+                                   // Make matrix
+  FDMatrix testproblem(size, size);
+  SparsityPattern structure(dim, dim, 5);
+  testproblem.five_point_structure(structure);
+  structure.compress();
+  SparseMatrix<double>  A(structure);
+  testproblem.five_point(A);
+
+  Vector<double>  f(dim);
+  Vector<double>  u(dim);
+  f = 1.;
+
+  SolverCG<> solver(control, mem);
+  PreconditionIdentity preconditioner;
+  check_solve (solver, A,u,f, preconditioner);
+}
+
diff --git a/tests/bits/deal_solver_02.cc b/tests/bits/deal_solver_02.cc
new file mode 100644 (file)
index 0000000..8685f62
--- /dev/null
@@ -0,0 +1,94 @@
+
+//----------------------------  deal_solver_02.cc  ---------------------------
+//    deal_solver_02.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+//    Version: 
+//
+//    Copyright (C) 2004 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.
+//
+//----------------------------  deal_solver_02.cc  ---------------------------
+
+// test the BiCGStab solver
+
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+            VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+  deallog << "Solver type: " << typeid(solver).name() << std::endl;
+  
+  u = 0.;
+  f = 1.;
+  try 
+    {
+      solver.solve(A,u,f,P);
+    }
+  catch (std::exception& e)
+    {
+      deallog << e.what() << std::endl;
+      abort ();
+    }
+
+  deallog << "Solver stopped after " << solver.control().last_step()
+          << " iterations" << std::endl;
+}
+
+
+int main()
+{
+  std::ofstream logfile("deal_solver_02.output");
+  logfile.precision(4);
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+  
+  GrowingVectorMemory<> mem;
+  SolverControl control(100, 1.e-3);
+
+  const unsigned int size = 32;
+  unsigned int dim = (size-1)*(size-1);
+
+  deallog << "Size " << size << " Unknowns " << dim << std::endl;
+      
+                                   // Make matrix
+  FDMatrix testproblem(size, size);
+  SparsityPattern structure(dim, dim, 5);
+  testproblem.five_point_structure(structure);
+  structure.compress();
+  SparseMatrix<double>  A(structure);
+  testproblem.five_point(A);
+
+  Vector<double>  f(dim);
+  Vector<double>  u(dim);
+  f = 1.;
+
+  SolverBicgstab<> solver(control, mem);
+  PreconditionIdentity preconditioner;
+  check_solve (solver, A,u,f, preconditioner);
+}
+
diff --git a/tests/bits/deal_solver_03.cc b/tests/bits/deal_solver_03.cc
new file mode 100644 (file)
index 0000000..82b81b3
--- /dev/null
@@ -0,0 +1,94 @@
+
+//----------------------------  deal_solver_03.cc  ---------------------------
+//    deal_solver_03.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+//    Version: 
+//
+//    Copyright (C) 2004 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.
+//
+//----------------------------  deal_solver_03.cc  ---------------------------
+
+// test the GMRES solver
+
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+            VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+  deallog << "Solver type: " << typeid(solver).name() << std::endl;
+  
+  u = 0.;
+  f = 1.;
+  try 
+    {
+      solver.solve(A,u,f,P);
+    }
+  catch (std::exception& e)
+    {
+      deallog << e.what() << std::endl;
+      abort ();
+    }
+
+  deallog << "Solver stopped after " << solver.control().last_step()
+          << " iterations" << std::endl;
+}
+
+
+int main()
+{
+  std::ofstream logfile("deal_solver_03.output");
+  logfile.precision(4);
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+  
+  GrowingVectorMemory<> mem;
+  SolverControl control(100, 1.e-3);
+
+  const unsigned int size = 32;
+  unsigned int dim = (size-1)*(size-1);
+
+  deallog << "Size " << size << " Unknowns " << dim << std::endl;
+      
+                                   // Make matrix
+  FDMatrix testproblem(size, size);
+  SparsityPattern structure(dim, dim, 5);
+  testproblem.five_point_structure(structure);
+  structure.compress();
+  SparseMatrix<double>  A(structure);
+  testproblem.five_point(A);
+
+  Vector<double>  f(dim);
+  Vector<double>  u(dim);
+  f = 1.;
+
+  SolverGMRES<> solver(control, mem);
+  PreconditionIdentity preconditioner;
+  check_solve (solver, A,u,f, preconditioner);
+}
+
diff --git a/tests/bits/deal_solver_04.cc b/tests/bits/deal_solver_04.cc
new file mode 100644 (file)
index 0000000..9d6c5f7
--- /dev/null
@@ -0,0 +1,94 @@
+
+//----------------------------  deal_solver_04.cc  ---------------------------
+//    deal_solver_04.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+//    Version: 
+//
+//    Copyright (C) 2004 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.
+//
+//----------------------------  deal_solver_04.cc  ---------------------------
+
+// test the MINRES solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_minres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+            VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+  deallog << "Solver type: " << typeid(solver).name() << std::endl;
+  
+  u = 0.;
+  f = 1.;
+  try 
+    {
+      solver.solve(A,u,f,P);
+    }
+  catch (std::exception& e)
+    {
+      deallog << e.what() << std::endl;
+      abort ();
+    }
+
+  deallog << "Solver stopped after " << solver.control().last_step()
+          << " iterations" << std::endl;
+}
+
+
+int main()
+{
+  std::ofstream logfile("deal_solver_04.output");
+  logfile.precision(4);
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+  
+  GrowingVectorMemory<> mem;
+  SolverControl control(100, 1.e-3);
+
+  const unsigned int size = 32;
+  unsigned int dim = (size-1)*(size-1);
+
+  deallog << "Size " << size << " Unknowns " << dim << std::endl;
+      
+                                   // Make matrix
+  FDMatrix testproblem(size, size);
+  SparsityPattern structure(dim, dim, 5);
+  testproblem.five_point_structure(structure);
+  structure.compress();
+  SparseMatrix<double>  A(structure);
+  testproblem.five_point(A);
+
+  Vector<double>  f(dim);
+  Vector<double>  u(dim);
+  f = 1.;
+
+  SolverMinRes<> solver(control, mem);
+  PreconditionIdentity preconditioner;
+  check_solve (solver, A,u,f, preconditioner);
+}
+
diff --git a/tests/bits/deal_solver_05.cc b/tests/bits/deal_solver_05.cc
new file mode 100644 (file)
index 0000000..4d74120
--- /dev/null
@@ -0,0 +1,93 @@
+
+//----------------------------  deal_solver_05.cc  ---------------------------
+//    deal_solver_05.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+//    Version: 
+//
+//    Copyright (C) 2004 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.
+//
+//----------------------------  deal_solver_05.cc  ---------------------------
+
+// test the QMRS solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+            VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+  deallog << "Solver type: " << typeid(solver).name() << std::endl;
+  
+  u = 0.;
+  f = 1.;
+  try 
+    {
+      solver.solve(A,u,f,P);
+    }
+  catch (std::exception& e)
+    {
+      deallog << e.what() << std::endl;
+      abort ();
+    }
+
+  deallog << "Solver stopped after " << solver.control().last_step()
+          << " iterations" << std::endl;
+}
+
+
+int main()
+{
+  std::ofstream logfile("deal_solver_05.output");
+  logfile.precision(4);
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+  
+  GrowingVectorMemory<> mem;
+  SolverControl control(100, 1.e-3);
+
+  const unsigned int size = 32;
+  unsigned int dim = (size-1)*(size-1);
+
+  deallog << "Size " << size << " Unknowns " << dim << std::endl;
+      
+                                   // Make matrix
+  FDMatrix testproblem(size, size);
+  SparsityPattern structure(dim, dim, 5);
+  testproblem.five_point_structure(structure);
+  structure.compress();
+  SparseMatrix<double>  A(structure);
+  testproblem.five_point(A);
+
+  Vector<double>  f(dim);
+  Vector<double>  u(dim);
+  f = 1.;
+
+  SolverQMRS<> solver(control, mem);
+  PreconditionIdentity preconditioner;
+  check_solve (solver, A,u,f, preconditioner);
+}
+
diff --git a/tests/bits/deal_solver_06.cc b/tests/bits/deal_solver_06.cc
new file mode 100644 (file)
index 0000000..f39e04a
--- /dev/null
@@ -0,0 +1,92 @@
+
+//----------------------------  deal_solver_06.cc  ---------------------------
+//    deal_solver_06.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+//    Version: 
+//
+//    Copyright (C) 2004 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.
+//
+//----------------------------  deal_solver_06.cc  ---------------------------
+
+// test the Richardson solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+            VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+  deallog << "Solver type: " << typeid(solver).name() << std::endl;
+  
+  u = 0.;
+  f = 1.;
+  try 
+    {
+      solver.solve(A,u,f,P);
+    }
+  catch (std::exception& e)
+    {
+      deallog << e.what() << std::endl;
+    }
+
+  deallog << "Solver stopped after " << solver.control().last_step()
+          << " iterations" << std::endl;
+}
+
+
+int main()
+{
+  std::ofstream logfile("deal_solver_06.output");
+  logfile.precision(4);
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+  
+  GrowingVectorMemory<> mem;
+
+  const unsigned int size = 32;
+  unsigned int dim = (size-1)*(size-1);
+  SolverControl control(10000, 1.e-3);
+
+  deallog << "Size " << size << " Unknowns " << dim << std::endl;
+      
+                                   // Make matrix
+  FDMatrix testproblem(size, size);
+  SparsityPattern structure(dim, dim, 5);
+  testproblem.five_point_structure(structure);
+  structure.compress();
+  SparseMatrix<double>  A(structure);
+  testproblem.five_point(A);
+
+  Vector<double>  f(dim);
+  Vector<double>  u(dim);
+  f = 1.;
+
+  SolverRichardson<> solver(control, mem);
+  PreconditionIdentity preconditioner;
+  check_solve (solver, A,u,f, preconditioner);
+}
+
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_01.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_01.output
new file mode 100644 (file)
index 0000000..d16f870
--- /dev/null
@@ -0,0 +1,8 @@
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 8SolverCGI6VectorIdEE
+DEAL:cg::Starting value 31.00
+DEAL:cg::Convergence step 43 value 0.0008189
+DEAL::Solver stopped after 43 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 4
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 4
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_02.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_02.output
new file mode 100644 (file)
index 0000000..1725efa
--- /dev/null
@@ -0,0 +1,8 @@
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 14SolverBicgstabI6VectorIdEE
+DEAL:Bicgstab::Starting value 31.00
+DEAL:Bicgstab::Convergence step 35 value 0.0004803
+DEAL::Solver stopped after 35 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 8
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 8
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_03.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_03.output
new file mode 100644 (file)
index 0000000..85a7f46
--- /dev/null
@@ -0,0 +1,8 @@
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 11SolverGMRESI6VectorIdEE
+DEAL:GMRES::Starting value 31.00
+DEAL:GMRES::Convergence step 75 value 0.0008096
+DEAL::Solver stopped after 75 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 30
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 30
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_04.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_04.output
new file mode 100644 (file)
index 0000000..2515ebf
--- /dev/null
@@ -0,0 +1,8 @@
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 12SolverMinResI6VectorIdEE
+DEAL:minres::Starting value 31.00
+DEAL:minres::Convergence step 43 value 0.0006916
+DEAL::Solver stopped after 43 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 7
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 7
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_05.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_05.output
new file mode 100644 (file)
index 0000000..0d62be6
--- /dev/null
@@ -0,0 +1,8 @@
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 10SolverQMRSI6VectorIdEE
+DEAL:QMRS::Starting value 31.00
+DEAL:QMRS::Convergence step 46 value 0.0009063
+DEAL::Solver stopped after 46 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 5
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 5
diff --git a/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_06.output b/tests/results/i686-pc-linux-gnu+gcc3.2/bits/deal_solver_06.output
new file mode 100644 (file)
index 0000000..da5a8b7
--- /dev/null
@@ -0,0 +1,9 @@
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 16SolverRichardsonI6VectorIdEE
+DEAL:Richardson::Starting value 31.00
+DEAL:Richardson::Failure step 374 value nan
+DEAL::Iterative method reported convergence failure in step 374 with residual nan
+DEAL::Solver stopped after 374 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 2
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 2

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.