Description: b0rken links
This patch fixes some broken links in the documentation.
.
cain (1.9-2) unstable; urgency=low
.
* changed the partitioning of the package
Author: Ivo Maintz
Bug-Ubuntu: https://bugs.launchpad.net/bugs/1032304
Last-Update: Fri, 10 Aug 2012 11:40:11 +0200
--- a/help/UserSolvers.htm
+++ b/help/UserSolvers.htm
@@ -221,14 +221,14 @@ The methods that require exponential dev
is generated by a linear search on the groups followed by selecting
a reaction within a group with the method of rejection.
This solver implements a slightly modified version of the composition
- rejection method presented in [Slepoy 2008].
+ rejection method presented in [Slepoy 2008].
`Binary search, full CMF`
- Generate O(log *M*). Modify O(*M*).
The cumulative mass function (CMF) is stored in an array. This allows
one to generate a discrete deviate with a binary search on that array.
At each time step the CMF is regenerated. This is an implementation
- of the logarithmic direct method [Li 2006].
+ of the logarithmic direct method [Li 2006].
`Binary search, sorted CMF`
- Generate O(log *M*). Modify O(*M*).
@@ -244,7 +244,7 @@ The methods that require exponential dev
- Generate O(log *M*). Modify O(log *M*).
Instead of storing the full CMF, a partial, recursive CMF is used.
This approach is equivalent to the method presented in
- [Gibson 2000]. A deviate can be generated
+ [Gibson 2000]. A deviate can be generated
with a binary search. Modifying a propensity affects at most
log_{2} *M* elements of the partial, recursive CMF.