boost/odeint
2
0
Fork 0
mirror of https://github.com/boostorg/odeint.git synced 2026-01-26 18:52:20 +00:00
Code Issues Projects Releases Wiki Activity

documentation

Browse Source
This commit is contained in:
karsten
2011-03-31 16:46:45 +00:00
parent d5639662e6
commit 68d24fece1
4 changed files with 6 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/reference.html
View File

@@ -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>

7
libs/numeric/odeint/doc/html/boost_sandbox_numeric_odeint/tutorial.html
View File

@@ -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>

2
libs/numeric/odeint/doc/html/index.html
View File

@@ -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>

2
libs/numeric/odeint/doc/tutorial_stiff_systems.qbk
View File

@@ -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]