diff --git a/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html b/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html
index af437ee9..22a73eaa 100644
--- a/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html
+++ b/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html
@@ -33,7 +33,7 @@
       classes</a>
 </h3></div></div></div>
 <div class="table">
-<a name="id585104"></a><p class="title"><b>Table&#160;1.3.&#160;Stepper Algorithms</b></p>
+<a name="id585035"></a><p class="title"><b>Table&#160;1.3.&#160;Stepper Algorithms</b></p>
 <div class="table-contents"><table class="table" summary="Stepper Algorithms">
 <colgroup>
 <col>
diff --git a/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html b/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html
index 2761c0dd..998b336a 100644
--- a/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html
+++ b/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html
@@ -914,10 +914,9 @@
 <p>
       </p>
 <p>
-        During the integration approximately 71 steps have been done. Comparing to
-        a classical Runge-Kutta solver this is a very good result. For example the
-        Dormand-Prince 5 method with step size control and dense output yields ca.
-        1531 steps.
+        During the integration 71 steps have been done. Comparing to a classical
+        Runge-Kutta solver this is a very good result. For example the Dormand-Prince
+        5 method with step size control and dense output yields 1531 steps.
       </p>
 <p>
         
diff --git a/libs/numeric/odeint/doc/html/index.html b/libs/numeric/odeint/doc/html/index.html
index febd208b..bd71b27b 100644
--- a/libs/numeric/odeint/doc/html/index.html
+++ b/libs/numeric/odeint/doc/html/index.html
@@ -93,7 +93,7 @@
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: March 31, 2011 at 16:36:47 GMT</small></p></td>
+<td align="left"><p><small>Last revised: March 31, 2011 at 17:46:07 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk b/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk
index 45583479..29410030 100644
--- a/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk
+++ b/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk
@@ -28,7 +28,7 @@ A well know solver for stiff systems is the so called Rosenbrock method. It has
 
 [integrate_stiff_system]
 
-During the integration approximately 71 steps have been done. Comparing to a classical Runge-Kutta solver this is a very good result. For example the Dormand-Prince 5 method with step size control and dense output yields ca. 1531 steps.
+During the integration 71 steps have been done. Comparing to a classical Runge-Kutta solver this is a very good result. For example the Dormand-Prince 5 method with step size control and dense output yields 1531 steps.
 
 [integrate_stiff_system_alternative]