From: bangerth Date: Thu, 11 Feb 2010 16:58:34 +0000 (+0000) Subject: Escape a word. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=361decd2847c4fbeab8f5a0a7df0cef9c53c1478;p=dealii-svn.git Escape a word. git-svn-id: https://svn.dealii.org/trunk@20557 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-16/doc/results.dox b/deal.II/examples/step-16/doc/results.dox index 94a2117995..a53b9a0db4 100644 --- a/deal.II/examples/step-16/doc/results.dox +++ b/deal.II/examples/step-16/doc/results.dox @@ -90,7 +90,7 @@ how this can be avoided by working with matrix-free methods. Another avenue would be to use algebraic multigrid methods. The geometric multigrid method used here can at times be a bit awkward to implement because it needs all those additional data structures, and -it becomes even more difficult if the program is to run in parallel on +it becomes even more difficult if the program is to run in %parallel on machines coupled through MPI, for example. In that case, it would be simpler if one could use a black-box preconditioner that uses some sort of multigrid hierarchy for good performance but can figure out