--- /dev/null
+//---------------------------- dof_constraints_10.cc ---------------------------
+// $Id$
+// Version: $Name$
+//
+// 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.
+//
+//---------------------------- dof_constraints_10.cc ---------------------------
+
+
+// simply check what happens when condensing compressed sparsity
+// patterns. This test was written when I changed a few things in the
+// algorithm.
+
+#include "../tests.h"
+#include <lac/compressed_sparsity_pattern.h>
+#include <lac/sparsity_pattern.h>
+#include <grid/tria.h>
+#include <grid/tria_accessor.h>
+#include <grid/tria_iterator.h>
+#include <grid/grid_tools.h>
+#include <grid/grid_generator.h>
+#include <dofs/dof_handler.h>
+#include <dofs/dof_accessor.h>
+#include <dofs/dof_tools.h>
+#include <dofs/dof_constraints.h>
+#include <fe/fe_q.h>
+#include <fstream>
+#include <iostream>
+
+
+template <int dim>
+void test ()
+{
+ deallog << dim << "D" << std::endl;
+
+ Triangulation<dim> triangulation;
+ GridGenerator::hyper_cube (triangulation);
+
+ // refine once, then refine first cell to
+ // create hanging nodes
+ triangulation.refine_global (1);
+ triangulation.begin_active()->set_refine_flag ();
+ triangulation.execute_coarsening_and_refinement ();
+ deallog << "Number of cells: " << triangulation.n_active_cells() << std::endl;
+
+ // set up a DoFHandler and compute hanging
+ // node constraints for a Q2 element
+ FE_Q<dim> fe(2);
+ DoFHandler<dim> dof_handler (triangulation);
+ dof_handler.distribute_dofs (fe);
+ deallog << "Number of dofs: " << dof_handler.n_dofs() << std::endl;
+
+ ConstraintMatrix constraints;
+ DoFTools::make_hanging_node_constraints (dof_handler, constraints);
+ constraints.close ();
+ deallog << "Number of constraints: " << constraints.n_constraints() << std::endl;
+
+ // then set up a sparsity pattern and a
+ // matrix on top of it
+ CompressedSparsityPattern sparsity (dof_handler.n_dofs(),
+ dof_handler.n_dofs());
+ DoFTools::make_sparsity_pattern (dof_handler, sparsity);
+ constraints.condense (sparsity);
+
+ // and output what we have
+ SparsityPattern A;
+ A.copy_from (sparsity);
+ for (SparsityPattern::const_iterator i=A.begin(); i!=A.end(); ++i)
+ deallog << i->row() << ' ' << i->column()
+ << std::endl;
+}
+
+
+
+int main ()
+{
+ std::ofstream logfile("dof_constraints_10.output");
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ try
+ {
+ test<1> ();
+ test<2> ();
+ test<3> ();
+ }
+ 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;
+ };
+}
--- /dev/null
+//---------------------------- dof_constraints_11.cc ---------------------------
+// $Id$
+// Version: $Name$
+//
+// 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.
+//
+//---------------------------- dof_constraints_11.cc ---------------------------
+
+
+// simply check what happens when condensing compressed block sparsity
+// patterns. This test was written when I changed a few things in the
+// algorithm.
+
+#include "../tests.h"
+#include <lac/compressed_sparsity_pattern.h>
+#include <lac/block_sparsity_pattern.h>
+#include <lac/sparsity_pattern.h>
+#include <grid/tria.h>
+#include <grid/tria_accessor.h>
+#include <grid/tria_iterator.h>
+#include <grid/grid_tools.h>
+#include <grid/grid_generator.h>
+#include <dofs/dof_handler.h>
+#include <dofs/dof_accessor.h>
+#include <dofs/dof_tools.h>
+#include <dofs/dof_constraints.h>
+#include <fe/fe_q.h>
+#include <fstream>
+#include <iostream>
+
+
+template <int dim>
+void test ()
+{
+ deallog << dim << "D" << std::endl;
+
+ Triangulation<dim> triangulation;
+ GridGenerator::hyper_cube (triangulation);
+
+ // refine once, then refine first cell to
+ // create hanging nodes
+ triangulation.refine_global (1);
+ triangulation.begin_active()->set_refine_flag ();
+ triangulation.execute_coarsening_and_refinement ();
+ deallog << "Number of cells: " << triangulation.n_active_cells() << std::endl;
+
+ // set up a DoFHandler and compute hanging
+ // node constraints for a Q2 element
+ FE_Q<dim> fe(2);
+ DoFHandler<dim> dof_handler (triangulation);
+ dof_handler.distribute_dofs (fe);
+ deallog << "Number of dofs: " << dof_handler.n_dofs() << std::endl;
+
+ ConstraintMatrix constraints;
+ DoFTools::make_hanging_node_constraints (dof_handler, constraints);
+ constraints.close ();
+ deallog << "Number of constraints: " << constraints.n_constraints() << std::endl;
+
+ // then set up a sparsity pattern and a
+ // matrix on top of it
+ std::vector<unsigned int> block_sizes(2);
+ block_sizes[0] = dof_handler.n_dofs()/3;
+ block_sizes[1] = dof_handler.n_dofs() - block_sizes[0];
+
+ CompressedBlockSparsityPattern sparsity(2,2);
+ for (unsigned int i=0; i<2; ++i)
+ for (unsigned int j=0; j<2; ++j)
+ sparsity.block(i,j).reinit (block_sizes[i], block_sizes[j]);
+ sparsity.collect_sizes();
+
+ DoFTools::make_sparsity_pattern (dof_handler, sparsity);
+ constraints.condense (sparsity);
+
+ // and output what we have
+ BlockSparsityPattern A;
+ A.copy_from (sparsity);
+ for (unsigned int r=0; r<A.n_block_rows(); ++r)
+ for (unsigned int c=0; c<A.n_block_rows(); ++c)
+ for (SparsityPattern::const_iterator i=A.block(r,c).begin(); i!=A.block(r,c).end(); ++i)
+ deallog << r << ' ' << c << ' '
+ << i->row() << ' ' << i->column()
+ << std::endl;
+}
+
+
+
+int main ()
+{
+ std::ofstream logfile("dof_constraints_11.output");
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ try
+ {
+ test<1> ();
+ test<2> ();
+ test<3> ();
+ }
+ 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;
+ };
+}