]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Fix comments.
authorkronbichler <kronbichler@0785d39b-7218-0410-832d-ea1e28bc413d>
Mon, 23 Nov 2009 22:25:27 +0000 (22:25 +0000)
committerkronbichler <kronbichler@0785d39b-7218-0410-832d-ea1e28bc413d>
Mon, 23 Nov 2009 22:25:27 +0000 (22:25 +0000)
git-svn-id: https://svn.dealii.org/trunk@20156 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/examples/step-22/doc/results.dox
deal.II/examples/step-22/step-22.cc

index b28426bd544a0c4a3a581f00a2c2a32417cb95ea..3162dda646bfabc95b1e6e3b11cfbd536c07fc90 100644 (file)
@@ -244,7 +244,7 @@ If we don't do anything special to renumber degrees of freedom (i.e.,
 without using DoFRenumbering::Cuthill_McKee, but with using
 DoFRenumbering::component_wise to ensure that degrees of freedom are
 appropriately sorted into their corresponding blocks of the matrix and
-vector, then we get the following image after the first adaptive
+vector), then we get the following image after the first adaptive
 refinement in two dimensions:
 
 @image html step-22.2d.sparsity-nor.png
@@ -275,7 +275,7 @@ now concentrated around the diagonal in the (0,0) block in the matrix. Similar
 effects are also visible for the other blocks. In this case, the ILU
 decomposition will be much closer to the full LU decomposition, which improves
 the quality of the preconditioner. (It may be interesting to note that the
-sparse direct solver UMFPACK does some internal renumbering of the equations
+sparse direct solver UMFPACK does some %internal renumbering of the equations
 before actually generating a sparse LU decomposition; that procedure leads to
 a very similar pattern to the one we got from the Cuthill-McKee algorithm.)
 
index bc2d96437711cf35f449ccb8b52504f640731c29..739adad62f90c1a6fa19dfdc877b70b11046e6b5 100644 (file)
@@ -700,14 +700,14 @@ void StokesProblem<dim>::setup_dofs ()
                                   // (and its block variant
                                   // BlockCompressedSimpleSparsityPattern)
                                   // has exactly the same interface, uses a
-                                  // different internal data structure and
+                                  // different %internal data structure and
                                   // is linear in the number of degrees of
                                   // freedom and therefore much more
                                   // efficient for large problems. As
                                   // another alternative, we could also
                                   // have chosen the class
                                   // BlockCompressedSetSparsityPattern that
-                                  // uses yet another strategy for internal
+                                  // uses yet another strategy for %internal
                                   // memory management. Though, that class
                                   // turns out to be more memory-demanding
                                   // than
@@ -762,7 +762,7 @@ void StokesProblem<dim>::setup_dofs ()
                                 // abbreviations for the data structures
                                 // that hold the local matrix, right
                                 // hand side, and global
-                                // numbers of the degrees of freedom
+                                // numbering of the degrees of freedom
                                 // for the present cell.
 template <int dim>
 void StokesProblem<dim>::assemble_system () 

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.