From: Wolfgang Bangerth <bangerth@colostate.edu>
Date: Mon, 29 Mar 2021 17:16:58 +0000 (-0600)
Subject: Unify the spelling of a section name in the tutorial programs.
X-Git-Tag: v9.3.0-rc1~259^2
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=f3a95336493a3a23a5c6852a1978e6eec1c3bcd4;p=dealii.git

Unify the spelling of a section name in the tutorial programs.

We use 'Possibilities for extensions' in about 40 existing tutorial programs. Use the
same heading in about a dozen others.
---

diff --git a/examples/step-1/doc/results.dox b/examples/step-1/doc/results.dox
index 83776a2c26..c9f893a650 100644
--- a/examples/step-1/doc/results.dox
+++ b/examples/step-1/doc/results.dox
@@ -32,7 +32,7 @@ has found its way into the literature: see @cite Mu05. Apparently it is
 good for some things at least.)
 
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 <h4> Different adaptive refinement strategies </h4>
 
diff --git a/examples/step-16/doc/results.dox b/examples/step-16/doc/results.dox
index 004d6d512a..962560ab34 100644
--- a/examples/step-16/doc/results.dox
+++ b/examples/step-16/doc/results.dox
@@ -57,7 +57,7 @@ obviously in part due to the simple nature of the problem solved, but
 it shows the power of multigrid methods.
 
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 
 We encourage you to generate timings for the solve() call and compare to
diff --git a/examples/step-18/doc/results.dox b/examples/step-18/doc/results.dox
index 28f9c16dcb..4d0f61e8cb 100644
--- a/examples/step-18/doc/results.dox
+++ b/examples/step-18/doc/results.dox
@@ -404,7 +404,7 @@ Without such a formulation we cannot expect anything to make physical sense,
 even if it produces nice pictures!
 
 
-<h3>Possible directions for extensions</h3>
+<h3>Possibilities for extensions</h3>
 
 The program as is does not really solve an equation that has many applications
 in practice: quasi-static material deformation based on a purely elastic law
diff --git a/examples/step-2/doc/results.dox b/examples/step-2/doc/results.dox
index 3f2f7542b8..6fa3556c2a 100644
--- a/examples/step-2/doc/results.dox
+++ b/examples/step-2/doc/results.dox
@@ -26,7 +26,7 @@ nonzero entries is the same in both pictures, of course.
 
 
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 Just as with step-1, you may want to play with the program a bit to
 familiarize yourself with deal.II. For example, in the
diff --git a/examples/step-22/doc/results.dox b/examples/step-22/doc/results.dox
index af3677b7dc..5fcd81f425 100644
--- a/examples/step-22/doc/results.dox
+++ b/examples/step-22/doc/results.dox
@@ -278,7 +278,7 @@ is not a good choice in 3D - a full decomposition needs many new entries that
 
 
 
-<h3>Possible Extensions</h3>
+<h3>Possibilities for extensions</h3>
 
 <a name="improved-solver">
 <h4>Improved linear solver in 3D</h4>
diff --git a/examples/step-31/doc/results.dox b/examples/step-31/doc/results.dox
index 6f16187468..e2d8a0307a 100644
--- a/examples/step-31/doc/results.dox
+++ b/examples/step-31/doc/results.dox
@@ -585,7 +585,7 @@ more accurate; the program therefore uses these higher order elements,
 despite the penalty we pay in terms of smaller time steps.
 
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 There are various ways to extend the current program. Of particular interest
 is, of course, to make it faster and/or increase the resolution of the
diff --git a/examples/step-35/doc/results.dox b/examples/step-35/doc/results.dox
index 5cb50255c0..9d8ea02f78 100644
--- a/examples/step-35/doc/results.dox
+++ b/examples/step-35/doc/results.dox
@@ -131,7 +131,7 @@ resolutions, as described below.
 
 
 <a name="extensions"></a>
-<h3> Possible Extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 This program can be extended in the following directions:
 <ul>
diff --git a/examples/step-49/doc/results.dox b/examples/step-49/doc/results.dox
index afad983094..27ae172399 100644
--- a/examples/step-49/doc/results.dox
+++ b/examples/step-49/doc/results.dox
@@ -334,7 +334,7 @@ the nice detail of the boundary fitted mesh if we refine two more times:
      alt="" width="400" height="355">
 
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 <h4> Assigning different boundary ids </h4>
 
diff --git a/examples/step-50/doc/results.dox b/examples/step-50/doc/results.dox
index 91148a04b4..64a5b1095b 100644
--- a/examples/step-50/doc/results.dox
+++ b/examples/step-50/doc/results.dox
@@ -266,7 +266,7 @@ same problem on the same number of processors in about one eighth the
 time.
 
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 <h4> Testing convergence and higher order elements </h4>
 
diff --git a/examples/step-56/doc/results.dox b/examples/step-56/doc/results.dox
index e733a4c269..1a152ed4e5 100644
--- a/examples/step-56/doc/results.dox
+++ b/examples/step-56/doc/results.dox
@@ -189,7 +189,7 @@ solve time.
 4. GMG needs slightly more memory than ILU to store the level and interface
 matrices.
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 <h4> Check higher order discretizations </h4>
 
diff --git a/examples/step-64/doc/results.dox b/examples/step-64/doc/results.dox
index b622aa0eae..e92e1053c8 100644
--- a/examples/step-64/doc/results.dox
+++ b/examples/step-64/doc/results.dox
@@ -43,7 +43,7 @@ using a better preconditioner than the identity matrix we have used here.
 
 
 <a name="extensions"></a>
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 Currently, this program uses no preconditioner at all. This is mainly
 since constructing an efficient matrix-free preconditioner is
diff --git a/examples/step-7/doc/results.dox b/examples/step-7/doc/results.dox
index 7c8caa4829..b4b756b5ce 100644
--- a/examples/step-7/doc/results.dox
+++ b/examples/step-7/doc/results.dox
@@ -260,7 +260,7 @@ norms into one global norm as we already do in the program, by calling
 
 
 
-<h3> Possible extensions </h3>
+<h3> Possibilities for extensions </h3>
 
 <h4> Higher Order Elements </h4>