diff --git a/doc/background/references.qbk b/doc/background/references.qbk
index 86f1a5eaf..f66afcb2b 100644
--- a/doc/background/references.qbk
+++ b/doc/background/references.qbk
@@ -82,7 +82,7 @@ John F Hart, Computer Approximations, (1978) ISBN 0 088275 642-7.
William J Cody, Software Manual for the Elementary Functions, Prentice-Hall (1980) ISBN 0138220646.
-Nico Temme, Special Functions, An Introduction to the Classical Functions of Mathematical Physics, Wiley, ISBN: 0471-11313-1 (1996) who also gave valueable advice.
+Nico Temme, Special Functions, An Introduction to the Classical Functions of Mathematical Physics, Wiley, ISBN: 0471-11313-1 (1996) who also gave valuable advice.
[@http://www.cas.lancs.ac.uk/glossary_v1.1/prob.html#probdistn Statistics Glossary], Valerie Easton and John H. McColl.
diff --git a/doc/background/remez.qbk b/doc/background/remez.qbk
index e4d5fefae..d856f62c4 100644
--- a/doc/background/remez.qbk
+++ b/doc/background/remez.qbk
@@ -88,7 +88,7 @@ Which has a peak relative error of 1.2x10[super -3].
While this is a pretty good approximation already, judging by the
shape of the error function we can clearly do better. Before starting
-on the Remez method propper, we have one more step to perform: locate
+on the Remez method proper, we have one more step to perform: locate
all the extrema of the error function, and store
these locations as our initial ['Chebyshev control points].
diff --git a/doc/background/special_tut.qbk b/doc/background/special_tut.qbk
index 2aaf48648..56b153d1f 100644
--- a/doc/background/special_tut.qbk
+++ b/doc/background/special_tut.qbk
@@ -441,7 +441,7 @@ the particular tests plus the platform and compiler:
[h4 Testing Multiprecision Types]
Testing of multiprecision types is handled by the test drivers in libs/multiprecision/test/math,
-please refer to these for examples. Note that these tests are run only occationally as they take
+please refer to these for examples. Note that these tests are run only occasionally as they take
a lot of CPU cycles to build and run.
[h4 Improving Compile Times]
diff --git a/doc/constants/constants.qbk b/doc/constants/constants.qbk
index b35922326..2d40e536a 100644
--- a/doc/constants/constants.qbk
+++ b/doc/constants/constants.qbk
@@ -733,7 +733,7 @@ and CALC100 100 decimal digit Complex Variable Calculator Program, a DOS utility
Not here in this Boost.Math collection, because physical constants:
-* Are measurements, not truely constants.
+* Are measurements, not truly constants.
* Are not truly constant and keeping changing as mensuration technology improves.
* Have a instrinsic uncertainty.
* Mathematical constants are stored and represented at varying precision, but should never be inaccurate.
diff --git a/doc/distexplorer/Jamfile.v2 b/doc/distexplorer/Jamfile.v2
index f31892585..a4edb5cfd 100644
--- a/doc/distexplorer/Jamfile.v2
+++ b/doc/distexplorer/Jamfile.v2
@@ -16,7 +16,7 @@ using quickbook ;
#path-constant images_location : html ;
# location of SVG images referenced by Quickbook.
-# screenshots installed as recomended by Sourceforge.
+# screenshots installed as recommended by Sourceforge.
xml distexplorer
:
diff --git a/doc/distexplorer/distexplorer.qbk b/doc/distexplorer/distexplorer.qbk
index 7dbe951bb..270e64cdd 100644
--- a/doc/distexplorer/distexplorer.qbk
+++ b/doc/distexplorer/distexplorer.qbk
@@ -63,7 +63,7 @@ and are tab separated to assist input to other programs,
for example, spreadsheets or text editors.
Note: Excel (for example), only shows 10 decimal digits, by default:
-to display the maximum possible precision (abotu 15 decimal digits),
+to display the maximum possible precision (about 15 decimal digits),
it is necessary to format all cells to display this precision.
Although unusually accurate, not all values computed by Distexplorer will be as accurate as this.
Values shown as NaN cannot be calculated from the value(s) given,
diff --git a/doc/distexplorer/html/index.html b/doc/distexplorer/html/index.html
index 3c5379970..2fcd5c74a 100644
--- a/doc/distexplorer/html/index.html
+++ b/doc/distexplorer/html/index.html
@@ -164,7 +164,7 @@
Note: Excel (for example), only shows 10 decimal digits, by default: to display
- the maximum possible precision (abotu 15 decimal digits), it is necessary to
+ the maximum possible precision (about 15 decimal digits), it is necessary to
format all cells to display this precision. Although unusually accurate, not
all values computed by Distexplorer will be as accurate as this. Values shown
as NaN cannot be calculated from the value(s) given, most commonly because the
diff --git a/doc/distributions/logistic.qbk b/doc/distributions/logistic.qbk
index d6d21a0ec..0a22b48d4 100644
--- a/doc/distributions/logistic.qbk
+++ b/doc/distributions/logistic.qbk
@@ -26,7 +26,7 @@
}} // namespaces
-The logistic distribution is a continous probability distribution.
+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,
diff --git a/doc/distributions/nc_t.qbk b/doc/distributions/nc_t.qbk
index 16e84f94d..9317ed8ba 100644
--- a/doc/distributions/nc_t.qbk
+++ b/doc/distributions/nc_t.qbk
@@ -109,7 +109,7 @@ Denise Benton, K. Krishnamoorthy,
Computational Statistics & Data Analysis 43 (2003) 249-267.
Accuracy checks use test data computed with this
-implementation and arbitary precision interval arithmetic:
+implementation and arbitrary precision interval arithmetic:
this test data is believed to be accurate to at least 50
decimal places.
diff --git a/doc/fp_utilities/float_next.qbk b/doc/fp_utilities/float_next.qbk
index a3daa8541..a672d2e67 100644
--- a/doc/fp_utilities/float_next.qbk
+++ b/doc/fp_utilities/float_next.qbk
@@ -265,7 +265,7 @@ may ['sometimes] support denormals (as signalled by `std::numeric_limits::h
currently enabled at runtime (for example on SSE hardware, the DAZ or FTZ flags will disable denormal support).
In this situation, the `ulp` function may return a value that is many orders of magnitude too large.
-In light of the issues above, we recomend that:
+In light of the issues above, we recommend that:
* To move between adjacent floating-point values always use __float_next, __float_prior or __nextafter (`std::nextafter`
is another candidate, but our experience is that this also often breaks depending which optimizations and
diff --git a/doc/fp_utilities/fp_facets.qbk b/doc/fp_utilities/fp_facets.qbk
index 33e9c8076..5323537ff 100644
--- a/doc/fp_utilities/fp_facets.qbk
+++ b/doc/fp_utilities/fp_facets.qbk
@@ -401,7 +401,7 @@ previous versions of `lexical_cast` using stringstream were not portable
Although other examples imbue individual streams with the new locale,
for the streams constructed inside lexical_cast,
-it was necesary to assign to a global locale.
+it was necessary to assign to a global locale.
locale::global(new_locale);
diff --git a/doc/html/math_toolkit/barycentric.html b/doc/html/math_toolkit/barycentric.html
index adb818b79..473115d67 100644
--- a/doc/html/math_toolkit/barycentric.html
+++ b/doc/html/math_toolkit/barycentric.html
@@ -189,7 +189,7 @@
int main()
{
-
+
std::map<double, double> r;
r[0.02] = 5.727;
diff --git a/doc/html/math_toolkit/bessel/bessel_first.html b/doc/html/math_toolkit/bessel/bessel_first.html
index 552120268..8da54f43f 100644
--- a/doc/html/math_toolkit/bessel/bessel_first.html
+++ b/doc/html/math_toolkit/bessel/bessel_first.html
@@ -1356,7 +1356,7 @@
gk and hk
are also computed by recursions (involving gamma functions), but
- the formulas are a little complicated, readers are refered to N.M. Temme,
+ the formulas are a little complicated, readers are referred to N.M. Temme,
On the numerical evaluation of the ordinary Bessel function of
the second kind, Journal of Computational Physics, vol 21, 343
(1976). Note Temme's series converge only for |μ| <= 1/2.
diff --git a/doc/html/math_toolkit/constants_faq.html b/doc/html/math_toolkit/constants_faq.html
index f6efe1a85..addaac014 100644
--- a/doc/html/math_toolkit/constants_faq.html
+++ b/doc/html/math_toolkit/constants_faq.html
@@ -448,7 +448,7 @@
-
- Are measurements, not truely constants.
+ Are measurements, not truly constants.
-
Are not truly constant and keeping changing as mensuration technology improves.
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 6f64f8498..66e99254c 100644
--- a/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html
+++ b/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html
@@ -53,7 +53,7 @@
}}
- The logistic distribution is a continous probability distribution. It has
+ 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
diff --git a/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html b/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html
index 05b947ccd..51b28e38f 100644
--- a/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html
+++ b/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html
@@ -426,7 +426,7 @@
Computational Statistics & Data Analysis 43 (2003) 249-267.
- Accuracy checks use test data computed with this implementation and arbitary
+ Accuracy checks use test data computed with this implementation and arbitrary
precision interval arithmetic: this test data is believed to be accurate
to at least 50 decimal places.
diff --git a/doc/html/math_toolkit/double_exponential/de_caveats.html b/doc/html/math_toolkit/double_exponential/de_caveats.html
index 7224538c4..945e67254 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 a <<
0. On the other hand, the simple expedient
of breaking the integral into two domains: (a, 0) and (0, b) and integrating
- each seperately using the tanh-sinh integrator, works just fine.
+ each separately using the tanh-sinh integrator, works just fine.
Finally, some endpoint singularities are too strong to be handled by tanh_sinh or equivalent methods, for example
diff --git a/doc/html/math_toolkit/double_exponential/de_overview.html b/doc/html/math_toolkit/double_exponential/de_overview.html
index d2999c462..e4dc13df5 100644
--- a/doc/html/math_toolkit/double_exponential/de_overview.html
+++ b/doc/html/math_toolkit/double_exponential/de_overview.html
@@ -100,7 +100,7 @@
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 auxilliary ranges which are
+ 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
diff --git a/doc/html/math_toolkit/double_exponential/de_tanh_sinh.html b/doc/html/math_toolkit/double_exponential/de_tanh_sinh.html
index c378608fd..1b1a05302 100644
--- a/doc/html/math_toolkit/double_exponential/de_tanh_sinh.html
+++ b/doc/html/math_toolkit/double_exponential/de_tanh_sinh.html
@@ -340,7 +340,7 @@
- This is a truely horrible integral that oscillates wildly and unpredictably
+ This is a truly horrible integral that oscillates wildly and unpredictably
with some very sharp "spikes" in it's graph. The higher
number of levels used reflects the difficulty of sampling the more
extreme features.
diff --git a/doc/html/math_toolkit/ellint/ellint_intro.html b/doc/html/math_toolkit/ellint/ellint_intro.html
index 7c881ee3d..f374d186f 100644
--- a/doc/html/math_toolkit/ellint/ellint_intro.html
+++ b/doc/html/math_toolkit/ellint/ellint_intro.html
@@ -457,7 +457,7 @@
- The following references, while not directly relevent to our implementation,
+ The following references, while not directly relevant to our implementation,
may also be of interest:
diff --git a/doc/html/math_toolkit/factorials/sf_binomial.html b/doc/html/math_toolkit/factorials/sf_binomial.html
index 15e4e9654..068f5316b 100644
--- a/doc/html/math_toolkit/factorials/sf_binomial.html
+++ b/doc/html/math_toolkit/factorials/sf_binomial.html
@@ -70,7 +70,7 @@
boost::math::binomial_coefficient(10, 2);
- You will get a compiler error, ususally indicating that there is no such
+ You will get a compiler error, usually indicating that there is no such
function to be found. Instead you need to specifiy the return type explicity
and write:
diff --git a/doc/html/math_toolkit/factorials/sf_double_factorial.html b/doc/html/math_toolkit/factorials/sf_double_factorial.html
index e9a8a2c41..aad62ac5f 100644
--- a/doc/html/math_toolkit/factorials/sf_double_factorial.html
+++ b/doc/html/math_toolkit/factorials/sf_double_factorial.html
@@ -68,7 +68,7 @@
boost::math::double_factorial(2);
- You will get a (possibly perplexing) compiler error, ususally indicating
+ You will get a (possibly perplexing) compiler error, usually indicating
that there is no such function to be found. Instead you need to specifiy
the return type explicity and write:
diff --git a/doc/html/math_toolkit/factorials/sf_factorial.html b/doc/html/math_toolkit/factorials/sf_factorial.html
index c9471876d..80753935c 100644
--- a/doc/html/math_toolkit/factorials/sf_factorial.html
+++ b/doc/html/math_toolkit/factorials/sf_factorial.html
@@ -67,7 +67,7 @@
boost::math::factorial(2);
- You will get a (perhaps perplexing) compiler error, ususally indicating
+ You will get a (perhaps perplexing) compiler error, usually indicating
that there is no such function to be found. Instead you need to specify
the return type explicity and write:
diff --git a/doc/html/math_toolkit/fp_facets/examples.html b/doc/html/math_toolkit/fp_facets/examples.html
index 709480336..ade70a5a8 100644
--- a/doc/html/math_toolkit/fp_facets/examples.html
+++ b/doc/html/math_toolkit/fp_facets/examples.html
@@ -78,7 +78,7 @@
Although other examples imbue individual streams with the new locale, for
- the streams constructed inside lexical_cast, it was necesary to assign to
+ the streams constructed inside lexical_cast, it was necessary to assign to
a global locale.
locale::global(new_locale);
diff --git a/doc/html/math_toolkit/history1.html b/doc/html/math_toolkit/history1.html
index 0266644b2..625d361e3 100644
--- a/doc/html/math_toolkit/history1.html
+++ b/doc/html/math_toolkit/history1.html
@@ -931,7 +931,7 @@ by switching to use the Students t distribution (or Normal distribution
-
Refactored test data and some special function code to improve support
- for arbitary precision and/or expression-template-enabled types.
+ for arbitrary precision and/or expression-template-enabled types.
-
Added new faster zeta function evaluation method.
diff --git a/doc/html/math_toolkit/history2.html b/doc/html/math_toolkit/history2.html
index 9f0ff88bb..3a2b92dc4 100644
--- a/doc/html/math_toolkit/history2.html
+++ b/doc/html/math_toolkit/history2.html
@@ -931,7 +931,7 @@ by switching to use the Students t distribution (or Normal distribution
-
Refactored test data and some special function code to improve support
- for arbitary precision and/or expression-template-enabled types.
+ for arbitrary precision and/or expression-template-enabled types.
-
Added new faster zeta function evaluation method.
diff --git a/doc/html/math_toolkit/internals/test_data.html b/doc/html/math_toolkit/internals/test_data.html
index cdeb03574..40a7f7324 100644
--- a/doc/html/math_toolkit/internals/test_data.html
+++ b/doc/html/math_toolkit/internals/test_data.html
@@ -442,7 +442,7 @@
result_type operator()(T val)
{
using namespace boost::math::tools;
-
+
NTL::RR rval(val);
upper_incomplete_gamma_fract<NTL::RR> f1(rval, rval);
diff --git a/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html b/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html
index 0d0ac0d05..204f87fa2 100644
--- a/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html
+++ b/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html
@@ -28,7 +28,7 @@
Functions Overview
- The exponential funtion is defined, for all objects for which this makes
+ The exponential function is defined, for all objects for which this makes
sense, as the power series
diff --git a/doc/html/math_toolkit/issues.html b/doc/html/math_toolkit/issues.html
index b3444c794..a3e5e94ef 100644
--- a/doc/html/math_toolkit/issues.html
+++ b/doc/html/math_toolkit/issues.html
@@ -28,10 +28,10 @@
Predominantly this is a TODO list, or a list of possible future enhancements.
- Items labled "High Priority" effect the proper functioning of the
- component, and should be fixed as soon as possible. Items labled "Medium
+ Items labeled "High Priority" effect the proper functioning of the
+ component, and should be fixed as soon as possible. Items labeled "Medium
Priority" are desirable enhancements, often pertaining to the performance
- of the component, but do not effect it's accuracy or functionality. Items labled
+ of the component, but do not effect it's accuracy or functionality. Items labeled
"Low Priority" should probably be investigated at some point. Such
classifications are obviously highly subjective.
diff --git a/doc/html/math_toolkit/lambert_w.html b/doc/html/math_toolkit/lambert_w.html
index cf69cd66a..e742efa1e 100644
--- a/doc/html/math_toolkit/lambert_w.html
+++ b/doc/html/math_toolkit/lambert_w.html
@@ -1554,7 +1554,7 @@ if (f(w) / f'(wlong
double) types. Finally the functor is
called repeatedly to compute as many additional series terms as necessary to
- achive the desired precision, set from get_epsilon
+ achieve the desired precision, set from get_epsilon
(or terminated by evaluation_error
on reaching the set iteration limit max_series_iterations).
diff --git a/doc/html/math_toolkit/next_float/ulp.html b/doc/html/math_toolkit/next_float/ulp.html
index 8c7ff010f..52c2f2f92 100644
--- a/doc/html/math_toolkit/next_float/ulp.html
+++ b/doc/html/math_toolkit/next_float/ulp.html
@@ -117,7 +117,7 @@
- In light of the issues above, we recomend that:
+ In light of the issues above, we recommend that:
-
diff --git a/doc/html/math_toolkit/oct_tests.html b/doc/html/math_toolkit/oct_tests.html
index e15ee01e3..47786f6da 100644
--- a/doc/html/math_toolkit/oct_tests.html
+++ b/doc/html/math_toolkit/oct_tests.html
@@ -33,7 +33,7 @@
If you define the symbol BOOST_OCTONION_TEST_VERBOSE, you will get additional
output (verbose output); this
- will only be helpfull if you enable message output at the same time, of course
+ will only be helpful if you enable message output at the same time, of course
(by uncommenting the relevant line in the test or by adding --log_level=messages
to your command line,...). In that case, and if you are running interactively,
you may in addition define the symbol BOOST_INTERACTIVE_TEST_INPUT_ITERATOR
diff --git a/doc/html/math_toolkit/quat_tests.html b/doc/html/math_toolkit/quat_tests.html
index a59cfa9b0..eba7f301e 100644
--- a/doc/html/math_toolkit/quat_tests.html
+++ b/doc/html/math_toolkit/quat_tests.html
@@ -34,7 +34,7 @@
If you define the symbol TEST_VERBOSE, you will get additional output (verbose output); this will only
- be helpfull if you enable message output at the same time, of course (by uncommenting
+ be helpful if you enable message output at the same time, of course (by uncommenting
the relevant line in the test or by adding --log_level=messages
to your command line,...). In that case, and if you are running interactively,
you may in addition define the symbol BOOST_INTERACTIVE_TEST_INPUT_ITERATOR
diff --git a/doc/html/math_toolkit/refs.html b/doc/html/math_toolkit/refs.html
index 74b4d8659..8d0134f31 100644
--- a/doc/html/math_toolkit/refs.html
+++ b/doc/html/math_toolkit/refs.html
@@ -164,7 +164,7 @@
Nico Temme, Special Functions, An Introduction to the Classical Functions of
- Mathematical Physics, Wiley, ISBN: 0471-11313-1 (1996) who also gave valueable
+ Mathematical Physics, Wiley, ISBN: 0471-11313-1 (1996) who also gave valuable
advice.
diff --git a/doc/html/math_toolkit/remez.html b/doc/html/math_toolkit/remez.html
index 433a435dd..01517a562 100644
--- a/doc/html/math_toolkit/remez.html
+++ b/doc/html/math_toolkit/remez.html
@@ -149,7 +149,7 @@
While this is a pretty good approximation already, judging by the shape of
the error function we can clearly do better. Before starting on the Remez method
- propper, we have one more step to perform: locate all the extrema of the error
+ proper, we have one more step to perform: locate all the extrema of the error
function, and store these locations as our initial Chebyshev control
points.
diff --git a/doc/html/math_toolkit/root_comparison/elliptic_comparison.html b/doc/html/math_toolkit/root_comparison/elliptic_comparison.html
index fd5513e37..9b15c1a3d 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 "recomended"
+ In each case the target accuracy was set using our "recommended"
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 843991d65..9d530f6fe 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 "recomended" accuracy
+ each case the target accuracy was set using our "recommended" 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/roots_noderiv/bracket_solve.html b/doc/html/math_toolkit/roots_noderiv/bracket_solve.html
index 31897c3c8..51e85d436 100644
--- a/doc/html/math_toolkit/roots_noderiv/bracket_solve.html
+++ b/doc/html/math_toolkit/roots_noderiv/bracket_solve.html
@@ -67,7 +67,7 @@
guess.
-
- The value of the inital guess must have the same sign as the root: the
+ The value of the initial guess must have the same sign as the root: the
function will never cross the origin when searching
for the root.
diff --git a/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html b/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html
index f9c2cd4c6..e933604cb 100644
--- a/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html
+++ b/doc/html/math_toolkit/sf_poly/legendre_stieltjes.html
@@ -107,7 +107,7 @@
The Legendre-Stieltjes polynomials do not satisfy three-term recurrence relations
- or have a particulary simple representation. Hence the constructor call determines
+ 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.
diff --git a/doc/html/math_toolkit/special_tut/special_tut_test.html b/doc/html/math_toolkit/special_tut/special_tut_test.html
index 668b13c02..c9b641309 100644
--- a/doc/html/math_toolkit/special_tut/special_tut_test.html
+++ b/doc/html/math_toolkit/special_tut/special_tut_test.html
@@ -425,7 +425,7 @@
Testing of multiprecision types is handled by the test drivers in libs/multiprecision/test/math,
- please refer to these for examples. Note that these tests are run only occationally
+ please refer to these for examples. Note that these tests are run only occasionally
as they take a lot of CPU cycles to build and run.
diff --git a/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html b/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html
index 852ede185..c6afb7c9f 100644
--- a/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html
+++ b/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html
@@ -371,7 +371,7 @@
In real life, there will usually be more than one event (fault or success),
- when the negative binomial, which has the neccessary extra parameter, will
+ when the negative binomial, which has the necessary extra parameter, will
be needed.
diff --git a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html
index b6ad7ad00..e861b31e6 100644
--- a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html
+++ b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html
@@ -120,7 +120,7 @@
Selling five candy bars means getting five successes, so successes r
= 5. The total number of trials (n, in this case, houses visited) this
- takes is therefore = sucesses + failures or k + r = k + 5.
+ takes is therefore = successes + failures or k + r = k + 5.
double sales_quota = 5;
diff --git a/doc/html/math_toolkit/trans.html b/doc/html/math_toolkit/trans.html
index a0fcc0ede..17d716337 100644
--- a/doc/html/math_toolkit/trans.html
+++ b/doc/html/math_toolkit/trans.html
@@ -40,7 +40,7 @@
We do, however provide several transcendentals, chief among which is the exponential.
This author claims the complete proof of the "closed formula" as
- his own, as well as its independant invention (there are claims to prior invention
+ his own, as well as its independent invention (there are claims to prior invention
of the formula, such as one by Professor Shoemake, and it is possible that
the formula had been known a couple of centuries back, but in absence of bibliographical
reference, the matter is pending, awaiting further investigation; on the other
diff --git a/doc/internals/test_data.qbk b/doc/internals/test_data.qbk
index 99fa881a1..9811fceef 100644
--- a/doc/internals/test_data.qbk
+++ b/doc/internals/test_data.qbk
@@ -348,7 +348,7 @@ for each element in the tuple (in addition to the input parameters):
result_type operator()(T val)
{
using namespace boost::math::tools;
- // estimate the true value, using arbitary precision
+ // estimate the true value, using arbitrary precision
// arithmetic and NTL::RR:
NTL::RR rval(val);
upper_incomplete_gamma_fract f1(rval, rval);
diff --git a/doc/octonion/math-octonion.qbk b/doc/octonion/math-octonion.qbk
index 46d59562f..91fa423e0 100644
--- a/doc/octonion/math-octonion.qbk
+++ b/doc/octonion/math-octonion.qbk
@@ -931,7 +931,7 @@ test program tests octonions specialisations for float, double and long double
If you define the symbol BOOST_OCTONION_TEST_VERBOSE, you will get additional
output ([@../octonion/output_more.txt verbose output]); this will
-only be helpfull if you enable message output at the same time, of course
+only be helpful if you enable message output at the same time, of course
(by uncommenting the relevant line in the test or by adding --log_level=messages
to your command line,...). In that case, and if you are running interactively,
you may in addition define the symbol BOOST_INTERACTIVE_TEST_INPUT_ITERATOR to
diff --git a/doc/overview/issues.qbk b/doc/overview/issues.qbk
index 8c96b5641..8d6a3996c 100644
--- a/doc/overview/issues.qbk
+++ b/doc/overview/issues.qbk
@@ -1,12 +1,12 @@
[section:issues Known Issues, and TODO List]
Predominantly this is a TODO list, or a list of possible
-future enhancements. Items labled "High Priority" effect
+future enhancements. Items labelled, labeled "High Priority" effect
the proper functioning of the component, and should be fixed
-as soon as possible. Items labled "Medium Priority" are
+as soon as possible. Items labeled "Medium Priority" are
desirable enhancements, often pertaining to the performance
of the component, but do not effect it's accuracy or functionality.
-Items labled "Low Priority" should probably be investigated at
+Items labeled "Low Priority" should probably be investigated at
some point. Such classifications are obviously highly subjective.
If you don't see a component listed here, then we don't have any known
diff --git a/doc/overview/roadmap.qbk b/doc/overview/roadmap.qbk
index a7a8af710..da7e22300 100644
--- a/doc/overview/roadmap.qbk
+++ b/doc/overview/roadmap.qbk
@@ -333,7 +333,7 @@ So for example 128-bit rational approximations will work with UDT's and do the r
* Deprecated wrongly named `twothirds` math constant in favour of `two_thirds` (with underscore separator).
(issue [@https://svn.boost.org/trac/boost/ticket/6199 #6199]).
-* Refactored test data and some special function code to improve support for arbitary precision and/or expression-template-enabled types.
+* Refactored test data and some special function code to improve support for arbitrary precision and/or expression-template-enabled types.
* Added new faster zeta function evaluation method.
Fixed issues:
diff --git a/doc/roots/roots_without_derivatives.qbk b/doc/roots/roots_without_derivatives.qbk
index 698672864..eeaf2ae2d 100644
--- a/doc/roots/roots_without_derivatives.qbk
+++ b/doc/roots/roots_without_derivatives.qbk
@@ -249,7 +249,7 @@ brackets.
Note that this routine can only be used when:
* ['f(x)] is monotonic in the half of the real axis containing ['guess].
-* The value of the inital guess must have the same sign as the root: the function
+* The value of the initial guess must have the same sign as the root: the function
will ['never cross the origin] when searching for the root.
* The location of the root should be known at least approximately,
if the location of the root differs by many orders of magnitude
diff --git a/doc/sf/bessel_jy.qbk b/doc/sf/bessel_jy.qbk
index 5aa120f5e..1f43bc758 100644
--- a/doc/sf/bessel_jy.qbk
+++ b/doc/sf/bessel_jy.qbk
@@ -238,7 +238,7 @@ where
g[sub k] and h[sub k]
are also computed by recursions (involving gamma functions), but the
-formulas are a little complicated, readers are refered to
+formulas are a little complicated, readers are referred to
N.M. Temme, ['On the numerical evaluation of the ordinary Bessel function
of the second kind], Journal of Computational Physics, vol 21, 343 (1976).
Note Temme's series converge only for |[mu]| <= 1/2.
diff --git a/doc/sf/ellint_introduction.qbk b/doc/sf/ellint_introduction.qbk
index 7e2e442e1..afe84b936 100644
--- a/doc/sf/ellint_introduction.qbk
+++ b/doc/sf/ellint_introduction.qbk
@@ -236,7 +236,7 @@ Asymptotic Approximations for Symmetric Elliptic Integrals]],
SIAM Journal on Mathematical Analysis, Volume 25, Issue 2 (March 1994), 288-303.
-The following references, while not directly relevent to our implementation,
+The following references, while not directly relevant to our implementation,
may also be of interest:
# R. Burlisch, ['Numerical Compuation of Elliptic Integrals and Elliptic Functions.]
diff --git a/doc/sf/factorials.qbk b/doc/sf/factorials.qbk
index 7e6a98697..118dd8816 100644
--- a/doc/sf/factorials.qbk
+++ b/doc/sf/factorials.qbk
@@ -32,7 +32,7 @@ arguments passed to the function. Therefore if you write something like:
`boost::math::factorial(2);`
-You will get a (perhaps perplexing) compiler error, ususally indicating that there is no such function to be found.
+You will get a (perhaps perplexing) compiler error, usually indicating that there is no such function to be found.
Instead you need to specify the return type explicity and write:
`boost::math::factorial(2);`
@@ -144,7 +144,7 @@ arguments passed to the function. Therefore if you write something like:
`boost::math::double_factorial(2);`
-You will get a (possibly perplexing) compiler error, ususally indicating that there is no such function to be found. Instead you need to specifiy
+You will get a (possibly perplexing) compiler error, usually indicating that there is no such function to be found. Instead you need to specifiy
the return type explicity and write:
`boost::math::double_factorial(2);`
@@ -324,7 +324,7 @@ arguments passed to the function. Therefore if you write something like:
`boost::math::binomial_coefficient(10, 2);`
-You will get a compiler error, ususally indicating that there is no such function to be found. Instead you need to specifiy
+You will get a compiler error, usually indicating that there is no such function to be found. Instead you need to specifiy
the return type explicity and write:
`boost::math::binomial_coefficient(10, 2);`
diff --git a/doc/sf/inv_hyper.qbk b/doc/sf/inv_hyper.qbk
index 1f120e5e3..dc69d693f 100644
--- a/doc/sf/inv_hyper.qbk
+++ b/doc/sf/inv_hyper.qbk
@@ -23,7 +23,7 @@
[section:inv_hyper_over Inverse Hyperbolic Functions Overview]
-The exponential funtion is defined, for all objects for which this makes sense,
+The exponential function is defined, for all objects for which this makes sense,
as the power series
[equation special_functions_blurb1]
with ['[^n! = 1x2x3x4x5...xn]] (and ['[^0! = 1]] by definition) being the factorial of ['[^n]].
diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk
index 443e33c01..16b78ad42 100644
--- a/doc/sf/lambert_w.qbk
+++ b/doc/sf/lambert_w.qbk
@@ -599,7 +599,7 @@ For multiprecision types, first several terms of the series are tabulated and ev
Then our series functor is initialized "as if" it had already reached term 18,
enough evaluation of built-in 64-bit double and float (and 80-bit `long double`) types.
Finally the functor is called repeatedly to compute as many additional series terms
-as necessary to achive the desired precision, set from `get_epsilon`
+as necessary to achieve the desired precision, set from `get_epsilon`
(or terminated by `evaluation_error` on reaching the set iteration limit `max_series_iterations`).
A little more than one decimal digit of precision is gained by each additional series term.
diff --git a/doc/sf/legendre_stieltjes.qbk b/doc/sf/legendre_stieltjes.qbk
index 69aa4d19d..5d0568957 100644
--- a/doc/sf/legendre_stieltjes.qbk
+++ b/doc/sf/legendre_stieltjes.qbk
@@ -54,7 +54,7 @@ where ['P[sub i]] are the Legendre polynomials.
The scaling follows [@http://www.ams.org/journals/mcom/1968-22-104/S0025-5718-68-99866-9/S0025-5718-68-99866-9.pdf Patterson],
who expanded the Legendre-Stieltjes polynomials in a Legendre series and took the coefficient of the highest-order Legendre polynomial in the series to be unity.
-The Legendre-Stieltjes polynomials do not satisfy three-term recurrence relations or have a particulary simple representation.
+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.
diff --git a/example/HSO4.hpp b/example/HSO4.hpp
index 37b7e59bc..e7171b815 100644
--- a/example/HSO4.hpp
+++ b/example/HSO4.hpp
@@ -4,7 +4,7 @@
/* HSO4.hpp header file */
/* */
/* This file is not currently part of the Boost library. It is simply an example of the use */
-/* quaternions can be put to. Hopefully it will be usefull too. */
+/* quaternions can be put to. Hopefully it will be useful too. */
/* */
/* This file provides tools to convert between quaternions and R^4 rotation matrices. */
/* */
diff --git a/example/barycentric_interpolation_example_2.cpp b/example/barycentric_interpolation_example_2.cpp
index c7e834ec0..f998c6845 100644
--- a/example/barycentric_interpolation_example_2.cpp
+++ b/example/barycentric_interpolation_example_2.cpp
@@ -23,7 +23,7 @@ achieves a specific value.
int main()
{
// The lithium potential is given in Kohn's paper, Table I.
- // (We could equally easily use an unordered_map, a list of tuples or pairs, or a 2-dimentional array).
+ // (We could equally easily use an unordered_map, a list of tuples or pairs, or a 2-dimensional array).
std::map r;
r[0.02] = 5.727;
diff --git a/example/geometric_examples.cpp b/example/geometric_examples.cpp
index 14dbe9eb4..22f22937f 100644
--- a/example/geometric_examples.cpp
+++ b/example/geometric_examples.cpp
@@ -290,7 +290,7 @@ And if we require a high confidence, they widen to 0.00005 to 0.05.
cout << "geometric::find_upper_bound_on_p(" << int(k) << ", " << alpha/2 << ") = "
<< t << endl; // 0.052
/*`In real life, there will usually be more than one event (fault or success),
-when the negative binomial, which has the neccessary extra parameter, will be needed.
+when the negative binomial, which has the necessary extra parameter, will be needed.
*/
/*`As noted above, using a catch block is always a good idea,
diff --git a/example/negative_binomial_example1.cpp b/example/negative_binomial_example1.cpp
index 0895742ad..92fe48ce2 100644
--- a/example/negative_binomial_example1.cpp
+++ b/example/negative_binomial_example1.cpp
@@ -94,7 +94,7 @@ helpful error message instead of an abrupt program abort.
/*`
Selling five candy bars means getting five successes, so successes r = 5.
The total number of trials (n, in this case, houses visited) this takes is therefore
- = sucesses + failures or k + r = k + 5.
+ = successes + failures or k + r = k + 5.
*/
double sales_quota = 5; // Pat's sales quota - successes (r).
/*`
diff --git a/example/negative_binomial_example2.cpp b/example/negative_binomial_example2.cpp
index 601180c34..c5a8ffea6 100644
--- a/example/negative_binomial_example2.cpp
+++ b/example/negative_binomial_example2.cpp
@@ -17,7 +17,7 @@
// (Bernoulli, independent, yes or no, succeed or fail)
// with success_fraction probability p,
// negative_binomial is the probability that k or fewer failures
-// preceed the r th trial's success.
+// precede the r th trial's success.
#include
using std::cout;
diff --git a/include/boost/math/bindings/detail/big_lanczos.hpp b/include/boost/math/bindings/detail/big_lanczos.hpp
index 573f9ec1a..5a71f8548 100644
--- a/include/boost/math/bindings/detail/big_lanczos.hpp
+++ b/include/boost/math/bindings/detail/big_lanczos.hpp
@@ -12,14 +12,14 @@ namespace boost{ namespace math{ namespace lanczos{
//
// Lanczos Coefficients for N=13 G=13.144565
-// Max experimental error (with arbitary precision arithmetic) 9.2213e-23
+// Max experimental error (with arbitrary precision arithmetic) 9.2213e-23
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
typedef lanczos13 lanczos13UDT;
//
// Lanczos Coefficients for N=22 G=22.61891
-// Max experimental error (with arbitary precision arithmetic) 2.9524e-38
+// Max experimental error (with arbitrary precision arithmetic) 2.9524e-38
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos22UDT : public mpl::int_<120>
@@ -213,7 +213,7 @@ struct lanczos22UDT : public mpl::int_<120>
};
//
// Lanczos Coefficients for N=31 G=32.08067
-// Max experimental error (with arbitary precision arithmetic) 0.162e-52
+// Max experimental error (with arbitrary precision arithmetic) 0.162e-52
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at May 9 2006
//
struct lanczos31UDT
diff --git a/include/boost/math/constants/constants.hpp b/include/boost/math/constants/constants.hpp
index 236854ea0..f7ff86a88 100644
--- a/include/boost/math/constants/constants.hpp
+++ b/include/boost/math/constants/constants.hpp
@@ -248,7 +248,7 @@ namespace boost{ namespace math
constant_initializer2::template get_from_compute >::force_instantiate();\
return get_from_compute(); \
}\
- /* This one is for true arbitary precision, which may well vary at runtime: */ \
+ /* This one is for true arbitrary precision, which may well vary at runtime: */ \
static inline T get(const mpl::int_<0>&)\
{\
BOOST_MATH_PRECOMPUTE_IF_NOT_LOCAL(constant_, name)\
diff --git a/include/boost/math/distributions/bernoulli.hpp b/include/boost/math/distributions/bernoulli.hpp
index 09b8a0a3e..fa4583b73 100644
--- a/include/boost/math/distributions/bernoulli.hpp
+++ b/include/boost/math/distributions/bernoulli.hpp
@@ -19,7 +19,7 @@
// (like others including the poisson, binomial & negative binomial)
// is strictly defined as a discrete function: only integral values of k are envisaged.
// However because of the method of calculation using a continuous gamma function,
-// it is convenient to treat it as if a continous function,
+// it is convenient to treat it as if a continuous function,
// and permit non-integral values of k.
// To enforce the strict mathematical model, users should use floor or ceil functions
// on k outside this function to ensure that k is integral.
diff --git a/include/boost/math/distributions/binomial.hpp b/include/boost/math/distributions/binomial.hpp
index 620bf9b12..fbac66a5a 100644
--- a/include/boost/math/distributions/binomial.hpp
+++ b/include/boost/math/distributions/binomial.hpp
@@ -71,7 +71,7 @@
// (like others including the poisson, negative binomial & Bernoulli)
// is strictly defined as a discrete function: only integral values of k are envisaged.
// However because of the method of calculation using a continuous gamma function,
-// it is convenient to treat it as if a continous function,
+// it is convenient to treat it as if a continuous function,
// and permit non-integral values of k.
// To enforce the strict mathematical model, users should use floor or ceil functions
// on k outside this function to ensure that k is integral.
diff --git a/include/boost/math/distributions/cauchy.hpp b/include/boost/math/distributions/cauchy.hpp
index 5a3a64f0f..a2e51d50f 100644
--- a/include/boost/math/distributions/cauchy.hpp
+++ b/include/boost/math/distributions/cauchy.hpp
@@ -50,7 +50,7 @@ RealType cdf_imp(const cauchy_distribution& dist, const RealTy
//
// CDF = -atan(1/x) ; x < 0
//
- // So the proceedure is to calculate the cdf for -fabs(x)
+ // So the procedure is to calculate the cdf for -fabs(x)
// using the above formula, and then subtract from 1 when required
// to get the result.
//
diff --git a/include/boost/math/distributions/detail/derived_accessors.hpp b/include/boost/math/distributions/detail/derived_accessors.hpp
index 00f5a9325..169b4877b 100644
--- a/include/boost/math/distributions/detail/derived_accessors.hpp
+++ b/include/boost/math/distributions/detail/derived_accessors.hpp
@@ -24,7 +24,7 @@
// of the distribution header, AFTER the distribution and its core
// property accessors have been defined: this is so that compilers
// that implement 2-phase lookup and early-type-checking of templates
-// can find the definitions refered to herein.
+// can find the definitions referred to herein.
//
#include
diff --git a/include/boost/math/distributions/detail/hypergeometric_quantile.hpp b/include/boost/math/distributions/detail/hypergeometric_quantile.hpp
index 2cdee23c1..8908ee1d4 100644
--- a/include/boost/math/distributions/detail/hypergeometric_quantile.hpp
+++ b/include/boost/math/distributions/detail/hypergeometric_quantile.hpp
@@ -150,7 +150,7 @@ unsigned hypergeometric_quantile_imp(T p, T q, unsigned r, unsigned n, unsigned
++x;
}
// By the time we get here, log_pdf may be fairly inaccurate due to
- // roundoff errors, get a fresh PDF calculation before proceding:
+ // roundoff errors, get a fresh PDF calculation before proceeding:
diff = hypergeometric_pdf(x, r, n, N, pol);
}
while(result < p)
@@ -198,7 +198,7 @@ unsigned hypergeometric_quantile_imp(T p, T q, unsigned r, unsigned n, unsigned
--x;
}
// By the time we get here, log_pdf may be fairly inaccurate due to
- // roundoff errors, get a fresh PDF calculation before proceding:
+ // roundoff errors, get a fresh PDF calculation before proceeding:
diff = hypergeometric_pdf(x, r, n, N, pol);
}
while(result + diff / 2 < q)
diff --git a/include/boost/math/distributions/geometric.hpp b/include/boost/math/distributions/geometric.hpp
index 6c9713ead..717e6cc87 100644
--- a/include/boost/math/distributions/geometric.hpp
+++ b/include/boost/math/distributions/geometric.hpp
@@ -24,7 +24,7 @@
// is strictly defined as a discrete function:
// only integral values of k are envisaged.
// However because the method of calculation uses a continuous gamma function,
-// it is convenient to treat it as if a continous function,
+// it is convenient to treat it as if a continuous function,
// and permit non-integral values of k.
// To enforce the strict mathematical model, users should use floor or ceil functions
// on k outside this function to ensure that k is integral.
diff --git a/include/boost/math/distributions/hyperexponential.hpp b/include/boost/math/distributions/hyperexponential.hpp
index 4ed281c66..18cd048b8 100644
--- a/include/boost/math/distributions/hyperexponential.hpp
+++ b/include/boost/math/distributions/hyperexponential.hpp
@@ -278,7 +278,7 @@ class hyperexponential_distribution
PolicyT());
}
- // Two arg constructor from 2 ranges, we SFINAE this out of existance if
+ // Two arg constructor from 2 ranges, we SFINAE this out of existence if
// either argument type is incrementable as in that case the type is
// probably an iterator:
public: template
@@ -299,7 +299,7 @@ class hyperexponential_distribution
}
// Two arg constructor for a pair of iterators: we SFINAE this out of
- // existance if neither argument types are incrementable.
+ // existence if neither argument types are incrementable.
// Note that we allow different argument types here to allow for
// construction from an array plus a pointer into that array.
public: template
diff --git a/include/boost/math/distributions/poisson.hpp b/include/boost/math/distributions/poisson.hpp
index e4665bff6..64fd7e24e 100644
--- a/include/boost/math/distributions/poisson.hpp
+++ b/include/boost/math/distributions/poisson.hpp
@@ -25,7 +25,7 @@
// is strictly defined as a discrete function:
// only integral values of k are envisaged.
// However because the method of calculation uses a continuous gamma function,
-// it is convenient to treat it as if a continous function,
+// it is convenient to treat it as if a continuous function,
// and permit non-integral values of k.
// To enforce the strict mathematical model, users should use floor or ceil functions
// on k outside this function to ensure that k is integral.
@@ -288,7 +288,7 @@ namespace boost
// (like others including the binomial, negative binomial & Bernoulli)
// is strictly defined as a discrete function: only integral values of k are envisaged.
// However because of the method of calculation using a continuous gamma function,
- // it is convenient to treat it as if it is a continous function
+ // it is convenient to treat it as if it is a continuous function
// and permit non-integral values of k.
// To enforce the strict mathematical model, users should use floor or ceil functions
// outside this function to ensure that k is integral.
@@ -337,7 +337,7 @@ namespace boost
// (like others including the binomial, negative binomial & Bernoulli)
// is strictly defined as a discrete function: only integral values of k are envisaged.
// However because of the method of calculation using a continuous gamma function,
- // it is convenient to treat it as is it is a continous function
+ // it is convenient to treat it as is it is a continuous function
// and permit non-integral values of k.
// To enforce the strict mathematical model, users should use floor or ceil functions
// outside this function to ensure that k is integral.
diff --git a/include/boost/math/octonion.hpp b/include/boost/math/octonion.hpp
index 06066108b..4bfe5bcd9 100644
--- a/include/boost/math/octonion.hpp
+++ b/include/boost/math/octonion.hpp
@@ -1259,7 +1259,7 @@ namespace boost
// UNtemplated copy constructor
// (this is taken care of by the compiler itself)
- // explicit copy constructors (precision-loosing converters)
+ // explicit copy constructors (precision-losing converters)
explicit octonion(octonion const & a_recopier)
{
@@ -1328,7 +1328,7 @@ namespace boost
*this = detail::octonion_type_converter(a_recopier);
}
- // explicit copy constructors (precision-loosing converters)
+ // explicit copy constructors (precision-losing converters)
explicit octonion(octonion const & a_recopier)
{
diff --git a/include/boost/math/quaternion.hpp b/include/boost/math/quaternion.hpp
index a69147c53..3fcbf1eaf 100644
--- a/include/boost/math/quaternion.hpp
+++ b/include/boost/math/quaternion.hpp
@@ -651,7 +651,7 @@ inline BOOST_CXX14_CONSTEXPR quaternion operator / (const quaternion& a, c
template inline BOOST_CONSTEXPR bool operator != (quaternion const & lhs, quaternion const & rhs) { return !(lhs == rhs); }
- // Note: we allow the following formats, whith a, b, c, and d reals
+ // Note: we allow the following formats, with a, b, c, and d reals
// a
// (a), (a,b), (a,b,c), (a,b,c,d)
// (a,(c)), (a,(c,d)), ((a)), ((a),c), ((a),(c)), ((a),(c,d)), ((a,b)), ((a,b),c), ((a,b),(c)), ((a,b),(c,d))
diff --git a/include/boost/math/special_functions/beta.hpp b/include/boost/math/special_functions/beta.hpp
index 7435a4aab..c1dbc79f6 100644
--- a/include/boost/math/special_functions/beta.hpp
+++ b/include/boost/math/special_functions/beta.hpp
@@ -1377,7 +1377,7 @@ T ibeta_imp(T a, T b, T x, const Policy& pol, bool inv, bool normalised, T* p_de
{
if((tools::max_value() * div < *p_derivative))
{
- // overflow, return an arbitarily large value:
+ // overflow, return an arbitrarily large value:
*p_derivative = tools::max_value() / 2;
}
else
diff --git a/include/boost/math/special_functions/detail/hypergeometric_1F1_bessel.hpp b/include/boost/math/special_functions/detail/hypergeometric_1F1_bessel.hpp
index 4f2422be6..340fac112 100644
--- a/include/boost/math/special_functions/detail/hypergeometric_1F1_bessel.hpp
+++ b/include/boost/math/special_functions/detail/hypergeometric_1F1_bessel.hpp
@@ -300,7 +300,7 @@
for (auto j = bessel_cache.begin(); j != bessel_cache.end(); ++j)
*j *= ratio;
//
- // Very occationally our normalisation fails because the normalisztion value
+ // Very occasionally our normalisation fails because the normalisztion value
// is sitting right on top of a root (or very close to it). When that happens
// best to calculate a fresh Bessel evaluation and normalise again.
//
diff --git a/include/boost/math/special_functions/detail/hypergeometric_1F1_by_ratios.hpp b/include/boost/math/special_functions/detail/hypergeometric_1F1_by_ratios.hpp
index 36babad81..dda73bcee 100644
--- a/include/boost/math/special_functions/detail/hypergeometric_1F1_by_ratios.hpp
+++ b/include/boost/math/special_functions/detail/hypergeometric_1F1_by_ratios.hpp
@@ -148,7 +148,7 @@
{
//
// There's no easy relation between a, b and z that tells us whether we're in the region
- // where forwards recursion is stable, so use a lookup table, note that the minumum
+ // where forwards recursion is stable, so use a lookup table, note that the minimum
// permissible z-value is decreasing with a, and increasing with |b|:
//
static const float data[][3] = {
diff --git a/include/boost/math/special_functions/detail/hypergeometric_1F1_large_abz.hpp b/include/boost/math/special_functions/detail/hypergeometric_1F1_large_abz.hpp
index 5cfb89d20..a2e11d546 100644
--- a/include/boost/math/special_functions/detail/hypergeometric_1F1_large_abz.hpp
+++ b/include/boost/math/special_functions/detail/hypergeometric_1F1_large_abz.hpp
@@ -456,7 +456,7 @@
// but that's not clear...
// Also need to add on a fudge factor to the cost to account for the fact that we need
// to calculate the Bessel functions, this is not quite as high as the gamma function
- // method above as this is generally more accurate and so prefered if the methods are close:
+ // method above as this is generally more accurate and so preferred if the methods are close:
//
cost = 50 + fabs(b - a);
if((b > 1) && (cost <= current_cost) && (z < tools::log_max_value()) && (z < 11356) && (b - a != 0.5f))
diff --git a/include/boost/math/special_functions/detail/igamma_large.hpp b/include/boost/math/special_functions/detail/igamma_large.hpp
index 59a75b143..66e3897ce 100644
--- a/include/boost/math/special_functions/detail/igamma_large.hpp
+++ b/include/boost/math/special_functions/detail/igamma_large.hpp
@@ -39,7 +39,7 @@
// The values obtained agree with those obtained by Didonato and Morris
// (at least to the first 30 digits that they provide).
// At double precision the degrees of polynomial required for full
-// machine precision are close to those recomended to Didonato and Morris,
+// machine precision are close to those recommended to Didonato and Morris,
// but of course many more terms are needed for larger types.
//
#ifndef BOOST_MATH_DETAIL_IGAMMA_LARGE
@@ -475,7 +475,7 @@ T igamma_temme_large(T a, T x, const Policy& pol, mpl::int_<24> const *)
// And finally, a version for 113-bit mantissa's
// (128-bit long doubles, or 10^-34).
// Note this one has been optimised for a > 200
-// It's use for a < 200 is not recomended, that would
+// It's use for a < 200 is not recommended, that would
// require many more terms in the polynomials.
//
template
diff --git a/include/boost/math/special_functions/detail/lgamma_small.hpp b/include/boost/math/special_functions/detail/lgamma_small.hpp
index f4012d836..1c355e977 100644
--- a/include/boost/math/special_functions/detail/lgamma_small.hpp
+++ b/include/boost/math/special_functions/detail/lgamma_small.hpp
@@ -118,7 +118,7 @@ T lgamma_small_imp(T z, T zm1, T zm2, const mpl::int_<64>&, const Policy& /* l *
else
{
//
- // If z is less than 1 use recurrance to shift to
+ // If z is less than 1 use recurrence to shift to
// z in the interval [1,2]:
//
if(z < 1)
@@ -316,7 +316,7 @@ T lgamma_small_imp(T z, T zm1, T zm2, const mpl::int_<113>&, const Policy& /* l
else
{
//
- // If z is less than 1 use recurrance to shift to
+ // If z is less than 1 use recurrence to shift to
// z in the interval [1,2]:
//
if(z < 1)
diff --git a/include/boost/math/special_functions/detail/polygamma.hpp b/include/boost/math/special_functions/detail/polygamma.hpp
index c0e493290..30c6ba912 100644
--- a/include/boost/math/special_functions/detail/polygamma.hpp
+++ b/include/boost/math/special_functions/detail/polygamma.hpp
@@ -284,7 +284,7 @@ namespace boost { namespace math { namespace detail{
// forms are related via the Chebeshev polynomials of the first kind and
// T_n(cos(x)) = cos(n x). The polynomial form has the great advantage that
// all the cosine terms are zero at half integer arguments - right where this
- // function has it's minumum - thus avoiding cancellation error in this region.
+ // function has it's minimum - thus avoiding cancellation error in this region.
//
// And finally, since every other term in the polynomials is zero, we can save
// space by only storing the non-zero terms. This greatly complexifies
diff --git a/include/boost/math/special_functions/detail/t_distribution_inv.hpp b/include/boost/math/special_functions/detail/t_distribution_inv.hpp
index ab5a8fbca..e296ca510 100644
--- a/include/boost/math/special_functions/detail/t_distribution_inv.hpp
+++ b/include/boost/math/special_functions/detail/t_distribution_inv.hpp
@@ -112,7 +112,7 @@ T inverse_students_t_tail_series(T df, T v, const Policy& pol)
* ((((((((((((945 * df) + 31506) * df + 425858) * df + 2980236) * df + 11266745) * df + 20675018) * df + 7747124) * df - 22574632) * df - 8565600) * df + 18108416) * df - 7099392) * df + 884736)
/ (46080 * np2 * np4 * np6 * (df + 8) * (df + 10) * (df +12));
//
- // Now bring everthing together to provide the result,
+ // Now bring everything together to provide the result,
// this is Eq 62 of Shaw:
//
T rn = sqrt(df);
diff --git a/include/boost/math/special_functions/digamma.hpp b/include/boost/math/special_functions/digamma.hpp
index 41d9360d0..a4e102e0d 100644
--- a/include/boost/math/special_functions/digamma.hpp
+++ b/include/boost/math/special_functions/digamma.hpp
@@ -447,7 +447,7 @@ T digamma_imp(T x, const Tag* t, const Policy& pol)
result += 1/x;
}
//
- // If x < 1 use recurrance to shift to > 1:
+ // If x < 1 use recurrence to shift to > 1:
//
while(x < 1)
{
diff --git a/include/boost/math/special_functions/hermite.hpp b/include/boost/math/special_functions/hermite.hpp
index 1221f414d..00b42753f 100644
--- a/include/boost/math/special_functions/hermite.hpp
+++ b/include/boost/math/special_functions/hermite.hpp
@@ -28,7 +28,7 @@ inline typename tools::promote_args::type
namespace detail{
-// Implement Hermite polynomials via recurrance:
+// Implement Hermite polynomials via recurrence:
template
T hermite_imp(unsigned n, T x)
{
diff --git a/include/boost/math/special_functions/laguerre.hpp b/include/boost/math/special_functions/laguerre.hpp
index 070927f26..8471a0f3c 100644
--- a/include/boost/math/special_functions/laguerre.hpp
+++ b/include/boost/math/special_functions/laguerre.hpp
@@ -29,7 +29,7 @@ inline typename tools::promote_args::type
namespace detail{
-// Implement Laguerre polynomials via recurrance:
+// Implement Laguerre polynomials via recurrence:
template
T laguerre_imp(unsigned n, T x)
{
diff --git a/include/boost/math/special_functions/lanczos.hpp b/include/boost/math/special_functions/lanczos.hpp
index d37b17143..b10075e36 100644
--- a/include/boost/math/special_functions/lanczos.hpp
+++ b/include/boost/math/special_functions/lanczos.hpp
@@ -74,7 +74,7 @@ template
typename lanczos_initializer::init const lanczos_initializer::initializer;
//
// Lanczos Coefficients for N=6 G=5.581
-// Max experimental error (with arbitary precision arithmetic) 9.516e-12
+// Max experimental error (with arbitrary precision arithmetic) 9.516e-12
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos6 : public mpl::int_<35>
@@ -174,7 +174,7 @@ struct lanczos6 : public mpl::int_<35>
//
// Lanczos Coefficients for N=11 G=10.900511
-// Max experimental error (with arbitary precision arithmetic) 2.16676e-19
+// Max experimental error (with arbitrary precision arithmetic) 2.16676e-19
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos11 : public mpl::int_<60>
@@ -304,7 +304,7 @@ struct lanczos11 : public mpl::int_<60>
//
// Lanczos Coefficients for N=13 G=13.144565
-// Max experimental error (with arbitary precision arithmetic) 9.2213e-23
+// Max experimental error (with arbitrary precision arithmetic) 9.2213e-23
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos13 : public mpl::int_<72>
@@ -446,7 +446,7 @@ struct lanczos13 : public mpl::int_<72>
//
// Lanczos Coefficients for N=22 G=22.61891
-// Max experimental error (with arbitary precision arithmetic) 2.9524e-38
+// Max experimental error (with arbitrary precision arithmetic) 2.9524e-38
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos22 : public mpl::int_<120>
@@ -642,7 +642,7 @@ struct lanczos22 : public mpl::int_<120>
//
// Lanczos Coefficients for N=6 G=1.428456135094165802001953125
-// Max experimental error (with arbitary precision arithmetic) 8.111667e-8
+// Max experimental error (with arbitrary precision arithmetic) 8.111667e-8
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos6m24 : public mpl::int_<24>
@@ -737,7 +737,7 @@ struct lanczos6m24 : public mpl::int_<24>
//
// Lanczos Coefficients for N=13 G=6.024680040776729583740234375
-// Max experimental error (with arbitary precision arithmetic) 1.196214e-17
+// Max experimental error (with arbitrary precision arithmetic) 1.196214e-17
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos13m53 : public mpl::int_<53>
@@ -874,7 +874,7 @@ struct lanczos13m53 : public mpl::int_<53>
//
// Lanczos Coefficients for N=17 G=12.2252227365970611572265625
-// Max experimental error (with arbitary precision arithmetic) 2.7699e-26
+// Max experimental error (with arbitrary precision arithmetic) 2.7699e-26
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos17m64 : public mpl::int_<64>
@@ -1039,7 +1039,7 @@ struct lanczos17m64 : public mpl::int_<64>
//
// Lanczos Coefficients for N=24 G=20.3209821879863739013671875
-// Max experimental error (with arbitary precision arithmetic) 1.0541e-38
+// Max experimental error (with arbitrary precision arithmetic) 1.0541e-38
// Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
//
struct lanczos24m113 : public mpl::int_<113>
diff --git a/include/boost/math/special_functions/legendre.hpp b/include/boost/math/special_functions/legendre.hpp
index 2bfc13efb..78b14e157 100644
--- a/include/boost/math/special_functions/legendre.hpp
+++ b/include/boost/math/special_functions/legendre.hpp
@@ -32,7 +32,7 @@ inline typename tools::promote_args::type
namespace detail{
-// Implement Legendre P and Q polynomials via recurrance:
+// Implement Legendre P and Q polynomials via recurrence:
template
T legendre_imp(unsigned l, T x, const Policy& pol, bool second = false)
{
diff --git a/include/boost/math/special_functions/next.hpp b/include/boost/math/special_functions/next.hpp
index b98bf00db..294bc934a 100644
--- a/include/boost/math/special_functions/next.hpp
+++ b/include/boost/math/special_functions/next.hpp
@@ -475,7 +475,7 @@ T float_distance_imp(const T& a, const T& b, const mpl::true_&, const Policy& po
+ fabs(float_distance(static_cast((a < 0) ? T(-detail::get_smallest_value()) : detail::get_smallest_value()), a, pol));
//
// By the time we get here, both a and b must have the same sign, we want
- // b > a and both postive for the following logic:
+ // b > a and both positive for the following logic:
//
if(a < 0)
return float_distance(static_cast(-b), static_cast(-a), pol);
@@ -583,7 +583,7 @@ T float_distance_imp(const T& a, const T& b, const mpl::false_&, const Policy& p
+ fabs(float_distance(static_cast((a < 0) ? T(-detail::get_smallest_value()) : detail::get_smallest_value()), a, pol));
//
// By the time we get here, both a and b must have the same sign, we want
- // b > a and both postive for the following logic:
+ // b > a and both positive for the following logic:
//
if(a < 0)
return float_distance(static_cast(-b), static_cast(-a), pol);
diff --git a/include/boost/math/special_functions/owens_t.hpp b/include/boost/math/special_functions/owens_t.hpp
index 1ef894cbe..ac0dc8b80 100644
--- a/include/boost/math/special_functions/owens_t.hpp
+++ b/include/boost/math/special_functions/owens_t.hpp
@@ -627,7 +627,7 @@ namespace boost
break;
}
abs_err += fabs(c * term);
- if(sum < 0) // sum must always be positive, if it's negative something really bad has happend:
+ if(sum < 0) // sum must always be positive, if it's negative something really bad has happened:
policies::raise_evaluation_error(function, 0, T(0), pol);
return std::pair((sum / d) / boost::math::constants::two_pi(), abs_err / sum);
}
diff --git a/include/boost/math/special_functions/round.hpp b/include/boost/math/special_functions/round.hpp
index 71439a6f6..0c11f6f48 100644
--- a/include/boost/math/special_functions/round.hpp
+++ b/include/boost/math/special_functions/round.hpp
@@ -71,7 +71,7 @@ inline typename tools::promote_args::type round(const T& v)
}
//
// The following functions will not compile unless T has an
-// implicit convertion to the integer types. For user-defined
+// implicit conversion to the integer types. For user-defined
// number types this will likely not be the case. In that case
// these functions should either be specialized for the UDT in
// question, or else overloads should be placed in the same
diff --git a/include/boost/math/special_functions/trunc.hpp b/include/boost/math/special_functions/trunc.hpp
index 2671a0dc8..c291f574a 100644
--- a/include/boost/math/special_functions/trunc.hpp
+++ b/include/boost/math/special_functions/trunc.hpp
@@ -49,7 +49,7 @@ inline typename tools::promote_args::type trunc(const T& v)
}
//
// The following functions will not compile unless T has an
-// implicit convertion to the integer types. For user-defined
+// implicit conversion to the integer types. For user-defined
// number types this will likely not be the case. In that case
// these functions should either be specialized for the UDT in
// question, or else overloads should be placed in the same
diff --git a/include/boost/math/tools/convert_from_string.hpp b/include/boost/math/tools/convert_from_string.hpp
index cce61ccbd..ee74959cb 100644
--- a/include/boost/math/tools/convert_from_string.hpp
+++ b/include/boost/math/tools/convert_from_string.hpp
@@ -26,7 +26,7 @@ namespace boost{ namespace math{ namespace tools{
Real convert_from_string(const char* p, const mpl::false_&)
{
#ifdef BOOST_MATH_NO_LEXICAL_CAST
- // This function should not compile, we don't have the necesary functionality to support it:
+ // This function should not compile, we don't have the necessary functionality to support it:
BOOST_STATIC_ASSERT(sizeof(Real) == 0);
#else
return boost::lexical_cast(p);
diff --git a/include/boost/math/tools/minima.hpp b/include/boost/math/tools/minima.hpp
index b76dabe3f..edd4e3f23 100644
--- a/include/boost/math/tools/minima.hpp
+++ b/include/boost/math/tools/minima.hpp
@@ -65,7 +65,7 @@ std::pair brent_find_minima(F f, T min, T max, int bits, boost::uintmax_t&
q = fabs(q);
T td = delta2;
delta2 = delta;
- // determine whether a parabolic step is acceptible or not:
+ // determine whether a parabolic step is acceptable or not:
if((fabs(p) >= fabs(q * td / 2)) || (p <= q * (min - x)) || (p >= q * (max - x)))
{
// nope, try golden section instead
diff --git a/include/boost/math/tools/recurrence.hpp b/include/boost/math/tools/recurrence.hpp
index bebdc0447..d30130872 100644
--- a/include/boost/math/tools/recurrence.hpp
+++ b/include/boost/math/tools/recurrence.hpp
@@ -167,7 +167,7 @@ namespace boost {
first *= scale;
*log_scaling += log_scale;
}
- // scale each part seperately to avoid spurious overflow:
+ // scale each part separately to avoid spurious overflow:
third = (a / -c) * first + (b / -c) * second;
BOOST_ASSERT((boost::math::isfinite)(third));
@@ -221,7 +221,7 @@ namespace boost {
first *= scale;
*log_scaling += log_scale;
}
- // scale each part seperately to avoid spurious overflow:
+ // scale each part separately to avoid spurious overflow:
next = (b / -a) * second + (c / -a) * first;
BOOST_ASSERT((boost::math::isfinite)(next));
diff --git a/include/boost/math/tools/roots.hpp b/include/boost/math/tools/roots.hpp
index 6e39c0c08..8b3ab7eb9 100644
--- a/include/boost/math/tools/roots.hpp
+++ b/include/boost/math/tools/roots.hpp
@@ -527,7 +527,7 @@ namespace detail {
T result = guess;
T factor = ldexp(static_cast(1.0), 1 - digits);
- T delta = (std::max)(T(10000000 * guess), T(10000000)); // arbitarily large delta
+ T delta = (std::max)(T(10000000 * guess), T(10000000)); // arbitrarily large delta
T last_f0 = 0;
T delta1 = delta;
T delta2 = delta;
diff --git a/include/boost/math/tools/toms748_solve.hpp b/include/boost/math/tools/toms748_solve.hpp
index 8beb0172d..a044d112f 100644
--- a/include/boost/math/tools/toms748_solve.hpp
+++ b/include/boost/math/tools/toms748_solve.hpp
@@ -503,7 +503,7 @@ std::pair bracket_and_solve_root(F f, const T& guess, T factor, bool risin
BOOST_MATH_STD_USING
static const char* function = "boost::math::tools::bracket_and_solve_root<%1%>";
//
- // Set up inital brackets:
+ // Set up initial brackets:
//
T a = guess;
T b = a;
diff --git a/test/cardinal_trigonometric_test.cpp b/test/cardinal_trigonometric_test.cpp
index 99db9cd40..420768114 100644
--- a/test/cardinal_trigonometric_test.cpp
+++ b/test/cardinal_trigonometric_test.cpp
@@ -169,19 +169,19 @@ void test_bump()
Real expected = bump(t);
Real computed = ct(t);
if(!CHECK_MOLLIFIED_CLOSE(expected, computed, 2*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << t << "\n";
+ std::cerr << " Problem occurred at abscissa " << t << "\n";
}
expected = bump_prime(t);
computed = ct.prime(t);
if(!CHECK_MOLLIFIED_CLOSE(expected, computed, 4000*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << t << "\n";
+ std::cerr << " Problem occurred at abscissa " << t << "\n";
}
expected = bump_double_prime(t);
computed = ct.double_prime(t);
if(!CHECK_MOLLIFIED_CLOSE(expected, computed, 4000*4000*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << t << "\n";
+ std::cerr << " Problem occurred at abscissa " << t << "\n";
}
diff --git a/test/exp_sinh_quadrature_test.cpp b/test/exp_sinh_quadrature_test.cpp
index f4a8883c9..ec1af2efd 100644
--- a/test/exp_sinh_quadrature_test.cpp
+++ b/test/exp_sinh_quadrature_test.cpp
@@ -578,7 +578,7 @@ BOOST_AUTO_TEST_CASE(exp_sinh_quadrature_test)
test_nr_examples();
//
// This one causes stack overflows on the CI machine, but not locally,
- // assume it's due to resticted resources on the server, and for now...
+ // assume it's due to restricted resources on the server, and for now...
//
#if ! BOOST_WORKAROUND(BOOST_MSVC, == 1900)
test_crc();
diff --git a/test/multiprc_concept_check_4.cpp b/test/multiprc_concept_check_4.cpp
index ac4a2bb02..69d7581f4 100644
--- a/test/multiprc_concept_check_4.cpp
+++ b/test/multiprc_concept_check_4.cpp
@@ -29,7 +29,7 @@ using namespace boost::multiprecision;
typedef number, et_on> test_type;
// We get sporadic internal compiler errors from gcc-7.x when CI testing
-// that don't appear to be reproducable locally. gcc-6.x and gcc-8.x are fine
+// that don't appear to be reproducible locally. gcc-6.x and gcc-8.x are fine
// so for now it's a and move on...
#if ! (defined(BOOST_GCC) && (__GNUC__ == 7))
diff --git a/test/test_laguerre.cpp b/test/test_laguerre.cpp
index daf7ce021..f934e84f5 100644
--- a/test/test_laguerre.cpp
+++ b/test/test_laguerre.cpp
@@ -50,7 +50,7 @@ void expected_results()
largest_type = "(long\\s+)?double";
#endif
//
- // Linux special cases, error rates seem to be much higer here
+ // Linux special cases, error rates seem to be much higher here
// even though the implementation contains nothing but basic
// arithmetic?
//
diff --git a/test/test_laplace.cpp b/test/test_laplace.cpp
index d34b7553d..fd5a8674b 100644
--- a/test/test_laplace.cpp
+++ b/test/test_laplace.cpp
@@ -19,7 +19,7 @@
This module tests the Laplace distribution.
Test 1: test_pdf_cdf_ocatave()
- Compare pdf, cdf agains results obtained from GNU Octave.
+ Compare pdf, cdf against results obtained from GNU Octave.
Test 2: test_cdf_quantile_symmetry()
Checks if quantile is the inverse of cdf by testing
diff --git a/test/test_nonfinite_io.cpp b/test/test_nonfinite_io.cpp
index 71aad86ff..b91754981 100644
--- a/test/test_nonfinite_io.cpp
+++ b/test/test_nonfinite_io.cpp
@@ -36,7 +36,7 @@ using (boost::math::isnan)(;
// Test nonfinite_num_put and nonfinite_num_get facets by checking
// loopback (output and re-input) of a few values,
// but using all the built-in char and floating-point types.
-// Only the default output is used but various ostream options are tested seperately below.
+// Only the default output is used but various ostream options are tested separately below.
// Finite, infinite and NaN values (positive and negative) are used for the test.
void trap_test_finite();
diff --git a/test/whittaker_shannon_test.cpp b/test/whittaker_shannon_test.cpp
index 7bf24647b..3afebb51a 100644
--- a/test/whittaker_shannon_test.cpp
+++ b/test/whittaker_shannon_test.cpp
@@ -30,12 +30,12 @@ void test_trivial()
Real expected = 0;
if(!CHECK_MOLLIFIED_CLOSE(expected, ws.prime(0), 10*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << 0 << "\n";
+ std::cerr << " Problem occurred at abscissa " << 0 << "\n";
}
expected = -v_copy[0]/h;
if(!CHECK_MOLLIFIED_CLOSE(expected, ws.prime(h), 10*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << 0 << "\n";
+ std::cerr << " Problem occurred at abscissa " << 0 << "\n";
}
}
@@ -94,13 +94,13 @@ void test_bump()
Real expected = v_copy[i];
Real computed = ws(t);
if(!CHECK_MOLLIFIED_CLOSE(expected, computed, 10*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << t << "\n";
+ std::cerr << " Problem occurred at abscissa " << t << "\n";
}
Real expected_prime = bump_prime(t);
Real computed_prime = ws.prime(t);
if(!CHECK_MOLLIFIED_CLOSE(expected_prime, computed_prime, 1000*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << t << "\n";
+ std::cerr << " Problem occurred at abscissa " << t << "\n";
}
}
@@ -115,13 +115,13 @@ void test_bump()
Real expected = bump(t);
Real computed = ws(t);
if(!CHECK_MOLLIFIED_CLOSE(expected, computed, 10*std::numeric_limits::epsilon())) {
- std::cerr << " Problem occured at abscissa " << t << "\n";
+ std::cerr << " Problem occurred at abscissa " << t << "\n";
}
Real expected_prime = bump_prime(t);
Real computed_prime = ws.prime(t);
if(!CHECK_MOLLIFIED_CLOSE(expected_prime, computed_prime, sqrt(std::numeric_limits::epsilon()))) {
- std::cerr << " Problem occured at abscissa " << t << "\n";
+ std::cerr << " Problem occurred at abscissa " << t << "\n";
}
}
}
diff --git a/tools/lanczos_generator.cpp b/tools/lanczos_generator.cpp
index a16d4364d..4ab3cf3af 100644
--- a/tools/lanczos_generator.cpp
+++ b/tools/lanczos_generator.cpp
@@ -4841,7 +4841,7 @@ void print_code(const lanczos_info& l, const char* name, int precision = std:
"// Lanczos Coefficients for N=" << l.n << " G=" << l.r << "\n"
"// Max experimental error (with ";
if(std::strlen(name) == 0)
- std::cout << "arbitary";
+ std::cout << "arbitrary";
else
std::cout << name;
std::cout << " precision arithmetic) " << l.err <<
@@ -5107,7 +5107,7 @@ int main(int argc, char*argv [])
" -quad test quad precision for the best approximation\n"
" -MP test current multiprecision type for the best approximation\n"
" -spots print out the best cases found in previous runs\n"
- " -sweet Scan for more sweet spots for the arbitary parameter G: these "
+ " -sweet Scan for more sweet spots for the arbitrary parameter G: these "
" will need to cut and pasted into the big table at the start of this file"
" in order to search for greater precision approximations than otherwise supported."
" -data print out the test data\n" << std::flush;
|