diff --git a/doc/html/index.html b/doc/html/index.html
index 351ab73bc..ac3427006 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -127,7 +127,7 @@ This manual is also available in Last revised: November 12, 2019 at 09:19:07 GMT Last revised: December 18, 2019 at 12:08:00 GMT 1 2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F G H I L M N O P Q R S T U V W A B C D E F G H I L N O P R S T U V W 1 2 4 5 7 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
This documentation aims to use of the following naming and formatting conventions.
diff --git a/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html b/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html
index 66e99254c..c8323a80f 100644
--- a/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html
+++ b/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html
@@ -53,8 +53,8 @@
}} // namespaces
- The logistic distribution is a continuous probability distribution. It has
- two parameters - location and scale. The cumulative distribution function
+ The logistic distribution is a continuous probability distribution. It
+ has two parameters - location and scale. The cumulative distribution function
of the logistic distribution appears in logistic regression and feedforward
neural networks. Among other applications, United State Chess Federation
and FIDE use it to calculate chess ratings.
diff --git a/doc/html/math_toolkit/double_exponential/de_caveats.html b/doc/html/math_toolkit/double_exponential/de_caveats.html
index e5b9385f2..7224538c4 100644
--- a/doc/html/math_toolkit/double_exponential/de_caveats.html
+++ b/doc/html/math_toolkit/double_exponential/de_caveats.html
@@ -90,7 +90,7 @@
there for
Finally, some endpoint singularities are too strong to be handled by
diff --git a/doc/html/math_toolkit/float128/overloading.html b/doc/html/math_toolkit/float128/overloading.html
index 8685d3047..743e14760 100644
--- a/doc/html/math_toolkit/float128/overloading.html
+++ b/doc/html/math_toolkit/float128/overloading.html
@@ -67,7 +67,7 @@
argument first to
diff --git a/doc/html/math_toolkit/high_precision/use_multiprecision.html b/doc/html/math_toolkit/high_precision/use_multiprecision.html
index a3f2f13ce..05e009400 100644
--- a/doc/html/math_toolkit/high_precision/use_multiprecision.html
+++ b/doc/html/math_toolkit/high_precision/use_multiprecision.html
@@ -32,83 +32,6 @@
- The Boost.Multiprecision library can be used for computations requiring precision
- exceeding that of standard built-in types such as
- The number of decimal digits of precision is fixed at compile-time via template
- parameter.
-
- To use these floating-point types and Boost.Math
- collection of high-precision constants, we need some includes:
-
- So now we can demonstrate with some trivial calculations:
-
- Using
- By default, output would only show the standard 6 decimal digits, so set
- precision to show all 50 significant digits, including any trailing zeros.
-
- which outputs:
-
- We can also use __math_constants like π, guaranteed to be initialized with
- the very last bit of precision (Unit
- in the Last Place) for the floating-point type.
-
- which outputs
-
- The full source of this example is at big_seventh.cpp
-
This section contains internal utilities used by the library's implementation
- along with tools used in development and testing. These tools have limited
+ along with tools used in development and testing. These tools have limitied
documentation, but now have quite stable interfaces and may also be useful
outside Boost.Math.
-
+
diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html
index 3e8f64c37..3495c2244 100644
--- a/doc/html/indexes/s01.html
+++ b/doc/html/indexes/s01.html
@@ -24,7 +24,7 @@
a <<
0. On the other hand, the simple expedient
of breaking the integral into two domains: (a, 0) and (0, b) and integrating
- each separately using the tanh-sinh integrator, works just fine.
+ each seperately using the tanh-sinh integrator, works just fine.
tanh_sinh or equivalent methods, for example
@@ -140,7 +140,7 @@
There is an alternative, more complex method, which is applicable when we
are dealing with expressions which can be simplified by evaluating by logs.
Let's suppose that as in this case, all the area under the graph is infinitely
- close to zero, now imagine that we could expand that region out over a much
+ close to zero, now inagine that we could expand that region out over a much
larger range of abscissa values: that's exactly what happens if we perform
argument substitution, replacing x
by exp(-x) (note
diff --git a/doc/html/math_toolkit/double_exponential/de_overview.html b/doc/html/math_toolkit/double_exponential/de_overview.html
index e4dc13df5..caf6e122c 100644
--- a/doc/html/math_toolkit/double_exponential/de_overview.html
+++ b/doc/html/math_toolkit/double_exponential/de_overview.html
@@ -100,10 +100,10 @@
For example, the sinh_sinh
quadrature integrates over the entire real line, the tanh_sinh
over (-1, 1), and the exp_sinh
- over (0, ∞). The latter integrators also have auxiliary ranges which are
- handled via a change of variables on the function being integrated, so that
- the tanh_sinh can handle
- integration over (a, b), and exp_sinh
+ over (0, ∞). The latter integrators also have auxiliary ranges which are handled
+ via a change of variables on the function being integrated, so that the
+ tanh_sinh can handle integration
+ over (a, b), and exp_sinh
over /(a, ∞) and(-∞, b)/.
long double,
then to double, then to float; the compilation fails because the result
is ambiguous. However the compiler error message will appear cruelly inscrutable,
- at an apparently irelevant line number and making no mention of float128: the word ambiguous
+ at an apparently irrelevant line number and making no mention of float128: the word ambiguous
is the clue to what is wrong.
- Using
- Boost.Multiprecision
-cpp_float
- types for numerical calculations with higher precision than built-in long double.
- float,
- double and long
- double. For extended-precision calculations,
- Boost.Multiprecision supplies several template data types called cpp_bin_float_.
- #include <boost/math/constants/constants.hpp>
-
-#include <boost/multiprecision/cpp_bin_float.hpp>
-// that includes some predefined typedefs that can be used thus:
-// using boost::multiprecision::cpp_bin_float_quad;
-// using boost::multiprecision::cpp_bin_float_50;
-// using boost::multiprecision::cpp_bin_float_100;
-
-#include <iostream>
-#include <limits>
-#include <type_traits>
-
-typedef cpp_bin_float_50
- hides the complexity of multiprecision, allows us to define variables with
- 50 decimal digit precision just like built-in double.
- using boost::multiprecision::cpp_bin_float_50;
-
-cpp_bin_float_50 seventh = cpp_bin_float_50(1) / 7; // 1 / 7
-
-std::cout.precision(std::numeric_limits<cpp_bin_float_50>::digits10);
-std::cout << std::showpoint << std::endl; // Append any trailing zeros.
-std::cout << seventh << std::endl;
-
-0.14285714285714285714285714285714285714285714285714
-
-std::cout << "pi = " << boost::math::constants::pi<cpp_bin_float_50>() << std::endl;
-cpp_bin_float_50 circumference = boost::math::constants::pi<cpp_bin_float_50>() * 2 * seventh;
-std::cout << "c = " << circumference << std::endl;
-
-pi = 3.1415926535897932384626433832795028841971693993751
-
-c = 0.89759790102565521098932668093700082405633411410717
-
-
-
Using
Boost.Multiprecision to generate a high-precision array of sine coefficents
for use with FFT.
diff --git a/doc/html/math_toolkit/internals_overview.html b/doc/html/math_toolkit/internals_overview.html
index 9253a8531..028fca7a5 100644
--- a/doc/html/math_toolkit/internals_overview.html
+++ b/doc/html/math_toolkit/internals_overview.html
@@ -28,7 +28,7 @@
Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/next_float/ulp.html b/doc/html/math_toolkit/next_float/ulp.html index 446057177..52c2f2f92 100644 --- a/doc/html/math_toolkit/next_float/ulp.html +++ b/doc/html/math_toolkit/next_float/ulp.html @@ -91,7 +91,7 @@
u
+ The function is asymetrical, which is to say, given u
= ulp(x) if x
> 0
then x +
diff --git a/doc/html/math_toolkit/root_comparison/elliptic_comparison.html b/doc/html/math_toolkit/root_comparison/elliptic_comparison.html
index 9b15c1a3d..fd5513e37 100644
--- a/doc/html/math_toolkit/root_comparison/elliptic_comparison.html
+++ b/doc/html/math_toolkit/root_comparison/elliptic_comparison.html
@@ -39,7 +39,7 @@
4xE(sqrt(1 - 282 / x2)) - 300 = 0
- In each case the target accuracy was set using our "recommended"
+ In each case the target accuracy was set using our "recomended"
accuracy limits (or at least limits that make a good starting point - which
is likely to give close to full accuracy without resorting to unnecessary
iterations).
diff --git a/doc/html/math_toolkit/root_comparison/root_n_comparison.html b/doc/html/math_toolkit/root_comparison/root_n_comparison.html
index 9d530f6fe..843991d65 100644
--- a/doc/html/math_toolkit/root_comparison/root_n_comparison.html
+++ b/doc/html/math_toolkit/root_comparison/root_n_comparison.html
@@ -33,7 +33,7 @@
types, float, double, long
double and a Boost.Multiprecision
type cpp_bin_float_50. In
- each case the target accuracy was set using our "recommended" accuracy
+ each case the target accuracy was set using our "recomended" accuracy
limits (or at least limits that make a good starting point - which is likely
to give close to full accuracy without resorting to unnecessary iterations).
diff --git a/doc/html/math_toolkit/root_finding_examples/elliptic_eg.html b/doc/html/math_toolkit/root_finding_examples/elliptic_eg.html
index 5a5b43495..4add09d6e 100644
--- a/doc/html/math_toolkit/root_finding_examples/elliptic_eg.html
+++ b/doc/html/math_toolkit/root_finding_examples/elliptic_eg.html
@@ -104,10 +104,10 @@
This function generally finds the root within 8-10 iterations, so given that
- the runtime is completely dominated by the cost of calling the elliptic
- integral it would be nice to reduce that count somewhat. We'll try to do
- that by using a derivative-based method; the derivatives of this function
- are rather hard to work out by hand, but fortunately Wolfram
+ the runtime is completely dominated by the cost of calling the elliptic integral
+ it would be nice to reduce that count somewhat. We'll try to do that by using
+ a derivative-based method; the derivatives of this function are rather hard
+ to work out by hand, but fortunately Wolfram
Alpha can do the grunt work for us to give:
d/da L(a, b) = 4(a2E(k) - b2K(k)) / (a2 - b2)
diff --git a/doc/html/math_toolkit/root_finding_examples/multiprecision_root.html b/doc/html/math_toolkit/root_finding_examples/multiprecision_root.html
index 22b18e67f..06b46de87 100644
--- a/doc/html/math_toolkit/root_finding_examples/multiprecision_root.html
+++ b/doc/html/math_toolkit/root_finding_examples/multiprecision_root.html
@@ -194,7 +194,7 @@
r = cbrt_2deriv(static_cast<cpp_dec_float_50>(2.)); // Passing a cpp_dec_float_50,
// so will compute a cpp_dec_float_50 precision result.
std::cout << "cbrt(" << two << ") = " << r << std::endl;
-r = cbrt_2deriv<cpp_dec_float_50>(2.); // Explictly a cpp_dec_float_50, so will compute a cpp_dec_float_50 precision result.
+r = cbrt_2deriv<cpp_dec_float_50>(2.); // Explicitly a cpp_dec_float_50, so will compute a cpp_dec_float_50 precision result.
std::cout << "cbrt(" << two << ") = " << r << std::endl;
// cpp_dec_float_50 1.2599210498948731647672106072782283505702514647015
diff --git a/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html b/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html
index e933604cb..2dabdacd6 100644
--- a/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html
+++ b/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html
@@ -107,9 +107,9 @@
The Legendre-Stieltjes polynomials do not satisfy three-term recurrence relations
- or have a particularly simple representation. Hence the constructor call determines
- what, in fact, the polynomial is. Once the constructor comes back, the polynomial
- can be evaluated via the Legendre series.
+ or have a particularly simple representation. Hence the constructor call
+ determines what, in fact, the polynomial is. Once the constructor comes back,
+ the polynomial can be evaluated via the Legendre series.
Example usage: