From bb6ad166a7b5502e2cdb34700715267e0a0cc39d Mon Sep 17 00:00:00 2001
From: hartmann <hartmann@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Tue, 20 Apr 2004 07:34:39 +0000
Subject: [PATCH] Small fix.

git-svn-id: https://svn.dealii.org/trunk@9068 0785d39b-7218-0410-832d-ea1e28bc413d
---
 .../tutorial/chapter-2.step-by-step/step-14.data/results.html   | 2 +-
 .../doc/tutorial/chapter-2.step-by-step/step-15.data/intro.html | 2 +-
 .../doc/tutorial/chapter-2.step-by-step/step-15.data/intro.tex  | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/step-14.data/results.html b/deal.II/doc/tutorial/chapter-2.step-by-step/step-14.data/results.html
index a6983fbffd..85d13aedd1 100644
--- a/deal.II/doc/tutorial/chapter-2.step-by-step/step-14.data/results.html
+++ b/deal.II/doc/tutorial/chapter-2.step-by-step/step-14.data/results.html
@@ -144,7 +144,7 @@ The program prints the point value and the estimated error in this
 quantity. From extrapolating it, we can guess that the exact value is
 somewhat like 0.0334473, plus or minus 0.0000001 (note that we get
 almost 6 valid digits from only 22,000 (primal) degrees of
-freedom. This number cannot be obtaint from the value of the
+freedom. This number cannot be obtained from the value of the
 functional alone, but I have used the assumption that the error
 estimator is mostly exact, and extrapolated the computed value plus
 the estimated error, to get an approximation of the true
diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.html b/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.html
index f35bfbe7a6..7abd38213e 100644
--- a/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.html
+++ b/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.html
@@ -496,7 +496,7 @@ case at <!-- MATH
 , but
 possibly at other places as well.  However, for finite elements, we will want
 to have the equation in weak form anyway.  Since the equation is still
-nonlinear, one may be tempted to we compute iterates
+nonlinear, one may be tempted to compute iterates
 <!-- MATH
  $u_{k+1}=u_k+\alpha_k\delta u_k$
  -->
diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.tex b/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.tex
index 6d90c2ac7a..4d712e5f54 100644
--- a/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.tex
+++ b/deal.II/doc/tutorial/chapter-2.step-by-step/step-15.data/intro.tex
@@ -163,7 +163,7 @@ Note that this equation degenerates wherever $u^3=x$, which is at least the
 case at $x\in\{0,1\}$ due to the prescribed boundary values for $u$, but
 possibly at other places as well.  However, for finite elements, we will want
 to have the equation in weak form anyway.  Since the equation is still
-nonlinear, one may be tempted to we compute iterates
+nonlinear, one may be tempted to compute iterates
 $u_{k+1}=u_k+\alpha_k\delta u_k$ using a Newton method for updates $\delta
 u_k$, like in
 \begin{equation*}
-- 
2.39.5