Mention the change in the boost DoF renumbering scheme. On the other hand, we can...

git-svn-id: https://svn.dealii.org/trunk@18689 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/deal.II/source/dofs/dof_renumbering.cc b/deal.II/deal.II/source/dofs/dof_renumbering.cc
index 4435682ef75a9914390d87121c948fc32b71631f..25db55869d2be99831a74165443a7d7aab4766be 100644 (file)
--- a/deal.II/deal.II/source/dofs/dof_renumbering.cc
+++ b/deal.II/deal.II/source/dofs/dof_renumbering.cc
@@ -173,7 +173,6 @@ namespace DoFRenumbering
                         types::Graph                                                   &graph,
                         types::property_map<types::Graph,types::vertex_degree_t>::type &graph_degree)
       {
-       Assert (use_constraints == false, ExcNotImplemented());
        {
                                   // create intermediate sparsity pattern
                                   // (faster than directly submitting

diff --git a/deal.II/doc/news/changes.h b/deal.II/doc/news/changes.h
index d9ac8f816e88538bf36a55191244e53e01f3c2db..c31235da72221efef2d7a78f1b65f959b002be2a 100644 (file)
--- a/deal.II/doc/news/changes.h
+++ b/deal.II/doc/news/changes.h
@@ -30,6 +30,16 @@ inconvenience this causes.
 </p>
 
 <ol>
+  <li>
+  <p> 
+  Changed: The implementation of the reordering algorithms in the boost
+  namespace created multiple edges between two nodes. The new implementation 
+  submits not more than one edge, but that affects the ordering of the
+  degrees of freedom and deviates from previous behavior.
+  <br>
+  (Martin Kronbichler 2009/04/22)
+  </p>
+
   <li>
   <p> 
   Changed: The files implementing the class ConstraintMatrix are now
@@ -617,12 +627,22 @@ inconvenience this causes.
 <h3>lac</h3>
 
 <ol>
+  <li>
+  <p>
+  Updated: The SparseMatrix::precondition_SSOR function was implemented 
+  inefficiently. The new implementation uses about half the instruction 
+  count and reduces execution times on typical applications by ten to 
+  thirty percent.
+  <br>
+  (Martin Kronbichler 2009/04/21)
+  </p>
+
   <li>
   <p>
   Updated: The SparseILU::vmult kernel has been re-written to use similar 
   data structures as SparseMatrix::vmult, which reduces the count of
-  operations by one third and the execution times on typical problems by
-  ten to twenty precent.
+  operations by one third and the execution times on typical applications
+  by ten to twenty percent.
   <br>
   (Martin Kronbichler 2009/04/16)
   </p>