|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r70789 - in sandbox/odeint/branches/karsten/libs/numeric/odeint/doc: . html html/boost_sandbox_numeric_odeint
From: karsten.ahnert_at_[hidden]
Date: 2011-03-31 12:46:46
Author: karsten
Date: 2011-03-31 12:46:45 EDT (Thu, 31 Mar 2011)
New Revision: 70789
URL: http://svn.boost.org/trac/boost/changeset/70789
Log:
documentation
Text files modified:
sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html | 2 +-
sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html | 7 +++----
sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/index.html | 2 +-
sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk | 2 +-
4 files changed, 6 insertions(+), 7 deletions(-)
Modified: sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html
==============================================================================
--- sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html (original)
+++ sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html 2011-03-31 12:46:45 EDT (Thu, 31 Mar 2011)
@@ -33,7 +33,7 @@
classes</a>
</h3></div></div></div>
<div class="table">
-<a name="id585104"></a><p class="title"><b>Table 1.3. Stepper Algorithms</b></p>
+<a name="id585035"></a><p class="title"><b>Table 1.3. Stepper Algorithms</b></p>
<div class="table-contents"><table class="table" summary="Stepper Algorithms">
<colgroup>
<col>
Modified: sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html
==============================================================================
--- sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html (original)
+++ sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html 2011-03-31 12:46:45 EDT (Thu, 31 Mar 2011)
@@ -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>
Modified: sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/index.html
==============================================================================
--- sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/index.html (original)
+++ sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/html/index.html 2011-03-31 12:46:45 EDT (Thu, 31 Mar 2011)
@@ -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>
Modified: sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk
==============================================================================
--- sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk (original)
+++ sandbox/odeint/branches/karsten/libs/numeric/odeint/doc/tutorial_stiff_systems.qbk 2011-03-31 12:46:45 EDT (Thu, 31 Mar 2011)
@@ -28,7 +28,7 @@
[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]
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk