boost/math
2
0
Fork 0
mirror of https://github.com/boostorg/math.git synced 2026-01-19 04:22:09 +00:00
Code Issues Projects Releases Wiki Activity

Fix typos in docs.

Browse Source
This commit is contained in:
jzmaddock
2016-08-20 09:52:46 +01:00
parent bdef7e8cc8
commit e7f92a3d65
5 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/distributions/logistic.qbk
View File

@@ -74,7 +74,7 @@ and the `std::log` functions, so its accuracy is related to the
accurate implementations of those functions on a given platform.
When calculating the quantile with a non-zero /position/ parameter
catastrophic cancellation errors can occur:
in such cases, only a low /absolute error/ can be guarenteed.
in such cases, only a low /absolute error/ can be guaranteed.
[h4 Implementation]

2
doc/roots/root_comparison.qbk
View File

@@ -241,7 +241,7 @@ when obtaining the derivative than when not. Consequently there is very little
from a derivative free method, to Newton iteration. However, once you've calculated the first derivative
the second comes almost for free, consequently the third order methods (Halley) does much the best.
* Of the two second order methods, Halley does best as would be expected: the Schroder method offers better
guarentees of ['quadratic] convergence, while Halley relies on a smooth function with a single root to
guarantees of ['quadratic] convergence, while Halley relies on a smooth function with a single root to
give ['cubic] convergence. It's not entirely clear why Schroder iteration often does worse than Newton.
[endsect][/section:elliptic_comparison Comparison of Elliptic Integral Root Finding Algoritghms]

4
doc/sf/hermite.qbk
View File

@@ -93,8 +93,8 @@ used: the test data was computed using
[h4 Implementation]
These functions are implemented using the stable three term
recurrence relations. These relations guarentee low absolute error
but cannot guarentee low relative error near one of the roots of the
recurrence relations. These relations guarantee low absolute error
but cannot guarantee low relative error near one of the roots of the
polynomials.
[endsect][/section:beta_function The Beta Function]

4
doc/sf/laguerre.qbk
View File

@@ -145,8 +145,8 @@ used: the test data was computed using
[h4 Implementation]
These functions are implemented using the stable three term
recurrence relations. These relations guarentee low absolute error
but cannot guarentee low relative error near one of the roots of the
recurrence relations. These relations guarantee low absolute error
but cannot guarantee low relative error near one of the roots of the
polynomials.
[endsect][/section:beta_function The Beta Function]

4
doc/sf/legendre.qbk
View File

@@ -214,8 +214,8 @@ used: the test data was computed using
[h4 Implementation]
These functions are implemented using the stable three term
recurrence relations. These relations guarentee low absolute error
but cannot guarentee low relative error near one of the roots of the
recurrence relations. These relations guarantee low absolute error
but cannot guarantee low relative error near one of the roots of the
polynomials.
[endsect][/section:beta_function The Beta Function]