From 26dd119ccb58e68e6a10ae0f84229a81d6600baf Mon Sep 17 00:00:00 2001 From: bangerth Date: Sat, 13 Feb 2010 17:55:27 +0000 Subject: [PATCH] Escape a word. git-svn-id: https://svn.dealii.org/trunk@20604 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/examples/step-5/doc/intro.dox | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/deal.II/examples/step-5/doc/intro.dox b/deal.II/examples/step-5/doc/intro.dox index 43e24bfd97..251d677560 100644 --- a/deal.II/examples/step-5/doc/intro.dox +++ b/deal.II/examples/step-5/doc/intro.dox @@ -16,7 +16,7 @@ them are: algorithms where iterative solution on successively refined grids is at the heart of algorithms. Although adaptive grids are not used in this example, the foundations for them is laid - here. + here.
  • In practical applications, the domains are often subdivided into triangulations by automatic mesh generators. In order to use them, it is important to read coarse grids from a file. In @@ -28,7 +28,7 @@ them are:
  • On the other side, finite element programs tend to be rather complex, so debugging is an important aspect. We support safe programming by using assertions that check the validity of - parameters and internal states in a debug mode, but are removed + parameters and %internal states in a debug mode, but are removed in optimized mode.
  • Regarding the mathematical side, we show how to support a variable coefficient in the elliptic operator and how to use -- 2.39.5