From: kronbichler Date: Mon, 23 Nov 2009 22:25:27 +0000 (+0000) Subject: Fix comments. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=2869b70bc12645442deaf460eeca26e113634903;p=dealii-svn.git Fix comments. git-svn-id: https://svn.dealii.org/trunk@20156 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-22/doc/results.dox b/deal.II/examples/step-22/doc/results.dox index b28426bd54..3162dda646 100644 --- a/deal.II/examples/step-22/doc/results.dox +++ b/deal.II/examples/step-22/doc/results.dox @@ -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.) diff --git a/deal.II/examples/step-22/step-22.cc b/deal.II/examples/step-22/step-22.cc index bc2d964377..739adad62f 100644 --- a/deal.II/examples/step-22/step-22.cc +++ b/deal.II/examples/step-22/step-22.cc @@ -700,14 +700,14 @@ void StokesProblem::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::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 void StokesProblem::assemble_system ()