From d027a68c6d1ce6a46a5fd60014174344836809c9 Mon Sep 17 00:00:00 2001 From: wolf Date: Wed, 8 Dec 1999 08:59:28 +0000 Subject: [PATCH] Adapt to Guido's changes. git-svn-id: https://svn.dealii.org/trunk@1999 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/doc/tutorial/chapter-1.elements/condense.html | 6 ++++-- .../doc/tutorial/chapter-1.elements/matrix_structure.html | 7 ++++--- 2 files changed, 8 insertions(+), 5 deletions(-) diff --git a/deal.II/doc/tutorial/chapter-1.elements/condense.html b/deal.II/doc/tutorial/chapter-1.elements/condense.html index 53ed6081e3..b8c3f1d080 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/condense.html +++ b/deal.II/doc/tutorial/chapter-1.elements/condense.html @@ -40,7 +40,8 @@ You will have to:
  • Create a global sparsity pattern (as described in the chapter on matrix structure) using -void DoFHandler::make_sparsity_pattern(SparseMatrixStruct &). +void DoFTools::make_sparsity_pattern(const DoFHandler<dim> &, + SparseMatrixStruct &).
  • Create the constraints on the hanging nodes using @@ -70,6 +71,7 @@ function calls needed. Be sure to use them in their appropriate places. #include <grid/dof.h> #include <lac/sparsematrix.h> #include <grid/dof_constraints.h> +#include <basic/dof_tools.h> const unsigned int dim=2; // Work in two dimensions, could also be three SparseMatrixStruct sparsity_pattern; @@ -77,7 +79,7 @@ DoFHandler<dim> dof_handler; ConstraintMatrix hanging_nodes; hanging_nodes.clear(); -dof_handler.make_sparsity_pattern(sparsity_pattern); +DoFTools::make_sparsity_pattern(dof_handler, sparsity_pattern); dof_handler.make_hanging_nodes_constraints(hanging_nodes); hanging_nodes.close(); hanging_nodes.condense(matrix_structure); diff --git a/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html b/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html index a0b2546a4d..397d677a46 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html +++ b/deal.II/doc/tutorial/chapter-1.elements/matrix_structure.html @@ -89,7 +89,7 @@ number of non-zero entries per row. After having fixed the basic properties of the sparsity structure, we can tell it which entries actually are non-zero. This is again done using a library function, -DoFHandler::make_sparsity_pattern. Then we have to take +DoFTools::make_sparsity_pattern. Then we have to take into account that constraints due to hanging nodes (see the previous chapter) add some more non-zero entries, which is again done using some library functions (see the example below). After this, we can @@ -120,6 +120,7 @@ appropriate places. This example initializes a sparse square matrix structure. #include <grid/dof.h> #include <lac/sparsematrix.h> +#include <basic/dof_tools.h> const unsigned int dim=2; // For example @@ -137,7 +138,7 @@ sparsity_pattern.reinit (dof_handler.n_dofs(), dof_handler.max_couplings_between_dofs()); // tell the sparsity pattern which entries are non-zero: -dof_handler.make_sparsity_pattern (sparsity_pattern); +make_sparsity_pattern (dof_handler, sparsity_pattern); // Condense the hanging nodes into // the matrix structure, taking into account the constraints due to @@ -192,7 +193,7 @@ Finally, we note that in some cases not all variables in a system of partial differential equations couple to each other, or that the operators have a special structure. For this reason, there are more specialized version of the -DoFHandler::make_sparsity_pattern and +DoFTools::make_sparsity_pattern and SparseMatrixStruct::reinit functions, which allow you to more flexibly determine the actual number of non-zero elements of all or individual rows. See the documentation of the respective classes -- 2.39.5