From 73eb68a40f28880b40468d706725fae052d7f00f Mon Sep 17 00:00:00 2001 From: schrage Date: Mon, 12 Apr 1999 14:44:14 +0000 Subject: [PATCH] More readable by now git-svn-id: https://svn.dealii.org/trunk@1123 0785d39b-7218-0410-832d-ea1e28bc413d --- .../chapter-1.elements/hanging_nodes.html | 44 +++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/deal.II/doc/tutorial/chapter-1.elements/hanging_nodes.html b/deal.II/doc/tutorial/chapter-1.elements/hanging_nodes.html index bb5c605b4a..d5aa7d512a 100644 --- a/deal.II/doc/tutorial/chapter-1.elements/hanging_nodes.html +++ b/deal.II/doc/tutorial/chapter-1.elements/hanging_nodes.html @@ -17,11 +17,55 @@

Hanging Nodes

+This chapter discusses locally refined grids, which are the only ones with +hanging nodes. A node is called hanging if its value is not fixed. + In particular, nodes on the boundary of your domain +are not hanging. + +

When do you get hanging nodes ?

+ +

+You get hanging nodes after each refinement. The value of these nodes is +not fixed, but they are subject to constraints. Hanging nodes +and the constraints they are subject to need to be +taken into account when generating your matrix structure. +

+ +

How to condense hanging nodes into a matrix structure

+ +There are three deal.II methods you will need for +dealing with hanging nodes: + + +

+Example: We will create a +constraint matrix for hanging nodes and condense the hanging nodes into our matrix structure. Below we show the includes, +definitions and +function calls needed. Be sure to use them in their appropriate places. +

+
+
+NOT FINISHED
+
+hanging_nodes.clear();
+dof.make_constraint_matrix(hanging_nodes);
+hanging_nodes.condense(matrix_structure);
+
+
+ +NOT FINISHED
+ -- 2.39.5