|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r67789 - in branches/release: boost/math boost/math/bindings boost/math/concepts boost/math/constants boost/math/distributions boost/math/distributions/detail boost/math/policies boost/math/special_functions boost/math/special_functions/detail boost/math/tools libs/math/build libs/math/config libs/math/doc libs/math/doc/complex libs/math/doc/complex/html libs/math/doc/complex/html/complex_number_tr1_algorithms libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex libs/math/doc/distexplorer libs/math/doc/gcd libs/math/doc/gcd/html libs/math/doc/gcd/html/gcd_and_lcm libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm libs/math/doc/html libs/math/doc/octonion libs/math/doc/octonion/html libs/math/doc/octonion/html/boost_octonions libs/math/doc/octonion/html/boost_octonions/octonions libs/math/doc/quaternion libs/math/doc/quaternion/html libs/math/doc/quaternion/html/boost_quaternions libs/math/doc/quaternion/html/boost_quaternions/quaternions libs/math/doc/sf_and_dist libs/math/doc/sf_and_dist/distributions libs/math/doc/sf_and_dist/graphs libs/math/doc/sf_and_dist/html libs/math/doc/sf_and_dist/html/index libs/math/doc/sf_and_dist/html/math_toolkit libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders libs/math/doc/sf_and_dist/html/math_toolkit/dist libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg libs/math/doc/sf_and_dist/html/math_toolkit/extern_c libs/math/doc/sf_and_dist/html/math_toolkit/main_overview libs/math/doc/sf_and_dist/html/math_toolkit/perf libs/math/doc/sf_and_dist/html/math_toolkit/policy libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial libs/math/doc/sf_and_dist/html/math_toolkit/special libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint libs/math/doc/sf_and_dist/html/math_toolkit/special/expint libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper libs/math/doc/sf_and_dist/html/math_toolkit/special/powers libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas libs/math/doc/sf_and_dist/html/math_toolkit/status libs/math/doc/sf_and_dist/html/math_toolkit/toolkit libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1 libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2 libs/math/doc/sf_and_dist/html/math_toolkit/using_udt libs/math/doc/sf_and_dist/html/math_toolkit/utils libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding libs/math/dot_net_example libs/math/dot_net_example/Setupdistex libs/math/dot_net_example/boost_math libs/math/dot_net_example/distribution_explorer libs/math/dot_net_example/distribution_explorer/Properties libs/math/example libs/math/minimax libs/math/performance libs/math/src libs/math/test libs/math/test/compile_test libs/math/tools
From: john_at_[hidden]
Date: 2011-01-08 12:34:34
Author: johnmaddock
Date: 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
New Revision: 67789
URL: http://svn.boost.org/trac/boost/changeset/67789
Log:
Merge changes from Trunk since 1.44.
Added:
branches/release/boost/math/bindings/mpreal.hpp
- copied unchanged from r67750, /trunk/boost/math/bindings/mpreal.hpp
branches/release/boost/math/distributions/geometric.hpp
- copied unchanged from r67750, /trunk/boost/math/distributions/geometric.hpp
branches/release/boost/math/distributions/inverse_gaussian.hpp
- copied unchanged from r67750, /trunk/boost/math/distributions/inverse_gaussian.hpp
branches/release/libs/math/config/has_mpreal.cpp
- copied unchanged from r67751, /trunk/libs/math/config/has_mpreal.cpp
branches/release/libs/math/doc/sf_and_dist/config_macros.qbk (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/distributions/geometric.qbk (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/distributions/geometric_example.qbk (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/distributions/inverse_gaussian.qbk (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/faq.qbk (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_2.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_2.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_discrete.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_discrete.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_2.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_2.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_discrete.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_discrete.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_cdf.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_cdf.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_pdf.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_pdf.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/normal01_cdf.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/normal01_cdf.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/normal01_pdf.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/normal01_pdf.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/normal_cdf.png (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/graphs/normal_cdf.svg (contents, props changed)
branches/release/libs/math/doc/sf_and_dist/html/index/
- copied from r67767, /trunk/libs/math/doc/sf_and_dist/html/index/
branches/release/libs/math/doc/sf_and_dist/html/index/s12.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/index/s12.html
branches/release/libs/math/doc/sf_and_dist/html/index/s13.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/index/s13.html
branches/release/libs/math/doc/sf_and_dist/html/index/s14.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/index/s14.html
branches/release/libs/math/doc/sf_and_dist/html/index/s15.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/index/s15.html
branches/release/libs/math/doc/sf_and_dist/html/index/s16.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/index/s16.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/geometric_dist.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/geometric_dist.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gaussian_dist.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gaussian_dist.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull_dist.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull_dist.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/geometric_eg.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/geometric_eg.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/config_macros.html
- copied unchanged from r67767, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/config_macros.html
branches/release/libs/math/doc/sf_and_dist/index.idx (contents, props changed)
branches/release/libs/math/dot_net_example/distribution_explorer/readme.txt
- copied unchanged from r67751, /trunk/libs/math/dot_net_example/distribution_explorer/readme.txt
branches/release/libs/math/example/factorial_example.cpp
- copied unchanged from r67752, /trunk/libs/math/example/factorial_example.cpp
branches/release/libs/math/example/geometric_examples.cpp
- copied unchanged from r67752, /trunk/libs/math/example/geometric_examples.cpp
branches/release/libs/math/example/inverse_chi_squared_example.cpp
- copied unchanged from r67752, /trunk/libs/math/example/inverse_chi_squared_example.cpp
branches/release/libs/math/example/inverse_chi_squared_find_df_example.cpp
- copied unchanged from r67752, /trunk/libs/math/example/inverse_chi_squared_find_df_example.cpp
branches/release/libs/math/example/inverse_gamma_distribution_example.cpp
- copied unchanged from r67752, /trunk/libs/math/example/inverse_gamma_distribution_example.cpp
branches/release/libs/math/example/inverse_gamma_example.cpp
- copied unchanged from r67752, /trunk/libs/math/example/inverse_gamma_example.cpp
branches/release/libs/math/example/inverse_gaussian_example.cpp
- copied unchanged from r67752, /trunk/libs/math/example/inverse_gaussian_example.cpp
branches/release/libs/math/example/root_finding_example.cpp
- copied unchanged from r67752, /trunk/libs/math/example/root_finding_example.cpp
branches/release/libs/math/test/mpreal_concept_check.cpp
- copied unchanged from r67752, /trunk/libs/math/test/mpreal_concept_check.cpp
branches/release/libs/math/test/test_geometric.cpp
- copied unchanged from r67752, /trunk/libs/math/test/test_geometric.cpp
branches/release/libs/math/test/test_inverse_chi_squared.cpp
- copied unchanged from r67752, /trunk/libs/math/test/test_inverse_chi_squared.cpp
branches/release/libs/math/test/test_inverse_gaussian.cpp
- copied unchanged from r67752, /trunk/libs/math/test/test_inverse_gaussian.cpp
branches/release/libs/math/test/test_math_fwd.cpp
- copied unchanged from r67752, /trunk/libs/math/test/test_math_fwd.cpp
branches/release/libs/math/test/test_real_concept_neg_bin.cpp
- copied unchanged from r67752, /trunk/libs/math/test/test_real_concept_neg_bin.cpp
Removed:
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html
Properties modified:
branches/release/boost/math/ (props changed)
branches/release/libs/math/build/ (props changed)
branches/release/libs/math/config/ (props changed)
branches/release/libs/math/doc/complex/ (props changed)
branches/release/libs/math/doc/distexplorer/ (props changed)
branches/release/libs/math/doc/gcd/ (props changed)
branches/release/libs/math/doc/html/ (props changed)
branches/release/libs/math/doc/octonion/ (props changed)
branches/release/libs/math/doc/quaternion/ (props changed)
branches/release/libs/math/doc/sf_and_dist/html/ (props changed)
branches/release/libs/math/dot_net_example/ (props changed)
branches/release/libs/math/example/ (props changed)
branches/release/libs/math/minimax/ (props changed)
branches/release/libs/math/performance/ (props changed)
branches/release/libs/math/src/ (props changed)
branches/release/libs/math/test/ (props changed)
branches/release/libs/math/tools/ (props changed)
Binary files modified:
branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.suo
Text files modified:
branches/release/boost/math/bindings/mpfr.hpp | 16
branches/release/boost/math/concepts/distributions.hpp | 232 ++++
branches/release/boost/math/constants/constants.hpp | 7
branches/release/boost/math/distributions.hpp | 2
branches/release/boost/math/distributions/detail/common_error_handling.hpp | 23
branches/release/boost/math/distributions/fwd.hpp | 14
branches/release/boost/math/distributions/inverse_chi_squared.hpp | 4
branches/release/boost/math/distributions/inverse_gamma.hpp | 4
branches/release/boost/math/distributions/laplace.hpp | 30
branches/release/boost/math/distributions/non_central_beta.hpp | 134 +
branches/release/boost/math/distributions/non_central_t.hpp | 159 +
branches/release/boost/math/policies/error_handling.hpp | 28
branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp | 47
branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp | 10
branches/release/boost/math/special_functions/factorials.hpp | 23
branches/release/boost/math/special_functions/legendre.hpp | 2
branches/release/boost/math/special_functions/round.hpp | 8
branches/release/boost/math/special_functions/trunc.hpp | 8
branches/release/boost/math/tools/config.hpp | 2
branches/release/boost/math/tools/promotion.hpp | 3
branches/release/libs/math/build/Jamfile.v2 | 2
branches/release/libs/math/config/Jamfile.v2 | 5
branches/release/libs/math/doc/complex/complex-tr1.qbk | 2
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex.html | 28
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acos.html | 11
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acosh.html | 11
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asin.html | 11
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asinh.html | 11
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atan.html | 11
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atanh.html | 11
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/history.html | 10
branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/implementation.html | 8
branches/release/libs/math/doc/complex/html/index.html | 32
branches/release/libs/math/doc/distexplorer/distexplorer.qbk | 2
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm.html | 14
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/compile_time.html | 8
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/credits.html | 4
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/demo.html | 6
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/gcd_function_object.html | 4
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/header.html | 6
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/history.html | 12
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/introduction.html | 4
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/lcm_function_object.html | 4
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/rationale.html | 4
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/run_time.html | 6
branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/synopsis.html | 4
branches/release/libs/math/doc/gcd/html/index.html | 18
branches/release/libs/math/doc/gcd/math-gcd.qbk | 2
branches/release/libs/math/doc/html/index.html | 14
branches/release/libs/math/doc/math.qbk | 12
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions.html | 8
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/acknowledgements.html | 4
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/header_file.html | 4
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/history.html | 36
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/non_mem.html | 24
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/oct_create.html | 6
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_functions.html | 22
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_typedefs.html | 4
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_specializations.html | 14
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_value_operations.html | 16
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonions_transcendentals.html | 20
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/overview.html | 4
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/synopsis.html | 4
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/template_class_octonion.html | 4
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/test_program.html | 4
branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/to_do.html | 12
branches/release/libs/math/doc/octonion/html/index.html | 12
branches/release/libs/math/doc/octonion/math-octonion.qbk | 2
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions.html | 23
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/acknowledgements.html | 4
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/create.html | 52
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/exp.html | 13
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/header_file.html | 4
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/history.html | 36
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_fun.html | 28
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_typedef.html | 6
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/non_mem.html | 26
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/overview.html | 4
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/quat.html | 6
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/spec.html | 16
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/synopsis.html | 4
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/test_program.html | 4
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/to_do.html | 14
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/trans.html | 22
branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/value_op.html | 18
branches/release/libs/math/doc/quaternion/html/index.html | 27
branches/release/libs/math/doc/quaternion/math-quaternion.qbk | 2
branches/release/libs/math/doc/sf_and_dist/Jamfile.v2 | 18
branches/release/libs/math/doc/sf_and_dist/background.qbk | 2
branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk | 3
branches/release/libs/math/doc/sf_and_dist/concepts.qbk | 113 +
branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk | 27
branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk | 6
branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk | 2
branches/release/libs/math/doc/sf_and_dist/distributions/cauchy.qbk | 2
branches/release/libs/math/doc/sf_and_dist/distributions/fisher.qbk | 2
branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk | 10
branches/release/libs/math/doc/sf_and_dist/distributions/lognormal.qbk | 2
branches/release/libs/math/doc/sf_and_dist/distributions/nc_beta.qbk | 8
branches/release/libs/math/doc/sf_and_dist/distributions/nc_t.qbk | 2
branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk | 5
branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk | 6
branches/release/libs/math/doc/sf_and_dist/distributions/normal.qbk | 2
branches/release/libs/math/doc/sf_and_dist/distributions/students_t.qbk | 2
branches/release/libs/math/doc/sf_and_dist/distributions/weibull.qbk | 4
branches/release/libs/math/doc/sf_and_dist/error_handling.qbk | 10
branches/release/libs/math/doc/sf_and_dist/factorials.qbk | 41
branches/release/libs/math/doc/sf_and_dist/fraction.qbk | 2
branches/release/libs/math/doc/sf_and_dist/html/index.html | 547 ++++----
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html | 13
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html | 36
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html | 22
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html | 46
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html | 9
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html | 28
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html | 249 ++--
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html | 93
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html | 87
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html | 34
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html | 88
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html | 24
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html | 22
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html | 18
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html | 40
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html | 22
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html | 34
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html | 28
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html | 22
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html | 34
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html | 18
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html | 18
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html | 18
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html | 92
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html | 25
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html | 68
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html | 20
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html | 20
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html | 20
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html | 199 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html | 29
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html | 152 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html | 20
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html | 126 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html | 19
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html | 7
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html | 263 +--
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html | 500 ++------
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html | 15
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html | 5
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html | 336 ++---
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html | 149 -
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html | 186 +--
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html | 682 ++++-------
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html | 217 +--
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html | 2278 +++++++++++++++++++--------------------
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html | 26
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html | 103 -
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html | 92 -
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html | 653 ++++-------
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html | 582 +++------
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html | 26
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html | 518 +++-----
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html | 43
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html | 1079 +++++++++---------
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html | 88
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html | 13
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html | 497 +++----
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html | 70
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html | 151 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html | 520 +++-----
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html | 18
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html | 82
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html | 70
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html | 70
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html | 142 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html | 24
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html | 42
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html | 34
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html | 38
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html | 20
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html | 38
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html | 31
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html | 150 -
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html | 248 +--
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html | 68
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html | 395 ++----
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html | 133 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html | 20
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html | 63
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html | 22
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html | 47
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html | 31
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html | 36
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html | 36
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html | 42
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html | 58
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html | 64
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html | 31
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html | 27
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html | 18
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html | 19
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html | 44
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html | 59
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html | 19
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html | 19
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html | 25
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html | 17
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html | 27
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html | 17
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html | 17
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html | 17
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html | 17
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html | 17
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html | 25
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html | 65
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html | 89 -
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html | 7
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html | 28
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html | 23
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html | 23
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html | 36
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html | 33
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html | 23
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html | 27
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html | 36
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html | 25
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html | 27
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html | 45
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html | 35
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html | 11
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html | 11
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html | 4
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html | 25
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html | 9
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html | 9
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html | 503 +++----
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html | 93 -
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html | 43
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html | 31
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html | 23
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html | 173 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html | 333 ++--
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html | 74
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html | 11
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html | 11
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html | 47
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html | 30
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html | 14
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html | 6
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html | 6
branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk | 60
branches/release/libs/math/doc/sf_and_dist/internals_overview.qbk | 5
branches/release/libs/math/doc/sf_and_dist/inv_hyper.qbk | 2
branches/release/libs/math/doc/sf_and_dist/issues.qbk | 19
branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk | 2
branches/release/libs/math/doc/sf_and_dist/legendre.qbk | 16
branches/release/libs/math/doc/sf_and_dist/math.qbk | 60
branches/release/libs/math/doc/sf_and_dist/minima.qbk | 8
branches/release/libs/math/doc/sf_and_dist/poisson_optimisation.qbk | 2
branches/release/libs/math/doc/sf_and_dist/policy.qbk | 12
branches/release/libs/math/doc/sf_and_dist/references.qbk | 23
branches/release/libs/math/doc/sf_and_dist/remez.qbk | 2
branches/release/libs/math/doc/sf_and_dist/roadmap.qbk | 6
branches/release/libs/math/doc/sf_and_dist/roots.qbk | 118 +
branches/release/libs/math/doc/sf_and_dist/roots_without_derivatives.qbk | 58
branches/release/libs/math/doc/sf_and_dist/structure.qbk | 4
branches/release/libs/math/doc/sf_and_dist/tuple.qbk | 7
branches/release/libs/math/dot_net_example/Setupdistex/Setupdistex.vdproj | 46
branches/release/libs/math/dot_net_example/boost_math/AssemblyInfo.cpp | 12
branches/release/libs/math/dot_net_example/boost_math/Stdafx.h | 15
branches/release/libs/math/dot_net_example/boost_math/boost_math.cpp | 100 +
branches/release/libs/math/dot_net_example/boost_math/boost_math.sln | 6
branches/release/libs/math/dot_net_example/boost_math/boost_math.vcproj | 6
branches/release/libs/math/dot_net_example/distribution_explorer/DistexForm.cs | 12
branches/release/libs/math/dot_net_example/distribution_explorer/Properties/AssemblyInfo.cs | 10
branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Resources.Designer.cs | 4
branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Settings.Designer.cs | 4
branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.cs | 2
branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.resx | 4
branches/release/libs/math/dot_net_example/distribution_explorer/distribution.txt | 6
branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj | 49
branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj.user | 9
branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.sln | 5
branches/release/libs/math/example/Jamfile.v2 | 5
branches/release/libs/math/example/c_error_policy_example.cpp | 6
branches/release/libs/math/example/error_handling_example.cpp | 3
branches/release/libs/math/example/neg_binom_confidence_limits.cpp | 2
branches/release/libs/math/example/neg_binomial_sample_sizes.cpp | 216 +-
branches/release/libs/math/example/normal_misc_examples.cpp | 4
branches/release/libs/math/example/policy_eg_1.cpp | 15
branches/release/libs/math/example/policy_eg_8.cpp | 2
branches/release/libs/math/example/policy_ref_snip10.cpp | 3
branches/release/libs/math/example/policy_ref_snip11.cpp | 3
branches/release/libs/math/example/policy_ref_snip13.cpp | 3
branches/release/libs/math/example/policy_ref_snip8.cpp | 6
branches/release/libs/math/test/Jamfile.v2 | 20
branches/release/libs/math/test/compile_test/dist_nc_beta_incl_test.cpp | 46
branches/release/libs/math/test/compile_test/instantiate.hpp | 71
branches/release/libs/math/test/log1p_expm1_test.cpp | 2
branches/release/libs/math/test/test_bessel_j.cpp | 4
branches/release/libs/math/test/test_beta_dist.cpp | 58
branches/release/libs/math/test/test_cbrt.cpp | 2
branches/release/libs/math/test/test_classify.cpp | 8
branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp | 50
branches/release/libs/math/test/test_inverse_gamma_distribution.cpp | 2
branches/release/libs/math/test/test_laplace.cpp | 22
branches/release/libs/math/test/test_lognormal.cpp | 4
branches/release/libs/math/test/test_nc_beta.cpp | 22
branches/release/libs/math/test/test_normal.cpp | 6
branches/release/libs/math/test/test_sign.cpp | 39
branches/release/libs/math/test/test_weibull.cpp | 4
403 files changed, 9272 insertions(+), 10492 deletions(-)
Modified: branches/release/boost/math/bindings/mpfr.hpp
==============================================================================
--- branches/release/boost/math/bindings/mpfr.hpp (original)
+++ branches/release/boost/math/bindings/mpfr.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -11,7 +11,23 @@
#ifndef BOOST_MATH_MPLFR_BINDINGS_HPP
#define BOOST_MATH_MPLFR_BINDINGS_HPP
+#include <boost/config.hpp>
+
+#ifdef BOOST_MSVC
+//
+// We get a lot of warnings from the gmp, mpfr and gmpfrxx headers,
+// disable them here, so we only see warnings from *our* code:
+//
+#pragma warning(push)
+#pragma warning(disable: 4127 4800 4512)
+#endif
+
#include <gmpfrxx.h>
+
+#ifdef BOOST_MSVC
+#pragma warning(pop)
+#endif
+
#include <boost/math/tools/precision.hpp>
#include <boost/math/tools/real_cast.hpp>
#include <boost/math/policies/policy.hpp>
Modified: branches/release/boost/math/concepts/distributions.hpp
==============================================================================
--- branches/release/boost/math/concepts/distributions.hpp (original)
+++ branches/release/boost/math/concepts/distributions.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -12,11 +12,13 @@
#define BOOST_MATH_DISTRIBUTION_CONCEPT_HPP
#include <boost/math/distributions/complement.hpp>
+#include <boost/math/distributions/fwd.hpp>
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable: 4100)
#pragma warning(disable: 4510)
#pragma warning(disable: 4610)
+#pragma warning(disable: 4189) // local variable is initialized but not referenced.
#endif
#include <boost/concept_check.hpp>
#ifdef BOOST_MSVC
@@ -115,13 +117,13 @@
template <class Distribution>
struct DistributionConcept
{
+ typedef typename Distribution::value_type value_type;
+
void constraints()
{
function_requires<CopyConstructibleConcept<Distribution> >();
function_requires<AssignableConcept<Distribution> >();
- typedef typename Distribution::value_type value_type;
-
const Distribution& dist = DistributionConcept<Distribution>::get_object();
value_type x = 0;
@@ -188,6 +190,232 @@
v = quantile(complement(dist, li));
v = hazard(dist, li);
v = chf(dist, li);
+ test_extra_members(dist);
+ }
+ template <class D>
+ static void test_extra_members(const D&)
+ {}
+ template <class R, class P>
+ static void test_extra_members(const boost::math::bernoulli_distribution<R, P>& d)
+ {
+ value_type r = d.success_fraction();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::beta_distribution<R, P>& d)
+ {
+ value_type r1 = d.alpha();
+ value_type r2 = d.beta();
+ r1 = boost::math::beta_distribution<R, P>::find_alpha(r1, r2);
+ r1 = boost::math::beta_distribution<R, P>::find_beta(r1, r2);
+ r1 = boost::math::beta_distribution<R, P>::find_alpha(r1, r2, r1);
+ r1 = boost::math::beta_distribution<R, P>::find_beta(r1, r2, r1);
+ (void)r1; // warning suppression
+ (void)r2; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::binomial_distribution<R, P>& d)
+ {
+ value_type r = d.success_fraction();
+ r = d.trials();
+ r = Distribution::find_lower_bound_on_p(r, r, r);
+ r = Distribution::find_lower_bound_on_p(r, r, r, Distribution::clopper_pearson_exact_interval);
+ r = Distribution::find_lower_bound_on_p(r, r, r, Distribution::jeffreys_prior_interval);
+ r = Distribution::find_upper_bound_on_p(r, r, r);
+ r = Distribution::find_upper_bound_on_p(r, r, r, Distribution::clopper_pearson_exact_interval);
+ r = Distribution::find_upper_bound_on_p(r, r, r, Distribution::jeffreys_prior_interval);
+ r = Distribution::find_minimum_number_of_trials(r, r, r);
+ r = Distribution::find_maximum_number_of_trials(r, r, r);
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::cauchy_distribution<R, P>& d)
+ {
+ value_type r = d.location();
+ r = d.scale();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::chi_squared_distribution<R, P>& d)
+ {
+ value_type r = d.degrees_of_freedom();
+ r = Distribution::find_degrees_of_freedom(r, r, r, r);
+ r = Distribution::find_degrees_of_freedom(r, r, r, r, r);
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::exponential_distribution<R, P>& d)
+ {
+ value_type r = d.lambda();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::extreme_value_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.location();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::fisher_f_distribution<R, P>& d)
+ {
+ value_type r = d.degrees_of_freedom1();
+ r = d.degrees_of_freedom2();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::gamma_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.shape();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::inverse_chi_squared_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.degrees_of_freedom();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::inverse_gamma_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.shape();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::hypergeometric_distribution<R, P>& d)
+ {
+ unsigned u = d.defective();
+ u = d.sample_count();
+ u = d.total();
+ (void)u; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::laplace_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.location();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::logistic_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.location();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::lognormal_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.location();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::negative_binomial_distribution<R, P>& d)
+ {
+ value_type r = d.success_fraction();
+ r = d.successes();
+ r = Distribution::find_lower_bound_on_p(r, r, r);
+ r = Distribution::find_upper_bound_on_p(r, r, r);
+ r = Distribution::find_minimum_number_of_trials(r, r, r);
+ r = Distribution::find_maximum_number_of_trials(r, r, r);
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::non_central_beta_distribution<R, P>& d)
+ {
+ value_type r1 = d.alpha();
+ value_type r2 = d.beta();
+ r1 = d.non_centrality();
+ (void)r1; // warning suppression
+ (void)r2; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::non_central_chi_squared_distribution<R, P>& d)
+ {
+ value_type r = d.degrees_of_freedom();
+ r = d.non_centrality();
+ r = Distribution::find_degrees_of_freedom(r, r, r);
+ r = Distribution::find_degrees_of_freedom(boost::math::complement(r, r, r));
+ r = Distribution::find_non_centrality(r, r, r);
+ r = Distribution::find_non_centrality(boost::math::complement(r, r, r));
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::non_central_f_distribution<R, P>& d)
+ {
+ value_type r = d.degrees_of_freedom1();
+ r = d.degrees_of_freedom2();
+ r = d.non_centrality();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::non_central_t_distribution<R, P>& d)
+ {
+ value_type r = d.degrees_of_freedom();
+ r = d.non_centrality();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::normal_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.location();
+ r = d.mean();
+ r = d.standard_deviation();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::pareto_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.shape();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::poisson_distribution<R, P>& d)
+ {
+ value_type r = d.mean();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::rayleigh_distribution<R, P>& d)
+ {
+ value_type r = d.sigma();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::students_t_distribution<R, P>& d)
+ {
+ value_type r = d.degrees_of_freedom();
+ r = d.find_degrees_of_freedom(r, r, r, r);
+ r = d.find_degrees_of_freedom(r, r, r, r, r);
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::triangular_distribution<R, P>& d)
+ {
+ value_type r = d.lower();
+ r = d.mode();
+ r = d.upper();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::weibull_distribution<R, P>& d)
+ {
+ value_type r = d.scale();
+ r = d.shape();
+ (void)r; // warning suppression
+ }
+ template <class R, class P>
+ static void test_extra_members(const boost::math::uniform_distribution<R, P>& d)
+ {
+ value_type r = d.lower();
+ r = d.upper();
+ (void)r; // warning suppression
}
private:
static Distribution& get_object()
Modified: branches/release/boost/math/constants/constants.hpp
==============================================================================
--- branches/release/boost/math/constants/constants.hpp (original)
+++ branches/release/boost/math/constants/constants.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2005-2006.
-// Copyright Paul A. Bristow 2006-7.
+// Copyright Paul A. Bristow 2006-2010.
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -50,6 +50,8 @@
{ return BOOST_JOIN(BOOST_JOIN(x, BOOST_JOIN(e, exp)), L); }
BOOST_DEFINE_MATH_CONSTANT(pi, 3.141592653589793238462643383279502884197169399375105820974944, 59230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196, 0)
+ BOOST_DEFINE_MATH_CONSTANT(two_pi, 6.2831853071795864769252867665590057683943388015061, 0, 0)
+ BOOST_DEFINE_MATH_CONSTANT(one_div_two_pi, 0.70710678118654752440084436210484903928483593756084, 0, 0)
BOOST_DEFINE_MATH_CONSTANT(root_pi, 1.7724538509055160272981674833411451827975, 0, 0)
BOOST_DEFINE_MATH_CONSTANT(root_half_pi, 1.253314137315500251207882642405522626503, 0, 0)
BOOST_DEFINE_MATH_CONSTANT(root_two_pi, 2.506628274631000502415765284811045253007, 0, 0)
@@ -58,6 +60,7 @@
BOOST_DEFINE_MATH_CONSTANT(half, 0.5, 0, 0)
BOOST_DEFINE_MATH_CONSTANT(euler, 0.577215664901532860606512090082402431042159335939923598805, 76723488486, 0)
BOOST_DEFINE_MATH_CONSTANT(root_two, 1.414213562373095048801688724209698078569671875376948073, 17667973799073247846210703885038753432764157273501384623091229702492483605585073721264412149709993583141322266592750559275579995050115278206, 0)
+ BOOST_DEFINE_MATH_CONSTANT(half_root_two, 0.70710678118654752440084436210484903928483593756084, 0, 0)
BOOST_DEFINE_MATH_CONSTANT(ln_two, 0.693147180559945309417232121458176568075500134360255254, 120680009493393621969694715605863326996418687, 0)
BOOST_DEFINE_MATH_CONSTANT(ln_ln_two, -0.36651292058166432701243915823266946945426344783710526305367771367056, 16153193527385494558228566989083583025230453648347655663425171940646634, 0)
BOOST_DEFINE_MATH_CONSTANT(third, 0.3333333333333333333333333333333333333333333333333333333333333333333333, 3333333333333333333333333333333333333333333333333333333333333333333333333, 0)
@@ -66,6 +69,8 @@
BOOST_DEFINE_MATH_CONSTANT(four_minus_pi, 0.85840734641020676153735661672049711580283060062489417902505540769218359, 0, 0)
BOOST_DEFINE_MATH_CONSTANT(pow23_four_minus_pi, 0.79531676737159754434839533505680658072763917332771320544530223438582161, 0, 0)
BOOST_DEFINE_MATH_CONSTANT(exp_minus_half, 0.6065306597126334236037995349911804534419181354871869556828921587350565194137, 484239986476115079894560, 0)
+ BOOST_DEFINE_MATH_CONSTANT(one_div_root_two, 0.70710678118654752440084436210484903928483593756084, 0, 0)
+ BOOST_DEFINE_MATH_CONSTANT(one_div_root_two_pi, 0.39894228040143267793994605993438186847585863095671, 0, 0)
} // namespace constants
Modified: branches/release/boost/math/distributions.hpp
==============================================================================
--- branches/release/boost/math/distributions.hpp (original)
+++ branches/release/boost/math/distributions.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -22,9 +22,11 @@
#include <boost/math/distributions/extreme_value.hpp>
#include <boost/math/distributions/fisher_f.hpp>
#include <boost/math/distributions/gamma.hpp>
+#include <boost/math/distributions/geometric.hpp>
#include <boost/math/distributions/hypergeometric.hpp>
#include <boost/math/distributions/inverse_chi_squared.hpp>
#include <boost/math/distributions/inverse_gamma.hpp>
+#include <boost/math/distributions/inverse_gaussian.hpp>
#include <boost/math/distributions/laplace.hpp>
#include <boost/math/distributions/logistic.hpp>
#include <boost/math/distributions/lognormal.hpp>
Modified: branches/release/boost/math/distributions/detail/common_error_handling.hpp
==============================================================================
--- branches/release/boost/math/distributions/detail/common_error_handling.hpp (original)
+++ branches/release/boost/math/distributions/detail/common_error_handling.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -94,7 +94,28 @@
// Note that this test catches both infinity and NaN.
// Some special cases permit x to be infinite, so these must be tested 1st,
// leaving this test to catch any NaNs. see Normal and cauchy for example.
-}
+} // bool check_x
+
+template <class RealType, class Policy>
+inline bool check_x_gt0(
+ const char* function,
+ RealType x,
+ RealType* result,
+ const Policy& pol)
+{
+ if(x <= 0)
+ {
+ *result = policies::raise_domain_error<RealType>(
+ function,
+ "Random variate x is %1%, but must be > 0!", x, pol);
+ return false;
+ }
+
+ return true;
+ // Note that this test catches both infinity and NaN.
+ // Some special cases permit x to be infinite, so these must be tested 1st,
+ // leaving this test to catch any NaNs. See Normal and cauchy for example.
+} // bool check_x_gt0
template <class RealType, class Policy>
inline bool check_positive_x(
Modified: branches/release/boost/math/distributions/fwd.hpp
==============================================================================
--- branches/release/boost/math/distributions/fwd.hpp (original)
+++ branches/release/boost/math/distributions/fwd.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -41,6 +41,9 @@
class gamma_distribution;
template <class RealType, class Policy>
+class geometric_distribution;
+
+template <class RealType, class Policy>
class hypergeometric_distribution;
template <class RealType, class Policy>
@@ -50,6 +53,12 @@
class inverse_gamma_distribution;
template <class RealType, class Policy>
+class inverse_gaussian_distribution;
+
+template <class RealType, class Policy>
+class inverse_uniform_distribution;
+
+template <class RealType, class Policy>
class laplace_distribution;
template <class RealType, class Policy>
@@ -126,5 +135,10 @@
typedef boost::math::non_central_f_distribution<Type, Policy> non_central_f;\
typedef boost::math::non_central_t_distribution<Type, Policy> non_central_t;\
typedef boost::math::hypergeometric_distribution<Type, Policy> hypergeometric;\
+ typedef boost::math::inverse_uniform_distribution<Type, Policy> inverse_uniform;\
+ typedef boost::math::geometric_distribution<Type, Policy> geometric;\
+ typedef boost::math::inverse_chi_squared_distribution<Type, Policy> inverse_chi_squared;\
+ typedef boost::math::inverse_gamma_distribution<Type, Policy> inverse_gamma;\
+ typedef boost::math::inverse_gaussian_distribution<Type, Policy> inverse_gaussian;\
#endif // BOOST_MATH_DISTRIBUTIONS_FWD_HPP
Modified: branches/release/boost/math/distributions/inverse_chi_squared.hpp
==============================================================================
--- branches/release/boost/math/distributions/inverse_chi_squared.hpp (original)
+++ branches/release/boost/math/distributions/inverse_chi_squared.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -146,7 +146,7 @@
if(result < tools::min_value<RealType>())
return 0; // Random variable is near enough infinite.
result = gamma_p_derivative(df/2, result, Policy()) * df * scale/2;
- if(result != 0) // prevent 0 / 0:
+ if(result != 0) // prevent 0 / 0, gamma_p_derivative -> 0 faster than x^2
result /= (x * x);
return result;
} // pdf
@@ -298,7 +298,7 @@
return policies::raise_domain_error<RealType>(
function,
"inverse Chi-Squared distribution only has a variance for degrees of freedom > 4, but got degrees of freedom = %1%.",
- df, Policy()); return 2 * dist.degrees_of_freedom();
+ df, Policy());
}
return 2 * df * df * scale * scale / ((df - 2)*(df - 2) * (df - 4));
} // variance
Modified: branches/release/boost/math/distributions/inverse_gamma.hpp
==============================================================================
--- branches/release/boost/math/distributions/inverse_gamma.hpp (original)
+++ branches/release/boost/math/distributions/inverse_gamma.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -128,7 +128,7 @@
inline const std::pair<RealType, RealType> range(const inverse_gamma_distribution<RealType, Policy>& /* dist */)
{ // Range of permissible values for random variable x.
using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}
template <class RealType, class Policy>
@@ -137,7 +137,7 @@
// This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
using boost::math::tools::max_value;
using boost::math::tools::min_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}
template <class RealType, class Policy>
Modified: branches/release/boost/math/distributions/laplace.hpp
==============================================================================
--- branches/release/boost/math/distributions/laplace.hpp (original)
+++ branches/release/boost/math/distributions/laplace.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -66,23 +66,17 @@
return true;
}
-
private:
RealType m_location;
RealType m_scale;
-
}; // class laplace_distribution
-
-
-//
-// Convenient type synonym
//
+// Convenient type synonym for double
typedef laplace_distribution<double> laplace;
//
// Non member functions
-//
template <class RealType, class Policy>
inline const std::pair<RealType, RealType> range(const laplace_distribution<RealType, Policy>&)
{
@@ -137,7 +131,7 @@
if (false == dist.check_parameters(function, &result)) return result;
if (false == detail::check_x(function, x, &result, Policy())) return result;
- // Special cdf values
+ // Special cdf values:
if((boost::math::isinf)(x))
{
if(x < 0) return 0; // -infinity
@@ -160,7 +154,7 @@
template <class RealType, class Policy>
inline RealType quantile(const laplace_distribution<RealType, Policy>& dist, const RealType& p)
{
- BOOST_MATH_STD_USING // for ADL of std functions
+ BOOST_MATH_STD_USING // for ADL of std functions.
// Checking function argument
RealType result;
@@ -168,10 +162,20 @@
if (false == dist.check_parameters(function, &result)) return result;
if(false == detail::check_probability(function, p, &result, Policy())) return result;
- // extreme values
- if(p == 0) return -std::numeric_limits<RealType>::infinity();
- if(p == 1) return std::numeric_limits<RealType>::infinity();
-
+ // Extreme values of p:
+ if(p == 0)
+ {
+ result = policies::raise_overflow_error<RealType>(function,
+ "probability parameter is 0, but must be > 0!", Policy());
+ return -result; // -std::numeric_limits<RealType>::infinity();
+ }
+
+ if(p == 1)
+ {
+ result = policies::raise_overflow_error<RealType>(function,
+ "probability parameter is 1, but must be < 1!", Policy());
+ return result; // std::numeric_limits<RealType>::infinity();
+ }
// Calculate Quantile
RealType scale( dist.scale() );
RealType location( dist.location() );
Modified: branches/release/boost/math/distributions/non_central_beta.hpp
==============================================================================
--- branches/release/boost/math/distributions/non_central_beta.hpp (original)
+++ branches/release/boost/math/distributions/non_central_beta.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -18,6 +18,7 @@
#include <boost/math/distributions/detail/common_error_handling.hpp> // error checks
#include <boost/math/special_functions/fpclassify.hpp> // isnan.
#include <boost/math/tools/roots.hpp> // for root finding.
+#include <boost/math/tools/series.hpp>
namespace boost
{
@@ -42,13 +43,25 @@
T l2 = lam / 2;
//
// k is the starting point for iteration, and is the
- // maximum of the poisson weighting term:
+ // maximum of the poisson weighting term,
+ // note that unlike other similar code, we do not set
+ // k to zero, when l2 is small, as forward iteration
+ // is unstable:
//
int k = itrunc(l2);
if(k == 0)
k = 1;
- // Starting Poisson weight:
- T pois = gamma_p_derivative(T(k+1), l2, pol);
+ T pois;
+ if(k == 0)
+ {
+ // Starting Poisson weight:
+ pois = exp(-l2);
+ }
+ else
+ {
+ // Starting Poisson weight:
+ pois = gamma_p_derivative(T(k+1), l2, pol);
+ }
if(pois == 0)
return init_val;
// recurance term:
@@ -123,10 +136,27 @@
// maximum of the poisson weighting term:
//
int k = itrunc(l2);
+ T pois;
+ if(k <= 30)
+ {
+ //
+ // Might as well start at 0 since we'll likely have this number of terms anyway:
+ //
+ if(a + b > 1)
+ k = 0;
+ else if(k == 0)
+ k = 1;
+ }
if(k == 0)
- k = 1;
- // Starting Poisson weight:
- T pois = gamma_p_derivative(T(k+1), l2, pol);
+ {
+ // Starting Poisson weight:
+ pois = exp(-l2);
+ }
+ else
+ {
+ // Starting Poisson weight:
+ pois = gamma_p_derivative(T(k+1), l2, pol);
+ }
if(pois == 0)
return init_val;
// recurance term:
@@ -598,6 +628,46 @@
"function");
}
+ template <class T>
+ struct hypergeometric_2F2_sum
+ {
+ typedef T result_type;
+ hypergeometric_2F2_sum(T a1_, T a2_, T b1_, T b2_, T z_) : a1(a1_), a2(a2_), b1(b1_), b2(b2_), z(z_), term(1), k(0) {}
+ T operator()()
+ {
+ T result = term;
+ term *= a1 * a2 / (b1 * b2);
+ a1 += 1;
+ a2 += 1;
+ b1 += 1;
+ b2 += 1;
+ k += 1;
+ term /= k;
+ term *= z;
+ return result;
+ }
+ T a1, a2, b1, b2, z, term, k;
+ };
+
+ template <class T, class Policy>
+ T hypergeometric_2F2(T a1, T a2, T b1, T b2, T z, const Policy& pol)
+ {
+ typedef typename policies::evaluation<T, Policy>::type value_type;
+
+ const char* function = "boost::math::detail::hypergeometric_2F2<%1%>(%1%,%1%,%1%,%1%,%1%)";
+
+ hypergeometric_2F2_sum<value_type> s(a1, a2, b1, b2, z);
+ boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>();
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+ value_type zero = 0;
+ value_type result = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<value_type, Policy>(), max_iter, zero);
+#else
+ value_type result = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<value_type, Policy>(), max_iter);
+#endif
+ policies::check_series_iterations(function, max_iter, pol);
+ return policies::checked_narrowing_cast<T, Policy>(result, function);
+ }
+
} // namespace detail
template <class RealType = double, class Policy = policies::policy<> >
@@ -693,7 +763,6 @@
function);
}
-#if 0
//
// We don't have the necessary information to implement
// these at present. These are just disabled for now,
@@ -703,35 +772,58 @@
template <class RealType, class Policy>
inline RealType mean(const non_central_beta_distribution<RealType, Policy>& dist)
{
- // TODO
- return 0;
+ BOOST_MATH_STD_USING
+ RealType a = dist.alpha();
+ RealType b = dist.beta();
+ RealType d = dist.non_centrality();
+ RealType apb = a + b;
+ return exp(-d / 2) * a * detail::hypergeometric_2F2<RealType, Policy>(1 + a, apb, a, 1 + apb, d / 2, Policy()) / apb;
} // mean
template <class RealType, class Policy>
inline RealType variance(const non_central_beta_distribution<RealType, Policy>& dist)
- { // variance.
- const char* function = "boost::math::non_central_beta_distribution<%1%>::variance()";
- // TODO
- return 0;
+ {
+ //
+ // Relative error of this function may be arbitarily large... absolute
+ // error will be small however... that's the best we can do for now.
+ //
+ BOOST_MATH_STD_USING
+ RealType a = dist.alpha();
+ RealType b = dist.beta();
+ RealType d = dist.non_centrality();
+ RealType apb = a + b;
+ RealType result = detail::hypergeometric_2F2(RealType(1 + a), apb, a, RealType(1 + apb), RealType(d / 2), Policy());
+ result *= result * -exp(-d) * a * a / (apb * apb);
+ result += exp(-d / 2) * a * (1 + a) * detail::hypergeometric_2F2(RealType(2 + a), apb, a, RealType(2 + apb), RealType(d / 2), Policy()) / (apb * (1 + apb));
+ return result;
}
// RealType standard_deviation(const non_central_beta_distribution<RealType, Policy>& dist)
// standard_deviation provided by derived accessors.
-
template <class RealType, class Policy>
- inline RealType skewness(const non_central_beta_distribution<RealType, Policy>& dist)
+ inline RealType skewness(const non_central_beta_distribution<RealType, Policy>& /*dist*/)
{ // skewness = sqrt(l).
const char* function = "boost::math::non_central_beta_distribution<%1%>::skewness()";
- // TODO
- return 0;
+ typedef typename Policy::assert_undefined_type assert_type;
+ BOOST_STATIC_ASSERT(assert_type::value == 0);
+
+ return policies::raise_evaluation_error<RealType>(
+ function,
+ "This function is not yet implemented, the only sensible result is %1%.",
+ std::numeric_limits<RealType>::quiet_NaN(), Policy()); // infinity?
}
template <class RealType, class Policy>
- inline RealType kurtosis_excess(const non_central_beta_distribution<RealType, Policy>& dist)
+ inline RealType kurtosis_excess(const non_central_beta_distribution<RealType, Policy>& /*dist*/)
{
const char* function = "boost::math::non_central_beta_distribution<%1%>::kurtosis_excess()";
- // TODO
- return 0;
+ typedef typename Policy::assert_undefined_type assert_type;
+ BOOST_STATIC_ASSERT(assert_type::value == 0);
+
+ return policies::raise_evaluation_error<RealType>(
+ function,
+ "This function is not yet implemented, the only sensible result is %1%.",
+ std::numeric_limits<RealType>::quiet_NaN(), Policy()); // infinity?
} // kurtosis_excess
template <class RealType, class Policy>
@@ -739,7 +831,7 @@
{
return kurtosis_excess(dist) + 3;
}
-#endif
+
template <class RealType, class Policy>
inline RealType pdf(const non_central_beta_distribution<RealType, Policy>& dist, const RealType& x)
{ // Probability Density/Mass Function.
Modified: branches/release/boost/math/distributions/non_central_t.hpp
==============================================================================
--- branches/release/boost/math/distributions/non_central_t.hpp (original)
+++ branches/release/boost/math/distributions/non_central_t.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -41,20 +41,40 @@
// maximum of the poisson weighting term:
//
int k = boost::math::itrunc(d2);
- // Starting Poisson weight:
- T pois = gamma_p_derivative(T(k+1), d2, pol)
- * tgamma_delta_ratio(T(k + 1), T(0.5f))
- * delta / constants::root_two<T>();
+ T pois;
+ if(k < 15)
+ {
+ // Since we'll likely need 30-40 terms anyway, start from zero
+ // since this simplifies the arithmetic, don't go too overboard though
+ // as this is the *unstable* direction:
+ k = 0;
+ // Starting Poisson weight:
+ pois = exp(-d2) * 2 / constants::root_pi<T>();
+ pois *= delta / constants::root_two<T>();
+ }
+ else
+ {
+ // Starting Poisson weight:
+ pois = gamma_p_derivative(T(k+1), d2, pol)
+ * tgamma_delta_ratio(T(k + 1), T(0.5f))
+ * delta / constants::root_two<T>();
+ }
if(pois == 0)
return init_val;
- // Recurance term:
- T xterm;
- // Starting beta term:
- T beta = x < y
- ? detail::ibeta_imp(T(k + 1), T(n / 2), x, pol, false, true, &xterm)
- : detail::ibeta_imp(T(n / 2), T(k + 1), y, pol, true, true, &xterm);
-
- xterm *= y / (n / 2 + k);
+ T xterm, beta;
+ // Recurrance & starting beta terms:
+ if(k == 0)
+ {
+ beta = -boost::math::powm1(y, n / 2, pol);
+ xterm = beta > 0.5f ? T(pow(y, n / 2)) : T(1 - beta);
+ }
+ else
+ {
+ beta = x < y
+ ? detail::ibeta_imp(T(k + 1), T(n / 2), x, pol, false, true, &xterm)
+ : detail::ibeta_imp(T(n / 2), T(k + 1), y, pol, true, true, &xterm);
+ xterm *= y / (n / 2 + k);
+ }
T poisf(pois), betaf(beta), xtermf(xterm);
T sum = init_val;
if((xterm == 0) && (beta == 0))
@@ -111,66 +131,89 @@
// maximum of the poisson weighting term:
//
int k = boost::math::itrunc(d2);
+ if(k < 30)
+ {
+ // We typically need around 40 terms so may as well start at 0
+ // and gain faster computation of starting conditions:
+ k = 0;
+ }
// Starting Poisson weight:
- T pois = gamma_p_derivative(T(k+1), d2, pol)
- * tgamma_delta_ratio(T(k + 1), T(0.5f))
- * delta / constants::root_two<T>();
+ T pois;
+ if(k == 0)
+ {
+ pois = exp(-d2) * 2 / constants::root_pi<T>();
+ pois *= delta / constants::root_two<T>();
+ }
+ else if((k < (int)(max_factorial<T>::value)) && (d2 < tools::log_max_value<T>()) && (log(d2) * k < tools::log_max_value<T>()))
+ {
+ //
+ // For small k we can optimise this calculation by using
+ // a simpler reduced formula:
+ //
+ pois = exp(-d2);
+ pois *= pow(d2, static_cast<T>(k));
+ pois /= boost::math::tgamma(T(k + 1 + 0.5), pol);
+ pois *= delta / constants::root_two<T>();
+ }
+ else
+ {
+ pois = gamma_p_derivative(T(k+1), d2, pol)
+ * tgamma_delta_ratio(T(k + 1), T(0.5f))
+ * delta / constants::root_two<T>();
+ }
if(pois == 0)
return init_val;
// Recurance term:
T xterm;
+ T beta;
// Starting beta term:
- T beta = x < y
- ? detail::ibeta_imp(T(k + 1), T(n / 2), x, pol, true, true, &xterm)
- : detail::ibeta_imp(T(n / 2), T(k + 1), y, pol, false, true, &xterm);
+ if(k != 0)
+ {
+ beta = x < y
+ ? detail::ibeta_imp(T(k + 1), T(n / 2), x, pol, true, true, &xterm)
+ : detail::ibeta_imp(T(n / 2), T(k + 1), y, pol, false, true, &xterm);
- xterm *= y / (n / 2 + k);
+ xterm *= y / (n / 2 + k);
+ }
+ else
+ {
+ beta = pow(y, n / 2);
+ xterm = beta;
+ }
T poisf(pois), betaf(beta), xtermf(xterm);
T sum = init_val;
if((xterm == 0) && (beta == 0))
return init_val;
//
- // Forward recursion first, this is the stable direction:
+ // Fused forward and backwards recursion:
//
boost::uintmax_t count = 0;
- for(int i = k + 1; ; ++i)
+ for(int i = k + 1, j = k; ; ++i, --j)
{
poisf *= d2 / (i + 0.5f);
xtermf *= (x * (n / 2 + i - 1)) / (i);
betaf += xtermf;
-
T term = poisf * betaf;
- sum += term;
- if(fabs(term/sum) < errtol)
- break;
- if(count > max_iter)
+
+ if(j >= 0)
{
- return policies::raise_evaluation_error(
- "cdf(non_central_t_distribution<%1%>, %1%)",
- "Series did not converge, closest value was %1%", sum, pol);
+ term += beta * pois;
+ pois *= (j + 0.5f) / d2;
+ beta -= xterm;
+ xterm *= (j) / (x * (n / 2 + j - 1));
}
- ++count;
- }
- //
- // Backwards recursion:
- //
- for(int i = k; i >= 0; --i)
- {
- T term = beta * pois;
+
sum += term;
if(fabs(term/sum) < errtol)
break;
- pois *= (i + 0.5f) / d2;
- beta -= xterm;
- xterm *= (i) / (x * (n / 2 + i - 1));
- ++count;
if(count > max_iter)
{
return policies::raise_evaluation_error(
"cdf(non_central_t_distribution<%1%>, %1%)",
"Series did not converge, closest value was %1%", sum, pol);
}
+ ++count;
}
return sum;
}
@@ -326,14 +369,32 @@
// maximum of the poisson weighting term:
//
int k = boost::math::itrunc(d2);
- // Starting Poisson weight:
- T pois = gamma_p_derivative(T(k+1), d2, pol)
- * tgamma_delta_ratio(T(k + 1), T(0.5f))
- * delta / constants::root_two<T>();
- // Starting beta term:
- T xterm = x < y
- ? ibeta_derivative(T(k + 1), n / 2, x, pol)
- : ibeta_derivative(n / 2, T(k + 1), y, pol);
+ T pois, xterm;
+ if(k < 30)
+ {
+ //
+ // Since we'll need at least 30-40 terms anyway, start from 0
+ // since this simplifies the starting arithmetic:
+ //
+ k = 0;
+ // Starting Poisson weight:
+ pois = exp(-d2)
+ * (2 / constants::root_pi<T>())
+ * delta / constants::root_two<T>();
+ // Starting beta term:
+ xterm = pow(y, n / 2 - 1) * n / 2;
+ }
+ else
+ {
+ // Starting Poisson weight:
+ pois = gamma_p_derivative(T(k+1), d2, pol)
+ * tgamma_delta_ratio(T(k + 1), T(0.5f))
+ * delta / constants::root_two<T>();
+ // Starting beta term:
+ xterm = x < y
+ ? ibeta_derivative(T(k + 1), n / 2, x, pol)
+ : ibeta_derivative(n / 2, T(k + 1), y, pol);
+ }
T poisf(pois), xtermf(xterm);
T sum = init_val;
if((pois == 0) || (xterm == 0))
Modified: branches/release/boost/math/policies/error_handling.hpp
==============================================================================
--- branches/release/boost/math/policies/error_handling.hpp (original)
+++ branches/release/boost/math/policies/error_handling.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -60,8 +60,8 @@
T user_denorm_error(const char* function, const char* message, const T& val);
template <class T>
T user_evaluation_error(const char* function, const char* message, const T& val);
-template <class T>
-T user_rounding_error(const char* function, const char* message, const T& val);
+template <class T, class TargetType>
+T user_rounding_error(const char* function, const char* message, const T& val, const TargetType& t);
template <class T>
T user_indeterminate_result_error(const char* function, const char* message, const T& val);
@@ -381,11 +381,12 @@
return user_evaluation_error(function, message, val);
}
-template <class T>
+template <class T, class TargetType>
inline T raise_rounding_error(
const char* function,
const char* message,
const T& val,
+ const TargetType&,
const ::boost::math::policies::rounding_error< ::boost::math::policies::throw_on_error>&)
{
raise_error<boost::math::rounding_error, T>(function, message, val);
@@ -393,39 +394,42 @@
return T(0);
}
-template <class T>
+template <class T, class TargetType>
inline T raise_rounding_error(
const char* ,
const char* ,
const T& val,
+ const TargetType&,
const ::boost::math::policies::rounding_error< ::boost::math::policies::ignore_error>&)
{
// This may or may not do the right thing, but the user asked for the error
// to be ignored so here we go anyway:
- return val;
+ return std::numeric_limits<T>::is_specialized ? (val > 0 ? (std::numeric_limits<T>::max)() : -(std::numeric_limits<T>::max)()): val;
}
-template <class T>
+template <class T, class TargetType>
inline T raise_rounding_error(
const char* ,
const char* ,
const T& val,
+ const TargetType&,
const ::boost::math::policies::rounding_error< ::boost::math::policies::errno_on_error>&)
{
errno = ERANGE;
// This may or may not do the right thing, but the user asked for the error
// to be silent so here we go anyway:
- return val;
+ return std::numeric_limits<T>::is_specialized ? (val > 0 ? (std::numeric_limits<T>::max)() : -(std::numeric_limits<T>::max)()): val;
}
-template <class T>
+template <class T, class TargetType>
inline T raise_rounding_error(
const char* function,
const char* message,
const T& val,
+ const TargetType& t,
const ::boost::math::policies::rounding_error< ::boost::math::policies::user_error>&)
{
- return user_rounding_error(function, message, val);
+ return user_rounding_error(function, message, val, t);
}
template <class T, class R>
@@ -536,13 +540,13 @@
val, policy_type());
}
-template <class T, class Policy>
-inline T raise_rounding_error(const char* function, const char* message, const T& val, const Policy&)
+template <class T, class TargetType, class Policy>
+inline T raise_rounding_error(const char* function, const char* message, const T& val, const TargetType& t, const Policy&)
{
typedef typename Policy::rounding_error_type policy_type;
return detail::raise_rounding_error(
function, message ? message : "Value %1% can not be represented in the target integer type.",
- val, policy_type());
+ val, t, policy_type());
}
template <class T, class R, class Policy>
Modified: branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp (original)
+++ branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -455,6 +455,24 @@
BOOST_MATH_STD_USING // For ADL of math functions.
//
+ // Handle trivial cases first:
+ //
+ if(q == 0)
+ {
+ if(py) *py = 0;
+ return 1;
+ }
+ else if(p == 0)
+ {
+ if(py) *py = 1;
+ return 0;
+ }
+ else if((a == 1) && (b == 1))
+ {
+ if(py) *py = 1 - p;
+ return p;
+ }
+ //
// The flag invert is set to true if we swap a for b and p for q,
// in which case the result has to be subtracted from 1:
//
@@ -477,31 +495,16 @@
// Student's T with b = 0.5 gets handled as a special case, swap
// around if the arguments are in the "wrong" order:
//
- if(a == 0.5f)
+ if((a == 0.5f) && (b >= 0.5f))
{
std::swap(a, b);
std::swap(p, q);
invert = !invert;
}
//
- // Handle trivial cases first:
+ // Select calculation method for the initial estimate:
//
- if(q == 0)
- {
- if(py) *py = 0;
- return 1;
- }
- else if(p == 0)
- {
- if(py) *py = 1;
- return 0;
- }
- else if((a == 1) && (b == 1))
- {
- if(py) *py = 1 - p;
- return p;
- }
- else if((b == 0.5f) && (a >= 0.5f))
+ if((b == 0.5f) && (a >= 0.5f))
{
//
// We have a Student's T distribution:
@@ -541,7 +544,7 @@
T r = a + b;
T theta = asin(sqrt(a / r));
T lambda = minv / r;
- if((lambda >= 0.2) && (lambda <= 0.8) && (lambda >= 10))
+ if((lambda >= 0.2) && (lambda <= 0.8) && (r >= 10))
{
//
// The second error function case is the next cheapest
@@ -620,7 +623,7 @@
{
std::swap(a, b);
std::swap(p, q);
- invert = true;
+ invert = !invert;
xs = 1 - xs;
}
T xg = pow(a * p * boost::math::beta(a, b, pol), 1/a);
@@ -652,7 +655,7 @@
std::swap(a, b);
std::swap(p, q);
std::swap(xs, xs2);
- invert = true;
+ invert = !invert;
}
//
// Estimate x and y, using expm1 to get a good estimate
@@ -716,7 +719,7 @@
{
std::swap(a, b);
std::swap(p, q);
- invert = true;
+ invert = !invert;
}
if(pow(p, 1/a) < 0.5)
{
Modified: branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp (original)
+++ branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -28,7 +28,7 @@
template <class T>
struct max_factorial;
-// efinitions:
+// Definitions:
template <>
inline float unchecked_factorial<float>(unsigned i BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(float))
{
@@ -282,6 +282,14 @@
template <class T>
inline T unchecked_factorial(unsigned i BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(T))
{
+ BOOST_STATIC_ASSERT(!boost::is_integral<T>::value);
+ // factorial<unsigned int>(n) is not implemented
+ // because it would overflow integral type T for too small n
+ // to be useful. Use instead a floating-point type,
+ // and convert to an unsigned type if essential, for example:
+ // unsigned int nfac = static_cast<unsigned int>(factorial<double>(n));
+ // See factorial documentation for more detail.
+
static const boost::array<T, 101> factorials = {{
boost::lexical_cast<T>("1"),
boost::lexical_cast<T>("1"),
Modified: branches/release/boost/math/special_functions/factorials.hpp
==============================================================================
--- branches/release/boost/math/special_functions/factorials.hpp (original)
+++ branches/release/boost/math/special_functions/factorials.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,4 +1,4 @@
-// Copyright John Maddock 2006.
+// Copyright John Maddock 2006, 2010.
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -31,6 +31,13 @@
inline T factorial(unsigned i, const Policy& pol)
{
BOOST_STATIC_ASSERT(!boost::is_integral<T>::value);
+ // factorial<unsigned int>(n) is not implemented
+ // because it would overflow integral type T for too small n
+ // to be useful. Use instead a floating-point type,
+ // and convert to an unsigned type if essential, for example:
+ // unsigned int nfac = static_cast<unsigned int>(factorial<double>(n));
+ // See factorial documentation for more detail.
+
BOOST_MATH_STD_USING // Aid ADL for floor.
if(i <= max_factorial<T>::value)
@@ -78,12 +85,12 @@
return ceil(unchecked_factorial<T>(i) / (ldexp(T(1), (int)n) * unchecked_factorial<T>(n)) - 0.5f);
}
//
- // Fallthrough: i is too large to use table lookup, try the
+ // Fallthrough: i is too large to use table lookup, try the
// gamma function instead.
//
T result = boost::math::tgamma(static_cast<T>(i) / 2 + 1, pol) / sqrt(constants::pi<T>());
if(ldexp(tools::max_value<T>(), -static_cast<int>(i+1) / 2) > result)
- return ceil(result * ldexp(T(1), (i+1) / 2) - 0.5f);
+ return ceil(result * ldexp(T(1), static_cast<int>(i+1) / 2) - 0.5f);
}
else
{
@@ -181,7 +188,7 @@
//
// Simple case: just the ratio of two
// (positive argument) gamma functions.
- // Note that we don't optimise this for small n,
+ // Note that we don't optimise this for small n,
// because tgamma_delta_ratio is alreay optimised
// for that use case:
//
@@ -191,7 +198,7 @@
} // namespace detail
template <class RT>
-inline typename tools::promote_args<RT>::type
+inline typename tools::promote_args<RT>::type
falling_factorial(RT x, unsigned n)
{
typedef typename tools::promote_args<RT>::type result_type;
@@ -200,7 +207,7 @@
}
template <class RT, class Policy>
-inline typename tools::promote_args<RT>::type
+inline typename tools::promote_args<RT>::type
falling_factorial(RT x, unsigned n, const Policy& pol)
{
typedef typename tools::promote_args<RT>::type result_type;
@@ -209,7 +216,7 @@
}
template <class RT>
-inline typename tools::promote_args<RT>::type
+inline typename tools::promote_args<RT>::type
rising_factorial(RT x, int n)
{
typedef typename tools::promote_args<RT>::type result_type;
@@ -218,7 +225,7 @@
}
template <class RT, class Policy>
-inline typename tools::promote_args<RT>::type
+inline typename tools::promote_args<RT>::type
rising_factorial(RT x, int n, const Policy& pol)
{
typedef typename tools::promote_args<RT>::type result_type;
Modified: branches/release/boost/math/special_functions/legendre.hpp
==============================================================================
--- branches/release/boost/math/special_functions/legendre.hpp (original)
+++ branches/release/boost/math/special_functions/legendre.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -164,7 +164,7 @@
{
BOOST_MATH_STD_USING
// TODO: we really could use that mythical "pow1p" function here:
- return legendre_p_imp(l, m, x, pow(1 - x*x, T(abs(m))/2), pol);
+ return legendre_p_imp(l, m, x, static_cast<T>(pow(1 - x*x, T(abs(m))/2)), pol);
}
}
Modified: branches/release/boost/math/special_functions/round.hpp
==============================================================================
--- branches/release/boost/math/special_functions/round.hpp (original)
+++ branches/release/boost/math/special_functions/round.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -21,7 +21,7 @@
{
BOOST_MATH_STD_USING
if(!(boost::math::isfinite)(v))
- return policies::raise_rounding_error("boost::math::round<%1%>(%1%)", 0, v, pol);
+ return policies::raise_rounding_error("boost::math::round<%1%>(%1%)", 0, v, v, pol);
return v < 0 ? static_cast<T>(ceil(v - 0.5f)) : static_cast<T>(floor(v + 0.5f));
}
template <class T>
@@ -44,7 +44,7 @@
BOOST_MATH_STD_USING
T r = boost::math::round(v, pol);
if(fabs(r) > (std::numeric_limits<int>::max)())
- return static_cast<int>(policies::raise_rounding_error("boost::math::iround<%1%>(%1%)", 0, v, pol));
+ return static_cast<int>(policies::raise_rounding_error("boost::math::iround<%1%>(%1%)", 0, v, 0, pol));
return static_cast<int>(r);
}
template <class T>
@@ -59,7 +59,7 @@
BOOST_MATH_STD_USING
T r = boost::math::round(v, pol);
if(fabs(r) > (std::numeric_limits<long>::max)())
- return static_cast<long int>(policies::raise_rounding_error("boost::math::lround<%1%>(%1%)", 0, v, pol));
+ return static_cast<long int>(policies::raise_rounding_error("boost::math::lround<%1%>(%1%)", 0, v, 0L, pol));
return static_cast<long int>(r);
}
template <class T>
@@ -76,7 +76,7 @@
BOOST_MATH_STD_USING
T r = boost::math::round(v, pol);
if(fabs(r) > (std::numeric_limits<boost::long_long_type>::max)())
- return static_cast<boost::long_long_type>(policies::raise_rounding_error("boost::math::llround<%1%>(%1%)", 0, v, pol));
+ return static_cast<boost::long_long_type>(policies::raise_rounding_error("boost::math::llround<%1%>(%1%)", 0, v, 0LL, pol));
return static_cast<boost::long_long_type>(r);
}
template <class T>
Modified: branches/release/boost/math/special_functions/trunc.hpp
==============================================================================
--- branches/release/boost/math/special_functions/trunc.hpp (original)
+++ branches/release/boost/math/special_functions/trunc.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -21,7 +21,7 @@
{
BOOST_MATH_STD_USING
if(!(boost::math::isfinite)(v))
- return policies::raise_rounding_error("boost::math::trunc<%1%>(%1%)", 0, v, pol);
+ return policies::raise_rounding_error("boost::math::trunc<%1%>(%1%)", 0, v, v, pol);
return (v >= 0) ? static_cast<T>(floor(v)) : static_cast<T>(ceil(v));
}
template <class T>
@@ -44,7 +44,7 @@
BOOST_MATH_STD_USING
T r = boost::math::trunc(v, pol);
if(fabs(r) > (std::numeric_limits<int>::max)())
- return static_cast<int>(policies::raise_rounding_error("boost::math::itrunc<%1%>(%1%)", 0, v, pol));
+ return static_cast<int>(policies::raise_rounding_error("boost::math::itrunc<%1%>(%1%)", 0, 0, v, pol));
return static_cast<int>(r);
}
template <class T>
@@ -59,7 +59,7 @@
BOOST_MATH_STD_USING
T r = boost::math::trunc(v, pol);
if(fabs(r) > (std::numeric_limits<long>::max)())
- return static_cast<long>(policies::raise_rounding_error("boost::math::ltrunc<%1%>(%1%)", 0, v, pol));
+ return static_cast<long>(policies::raise_rounding_error("boost::math::ltrunc<%1%>(%1%)", 0, 0L, v, pol));
return static_cast<long>(r);
}
template <class T>
@@ -76,7 +76,7 @@
BOOST_MATH_STD_USING
T r = boost::math::trunc(v, pol);
if(fabs(r) > (std::numeric_limits<boost::long_long_type>::max)())
- return static_cast<boost::long_long_type>(policies::raise_rounding_error("boost::math::lltrunc<%1%>(%1%)", 0, v, pol));
+ return static_cast<boost::long_long_type>(policies::raise_rounding_error("boost::math::lltrunc<%1%>(%1%)", 0, v, 0LL, pol));
return static_cast<boost::long_long_type>(r);
}
template <class T>
Modified: branches/release/boost/math/tools/config.hpp
==============================================================================
--- branches/release/boost/math/tools/config.hpp (original)
+++ branches/release/boost/math/tools/config.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -257,7 +257,7 @@
#if (defined(__linux__) && !defined(__UCLIBC__)) || defined(__QNX__) || defined(__IBMCPP__)
- #include <fenv.h>
+ #include <boost/detail/fenv.hpp>
namespace boost{ namespace math{
namespace detail
Modified: branches/release/boost/math/tools/promotion.hpp
==============================================================================
--- branches/release/boost/math/tools/promotion.hpp (original)
+++ branches/release/boost/math/tools/promotion.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -33,6 +33,7 @@
#include <boost/mpl/if.hpp> // for boost::mpl::if_c.
#include <boost/mpl/and.hpp> // for boost::mpl::if_c.
#include <boost/mpl/or.hpp> // for boost::mpl::if_c.
+#include <boost/mpl/not.hpp> // for boost::mpl::if_c.
#ifdef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
#include <boost/static_assert.hpp>
@@ -93,7 +94,7 @@
>::type
>::type,
// else one or the other is a user-defined type:
- typename mpl::if_< ::boost::is_convertible<T1P, T2P>, T2P, T1P>::type>::type type;
+ typename mpl::if_< typename mpl::and_<mpl::not_<is_floating_point<T2P> >, ::boost::is_convertible<T1P, T2P> >, T2P, T1P>::type>::type type;
}; // promote_arg2
// These full specialisations reduce mpl::if_ usage and speed up
// compilation:
Modified: branches/release/libs/math/build/Jamfile.v2
==============================================================================
--- branches/release/libs/math/build/Jamfile.v2 (original)
+++ branches/release/libs/math/build/Jamfile.v2 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -16,7 +16,7 @@
#<toolset>gcc:<cxxflags>-fvisibility=hidden
<toolset>intel-linux:<cxxflags>-fvisibility=hidden
<toolset>sun:<cxxflags>-xldscope=hidden
- [ check-target-builds ../config//has_gcc_visibility : <cxxflags>-fvisibility=hidden : ]
+ [ check-target-builds ../config//has_gcc_visibility : <toolset>gcc:<cxxflags>-fvisibility=hidden : ]
;
cpp-pch pch : ../src/tr1/pch.hpp : <include>../src/tr1 <link>shared:<define>BOOST_MATH_TR1_DYN_LINK=1 ;
Modified: branches/release/libs/math/config/Jamfile.v2
==============================================================================
--- branches/release/libs/math/config/Jamfile.v2 (original)
+++ branches/release/libs/math/config/Jamfile.v2 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -12,6 +12,8 @@
obj has_long_double_support : has_long_double_support.cpp ;
obj has_mpfr_class : has_mpfr_class.cpp :
<include>$(gmp_path) <include>$(gmp_path)/mpfr <include>$(gmp_path)/gmpfrxx ;
+obj has_mpreal : has_mpreal.cpp :
+ <include>$(gmp_path) <include>$(gmp_path)/mpfr <include>$(gmp_path)/mpfrc++ ;
obj has_ntl_rr : has_ntl_rr.cpp : <include>$(ntl-path)/include ;
obj has_gmpxx : has_gmpxx.cpp :
<include>$(gmp_path) <include>$(gmp_path)/mpfr <include>$(gmp_path)/gmpfrxx ;
@@ -20,9 +22,8 @@
explicit has_long_double_support ;
explicit has_mpfr_class ;
+explicit has_mpreal ;
explicit has_ntl_rr ;
explicit has_gmpxx ;
explicit has_gcc_visibility ;
-
-
Modified: branches/release/libs/math/doc/complex/complex-tr1.qbk
==============================================================================
--- branches/release/libs/math/doc/complex/complex-tr1.qbk (original)
+++ branches/release/libs/math/doc/complex/complex-tr1.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -21,7 +21,7 @@
[template tr1[] [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf Technical Report on C++ Library Extensions]]
This manual is also available in
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/complex-tr1.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
printer friendly PDF format].
[section:inverse_complex Complex Number Inverse Trigonometric Functions]
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Complex Number Inverse Trigonometric Functions</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../index.html" title="Complex Number TR1 Algorithms">
<link rel="prev" href="../index.html" title="Complex Number TR1 Algorithms">
@@ -22,26 +22,20 @@
<div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_complex/implementation.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="complex_number_tr1_algorithms.inverse_complex"></a><a class="link" href="inverse_complex.html" title="Complex Number Inverse Trigonometric Functions"> Complex
+<a name="complex_number_tr1_algorithms.inverse_complex"></a><a class="link" href="inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">Complex
Number Inverse Trigonometric Functions</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="inverse_complex/implementation.html">
- Implementation and Accuracy</a></span></dt>
-<dt><span class="section"><a href="inverse_complex/asin.html">
- asin</a></span></dt>
-<dt><span class="section"><a href="inverse_complex/acos.html">
- acos</a></span></dt>
-<dt><span class="section"><a href="inverse_complex/atan.html">
- atan</a></span></dt>
-<dt><span class="section"><a href="inverse_complex/asinh.html">
- asinh</a></span></dt>
-<dt><span class="section"><a href="inverse_complex/acosh.html">
- acosh</a></span></dt>
-<dt><span class="section"><a href="inverse_complex/atanh.html">
- atanh</a></span></dt>
+<dt><span class="section"><a href="inverse_complex/implementation.html">Implementation
+ and Accuracy</a></span></dt>
+<dt><span class="section">asin</span></dt>
+<dt><span class="section">acos</span></dt>
+<dt><span class="section">atan</span></dt>
+<dt><span class="section">asinh</span></dt>
+<dt><span class="section">acosh</span></dt>
+<dt><span class="section">atanh</span></dt>
<dt><span class="section">History</span></dt>
</dl></div>
<p>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acos.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acos.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acos.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>acos</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="asin.html" title="asin">
@@ -22,19 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="asin.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="atan.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="complex_number_tr1_algorithms.inverse_complex.acos"></a><a class="link" href="acos.html" title="acos">
- acos</a>
+<a name="complex_number_tr1_algorithms.inverse_complex.acos"></a><a class="link" href="acos.html" title="acos">acos</a>
</h3></div></div></div>
<a name="complex_number_tr1_algorithms.inverse_complex.acos.header_"></a><h5>
-<a name="id760032"></a>
+<a name="id996888"></a>
<a class="link" href="acos.html#complex_number_tr1_algorithms.inverse_complex.acos.header_">Header:</a>
</h5>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">complex</span><span class="special">/</span><span class="identifier">acos</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="complex_number_tr1_algorithms.inverse_complex.acos.synopsis_"></a><h5>
-<a name="id760104"></a>
+<a name="id996955"></a>
<a class="link" href="acos.html#complex_number_tr1_algorithms.inverse_complex.acos.synopsis_">Synopsis:</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acosh.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acosh.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/acosh.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>acosh</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="asinh.html" title="asinh">
@@ -22,19 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="asinh.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="atanh.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="complex_number_tr1_algorithms.inverse_complex.acosh"></a><a class="link" href="acosh.html" title="acosh">
- acosh</a>
+<a name="complex_number_tr1_algorithms.inverse_complex.acosh"></a><a class="link" href="acosh.html" title="acosh">acosh</a>
</h3></div></div></div>
<a name="complex_number_tr1_algorithms.inverse_complex.acosh.header_"></a><h5>
-<a name="id760740"></a>
+<a name="id997539"></a>
<a class="link" href="acosh.html#complex_number_tr1_algorithms.inverse_complex.acosh.header_">Header:</a>
</h5>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">complex</span><span class="special">/</span><span class="identifier">acosh</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="complex_number_tr1_algorithms.inverse_complex.acosh.synopsis_"></a><h5>
-<a name="id760813"></a>
+<a name="id997606"></a>
<a class="link" href="acosh.html#complex_number_tr1_algorithms.inverse_complex.acosh.synopsis_">Synopsis:</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asin.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asin.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asin.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>asin</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="implementation.html" title="Implementation and Accuracy">
@@ -22,19 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="implementation.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acos.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="complex_number_tr1_algorithms.inverse_complex.asin"></a><a class="link" href="asin.html" title="asin">
- asin</a>
+<a name="complex_number_tr1_algorithms.inverse_complex.asin"></a><a class="link" href="asin.html" title="asin">asin</a>
</h3></div></div></div>
<a name="complex_number_tr1_algorithms.inverse_complex.asin.header_"></a><h5>
-<a name="id759795"></a>
+<a name="id996670"></a>
<a class="link" href="asin.html#complex_number_tr1_algorithms.inverse_complex.asin.header_">Header:</a>
</h5>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">complex</span><span class="special">/</span><span class="identifier">asin</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="complex_number_tr1_algorithms.inverse_complex.asin.synopsis_"></a><h5>
-<a name="id759868"></a>
+<a name="id996738"></a>
<a class="link" href="asin.html#complex_number_tr1_algorithms.inverse_complex.asin.synopsis_">Synopsis:</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asinh.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asinh.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/asinh.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>asinh</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="atan.html" title="atan">
@@ -22,19 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="atan.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acosh.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="complex_number_tr1_algorithms.inverse_complex.asinh"></a><a class="link" href="asinh.html" title="asinh">
- asinh</a>
+<a name="complex_number_tr1_algorithms.inverse_complex.asinh"></a><a class="link" href="asinh.html" title="asinh">asinh</a>
</h3></div></div></div>
<a name="complex_number_tr1_algorithms.inverse_complex.asinh.header_"></a><h5>
-<a name="id760504"></a>
+<a name="id997322"></a>
<a class="link" href="asinh.html#complex_number_tr1_algorithms.inverse_complex.asinh.header_">Header:</a>
</h5>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">complex</span><span class="special">/</span><span class="identifier">asinh</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="complex_number_tr1_algorithms.inverse_complex.asinh.synopsis_"></a><h5>
-<a name="id760577"></a>
+<a name="id997389"></a>
<a class="link" href="asinh.html#complex_number_tr1_algorithms.inverse_complex.asinh.synopsis_">Synopsis:</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atan.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atan.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atan.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>atan</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="acos.html" title="acos">
@@ -22,19 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="acos.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="asinh.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="complex_number_tr1_algorithms.inverse_complex.atan"></a><a class="link" href="atan.html" title="atan">
- atan</a>
+<a name="complex_number_tr1_algorithms.inverse_complex.atan"></a><a class="link" href="atan.html" title="atan">atan</a>
</h3></div></div></div>
<a name="complex_number_tr1_algorithms.inverse_complex.atan.header_"></a><h5>
-<a name="id760268"></a>
+<a name="id997105"></a>
<a class="link" href="atan.html#complex_number_tr1_algorithms.inverse_complex.atan.header_">Header:</a>
</h5>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">complex</span><span class="special">/</span><span class="identifier">atan</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="complex_number_tr1_algorithms.inverse_complex.atan.synopsis_"></a><h5>
-<a name="id760340"></a>
+<a name="id997172"></a>
<a class="link" href="atan.html#complex_number_tr1_algorithms.inverse_complex.atan.synopsis_">Synopsis:</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atanh.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atanh.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/atanh.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>atanh</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="acosh.html" title="acosh">
@@ -22,19 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="acosh.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="complex_number_tr1_algorithms.inverse_complex.atanh"></a><a class="link" href="atanh.html" title="atanh">
- atanh</a>
+<a name="complex_number_tr1_algorithms.inverse_complex.atanh"></a><a class="link" href="atanh.html" title="atanh">atanh</a>
</h3></div></div></div>
<a name="complex_number_tr1_algorithms.inverse_complex.atanh.header_"></a><h5>
-<a name="id760977"></a>
+<a name="id997756"></a>
<a class="link" href="atanh.html#complex_number_tr1_algorithms.inverse_complex.atanh.header_">Header:</a>
</h5>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">complex</span><span class="special">/</span><span class="identifier">atanh</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="complex_number_tr1_algorithms.inverse_complex.atanh.synopsis_"></a><h5>
-<a name="id761049"></a>
+<a name="id997824"></a>
<a class="link" href="atanh.html#complex_number_tr1_algorithms.inverse_complex.atanh.synopsis_">Synopsis:</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/history.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/history.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/history.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>History</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="atanh.html" title="atanh">
@@ -21,15 +21,15 @@
<div class="spirit-nav">
<a accesskey="p" href="atanh.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="complex_number_tr1_algorithms.inverse_complex.history"></a><a class="link" href="history.html" title="History">History</a>
</h3></div></div></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
+<div class="itemizedlist"><ul type="disc">
+<li>
2005/12/17: Added support for platforms with no meaningful numeric_limits<>::infinity().
</li>
-<li class="listitem">
+<li>
2005/12/01: Initial version, added as part of the TR1 library.
</li>
</ul></div>
Modified: branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/implementation.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/implementation.html (original)
+++ branches/release/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex/implementation.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Implementation and Accuracy</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Complex Number TR1 Algorithms">
<link rel="up" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
<link rel="prev" href="../inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
@@ -22,10 +22,10 @@
<div class="spirit-nav">
<a accesskey="p" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inverse_complex.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="asin.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="complex_number_tr1_algorithms.inverse_complex.implementation"></a><a class="link" href="implementation.html" title="Implementation and Accuracy">
- Implementation and Accuracy</a>
+<a name="complex_number_tr1_algorithms.inverse_complex.implementation"></a><a class="link" href="implementation.html" title="Implementation and Accuracy">Implementation
+ and Accuracy</a>
</h3></div></div></div>
<p>
Although there are deceptively simple formulae available for all of these
Modified: branches/release/libs/math/doc/complex/html/index.html
==============================================================================
--- branches/release/libs/math/doc/complex/html/index.html (original)
+++ branches/release/libs/math/doc/complex/html/index.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Complex Number TR1 Algorithms</title>
<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="index.html" title="Complex Number TR1 Algorithms">
<link rel="next" href="complex_number_tr1_algorithms/inverse_complex.html" title="Complex Number Inverse Trigonometric Functions">
</head>
@@ -18,7 +18,7 @@
</tr></table>
<hr>
<div class="spirit-nav"><a accesskey="n" href="complex_number_tr1_algorithms/inverse_complex.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
-<div class="article">
+<div class="article" lang="en">
<div class="titlepage">
<div>
<div><h2 class="title">
@@ -28,7 +28,7 @@
</h3></div></div></div>
<div><p class="copyright">Copyright © 2005 John Maddock</p></div>
<div><div class="legalnotice">
-<a name="id759702"></a><p>
+<a name="id996589"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -39,29 +39,23 @@
<div class="toc">
<p><b>Table of Contents</b></p>
<dl>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex.html"> Complex
+<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex.html">Complex
Number Inverse Trigonometric Functions</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/implementation.html">
- Implementation and Accuracy</a></span></dt>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/asin.html">
- asin</a></span></dt>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/acos.html">
- acos</a></span></dt>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/atan.html">
- atan</a></span></dt>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/asinh.html">
- asinh</a></span></dt>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/acosh.html">
- acosh</a></span></dt>
-<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/atanh.html">
- atanh</a></span></dt>
+<dt><span class="section"><a href="complex_number_tr1_algorithms/inverse_complex/implementation.html">Implementation
+ and Accuracy</a></span></dt>
+<dt><span class="section">asin</span></dt>
+<dt><span class="section">acos</span></dt>
+<dt><span class="section">atan</span></dt>
+<dt><span class="section">asinh</span></dt>
+<dt><span class="section">acosh</span></dt>
+<dt><span class="section">atanh</span></dt>
<dt><span class="section">History</span></dt>
</dl></dd>
</dl>
</div>
<p>
- This manual is also available in <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/complex-tr1.pdf" target="_top">printer
+ This manual is also available in <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">printer
friendly PDF format</a>.
</p>
</div>
Modified: branches/release/libs/math/doc/distexplorer/distexplorer.qbk
==============================================================================
--- branches/release/libs/math/doc/distexplorer/distexplorer.qbk (original)
+++ branches/release/libs/math/doc/distexplorer/distexplorer.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -54,7 +54,7 @@
*probability density (or mass) function (PDF)
*cumulative distribution function (CDF), and complement
-*Quantiles (percentiles) are calculated for typical risk (alpha) probabilities (0.001, 0.01, 0.5, 0.1, 0.333)
+*Quantiles (percentiles or fractiles) are calculated for typical risk (alpha) probabilities (0.001, 0.01, 0.5, 0.1, 0.333)
and for additional probabilities provided by the user.
Results can be saved to text files using Save or SaveAs.
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Greatest Common Divisor and Least Common Multiple</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../index.html" title="GCD and LCM">
<link rel="up" href="../index.html" title="GCD and LCM">
<link rel="prev" href="../index.html" title="GCD and LCM">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="gcd_lcm/introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="gcd_and_lcm.gcd_lcm"></a><a class="link" href="gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple"> Greatest Common Divisor and Least
+<a name="gcd_and_lcm.gcd_lcm"></a><a class="link" href="gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">Greatest Common Divisor and Least
Common Multiple</a>
</h2></div></div></div>
<div class="toc"><dl>
@@ -34,12 +34,12 @@
Object</a></span></dt>
<dt><span class="section"><a href="gcd_lcm/lcm_function_object.html">LCM Function
Object</a></span></dt>
-<dt><span class="section"><a href="gcd_lcm/run_time.html"> Run-time GCD & LCM
+<dt><span class="section"><a href="gcd_lcm/run_time.html">Run-time GCD & LCM
Determination</a></span></dt>
-<dt><span class="section"><a href="gcd_lcm/compile_time.html"> Compile time GCD and
+<dt><span class="section"><a href="gcd_lcm/compile_time.html">Compile time GCD and
LCM determination</a></span></dt>
-<dt><span class="section"> Header <boost/math/common_factor.hpp></span></dt>
-<dt><span class="section"> Demonstration Program</span></dt>
+<dt><span class="section">Header <boost/math/common_factor.hpp></span></dt>
+<dt><span class="section">Demonstration Program</span></dt>
<dt><span class="section">Rationale</span></dt>
<dt><span class="section">History</span></dt>
<dt><span class="section">Credits</span></dt>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/compile_time.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/compile_time.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/compile_time.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Compile time GCD and LCM determination</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="run_time.html" title="Run-time GCD & LCM Determination">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="run_time.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="header.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="gcd_and_lcm.gcd_lcm.compile_time"></a><a class="link" href="compile_time.html" title="Compile time GCD and LCM determination"> Compile time GCD and
+<a name="gcd_and_lcm.gcd_lcm.compile_time"></a><a class="link" href="compile_time.html" title="Compile time GCD and LCM determination">Compile time GCD and
LCM determination</a>
</h3></div></div></div>
<p>
@@ -59,7 +59,7 @@
range of <code class="computeroutput"><span class="identifier">static_gcd_type</span></code>.
</p>
<a name="gcd_and_lcm.gcd_lcm.compile_time.example"></a><h4>
-<a name="id761333"></a>
+<a name="id981562"></a>
<a class="link" href="compile_time.html#gcd_and_lcm.gcd_lcm.compile_time.example">Example</a>
</h4>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">common_factor</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/credits.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/credits.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/credits.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Credits</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="history.html" title="History">
@@ -21,7 +21,7 @@
<div class="spirit-nav">
<a accesskey="p" href="history.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="gcd_and_lcm.gcd_lcm.credits"></a><a class="link" href="credits.html" title="Credits">Credits</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/demo.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/demo.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/demo.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Demonstration Program</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="header.html" title="Header <boost/math/common_factor.hpp>">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="header.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="gcd_and_lcm.gcd_lcm.demo"></a><a class="link" href="demo.html" title="Demonstration Program"> Demonstration Program</a>
+<a name="gcd_and_lcm.gcd_lcm.demo"></a><a class="link" href="demo.html" title="Demonstration Program">Demonstration Program</a>
</h3></div></div></div>
<p>
The program common_factor_test.cpp
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/gcd_function_object.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/gcd_function_object.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/gcd_function_object.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>GCD Function Object</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="synopsis.html" title="Synopsis">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="synopsis.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lcm_function_object.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="gcd_and_lcm.gcd_lcm.gcd_function_object"></a><a class="link" href="gcd_function_object.html" title="GCD Function Object">GCD Function
Object</a>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/header.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/header.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/header.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Header <boost/math/common_factor.hpp></title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="compile_time.html" title="Compile time GCD and LCM determination">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="compile_time.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="demo.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="gcd_and_lcm.gcd_lcm.header"></a><a class="link" href="header.html" title="Header <boost/math/common_factor.hpp>"> Header <boost/math/common_factor.hpp></a>
+<a name="gcd_and_lcm.gcd_lcm.header"></a><a class="link" href="header.html" title="Header <boost/math/common_factor.hpp>">Header <boost/math/common_factor.hpp></a>
</h3></div></div></div>
<p>
This header simply includes the headers <boost/math/common_factor_ct.hpp>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/history.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/history.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/history.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>History</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="rationale.html" title="Rationale">
@@ -22,18 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="rationale.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="credits.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="gcd_and_lcm.gcd_lcm.history"></a><a class="link" href="history.html" title="History">History</a>
</h3></div></div></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
+<div class="itemizedlist"><ul type="disc">
+<li>
17 Dec 2005: Converted documentation to Quickbook Format.
</li>
-<li class="listitem">
+<li>
2 Jul 2002: Compile-time and run-time items separated to new headers.
</li>
-<li class="listitem">
+<li>
7 Nov 2001: Initial version
</li>
</ul></div>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/introduction.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/introduction.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/introduction.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="gcd_and_lcm.gcd_lcm.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/lcm_function_object.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/lcm_function_object.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/lcm_function_object.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>LCM Function Object</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="gcd_function_object.html" title="GCD Function Object">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="gcd_function_object.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="run_time.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="gcd_and_lcm.gcd_lcm.lcm_function_object"></a><a class="link" href="lcm_function_object.html" title="LCM Function Object">LCM Function
Object</a>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/rationale.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/rationale.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/rationale.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Rationale</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="demo.html" title="Demonstration Program">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="demo.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="gcd_and_lcm.gcd_lcm.rationale"></a><a class="link" href="rationale.html" title="Rationale">Rationale</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/run_time.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/run_time.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/run_time.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Run-time GCD & LCM Determination</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="lcm_function_object.html" title="LCM Function Object">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="lcm_function_object.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compile_time.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="gcd_and_lcm.gcd_lcm.run_time"></a><a class="link" href="run_time.html" title="Run-time GCD & LCM Determination"> Run-time GCD & LCM
+<a name="gcd_and_lcm.gcd_lcm.run_time"></a><a class="link" href="run_time.html" title="Run-time GCD & LCM Determination">Run-time GCD & LCM
Determination</a>
</h3></div></div></div>
<p>
Modified: branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/synopsis.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/synopsis.html (original)
+++ branches/release/libs/math/doc/gcd/html/gcd_and_lcm/gcd_lcm/synopsis.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Synopsis</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="GCD and LCM">
<link rel="up" href="../gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
<link rel="prev" href="introduction.html" title="Introduction">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../gcd_lcm.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="gcd_function_object.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="gcd_and_lcm.gcd_lcm.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/gcd/html/index.html
==============================================================================
--- branches/release/libs/math/doc/gcd/html/index.html (original)
+++ branches/release/libs/math/doc/gcd/html/index.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>GCD and LCM</title>
<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="index.html" title="GCD and LCM">
<link rel="next" href="gcd_and_lcm/gcd_lcm.html" title="Greatest Common Divisor and Least Common Multiple">
</head>
@@ -18,7 +18,7 @@
</tr></table>
<hr>
<div class="spirit-nav"><a accesskey="n" href="gcd_and_lcm/gcd_lcm.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
-<div class="article">
+<div class="article" lang="en">
<div class="titlepage">
<div>
<div><h2 class="title">
@@ -28,7 +28,7 @@
</h3></div></div></div>
<div><p class="copyright">Copyright © 2001 -2002 Daryle Walker</p></div>
<div><div class="legalnotice">
-<a name="id759702"></a><p>
+<a name="id974019"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -39,7 +39,7 @@
<div class="toc">
<p><b>Table of Contents</b></p>
<dl>
-<dt><span class="section"><a href="gcd_and_lcm/gcd_lcm.html"> Greatest Common Divisor and Least
+<dt><span class="section"><a href="gcd_and_lcm/gcd_lcm.html">Greatest Common Divisor and Least
Common Multiple</a></span></dt>
<dd><dl>
<dt><span class="section">Introduction</span></dt>
@@ -48,12 +48,12 @@
Object</a></span></dt>
<dt><span class="section"><a href="gcd_and_lcm/gcd_lcm/lcm_function_object.html">LCM Function
Object</a></span></dt>
-<dt><span class="section"><a href="gcd_and_lcm/gcd_lcm/run_time.html"> Run-time GCD & LCM
+<dt><span class="section"><a href="gcd_and_lcm/gcd_lcm/run_time.html">Run-time GCD & LCM
Determination</a></span></dt>
-<dt><span class="section"><a href="gcd_and_lcm/gcd_lcm/compile_time.html"> Compile time GCD and
+<dt><span class="section"><a href="gcd_and_lcm/gcd_lcm/compile_time.html">Compile time GCD and
LCM determination</a></span></dt>
-<dt><span class="section"> Header <boost/math/common_factor.hpp></span></dt>
-<dt><span class="section"> Demonstration Program</span></dt>
+<dt><span class="section">Header <boost/math/common_factor.hpp></span></dt>
+<dt><span class="section">Demonstration Program</span></dt>
<dt><span class="section">Rationale</span></dt>
<dt><span class="section">History</span></dt>
<dt><span class="section">Credits</span></dt>
@@ -61,7 +61,7 @@
</dl>
</div>
<p>
- This manual is also available in <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math-gcd.pdf" target="_top">printer
+ This manual is also available in <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">printer
friendly PDF format</a>.
</p>
</div>
Modified: branches/release/libs/math/doc/gcd/math-gcd.qbk
==============================================================================
--- branches/release/libs/math/doc/gcd/math-gcd.qbk (original)
+++ branches/release/libs/math/doc/gcd/math-gcd.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -12,7 +12,7 @@
]
This manual is also available in
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math-gcd.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
printer friendly PDF format].
Modified: branches/release/libs/math/doc/html/index.html
==============================================================================
--- branches/release/libs/math/doc/html/index.html (original)
+++ branches/release/libs/math/doc/html/index.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -55,7 +55,7 @@
Hubert Holin, Daryle Walker, Xiaogang Zhang, Bruno Lalande, Johan Råde,
Gautam Sewani and Thijs van den Berg</p></div>
<div><div class="legalnotice">
-<a name="id877658"></a><p>
+<a name="id1005051"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -93,7 +93,7 @@
<a href="../complex/html/index.html" target="_top">HTML Docs</a>
</p>
<p>
- <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/complex-tr1.pdf" target="_top">PDF
+ <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">PDF
Docs</a>
</p>
</td>
@@ -115,7 +115,7 @@
<a href="../gcd/html/index.html" target="_top">HTML Docs</a>
</p>
<p>
- <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math-gcd.pdf" target="_top">PDF
+ <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">PDF
Docs</a>
</p>
</td>
@@ -138,7 +138,7 @@
<a href="../octonion/html/index.html" target="_top">HTML Docs</a>
</p>
<p>
- <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/octonion.pdf" target="_top">PDF
+ <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">PDF
Docs</a>
</p>
</td>
@@ -197,7 +197,7 @@
<a href="../sf_and_dist/html/index.html" target="_top">HTML Docs</a>
</p>
<p>
- <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf" target="_top">PDF
+ <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">PDF
Docs</a>
</p>
</td>
@@ -233,7 +233,7 @@
<a href="../sf_and_dist/html/index.html" target="_top">HTML Docs</a>
</p>
<p>
- <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf" target="_top">PDF
+ <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">PDF
Docs</a>
</p>
</td>
@@ -263,7 +263,7 @@
<a href="../quaternion/html/index.html" target="_top">HTML Docs</a>
</p>
<p>
- <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/quaternion.pdf" target="_top">PDF
+ <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">PDF
Docs</a>
</p>
</td>
Modified: branches/release/libs/math/doc/math.qbk
==============================================================================
--- branches/release/libs/math/doc/math.qbk (original)
+++ branches/release/libs/math/doc/math.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -36,7 +36,7 @@
[@../complex/html/index.html HTML Docs]
- [@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/complex-tr1.pdf
+ [@http://sourceforge.net/projects/boost/files/boost-docs/
PDF Docs]]
[
These complex number algorithms are the inverses of trigonometric functions currently
@@ -48,7 +48,7 @@
[@../gcd/html/index.html HTML Docs]
- [@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math-gcd.pdf
+ [@http://sourceforge.net/projects/boost/files/boost-docs/
PDF Docs]]
[
The class and function templates in <boost/math/common_factor.hpp>
@@ -62,7 +62,7 @@
[@../octonion/html/index.html HTML Docs]
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/octonion.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
PDF Docs]]
[
Octonions, like [@../quaternion/html/index.html quaternions], are a relative of complex numbers.
@@ -97,7 +97,7 @@
[@../sf_and_dist/html/index.html HTML Docs]
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
PDF Docs]]
[ Provides a number of high quality special functions, initially
@@ -122,7 +122,7 @@
[@../sf_and_dist/html/index.html HTML Docs]
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
PDF Docs]]
[Provides a reasonably comprehensive set of statistical distributions,
@@ -139,7 +139,7 @@
[@../quaternion/html/index.html HTML Docs]
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/quaternion.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
PDF Docs]]
[
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonions</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../index.html" title="Boost.Octonions">
<link rel="up" href="../index.html" title="Boost.Octonions">
<link rel="prev" href="../index.html" title="Boost.Octonions">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="octonions/overview.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_octonions.octonions"></a><a class="link" href="octonions.html" title="Octonions">Octonions</a>
</h2></div></div></div>
@@ -38,11 +38,11 @@
Member Typedefs</a></span></dt>
<dt><span class="section"><a href="octonions/octonion_member_functions.html">Octonion
Member Functions</a></span></dt>
-<dt><span class="section"><a href="octonions/non_mem.html"> Octonion Non-Member
+<dt><span class="section"><a href="octonions/non_mem.html">Octonion Non-Member
Operators</a></span></dt>
<dt><span class="section"><a href="octonions/octonion_value_operations.html">Octonion
Value Operations</a></span></dt>
-<dt><span class="section"><a href="octonions/oct_create.html"> Octonion Creation
+<dt><span class="section"><a href="octonions/oct_create.html">Octonion Creation
Functions</a></span></dt>
<dt><span class="section"><a href="octonions/octonions_transcendentals.html">Octonions
Transcendentals</a></span></dt>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/acknowledgements.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/acknowledgements.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/acknowledgements.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Acknowledgements</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="test_program.html" title="Test Program">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="test_program.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements">Acknowledgements</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/header_file.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/header_file.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/header_file.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Header File</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="overview.html" title="Overview">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.header_file"></a><a class="link" href="header_file.html" title="Header File">Header File</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/history.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/history.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/history.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>History</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="acknowledgements.html" title="Acknowledgements">
@@ -22,41 +22,41 @@
<div class="spirit-nav">
<a accesskey="p" href="acknowledgements.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="to_do.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.history"></a><a class="link" href="history.html" title="History">History</a>
</h3></div></div></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
+<div class="itemizedlist"><ul type="disc">
+<li>
1.5.8 - 17/12/2005: Converted documentation to Quickbook Format.
</li>
-<li class="listitem">
+<li>
1.5.7 - 25/02/2003: transitionned to the unit test framework; <boost/config.hpp>
now included by the library header (rather than the test files), via
<boost/math/quaternion.hpp>.
</li>
-<li class="listitem">
+<li>
1.5.6 - 15/10/2002: Gcc2.95.x and stlport on linux compatibility by Alkis
Evlogimenos (alkis_at_[hidden]).
</li>
-<li class="listitem">
+<li>
1.5.5 - 27/09/2002: Microsoft VCPP 7 compatibility, by Michael Stevens
(michael_at_[hidden]); requires the /Za compiler option.
</li>
-<li class="listitem">
+<li>
1.5.4 - 19/09/2002: fixed problem with multiple inclusion (in different
translation units); attempt at an improved compatibility with Microsoft
compilers, by Michael Stevens (michael_at_[hidden]) and Fredrik
Blomqvist; other compatibility fixes.
</li>
-<li class="listitem">
+<li>
1.5.3 - 01/02/2002: bugfix and Gcc 2.95.3 compatibility by Douglas Gregor
(gregod_at_[hidden]).
</li>
-<li class="listitem">
+<li>
1.5.2 - 07/07/2001: introduced namespace math.
</li>
-<li class="listitem">
+<li>
1.5.1 - 07/06/2001: (end of Boost review) now includes <boost/math/special_functions/sinc.hpp>
and <boost/math/special_functions/sinhc.hpp> instead of <boost/special_functions.hpp>;
corrected bug in sin (Daryle Walker); removed check for self-assignment
@@ -65,30 +65,30 @@
added sup and l1; used Vesa Karvonen's CPP metaprograming technique to
simplify code.
</li>
-<li class="listitem">
+<li>
1.5.0 - 23/03/2001: boostification, inlining of all operators except
input, output and pow, fixed exception safety of some members (template
version).
</li>
-<li class="listitem">
+<li>
1.4.0 - 09/01/2001: added tan and tanh.
</li>
-<li class="listitem">
+<li>
1.3.1 - 08/01/2001: cosmetic fixes.
</li>
-<li class="listitem">
+<li>
1.3.0 - 12/07/2000: pow now uses Maarten Hilferink's (mhilferink_at_[hidden])
algorithm.
</li>
-<li class="listitem">
+<li>
1.2.0 - 25/05/2000: fixed the division operators and output; changed
many signatures.
</li>
-<li class="listitem">
+<li>
1.1.0 - 23/05/2000: changed sinc into sinc_pi; added sin, cos, sinh,
cosh.
</li>
-<li class="listitem">
+<li>
1.0.0 - 10/08/1999: first public version.
</li>
</ul></div>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/non_mem.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/non_mem.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/non_mem.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonion Non-Member Operators</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="octonion_member_functions.html" title="Octonion Member Functions">
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="octonion_member_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="octonion_value_operations.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_octonions.octonions.non_mem"></a><a class="link" href="non_mem.html" title="Octonion Non-Member Operators"> Octonion Non-Member
+<a name="boost_octonions.octonions.non_mem"></a><a class="link" href="non_mem.html" title="Octonion Non-Member Operators">Octonion Non-Member
Operators</a>
</h3></div></div></div>
<a name="boost_octonions.octonions.non_mem.unary_plus_and_minus_operators"></a><h5>
-<a name="id789630"></a>
+<a name="id1049960"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.unary_plus_and_minus_operators">Unary
Plus and Minus Operators</a>
</h5>
@@ -43,7 +43,7 @@
This unary operator returns the opposite of o.
</p>
<a name="boost_octonions.octonions.non_mem.binary_addition_operators"></a><h5>
-<a name="id789867"></a>
+<a name="id1050156"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.binary_addition_operators">Binary
Addition Operators</a>
</h5>
@@ -60,7 +60,7 @@
<span class="identifier">rhs</span></code>.
</p>
<a name="boost_octonions.octonions.non_mem.binary_subtraction_operators"></a><h5>
-<a name="id790941"></a>
+<a name="id1051612"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.binary_subtraction_operators">Binary
Subtraction Operators</a>
</h5>
@@ -77,7 +77,7 @@
<span class="identifier">rhs</span></code>.
</p>
<a name="boost_octonions.octonions.non_mem.binary_multiplication_operators"></a><h5>
-<a name="id792016"></a>
+<a name="id1052513"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.binary_multiplication_operators">Binary
Multiplication Operators</a>
</h5>
@@ -94,7 +94,7 @@
<span class="identifier">rhs</span></code>.
</p>
<a name="boost_octonions.octonions.non_mem.binary_division_operators"></a><h5>
-<a name="id793089"></a>
+<a name="id1053414"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.binary_division_operators">Binary
Division Operators</a>
</h5>
@@ -112,7 +112,7 @@
to divide by zero...
</p>
<a name="boost_octonions.octonions.non_mem.binary_equality_operators"></a><h5>
-<a name="id794164"></a>
+<a name="id1055411"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.binary_equality_operators">Binary
Equality Operators</a>
</h5>
@@ -130,7 +130,7 @@
with any floating-type entity, this is essentially meaningless.
</p>
<a name="boost_octonions.octonions.non_mem.binary_inequality_operators"></a><h5>
-<a name="id795169"></a>
+<a name="id1056254"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.binary_inequality_operators">Binary
Inequality Operators</a>
</h5>
@@ -148,7 +148,7 @@
false. As with any floating-type entity, this is essentially meaningless.
</p>
<a name="boost_octonions.octonions.non_mem.stream_extractor"></a><h5>
-<a name="id796174"></a>
+<a name="id1057098"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.stream_extractor">Stream
Extractor</a>
</h5>
@@ -170,7 +170,7 @@
Returns <code class="computeroutput"><span class="identifier">is</span></code>.
</p>
<a name="boost_octonions.octonions.non_mem.stream_inserter"></a><h5>
-<a name="id796500"></a>
+<a name="id1057358"></a>
<a class="link" href="non_mem.html#boost_octonions.octonions.non_mem.stream_inserter">Stream
Inserter</a>
</h5>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/oct_create.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/oct_create.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/oct_create.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonion Creation Functions</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="octonion_value_operations.html" title="Octonion Value Operations">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="octonion_value_operations.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="octonions_transcendentals.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_octonions.octonions.oct_create"></a><a class="link" href="oct_create.html" title="Octonion Creation Functions"> Octonion Creation
+<a name="boost_octonions.octonions.oct_create"></a><a class="link" href="oct_create.html" title="Octonion Creation Functions">Octonion Creation
Functions</a>
</h3></div></div></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">octonion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">spherical</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">rho</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">theta</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">phi1</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&
;</span> <span class="identifier">phi2</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">phi3</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">phi4</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">phi5</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">phi6</span><span class="special">);</span>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_functions.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_functions.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_functions.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonion Member Functions</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="octonion_member_typedefs.html" title="Octonion Member Typedefs">
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="octonion_member_typedefs.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_mem.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.octonion_member_functions"></a><a class="link" href="octonion_member_functions.html" title="Octonion Member Functions">Octonion
Member Functions</a>
</h3></div></div></div>
<a name="boost_octonions.octonions.octonion_member_functions.constructors"></a><h4>
-<a name="id782528"></a>
+<a name="id1043217"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">Constructors</a>
</h4>
<p>
@@ -85,12 +85,12 @@
function in a "detail" subnamespace.
</p>
<a name="boost_octonions.octonions.octonion_member_functions.other_member_functions"></a><h4>
-<a name="id786632"></a>
+<a name="id1046452"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.other_member_functions">Other
member functions</a>
</h4>
<a name="boost_octonions.octonions.octonion_member_functions.real_and_unreal_parts"></a><h5>
-<a name="id786654"></a>
+<a name="id1046466"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.real_and_unreal_parts">Real
and Unreal Parts</a>
</h5>
@@ -105,7 +105,7 @@
These are returned by the first two functions.
</p>
<a name="boost_octonions.octonions.octonion_member_functions.individual_real_components"></a><h5>
-<a name="id786755"></a>
+<a name="id1046540"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.individual_real_components">Individual
Real Components</a>
</h5>
@@ -123,7 +123,7 @@
functions. Hence real and R_component_1 return the same value.
</p>
<a name="boost_octonions.octonions.octonion_member_functions.individual_complex_components"></a><h5>
-<a name="id786990"></a>
+<a name="id1046733"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.individual_complex_components">Individual
Complex Components</a>
</h5>
@@ -143,7 +143,7 @@
the basis <span class="emphasis"><em><code class="literal">(1, j, e', j')</code></em></span>.
</p>
<a name="boost_octonions.octonions.octonion_member_functions.individual_quaternion_components"></a><h5>
-<a name="id787271"></a>
+<a name="id1046954"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.individual_quaternion_components">Individual
Quaternion Components</a>
</h5>
@@ -158,12 +158,12 @@
to build the octonion using the constructor.
</p>
<a name="boost_octonions.octonions.octonion_member_functions.octonion_member_operators"></a><h4>
-<a name="id787445"></a>
+<a name="id1047087"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.octonion_member_operators">Octonion
Member Operators</a>
</h4>
<a name="boost_octonions.octonions.octonion_member_functions.assignment_operators"></a><h5>
-<a name="id787468"></a>
+<a name="id1047100"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.assignment_operators">Assignment
Operators</a>
</h5>
@@ -181,7 +181,7 @@
base type's assignment operators must not throw.
</p>
<a name="boost_octonions.octonions.octonion_member_functions.other_member_operators"></a><h5>
-<a name="id787939"></a>
+<a name="id1048581"></a>
<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.other_member_operators">Other
Member Operators</a>
</h5>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_typedefs.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_typedefs.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_member_typedefs.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonion Member Typedefs</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="octonion_specializations.html" title="Octonion Specializations">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="octonion_specializations.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="octonion_member_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.octonion_member_typedefs"></a><a class="link" href="octonion_member_typedefs.html" title="Octonion Member Typedefs">Octonion
Member Typedefs</a>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_specializations.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_specializations.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_specializations.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonion Specializations</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="template_class_octonion.html" title="Template Class octonion">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="template_class_octonion.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="octonion_member_typedefs.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.octonion_specializations"></a><a class="link" href="octonion_specializations.html" title="Octonion Specializations">Octonion
Specializations</a>
@@ -93,15 +93,14 @@
<span class="identifier">octonion</span><span class="special"><</span><span class="keyword">float</span><span class="special">></span> <span class="special">&</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.other_member_operators">operator /=</a> <span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="identifier">X</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">rhs</span><span class="special">);</span>
<span class="special">};</span>
</pre>
-<a name="boost_octonions.octonion_double"></a><p>
- </p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><></span>
<span class="keyword">class</span> <span class="identifier">octonion</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span>
<span class="special">{</span>
<span class="keyword">public</span><span class="special">:</span>
<span class="keyword">typedef</span> <span class="keyword">double</span> <span class="identifier">value_type</span><span class="special">;</span>
- <span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span><span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_a</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_b</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_c</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="specia
l">&</span> <span class="identifier">requested_d</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_e</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_f</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_g</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_
h</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">);</span>
+ <span class="keyword">explicit</span> <a name="boost_octonions.octonion_double"></a>
+<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span><span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_a</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_b</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_c</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">r
equested_d</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_e</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_f</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_g</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_h</span> <span class="special">=</span> <s
pan class="number">0.0</span><span class="special">);</span>
<span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z0</span><span class="special">,</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z1</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><spa
n class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">>(),</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z2</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">>(),</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</s
pan> <span class="special">&</span> <span class="identifier">z3</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">>());</span>
<span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q0</span><span class="special">,</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier
">q1</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">double</span><span class="special">>());</span>
<span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="keyword">float</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">a_recopier</span><span class="special">);</span>
@@ -159,15 +158,14 @@
<span class="identifier">octonion</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="special">&</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.other_member_operators">operator /=</a> <span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="identifier">X</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">rhs</span><span class="special">);</span>
<span class="special">};</span>
</pre>
-<a name="boost_octonions.octonion_long_double"></a><p>
- </p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><></span>
<span class="keyword">class</span> <span class="identifier">octonion</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span>
<span class="special">{</span>
<span class="keyword">public</span><span class="special">:</span>
<span class="keyword">typedef</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">value_type</span><span class="special">;</span>
- <span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_a</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_b</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_c</span> <span class="special">=</span> <span class="number">0.0L</span><span class="sp
ecial">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_d</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_e</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_f</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requeste
d_g</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_h</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">);</span>
+ <span class="keyword">explicit</span> <a name="boost_octonions.octonion_long_double"></a>
+<a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_a</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_b</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_c</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long<
/span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_d</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_e</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_f</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_g</span> <span class="special">=</span> <
span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_h</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">);</span>
<span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z0</span><span class="special">,</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z1</span> <span class="special">=</span> <s
pan class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">>(),</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z2</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">>(),</span> <span class="special">::</span><span class="identifier">std</span><
span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z3</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">>());</span>
<span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q0</span><span class="special">,</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></
span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z1</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">>());</span>
<span class="keyword">explicit</span> <a class="link" href="octonion_member_functions.html#boost_octonions.octonions.octonion_member_functions.constructors">octonion</a><span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="keyword">float</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">a_recopier</span><span class="special">);</span>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_value_operations.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_value_operations.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonion_value_operations.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonion Value Operations</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="non_mem.html" title="Octonion Non-Member Operators">
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="non_mem.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="oct_create.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.octonion_value_operations"></a><a class="link" href="octonion_value_operations.html" title="Octonion Value Operations">Octonion
Value Operations</a>
</h3></div></div></div>
<a name="boost_octonions.octonions.octonion_value_operations.real_and_unreal"></a><h5>
-<a name="id797506"></a>
+<a name="id1058192"></a>
<a class="link" href="octonion_value_operations.html#boost_octonions.octonions.octonion_value_operations.real_and_unreal">Real
and Unreal</a>
</h5>
@@ -41,7 +41,7 @@
respectively.
</p>
<a name="boost_octonions.octonions.octonion_value_operations.conj"></a><h5>
-<a name="id797753"></a>
+<a name="id1058393"></a>
<a class="link" href="octonion_value_operations.html#boost_octonions.octonions.octonion_value_operations.conj">conj</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">octonion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">conj</span><span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">o</span><span class="special">);</span>
@@ -50,7 +50,7 @@
This returns the conjugate of the octonion.
</p>
<a name="boost_octonions.octonions.octonion_value_operations.sup"></a><h5>
-<a name="id797875"></a>
+<a name="id1058494"></a>
<a class="link" href="octonion_value_operations.html#boost_octonions.octonions.octonion_value_operations.sup">sup</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">T</span> <span class="identifier">sup</span><span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">o</span><span class="special">);</span>
@@ -59,7 +59,7 @@
This return the sup norm (the greatest among <code class="computeroutput"><span class="identifier">abs</span><span class="special">(</span><span class="identifier">o</span><span class="special">.</span><span class="identifier">R_component_1</span><span class="special">())...</span><span class="identifier">abs</span><span class="special">(</span><span class="identifier">o</span><span class="special">.</span><span class="identifier">R_component_8</span><span class="special">()))</span></code> of the octonion.
</p>
<a name="boost_octonions.octonions.octonion_value_operations.l1"></a><h5>
-<a name="id798041"></a>
+<a name="id1058627"></a>
<a class="link" href="octonion_value_operations.html#boost_octonions.octonions.octonion_value_operations.l1">l1</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">T</span> <span class="identifier">l1</span><span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">o</span><span class="special">);</span>
@@ -68,7 +68,7 @@
This return the l1 norm (<code class="computeroutput"><span class="identifier">abs</span><span class="special">(</span><span class="identifier">o</span><span class="special">.</span><span class="identifier">R_component_1</span><span class="special">())+...+</span><span class="identifier">abs</span><span class="special">(</span><span class="identifier">o</span><span class="special">.</span><span class="identifier">R_component_8</span><span class="special">())</span></code>) of the octonion.
</p>
<a name="boost_octonions.octonions.octonion_value_operations.abs"></a><h5>
-<a name="id798208"></a>
+<a name="id1058760"></a>
<a class="link" href="octonion_value_operations.html#boost_octonions.octonions.octonion_value_operations.abs">abs</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">T</span> <span class="identifier">abs</span><span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">o</span><span class="special">);</span>
@@ -77,7 +77,7 @@
This return the magnitude (Euclidian norm) of the octonion.
</p>
<a name="boost_octonions.octonions.octonion_value_operations.norm"></a><h5>
-<a name="id798316"></a>
+<a name="id1058849"></a>
<a class="link" href="octonion_value_operations.html#boost_octonions.octonions.octonion_value_operations.norm">norm</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">T</span> <span class="identifier">norm</span><span class="special">(</span><span class="identifier">octonion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span><span class="keyword">const</span> <span class="special">&</span> <span class="identifier">o</span><span class="special">);</span>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonions_transcendentals.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonions_transcendentals.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/octonions_transcendentals.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Octonions Transcendentals</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="oct_create.html" title="Octonion Creation Functions">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="oct_create.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="test_program.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.octonions_transcendentals"></a><a class="link" href="octonions_transcendentals.html" title="Octonions Transcendentals">Octonions
Transcendentals</a>
@@ -53,7 +53,7 @@
headers.
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.exp"></a><h5>
-<a name="id799499"></a>
+<a name="id1060349"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.exp">exp</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -63,7 +63,7 @@
Computes the exponential of the octonion.
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.cos"></a><h5>
-<a name="id799620"></a>
+<a name="id1060447"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.cos">cos</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -73,7 +73,7 @@
Computes the cosine of the octonion
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.sin"></a><h5>
-<a name="id799742"></a>
+<a name="id1060544"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.sin">sin</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -83,7 +83,7 @@
Computes the sine of the octonion.
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.tan"></a><h5>
-<a name="id799864"></a>
+<a name="id1060642"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.tan">tan</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -93,7 +93,7 @@
Computes the tangent of the octonion.
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.cosh"></a><h5>
-<a name="id799985"></a>
+<a name="id1060741"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.cosh">cosh</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -103,7 +103,7 @@
Computes the hyperbolic cosine of the octonion.
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.sinh"></a><h5>
-<a name="id800107"></a>
+<a name="id1060844"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.sinh">sinh</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -113,7 +113,7 @@
Computes the hyperbolic sine of the octonion.
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.tanh"></a><h5>
-<a name="id800229"></a>
+<a name="id1060948"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.tanh">tanh</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -123,7 +123,7 @@
Computes the hyperbolic tangent of the octonion.
</p>
<a name="boost_octonions.octonions.octonions_transcendentals.pow"></a><h5>
-<a name="id800352"></a>
+<a name="id1061047"></a>
<a class="link" href="octonions_transcendentals.html#boost_octonions.octonions.octonions_transcendentals.pow">pow</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/overview.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/overview.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Overview</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="../octonions.html" title="Octonions">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../octonions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="header_file.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/synopsis.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/synopsis.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/synopsis.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Synopsis</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="header_file.html" title="Header File">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="header_file.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="template_class_octonion.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/template_class_octonion.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/template_class_octonion.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/template_class_octonion.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Template Class octonion</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="synopsis.html" title="Synopsis">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="synopsis.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="octonion_specializations.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.template_class_octonion"></a><a class="link" href="template_class_octonion.html" title="Template Class octonion">Template
Class octonion</a>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/test_program.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/test_program.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/test_program.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Test Program</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="octonions_transcendentals.html" title="Octonions Transcendentals">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="octonions_transcendentals.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.test_program"></a><a class="link" href="test_program.html" title="Test Program">Test Program</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/to_do.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/to_do.html (original)
+++ branches/release/libs/math/doc/octonion/html/boost_octonions/octonions/to_do.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>To Do</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Octonions">
<link rel="up" href="../octonions.html" title="Octonions">
<link rel="prev" href="history.html" title="History">
@@ -21,18 +21,18 @@
<div class="spirit-nav">
<a accesskey="p" href="history.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../octonions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_octonions.octonions.to_do"></a><a class="link" href="to_do.html" title="To Do">To Do</a>
</h3></div></div></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
+<div class="itemizedlist"><ul type="disc">
+<li>
Improve testing.
</li>
-<li class="listitem">
+<li>
Rewrite input operatore using Spirit (creates a dependency).
</li>
-<li class="listitem">
+<li>
Put in place an Expression Template mechanism (perhaps borrowing from
uBlas).
</li>
Modified: branches/release/libs/math/doc/octonion/html/index.html
==============================================================================
--- branches/release/libs/math/doc/octonion/html/index.html (original)
+++ branches/release/libs/math/doc/octonion/html/index.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Boost.Octonions</title>
<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="index.html" title="Boost.Octonions">
<link rel="next" href="boost_octonions/octonions.html" title="Octonions">
</head>
@@ -18,7 +18,7 @@
</tr></table>
<hr>
<div class="spirit-nav"><a accesskey="n" href="boost_octonions/octonions.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
-<div class="article">
+<div class="article" lang="en">
<div class="titlepage">
<div>
<div><h2 class="title">
@@ -28,7 +28,7 @@
</h3></div></div></div>
<div><p class="copyright">Copyright © 2001 -2003 Hubert Holin</p></div>
<div><div class="legalnotice">
-<a name="id759702"></a><p>
+<a name="id1015157"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -52,11 +52,11 @@
Member Typedefs</a></span></dt>
<dt><span class="section"><a href="boost_octonions/octonions/octonion_member_functions.html">Octonion
Member Functions</a></span></dt>
-<dt><span class="section"><a href="boost_octonions/octonions/non_mem.html"> Octonion Non-Member
+<dt><span class="section"><a href="boost_octonions/octonions/non_mem.html">Octonion Non-Member
Operators</a></span></dt>
<dt><span class="section"><a href="boost_octonions/octonions/octonion_value_operations.html">Octonion
Value Operations</a></span></dt>
-<dt><span class="section"><a href="boost_octonions/octonions/oct_create.html"> Octonion Creation
+<dt><span class="section"><a href="boost_octonions/octonions/oct_create.html">Octonion Creation
Functions</a></span></dt>
<dt><span class="section"><a href="boost_octonions/octonions/octonions_transcendentals.html">Octonions
Transcendentals</a></span></dt>
@@ -68,7 +68,7 @@
</dl>
</div>
<p>
- This manual is also available in <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/octonion.pdf" target="_top">printer
+ This manual is also available in <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">printer
friendly PDF format</a>.
</p>
</div>
Modified: branches/release/libs/math/doc/octonion/math-octonion.qbk
==============================================================================
--- branches/release/libs/math/doc/octonion/math-octonion.qbk (original)
+++ branches/release/libs/math/doc/octonion/math-octonion.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -35,7 +35,7 @@
[def __hypot [link boost_quaternions.math_special_functions.hypot hypot]]
This manual is also available in
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/octonion.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
printer friendly PDF format].
[section Octonions]
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternions</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../index.html" title="Boost.Quaternions">
<link rel="up" href="../index.html" title="Boost.Quaternions">
<link rel="prev" href="../index.html" title="Boost.Quaternions">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="quaternions/overview.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_quaternions.quaternions"></a><a class="link" href="quaternions.html" title="Quaternions">Quaternions</a>
</h2></div></div></div>
@@ -30,22 +30,21 @@
<dt><span class="section">Overview</span></dt>
<dt><span class="section">Header File</span></dt>
<dt><span class="section">Synopsis</span></dt>
-<dt><span class="section"> Template Class quaternion</span></dt>
-<dt><span class="section"> Quaternion Specializations</span></dt>
-<dt><span class="section"><a href="quaternions/mem_typedef.html"> Quaternion
+<dt><span class="section">Template Class quaternion</span></dt>
+<dt><span class="section">Quaternion Specializations</span></dt>
+<dt><span class="section"><a href="quaternions/mem_typedef.html">Quaternion
Member Typedefs</a></span></dt>
-<dt><span class="section"><a href="quaternions/mem_fun.html"> Quaternion Member
+<dt><span class="section"><a href="quaternions/mem_fun.html">Quaternion Member
Functions</a></span></dt>
-<dt><span class="section"><a href="quaternions/non_mem.html"> Quaternion Non-Member
+<dt><span class="section"><a href="quaternions/non_mem.html">Quaternion Non-Member
Operators</a></span></dt>
-<dt><span class="section"><a href="quaternions/value_op.html"> Quaternion Value
+<dt><span class="section"><a href="quaternions/value_op.html">Quaternion Value
Operations</a></span></dt>
-<dt><span class="section"><a href="quaternions/create.html"> Quaternion Creation
+<dt><span class="section"><a href="quaternions/create.html">Quaternion Creation
Functions</a></span></dt>
-<dt><span class="section"> Quaternion Transcendentals</span></dt>
+<dt><span class="section">Quaternion Transcendentals</span></dt>
<dt><span class="section">Test Program</span></dt>
-<dt><span class="section"><a href="quaternions/exp.html"> The Quaternionic
- Exponential</a></span></dt>
+<dt><span class="section">The Quaternionic Exponential</span></dt>
<dt><span class="section">Acknowledgements</span></dt>
<dt><span class="section">History</span></dt>
<dt><span class="section">To Do</span></dt>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/acknowledgements.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/acknowledgements.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/acknowledgements.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Acknowledgements</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="exp.html" title="The Quaternionic Exponential">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="exp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_quaternions.quaternions.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements">Acknowledgements</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/create.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/create.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/create.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternion Creation Functions</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="value_op.html" title="Quaternion Value Operations">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="value_op.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="trans.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.create"></a><a class="link" href="create.html" title="Quaternion Creation Functions"> Quaternion Creation
+<a name="boost_quaternions.quaternions.create"></a><a class="link" href="create.html" title="Quaternion Creation Functions">Quaternion Creation
Functions</a>
</h3></div></div></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">spherical</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">rho</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">theta</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">phi1</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&a
mp;</span> <span class="identifier">phi2</span><span class="special">);</span>
@@ -37,9 +37,9 @@
These build quaternions in a way similar to the way polar builds complex
numbers, as there is no strict equivalent to polar coordinates for quaternions.
</p>
-<a name="boost_quaternions.quaternions.creation_spherical"></a><p>
- <code class="computeroutput"><span class="identifier">spherical</span></code> is a simple transposition
- of <code class="computeroutput"><span class="identifier">polar</span></code>, it takes as inputs
+<p>
+ <a name="boost_quaternions.quaternions.creation_spherical"></a> <code class="computeroutput"><span class="identifier">spherical</span></code> is a simple transposition of
+ <code class="computeroutput"><span class="identifier">polar</span></code>, it takes as inputs
a (positive) magnitude and a point on the hypersphere, given by three angles.
The first of these, <code class="computeroutput"><span class="identifier">theta</span></code>
has a natural range of <code class="computeroutput"><span class="special">-</span><span class="identifier">pi</span></code>
@@ -52,21 +52,22 @@
The expected degeneracies (a magnitude of zero ignores the angles settings...)
do happen however.
</p>
-<a name="boost_quaternions.quaternions.creation_cylindrical"></a><p>
- <code class="computeroutput"><span class="identifier">cylindrical</span></code> is likewise a
- simple transposition of the usual cylindrical coordinates in <span class="emphasis"><em><span class="bold"><strong>R<sup>3</sup></strong></span></em></span>, which in turn is another derivative of
- planar polar coordinates. The first two inputs are the polar coordinates
- of the first <span class="emphasis"><em><span class="bold"><strong>C</strong></span></em></span> component
- of the quaternion. The third and fourth inputs are placed into the third
- and fourth <span class="emphasis"><em><span class="bold"><strong>R</strong></span></em></span> components
- of the quaternion, respectively.
- </p>
-<a name="boost_quaternions.quaternions.creation_multipolar"></a><p>
- <code class="computeroutput"><span class="identifier">multipolar</span></code> is yet another
- simple generalization of polar coordinates. This time, both <span class="emphasis"><em><span class="bold"><strong>C</strong></span></em></span> components of the quaternion are given
- in polar coordinates.
+<p>
+ <a name="boost_quaternions.quaternions.creation_cylindrical"></a> <code class="computeroutput"><span class="identifier">cylindrical</span></code> is likewise a simple transposition
+ of the usual cylindrical coordinates in <span class="emphasis"><em><span class="bold"><strong>R<sup>3</sup></strong></span></em></span>,
+ which in turn is another derivative of planar polar coordinates. The first
+ two inputs are the polar coordinates of the first <span class="emphasis"><em><span class="bold"><strong>C</strong></span></em></span>
+ component of the quaternion. The third and fourth inputs are placed into
+ the third and fourth <span class="emphasis"><em><span class="bold"><strong>R</strong></span></em></span>
+ components of the quaternion, respectively.
+ </p>
+<p>
+ <a name="boost_quaternions.quaternions.creation_multipolar"></a> <code class="computeroutput"><span class="identifier">multipolar</span></code> is yet another simple generalization
+ of polar coordinates. This time, both <span class="emphasis"><em><span class="bold"><strong>C</strong></span></em></span>
+ components of the quaternion are given in polar coordinates.
</p>
-<a name="boost_quaternions.quaternions.creation_cylindrospherical"></a><p>
+<p>
+ <a name="boost_quaternions.quaternions.creation_cylindrospherical"></a>
<code class="computeroutput"><span class="identifier">cylindrospherical</span></code> is specific
to quaternions. It is often interesting to consider <span class="emphasis"><em><span class="bold"><strong>H</strong></span></em></span>
as the cartesian product of <span class="emphasis"><em><span class="bold"><strong>R</strong></span></em></span>
@@ -74,11 +75,12 @@
multiplication as then a special form, as given here). This function therefore
builds a quaternion from this representation, with the <span class="emphasis"><em><span class="bold"><strong>R<sup>3</sup></strong></span></em></span> component given in usual <span class="emphasis"><em><span class="bold"><strong>R<sup>3</sup></strong></span></em></span> spherical coordinates.
</p>
-<a name="boost_quaternions.quaternions.creation_semipolar"></a><p>
- <code class="computeroutput"><span class="identifier">semipolar</span></code> is another generator
- which is specific to quaternions. It takes as a first input the magnitude
- of the quaternion, as a second input an angle in the range <code class="computeroutput"><span class="number">0</span></code> to <code class="computeroutput"><span class="special">+</span><span class="identifier">pi</span><span class="special">/</span><span class="number">2</span></code>
- such that magnitudes of the first two <span class="emphasis"><em><span class="bold"><strong>C</strong></span></em></span>
+<p>
+ <a name="boost_quaternions.quaternions.creation_semipolar"></a> <code class="computeroutput"><span class="identifier">semipolar</span></code> is another generator which is
+ specific to quaternions. It takes as a first input the magnitude of the quaternion,
+ as a second input an angle in the range <code class="computeroutput"><span class="number">0</span></code>
+ to <code class="computeroutput"><span class="special">+</span><span class="identifier">pi</span><span class="special">/</span><span class="number">2</span></code> such that
+ magnitudes of the first two <span class="emphasis"><em><span class="bold"><strong>C</strong></span></em></span>
components of the quaternion are the product of the first input and the sine
and cosine of this angle, respectively, and finally as third and fourth inputs
angles in the range <code class="computeroutput"><span class="special">-</span><span class="identifier">pi</span><span class="special">/</span><span class="number">2</span></code> to <code class="computeroutput"><span class="special">+</span><span class="identifier">pi</span><span class="special">/</span><span class="number">2</span></code> which represent the arguments of the first
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/exp.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/exp.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/exp.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The Quaternionic Exponential</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="test_program.html" title="Test Program">
@@ -22,20 +22,19 @@
<div class="spirit-nav">
<a accesskey="p" href="test_program.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.exp"></a><a class="link" href="exp.html" title="The Quaternionic Exponential"> The Quaternionic
- Exponential</a>
+<a name="boost_quaternions.quaternions.exp"></a><a class="link" href="exp.html" title="The Quaternionic Exponential">The Quaternionic Exponential</a>
</h3></div></div></div>
<p>
Please refer to the following PDF's:
</p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
+<div class="itemizedlist"><ul type="disc">
+<li>
<a href="../../../../../quaternion/TQE.pdf" target="_top">The Quaternionic Exponential
(and beyond)</a>
</li>
-<li class="listitem">
+<li>
<a href="../../../../../quaternion/TQE_EA.pdf" target="_top">The Quaternionic Exponential
(and beyond) ERRATA & ADDENDA</a>
</li>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/header_file.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/header_file.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/header_file.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Header File</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="overview.html" title="Overview">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_quaternions.quaternions.header_file"></a><a class="link" href="header_file.html" title="Header File">Header File</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/history.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/history.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/history.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>History</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="acknowledgements.html" title="Acknowledgements">
@@ -22,40 +22,40 @@
<div class="spirit-nav">
<a accesskey="p" href="acknowledgements.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="to_do.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_quaternions.quaternions.history"></a><a class="link" href="history.html" title="History">History</a>
</h3></div></div></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
+<div class="itemizedlist"><ul type="disc">
+<li>
1.5.8 - 17/12/2005: Converted documentation to Quickbook Format.
</li>
-<li class="listitem">
+<li>
1.5.7 - 24/02/2003: transitionned to the unit test framework; <boost/config.hpp>
now included by the library header (rather than the test files).
</li>
-<li class="listitem">
+<li>
1.5.6 - 15/10/2002: Gcc2.95.x and stlport on linux compatibility by Alkis
Evlogimenos (alkis_at_[hidden]).
</li>
-<li class="listitem">
+<li>
1.5.5 - 27/09/2002: Microsoft VCPP 7 compatibility, by Michael Stevens
(michael_at_[hidden]); requires the /Za compiler option.
</li>
-<li class="listitem">
+<li>
1.5.4 - 19/09/2002: fixed problem with multiple inclusion (in different
translation units); attempt at an improved compatibility with Microsoft
compilers, by Michael Stevens (michael_at_[hidden]) and Fredrik
Blomqvist; other compatibility fixes.
</li>
-<li class="listitem">
+<li>
1.5.3 - 01/02/2002: bugfix and Gcc 2.95.3 compatibility by Douglas Gregor
(gregod_at_[hidden]).
</li>
-<li class="listitem">
+<li>
1.5.2 - 07/07/2001: introduced namespace math.
</li>
-<li class="listitem">
+<li>
1.5.1 - 07/06/2001: (end of Boost review) now includes <boost/math/special_functions/sinc.hpp>
and <boost/math/special_functions/sinhc.hpp> instead of <boost/special_functions.hpp>;
corrected bug in sin (Daryle Walker); removed check for self-assignment
@@ -64,31 +64,31 @@
added sup and l1; used Vesa Karvonen's CPP metaprograming technique to
simplify code.
</li>
-<li class="listitem">
+<li>
1.5.0 - 26/03/2001: boostification, inlining of all operators except
input, output and pow, fixed exception safety of some members (template
version) and output operator, added spherical, semipolar, multipolar,
cylindrospherical and cylindrical.
</li>
-<li class="listitem">
+<li>
1.4.0 - 09/01/2001: added tan and tanh.
</li>
-<li class="listitem">
+<li>
1.3.1 - 08/01/2001: cosmetic fixes.
</li>
-<li class="listitem">
+<li>
1.3.0 - 12/07/2000: pow now uses Maarten Hilferink's (mhilferink_at_[hidden])
algorithm.
</li>
-<li class="listitem">
+<li>
1.2.0 - 25/05/2000: fixed the division operators and output; changed
many signatures.
</li>
-<li class="listitem">
+<li>
1.1.0 - 23/05/2000: changed sinc into sinc_pi; added sin, cos, sinh,
cosh.
</li>
-<li class="listitem">
+<li>
1.0.0 - 10/08/1999: first public version.
</li>
</ul></div>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_fun.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_fun.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_fun.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternion Member Functions</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="mem_typedef.html" title="Quaternion Member Typedefs">
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="mem_typedef.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_mem.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.mem_fun"></a><a class="link" href="mem_fun.html" title="Quaternion Member Functions"> Quaternion Member
+<a name="boost_quaternions.quaternions.mem_fun"></a><a class="link" href="mem_fun.html" title="Quaternion Member Functions">Quaternion Member
Functions</a>
</h3></div></div></div>
<a name="boost_quaternions.quaternions.mem_fun.constructors"></a><h4>
-<a name="id774790"></a>
+<a name="id1033759"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.constructors">Constructors</a>
</h4>
<p>
@@ -80,12 +80,12 @@
function in a "detail" subnamespace.
</p>
<a name="boost_quaternions.quaternions.mem_fun.other_member_functions"></a><h4>
-<a name="id776568"></a>
+<a name="id1035259"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.other_member_functions">Other
member functions</a>
</h4>
<a name="boost_quaternions.quaternions.mem_fun.real_and_unreal_parts"></a><h5>
-<a name="id776589"></a>
+<a name="id1035277"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.real_and_unreal_parts">Real
and Unreal Parts</a>
</h5>
@@ -100,7 +100,7 @@
case). These are returned by the first two functions.
</p>
<a name="boost_quaternions.quaternions.mem_fun.individual_real_components"></a><h5>
-<a name="id776691"></a>
+<a name="id1035354"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.individual_real_components">Individual
Real Components</a>
</h5>
@@ -114,7 +114,7 @@
functions. Hence real and R_component_1 return the same value.
</p>
<a name="boost_quaternions.quaternions.mem_fun.individual_complex__components"></a><h5>
-<a name="id776825"></a>
+<a name="id1035461"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.individual_complex__components">Individual
Complex Components</a>
</h5>
@@ -129,12 +129,12 @@
is the same as <code class="computeroutput"><span class="identifier">q</span><span class="special">.</span><span class="identifier">real</span><span class="special">()</span></code>.
</p>
<a name="boost_quaternions.quaternions.mem_fun.quaternion_member_operators"></a><h4>
-<a name="id777024"></a>
+<a name="id1036711"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.quaternion_member_operators">Quaternion
Member Operators</a>
</h4>
<a name="boost_quaternions.quaternions.mem_fun.assignment_operators"></a><h5>
-<a name="id777032"></a>
+<a name="id1036727"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.assignment_operators">Assignment
Operators</a>
</h5>
@@ -151,7 +151,7 @@
base type's assignment operators must not throw.
</p>
<a name="boost_quaternions.quaternions.mem_fun.addition_operators"></a><h5>
-<a name="id777393"></a>
+<a name="id1037015"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.addition_operators">Addition
Operators</a>
</h5>
@@ -168,7 +168,7 @@
base type's assignment operators must not throw.
</p>
<a name="boost_quaternions.quaternions.mem_fun.subtraction_operators"></a><h5>
-<a name="id777707"></a>
+<a name="id1037273"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.subtraction_operators">Subtraction
Operators</a>
</h5>
@@ -185,7 +185,7 @@
base type's assignment operators must not throw.
</p>
<a name="boost_quaternions.quaternions.mem_fun.multiplication_operators"></a><h5>
-<a name="id778022"></a>
+<a name="id1037531"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.multiplication_operators">Multiplication
Operators</a>
</h5>
@@ -203,7 +203,7 @@
assignment operators must not throw.
</p>
<a name="boost_quaternions.quaternions.mem_fun.division_operators"></a><h5>
-<a name="id778343"></a>
+<a name="id1037793"></a>
<a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.division_operators">Division
Operators</a>
</h5>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_typedef.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_typedef.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/mem_typedef.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternion Member Typedefs</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="spec.html" title="Quaternion Specializations">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="spec.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mem_fun.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.mem_typedef"></a><a class="link" href="mem_typedef.html" title="Quaternion Member Typedefs"> Quaternion
+<a name="boost_quaternions.quaternions.mem_typedef"></a><a class="link" href="mem_typedef.html" title="Quaternion Member Typedefs">Quaternion
Member Typedefs</a>
</h3></div></div></div>
<p>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/non_mem.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/non_mem.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/non_mem.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternion Non-Member Operators</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="mem_fun.html" title="Quaternion Member Functions">
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="mem_fun.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="value_op.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.non_mem"></a><a class="link" href="non_mem.html" title="Quaternion Non-Member Operators"> Quaternion Non-Member
+<a name="boost_quaternions.quaternions.non_mem"></a><a class="link" href="non_mem.html" title="Quaternion Non-Member Operators">Quaternion Non-Member
Operators</a>
</h3></div></div></div>
<a name="boost_quaternions.quaternions.non_mem.unary_plus"></a><h5>
-<a name="id778695"></a>
+<a name="id1038075"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.unary_plus">Unary Plus</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -38,7 +38,7 @@
This unary operator simply returns q.
</p>
<a name="boost_quaternions.quaternions.non_mem.unary_minus"></a><h5>
-<a name="id778824"></a>
+<a name="id1038179"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.unary_minus">Unary Minus</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
@@ -48,7 +48,7 @@
This unary operator returns the opposite of q.
</p>
<a name="boost_quaternions.quaternions.non_mem.binary_addition_operators"></a><h5>
-<a name="id778952"></a>
+<a name="id1038285"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.binary_addition_operators">Binary
Addition Operators</a>
</h5>
@@ -63,7 +63,7 @@
<span class="identifier">rhs</span></code>.
</p>
<a name="boost_quaternions.quaternions.non_mem.binary_subtraction_operators"></a><h5>
-<a name="id779712"></a>
+<a name="id1038927"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.binary_subtraction_operators">Binary
Subtraction Operators</a>
</h5>
@@ -78,7 +78,7 @@
<span class="identifier">rhs</span></code>.
</p>
<a name="boost_quaternions.quaternions.non_mem.binary_multiplication_operators"></a><h5>
-<a name="id780472"></a>
+<a name="id1039561"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.binary_multiplication_operators">Binary
Multiplication Operators</a>
</h5>
@@ -93,7 +93,7 @@
<span class="identifier">rhs</span></code>.
</p>
<a name="boost_quaternions.quaternions.non_mem.binary_division_operators"></a><h5>
-<a name="id781229"></a>
+<a name="id1040197"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.binary_division_operators">Binary
Division Operators</a>
</h5>
@@ -109,7 +109,7 @@
to divide by zero...
</p>
<a name="boost_quaternions.quaternions.non_mem.equality_operators"></a><h5>
-<a name="id781988"></a>
+<a name="id1040835"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.equality_operators">Equality
Operators</a>
</h5>
@@ -125,7 +125,7 @@
with any floating-type entity, this is essentially meaningless.
</p>
<a name="boost_quaternions.quaternions.non_mem.inequality_operators"></a><h5>
-<a name="id782704"></a>
+<a name="id1043620"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.inequality_operators">Inequality
Operators</a>
</h5>
@@ -141,7 +141,7 @@
false. As with any floating-type entity, this is essentially meaningless.
</p>
<a name="boost_quaternions.quaternions.non_mem.stream_extractor"></a><h5>
-<a name="id783419"></a>
+<a name="id1044220"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.stream_extractor">Stream
Extractor</a>
</h5>
@@ -173,7 +173,7 @@
complex numbers which happen to have imaginary parts equal to zero).
</p>
<a name="boost_quaternions.quaternions.non_mem.stream_inserter"></a><h5>
-<a name="id783748"></a>
+<a name="id1044486"></a>
<a class="link" href="non_mem.html#boost_quaternions.quaternions.non_mem.stream_inserter">Stream
Inserter</a>
</h5>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/overview.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/overview.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Overview</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="../quaternions.html" title="Quaternions">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../quaternions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="header_file.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_quaternions.quaternions.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/quat.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/quat.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/quat.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Template Class quaternion</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="synopsis.html" title="Synopsis">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="synopsis.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="spec.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.quat"></a><a class="link" href="quat.html" title="Template Class quaternion"> Template Class quaternion</a>
+<a name="boost_quaternions.quaternions.quat"></a><a class="link" href="quat.html" title="Template Class quaternion">Template Class quaternion</a>
</h3></div></div></div>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/spec.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/spec.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/spec.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternion Specializations</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="quat.html" title="Template Class quaternion">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="quat.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mem_typedef.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.spec"></a><a class="link" href="spec.html" title="Quaternion Specializations"> Quaternion Specializations</a>
+<a name="boost_quaternions.quaternions.spec"></a><a class="link" href="spec.html" title="Quaternion Specializations">Quaternion Specializations</a>
</h3></div></div></div>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
@@ -75,13 +75,12 @@
<span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">float</span><span class="special">>&</span> <a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.division_operators">operator /= </a><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">X</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">rhs</span><span class="special">);</span>
<span class="special">};</span>
</pre>
-<a name="boost_quaternions.quaternion_double"></a><p>
- </p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><></span>
<span class="keyword">class</span> <span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span>
<span class="special">{</span>
<span class="keyword">public</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="keyword">double</span> <a class="link" href="mem_typedef.html" title="Quaternion Member Typedefs">value_type</a><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="keyword">double</span> <a name="boost_quaternions.quaternion_double"></a>
+<a class="link" href="mem_typedef.html" title="Quaternion Member Typedefs">value_type</a><span class="special">;</span>
<span class="keyword">explicit</span> <a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.constructors">quaternion</a><span class="special">(</span><span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_a</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_b</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_c</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">,</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="id
entifier">requested_d</span> <span class="special">=</span> <span class="number">0.0</span><span class="special">);</span>
<span class="keyword">explicit</span> <a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.constructors">quaternion</a><span class="special">(::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z0</span><span class="special">,</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z1</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</s
pan><span class="special"><</span><span class="keyword">double</span><span class="special">>());</span>
@@ -124,13 +123,12 @@
<span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">double</span><span class="special">>&</span> <a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.division_operators">operator /= </a><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">X</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">rhs</span><span class="special">);</span>
<span class="special">};</span>
</pre>
-<a name="boost_quaternions.quaternion_long_double"></a><p>
- </p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><></span>
<span class="keyword">class</span> <span class="identifier">quaternion</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span>
<span class="special">{</span>
<span class="keyword">public</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="keyword">long</span> <span class="keyword">double</span> <a class="link" href="mem_typedef.html" title="Quaternion Member Typedefs">value_type</a><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="keyword">long</span> <span class="keyword">double</span> <a name="boost_quaternions.quaternion_long_double"></a>
+<a class="link" href="mem_typedef.html" title="Quaternion Member Typedefs">value_type</a><span class="special">;</span>
<span class="keyword">explicit</span> <a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.constructors">quaternion</a><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_a</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_b</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_c</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">,</span> <span class="key
word">long</span> <span class="keyword">double</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">requested_d</span> <span class="special">=</span> <span class="number">0.0L</span><span class="special">);</span>
<span class="keyword">explicit</span> <a class="link" href="mem_fun.html#boost_quaternions.quaternions.mem_fun.constructors">quaternion</a><span class="special">(::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z0</span><span class="special">,</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">z1</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">std</spa
n><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">>());</span>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/synopsis.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/synopsis.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/synopsis.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Synopsis</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="header_file.html" title="Header File">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="header_file.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="quat.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_quaternions.quaternions.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/test_program.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/test_program.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/test_program.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Test Program</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="trans.html" title="Quaternion Transcendentals">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="trans.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="exp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_quaternions.quaternions.test_program"></a><a class="link" href="test_program.html" title="Test Program">Test Program</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/to_do.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/to_do.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/to_do.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>To Do</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="history.html" title="History">
@@ -21,22 +21,22 @@
<div class="spirit-nav">
<a accesskey="p" href="history.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_quaternions.quaternions.to_do"></a><a class="link" href="to_do.html" title="To Do">To Do</a>
</h3></div></div></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
+<div class="itemizedlist"><ul type="disc">
+<li>
Improve testing.
</li>
-<li class="listitem">
+<li>
Rewrite input operatore using Spirit (creates a dependency).
</li>
-<li class="listitem">
+<li>
Put in place an Expression Template mechanism (perhaps borrowing from
uBlas).
</li>
-<li class="listitem">
+<li>
Use uBlas for the link with rotations (and move from the example
implementation to an efficient one).
</li>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/trans.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/trans.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/trans.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternion Transcendentals</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="create.html" title="Quaternion Creation Functions">
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="create.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="test_program.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.trans"></a><a class="link" href="trans.html" title="Quaternion Transcendentals"> Quaternion Transcendentals</a>
+<a name="boost_quaternions.quaternions.trans"></a><a class="link" href="trans.html" title="Quaternion Transcendentals">Quaternion Transcendentals</a>
</h3></div></div></div>
<p>
There is no <code class="computeroutput"><span class="identifier">log</span></code> or <code class="computeroutput"><span class="identifier">sqrt</span></code> provided for quaternions in this implementation,
@@ -56,7 +56,7 @@
headers.
</p>
<a name="boost_quaternions.quaternions.trans.exp"></a><h5>
-<a name="id787126"></a>
+<a name="id1046982"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.exp">exp</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">exp</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -65,7 +65,7 @@
Computes the exponential of the quaternion.
</p>
<a name="boost_quaternions.quaternions.trans.cos"></a><h5>
-<a name="id787246"></a>
+<a name="id1047080"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.cos">cos</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">cos</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -74,7 +74,7 @@
Computes the cosine of the quaternion
</p>
<a name="boost_quaternions.quaternions.trans.sin"></a><h5>
-<a name="id787367"></a>
+<a name="id1047178"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.sin">sin</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">sin</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -83,7 +83,7 @@
Computes the sine of the quaternion.
</p>
<a name="boost_quaternions.quaternions.trans.tan"></a><h5>
-<a name="id787487"></a>
+<a name="id1047275"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.tan">tan</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">tan</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -92,7 +92,7 @@
Computes the tangent of the quaternion.
</p>
<a name="boost_quaternions.quaternions.trans.cosh"></a><h5>
-<a name="id787608"></a>
+<a name="id1047372"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.cosh">cosh</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">cosh</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -101,7 +101,7 @@
Computes the hyperbolic cosine of the quaternion.
</p>
<a name="boost_quaternions.quaternions.trans.sinh"></a><h5>
-<a name="id787730"></a>
+<a name="id1047469"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.sinh">sinh</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">sinh</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -110,7 +110,7 @@
Computes the hyperbolic sine of the quaternion.
</p>
<a name="boost_quaternions.quaternions.trans.tanh"></a><h5>
-<a name="id787851"></a>
+<a name="id1048660"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.tanh">tanh</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">tanh</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -119,7 +119,7 @@
Computes the hyperbolic tangent of the quaternion.
</p>
<a name="boost_quaternions.quaternions.trans.pow"></a><h5>
-<a name="id787972"></a>
+<a name="id1048758"></a>
<a class="link" href="trans.html#boost_quaternions.quaternions.trans.pow">pow</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">pow</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">n</span><span class="special">);</span>
Modified: branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/value_op.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/value_op.html (original)
+++ branches/release/libs/math/doc/quaternion/html/boost_quaternions/quaternions/value_op.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quaternion Value Operations</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Boost.Quaternions">
<link rel="up" href="../quaternions.html" title="Quaternions">
<link rel="prev" href="non_mem.html" title="Quaternion Non-Member Operators">
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="non_mem.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../quaternions.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="create.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="boost_quaternions.quaternions.value_op"></a><a class="link" href="value_op.html" title="Quaternion Value Operations"> Quaternion Value
+<a name="boost_quaternions.quaternions.value_op"></a><a class="link" href="value_op.html" title="Quaternion Value Operations">Quaternion Value
Operations</a>
</h3></div></div></div>
<a name="boost_quaternions.quaternions.value_op.real_and_unreal"></a><h5>
-<a name="id784593"></a>
+<a name="id1045183"></a>
<a class="link" href="value_op.html#boost_quaternions.quaternions.value_op.real_and_unreal">real
and unreal</a>
</h5>
@@ -41,7 +41,7 @@
respectively.
</p>
<a name="boost_quaternions.quaternions.value_op.conj"></a><h5>
-<a name="id784840"></a>
+<a name="id1045382"></a>
<a class="link" href="value_op.html#boost_quaternions.quaternions.value_op.conj">conj</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">conj</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -50,7 +50,7 @@
This returns the conjugate of the quaternion.
</p>
<a name="boost_quaternions.quaternions.value_op.sup"></a><h5>
-<a name="id784961"></a>
+<a name="id1045481"></a>
<a class="link" href="value_op.html#boost_quaternions.quaternions.value_op.sup">sup</a>
</h5>
<p>
@@ -60,7 +60,7 @@
This return the sup norm (the greatest among <code class="computeroutput"><span class="identifier">abs</span><span class="special">(</span><span class="identifier">q</span><span class="special">.</span><span class="identifier">R_component_1</span><span class="special">())...</span><span class="identifier">abs</span><span class="special">(</span><span class="identifier">q</span><span class="special">.</span><span class="identifier">R_component_4</span><span class="special">()))</span></code> of the quaternion.
</p>
<a name="boost_quaternions.quaternions.value_op.l1"></a><h5>
-<a name="id785048"></a>
+<a name="id1045548"></a>
<a class="link" href="value_op.html#boost_quaternions.quaternions.value_op.l1">l1</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">T</span> <span class="identifier">l1</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -69,7 +69,7 @@
This return the l1 norm <code class="computeroutput"><span class="special">(</span><span class="identifier">abs</span><span class="special">(</span><span class="identifier">q</span><span class="special">.</span><span class="identifier">R_component_1</span><span class="special">())+...+</span><span class="identifier">abs</span><span class="special">(</span><span class="identifier">q</span><span class="special">.</span><span class="identifier">R_component_4</span><span class="special">()))</span></code> of the quaternion.
</p>
<a name="boost_quaternions.quaternions.value_op.abs"></a><h5>
-<a name="id785217"></a>
+<a name="id1045685"></a>
<a class="link" href="value_op.html#boost_quaternions.quaternions.value_op.abs">abs</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">T</span> <span class="identifier">abs</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
@@ -78,7 +78,7 @@
This return the magnitude (Euclidian norm) of the quaternion.
</p>
<a name="boost_quaternions.quaternions.value_op.norm"></a><h5>
-<a name="id785324"></a>
+<a name="id1045771"></a>
<a class="link" href="value_op.html#boost_quaternions.quaternions.value_op.norm">norm</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">T</span> <span class="identifier">norm</span><span class="special">(</span><span class="identifier">quaternion</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span><span class="keyword">const</span> <span class="special">&</span> <span class="identifier">q</span><span class="special">);</span>
Modified: branches/release/libs/math/doc/quaternion/html/index.html
==============================================================================
--- branches/release/libs/math/doc/quaternion/html/index.html (original)
+++ branches/release/libs/math/doc/quaternion/html/index.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Boost.Quaternions</title>
<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="index.html" title="Boost.Quaternions">
<link rel="next" href="boost_quaternions/quaternions.html" title="Quaternions">
</head>
@@ -18,7 +18,7 @@
</tr></table>
<hr>
<div class="spirit-nav"><a accesskey="n" href="boost_quaternions/quaternions.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
-<div class="article">
+<div class="article" lang="en">
<div class="titlepage">
<div>
<div><h2 class="title">
@@ -28,7 +28,7 @@
</h3></div></div></div>
<div><p class="copyright">Copyright © 2001 -2003 Hubert Holin</p></div>
<div><div class="legalnotice">
-<a name="id759702"></a><p>
+<a name="id1015157"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -44,22 +44,21 @@
<dt><span class="section">Overview</span></dt>
<dt><span class="section">Header File</span></dt>
<dt><span class="section">Synopsis</span></dt>
-<dt><span class="section"> Template Class quaternion</span></dt>
-<dt><span class="section"> Quaternion Specializations</span></dt>
-<dt><span class="section"><a href="boost_quaternions/quaternions/mem_typedef.html"> Quaternion
+<dt><span class="section">Template Class quaternion</span></dt>
+<dt><span class="section">Quaternion Specializations</span></dt>
+<dt><span class="section"><a href="boost_quaternions/quaternions/mem_typedef.html">Quaternion
Member Typedefs</a></span></dt>
-<dt><span class="section"><a href="boost_quaternions/quaternions/mem_fun.html"> Quaternion Member
+<dt><span class="section"><a href="boost_quaternions/quaternions/mem_fun.html">Quaternion Member
Functions</a></span></dt>
-<dt><span class="section"><a href="boost_quaternions/quaternions/non_mem.html"> Quaternion Non-Member
+<dt><span class="section"><a href="boost_quaternions/quaternions/non_mem.html">Quaternion Non-Member
Operators</a></span></dt>
-<dt><span class="section"><a href="boost_quaternions/quaternions/value_op.html"> Quaternion Value
+<dt><span class="section"><a href="boost_quaternions/quaternions/value_op.html">Quaternion Value
Operations</a></span></dt>
-<dt><span class="section"><a href="boost_quaternions/quaternions/create.html"> Quaternion Creation
+<dt><span class="section"><a href="boost_quaternions/quaternions/create.html">Quaternion Creation
Functions</a></span></dt>
-<dt><span class="section"> Quaternion Transcendentals</span></dt>
+<dt><span class="section">Quaternion Transcendentals</span></dt>
<dt><span class="section">Test Program</span></dt>
-<dt><span class="section"><a href="boost_quaternions/quaternions/exp.html"> The Quaternionic
- Exponential</a></span></dt>
+<dt><span class="section">The Quaternionic Exponential</span></dt>
<dt><span class="section">Acknowledgements</span></dt>
<dt><span class="section">History</span></dt>
<dt><span class="section">To Do</span></dt>
@@ -67,7 +66,7 @@
</dl>
</div>
<p>
- This manual is also available in <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/quaternion.pdf" target="_top">printer
+ This manual is also available in <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">printer
friendly PDF format</a>.
</p>
</div>
Modified: branches/release/libs/math/doc/quaternion/math-quaternion.qbk
==============================================================================
--- branches/release/libs/math/doc/quaternion/math-quaternion.qbk (original)
+++ branches/release/libs/math/doc/quaternion/math-quaternion.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -34,7 +34,7 @@
[def __hypot [link boost_quaternions.math_special_functions.hypot hypot]]
This manual is also available in
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/quaternion.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
printer friendly PDF format].
Modified: branches/release/libs/math/doc/sf_and_dist/Jamfile.v2
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/Jamfile.v2 (original)
+++ branches/release/libs/math/doc/sf_and_dist/Jamfile.v2 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,6 +7,24 @@
path-constant images_location : html ;
+import modules ;
+
+if --enable-index in [ modules.peek : ARGV ]
+{
+ ECHO "Building the Math docs with automatic index generation enabled." ;
+ using auto-index ;
+ project : requirements
+ <auto-index>on <format>pdf:<auto-index-internal>off
+ <format>html:<auto-index-internal>on
+ <auto-index-script>index.idx
+ <auto-index-prefix>../../../..
+ <quickbook-define>enable_index ;
+}
+else
+{
+ ECHO "Building the Math docs with automatic index generation disabled. Try building with --enable-index." ;
+}
+
xml math : math.qbk ;
boostbook standalone
:
Modified: branches/release/libs/math/doc/sf_and_dist/background.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/background.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/background.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -17,7 +17,7 @@
binomial_distribution(RealType n, RealType p);
While the function `pdf` has one argument specifying the distribution type
-(which includes it's parameters, if any),
+(which includes its parameters, if any),
and a second argument for the __random_variate. So taking our binomial distribution
example, we would write:
Modified: branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -197,7 +197,7 @@
[[Windows][MSVC 6 and 7]]
]
-If you're compiler or platform is not listed above, please try running the
+If your compiler or platform is not listed above, please try running the
regression tests: cd into boost-root/libs/math/test and do a:
bjam mytoolset
@@ -212,7 +212,6 @@
You will need to cast an eye over the output from
the failing tests and make a judgement as to whether
the error rates are acceptable or not.
-
]
[/ math.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/concepts.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/concepts.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/concepts.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -28,17 +28,23 @@
The special functions and tools in this library can be used with
[@http://www.mpfr.org MPFR (an arbitrary precision number type based on the GMP library)],
-via the bindings in [@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpfr.hpp].
+either via the bindings in [@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpfr.hpp],
+or via [@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpreal.hpp].
In order to use these binings you will need to have installed [@http://www.mpfr.org MPFR]
-plus it's dependency the [@http://gmplib.org GMP library] and the C++ wrapper for MPFR known as
-[@http://math.berkeley.edu/~wilken/code/gmpfrxx/ gmpfrxx (or mpfr_class)].
+plus its dependency the [@http://gmplib.org GMP library]. You will also need one of the
+two supported C++ wrappers for MPFR: [@http://math.berkeley.edu/~wilken/code/gmpfrxx/ gmpfrxx (or mpfr_class)],
+or [@http://www.holoborodko.com/pavel/mpfr/ mpfr-C++ (mpreal)].
-Unfortunately `mpfr_class` doesn't quite satisfy our conceptual requirements,
+Unfortunately neither `mpfr_class` nor `mpreal` quite satisfy our conceptual requirements,
so there is a very thin set of additional interfaces and some helper traits defined in
-[@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpfr.hpp] that you
-should use in place of including 'gmpfrxx.h' directly. The existing mpfr_class is
-then usable unchanged once this header is included, so it's performance-enhancing
+[@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpfr.hpp] and
+[@../../../../../boost/math/bindings/mpreal.hpp boost/math/bindings/mpreal.hpp]
+that you
+should use in place of including 'gmpfrxx.h' or 'mpreal.h' directly. The classes
+`mpfr_class` or `mpreal` are
+then usable unchanged once this header is included, so for example `mpfr_class`'s
+performance-enhancing
expression templates are preserved and fully supported by this library:
#include <boost/math/bindings/mpfr.hpp>
@@ -54,15 +60,27 @@
mpfr_class v = boost::math::tgamma(sqrt(mpfr_class(2)));
std::cout << std::setprecision(50) << v << std::endl;
}
+
+Alternatively use with `mpreal` would look like:
+ #include <boost/math/bindings/mpreal.hpp>
+ #include <boost/math/special_functions/gamma.hpp>
+
+ int main()
+ {
+ mpfr::mpreal::set_precision(500); // 500 bit precision
+ mpfr::mpreal v = boost::math::tgamma(sqrt(mpfr::mpreal(2)));
+ std::cout << std::setprecision(50) << v << std::endl;
+ }
For those functions that are based upon the __lanczos, the bindings
defines a series of approximations with up to 61 terms and accuracy
up to approximately 3e-113. This therefore sets the upper limit for accuracy
-to the majority of functions defined this library when used with `mpfr_class`.
+to the majority of functions defined this library when used with either `mpfr_class` or `mpreal`.
There is a concept checking test program for mpfr support
-[@../../../../../libs/math/test/mpfr_concept_check.cpp here].
+[@../../../../../libs/math/test/mpfr_concept_check.cpp here] and
+[@../../../../../libs/math/test/mpreal_concept_check.cpp here].
[endsect][/section:use_mpfr Using With MPFR / GMP - a High-Precision Floating-Point Library]
@@ -225,7 +243,7 @@
Note that the table above lists only those standard library functions known to
be used (or likely to be used in the near future) by this library.
The following functions: `acos`, `atan2`, `fmod`, `cosh`, `sinh`, `tanh`, `log10`,
-`lround`, `llround`, ltrunc`, `lltrunc` and `modf`
+`lround`, `llround`, `ltrunc`, `lltrunc` and `modf`
are not currently used, but may be if further special functions are added.
Note that the `round`, `trunc` and `modf` functions are not part of the
@@ -280,9 +298,9 @@
[[cdf(complement(cd, cr))][RealType]
[Returns the complement of the CDF of the distribution,
the same as: `1-cdf(cd, cr)`]]
-[[quantile(cd, cr)][RealType][Returns the quantile of the distribution.]]
+[[quantile(cd, cr)][RealType][Returns the quantile (or percentile) of the distribution.]]
[[quantile(complement(cd, cr))][RealType]
- [Returns the quantile of the distribution, starting from
+ [Returns the quantile (or percentile) of the distribution, starting from
the complement of the probability, the same as: `quantile(cd, 1-cr)`]]
[[chf(cd, cr)][RealType][Returns the cumulative hazard function of the distribution.]]
[[hazard(cd, cr)][RealType][Returns the hazard function of the distribution.]]
@@ -297,33 +315,40 @@
[endsect]
-[section:archetypes Conceptual Archetypes and Testing]
+[section:archetypes Conceptual Archetypes for Reals and Distributions]
-There are several concept archetypes available:
+There are a few concept archetypes available:
+
+* Real concept for floating-point types.
+* distribution Concept for statistical distributions.
+
+[h5 Real concept]
+
+`std_real_concept` is an archetype for theReal types,
+including the built-in float, double, long double.
``#include <boost/concepts/std_real_concept.hpp>``
namespace boost{
namespace math{
- namespace concepts{
-
- class std_real_concept;
-
- }}} // namespaces
+ namespace concepts
+ {
+ class std_real_concept;
+ }
+ }} // namespaces
-`std_real_concept` is an archetype for the built-in Real types.
The main purpose in providing this type is to verify
that standard library functions are found via a using declaration -
-bringing those functions into the current scope - and not
-just because they happen to be in global scope.
+bringing those functions into the current scope -
+and not just because they happen to be in global scope.
In order to ensure that a call to say `pow` can be found
either via argument dependent lookup, or failing that then
in the std namespace: all calls to standard library functions
-are unqualified, with the std:: versions found via a using declaration
+are unqualified, with the std:: versions found via a `using` declaration
to make them visible in the current scope. Unfortunately it's all
-to easy to forget the using declaration, and call the double version of
+to easy to forget the `using` declaration, and call the double version of
the function that happens to be in the global scope by mistake.
For example if the code calls ::pow rather than std::pow,
@@ -333,10 +358,12 @@
compile if the all the standard library functions used have
been brought into the current scope with a using declaration.
+[h6 Testing the real concept]
+
There is a test program
[@../../../test/std_real_concept_check.cpp libs/math/test/std_real_concept_check.cpp]
that instantiates every template in this library with type
-`std_real_concept` to verify it's usage of standard library functions.
+`std_real_concept` to verify its usage of standard library functions.
``#include <boost/math/concepts/real_concept.hpp>``
@@ -348,16 +375,16 @@
}}} // namespaces
-`real_concept` is an archetype for [link math_toolkit.using_udt.concepts
-user defined real types], it
-declares it's standard library functions in it's own
+`real_concept` is an archetype for
+[link math_toolkit.using_udt.concepts user defined real types],
+it declares its standard library functions in its own
namespace: these will only be found if they are called unqualified
allowing argument dependent lookup to locate them. In addition
this type is useable at runtime:
this allows code that would not otherwise be exercised by the built-in
floating point types to be tested. There is no std::numeric_limits<>
-support for this type, since this is not a conceptual requirement
-for [link math_toolkit.using_udt.concepts RealType]'s.
+support for this type, since numeric_limits is not a conceptual requirement
+for [link math_toolkit.using_udt.concepts RealType]s.
NTL RR is an example of a type meeting the requirements that this type
models, but note that use of a thin wrapper class is required: refer to
@@ -367,17 +394,21 @@
type is usable at runtime, each individual test case as well as testing
`float`, `double` and `long double`, also tests `real_concept`.
+[h6 Distribution Concept]
+
+Distribution Concept models statistical distributions.
+
``#include <boost/math/concepts/distribution.hpp>``
namespace boost{
namespace math{
- namespace concepts{
-
- template <class RealType>
- class distribution_archetype;
-
- template <class Distribution>
- struct DistributionConcept;
+ namespace concepts
+ {
+ template <class RealType>
+ class distribution_archetype;
+
+ template <class Distribution>
+ struct DistributionConcept;
}}} // namespaces
@@ -388,6 +419,8 @@
[@../../../../../libs/concept_check/index.html concept checking class]
for distribution types.
+[h6 Testing the distribution concept]
+
The test program
[@../../../test/compile_test/distribution_concept_check.cpp distribution_concept_check.cpp]
is responsible for using `DistributionConcept` to verify that all the
@@ -409,11 +442,9 @@
hazard\/chf\/coefficient_of_variation functions are implemented in
there too.)
-[endsect][/section:archetypes Conceptual Archetypes and Testing]
-
-
+[endsect] [/section:archetypes Conceptual Archetypes for Reals and Distributions]
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
Added: branches/release/libs/math/doc/sf_and_dist/config_macros.qbk
==============================================================================
--- (empty file)
+++ branches/release/libs/math/doc/sf_and_dist/config_macros.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -0,0 +1,67 @@
+[section:config_macros Configuration Macros]
+
+Almost all configuration details are set up automatically by
+`<boost\math\tools\config.hpp>`.
+
+In normal use, only policy configuration macros are likely to be used. See __policy_ref.
+
+For reference, information on Boost.Math macros used internally are described briefly below.
+
+[table Boost.Math Macros
+[[MACRO][Notes]]
+[[`BOOST_MATH_NO_REAL_CONCEPT_TESTS`] [Do not try to use real concept tests (hardware or software does not support real_concept type).]]
+[[`BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS`] [Do not produce or use long double functions: this macro gets set when the platform's
+long double or standard library long double support is absent or buggy.]]
+[[`BOOST_MATH_CONTROL_FP`] [Controls FP hardware exceptions - our tests don't support hardware exceptions on MSVC.
+May get set to something like: ` _control87(MCW_EM,MCW_EM)`.]]
+[[`BOOST_MATH_NO_DEDUCED_FUNCTION_POINTERS`] [This macro is used by our test cases, it is set when an assignment of a function template
+to a function pointer requires explicit template arguments to be provided on the function name.]]
+[[`BOOST_MATH_USE_C99` ] [Use C99 math functions.]]
+[[`BOOST_NO_NATIVE_LONG_DOUBLE_FP_CLASSIFY`] [define if no native (or buggy) `fpclassify(long double)`
+even though the other C99 functions are present.]]
+[[`BOOST_MATH_EXPLICIT_TEMPLATE_TYPE`] [Workaround helper macro for broken compilers - composed from
+other Boost.Config macros, do not edit.]]
+[[`BOOST_MATH_EXPLICIT_TEMPLATE_NON_TYPE`] [Workaround helper macro for broken compilers - composed from
+other Boost.Config macros, do not edit.]]
+[[`BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC`] [Workaround helper macro for broken compilers - composed from
+other Boost.Config macros, do not edit.]]
+[[`BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_NON_TYPE_SPEC`] [Workaround helper macro for broken compilers - composed from
+other Boost.Config macros, do not edit.]]
+[[`BOOST_MATH_SMALL_CONSTANT(x)`] [Helper macro used in our test cases to set underflowing constants set to zero
+if this would cause compiler issues.]]
+[[`BOOST_MATH_BUGGY_LARGE_FLOAT_CONSTANTS`] [Set if constants too large for a float, will cause "bad" values to be stored in the data,
+rather than infinity or a suitably large value.]]
+[[`BOOST_MATH_STD_USING`] [Provides `using` statements for many std:: (abs to sqrt) and boost::math (rounds, modf) functions.
+This allows these functions to be called unqualified so that if
+[@http://en.wikipedia.org/wiki/Argument-dependent_name_lookup argument-dependent Argument Dependent Lookup]
+fails to find a suitable overload, then the std:: versions will also be considered.]]
+[[`BOOST_FPU_EXCEPTION_GUARD`] [Used at the entrypoint to each special function to reset all FPU exception flags prior
+to internal calculations, and then merge the old and new exception flags on function exit. Used as a workaround
+on platforms or hardware that behave strangely if any FPU exception flags are set when calling standard library
+functions.]]
+[[`BOOST_MATH_INSTRUMENT`] [Define to output diagnostics for math functions. This is rather 'global' to Boost.Math and so
+coarse-grained that it will probably produce copious output! (Especially because full precision values are output).
+Designed primarily for internal use and development.]]
+[[`BOOST_MATH_INSTRUMENT_CODE(x)`] [Output selected named variable, for example `BOOST_MATH_INSTRUMENT_CODE("guess = " << guess)`; Used by `BOOST_MATH_INSTRUMENT`]]
+[[`BOOST_MATH_INSTRUMENT_VARIABLE(name)`] [Output selected variable, for example `BOOST_MATH_INSTRUMENT_VARIABLE(result);` Used by `BOOST_MATH_INSTRUMENT`]]
+[[`BOOST_MATH_INSTRUMENT_FPU`] [Output the state of the FPU's control flags.]]
+] [/table]
+
+[table Boost.Math Tuning
+[[ Macros for Tuning performance options for specific compilers] [Notes]]
+[[`BOOST_MATH_POLY_METHOD`] [See the [link math_toolkit.perf.tuning performance tuning section].]]
+[[`BOOST_MATH_RATIONAL_METHOD`] [See the [link math_toolkit.perf.tuning performance tuning section].]]
+[[`BOOST_MATH_MAX_POLY_ORDER`] [See the [link math_toolkit.perf.tuning performance tuning section].]]
+[[`BOOST_MATH_INT_TABLE_TYPE`] [See the [link math_toolkit.perf.tuning performance tuning section].]]
+[[`BOOST_MATH_INT_VALUE_SUFFIX`] [Helper macro for appending the correct suffix to integer constants
+which may actually be stored as reals depending on the value of BOOST_MATH_INT_TABLE_TYPE.]]
+] [/table]
+
+[endsect] [/section:config_macros Configuration Macros]
+
+[/
+ Copyright 2010 John Maddock and Paul A. Bristow.
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt).
+]
Modified: branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -13,9 +13,11 @@
[include distributions/extreme_value.qbk]
[include distributions/fisher.qbk]
[include distributions/gamma.qbk]
+[include distributions/geometric.qbk]
+[include distributions/hypergeometric.qbk]
[include distributions/inverse_chi_squared.qbk]
[include distributions/inverse_gamma.qbk]
-[include distributions/hypergeometric.qbk]
+[include distributions/inverse_gaussian.qbk]
[include distributions/laplace.qbk]
[include distributions/logistic.qbk]
[include distributions/lognormal.qbk]
@@ -30,8 +32,8 @@
[include distributions/rayleigh.qbk]
[include distributions/students_t.qbk]
[include distributions/triangular.qbk]
-[include distributions/weibull.qbk]
[include distributions/uniform.qbk]
+[include distributions/weibull.qbk]
[endsect][/section:dists Distributions]
@@ -44,13 +46,13 @@
[h4 Adding Additional Location and Scale Parameters]
-In some modelling applications we require a distribution with a specific
-location and scale:
+In some modelling applications we require a distribution
+with a specific location and scale:
often this equates to a specific mean and standard deviation, although for many
distributions the relationship between these properties and the location and
-scale parameters are non-trivial.
-See [@http://www.itl.nist.gov/div898/handbook/eda/section3/eda364.htm http://www.itl.nist.gov/div898/handbook/eda/section3/eda364.htm] for more
-information.
+scale parameters are non-trivial. See
+[@http://www.itl.nist.gov/div898/handbook/eda/section3/eda364.htm http://www.itl.nist.gov/div898/handbook/eda/section3/eda364.htm]
+for more information.
The obvious way to handle this is via an adapter template:
@@ -67,7 +69,7 @@
[h4 An "any_distribution" class]
-It would be fairly trivial to add a distribution object that virtualises
+It is easy to add a distribution object that virtualises
the actual type of the distribution, and can therefore hold "any" object
that conforms to the conceptual requirements of a distribution:
@@ -85,8 +87,13 @@
// etc....
Such a class would facilitate the writing of non-template code that can
-function with any distribution type. It's not clear yet whether there is a
-compelling use case though. Possibly tests for goodness of fit might
+function with any distribution type.
+
+The [@http://sourceforge.net/projects/distexplorer/ Statistical Distribution Explorer]
+utility for Windows is a usage example.
+
+It's not clear yet whether there is a compelling use case though.
+Possibly tests for goodness of fit might
provide such a use case: this needs more investigation.
[h4 Higher Level Hypothesis Tests]
Modified: branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -19,7 +19,6 @@
All the code in this library is inside namespace boost::math.
-
In order to use a distribution /my_distribution/ you will need to include
either the header <boost/math/distributions/my_distribution.hpp> or
the "include all the distributions" header: <boost/math/distributions.hpp>.
@@ -305,7 +304,8 @@
[*Critical values are just quantiles]
-Some texts talk about quantiles, or percentiles, others about critical values, the basic rule is:
+Some texts talk about quantiles, or percentiles or fractiles,
+others about critical values, the basic rule is:
['Lower critical values] are the same as the quantile.
@@ -433,9 +433,11 @@
[include distributions/chi_squared_examples.qbk]
[include distributions/f_dist_example.qbk]
[include distributions/binomial_example.qbk]
+[include distributions/geometric_example.qbk]
[include distributions/negative_binomial_example.qbk]
[include distributions/normal_example.qbk]
[/include distributions/inverse_gamma_example.qbk]
+[/include distributions/inverse_gaussian_example.qbk]
[include distributions/nc_chi_squared_example.qbk]
[include distributions/error_handling_example.qbk]
[include distributions/find_location_and_scale.qbk]
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -17,7 +17,7 @@
typedef RealType value_type;
typedef Policy policy_type;
- static const ``['unspecified-type]`` cloppper_pearson_exact_interval;
+ static const ``['unspecified-type]`` clopper_pearson_exact_interval;
static const ``['unspecified-type]`` jeffreys_prior_interval;
// construct:
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/cauchy.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/cauchy.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/cauchy.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -127,7 +127,7 @@
or not, and whether /x/ is less than __x0 or not.
]]
[[quantile][The same procedure is used irrespective of whether we're starting
- from the probability or it's complement. First the argument /p/ is
+ from the probability or its complement. First the argument /p/ is
reduced to the range \[-0.5, 0.5\], then the relation
x = __x0 [plusminus] [gamma][space] / tan([pi] * p)
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/fisher.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/fisher.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/fisher.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -78,7 +78,7 @@
The normal distribution is implemented in terms of the
[link math_toolkit.special.sf_beta.ibeta_function incomplete beta function]
-and it's [link math_toolkit.special.sf_beta.ibeta_inv_function inverses],
+and its [link math_toolkit.special.sf_beta.ibeta_inv_function inverses],
refer to those functions for accuracy data.
[h4 Implementation]
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -34,12 +34,12 @@
To avoid potential confusion with the gamma functions, this
distribution does not provide the typedef:
-``typedef gamma_distibution<double> gamma;``
+``typedef gamma_distribution<double> gamma;``
-Instead if you want
-a double precision gamma distribution you can use
+Instead if you want a double precision gamma distribution you can write
-``boost::math::gamma_distribution<>``]
+``boost::math::gamma_distribution<> my_gamma(1, 1);``
+]
For shape parameter /k/ and scale parameter [theta][space] it is defined by the
probability density function:
@@ -109,7 +109,7 @@
[h4 Implementation]
In the following table /k/ is the shape parameter of the distribution,
-[theta][space] is it's scale parameter, /x/ is the random variate, /p/ is the probability
+[theta][space] is its scale parameter, /x/ is the random variate, /p/ is the probability
and /q = 1-p/.
[table
Added: branches/release/libs/math/doc/sf_and_dist/distributions/geometric.qbk
==============================================================================
--- (empty file)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/geometric.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -0,0 +1,350 @@
+[section:geometric_dist Geometric Distribution]
+
+``#include <boost/math/distributions/geometric.hpp>``
+
+ namespace boost{ namespace math{
+
+ template <class RealType = double,
+ class ``__Policy`` = ``__policy_class`` >
+ class geometric_distribution;
+
+ typedef geometric_distribution<> geometric;
+
+ template <class RealType, class ``__Policy``>
+ class geometric_distribution
+ {
+ public:
+ typedef RealType value_type;
+ typedef Policy policy_type;
+ // Constructor from success_fraction:
+ geometric_distribution(RealType p);
+
+ // Parameter accessors:
+ RealType success_fraction() const;
+ RealType successes() const;
+
+ // Bounds on success fraction:
+ static RealType find_lower_bound_on_p(
+ RealType trials,
+ RealType successes,
+ RealType probability); // alpha
+ static RealType find_upper_bound_on_p(
+ RealType trials,
+ RealType successes,
+ RealType probability); // alpha
+
+ // Estimate min/max number of trials:
+ static RealType find_minimum_number_of_trials(
+ RealType k, // Number of failures.
+ RealType p, // Success fraction.
+ RealType probability); // Probability threshold alpha.
+ static RealType find_maximum_number_of_trials(
+ RealType k, // Number of failures.
+ RealType p, // Success fraction.
+ RealType probability); // Probability threshold alpha.
+ };
+
+ }} // namespaces
+
+The class type `geometric_distribution` represents a
+[@http://en.wikipedia.org/wiki/geometric_distribution geometric distribution]:
+it is used when there are exactly two mutually exclusive outcomes of a
+[@http://en.wikipedia.org/wiki/Bernoulli_trial Bernoulli trial]:
+these outcomes are labelled "success" and "failure".
+
+For [@http://en.wikipedia.org/wiki/Bernoulli_trial Bernoulli trials]
+each with success fraction /p/, the geometric distribution gives
+the probability of observing /k/ trials (failures, events, occurrences, or arrivals)
+before the first success.
+
+[note For this implementation, the set of trials *includes zero*
+(unlike another definition where the set of trials starts at one, sometimes named /shifted/).]
+The geometric distribution assumes that success_fraction /p/ is fixed for all /k/ trials.
+
+The probability that there are /k/ failures before the first success is
+
+__spaces Pr(Y=/k/) = (1-/p/)[super /k/]/p/
+
+For example, when throwing a 6-face dice the success probability /p/ = 1/6 = 0.1666[recur][space].
+Throwing repeatedly until a /three/ appears,
+the probability distribution of the number of times /not-a-three/ is thrown
+is geometric.
+
+Geometric distribution has the Probability Density Function PDF:
+
+__spaces (1-/p/)[super /k/]/p/
+
+The following graph illustrates how the PDF and CDF vary for three examples
+of the success fraction /p/,
+(when considering the geometric distribution as a continuous function),
+
+[graph geometric_pdf_2]
+
+[graph geometric_cdf_2]
+
+and as discrete.
+
+[graph geometric_pdf_discrete]
+
+[graph geometric_cdf_discrete]
+
+
+[h4 Related Distributions]
+
+The geometric distribution is a special case of
+the __negative_binomial_distrib with successes parameter /r/ = 1,
+so only one first and only success is required : thus by definition
+__spaces `geometric(p) == negative_binomial(1, p)`
+
+ negative_binomial_distribution(RealType r, RealType success_fraction);
+ negative_binomial nb(1, success_fraction);
+ geometric g(success_fraction);
+ ASSERT(pdf(nb, 1) == pdf(g, 1));
+
+This implementation uses real numbers for the computation throughout
+(because it uses the *real-valued* power and exponential functions).
+So to obtain a conventional strictly-discrete geometric distribution
+you must ensure that an integer value is provided for the number of trials
+(random variable) /k/,
+and take integer values (floor or ceil functions) from functions that return
+a number of successes.
+
+[discrete_quantile_warning geometric]
+
+[h4 Member Functions]
+
+[h5 Constructor]
+
+ geometric_distribution(RealType p);
+
+Constructor: /p/ or success_fraction is the probability of success of a single trial.
+
+Requires: `0 <= p <= 1`.
+
+[h5 Accessors]
+
+ RealType success_fraction() const; // successes / trials (0 <= p <= 1)
+
+Returns the success_fraction parameter /p/ from which this distribution was constructed.
+
+ RealType successes() const; // required successes always one,
+ // included for compatibility with negative binomial distribution
+ // with successes r == 1.
+
+Returns unity.
+
+The following functions are equivalent to those provided for the negative binomial,
+with successes = 1, but are provided here for completeness.
+
+The best method of calculation for the following functions is disputed:
+see __binomial_distrib and __negative_binomial_distrib for more discussion.
+
+[h5 Lower Bound on success_fraction Parameter ['p]]
+
+ static RealType find_lower_bound_on_p(
+ RealType failures,
+ RealType probability) // (0 <= alpha <= 1), 0.05 equivalent to 95% confidence.
+
+Returns a *lower bound* on the success fraction:
+
+[variablelist
+[[failures][The total number of failures before the 1st success.]]
+[[alpha][The largest acceptable probability that the true value of
+ the success fraction is [*less than] the value returned.]]
+]
+
+For example, if you observe /k/ failures from /n/ trials
+the best estimate for the success fraction is simply 1/['n], but if you
+want to be 95% sure that the true value is [*greater than] some value,
+['p[sub min]], then:
+
+ p``[sub min]`` = geometric_distribution<RealType>::
+ find_lower_bound_on_p(failures, 0.05);
+
+[link math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf See negative_binomial confidence interval example.]
+
+This function uses the Clopper-Pearson method of computing the lower bound on the
+success fraction, whilst many texts refer to this method as giving an "exact"
+result in practice it produces an interval that guarantees ['at least] the
+coverage required, and may produce pessimistic estimates for some combinations
+of /failures/ and /successes/. See:
+
+[@http://www.ucs.louisiana.edu/~kxk4695/Discrete_new.pdf
+Yong Cai and K. Krishnamoorthy, A Simple Improved Inferential Method for Some Discrete Distributions.
+Computational statistics and data analysis, 2005, vol. 48, no3, 605-621].
+
+[h5 Upper Bound on success_fraction Parameter p]
+
+ static RealType find_upper_bound_on_p(
+ RealType trials,
+ RealType alpha); // (0 <= alpha <= 1), 0.05 equivalent to 95% confidence.
+
+Returns an *upper bound* on the success fraction:
+
+[variablelist
+[[trials][The total number of trials conducted.]]
+[[alpha][The largest acceptable probability that the true value of
+ the success fraction is [*greater than] the value returned.]]
+]
+
+For example, if you observe /k/ successes from /n/ trials the
+best estimate for the success fraction is simply ['k/n], but if you
+want to be 95% sure that the true value is [*less than] some value,
+['p[sub max]], then:
+
+ p``[sub max]`` = geometric_distribution<RealType>::find_upper_bound_on_p(
+ k, 0.05);
+
+[link math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf See negative binomial confidence interval example.]
+
+This function uses the Clopper-Pearson method of computing the lower bound on the
+success fraction, whilst many texts refer to this method as giving an "exact"
+result in practice it produces an interval that guarantees ['at least] the
+coverage required, and may produce pessimistic estimates for some combinations
+of /failures/ and /successes/. See:
+
+[@http://www.ucs.louisiana.edu/~kxk4695/Discrete_new.pdf
+Yong Cai and K. Krishnamoorthy, A Simple Improved Inferential Method for Some Discrete Distributions.
+Computational statistics and data analysis, 2005, vol. 48, no3, 605-621].
+
+[h5 Estimating Number of Trials to Ensure at Least a Certain Number of Failures]
+
+ static RealType find_minimum_number_of_trials(
+ RealType k, // number of failures.
+ RealType p, // success fraction.
+ RealType alpha); // probability threshold (0.05 equivalent to 95%).
+
+This functions estimates the number of trials required to achieve a certain
+probability that [*more than ['k] failures will be observed].
+
+[variablelist
+[[k][The target number of failures to be observed.]]
+[[p][The probability of ['success] for each trial.]]
+[[alpha][The maximum acceptable ['risk] that only ['k] failures or fewer will be observed.]]
+]
+
+For example:
+
+ geometric_distribution<RealType>::find_minimum_number_of_trials(10, 0.5, 0.05);
+
+Returns the smallest number of trials we must conduct to be 95% (1-0.05) sure
+of seeing 10 failures that occur with frequency one half.
+
+[link math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_size_eg Worked Example.]
+
+This function uses numeric inversion of the geometric distribution
+to obtain the result: another interpretation of the result is that it finds
+the number of trials (failures) that will lead to an /alpha/ probability
+of observing /k/ failures or fewer.
+
+[h5 Estimating Number of Trials to Ensure a Maximum Number of Failures or Less]
+
+ static RealType find_maximum_number_of_trials(
+ RealType k, // number of failures.
+ RealType p, // success fraction.
+ RealType alpha); // probability threshold (0.05 equivalent to 95%).
+
+This functions estimates the maximum number of trials we can conduct and achieve
+a certain probability that [*k failures or fewer will be observed].
+
+[variablelist
+[[k][The maximum number of failures to be observed.]]
+[[p][The probability of ['success] for each trial.]]
+[[alpha][The maximum acceptable ['risk] that more than ['k] failures will be observed.]]
+]
+
+For example:
+
+ geometric_distribution<RealType>::find_maximum_number_of_trials(0, 1.0-1.0/1000000, 0.05);
+
+Returns the largest number of trials we can conduct and still be 95% sure
+of seeing no failures that occur with frequency one in one million.
+
+This function uses numeric inversion of the geometric distribution
+to obtain the result: another interpretation of the result, is that it finds
+the number of trials that will lead to an /alpha/ probability
+of observing more than k failures.
+
+[h4 Non-member Accessors]
+
+All the [link math_toolkit.dist.dist_ref.nmp usual non-member accessor functions]
+that are generic to all distributions are supported: __usual_accessors.
+
+However it's worth taking a moment to define what these actually mean in
+the context of this distribution:
+
+[table Meaning of the non-member accessors.
+[[Function][Meaning]]
+[[__pdf]
+ [The probability of obtaining [*exactly k failures] from /k/ trials
+ with success fraction p. For example:
+
+``pdf(geometric(p), k)``]]
+[[__cdf]
+ [The probability of obtaining [*k failures or fewer] from /k/ trials
+ with success fraction p and success on the last trial. For example:
+
+``cdf(geometric(p), k)``]]
+[[__ccdf]
+ [The probability of obtaining [*more than k failures] from /k/ trials
+ with success fraction p and success on the last trial. For example:
+
+``cdf(complement(geometric(p), k))``]]
+[[__quantile]
+ [The [*greatest] number of failures /k/ expected to be observed from /k/ trials
+ with success fraction /p/, at probability /P/. Note that the value returned
+ is a real-number, and not an integer. Depending on the use case you may
+ want to take either the floor or ceiling of the real result. For example:
+``quantile(geometric(p), P)``]]
+[[__quantile_c]
+ [The [*smallest] number of failures /k/ expected to be observed from /k/ trials
+ with success fraction /p/, at probability /P/. Note that the value returned
+ is a real-number, and not an integer. Depending on the use case you may
+ want to take either the floor or ceiling of the real result. For example:
+ ``quantile(complement(geometric(p), P))``]]
+]
+
+[h4 Accuracy]
+
+This distribution is implemented using the pow and exp functions, so most results
+are accurate within a few epsilon for the RealType.
+For extreme values of `double` /p/, for example 0.9999999999,
+accuracy can fall significantly, for example to 10 decimal digits (from 16).
+
+[h4 Implementation]
+
+In the following table, /p/ is the probability that any one trial will
+be successful (the success fraction), /k/ is the number of failures,
+/p/ is the probability and /q = 1-p/,
+/x/ is the given probability to estimate
+the expected number of failures using the quantile.
+
+[table
+[[Function][Implementation Notes]]
+[[pdf][pdf = p * pow(q, k)]]
+[[cdf][cdf = 1 - q[super k=1]]]
+[[cdf complement][exp(log1p(-p) * (k+1))]]
+[[quantile][k = log1p(-x) / log1p(-p) -1]]
+[[quantile from the complement][k = log(x) / log1p(-p) -1]]
+[[mean][(1-p)/p]]
+[[variance][(1-p)/p[sup2]]]
+[[mode][0]]
+[[skewness][(2-p)/[sqrt]q]]
+[[kurtosis][9+p[sup2]/q]]
+[[kurtosis excess][6 +p[sup2]/q]]
+[[parameter estimation member functions][See __negative_binomial_distrib]]
+[[`find_lower_bound_on_p`][See __negative_binomial_distrib]]
+[[`find_upper_bound_on_p`][See __negative_binomial_distrib]]
+[[`find_minimum_number_of_trials`][See __negative_binomial_distrib]]
+[[`find_maximum_number_of_trials`][See __negative_binomial_distrib]]
+]
+
+[endsect][/section:geometric_dist geometric]
+
+[/ geometric.qbk
+ Copyright 2010 John Maddock and Paul A. Bristow.
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt).
+]
+
Added: branches/release/libs/math/doc/sf_and_dist/distributions/geometric_example.qbk
==============================================================================
--- (empty file)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/geometric_example.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -0,0 +1,20 @@
+[section:geometric_eg Geometric Distribution Examples]
+
+[import \..\..\..\example\geometric_examples.cpp]
+[geometric_eg1_1]
+[geometric_eg1_2]
+
+See full source C++ of this example at
+[@\..\..\..\example\geometric_examples.cpp geometric_examples.cpp]
+
+[link math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf See negative_binomial confidence interval example.]
+
+[endsect] [/section:geometric_eg Geometric Distribution Examples]
+
+[/ geometric.qbk
+ Copyright 2010 John Maddock and Paul A. Bristow.
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt).
+]
+
Added: branches/release/libs/math/doc/sf_and_dist/distributions/inverse_gaussian.qbk
==============================================================================
--- (empty file)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/inverse_gaussian.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -0,0 +1,171 @@
+[section:inverse_gaussian_dist Inverse Gaussian (or Inverse Normal) Distribution]
+
+``#include <boost/math/distributions/wald.hpp>``
+
+ namespace boost{ namespace math{
+
+ template <class RealType = double,
+ class ``__Policy`` = ``__policy_class`` >
+ class inverse_gaussian_distribution
+ {
+ public:
+ typedef RealType value_type;
+ typedef Policy policy_type;
+
+ inverse_gaussian_distribution(RealType mean = 1, RealType scale = 1);
+
+ RealType mean()const; // mean default 1.
+ RealType scale()const; // Optional scale, default 1 (unscaled).
+ RealType shape()const; // Shape = scale/mean.
+ };
+ typedef inverse_gaussian_distribution<double> inverse_gaussian;
+
+ }} // namespace boost // namespace math
+
+The Inverse Gaussian distribution distribution is a continuous probability distribution.
+
+The distribution is also called 'normal-inverse Gaussian distribution',
+and 'normal Inverse' distribution.
+
+It is also convenient to provide unity as default for both mean and scale.
+This is the Standard form for all distributions.
+The Inverse Gaussian distribution was first studied in relation to Brownian motion.
+In 1956 M.C.K. Tweedie used the name Inverse Gaussian because there is an inverse relationship
+between the time to cover a unit distance and distance covered in unit time.
+The inverse Gaussian is one of family of distributions that have been called the
+[@http://en.wikipedia.org/wiki/Tweedie_distributions Tweedie distributions].
+
+(So ['inverse] in the name may mislead: it does [*not] relate to the inverse of a distribution).
+
+The tails of the distribution decrease more slowly than the normal distribution.
+It is therefore suitable to model phenomena
+where numerically large values are more probable than is the case for the normal distribution.
+For stock market returns and prices, a key characteristic is that it models
+that extremely large variations from typical (crashes) can occur
+even when almost all (normal) variations are small.
+
+Examples are returns from financial assets and turbulent wind speeds.
+
+The normal-inverse Gaussian distributions form
+a subclass of the generalised hyperbolic distributions.
+
+See
+[@http://en.wikipedia.org/wiki/Normal-inverse_Gaussian_distribution distribution].
+[@http://mathworld.wolfram.com/InverseGaussianDistribution.html
+ Weisstein, Eric W. "Inverse Gaussian Distribution." From MathWorld--A Wolfram Web Resource.]
+
+If you want a `double` precision inverse_gaussian distribution you can use
+
+``boost::math::inverse_gaussian_distribution<>``
+
+or, more conveniently, you can write
+
+ using boost::math::inverse_gaussian;
+ inverse_gaussian my_ig(2, 3);
+
+For mean parameters [mu] and scale (also called precision) parameter [lambda],
+and random variate x,
+the inverse_gaussian distribution is defined by the probability density function (PDF):
+
+__spaces f(x;[mu], [lambda]) = [sqrt]([lambda]/2[pi]x[super 3]) e[super -[lambda](x-[mu])[sup2]/2[mu][sup2]x]
+
+and Cumulative Density Function (CDF):
+
+__spaces F(x;[mu], [lambda]) = [Phi]{[sqrt]([lambda]/x) (x/[mu]-1)} + e[super 2[mu]/[lambda]] [Phi]{-[sqrt]([lambda]/[mu]) (1+x/[mu])}
+
+where [Phi] is the standard normal distribution CDF.
+
+The following graphs illustrate how the PDF and CDF of the inverse_gaussian distribution
+varies for a few values of parameters [mu] and [lambda]:
+
+[graph inverse_gaussian_pdf] [/.png or .svg]
+
+[graph inverse_gaussian_cdf]
+
+Tweedie also provided 3 other parameterisations where ([mu] and [lambda])
+are replaced by their ratio [phi] = [lambda]/[mu] and by 1/[mu]:
+these forms may be more suitable for Bayesian applications.
+These can be found on Seshadri, page 2 and are also discussed by Chhikara and Folks on page 105.
+Another related parameterisation, the __wald_distrib (where mean [mu] is unity) is also provided.
+
+[h4 Member Functions]
+
+ inverse_gaussian_distribution(RealType df = 1, RealType scale = 1); // optionally scaled.
+
+Constructs an inverse_gaussian distribution with [mu] mean,
+and scale [lambda], with both default values 1.
+
+Requires that both the mean [mu] parameter and scale [lambda] are greater than zero,
+otherwise calls __domain_error.
+
+ RealType mean()const;
+
+Returns the mean [mu] parameter of this distribution.
+
+ RealType scale()const;
+
+Returns the scale [lambda] parameter of this distribution.
+
+[h4 Non-member Accessors]
+
+All the [link math_toolkit.dist.dist_ref.nmp usual non-member accessor functions] that are generic to all
+distributions are supported: __usual_accessors.
+
+The domain of the random variate is \[0,+[infin]).
+[note Unlike some definitions, this implementation supports a random variate
+equal to zero as a special case, returning zero for both pdf and cdf.]
+
+[h4 Accuracy]
+
+The inverse_gaussian distribution is implemented in terms of the
+exponential function and standard normal distribution ['N]0,1 [Phi] :
+refer to the accuracy data for those functions for more information.
+But in general, gamma (and thus inverse gamma) results are often accurate to a few epsilon,
+>14 decimal digits accuracy for 64-bit double.
+
+[h4 Implementation]
+
+In the following table [mu] is the mean parameter and
+[lambda] is the scale parameter of the inverse_gaussian distribution,
+/x/ is the random variate, /p/ is the probability and /q = 1-p/ its complement.
+Parameters [mu] for shape and [lambda] for scale
+are used for the inverse gaussian function.
+
+[table
+[[Function] [Implementation Notes] ]
+[[pdf] [ [sqrt]([lambda]/ 2[pi]x[super 3]) e[super -[lambda](x - [mu])[sup2]/ 2[mu][sup2]x]]]
+[[cdf][ [Phi]{[sqrt]([lambda]/x) (x/[mu]-1)} + e[super 2[mu]/[lambda]] [Phi]{-[sqrt]([lambda]/[mu]) (1+x/[mu])} ]]
+[[cdf complement] [using complement of [Phi] above.] ]
+[[quantile][No closed form known. Estimated using a guess refined by Newton-Raphson iteration.]]
+[[quantile from the complement][No closed form known. Estimated using a guess refined by Newton-Raphson iteration.]]
+[[mode][[mu] {[sqrt](1+9[mu][sup2]/4[lambda][sup2])[sup2] - 3[mu]/2[lambda]} ]]
+[[median][No closed form analytic equation is known, but is evaluated as quantile(0.5)]]
+[[mean][[mu]] ]
+[[variance][[mu][cubed]/[lambda]] ]
+[[skewness][3 [sqrt] ([mu]/[lambda])] ]
+[[kurtosis_excess][15[mu]/[lambda]] ]
+[[kurtosis][12[mu]/[lambda]] ]
+] [/table]
+
+[h4 References]
+
+#Wald, A. (1947). Sequential analysis. Wiley, NY.
+#The Inverse Gaussian distribution : theory, methodology, and applications, Raj S. Chhikara, J. Leroy Folks. ISBN 0824779975 (1989).
+#The Inverse Gaussian distribution : statistical theory and applications, Seshadri, V , ISBN - 0387986189 (pbk) (Dewey 519.2) (1998).
+#[@http://docs.scipy.org/doc/numpy/reference/generated/numpy.random.wald.html Numpy and Scipy Documentation].
+#[@http://bm2.genes.nig.ac.jp/RGM2/R_current/library/statmod/man/invgauss.html R statmod invgauss functions].
+#[@http://cran.r-project.org/web/packages/SuppDists/index.html R SuppDists invGauss functions].
+(Note that these R implementations names differ in case).
+#[@http://www.statsci.org/s/invgauss.html StatSci.org invgauss help].
+#[@http://www.statsci.org/s/invgauss.statSci.org invgauss R source].
+#[@http://www.biostat.wustl.edu/archives/html/s-news/2001-12/msg00144.html pwald, qwald].
+#[@http://www.brighton-webs.co.uk/distributions/wald.asp Brighton Webs wald].
+
+[endsect] [/section:inverse_gaussian_dist Inverse Gaussiann Distribution]
+
+[/
+ Copyright 2010 John Maddock and Paul A. Bristow.
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt).
+]
\ No newline at end of file
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/lognormal.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/lognormal.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/lognormal.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -90,7 +90,7 @@
[h4 Implementation]
In the following table /m/ is the location parameter of the distribution,
-/s/ is it's scale parameter, /x/ is the random variate, /p/ is the probability
+/s/ is its scale parameter, /x/ is the random variate, /p/ is the probability
and /q = 1-p/.
[table
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/nc_beta.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/nc_beta.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/nc_beta.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -80,12 +80,14 @@
[h4 Non-member Accessors]
Most of the [link math_toolkit.dist.dist_ref.nmp usual non-member accessor functions]
-are supported: __cdf, __pdf, __quantile,
+are supported: __cdf, __pdf, __quantile, __mean, __variance, __sd,
__median, __mode, __hazard, __chf, __range and __support.
+Mean and variance are implemented using hypergeometric pfq functions and relations given in
+[@http://reference.wolfram.com/mathematica/ref/NoncentralBetaDistribution.html Wolfram Noncentral Beta Distribution].
+
However, the following are not currently implemented:
-__mean, __variance, __sd, __skewness,
- __kurtosis and __kurtosis_excess.
+ __skewness, __kurtosis and __kurtosis_excess.
The domain of the random variable is \[0, 1\].
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/nc_t.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/nc_t.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/nc_t.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -150,7 +150,7 @@
and therefore we have a means to compute either the probability or its
complement directly without the risk of cancellation error. The
crossover criterion for choosing whether to calculate the CDF or
-it's complement is the same as for the
+its complement is the same as for the
__non_central_beta_distrib.
The PDF can be computed by a very similar method using:
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -63,8 +63,6 @@
whereas for the binomial,
the random variable is the number of successes, for a fixed number of trials.]
-
-
It has the PDF:
[equation neg_binomial_ref]
@@ -131,6 +129,9 @@
Returns the parameter /r/ from which this distribution was constructed.
+The best method of calculation for the following functions is disputed:
+see __binomial_distrib for more discussion.
+
[h5 Lower Bound on Parameter p]
static RealType find_lower_bound_on_p(
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -199,8 +199,8 @@
The quantile is best viewed as the inverse of the __cdf, it returns
a value /x/ such that `cdf(dist, x) == p`.
-This is also known as the /percent point function/, or a /percentile/, it is
-also the same as calculating the ['lower critical value] of a distribution.
+This is also known as the /percent point function/, or /percentile/, or /fractile/,
+it is also the same as calculating the ['lower critical value] of a distribution.
This function returns a __domain_error if the probability lies outside [0,1].
The function may return an __overflow_error if there is no finite value
@@ -354,7 +354,7 @@
Lowercase p and q are sometimes used to refer to the values returned
by these functions.
-[h4 [#percent]Percent Point Function]
+[h4 [#percent]Percent Point Function or Percentile]
The percent point function, also known as the percentile, is the same as
the __quantile.
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/normal.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/normal.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/normal.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -33,7 +33,7 @@
A normal distribution with mean zero and standard deviation one
is known as the ['Standard Normal Distribution].
-Given mean [mu][space] and standard deviation [sigma][space] it has the PDF:
+Given mean [mu][space]and standard deviation [sigma][space]it has the PDF:
[equation normal_ref1]
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/students_t.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/students_t.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/students_t.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -118,7 +118,7 @@
The normal distribution is implemented in terms of the
[link math_toolkit.special.sf_beta.ibeta_function incomplete beta function]
-and [link math_toolkit.special.sf_beta.ibeta_inv_function it's inverses],
+and [link math_toolkit.special.sf_beta.ibeta_inv_function its inverses],
refer to accuracy data on those functions for more information.
[h4 Implementation]
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/weibull.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/weibull.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/weibull.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,4 +1,4 @@
-[section:weibull Weibull Distribution]
+[section:weibull_dist Weibull Distribution]
``#include <boost/math/distributions/weibull.hpp>``
@@ -99,7 +99,7 @@
In the following table [alpha][space] is the shape parameter of the distribution,
-[beta][space] is it's scale parameter, /x/ is the random variate, /p/ is the probability
+[beta][space] is its scale parameter, /x/ is the random variate, /p/ is the probability
and /q = 1-p/.
[table
Modified: branches/release/libs/math/doc/sf_and_dist/error_handling.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/error_handling.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/error_handling.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,4 +1,3 @@
-
[section:error_handling Error Handling]
[def __format [@../../../../format/index.html Boost.Format]]
@@ -30,7 +29,8 @@
[[Rounding Error][Occurs when the argument to one of the rounding functions __trunc,
__round and __modf can not be represented as an integer type, is
outside the range of the result type.]]
-[[Evaluation Error][Occurs when an internal error occured that prevented the
+[[Evaluation Error][Occurs if no method of evaluation is known,
+ or when an internal error occurred that prevented the
result from being evaluated: this should never occur, but if it does, then
it's likely to be due to an iterative method not converging fast enough.]]
[[Indeterminate Result Error][Occurs when the result of a function is not
@@ -109,8 +109,10 @@
[table Possible Actions for Rounding Errors
[[Action] [Behaviour]]
[[throw_on_error][Throws `boost::math::rounding_error`]]
-[[errno_on_error][Sets `::errno` to `ERANGE` and returns an unspecified value.]]
-[[ignore_error][[*Returns the an unspecified value.]]]
+[[errno_on_error][Sets `::errno` to `ERANGE` and returns the largest representable value of the target integer type
+(or the most negative value if the argument to the function was less than zero).]]
+[[ignore_error][[*Returns the largest representable value of the target integer type
+(or the most negative value if the argument to the function was less than zero).]]]
[[user_error][Returns the result of `boost::math::policies::user_rounding_error`:
[link math_toolkit.policy.pol_tutorial.user_def_err_pol
this function must be defined by the user].]]
Modified: branches/release/libs/math/doc/sf_and_dist/factorials.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/factorials.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/factorials.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -27,18 +27,32 @@
[h4 Description]
[important
-The functions described below are templates where the template argument T can not be deduced from the
+The functions described below are templates where the template argument T CANNOT be deduced from the
arguments passed to the function. Therefore if you write something like:
`boost::math::factorial(2);`
-You will get a compiler error, ususally indicating that there is no such function to be found. Instead you need to specifiy
-the return type explicity and write:
+You will get a (perhaps perplexing) compiler error, ususally indicating that there is no such function to be found.
+Instead you need to specify the return type explicity and write:
`boost::math::factorial<double>(2);`
-So that the return type is known. Further, the template argument must be a real-valued type such as `float` or `double`
-and not an integer type - that would overflow far too easily!
+So that the return type is known.
+
+Furthermore, the template argument must be a real-valued type such as `float` or `double`
+and not an integer type - that would overflow far too easily for quite small values of parameter `i`!
+
+The source code `static_assert` and comment just after the will be:
+
+``
+ BOOST_STATIC_ASSERT(!boost::is_integral<T>::value);
+ // factorial<unsigned int>(n) is not implemented
+ // because it would overflow integral type T for too small n
+ // to be useful. Use instead a floating-point type,
+ // and convert to an unsigned type if essential, for example:
+ // unsigned int nfac = static_cast<unsigned int>(factorial<double>(n));
+ // See factorial documentation for more detail.
+``
]
template <class T>
@@ -128,13 +142,25 @@
`boost::math::double_factorial(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 (possibly perplexing) compiler error, ususally 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<double>(2);`
So that the return type is known. Further, the template argument must be a real-valued type such as `float` or `double`
and not an integer type - that would overflow far too easily!
+
+The source code `static_assert` and comment just after the will be:
+
+``
+ BOOST_STATIC_ASSERT(!boost::is_integral<T>::value);
+ // factorial<unsigned int>(n) is not implemented
+ // because it would overflow integral type T for too small n
+ // to be useful. Use instead a floating-point type,
+ // and convert to an unsigned type if essential, for example:
+ // unsigned int nfac = static_cast<unsigned int>(factorial<double>(n));
+ // See factorial documentation for more detail.
+``
]
[h4 Accuracy]
@@ -339,9 +365,8 @@
[endsect][/section:factorials Factorials]
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
]
-
Added: branches/release/libs/math/doc/sf_and_dist/faq.qbk
==============================================================================
--- (empty file)
+++ branches/release/libs/math/doc/sf_and_dist/faq.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -0,0 +1,93 @@
+[section:faq Frequently Asked Questions FAQ]
+
+# ['I'm a FORTRAN/NAG/SPSS/SAS/Cephes/MathCad/R user
+and I don't see where the functions like dnorm(mean, sd) are in Boost.Math?] [br]
+Nearly all are provided, and many more like mean, skewness, quantiles, complements ...
+but Boost.Math makes full use of C++, and it looks a bit different.
+But do not panic! See section on construction and the many examples.
+Briefly, the distribution is constructed with the parameters (like location and scale)
+(things after the | in representation like P(X=k|n, p) or ; in a common represention of pdf f(x; [mu][sigma][super 2]).
+Functions like pdf, cdf are called with the name of that distribution and the random variate often called x or k.
+For example, `normal my_norm(0, 1); pdf(my_norm, 2.0);` [br]
+#I'm a user of [@http://support.sas.com/rnd/app/da/new/probabilityfunctions.html New SAS Functions for Computing Probabilities]. [br]
+You will find the interface more familar, but to be able to select a distribution (perhaps using a string)
+see the Extras/Future Directions section,
+and /boost/libs/math/dot_net_example/boost_math.cpp for an example that is used to create a C# utility
+(that you might also find useful): see [@http://sourceforge.net/projects/distexplorer/ Statistical Distribution Explorer] [br].
+# ['I'm allegic to reading manuals and prefer to learn from examples.][br]
+Fear not - you are not alone! Many examples are available for functions and distributions.
+Some are referenced directly from the text. Others can be found at \boost_latest_release\libs\math\example.
+If you are a Visual Studio user, you should be able to create projects from each of these,
+making sure that the Boost library is in the include directories list.
+# ['How do I make sure that the Boost library is in the Visual Studio include directories list?][br]
+You can add an include path, for example, your Boost place /boost-latest_release,
+for example `X:/boost_1_45_0/` if you have a separate partition X for Boost releases.
+Or you can use an environment variable BOOST_ROOT set to your Boost place, and include that.
+Visual Studio before 2010 provided Tools, Options, VC++ Directories to control directories:
+Visual Studio 2010 instead provides property sheets to assist.
+You may find it convenient to create a new one adding \boost-latest_release;
+to the existing include items in $(IncludePath).
+# ['I'm a FORTRAN/NAG/SPSS/SAS/Cephes/MathCad/R user and
+I don't see where the properties like mean, median, mode, variance, skewness of distributions are in Boost.Math?][br]
+They are all available (if defined for the parameters with which you constructed the distribution) via __usual_accessors.
+# ['I am a C programmer. Can I user Boost.Math with C?][br]
+Yes you can, including all the special functions, and TR1 functions like isnan.
+They appear as C functions, by being declared as "extern C".
+# ['I am a C# (Basic? F# FORTRAN? Other CLI?) programmer. Can I use Boost.Math with C#?] [br]
+Yes you can, including all the special functions, and TR1 functions like isnan.
+But you [*must build the Boost.Math as a dynamic library (.dll) and compile with the /CLI option].
+See the boost/math/dot_net_example folder which contains an example that
+builds a simple statistical distribution app with a GUI.
+See [@http://sourceforge.net/projects/distexplorer/ Statistical Distribution Explorer] [br]
+# ['What these "policies" things for?] [br]
+Policies are a powerful (if necessarily complex) fine-grain mechanism that
+allow you to customise the behaviour of the Boost.Math library according to your precise needs.
+See __policy_section. But if, very probably, the default behaviour suits you, you don't need to know more.
+# ['I am a C user and expect to see global C-style`::errno` set for overflow/errors etc?] [br]
+You can achieve what you want - see __error_policy and __user_error_handling and many examples.
+# ['I am a C user and expect to silently return a max value for overflow?] [br]
+You (and C++ users too) can return whatever you want on overflow
+- see __overflow_error and __error_policy and several examples.
+# ['I don't want any error message for overflow etc?] [br]
+You can control exactly what happens for all the abnormal conditions, including the values returned.
+See __domain_error, __overflow_error __error_policy __user_error_handling etc and examples.
+# ['My environment doesn't allow and/or I don't want exceptions. Can I still user Boost.Math?] [br]
+Yes but you must customise the error handling: see __user_error_handling and __changing_policy_defaults .
+# ['The docs are several hundreds of pages long! Can I read the docs off-line or on paper?] [br]
+Yes - you can download the Boost current release of most documentation
+as a zip of pdfs (including Boost.Math) from Sourceforge, for example
+[@https://sourceforge.net/projects/boost/files/boost-docs/1.45.0/boost_pdf_1_45_0.tar.gz/download].
+And you can print any pages you need (or even print all pages - but be warned that there are several hundred!).
+Both html and pdf versions are highly hyperlinked.
+The entire Boost.Math pdf can be searched with Adobe Reader, Edit, Find ...
+This can often find what you seek, a partial substitute for a full index.
+# ['I want a compact version for an embedded application. Can I use float precision?] [br]
+Yes - by selecting RealType template parameter as float:
+for example normal_distribution<float> your_normal(mean, sd);
+(But double may still be used internally, so space saving may be less that you hope for).
+You can also change the promotion policy, but accuracy might be much reduced.
+# ['I seem to get somewhat different results compared to other programs. Why?]
+We hope Boost.Math to be more accurate: our priority is accuracy (over speed).
+See the section on accuracy. But for evaluations that require iterations
+there are parameters which can change the required accuracy. You might be able to
+squeeze a little more accuracy at the cost of runtime.
+# ['Will my program run more slowly compared to other math functions and statistical libraries?]
+Probably, thought not always, and not by too much: our priority is accuracy.
+For most functions, making sure you have the latest compiler version with all optimisations switched on is the key to speed.
+For evaluations that require iteration, you may be able to gain a little more speed at the expense of accuracy.
+See detailed suggestions and results on __performance.
+# ['Where are the pre-built libraries?] [br]
+Good news - you probably don't need any! - just #include <boost/math/distribution_you_want>.
+But in the unlikely event that you do, see __building.
+# ['I don't see the function or distribution that I want.] [br]
+You could try an email to ask the authors - but no promises!
+
+[endsect] [/section:faq Frequently Asked Questions]
+
+[/
+ Copyright 2010 John Maddock and Paul A. Bristow.
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt).
+]
+
Modified: branches/release/libs/math/doc/sf_and_dist/fraction.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/fraction.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/fraction.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -130,7 +130,7 @@
[equation fraction4]
-So it's generator object would look like:
+So its generator object would look like:
template <class T>
struct tan_fraction
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_2.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_2.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_discrete.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_cdf_discrete.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_2.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_2.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_discrete.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/geometric_pdf_discrete.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_cdf.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_cdf.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_pdf.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gaussian_pdf.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/normal01_cdf.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/normal01_cdf.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/normal01_pdf.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/normal01_pdf.svg
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/normal_cdf.png
==============================================================================
Binary file. No diff available.
Added: branches/release/libs/math/doc/sf_and_dist/graphs/normal_cdf.svg
==============================================================================
Binary file. No diff available.
Modified: branches/release/libs/math/doc/sf_and_dist/html/index.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/index.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/index.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -53,7 +53,7 @@
Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
Thijs van den Berg</p></div>
<div><div class="legalnotice">
-<a name="id894809"></a><p>
+<a name="id1004023"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -64,438 +64,445 @@
<div class="toc">
<p><b>Table of Contents</b></p>
<dl>
-<dt><span class="section"> Overview</span></dt>
+<dt><span class="section">Overview</span></dt>
<dd><dl>
-<dt><span class="section"> About the Math Toolkit</span></dt>
-<dt><span class="section"> Navigation</span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/directories.html"> Directory and
+<dt><span class="section">About the Math Toolkit</span></dt>
+<dt><span class="section">Navigation</span></dt>
+<dt><span class="section"><a href="math_toolkit/main_overview/directories.html">Directory and
File Structure</a></span></dt>
-<dt><span class="section"> Namespaces</span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/result_type.html"> Calculation
- of the Type of the Result</a></span></dt>
-<dt><span class="section"> Error Handling</span></dt>
-<dt><span class="section"> Compilers</span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/pol_overview.html"> Configuration
- and Policies</a></span></dt>
-<dt><span class="section"> Thread Safety</span></dt>
-<dt><span class="section"> Performance</span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/building.html"> If and How to Build
+<dt><span class="section">Namespaces</span></dt>
+<dt><span class="section"><a href="math_toolkit/main_overview/result_type.html">Calculation of
+ the Type of the Result</a></span></dt>
+<dt><span class="section">Error Handling</span></dt>
+<dt><span class="section">Compilers</span></dt>
+<dt><span class="section"><a href="math_toolkit/main_overview/config_macros.html">Configuration
+ Macros</a></span></dt>
+<dt><span class="section">Policies</span></dt>
+<dt><span class="section">Thread Safety</span></dt>
+<dt><span class="section">Performance</span></dt>
+<dt><span class="section"><a href="math_toolkit/main_overview/building.html">If and How to Build
a Boost.Math Library, and its Examples and Tests</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/history1.html"> History and What's
+<dt><span class="section"><a href="math_toolkit/main_overview/history1.html">History and What's
New</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/tr1.html"> C99 and C++ TR1 C-style
+<dt><span class="section"><a href="math_toolkit/main_overview/tr1.html">C99 and C++ TR1 C-style
Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/faq.html"> Frequently Asked Questions
+<dt><span class="section"><a href="math_toolkit/main_overview/faq.html">Frequently Asked Questions
FAQ</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/main_overview/contact.html"> Contact Info and
+<dt><span class="section"><a href="math_toolkit/main_overview/contact.html">Contact Info and
Support</a></span></dt>
</dl></dd>
-<dt><span class="section"> Statistical Distributions and Functions</span></dt>
+<dt><span class="section">Statistical Distributions and Functions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut.html"> Statistical Distributions
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut.html">Statistical Distributions
Tutorial</a></span></dt>
<dd><dl>
-<dt><span class="section"> Overview of Distributions</span></dt>
+<dt><span class="section">Overview of Distributions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/headers.html"> Headers
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/headers.html">Headers
and Namespaces</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/objects.html"> Distributions
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/objects.html">Distributions
are Objects</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/generic.html"> Generic
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/generic.html">Generic
operations common to all distributions are non-member functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/complements.html">
- Complements are supported too - and when to use them</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/parameters.html">
- Parameters can be calculated</a></span></dt>
-<dt><span class="section"> Summary</span></dt>
-</dl></dd>
-<dt><span class="section"> Worked Examples</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/dist_construct_eg.html">
- Distribution Construction Example</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/st_eg.html"> Student's
- t Distribution Examples</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/cs_eg.html"> Chi Squared
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/complements.html">Complements
+ are supported too - and when to use them</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/overview/parameters.html">Parameters
+ can be calculated</a></span></dt>
+<dt><span class="section">Summary</span></dt>
+</dl></dd>
+<dt><span class="section">Worked Examples</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/dist_construct_eg.html">Distribution
+ Construction Example</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/st_eg.html">Student's t
Distribution Examples</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/f_eg.html"> F Distribution
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/cs_eg.html">Chi Squared
+ Distribution Examples</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/f_eg.html">F Distribution
Examples</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/binom_eg.html"> Binomial
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/binom_eg.html">Binomial
+ Distribution Examples</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/geometric_eg.html">Geometric
Distribution Examples</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/neg_binom_eg.html"> Negative
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/neg_binom_eg.html">Negative
Binomial Distribution Examples</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/normal_example.html"> Normal
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/normal_example.html">Normal
Distribution Examples</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/nccs_eg.html"> Non Central
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/nccs_eg.html">Non Central
Chi Squared Example</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/error_eg.html"> Error Handling
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/error_eg.html">Error Handling
Example</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/find_eg.html"> Find Location
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/find_eg.html">Find Location
and Scale Examples</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/nag_library.html"> Comparison
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/nag_library.html">Comparison
with C, R, FORTRAN-style Free Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/c_sharp.html"> Using the
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/c_sharp.html">Using the
Distributions from Within C#</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/variates.html"> Random Variates
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/variates.html">Random Variates
and Distribution Parameters</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/stat_tut/dist_params.html"> Discrete Probability
+<dt><span class="section"><a href="math_toolkit/dist/stat_tut/dist_params.html">Discrete Probability
Distributions</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref.html"> Statistical Distributions
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref.html">Statistical Distributions
Reference</a></span></dt>
<dd><dl>
-<dt><span class="section"> Non-Member Properties</span></dt>
-<dt><span class="section"> Distributions</span></dt>
+<dt><span class="section">Non-Member Properties</span></dt>
+<dt><span class="section">Distributions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/bernoulli_dist.html">
- Bernoulli Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/beta_dist.html"> Beta
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/bernoulli_dist.html">Bernoulli
Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/binomial_dist.html">
- Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/beta_dist.html">Beta
Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/chi_squared_dist.html">
- Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/exp_dist.html"> Exponential
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/binomial_dist.html">Binomial
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/cauchy_dist.html">Cauchy-Lorentz
Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/extreme_dist.html"> Extreme
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/exp_dist.html">Exponential
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/extreme_dist.html">Extreme
Value Distribution</a></span></dt>
-<dt><span class="section"> F Distribution</span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/gamma_dist.html"> Gamma
+<dt><span class="section">F Distribution</span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/gamma_dist.html">Gamma
(and Erlang) Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html">
- Inverse Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html">
- Inverse Gamma Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html">
- Hypergeometric Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/laplace_dist.html"> Laplace
- Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/logistic_dist.html">
- Logistic Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/lognormal_dist.html">
- Log Normal Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_beta_dist.html"> Noncentral
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/geometric_dist.html">Geometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html">Hypergeometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html">Inverse
+ Chi Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html">Inverse
+ Gamma Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/inverse_gaussian_dist.html">Inverse
+ Gaussian (or Inverse Normal) Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/laplace_dist.html">Laplace
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/logistic_dist.html">Logistic
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/lognormal_dist.html">Log
+ Normal Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_beta_dist.html">Noncentral
Beta Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_f_dist.html"> Noncentral
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_f_dist.html">Noncentral
F Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_t_dist.html"> Noncentral
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/nc_t_dist.html">Noncentral
T Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/normal_dist.html"> Normal
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/normal_dist.html">Normal
(Gaussian) Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/pareto.html"> Pareto
+<dt><span class="section">Pareto Distribution</span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/poisson_dist.html">Poisson
Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/poisson_dist.html"> Poisson
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/rayleigh.html">Rayleigh
Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/rayleigh.html"> Rayleigh
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/students_t_dist.html">Students
+ t Distribution</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/triangular_dist.html">Triangular
Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/students_t_dist.html">
- Students t Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/triangular_dist.html">
- Triangular Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/weibull.html"> Weibull
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/uniform_dist.html">Uniform
Distribution</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/uniform_dist.html"> Uniform
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dists/weibull_dist.html">Weibull
Distribution</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dist_algorithms.html"> Distribution
+<dt><span class="section"><a href="math_toolkit/dist/dist_ref/dist_algorithms.html">Distribution
Algorithms</a></span></dt>
</dl></dd>
-<dt><span class="section"> Extras/Future Directions</span></dt>
+<dt><span class="section">Extras/Future Directions</span></dt>
</dl></dd>
-<dt><span class="section"> Special Functions</span></dt>
+<dt><span class="section">Special Functions</span></dt>
<dd><dl>
-<dt><span class="section"> Gamma Functions</span></dt>
+<dt><span class="section">Gamma Functions</span></dt>
<dd><dl>
-<dt><span class="section"> Gamma</span></dt>
-<dt><span class="section"> Log Gamma</span></dt>
-<dt><span class="section"> Digamma</span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_gamma/gamma_ratios.html"> Ratios
+<dt><span class="section">Gamma</span></dt>
+<dt><span class="section">Log Gamma</span></dt>
+<dt><span class="section">Digamma</span></dt>
+<dt><span class="section"><a href="math_toolkit/special/sf_gamma/gamma_ratios.html">Ratios
of Gamma Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_gamma/igamma.html"> Incomplete Gamma
+<dt><span class="section"><a href="math_toolkit/special/sf_gamma/igamma.html">Incomplete Gamma
Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_gamma/igamma_inv.html"> Incomplete
+<dt><span class="section"><a href="math_toolkit/special/sf_gamma/igamma_inv.html">Incomplete
Gamma Function Inverses</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_gamma/gamma_derivatives.html"> Derivative
+<dt><span class="section"><a href="math_toolkit/special/sf_gamma/gamma_derivatives.html">Derivative
of the Incomplete Gamma Function</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/special/factorials.html"> Factorials and Binomial
+<dt><span class="section"><a href="math_toolkit/special/factorials.html">Factorials and Binomial
Coefficients</a></span></dt>
<dd><dl>
-<dt><span class="section"> Factorial</span></dt>
-<dt><span class="section"><a href="math_toolkit/special/factorials/sf_double_factorial.html">
- Double Factorial</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/factorials/sf_rising_factorial.html">
- Rising Factorial</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/factorials/sf_falling_factorial.html">
- Falling Factorial</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/factorials/sf_binomial.html"> Binomial
+<dt><span class="section">Factorial</span></dt>
+<dt><span class="section"><a href="math_toolkit/special/factorials/sf_double_factorial.html">Double
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/special/factorials/sf_rising_factorial.html">Rising
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/special/factorials/sf_falling_factorial.html">Falling
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/special/factorials/sf_binomial.html">Binomial
Coefficients</a></span></dt>
</dl></dd>
-<dt><span class="section"> Beta Functions</span></dt>
+<dt><span class="section">Beta Functions</span></dt>
<dd><dl>
-<dt><span class="section"> Beta</span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_beta/ibeta_function.html"> Incomplete
+<dt><span class="section">Beta</span></dt>
+<dt><span class="section"><a href="math_toolkit/special/sf_beta/ibeta_function.html">Incomplete
Beta Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_beta/ibeta_inv_function.html"> The
+<dt><span class="section"><a href="math_toolkit/special/sf_beta/ibeta_inv_function.html">The
Incomplete Beta Function Inverses</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_beta/beta_derivative.html"> Derivative
+<dt><span class="section"><a href="math_toolkit/special/sf_beta/beta_derivative.html">Derivative
of the Incomplete Beta Function</a></span></dt>
</dl></dd>
-<dt><span class="section"> Error Functions</span></dt>
+<dt><span class="section">Error Functions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/special/sf_erf/error_function.html"> Error
- Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_erf/error_inv.html"> Error Function
+<dt><span class="section">Error Functions</span></dt>
+<dt><span class="section"><a href="math_toolkit/special/sf_erf/error_inv.html">Error Function
Inverses</a></span></dt>
</dl></dd>
-<dt><span class="section"> Polynomials</span></dt>
+<dt><span class="section">Polynomials</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/special/sf_poly/legendre.html"> Legendre (and
+<dt><span class="section"><a href="math_toolkit/special/sf_poly/legendre.html">Legendre (and
Associated) Polynomials</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/sf_poly/laguerre.html"> Laguerre (and
+<dt><span class="section"><a href="math_toolkit/special/sf_poly/laguerre.html">Laguerre (and
Associated) Polynomials</a></span></dt>
-<dt><span class="section"> Hermite Polynomials</span></dt>
-<dt><span class="section"> Spherical Harmonics</span></dt>
+<dt><span class="section">Hermite Polynomials</span></dt>
+<dt><span class="section">Spherical Harmonics</span></dt>
</dl></dd>
-<dt><span class="section"> Bessel Functions</span></dt>
+<dt><span class="section">Bessel Functions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/special/bessel/bessel_over.html"> Bessel Function
+<dt><span class="section"><a href="math_toolkit/special/bessel/bessel_over.html">Bessel Function
Overview</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/bessel/bessel.html"> Bessel Functions
+<dt><span class="section"><a href="math_toolkit/special/bessel/bessel.html">Bessel Functions
of the First and Second Kinds</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/bessel/mbessel.html"> Modified Bessel
+<dt><span class="section"><a href="math_toolkit/special/bessel/mbessel.html">Modified Bessel
+ Functions of the First and Second Kinds</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/special/bessel/sph_bessel.html">Spherical Bessel
Functions of the First and Second Kinds</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/bessel/sph_bessel.html"> Spherical
- Bessel Functions of the First and Second Kinds</a></span></dt>
</dl></dd>
-<dt><span class="section"> Elliptic Integrals</span></dt>
+<dt><span class="section">Elliptic Integrals</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_intro.html"> Elliptic
+<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_intro.html">Elliptic
Integral Overview</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_carlson.html"> Elliptic
+<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_carlson.html">Elliptic
Integrals - Carlson Form</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_1.html"> Elliptic Integrals
+<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_1.html">Elliptic Integrals
of the First Kind - Legendre Form</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_2.html"> Elliptic Integrals
+<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_2.html">Elliptic Integrals
of the Second Kind - Legendre Form</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_3.html"> Elliptic Integrals
+<dt><span class="section"><a href="math_toolkit/special/ellint/ellint_3.html">Elliptic Integrals
of the Third Kind - Legendre Form</a></span></dt>
</dl></dd>
-<dt><span class="section"> Zeta Functions</span></dt>
-<dd><dl><dt><span class="section"> Riemann Zeta Function</span></dt></dl></dd>
-<dt><span class="section"> Exponential Integrals</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="math_toolkit/special/expint/expint_n.html"> Exponential
- Integral En</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/special/expint/expint_i.html"> Exponential
- Integral Ei</a></span></dt>
+<dt><span class="section">Zeta Functions</span></dt>
+<dd><dl><dt><span class="section">Riemann Zeta Function</span></dt></dl></dd>
+<dt><span class="section">Exponential Integrals</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="math_toolkit/special/expint/expint_n.html">Exponential Integral
+ En</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/special/expint/expint_i.html">Exponential Integral
+ Ei</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/special/powers.html"> Logs, Powers, Roots and
+<dt><span class="section"><a href="math_toolkit/special/powers.html">Logs, Powers, Roots and
Exponentials</a></span></dt>
<dd><dl>
-<dt><span class="section"> log1p</span></dt>
-<dt><span class="section"> expm1</span></dt>
-<dt><span class="section"> cbrt</span></dt>
-<dt><span class="section"> sqrt1pm1</span></dt>
-<dt><span class="section"> powm1</span></dt>
-<dt><span class="section"> hypot</span></dt>
-<dt><span class="section"><a href="math_toolkit/special/powers/ct_pow.html"> Compile Time Power
+<dt><span class="section">log1p</span></dt>
+<dt><span class="section">expm1</span></dt>
+<dt><span class="section">cbrt</span></dt>
+<dt><span class="section">sqrt1pm1</span></dt>
+<dt><span class="section">powm1</span></dt>
+<dt><span class="section">hypot</span></dt>
+<dt><span class="section"><a href="math_toolkit/special/powers/ct_pow.html">Compile Time Power
of a Runtime Base</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/special/sinc.html"> Sinus Cardinal and Hyperbolic
+<dt><span class="section"><a href="math_toolkit/special/sinc.html">Sinus Cardinal and Hyperbolic
Sinus Cardinal Functions</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/special/sinc/sinc_overview.html"> Sinus Cardinal
+<dt><span class="section"><a href="math_toolkit/special/sinc/sinc_overview.html">Sinus Cardinal
and Hyperbolic Sinus Cardinal Functions Overview</a></span></dt>
<dt><span class="section">sinc_pi</span></dt>
<dt><span class="section">sinhc_pi</span></dt>
</dl></dd>
-<dt><span class="section"> Inverse Hyperbolic Functions</span></dt>
+<dt><span class="section">Inverse Hyperbolic Functions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/special/inv_hyper/inv_hyper_over.html"> Inverse
+<dt><span class="section"><a href="math_toolkit/special/inv_hyper/inv_hyper_over.html">Inverse
Hyperbolic Functions Overview</a></span></dt>
-<dt><span class="section"> acosh</span></dt>
-<dt><span class="section"> asinh</span></dt>
-<dt><span class="section"> atanh</span></dt>
+<dt><span class="section">acosh</span></dt>
+<dt><span class="section">asinh</span></dt>
+<dt><span class="section">atanh</span></dt>
</dl></dd>
</dl></dd>
-<dt><span class="section"> Floating Point Utilities</span></dt>
+<dt><span class="section">Floating Point Utilities</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/utils/rounding.html"> Rounding Truncation and
+<dt><span class="section"><a href="math_toolkit/utils/rounding.html">Rounding Truncation and
Integer Conversion</a></span></dt>
<dd><dl>
-<dt><span class="section"> Rounding Functions</span></dt>
-<dt><span class="section"> Truncation Functions</span></dt>
-<dt><span class="section"><a href="math_toolkit/utils/rounding/modf.html"> Integer and Fractional
+<dt><span class="section">Rounding Functions</span></dt>
+<dt><span class="section">Truncation Functions</span></dt>
+<dt><span class="section"><a href="math_toolkit/utils/rounding/modf.html">Integer and Fractional
Part Splitting (modf)</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/utils/fpclass.html"> Floating-Point Classification:
+<dt><span class="section"><a href="math_toolkit/utils/fpclass.html">Floating-Point Classification:
Infinities and NaN's</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/utils/sign_functions.html"> Sign Manipulation
+<dt><span class="section"><a href="math_toolkit/utils/sign_functions.html">Sign Manipulation
Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/utils/next_float.html"> Floating-Point Representation
+<dt><span class="section"><a href="math_toolkit/utils/next_float.html">Floating-Point Representation
Distance (ULP), and Finding Adjacent Floating-Point Values</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/utils/next_float/nextafter.html"> Finding the
+<dt><span class="section"><a href="math_toolkit/utils/next_float/nextafter.html">Finding the
Next Representable Value in a Specific Direction (nextafter)</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/utils/next_float/float_next.html"> Finding
- the Next Greater Representable Value (float_next)</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/utils/next_float/float_prior.html"> Finding
+<dt><span class="section"><a href="math_toolkit/utils/next_float/float_next.html">Finding the
+ Next Greater Representable Value (float_next)</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/utils/next_float/float_prior.html">Finding
the Next Smaller Representable Value (float_prior)</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/utils/next_float/float_distance.html"> Calculating
+<dt><span class="section"><a href="math_toolkit/utils/next_float/float_distance.html">Calculating
the Representation Distance Between Two Floating Point Values (ULP) float_distance</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/utils/next_float/float_advance.html"> Advancing
+<dt><span class="section"><a href="math_toolkit/utils/next_float/float_advance.html">Advancing
a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a></span></dt>
</dl></dd>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/extern_c.html"> TR1 and C99 external "C"
+<dt><span class="section"><a href="math_toolkit/extern_c.html">TR1 and C99 external "C"
Functions</a></span></dt>
<dd><dl>
-<dt><span class="section"> C99 and TR1 C Functions Overview</span></dt>
-<dt><span class="section"> C99 C Functions</span></dt>
-<dt><span class="section"><a href="math_toolkit/extern_c/tr1_ref.html"> TR1 C Functions Quick
+<dt><span class="section">C99 and TR1 C Functions Overview</span></dt>
+<dt><span class="section">C99 C Functions</span></dt>
+<dt><span class="section"><a href="math_toolkit/extern_c/tr1_ref.html">TR1 C Functions Quick
Reference</a></span></dt>
</dl></dd>
-<dt><span class="section"> Internal Details and Tools (Experimental)</span></dt>
+<dt><span class="section">Tools, Constants and Internal Details</span></dt>
<dd><dl>
-<dt><span class="section"> Overview</span></dt>
-<dt><span class="section"> Reused Utilities</span></dt>
+<dt><span class="section">Overview</span></dt>
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1.html">Utilities - Constants
+ & Tools</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals1/constants.html"> Numeric
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1/constants.html">Numeric
Constants</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals1/series_evaluation.html">
- Series Evaluation</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals1/cf.html"> Continued Fraction
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1/series_evaluation.html">Series
Evaluation</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals1/rational.html"> Polynomial
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1/cf.html">Continued Fraction
+ Evaluation</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1/rational.html">Polynomial
and Rational Function Evaluation</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals1/roots.html"> Root Finding
- With Derivatives</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals1/roots2.html"> Root Finding
- Without Derivatives</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals1/minima.html"> Locating Function
- Minima</a></span></dt>
-<dt><span class="section"> Tuples</span></dt>
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1/roots.html">Root Finding
+ With Derivatives: Newton-Raphson, Halley & Schroeder</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1/roots2.html">Root Finding
+ Without Derivatives: Bisection, Bracket and TOMS748</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/toolkit/internals1/minima.html">Locating Function
+ Minima: Brent's algorithm</a></span></dt>
+<dt><span class="section">Tuples</span></dt>
</dl></dd>
-<dt><span class="section"> Testing and Development</span></dt>
+<dt><span class="section">Testing and Development</span></dt>
<dd><dl>
-<dt><span class="section"> Polynomials</span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals2/minimax.html"> Minimax Approximations
+<dt><span class="section">Polynomials</span></dt>
+<dt><span class="section"><a href="math_toolkit/toolkit/internals2/minimax.html">Minimax Approximations
and the Remez Algorithm</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals2/error_test.html"> Relative
+<dt><span class="section"><a href="math_toolkit/toolkit/internals2/error_test.html">Relative
Error and Testing</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/toolkit/internals2/test_data.html"> Graphing,
+<dt><span class="section"><a href="math_toolkit/toolkit/internals2/test_data.html">Graphing,
Profiling, and Generating Test Data for Special Functions</a></span></dt>
</dl></dd>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/using_udt.html"> Use with User-Defined Floating-Point
+<dt><span class="section"><a href="math_toolkit/using_udt.html">Use with User-Defined Floating-Point
Types</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/using_udt/use_ntl.html"> Using With NTL - a High-Precision
+<dt><span class="section"><a href="math_toolkit/using_udt/use_ntl.html">Using With NTL - a High-Precision
Floating-Point Library</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/using_udt/use_mpfr.html"> Using With MPFR / GMP
+<dt><span class="section"><a href="math_toolkit/using_udt/use_mpfr.html">Using With MPFR / GMP
- a High-Precision Floating-Point Library</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/using_udt/concepts.html"> Conceptual Requirements
+<dt><span class="section"><a href="math_toolkit/using_udt/concepts.html">Conceptual Requirements
for Real Number Types</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/using_udt/dist_concept.html"> Conceptual Requirements
+<dt><span class="section"><a href="math_toolkit/using_udt/dist_concept.html">Conceptual Requirements
for Distribution Types</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/using_udt/archetypes.html"> Conceptual Archetypes
- and Testing</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/archetypes.html">Conceptual Archetypes
+ for Reals and Distributions</a></span></dt>
</dl></dd>
-<dt><span class="section"> Policies</span></dt>
+<dt><span class="section">Policies</span></dt>
<dd><dl>
-<dt><span class="section"> Policy Overview</span></dt>
-<dt><span class="section"> Policy Tutorial</span></dt>
+<dt><span class="section">Policy Overview</span></dt>
+<dt><span class="section">Policy Tutorial</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/what_is_a_policy.html">
- So Just What is a Policy Anyway?</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/policy_tut_defaults.html">
- Policies Have Sensible Defaults</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/policy_usage.html"> So
- How are Policies Used Anyway?</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/changing_policy_defaults.html">
- Changing the Policy Defaults</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html">
- Setting Policies for Distributions on an Ad Hoc Basis</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/namespace_policies.html">
- Setting Policies at Namespace or Translation Unit Scope</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/user_def_err_pol.html">
- Calling User Defined Error Handlers</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/understand_dis_quant.html">
- Understanding Quantiles of Discrete Distributions</a></span></dt>
-</dl></dd>
-<dt><span class="section"> Policy Reference</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/error_handling_policies.html">
- Error Handling Policies</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/internal_promotion.html"> Internal
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/what_is_a_policy.html">So
+ Just What is a Policy Anyway?</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/policy_tut_defaults.html">Policies
+ Have Sensible Defaults</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/policy_usage.html">So How
+ are Policies Used Anyway?</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/changing_policy_defaults.html">Changing
+ the Policy Defaults</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html">Setting
+ Policies for Distributions on an Ad Hoc Basis</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/namespace_policies.html">Setting
+ Policies at Namespace or Translation Unit Scope</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/user_def_err_pol.html">Calling
+ User Defined Error Handlers</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_tutorial/understand_dis_quant.html">Understanding
+ Quantiles of Discrete Distributions</a></span></dt>
+</dl></dd>
+<dt><span class="section">Policy Reference</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/error_handling_policies.html">Error
+ Handling Policies</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/internal_promotion.html">Internal
Floating-point Promotion Policies</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/assert_undefined.html"> Mathematically
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/assert_undefined.html">Mathematically
Undefined Function Policies</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/discrete_quant_ref.html"> Discrete
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/discrete_quant_ref.html">Discrete
Quantile Policies</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/precision_pol.html"> Precision
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/precision_pol.html">Precision
Policies</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/iteration_pol.html"> Iteration
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/iteration_pol.html">Iteration
Limits Policies</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/policy_defaults.html"> Using
- macros to Change the Policy Defaults</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/namespace_pol.html"> Setting
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/policy_defaults.html">Using
+ Macros to Change the Policy Defaults</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/namespace_pol.html">Setting
Polices at Namespace Scope</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/policy/pol_ref/pol_ref_ref.html"> Policy Class
+<dt><span class="section"><a href="math_toolkit/policy/pol_ref/pol_ref_ref.html">Policy Class
Reference</a></span></dt>
</dl></dd>
</dl></dd>
-<dt><span class="section"> Performance</span></dt>
+<dt><span class="section">Performance</span></dt>
<dd><dl>
-<dt><span class="section"> Performance Overview</span></dt>
-<dt><span class="section"> Interpreting these Results</span></dt>
-<dt><span class="section"><a href="math_toolkit/perf/getting_best.html"> Getting the Best Performance
+<dt><span class="section">Performance Overview</span></dt>
+<dt><span class="section">Interpreting these Results</span></dt>
+<dt><span class="section"><a href="math_toolkit/perf/getting_best.html">Getting the Best Performance
from this Library</a></span></dt>
-<dt><span class="section"> Comparing Compilers</span></dt>
-<dt><span class="section"> Performance Tuning Macros</span></dt>
-<dt><span class="section"><a href="math_toolkit/perf/comparisons.html"> Comparisons to Other
- Open Source Libraries</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/perf/perf_test_app.html"> The Performance Test
+<dt><span class="section">Comparing Compilers</span></dt>
+<dt><span class="section">Performance Tuning Macros</span></dt>
+<dt><span class="section"><a href="math_toolkit/perf/comparisons.html">Comparisons to Other Open
+ Source Libraries</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/perf/perf_test_app.html">The Performance Test
Application</a></span></dt>
</dl></dd>
-<dt><span class="section"> Backgrounders</span></dt>
+<dt><span class="section">Backgrounders</span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/backgrounders/implementation.html"> Additional
+<dt><span class="section"><a href="math_toolkit/backgrounders/implementation.html">Additional
Implementation Notes</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/backgrounders/relative_error.html"> Relative
- Error</a></span></dt>
-<dt><span class="section"> The Lanczos Approximation</span></dt>
-<dt><span class="section"> The Remez Method</span></dt>
-<dt><span class="section"> References</span></dt>
-</dl></dd>
-<dt><span class="section"> Library Status</span></dt>
-<dd><dl>
-<dt><span class="section"> History and What's New</span></dt>
-<dt><span class="section"> Compilers</span></dt>
-<dt><span class="section"> Known Issues, and Todo List</span></dt>
-<dt><span class="section"> Credits and Acknowledgements</span></dt>
-</dl></dd>
+<dt><span class="section">Relative Error</span></dt>
+<dt><span class="section">The Lanczos Approximation</span></dt>
+<dt><span class="section">The Remez Method</span></dt>
+<dt><span class="section">References</span></dt>
+</dl></dd>
+<dt><span class="section">Library Status</span></dt>
+<dd><dl>
+<dt><span class="section">History and What's New</span></dt>
+<dt><span class="section">Known Issues, and TODO List</span></dt>
+<dt><span class="section">Credits and Acknowledgements</span></dt>
+</dl></dd>
+<dt><span class="section">Function Index</span></dt>
+<dt><span class="section">Class Index</span></dt>
+<dt><span class="section">Typedef Index</span></dt>
+<dt><span class="section">Macro Index</span></dt>
+<dt><span class="section">Index</span></dt>
</dl>
</div>
<p>
- </p>
-<p>
- This manual is also available in <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf" target="_top">printer
+ This manual is also available in <a href="http://sourceforge.net/projects/boost/files/boost-docs/" target="_top">printer
friendly PDF format</a>, and as a CD ISBN 0-9504833-2-X 978-0-9504833-2-0,
Classification 519.2-dc22.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: October 25, 2010 at 16:12:20 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 06, 2011 at 16:44:39 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,16 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.backgrounders"></a><a class="link" href="backgrounders.html" title="Backgrounders"> Backgrounders</a>
+<a name="math_toolkit.backgrounders"></a><a class="link" href="backgrounders.html" title="Backgrounders">Backgrounders</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="backgrounders/implementation.html"> Additional
+<dt><span class="section"><a href="backgrounders/implementation.html">Additional
Implementation Notes</a></span></dt>
-<dt><span class="section"><a href="backgrounders/relative_error.html"> Relative
- Error</a></span></dt>
-<dt><span class="section"> The Lanczos Approximation</span></dt>
-<dt><span class="section"> The Remez Method</span></dt>
-<dt><span class="section"> References</span></dt>
+<dt><span class="section">Relative Error</span></dt>
+<dt><span class="section">The Lanczos Approximation</span></dt>
+<dt><span class="section">The Remez Method</span></dt>
+<dt><span class="section">References</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.implementation"></a><a class="link" href="implementation.html" title="Additional Implementation Notes"> Additional
+<a name="math_toolkit.backgrounders.implementation"></a><a class="link" href="implementation.html" title="Additional Implementation Notes">Additional
Implementation Notes</a>
</h3></div></div></div>
<p>
@@ -33,7 +33,7 @@
and reflect more the general implementation philosophy used.
</p>
<a name="math_toolkit.backgrounders.implementation.implemention_philosophy"></a><h5>
-<a name="id1282739"></a>
+<a name="id1418031"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.implemention_philosophy">Implemention
philosophy</a>
</h5>
@@ -85,7 +85,7 @@
These could still provide sufficient accuracy for some speed-critical applications.
</p>
<a name="math_toolkit.backgrounders.implementation.accuracy_and_representation_of_test_values"></a><h5>
-<a name="id1282803"></a>
+<a name="id1418095"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.accuracy_and_representation_of_test_values">Accuracy
and Representation of Test Values</a>
</h5>
@@ -130,7 +130,7 @@
binary value).
</p>
<a name="math_toolkit.backgrounders.implementation.tolerance_of_tests"></a><h5>
-<a name="id1282947"></a>
+<a name="id1418239"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.tolerance_of_tests">Tolerance
of Tests</a>
</h5>
@@ -156,7 +156,7 @@
first that the suffix L is present, and then that the tolerance is big enough.
</p>
<a name="math_toolkit.backgrounders.implementation.handling_unsuitable_arguments"></a><h5>
-<a name="id1282991"></a>
+<a name="id1418283"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.handling_unsuitable_arguments">Handling
Unsuitable Arguments</a>
</h5>
@@ -224,7 +224,7 @@
</p></td></tr>
</table></div>
<a name="math_toolkit.backgrounders.implementation.handling_of_functions_that_are_not_mathematically_defined"></a><h5>
-<a name="id1283121"></a>
+<a name="id1418415"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.handling_of_functions_that_are_not_mathematically_defined">Handling
of Functions that are Not Mathematically defined</a>
</h5>
@@ -258,7 +258,7 @@
</p></td></tr>
</table></div>
<a name="math_toolkit.backgrounders.implementation.median_of_distributions"></a><h5>
-<a name="id1285308"></a>
+<a name="id1418500"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.median_of_distributions">Median
of distributions</a>
</h5>
@@ -293,7 +293,7 @@
Basic Statistics.</a> give more detail, in particular for discrete distributions.
</p>
<a name="math_toolkit.backgrounders.implementation.handling_of_floating_point_infinity"></a><h5>
-<a name="id1285426"></a>
+<a name="id1418623"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.handling_of_floating_point_infinity">Handling
of Floating-Point Infinity</a>
</h5>
@@ -337,7 +337,7 @@
handling policies</a>.
</p>
<a name="math_toolkit.backgrounders.implementation.scale__shape_and_location"></a><h5>
-<a name="id1285513"></a>
+<a name="id1418711"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.scale__shape_and_location">Scale,
Shape and Location</a>
</h5>
@@ -364,7 +364,7 @@
functions, they can be added if required.
</p>
<a name="math_toolkit.backgrounders.implementation.notes_on_implementation_of_specific_functions__amp__distributions"></a><h5>
-<a name="id1285848"></a>
+<a name="id1419046"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.notes_on_implementation_of_specific_functions__amp__distributions">Notes
on Implementation of Specific Functions & Distributions</a>
</h5>
@@ -376,7 +376,7 @@
lower = -1, mode = 0 and upper = 1 would be more suitable.
</li></ul></div>
<a name="math_toolkit.backgrounders.implementation.rational_approximations_used"></a><h5>
-<a name="id1285872"></a>
+<a name="id1419070"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.rational_approximations_used">Rational
Approximations Used</a>
</h5>
@@ -419,7 +419,7 @@
to the "true" minimax solution.
</p>
<a name="math_toolkit.backgrounders.implementation.representation_of_mathematical_constants"></a><h5>
-<a name="id1285916"></a>
+<a name="id1419115"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.representation_of_mathematical_constants">Representation
of Mathematical Constants</a>
</h5>
@@ -480,7 +480,7 @@
</span><span class="keyword">double</span> <span class="identifier">p</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">constants</span><span class="special">::</span><span class="identifier">pi</span><span class="special">();</span> <span class="comment">// Context does not allow for disambiguation of overloaded function
</span></pre>
<a name="math_toolkit.backgrounders.implementation.thread_safety"></a><h5>
-<a name="id1286302"></a>
+<a name="id1419502"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.thread_safety">Thread
safety</a>
</h5>
@@ -505,7 +505,7 @@
the right thing here at some point.
</p>
<a name="math_toolkit.backgrounders.implementation.sources_of_test_data"></a><h5>
-<a name="id1286338"></a>
+<a name="id1419538"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.sources_of_test_data">Sources
of Test Data</a>
</h5>
@@ -546,7 +546,7 @@
the underlying special function is known to be difficult to implement.
</p>
<a name="math_toolkit.backgrounders.implementation.creating_and_managing_the_equations"></a><h5>
-<a name="id1286407"></a>
+<a name="id1421103"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.creating_and_managing_the_equations">Creating
and Managing the Equations</a>
</h5>
@@ -648,8 +648,8 @@
<pre class="programlisting"><span class="special"><!--</span> <span class="identifier">Sample</span> <span class="identifier">configuration</span> <span class="keyword">for</span> <span class="identifier">Windows</span> <span class="identifier">TrueType</span> <span class="identifier">fonts</span><span class="special">.</span> <span class="special">--></span>
</pre>
<p>
- <!-- Sample configuration for Windows TrueType fonts. --> is provided
- in the xep.xml downloaded, but the Windows TrueType fonts are commented out.
+ is provided in the xep.xml downloaded, but the Windows TrueType fonts are
+ commented out.
</p>
<p>
JM's XEP config file \xep\xep.xml has the following font configuration section
@@ -731,7 +731,7 @@
HTML: this needs further investigation.
</p>
<a name="math_toolkit.backgrounders.implementation.producing_graphs"></a><h5>
-<a name="id1286664"></a>
+<a name="id1421359"></a>
<a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.producing_graphs">Producing
Graphs</a>
</h5>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.lanczos"></a><a class="link" href="lanczos.html" title="The Lanczos Approximation"> The Lanczos Approximation</a>
+<a name="math_toolkit.backgrounders.lanczos"></a><a class="link" href="lanczos.html" title="The Lanczos Approximation">The Lanczos Approximation</a>
</h3></div></div></div>
<a name="math_toolkit.backgrounders.lanczos.motivation"></a><h5>
-<a name="id1286996"></a>
+<a name="id1421689"></a>
<a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.motivation">Motivation</a>
</h5>
<p>
@@ -99,7 +99,7 @@
functions divided by large powers into single (simpler) expressions.
</p>
<a name="math_toolkit.backgrounders.lanczos.the_approximation"></a><h5>
-<a name="id1287254"></a>
+<a name="id1421945"></a>
<a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.the_approximation">The
Approximation</a>
</h5>
@@ -161,7 +161,7 @@
</p></td></tr>
</table></div>
<a name="math_toolkit.backgrounders.lanczos.computing_the_coefficients"></a><h5>
-<a name="id1288408"></a>
+<a name="id1422137"></a>
<a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.computing_the_coefficients">Computing
the Coefficients</a>
</h5>
@@ -205,7 +205,7 @@
multiplied by <span class="emphasis"><em>F</em></span> as the last step.
</p>
<a name="math_toolkit.backgrounders.lanczos.choosing_the_right_parameters"></a><h5>
-<a name="id1288565"></a>
+<a name="id1422294"></a>
<a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.choosing_the_right_parameters">Choosing
the Right Parameters</a>
</h5>
@@ -229,7 +229,7 @@
computing to float precision with double precision arithmetic.
</p>
<div class="table">
-<a name="math_toolkit.backgrounders.lanczos.optimal_choices_for_n_and_g_when_computing_with_guard_digits__source__pugh_"></a><p class="title"><b>Table 53. Optimal choices for N and g when computing with guard digits (source:
+<a name="math_toolkit.backgrounders.lanczos.optimal_choices_for_n_and_g_when_computing_with_guard_digits__source__pugh_"></a><p class="title"><b>Table 56. Optimal choices for N and g when computing with guard digits (source:
Pugh)</b></p>
<div class="table-contents"><table class="table" summary="Optimal choices for N and g when computing with guard digits (source:
Pugh)">
@@ -372,7 +372,7 @@
exactly matches the machine epsilon for the type in question.
</p>
<div class="table">
-<a name="math_toolkit.backgrounders.lanczos.optimum_value_for_n_and_g_when_computing_at_fixed_precision"></a><p class="title"><b>Table 54. Optimum value for N and g when computing at fixed precision</b></p>
+<a name="math_toolkit.backgrounders.lanczos.optimum_value_for_n_and_g_when_computing_at_fixed_precision"></a><p class="title"><b>Table 57. Optimum value for N and g when computing at fixed precision</b></p>
<div class="table-contents"><table class="table" summary="Optimum value for N and g when computing at fixed precision">
<colgroup>
<col>
@@ -535,16 +535,16 @@
is exact, and so isn't used for the gamma function.
</p>
<a name="math_toolkit.backgrounders.lanczos.references"></a><h5>
-<a name="id1289104"></a>
+<a name="id1422831"></a>
<a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.references">References</a>
</h5>
-<a name="godfrey"></a><a name="pugh"></a><div class="orderedlist"><ol type="1">
+<div class="orderedlist"><ol type="1">
<li>
- Paul Godfrey, <a href="http://my.fit.edu/~gabdo/gamma.txt" target="_top">"A
+ <a name="godfrey"></a> Paul Godfrey, <a href="http://my.fit.edu/~gabdo/gamma.txt" target="_top">"A
note on the computation of the convergent Lanczos complex Gamma approximation"</a>.
</li>
<li>
- Glendon Ralph Pugh, <a href="http://bh0.physics.ubc.ca/People/matt/Doc/ThesesOthers/Phd/pugh.pdf" target="_top">"An
+ <a name="pugh"></a> Glendon Ralph Pugh, <a href="http://bh0.physics.ubc.ca/People/matt/Doc/ThesesOthers/Phd/pugh.pdf" target="_top">"An
Analysis of the Lanczos Gamma Approximation"</a>, PhD Thesis
November 2004.
</li>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html
Deleted: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html
Modified: branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk
Added: branches/release/libs/math/doc/sf_and_dist/index.idx
Modified: branches/release/libs/math/doc/sf_and_dist/internals_overview.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/inv_hyper.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/issues.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/legendre.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/math.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/minima.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/poisson_optimisation.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/policy.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/references.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/remez.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/roadmap.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/roots.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/roots_without_derivatives.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/structure.qbk
Modified: branches/release/libs/math/doc/sf_and_dist/tuple.qbk
Modified: branches/release/libs/math/dot_net_example/Setupdistex/Setupdistex.vdproj
Modified: branches/release/libs/math/dot_net_example/boost_math/AssemblyInfo.cpp
Modified: branches/release/libs/math/dot_net_example/boost_math/Stdafx.h
Modified: branches/release/libs/math/dot_net_example/boost_math/boost_math.cpp
Modified: branches/release/libs/math/dot_net_example/boost_math/boost_math.sln
Modified: branches/release/libs/math/dot_net_example/boost_math/boost_math.vcproj
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/DistexForm.cs
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/Properties/AssemblyInfo.cs
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Resources.Designer.cs
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Settings.Designer.cs
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.cs
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.resx
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/distribution.txt
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj.user
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.sln
Modified: branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.suo
Modified: branches/release/libs/math/example/Jamfile.v2
Modified: branches/release/libs/math/example/c_error_policy_example.cpp
Modified: branches/release/libs/math/example/error_handling_example.cpp
Modified: branches/release/libs/math/example/neg_binom_confidence_limits.cpp
Modified: branches/release/libs/math/example/neg_binomial_sample_sizes.cpp
Modified: branches/release/libs/math/example/normal_misc_examples.cpp
Modified: branches/release/libs/math/example/policy_eg_1.cpp
Modified: branches/release/libs/math/example/policy_eg_8.cpp
Modified: branches/release/libs/math/example/policy_ref_snip10.cpp
Modified: branches/release/libs/math/example/policy_ref_snip11.cpp
Modified: branches/release/libs/math/example/policy_ref_snip13.cpp
Modified: branches/release/libs/math/example/policy_ref_snip8.cpp
Modified: branches/release/libs/math/test/Jamfile.v2
Modified: branches/release/libs/math/test/compile_test/dist_nc_beta_incl_test.cpp
Modified: branches/release/libs/math/test/compile_test/instantiate.hpp
Modified: branches/release/libs/math/test/log1p_expm1_test.cpp
Modified: branches/release/libs/math/test/test_bessel_j.cpp
Modified: branches/release/libs/math/test/test_beta_dist.cpp
Modified: branches/release/libs/math/test/test_cbrt.cpp
Modified: branches/release/libs/math/test/test_classify.cpp
Modified: branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp
Modified: branches/release/libs/math/test/test_inverse_gamma_distribution.cpp
Modified: branches/release/libs/math/test/test_laplace.cpp
Modified: branches/release/libs/math/test/test_lognormal.cpp
Modified: branches/release/libs/math/test/test_nc_beta.cpp
Modified: branches/release/libs/math/test/test_normal.cpp
Modified: branches/release/libs/math/test/test_sign.cpp
Modified: branches/release/libs/math/test/test_weibull.cpp
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.refs"></a><a class="link" href="refs.html" title="References"> References</a>
+<a name="math_toolkit.backgrounders.refs"></a><a class="link" href="refs.html" title="References">References</a>
</h3></div></div></div>
<a name="math_toolkit.backgrounders.refs.general_references"></a><h5>
-<a name="id1290028"></a>
+<a name="id1424367"></a>
<a class="link" href="refs.html#math_toolkit.backgrounders.refs.general_references">General
references</a>
</h5>
@@ -48,12 +48,6 @@
D.C..
</p>
<p>
- The Wolfram Functions Site
- The Wolfram Functions Site - Providing the mathematical and scientific community
- with the world's largest (and most authorititive) collection of formulas
- and graphics about mathematical functions.
- </p>
-<p>
<a href="http://www.itl.nist.gov/div898/handbook/index.htm" target="_top">NIST/SEMATECH
e-Handbook of Statistical Methods</a>
</p>
@@ -90,18 +84,30 @@
03-0097, A Proposal to Add Mathematical Special Functions to the C++ Standard
Library (version 2), Walter E. Brown</a>
</p>
-<a name="math_toolkit.backgrounders.refs.calculators__that_we_found__and_used_to_cross_check___as_far_as_their_widely_varying_accuracy_allowed__"></a><h5>
-<a name="id1290124"></a>
- <a class="link" href="refs.html#math_toolkit.backgrounders.refs.calculators__that_we_found__and_used_to_cross_check___as_far_as_their_widely_varying_accuracy_allowed__">Calculators*
- that we found (and used to cross-check - as far as their widely-varying accuracy
- allowed).</a>
+<a name="math_toolkit.backgrounders.refs.calculators"></a><h5>
+<a name="id1424450"></a>
+ <a class="link" href="refs.html#math_toolkit.backgrounders.refs.calculators">Calculators</a>
</h5>
<p>
+ We found (and used to create cross-check spot values - as far as their accuracy
+ allowed).
+ </p>
+<p>
+ The Wolfram Functions Site
+ The Wolfram Functions Site - Providing the mathematical and scientific community
+ with the world's largest (and most authorititive) collection of formulas
+ and graphics about mathematical functions.
+ </p>
+<p>
+ 100-decimal digit calculator
+ provided some spot values.
+ </p>
+<p>
<a href="http://www.adsciengineering.com/bpdcalc/" target="_top">http://www.adsciengineering.com
Binomial Probability Distribution Calculator.
</p>
<a name="math_toolkit.backgrounders.refs.other_libraries"></a><h5>
-<a name="id1290149"></a>
+<a name="id1424494"></a>
<a class="link" href="refs.html#math_toolkit.backgrounders.refs.other_libraries">Other Libraries</a>
</h5>
<p>
@@ -113,18 +119,14 @@
Horwood (1989) ISBN 0745802893 0470216093 provided inspiration.
</p>
<p>
- 100-decimal digit calculator
- provided some spot values.
- </p>
-<p>
- <a href="http://www.csit.fsu.edu/~burkardt/cpp_src/dcdflib/dcdflib.html" target="_top">C++
- version</a>.
- </p>
-<p>
<a href="http://lib.stat.cmu.edu/general/cdflib" target="_top">CDFLIB Library of Fortran
Routines for Cumulative Distribution functions.</a>
</p>
<p>
+ <a href="http://www.csit.fsu.edu/~burkardt/cpp_src/dcdflib/dcdflib.html" target="_top">DCFLIB
+ C++ version</a>.
+ </p>
+<p>
<a href="http://www.csit.fsu.edu/~burkardt/f_src/dcdflib/dcdflib.html" target="_top">DCDFLIB
C++ version</a> DCDFLIB is a library of C++ routines, using double precision
arithmetic, for evaluating cumulative probability density functions.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.relative_error"></a><a class="link" href="relative_error.html" title="Relative Error"> Relative
- Error</a>
+<a name="math_toolkit.backgrounders.relative_error"></a><a class="link" href="relative_error.html" title="Relative Error">Relative Error</a>
</h3></div></div></div>
<p>
Given an actual value <span class="emphasis"><em>a</em></span> and a found value <span class="emphasis"><em>v</em></span>
@@ -78,10 +77,8 @@
errors differ by a factor of 2, can actually be accurate to the same number
of binary digits. You have been warned!
</p>
-<a name="zero_error"></a><p>
- </p>
-<a name="math_toolkit.backgrounders.relative_error.the_impossibility_of_zero_error"></a><h5>
-<a name="id1286953"></a>
+<a name="zero_error"></a><a name="math_toolkit.backgrounders.relative_error.the_impossibility_of_zero_error"></a><h5>
+<a name="id1421646"></a>
<a class="link" href="relative_error.html#math_toolkit.backgrounders.relative_error.the_impossibility_of_zero_error">The
Impossibility of Zero Error</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.remez"></a><a class="link" href="remez.html" title="The Remez Method"> The Remez Method</a>
+<a name="math_toolkit.backgrounders.remez"></a><a class="link" href="remez.html" title="The Remez Method">The Remez Method</a>
</h3></div></div></div>
<p>
The Remez algorithm
@@ -94,7 +94,7 @@
are located!</em></span>
</p>
<a name="math_toolkit.backgrounders.remez.the_remez_method"></a><h5>
-<a name="id1289289"></a>
+<a name="id1423015"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.the_remez_method">The Remez
Method</a>
</h5>
@@ -105,7 +105,7 @@
</p>
<p>
In the following discussion we'll use a concrete example to illustrate the
- Remez method: an approximation to the function e<sup>x</sup> ​ over the range [-1, 1].
+ Remez method: an approximation to the function e<sup>x</sup>   over the range [-1, 1].
</p>
<p>
Before we can begin the Remez method, we must obtain an initial value for
@@ -174,7 +174,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.backgrounders.remez.remez_step_1"></a><h5>
-<a name="id1289440"></a>
+<a name="id1423166"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.remez_step_1">Remez Step
1</a>
</h5>
@@ -205,7 +205,7 @@
to 5.6x10<sup>-4</sup>.
</p>
<a name="math_toolkit.backgrounders.remez.remez_step_2"></a><h5>
-<a name="id1289514"></a>
+<a name="id1423854"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.remez_step_2">Remez Step
2</a>
</h5>
@@ -234,7 +234,7 @@
In our example we perform multi-point exchange.
</p>
<a name="math_toolkit.backgrounders.remez.iteration"></a><h5>
-<a name="id1289547"></a>
+<a name="id1423886"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.iteration">Iteration</a>
</h5>
<p>
@@ -250,7 +250,7 @@
<span class="inlinemediaobject"><img src="../../../graphs/remez-4.png" alt="remez-4"></span>
</p>
<a name="math_toolkit.backgrounders.remez.rational_approximations"></a><h5>
-<a name="id1289591"></a>
+<a name="id1423930"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.rational_approximations">Rational
Approximations</a>
</h5>
@@ -264,8 +264,8 @@
<p>
where P(x) and Q(x) are polynomials, then we proceed as before, except that
now we have N+M+2 unknowns if P(x) is of order N and Q(x) is of order M.
- This assumes that Q(x) is normalised so that it's leading coefficient is
- 1, giving N+M+1 polynomial coefficients in total, plus the error term E.
+ This assumes that Q(x) is normalised so that its leading coefficient is 1,
+ giving N+M+1 polynomial coefficients in total, plus the error term E.
</p>
<p>
The simultaneous equations to be solved are now:
@@ -299,7 +299,7 @@
number of terms overall.
</p>
<a name="math_toolkit.backgrounders.remez.practical_considerations"></a><h5>
-<a name="id1289670"></a>
+<a name="id1424010"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.practical_considerations">Practical
Considerations</a>
</h5>
@@ -388,7 +388,7 @@
a positive power less than one will skew them towards either end. More usefully,
if we initially rescale the points over [0,1] and then raise to a positive
power, we can skew them to the left or right. Returning to our example of
- e<sup>x</sup> ​ over [-1,1], the initial interpolated form was some way from the minimax
+ e<sup>x</sup>   over [-1,1], the initial interpolated form was some way from the minimax
solution:
</p>
<p>
@@ -397,7 +397,7 @@
<p>
However, if we first skew the interpolation points to the left (rescale them
to [0, 1], raise to the power 1.3, and then rescale back to [-1,1]) we reduce
- the error from 1.3x10<sup>-3</sup> ​to 6x10<sup>-4</sup>:
+ the error from 1.3x10<sup>-3</sup>  to 6x10<sup>-4</sup>:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../graphs/remez-5.png" alt="remez-5"></span>
@@ -407,7 +407,7 @@
desired minimax solution (5x10<sup>-4</sup>).
</p>
<a name="math_toolkit.backgrounders.remez.remez_method_checklist"></a><h5>
-<a name="id1289826"></a>
+<a name="id1424165"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.remez_method_checklist">Remez
Method Checklist</a>
</h5>
@@ -461,7 +461,7 @@
</li>
</ul></div>
<a name="math_toolkit.backgrounders.remez.references"></a><h5>
-<a name="id1289908"></a>
+<a name="id1424248"></a>
<a class="link" href="remez.html#math_toolkit.backgrounders.remez.references">References</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,180 +24,183 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.dist"></a><a class="link" href="dist.html" title="Statistical Distributions and Functions"> Statistical Distributions and Functions</a>
+<a name="math_toolkit.dist"></a><a class="link" href="dist.html" title="Statistical Distributions and Functions">Statistical Distributions and Functions</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="dist/stat_tut.html"> Statistical Distributions
+<dt><span class="section"><a href="dist/stat_tut.html">Statistical Distributions
Tutorial</a></span></dt>
<dd><dl>
-<dt><span class="section"> Overview of Distributions</span></dt>
+<dt><span class="section">Overview of Distributions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="dist/stat_tut/overview/headers.html"> Headers
+<dt><span class="section"><a href="dist/stat_tut/overview/headers.html">Headers
and Namespaces</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/overview/objects.html"> Distributions
+<dt><span class="section"><a href="dist/stat_tut/overview/objects.html">Distributions
are Objects</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/overview/generic.html"> Generic
+<dt><span class="section"><a href="dist/stat_tut/overview/generic.html">Generic
operations common to all distributions are non-member functions</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/overview/complements.html">
- Complements are supported too - and when to use them</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/overview/parameters.html">
- Parameters can be calculated</a></span></dt>
-<dt><span class="section"> Summary</span></dt>
-</dl></dd>
-<dt><span class="section"> Worked Examples</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="dist/stat_tut/weg/dist_construct_eg.html">
- Distribution Construction Example</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/st_eg.html"> Student's
- t Distribution Examples</a></span></dt>
-<dd><dl>
-<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/overview/complements.html">Complements
+ are supported too - and when to use them</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/overview/parameters.html">Parameters
+ can be calculated</a></span></dt>
+<dt><span class="section">Summary</span></dt>
+</dl></dd>
+<dt><span class="section">Worked Examples</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="dist/stat_tut/weg/dist_construct_eg.html">Distribution
+ Construction Example</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/st_eg.html">Student's t
+ Distribution Examples</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg.html"> Chi Squared
+<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg.html">Chi Squared
Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/weg/f_eg.html"> F Distribution
+<dt><span class="section"><a href="dist/stat_tut/weg/f_eg.html">F Distribution
Examples</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg.html"> Binomial
+<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg.html">Binomial
Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg.html"> Negative
+<dt><span class="section"><a href="dist/stat_tut/weg/geometric_eg.html">Geometric
+ Distribution Examples</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg.html">Negative
Binomial Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/weg/normal_example.html"> Normal
+<dt><span class="section"><a href="dist/stat_tut/weg/normal_example.html">Normal
Distribution Examples</a></span></dt>
-<dd><dl><dt><span class="section"><a href="dist/stat_tut/weg/normal_example/normal_misc.html">
- Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/weg/nccs_eg.html"> Non Central
+<dd><dl><dt><span class="section"><a href="dist/stat_tut/weg/normal_example/normal_misc.html">Some
+ Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></dd>
+<dt><span class="section"><a href="dist/stat_tut/weg/nccs_eg.html">Non Central
Chi Squared Example</a></span></dt>
-<dd><dl><dt><span class="section"><a href="dist/stat_tut/weg/nccs_eg/nccs_power_eg.html">
- Tables of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/weg/error_eg.html"> Error Handling
+<dd><dl><dt><span class="section"><a href="dist/stat_tut/weg/nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></dd>
+<dt><span class="section"><a href="dist/stat_tut/weg/error_eg.html">Error Handling
Example</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/find_eg.html"> Find Location
+<dt><span class="section"><a href="dist/stat_tut/weg/find_eg.html">Find Location
and Scale Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="dist/stat_tut/weg/find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></span></dt>
+<dt><span class="section"><a href="dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/weg/nag_library.html"> Comparison
+<dt><span class="section"><a href="dist/stat_tut/weg/nag_library.html">Comparison
with C, R, FORTRAN-style Free Functions</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/weg/c_sharp.html"> Using the
+<dt><span class="section"><a href="dist/stat_tut/weg/c_sharp.html">Using the
Distributions from Within C#</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/stat_tut/variates.html"> Random Variates
+<dt><span class="section"><a href="dist/stat_tut/variates.html">Random Variates
and Distribution Parameters</a></span></dt>
-<dt><span class="section"><a href="dist/stat_tut/dist_params.html"> Discrete Probability
+<dt><span class="section"><a href="dist/stat_tut/dist_params.html">Discrete Probability
Distributions</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/dist_ref.html"> Statistical Distributions
+<dt><span class="section"><a href="dist/dist_ref.html">Statistical Distributions
Reference</a></span></dt>
<dd><dl>
-<dt><span class="section"> Non-Member Properties</span></dt>
-<dt><span class="section"> Distributions</span></dt>
+<dt><span class="section">Non-Member Properties</span></dt>
+<dt><span class="section">Distributions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="dist/dist_ref/dists/bernoulli_dist.html">
- Bernoulli Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/beta_dist.html"> Beta
+<dt><span class="section"><a href="dist/dist_ref/dists/bernoulli_dist.html">Bernoulli
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/binomial_dist.html">
- Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><span class="section"><a href="dist/dist_ref/dists/beta_dist.html">Beta
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/chi_squared_dist.html">
- Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/exp_dist.html"> Exponential
+<dt><span class="section"><a href="dist/dist_ref/dists/binomial_dist.html">Binomial
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/extreme_dist.html"> Extreme
+<dt><span class="section"><a href="dist/dist_ref/dists/cauchy_dist.html">Cauchy-Lorentz
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/exp_dist.html">Exponential
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/extreme_dist.html">Extreme
Value Distribution</a></span></dt>
-<dt><span class="section"> F Distribution</span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/gamma_dist.html"> Gamma
+<dt><span class="section">F Distribution</span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/gamma_dist.html">Gamma
(and Erlang) Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/inverse_chi_squared_dist.html">
- Inverse Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/inverse_gamma_dist.html">
- Inverse Gamma Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/hypergeometric_dist.html">
- Hypergeometric Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/laplace_dist.html"> Laplace
- Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/logistic_dist.html">
- Logistic Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/lognormal_dist.html">
- Log Normal Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/nc_beta_dist.html"> Noncentral
+<dt><span class="section"><a href="dist/dist_ref/dists/geometric_dist.html">Geometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/hypergeometric_dist.html">Hypergeometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/inverse_chi_squared_dist.html">Inverse
+ Chi Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/inverse_gamma_dist.html">Inverse
+ Gamma Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/inverse_gaussian_dist.html">Inverse
+ Gaussian (or Inverse Normal) Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/laplace_dist.html">Laplace
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/logistic_dist.html">Logistic
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/lognormal_dist.html">Log
+ Normal Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/nc_beta_dist.html">Noncentral
Beta Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/nc_f_dist.html"> Noncentral
+<dt><span class="section"><a href="dist/dist_ref/dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/nc_f_dist.html">Noncentral
F Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/nc_t_dist.html"> Noncentral
+<dt><span class="section"><a href="dist/dist_ref/dists/nc_t_dist.html">Noncentral
T Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/normal_dist.html"> Normal
+<dt><span class="section"><a href="dist/dist_ref/dists/normal_dist.html">Normal
(Gaussian) Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/pareto.html"> Pareto
+<dt><span class="section">Pareto Distribution</span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/poisson_dist.html">Poisson
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/poisson_dist.html"> Poisson
+<dt><span class="section"><a href="dist/dist_ref/dists/rayleigh.html">Rayleigh
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/rayleigh.html"> Rayleigh
+<dt><span class="section"><a href="dist/dist_ref/dists/students_t_dist.html">Students
+ t Distribution</a></span></dt>
+<dt><span class="section"><a href="dist/dist_ref/dists/triangular_dist.html">Triangular
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/students_t_dist.html">
- Students t Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/triangular_dist.html">
- Triangular Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/weibull.html"> Weibull
+<dt><span class="section"><a href="dist/dist_ref/dists/uniform_dist.html">Uniform
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist/dist_ref/dists/uniform_dist.html"> Uniform
+<dt><span class="section"><a href="dist/dist_ref/dists/weibull_dist.html">Weibull
Distribution</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist/dist_ref/dist_algorithms.html"> Distribution
+<dt><span class="section"><a href="dist/dist_ref/dist_algorithms.html">Distribution
Algorithms</a></span></dt>
</dl></dd>
-<dt><span class="section"> Extras/Future Directions</span></dt>
+<dt><span class="section">Extras/Future Directions</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,70 +24,73 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.dist.dist_ref"></a><a class="link" href="dist_ref.html" title="Statistical Distributions Reference"> Statistical Distributions
+<a name="math_toolkit.dist.dist_ref"></a><a class="link" href="dist_ref.html" title="Statistical Distributions Reference">Statistical Distributions
Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Non-Member Properties</span></dt>
-<dt><span class="section"> Distributions</span></dt>
+<dt><span class="section">Non-Member Properties</span></dt>
+<dt><span class="section">Distributions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="dist_ref/dists/bernoulli_dist.html">
- Bernoulli Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/beta_dist.html"> Beta
+<dt><span class="section"><a href="dist_ref/dists/bernoulli_dist.html">Bernoulli
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/binomial_dist.html">
- Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><span class="section"><a href="dist_ref/dists/beta_dist.html">Beta
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/chi_squared_dist.html">
- Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/exp_dist.html"> Exponential
+<dt><span class="section"><a href="dist_ref/dists/binomial_dist.html">Binomial
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/cauchy_dist.html">Cauchy-Lorentz
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/exp_dist.html">Exponential
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/extreme_dist.html"> Extreme
+<dt><span class="section"><a href="dist_ref/dists/extreme_dist.html">Extreme
Value Distribution</a></span></dt>
-<dt><span class="section"> F Distribution</span></dt>
-<dt><span class="section"><a href="dist_ref/dists/gamma_dist.html"> Gamma
+<dt><span class="section">F Distribution</span></dt>
+<dt><span class="section"><a href="dist_ref/dists/gamma_dist.html">Gamma
(and Erlang) Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/inverse_chi_squared_dist.html">
- Inverse Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/inverse_gamma_dist.html">
- Inverse Gamma Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/hypergeometric_dist.html">
- Hypergeometric Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/laplace_dist.html"> Laplace
- Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/logistic_dist.html">
- Logistic Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/lognormal_dist.html">
- Log Normal Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/nc_beta_dist.html"> Noncentral
+<dt><span class="section"><a href="dist_ref/dists/geometric_dist.html">Geometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/hypergeometric_dist.html">Hypergeometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/inverse_chi_squared_dist.html">Inverse
+ Chi Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/inverse_gamma_dist.html">Inverse
+ Gamma Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/inverse_gaussian_dist.html">Inverse
+ Gaussian (or Inverse Normal) Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/laplace_dist.html">Laplace
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/logistic_dist.html">Logistic
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/lognormal_dist.html">Log
+ Normal Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/nc_beta_dist.html">Noncentral
Beta Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/nc_f_dist.html"> Noncentral
+<dt><span class="section"><a href="dist_ref/dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/nc_f_dist.html">Noncentral
F Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/nc_t_dist.html"> Noncentral
+<dt><span class="section"><a href="dist_ref/dists/nc_t_dist.html">Noncentral
T Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/normal_dist.html"> Normal
+<dt><span class="section"><a href="dist_ref/dists/normal_dist.html">Normal
(Gaussian) Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/pareto.html"> Pareto
+<dt><span class="section">Pareto Distribution</span></dt>
+<dt><span class="section"><a href="dist_ref/dists/poisson_dist.html">Poisson
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/poisson_dist.html"> Poisson
+<dt><span class="section"><a href="dist_ref/dists/rayleigh.html">Rayleigh
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/rayleigh.html"> Rayleigh
+<dt><span class="section"><a href="dist_ref/dists/students_t_dist.html">Students
+ t Distribution</a></span></dt>
+<dt><span class="section"><a href="dist_ref/dists/triangular_dist.html">Triangular
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/students_t_dist.html">
- Students t Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/triangular_dist.html">
- Triangular Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/weibull.html"> Weibull
+<dt><span class="section"><a href="dist_ref/dists/uniform_dist.html">Uniform
Distribution</a></span></dt>
-<dt><span class="section"><a href="dist_ref/dists/uniform_dist.html"> Uniform
+<dt><span class="section"><a href="dist_ref/dists/weibull_dist.html">Weibull
Distribution</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="dist_ref/dist_algorithms.html"> Distribution
+<dt><span class="section"><a href="dist_ref/dist_algorithms.html">Distribution
Algorithms</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../dist_ref.html" title="Statistical Distributions Reference">
-<link rel="prev" href="dists/uniform_dist.html" title="Uniform Distribution">
+<link rel="prev" href="dists/weibull_dist.html" title="Weibull Distribution">
<link rel="next" href="../future.html" title="Extras/Future Directions">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,15 +20,15 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="dists/uniform_dist.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../future.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="dists/weibull_dist.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../future.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.dist_ref.dist_algorithms"></a><a class="link" href="dist_algorithms.html" title="Distribution Algorithms"> Distribution
+<a name="math_toolkit.dist.dist_ref.dist_algorithms"></a><a class="link" href="dist_algorithms.html" title="Distribution Algorithms">Distribution
Algorithms</a>
</h4></div></div></div>
<a name="math_toolkit.dist.dist_ref.dist_algorithms.finding_the_location_and_scale_for_normal_and_similar_distributions"></a><h5>
-<a name="id1064551"></a>
+<a name="id1188688"></a>
<a class="link" href="dist_algorithms.html#math_toolkit.dist.dist_ref.dist_algorithms.finding_the_location_and_scale_for_normal_and_similar_distributions">Finding
the Location and Scale for Normal and similar distributions</a>
</h5>
@@ -50,7 +50,7 @@
</span><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">complement</span><span class="special">;</span> <span class="comment">// Will be needed by users who want to use complements.
</span></pre>
<a name="math_toolkit.dist.dist_ref.dist_algorithms.find_location_function"></a><h5>
-<a name="id1064649"></a>
+<a name="id1190424"></a>
<a class="link" href="dist_algorithms.html#math_toolkit.dist.dist_ref.dist_algorithms.find_location_function">find_location
function</a>
</h5>
@@ -80,7 +80,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.dist.dist_ref.dist_algorithms.find_scale_function"></a><h5>
-<a name="id1065232"></a>
+<a name="id1190869"></a>
<a class="link" href="dist_algorithms.html#math_toolkit.dist.dist_ref.dist_algorithms.find_scale_function">find_scale
function</a>
</h5>
@@ -140,7 +140,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="dists/uniform_dist.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../future.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="dists/weibull_dist.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../future.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,63 +24,66 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.dist_ref.dists"></a><a class="link" href="dists.html" title="Distributions"> Distributions</a>
+<a name="math_toolkit.dist.dist_ref.dists"></a><a class="link" href="dists.html" title="Distributions">Distributions</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="dists/bernoulli_dist.html">
- Bernoulli Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/beta_dist.html"> Beta
+<dt><span class="section"><a href="dists/bernoulli_dist.html">Bernoulli
Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/binomial_dist.html">
- Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><span class="section"><a href="dists/beta_dist.html">Beta
Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/chi_squared_dist.html">
- Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/exp_dist.html"> Exponential
+<dt><span class="section"><a href="dists/binomial_dist.html">Binomial
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/cauchy_dist.html">Cauchy-Lorentz
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/exp_dist.html">Exponential
Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/extreme_dist.html"> Extreme
+<dt><span class="section"><a href="dists/extreme_dist.html">Extreme
Value Distribution</a></span></dt>
-<dt><span class="section"> F Distribution</span></dt>
-<dt><span class="section"><a href="dists/gamma_dist.html"> Gamma
+<dt><span class="section">F Distribution</span></dt>
+<dt><span class="section"><a href="dists/gamma_dist.html">Gamma
(and Erlang) Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/inverse_chi_squared_dist.html">
- Inverse Chi Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/inverse_gamma_dist.html">
- Inverse Gamma Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/hypergeometric_dist.html">
- Hypergeometric Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/laplace_dist.html"> Laplace
- Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/logistic_dist.html">
- Logistic Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/lognormal_dist.html">
- Log Normal Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/nc_beta_dist.html"> Noncentral
+<dt><span class="section"><a href="dists/geometric_dist.html">Geometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/hypergeometric_dist.html">Hypergeometric
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/inverse_chi_squared_dist.html">Inverse
+ Chi Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/inverse_gamma_dist.html">Inverse
+ Gamma Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/inverse_gaussian_dist.html">Inverse
+ Gaussian (or Inverse Normal) Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/laplace_dist.html">Laplace
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/logistic_dist.html">Logistic
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/lognormal_dist.html">Log
+ Normal Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/nc_beta_dist.html">Noncentral
Beta Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/nc_f_dist.html"> Noncentral
+<dt><span class="section"><a href="dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/nc_f_dist.html">Noncentral
F Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/nc_t_dist.html"> Noncentral
+<dt><span class="section"><a href="dists/nc_t_dist.html">Noncentral
T Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/normal_dist.html"> Normal
+<dt><span class="section"><a href="dists/normal_dist.html">Normal
(Gaussian) Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/pareto.html"> Pareto
+<dt><span class="section">Pareto Distribution</span></dt>
+<dt><span class="section"><a href="dists/poisson_dist.html">Poisson
Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/poisson_dist.html"> Poisson
+<dt><span class="section"><a href="dists/rayleigh.html">Rayleigh
Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/rayleigh.html"> Rayleigh
+<dt><span class="section"><a href="dists/students_t_dist.html">Students
+ t Distribution</a></span></dt>
+<dt><span class="section"><a href="dists/triangular_dist.html">Triangular
Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/students_t_dist.html">
- Students t Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/triangular_dist.html">
- Triangular Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/weibull.html"> Weibull
+<dt><span class="section"><a href="dists/uniform_dist.html">Uniform
Distribution</a></span></dt>
-<dt><span class="section"><a href="dists/uniform_dist.html"> Uniform
+<dt><span class="section"><a href="dists/weibull_dist.html">Weibull
Distribution</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist"></a><a class="link" href="bernoulli_dist.html" title="Bernoulli Distribution">
- Bernoulli Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist"></a><a class="link" href="bernoulli_dist.html" title="Bernoulli Distribution">Bernoulli
+ Distribution</a>
</h5></div></div></div>
<p>
@@ -87,7 +87,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/bernoulli_cdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.member_functions"></a><h5>
-<a name="id1007124"></a>
+<a name="id1125588"></a>
<a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.member_functions">Member
Functions</a>
</h5>
@@ -103,7 +103,7 @@
Returns the <span class="emphasis"><em>success_fraction</em></span> parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.non_member_accessors"></a><h5>
-<a name="id1007202"></a>
+<a name="id1125668"></a>
<a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -128,7 +128,7 @@
exception and make an error message available.
</p>
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.accuracy"></a><h5>
-<a name="id1007305"></a>
+<a name="id1125771"></a>
<a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -136,7 +136,7 @@
and so should have errors within an epsilon or two.
</p>
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.implementation"></a><h5>
-<a name="id1007327"></a>
+<a name="id1125792"></a>
<a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.implementation">Implementation</a>
</h5>
<p>
@@ -327,7 +327,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.references"></a><h5>
-<a name="id1007656"></a>
+<a name="id1126118"></a>
<a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.beta_dist"></a><a class="link" href="beta_dist.html" title="Beta Distribution"> Beta
+<a name="math_toolkit.dist.dist_ref.dists.beta_dist"></a><a class="link" href="beta_dist.html" title="Beta Distribution">Beta
Distribution</a>
</h5></div></div></div>
<p>
@@ -132,12 +132,12 @@
whose apex is away from the centre (where x = half).
</p>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.member_functions"></a><h5>
-<a name="id1008471"></a>
+<a name="id1126942"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.member_functions">Member
Functions</a>
</h5>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.constructor"></a><h6>
-<a name="id1008486"></a>
+<a name="id1126959"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.constructor">Constructor</a>
</h6>
<pre class="programlisting"><span class="identifier">beta_distribution</span><span class="special">(</span><span class="identifier">RealType</span> <span class="identifier">alpha</span><span class="special">,</span> <span class="identifier">RealType</span> <span class="identifier">beta</span><span class="special">);</span>
@@ -164,7 +164,7 @@
yellow in the graph above).
</p>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.parameter_accessors"></a><h6>
-<a name="id1008601"></a>
+<a name="id1127074"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.parameter_accessors">Parameter
Accessors</a>
</h6>
@@ -188,7 +188,7 @@
</span><span class="identifier">assert</span><span class="special">(</span><span class="identifier">mybeta</span><span class="special">.</span><span class="identifier">beta</span><span class="special">()</span> <span class="special">==</span> <span class="number">5.</span><span class="special">);</span> <span class="comment">// mybeta.beta() returns 5
</span></pre>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.parameter_estimators"></a><h5>
-<a name="id1008803"></a>
+<a name="id1127279"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.parameter_estimators">Parameter
Estimators</a>
</h5>
@@ -213,7 +213,7 @@
</span> <span class="identifier">RealType</span> <span class="identifier">variance</span><span class="special">);</span> <span class="comment">// Expected value of variance.
</span></pre>
<p>
- Returns the unique value of α ​ that corresponds to a beta distribution with
+ Returns the unique value of α   that corresponds to a beta distribution with
mean <span class="emphasis"><em>mean</em></span> and variance <span class="emphasis"><em>variance</em></span>.
</p>
<pre class="programlisting"><span class="keyword">static</span> <span class="identifier">RealType</span> <span class="identifier">find_beta</span><span class="special">(</span>
@@ -221,7 +221,7 @@
</span> <span class="identifier">RealType</span> <span class="identifier">variance</span><span class="special">);</span> <span class="comment">// Expected value of variance.
</span></pre>
<p>
- Returns the unique value of β ​ that corresponds to a beta distribution with
+ Returns the unique value of β   that corresponds to a beta distribution with
mean <span class="emphasis"><em>mean</em></span> and variance <span class="emphasis"><em>variance</em></span>.
</p>
<pre class="programlisting"><span class="keyword">static</span> <span class="identifier">RealType</span> <span class="identifier">find_alpha</span><span class="special">(</span>
@@ -230,7 +230,7 @@
</span> <span class="identifier">RealType</span> <span class="identifier">probability</span><span class="special">);</span> <span class="comment">// probability cdf
</span></pre>
<p>
- Returns the value of α ​ that gives: <code class="computeroutput"><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">beta_distribution</span><span class="special"><</span><span class="identifier">RealType</span><span class="special">>(</span><span class="identifier">alpha</span><span class="special">,</span> <span class="identifier">beta</span><span class="special">),</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">probability</span></code>.
+ Returns the value of α   that gives: <code class="computeroutput"><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">beta_distribution</span><span class="special"><</span><span class="identifier">RealType</span><span class="special">>(</span><span class="identifier">alpha</span><span class="special">,</span> <span class="identifier">beta</span><span class="special">),</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">probability</span></code>.
</p>
<pre class="programlisting"><span class="keyword">static</span> <span class="identifier">RealType</span> <span class="identifier">find_beta</span><span class="special">(</span>
<span class="identifier">RealType</span> <span class="identifier">alpha</span><span class="special">,</span> <span class="comment">// alpha.
@@ -238,10 +238,10 @@
</span> <span class="identifier">RealType</span> <span class="identifier">probability</span><span class="special">);</span> <span class="comment">// probability cdf.
</span></pre>
<p>
- Returns the value of β ​ that gives: <code class="computeroutput"><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">beta_distribution</span><span class="special"><</span><span class="identifier">RealType</span><span class="special">>(</span><span class="identifier">alpha</span><span class="special">,</span> <span class="identifier">beta</span><span class="special">),</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">probability</span></code>.
+ Returns the value of β   that gives: <code class="computeroutput"><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">beta_distribution</span><span class="special"><</span><span class="identifier">RealType</span><span class="special">>(</span><span class="identifier">alpha</span><span class="special">,</span> <span class="identifier">beta</span><span class="special">),</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">probability</span></code>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.non_member_accessor_functions"></a><h5>
-<a name="id1010042"></a>
+<a name="id1127752"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.non_member_accessor_functions">Non-member
Accessor Functions</a>
</h5>
@@ -263,7 +263,7 @@
Mathworld</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.applications"></a><h5>
-<a name="id1010144"></a>
+<a name="id1127856"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.applications">Applications</a>
</h5>
<p>
@@ -276,7 +276,7 @@
statistical inference</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.related_distributions"></a><h5>
-<a name="id1010170"></a>
+<a name="id1127881"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.related_distributions">Related
distributions</a>
</h5>
@@ -303,7 +303,7 @@
Distribution</a> with its p parameter set to x.
</p>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.accuracy"></a><h5>
-<a name="id1010216"></a>
+<a name="id1127928"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -315,12 +315,12 @@
please refer to these functions for information on accuracy.
</p>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.implementation"></a><h5>
-<a name="id1010261"></a>
+<a name="id1127972"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.implementation">Implementation</a>
</h5>
<p>
In the following table <span class="emphasis"><em>a</em></span> and <span class="emphasis"><em>b</em></span>
- are the parameters α ​ and β, <span class="emphasis"><em>x</em></span> is the random variable,
+ are the parameters α   and β, <span class="emphasis"><em>x</em></span> is the random variable,
<span class="emphasis"><em>p</em></span> is the probability and <span class="emphasis"><em>q = 1-p</em></span>.
</p>
<div class="informaltable"><table class="table">
@@ -500,8 +500,6 @@
</p>
</td>
<td>
- <p>
- </p>
</td>
</tr>
<tr>
@@ -596,7 +594,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.references"></a><h5>
-<a name="id1011288"></a>
+<a name="id1128998"></a>
<a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.references">References</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.binomial_dist"></a><a class="link" href="binomial_dist.html" title="Binomial Distribution">
- Binomial Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.binomial_dist"></a><a class="link" href="binomial_dist.html" title="Binomial Distribution">Binomial
+ Distribution</a>
</h5></div></div></div>
<p>
@@ -48,7 +48,7 @@
<span class="keyword">typedef</span> <span class="identifier">RealType</span> <span class="identifier">value_type</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Policy</span> <span class="identifier">policy_type</span><span class="special">;</span>
- <span class="keyword">static</span> <span class="keyword">const</span> <span class="emphasis"><em>unspecified-type</em></span> <span class="identifier">cloppper_pearson_exact_interval</span><span class="special">;</span>
+ <span class="keyword">static</span> <span class="keyword">const</span> <span class="emphasis"><em>unspecified-type</em></span> <span class="identifier">clopper_pearson_exact_interval</span><span class="special">;</span>
<span class="keyword">static</span> <span class="keyword">const</span> <span class="emphasis"><em>unspecified-type</em></span> <span class="identifier">jeffreys_prior_interval</span><span class="special">;</span>
<span class="comment">// construct:
@@ -127,8 +127,6 @@
<p>
<span class="inlinemediaobject"><img src="../../../../../graphs/binomial_pdf_2.png" align="middle"></span>
</p>
-<p>
- </p>
<div class="caution"><table border="0" summary="Caution">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../../../../../doc/src/images/caution.png"></td>
@@ -136,43 +134,39 @@
</tr>
<tr><td align="left" valign="top">
<p>
- The Binomial distribution is a discrete distribution: internally
- functions like the <code class="computeroutput"><span class="identifier">cdf</span></code>
- and <code class="computeroutput"><span class="identifier">pdf</span></code> are treated
- "as if" they are continuous functions, but in reality the
- results returned from these functions only have meaning if an integer
- value is provided for the random variate argument.
- </p>
-<p>
- The quantile function will by default return an integer result that
- has been <span class="emphasis"><em>rounded outwards</em></span>. That is to say lower
- quantiles (where the probability is less than 0.5) are rounded downward,
- and upper quantiles (where the probability is greater than 0.5) are
- rounded upwards. This behaviour ensures that if an X% quantile is
- requested, then <span class="emphasis"><em>at least</em></span> the requested coverage
- will be present in the central region, and <span class="emphasis"><em>no more than</em></span>
- the requested coverage will be present in the tails.
- </p>
-<p>
- This behaviour can be changed so that the quantile functions are
- rounded differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>. It is
- strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Quantiles of Discrete Distributions</a> before using the quantile
- function on the Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
- docs</a> describe how to change the rounding policy for these
- distributions.
- </p>
+ The Binomial distribution is a discrete distribution: internally, functions
+ like the <code class="computeroutput"><span class="identifier">cdf</span></code> and <code class="computeroutput"><span class="identifier">pdf</span></code> are treated "as if"
+ they are continuous functions, but in reality the results returned
+ from these functions only have meaning if an integer value is provided
+ for the random variate argument.
+ </p>
+<p>
+ The quantile function will by default return an integer result that
+ has been <span class="emphasis"><em>rounded outwards</em></span>. That is to say lower
+ quantiles (where the probability is less than 0.5) are rounded downward,
+ and upper quantiles (where the probability is greater than 0.5) are
+ rounded upwards. This behaviour ensures that if an X% quantile is requested,
+ then <span class="emphasis"><em>at least</em></span> the requested coverage will be present
+ in the central region, and <span class="emphasis"><em>no more than</em></span> the requested
+ coverage will be present in the tails.
+ </p>
+<p>
+ This behaviour can be changed so that the quantile functions are rounded
+ differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>.
+ It is strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a> before using the quantile
+ function on the Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
+ docs</a> describe how to change the rounding policy for these distributions.
+ </p>
</td></tr>
</table></div>
-<p>
- </p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.member_functions"></a><h5>
-<a name="id1014708"></a>
+<a name="id1130235"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.member_functions">Member
Functions</a>
</h5>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.construct"></a><h6>
-<a name="id1014726"></a>
+<a name="id1130254"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.construct">Construct</a>
</h6>
<pre class="programlisting"><span class="identifier">binomial_distribution</span><span class="special">(</span><span class="identifier">RealType</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">RealType</span> <span class="identifier">p</span><span class="special">);</span>
@@ -189,7 +183,7 @@
otherwise calls <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.accessors"></a><h6>
-<a name="id1014844"></a>
+<a name="id1130373"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.accessors">Accessors</a>
</h6>
<pre class="programlisting"><span class="identifier">RealType</span> <span class="identifier">success_fraction</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
@@ -205,7 +199,7 @@
was constructed.
</p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.lower_bound_on_the_success_fraction"></a><h6>
-<a name="id1014924"></a>
+<a name="id1130453"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.lower_bound_on_the_success_fraction">Lower
Bound on the Success Fraction</a>
</h6>
@@ -311,7 +305,7 @@
limits illustrated in the case of the binomial. Biometrika 26 404-413.
</p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.upper_bound_on_the_success_fraction"></a><h6>
-<a name="id1015378"></a>
+<a name="id1130908"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.upper_bound_on_the_success_fraction">Upper
Bound on the Success Fraction</a>
</h6>
@@ -389,7 +383,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_number_of_trials_required_for_a_certain_number_of_successes"></a><h6>
-<a name="id1015693"></a>
+<a name="id1131223"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_number_of_trials_required_for_a_certain_number_of_successes">Estimating
the Number of Trials Required for a Certain Number of Successes</a>
</h6>
@@ -431,7 +425,7 @@
of seeing 10 events that occur with frequency one half.
</p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_maximum_number_of_trials_to_ensure_no_more_than_a_certain_number_of_successes"></a><h6>
-<a name="id1015895"></a>
+<a name="id1131425"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_maximum_number_of_trials_to_ensure_no_more_than_a_certain_number_of_successes">Estimating
the Maximum Number of Trials to Ensure no more than a Certain Number
of Successes</a>
@@ -479,7 +473,7 @@
Worked Example.</a>
</p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.non_member_accessors"></a><h5>
-<a name="id1016105"></a>
+<a name="id1131636"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -504,7 +498,7 @@
in the context of this distribution:
</p>
<div class="table">
-<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.meaning_of_the_non_member_accessors"></a><p class="title"><b>Table 11. Meaning of the non-member accessors</b></p>
+<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.meaning_of_the_non_member_accessors"></a><p class="title"><b>Table 13. Meaning of the non-member accessors</b></p>
<div class="table-contents"><table class="table" summary="Meaning of the non-member accessors">
<colgroup>
<col>
@@ -628,7 +622,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.dist.dist_ref.dists.binomial_dist.examples"></a><h5>
-<a name="id1016660"></a>
+<a name="id1133784"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.examples">Examples</a>
</h5>
<p>
@@ -636,7 +630,7 @@
examples</a> are available illustrating the use of the binomial distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.accuracy"></a><h5>
-<a name="id1016682"></a>
+<a name="id1133806"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -646,7 +640,7 @@
please refer to these functions for information on accuracy.
</p>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.implementation"></a><h5>
-<a name="id1017430"></a>
+<a name="id1133835"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.implementation">Implementation</a>
</h5>
<p>
@@ -755,7 +749,7 @@
Since the cdf is non-linear in variate <span class="emphasis"><em>k</em></span>
none of the inverse incomplete beta functions can be used here.
Instead the quantile is found numerically using a derivative
- free method (<a class="link" href="../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">TOMS
+ free method (<a class="link" href="../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">TOMS
Algorithm 748</a>).
</p>
</td>
@@ -890,7 +884,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.references"></a><h5>
-<a name="id1018480"></a>
+<a name="id1134880"></a>
<a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist"></a><a class="link" href="cauchy_dist.html" title="Cauchy-Lorentz Distribution"> Cauchy-Lorentz
+<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist"></a><a class="link" href="cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy-Lorentz
Distribution</a>
</h5></div></div></div>
<p>
@@ -63,8 +63,8 @@
<span class="inlinemediaobject"><img src="../../../../../equations/cauchy_ref1.png"></span>
</p>
<p>
- The location parameter x<sub>0</sub> ​ is the location of the peak of the distribution
- (the mode of the distribution), while the scale parameter γ ​ specifies half
+ The location parameter x<sub>0</sub>   is the location of the peak of the distribution
+ (the mode of the distribution), while the scale parameter γ   specifies half
the width of the PDF at half the maximum height. If the location is zero,
and the scale 1, then the result is a standard Cauchy distribution.
</p>
@@ -88,7 +88,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/cauchy_pdf2.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.member_functions"></a><h5>
-<a name="id1018998"></a>
+<a name="id1135398"></a>
<a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.member_functions">Member
Functions</a>
</h5>
@@ -114,7 +114,7 @@
Returns the scale parameter of the distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.non_member_accessors"></a><h5>
-<a name="id1019146"></a>
+<a name="id1135547"></a>
<a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -148,7 +148,7 @@
The domain of the random variable is [-[max_value], +[min_value]].
</p>
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.accuracy"></a><h5>
-<a name="id1019288"></a>
+<a name="id1135690"></a>
<a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -157,12 +157,12 @@
have very low error rates.
</p>
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.implementation"></a><h5>
-<a name="id1019322"></a>
+<a name="id1135724"></a>
<a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.implementation">Implementation</a>
</h5>
<p>
In the following table x<sub>0 </sub> is the location parameter of the distribution,
- γ ​ is its scale parameter, <span class="emphasis"><em>x</em></span> is the random variate,
+ γ   is its scale parameter, <span class="emphasis"><em>x</em></span> is the random variate,
<span class="emphasis"><em>p</em></span> is the probability and <span class="emphasis"><em>q = 1-p</em></span>.
</p>
<div class="informaltable"><table class="table">
@@ -224,7 +224,7 @@
<p>
So the procedure is to calculate the cdf for -fabs(x) using
the above formula. Note that to factor in the location and
- scale parameters you must substitute (x - x<sub>0 </sub>) / γ ​ for x in the
+ scale parameters you must substitute (x - x<sub>0 </sub>) / γ   for x in the
above.
</p>
<p>
@@ -244,12 +244,12 @@
<td>
<p>
The same procedure is used irrespective of whether we're starting
- from the probability or it's complement. First the argument
+ from the probability or its complement. First the argument
<span class="emphasis"><em>p</em></span> is reduced to the range [-0.5, 0.5],
then the relation
</p>
<p>
- x = x<sub>0 </sub> ± γ ​ / tan(π * p)
+ x = x<sub>0 </sub> ± γ   / tan(π * p)
</p>
<p>
is used to obtain the result. Whether we're adding or subtracting
@@ -273,7 +273,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.references"></a><h5>
-<a name="id1019549"></a>
+<a name="id1136528"></a>
<a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist"></a><a class="link" href="chi_squared_dist.html" title="Chi Squared Distribution">
- Chi Squared Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist"></a><a class="link" href="chi_squared_dist.html" title="Chi Squared Distribution">Chi
+ Squared Distribution</a>
</h5></div></div></div>
<p>
@@ -67,9 +67,9 @@
</span></pre>
<p>
The Chi-Squared distribution is one of the most widely used distributions
- in statistical tests. If χ<sub>i</sub> ​ are ν ​
+ in statistical tests. If χ<sub>i</sub>   are ν  
independent, normally distributed random
- variables with means μ<sub>i</sub> ​ and variances σ<sub>i</sub><sup>2</sup>, then the random variable:
+ variables with means μ<sub>i</sub>   and variances σ<sub>i</sub><sup>2</sup>, then the random variable:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../../equations/chi_squ_ref1.png"></span>
@@ -79,7 +79,7 @@
</p>
<p>
The Chi-Squared distribution is a special case of the gamma distribution
- and has a single parameter ν ​ that specifies the number of degrees of freedom.
+ and has a single parameter ν   that specifies the number of degrees of freedom.
The following graph illustrates how the distribution changes for different
values of ν:
</p>
@@ -87,7 +87,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/chi_squared_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.member_functions"></a><h5>
-<a name="id1020125"></a>
+<a name="id1137093"></a>
<a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.member_functions">Member
Functions</a>
</h5>
@@ -170,7 +170,7 @@
NIST Engineering Statistics Handbook, Section 7.2.3.2</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.non_member_accessors"></a><h5>
-<a name="id1020456"></a>
+<a name="id1137424"></a>
<a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -196,7 +196,7 @@
The domain of the random variable is [0, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.examples"></a><h5>
-<a name="id1020559"></a>
+<a name="id1137528"></a>
<a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.examples">Examples</a>
</h5>
<p>
@@ -204,7 +204,7 @@
are available illustrating the use of the Chi Squared Distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.accuracy"></a><h5>
-<a name="id1020586"></a>
+<a name="id1137554"></a>
<a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -212,7 +212,7 @@
gamma functions</a>: please refer to the accuracy data for those functions.
</p>
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.implementation"></a><h5>
-<a name="id1020610"></a>
+<a name="id1137578"></a>
<a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.implementation">Implementation</a>
</h5>
<p>
@@ -379,7 +379,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.references"></a><h5>
-<a name="id1020906"></a>
+<a name="id1137868"></a>
<a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.exp_dist"></a><a class="link" href="exp_dist.html" title="Exponential Distribution"> Exponential
+<a name="math_toolkit.dist.dist_ref.dists.exp_dist"></a><a class="link" href="exp_dist.html" title="Exponential Distribution">Exponential
Distribution</a>
</h5></div></div></div>
<p>
@@ -71,7 +71,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/exponential_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.member_functions"></a><h5>
-<a name="id1021340"></a>
+<a name="id1138303"></a>
<a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.member_functions">Member
Functions</a>
</h5>
@@ -91,7 +91,7 @@
Accessor function returns the lambda parameter of the distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.non_member_accessors"></a><h5>
-<a name="id1021441"></a>
+<a name="id1138405"></a>
<a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -111,7 +111,7 @@
The domain of the random variable is [0, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.accuracy"></a><h5>
-<a name="id1021541"></a>
+<a name="id1138504"></a>
<a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -122,7 +122,7 @@
should have very low error rates.
</p>
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.implementation"></a><h5>
-<a name="id1021589"></a>
+<a name="id1138552"></a>
<a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.implementation">Implementation</a>
</h5>
<p>
@@ -283,7 +283,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.references"></a><h5>
-<a name="id1021881"></a>
+<a name="id1139045"></a>
<a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.references">references</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.extreme_dist"></a><a class="link" href="extreme_dist.html" title="Extreme Value Distribution"> Extreme
+<a name="math_toolkit.dist.dist_ref.dists.extreme_dist"></a><a class="link" href="extreme_dist.html" title="Extreme Value Distribution">Extreme
Value Distribution</a>
</h5></div></div></div>
<p>
@@ -100,7 +100,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/extreme_value_pdf2.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.member_functions"></a><h5>
-<a name="id1022444"></a>
+<a name="id1139606"></a>
<a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.member_functions">Member
Functions</a>
</h5>
@@ -125,7 +125,7 @@
Returns the scale parameter of the distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.non_member_accessors"></a><h5>
-<a name="id1022600"></a>
+<a name="id1139763"></a>
<a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -145,7 +145,7 @@
The domain of the random parameter is [-∞, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.accuracy"></a><h5>
-<a name="id1022697"></a>
+<a name="id1139861"></a>
<a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -154,7 +154,7 @@
very low error rates.
</p>
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.implementation"></a><h5>
-<a name="id1022731"></a>
+<a name="id1139894"></a>
<a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.f_dist"></a><a class="link" href="f_dist.html" title="F Distribution"> F Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.f_dist"></a><a class="link" href="f_dist.html" title="F Distribution">F Distribution</a>
</h5></div></div></div>
<p>
@@ -58,12 +58,12 @@
</span></pre>
<p>
The F distribution is a continuous distribution that arises when testing
- whether two samples have the same variance. If χ<sup>2</sup><sub>m</sub> ​ and χ<sup>2</sup><sub>n</sub> ​ are independent
+ whether two samples have the same variance. If χ<sup>2</sup><sub>m</sub>   and χ<sup>2</sup><sub>n</sub>   are independent
variates each distributed as Chi-Squared with <span class="emphasis"><em>m</em></span>
and <span class="emphasis"><em>n</em></span> degrees of freedom, then the test statistic:
</p>
<p>
- F<sub>n,m</sub> ​ = (χ<sup>2</sup><sub>n</sub> ​ / n) / (χ<sup>2</sup><sub>m</sub> ​ / m)
+ F<sub>n,m</sub>   = (χ<sup>2</sup><sub>n</sub>   / n) / (χ<sup>2</sup><sub>m</sub>   / m)
</p>
<p>
Is distributed over the range [0, ∞] with an F distribution, and has the
@@ -80,7 +80,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/fisher_f_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.f_dist.member_functions"></a><h5>
-<a name="id1023494"></a>
+<a name="id1140651"></a>
<a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.member_functions">Member
Functions</a>
</h5>
@@ -106,7 +106,7 @@
Returns the denominator degrees of freedom parameter of the distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.f_dist.non_member_accessors"></a><h5>
-<a name="id1023648"></a>
+<a name="id1140806"></a>
<a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -126,7 +126,7 @@
The domain of the random variable is [0, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.f_dist.examples"></a><h5>
-<a name="id1023747"></a>
+<a name="id1140906"></a>
<a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.examples">Examples</a>
</h5>
<p>
@@ -134,16 +134,16 @@
are available illustrating the use of the F Distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.f_dist.accuracy"></a><h5>
-<a name="id1023769"></a>
+<a name="id1140927"></a>
<a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.accuracy">Accuracy</a>
</h5>
<p>
The normal distribution is implemented in terms of the <a class="link" href="../../../special/sf_beta/ibeta_function.html" title="Incomplete Beta Functions">incomplete
- beta function</a> and it's <a class="link" href="../../../special/sf_beta/ibeta_inv_function.html" title="The Incomplete Beta Function Inverses">inverses</a>,
+ beta function</a> and its <a class="link" href="../../../special/sf_beta/ibeta_inv_function.html" title="The Incomplete Beta Function Inverses">inverses</a>,
refer to those functions for accuracy data.
</p>
<a name="math_toolkit.dist.dist_ref.dists.f_dist.implementation"></a><h5>
-<a name="id1023795"></a>
+<a name="id1140954"></a>
<a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
<link rel="prev" href="f_dist.html" title="F Distribution">
-<link rel="next" href="inverse_chi_squared_dist.html" title="Inverse Chi Squared Distribution">
+<link rel="next" href="geometric_dist.html" title="Geometric Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="f_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="f_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="geometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.gamma_dist"></a><a class="link" href="gamma_dist.html" title="Gamma (and Erlang) Distribution"> Gamma
+<a name="math_toolkit.dist.dist_ref.dists.gamma_dist"></a><a class="link" href="gamma_dist.html" title="Gamma (and Erlang) Distribution">Gamma
(and Erlang) Distribution</a>
</h5></div></div></div>
<p>
@@ -76,30 +76,30 @@
<p>
</p>
-<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">gamma_distibution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">gamma</span><span class="special">;</span></pre>
+<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">gamma_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">gamma</span><span class="special">;</span></pre>
<p>
</p>
<p>
- Instead if you want a double precision gamma distribution you can use
+ Instead if you want a double precision gamma distribution you can write
</p>
<p>
</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">gamma_distribution</span><span class="special"><></span></pre>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">gamma_distribution</span><span class="special"><></span> <span class="identifier">my_gamma</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">1</span><span class="special">);</span></pre>
<p>
</p>
</td></tr>
</table></div>
<p>
- For shape parameter <span class="emphasis"><em>k</em></span> and scale parameter θ ​ it is
+ For shape parameter <span class="emphasis"><em>k</em></span> and scale parameter θ   it is
defined by the probability density function:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../../equations/gamma_dist_ref1.png"></span>
</p>
<p>
- Sometimes an alternative formulation is used: given parameters α ​= k and
- β ​= 1 / θ, then the distribution can be defined by the PDF:
+ Sometimes an alternative formulation is used: given parameters α  = k and
+ β  = 1 / θ, then the distribution can be defined by the PDF:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../../equations/gamma_dist_ref2.png"></span>
@@ -137,7 +137,7 @@
than a dedicated Erlang Distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.member_functions"></a><h5>
-<a name="id1026774"></a>
+<a name="id1143322"></a>
<a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.member_functions">Member
Functions</a>
</h5>
@@ -162,7 +162,7 @@
Returns the <span class="emphasis"><em>scale</em></span> parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.non_member_accessors"></a><h5>
-<a name="id1026919"></a>
+<a name="id1143468"></a>
<a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -182,7 +182,7 @@
The domain of the random variable is [0,+∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.accuracy"></a><h5>
-<a name="id1027017"></a>
+<a name="id1143565"></a>
<a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -194,14 +194,14 @@
refer to the accuracy data for those functions for more information.
</p>
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.implementation"></a><h5>
-<a name="id1027055"></a>
+<a name="id1143604"></a>
<a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.implementation">Implementation</a>
</h5>
<p>
In the following table <span class="emphasis"><em>k</em></span> is the shape parameter
- of the distribution, θ ​ is it's scale parameter, <span class="emphasis"><em>x</em></span>
- is the random variate, <span class="emphasis"><em>p</em></span> is the probability and
- <span class="emphasis"><em>q = 1-p</em></span>.
+ of the distribution, θ   is its scale parameter, <span class="emphasis"><em>x</em></span> is
+ the random variate, <span class="emphasis"><em>p</em></span> is the probability and <span class="emphasis"><em>q
+ = 1-p</em></span>.
</p>
<div class="informaltable"><table class="table">
<colgroup>
@@ -268,7 +268,7 @@
</td>
<td>
<p>
- Using the relation: x = θ ​* <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(k,
+ Using the relation: x = θ  * <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(k,
p)
</p>
</td>
@@ -281,7 +281,7 @@
</td>
<td>
<p>
- Using the relation: x = θ ​* <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(k,
+ Using the relation: x = θ  * <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(k,
p)
</p>
</td>
@@ -318,7 +318,7 @@
</td>
<td>
<p>
- (k-1)θ ​ for <span class="emphasis"><em>k>1</em></span> otherwise a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
+ (k-1)θ   for <span class="emphasis"><em>k>1</em></span> otherwise a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
</p>
</td>
</tr>
@@ -373,7 +373,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="f_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="f_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="geometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,8 +6,8 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
-<link rel="prev" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">
-<link rel="next" href="laplace_dist.html" title="Laplace Distribution">
+<link rel="prev" href="geometric_dist.html" title="Geometric Distribution">
+<link rel="next" href="inverse_chi_squared_dist.html" title="Inverse Chi Squared Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,12 +20,12 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="laplace_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="geometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist"></a><a class="link" href="hypergeometric_dist.html" title="Hypergeometric Distribution">
- Hypergeometric Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist"></a><a class="link" href="hypergeometric_dist.html" title="Hypergeometric Distribution">Hypergeometric
+ Distribution</a>
</h5></div></div></div>
<p>
@@ -102,7 +102,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/hypergeometric_pdf_2.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.member_functions"></a><h5>
-<a name="id1030955"></a>
+<a name="id1150165"></a>
<a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.member_functions">Member
Functions</a>
</h5>
@@ -131,7 +131,7 @@
from the population <span class="emphasis"><em>N</em></span>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.non_member_accessors"></a><h5>
-<a name="id1031134"></a>
+<a name="id1150345"></a>
<a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -185,7 +185,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.accuracy"></a><h5>
-<a name="id1031284"></a>
+<a name="id1150495"></a>
<a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -211,7 +211,7 @@
meaningless for N >= 10<sup>15</sup>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.testing"></a><h5>
-<a name="id1031518"></a>
+<a name="id1150729"></a>
<a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.testing">Testing</a>
</h5>
<p>
@@ -223,7 +223,7 @@
this implementation and NTL::RR.
</p>
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.implementation"></a><h5>
-<a name="id1031542"></a>
+<a name="id1150753"></a>
<a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.implementation">Implementation</a>
</h5>
<p>
@@ -338,7 +338,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="laplace_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="geometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
-<link rel="prev" href="gamma_dist.html" title="Gamma (and Erlang) Distribution">
+<link rel="prev" href="hypergeometric_dist.html" title="Hypergeometric Distribution">
<link rel="next" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,12 +20,12 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="gamma_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist"></a><a class="link" href="inverse_chi_squared_dist.html" title="Inverse Chi Squared Distribution">
- Inverse Chi Squared Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist"></a><a class="link" href="inverse_chi_squared_dist.html" title="Inverse Chi Squared Distribution">Inverse
+ Chi Squared Distribution</a>
</h5></div></div></div>
<p>
@@ -126,7 +126,7 @@
distribution with ν (degrees_of_freedom) shape (α) and scale (β) where
</p>
<p>
-   α= ν /2 and β = ½.
+    α= ν /2 and β = ½.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
@@ -166,26 +166,26 @@
function (PDF):
</p>
<p>
-   f(x;ν) = 2<sup>-ν/2</sup> x<sup>-ν/2-1</sup> e<sup>-1/2x</sup> / Γ(ν/2)
+    f(x;ν) = 2<sup>-ν/2</sup> x<sup>-ν/2-1</sup> e<sup>-1/2x</sup> / Γ(ν/2)
</p>
<p>
and Cumulative Density Function (CDF)
</p>
<p>
-   F(x;ν) = Γ(ν/2, 1/2x) / Γ(ν/2)
+    F(x;ν) = Γ(ν/2, 1/2x) / Γ(ν/2)
</p>
<p>
For degrees of freedom parameter ν and scale parameter ξ, the <span class="bold"><strong>scaled</strong></span> inverse chi_squared distribution is defined
by the probability density function (PDF):
</p>
<p>
-   f(x;ν, ξ) = (ξν/2)<sup>ν/2</sup> e<sup>-νξ/2x</sup> x<sup>-1-ν/2</sup> / Γ(ν/2)
+    f(x;ν, ξ) = (ξν/2)<sup>ν/2</sup> e<sup>-νξ/2x</sup> x<sup>-1-ν/2</sup> / Γ(ν/2)
</p>
<p>
and Cumulative Density Function (CDF)
</p>
<p>
-   F(x;ν, ξ) = Γ(ν/2, νξ/2x) / Γ(ν/2)
+    F(x;ν, ξ) = Γ(ν/2, νξ/2x) / Γ(ν/2)
</p>
<p>
The following graphs illustrate how the PDF and CDF of the inverse chi_squared
@@ -198,7 +198,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/inverse_chi_squared_cdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.member_functions"></a><h5>
-<a name="id1028429"></a>
+<a name="id1154626"></a>
<a class="link" href="inverse_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.member_functions">Member
Functions</a>
</h5>
@@ -225,7 +225,7 @@
Returns the scale ξ parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.non_member_accessors"></a><h5>
-<a name="id1028601"></a>
+<a name="id1154799"></a>
<a class="link" href="inverse_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -255,7 +255,7 @@
</p></td></tr>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.accuracy"></a><h5>
-<a name="id1028705"></a>
+<a name="id1154903"></a>
<a class="link" href="inverse_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -271,7 +271,7 @@
iteration is involved, as for the estimation of degrees of freedom.
</p>
<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.implementation"></a><h5>
-<a name="id1028746"></a>
+<a name="id1154944"></a>
<a class="link" href="inverse_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.implementation">Implementation</a>
</h5>
<p>
@@ -346,7 +346,7 @@
</td>
<td>
<p>
- Using the relation: x = β ​/ <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(α,
+ Using the relation: x = β  / <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(α,
p)
</p>
</td>
@@ -359,7 +359,7 @@
</td>
<td>
<p>
- Using the relation: x = α ​/ <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(α,
+ Using the relation: x = α  / <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(α,
q)
</p>
</td>
@@ -452,7 +452,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.references"></a><h5>
-<a name="id1029075"></a>
+<a name="id1155271"></a>
<a class="link" href="inverse_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist.references">References</a>
</h5>
<div class="orderedlist"><ol type="1">
@@ -479,7 +479,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="gamma_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
<link rel="prev" href="inverse_chi_squared_dist.html" title="Inverse Chi Squared Distribution">
-<link rel="next" href="hypergeometric_dist.html" title="Hypergeometric Distribution">
+<link rel="next" href="inverse_gaussian_dist.html" title="Inverse Gaussian (or Inverse Normal) Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,12 +20,12 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gaussian_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist"></a><a class="link" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">
- Inverse Gamma Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist"></a><a class="link" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">Inverse
+ Gamma Distribution</a>
</h5></div></div></div>
<p>
@@ -111,13 +111,13 @@
density function (PDF):
</p>
<p>
-   f(x;α, β) = β<sup>α</sup> * (1/x) <sup>α+1</sup> exp(-β/x) / Γ(α)
+    f(x;α, β) = β<sup>α</sup> * (1/x) <sup>α+1</sup> exp(-β/x) / Γ(α)
</p>
<p>
and cumulative density function (CDF)
</p>
<p>
-   F(x;α, β) = Γ(α, β/x) / Γ(α)
+    F(x;α, β) = Γ(α, β/x) / Γ(α)
</p>
<p>
The following graphs illustrate how the PDF and CDF of the inverse gamma
@@ -130,7 +130,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/inverse_gamma_cdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.member_functions"></a><h5>
-<a name="id1029656"></a>
+<a name="id1155851"></a>
<a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.member_functions">Member
Functions</a>
</h5>
@@ -154,7 +154,7 @@
Returns the β scale parameter of this inverse gamma distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.non_member_accessors"></a><h5>
-<a name="id1029792"></a>
+<a name="id1155989"></a>
<a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -184,7 +184,7 @@
</p></td></tr>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.accuracy"></a><h5>
-<a name="id1029899"></a>
+<a name="id1156096"></a>
<a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -198,11 +198,11 @@
>14 decimal digits accuracy for 64-bit double.
</p>
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.implementation"></a><h5>
-<a name="id1029938"></a>
+<a name="id1156135"></a>
<a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.implementation">Implementation</a>
</h5>
<p>
- In the following table α is the shape parameter of the distribution, α ​ is
+ In the following table α is the shape parameter of the distribution, α   is
its scale parameter, <span class="emphasis"><em>x</em></span> is the random variate, <span class="emphasis"><em>p</em></span>
is the probability and <span class="emphasis"><em>q = 1-p</em></span>.
</p>
@@ -271,7 +271,7 @@
</td>
<td>
<p>
- Using the relation: x = β ​/ <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(α,
+ Using the relation: x = β  / <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(α,
p)
</p>
</td>
@@ -284,7 +284,7 @@
</td>
<td>
<p>
- Using the relation: x = α ​/ <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(α,
+ Using the relation: x = α  / <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(α,
q)
</p>
</td>
@@ -376,7 +376,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gaussian_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
-<link rel="prev" href="hypergeometric_dist.html" title="Hypergeometric Distribution">
+<link rel="prev" href="inverse_gaussian_dist.html" title="Inverse Gaussian (or Inverse Normal) Distribution">
<link rel="next" href="logistic_dist.html" title="Logistic Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="logistic_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_gaussian_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="logistic_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.laplace_dist"></a><a class="link" href="laplace_dist.html" title="Laplace Distribution"> Laplace
+<a name="math_toolkit.dist.dist_ref.dists.laplace_dist"></a><a class="link" href="laplace_dist.html" title="Laplace Distribution">Laplace
Distribution</a>
</h5></div></div></div>
<p>
@@ -62,7 +62,7 @@
1972, p. 930). It is also called the double exponential distribution.
</p>
<p>
- For location parameter μ ​ and scale parameter σ ​ it is defined by the probability
+ For location parameter μ   and scale parameter σ   it is defined by the probability
density function:
</p>
<p>
@@ -73,7 +73,7 @@
deviation of the normal or Gaussian distribution.
</p>
<p>
- The following graph illustrates the effect of the parameters μ ​ and σ ​ on the
+ The following graph illustrates the effect of the parameters μ   and σ   on the
PDF. Note that the range of the random variable remains [-∞,+∞] irrespective
of the value of the location parameter:
</p>
@@ -81,7 +81,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/laplace_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.member_functions"></a><h5>
-<a name="id1032269"></a>
+<a name="id1159191"></a>
<a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.member_functions">Member
Functions</a>
</h5>
@@ -113,7 +113,7 @@
Returns the <span class="emphasis"><em>scale</em></span> parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.non_member_accessors"></a><h5>
-<a name="id1032431"></a>
+<a name="id1159354"></a>
<a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -133,7 +133,7 @@
The domain of the random variable is [-∞,+∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.accuracy"></a><h5>
-<a name="id1032528"></a>
+<a name="id1159729"></a>
<a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -141,7 +141,7 @@
log and exp functions and as such should have very small errors.
</p>
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.implementation"></a><h5>
-<a name="id1032548"></a>
+<a name="id1159748"></a>
<a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.implementation">Implementation</a>
</h5>
<p>
@@ -329,7 +329,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.references"></a><h5>
-<a name="id1032869"></a>
+<a name="id1160065"></a>
<a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
@@ -360,7 +360,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="logistic_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_gaussian_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="logistic_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.logistic_dist"></a><a class="link" href="logistic_dist.html" title="Logistic Distribution">
- Logistic Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.logistic_dist"></a><a class="link" href="logistic_dist.html" title="Logistic Distribution">Logistic
+ Distribution</a>
</h5></div></div></div>
<p>
@@ -72,7 +72,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/logistic_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.member_functions"></a><h5>
-<a name="id1035669"></a>
+<a name="id1160554"></a>
<a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.member_functions">Member
Functions</a>
</h5>
@@ -98,7 +98,7 @@
Returns the scale of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.non_member_accessors"></a><h5>
-<a name="id1035835"></a>
+<a name="id1160720"></a>
<a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -128,7 +128,7 @@
and +<a class="link" href="../../../main_overview/error_handling.html#overflow_error">overflow_error</a> respectively.
</p>
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.accuracy"></a><h5>
-<a name="id1035985"></a>
+<a name="id1160869"></a>
<a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -140,7 +140,7 @@
error</em></span> can be guarenteed.
</p>
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.implementation"></a><h5>
-<a name="id1036040"></a>
+<a name="id1160925"></a>
<a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.implementation">Implementation</a>
</h5>
<div class="informaltable"><table class="table">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist"></a><a class="link" href="lognormal_dist.html" title="Log Normal Distribution">
- Log Normal Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist"></a><a class="link" href="lognormal_dist.html" title="Log Normal Distribution">Log
+ Normal Distribution</a>
</h5></div></div></div>
<p>
@@ -88,7 +88,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/lognormal_pdf2.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.member_functions"></a><h5>
-<a name="id1036790"></a>
+<a name="id1161673"></a>
<a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.member_functions">Member
Functions</a>
</h5>
@@ -121,7 +121,7 @@
Returns the <span class="emphasis"><em>scale</em></span> parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.non_member_accessors"></a><h5>
-<a name="id1036950"></a>
+<a name="id1161833"></a>
<a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -141,7 +141,7 @@
The domain of the random variable is [0,+∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.accuracy"></a><h5>
-<a name="id1037049"></a>
+<a name="id1163108"></a>
<a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -150,12 +150,12 @@
function</a>, and as such should have very low error rates.
</p>
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.implementation"></a><h5>
-<a name="id1037077"></a>
+<a name="id1163134"></a>
<a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.implementation">Implementation</a>
</h5>
<p>
In the following table <span class="emphasis"><em>m</em></span> is the location parameter
- of the distribution, <span class="emphasis"><em>s</em></span> is it's scale parameter,
+ of the distribution, <span class="emphasis"><em>s</em></span> is its scale parameter,
<span class="emphasis"><em>x</em></span> is the random variate, <span class="emphasis"><em>p</em></span>
is the probability and <span class="emphasis"><em>q = 1-p</em></span>.
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist"></a><a class="link" href="nc_beta_dist.html" title="Noncentral Beta Distribution"> Noncentral
+<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist"></a><a class="link" href="nc_beta_dist.html" title="Noncentral Beta Distribution">Noncentral
Beta Distribution</a>
</h5></div></div></div>
<p>
@@ -96,7 +96,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/nc_beta_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.member_functions"></a><h5>
-<a name="id1042868"></a>
+<a name="id1168799"></a>
<a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.member_functions">Member
Functions</a>
</h5>
@@ -128,7 +128,7 @@
was constructed.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.non_member_accessors"></a><h5>
-<a name="id1043054"></a>
+<a name="id1168982"></a>
<a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -137,22 +137,26 @@
accessor functions</a> are supported: <a class="link" href="../nmp.html#math.dist.cdf">Cumulative
Distribution Function</a>, <a class="link" href="../nmp.html#math.dist.pdf">Probability
Density Function</a>, <a class="link" href="../nmp.html#math.dist.quantile">Quantile</a>,
- <a class="link" href="../nmp.html#math.dist.median">median</a>, <a class="link" href="../nmp.html#math.dist.mode">mode</a>,
- <a class="link" href="../nmp.html#math.dist.hazard">Hazard Function</a>, <a class="link" href="../nmp.html#math.dist.chf">Cumulative
- Hazard Function</a>, <a class="link" href="../nmp.html#math.dist.range">range</a>
- and <a class="link" href="../nmp.html#math.dist.support">support</a>.
+ <a class="link" href="../nmp.html#math.dist.mean">mean</a>, <a class="link" href="../nmp.html#math.dist.variance">variance</a>,
+ <a class="link" href="../nmp.html#math.dist.sd">standard deviation</a>, <a class="link" href="../nmp.html#math.dist.median">median</a>,
+ <a class="link" href="../nmp.html#math.dist.mode">mode</a>, <a class="link" href="../nmp.html#math.dist.hazard">Hazard
+ Function</a>, <a class="link" href="../nmp.html#math.dist.chf">Cumulative Hazard Function</a>,
+ <a class="link" href="../nmp.html#math.dist.range">range</a> and <a class="link" href="../nmp.html#math.dist.support">support</a>.
</p>
<p>
- However, the following are not currently implemented: <a class="link" href="../nmp.html#math.dist.mean">mean</a>,
- <a class="link" href="../nmp.html#math.dist.variance">variance</a>, <a class="link" href="../nmp.html#math.dist.sd">standard
- deviation</a>, <a class="link" href="../nmp.html#math.dist.skewness">skewness</a>,
+ Mean and variance are implemented using hypergeometric pfq functions
+ and relations given in <a href="http://reference.wolfram.com/mathematica/ref/NoncentralBetaDistribution.html" target="_top">Wolfram
+ Noncentral Beta Distribution</a>.
+ </p>
+<p>
+ However, the following are not currently implemented: <a class="link" href="../nmp.html#math.dist.skewness">skewness</a>,
<a class="link" href="../nmp.html#math.dist.kurtosis">kurtosis</a> and <a class="link" href="../nmp.html#math.dist.kurtosis_excess">kurtosis_excess</a>.
</p>
<p>
The domain of the random variable is [0, 1].
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.accuracy"></a><h5>
-<a name="id1043155"></a>
+<a name="id1169091"></a>
<a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -168,7 +172,7 @@
zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.errors_in_cdf_of_the_noncentral_beta"></a><p class="title"><b>Table 13. Errors In CDF of the Noncentral Beta</b></p>
+<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.errors_in_cdf_of_the_noncentral_beta"></a><p class="title"><b>Table 16. Errors In CDF of the Noncentral Beta</b></p>
<div class="table-contents"><table class="table" summary="Errors In CDF of the Noncentral Beta">
<colgroup>
<col>
@@ -295,7 +299,7 @@
functions are broadly similar.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.tests"></a><h5>
-<a name="id1044572"></a>
+<a name="id1169327"></a>
<a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.tests">Tests</a>
</h5>
<p>
@@ -307,7 +311,7 @@
tests.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.implementation"></a><h5>
-<a name="id1044596"></a>
+<a name="id1169351"></a>
<a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.implementation">Implementation</a>
</h5>
<p>
@@ -388,7 +392,7 @@
<span class="inlinemediaobject"><img src="../../../../../equations/nc_beta_ref1.png"></span>
</p>
<p>
- Quantiles are computed using a specially modified version of <a class="link" href="../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">bracket_and_solve_root</a>,
+ Quantiles are computed using a specially modified version of <a class="link" href="../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">bracket_and_solve_root</a>,
starting the search for the root at the mean of the distribution. (A
Cornish-Fisher type expansion was also tried, but while this gets quite
close to the root in many cases, when it is wrong it tends to introduce
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist"></a><a class="link" href="nc_chi_squared_dist.html" title="Noncentral Chi-Squared Distribution">
- Noncentral Chi-Squared Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist"></a><a class="link" href="nc_chi_squared_dist.html" title="Noncentral Chi-Squared Distribution">Noncentral
+ Chi-Squared Distribution</a>
</h5></div></div></div>
<p>
@@ -110,7 +110,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/nccs_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.member_functions"></a><h5>
-<a name="id1045615"></a>
+<a name="id1170368"></a>
<a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.member_functions">Member
Functions</a>
</h5>
@@ -183,7 +183,7 @@
<span class="special">==</span> <span class="identifier">q</span></code>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.non_member_accessors"></a><h5>
-<a name="id1046516"></a>
+<a name="id1172099"></a>
<a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -203,7 +203,7 @@
The domain of the random variable is [0, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.examples"></a><h5>
-<a name="id1047344"></a>
+<a name="id1172199"></a>
<a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.examples">Examples</a>
</h5>
<p>
@@ -211,7 +211,7 @@
example</a> for the noncentral chi-squared distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.accuracy"></a><h5>
-<a name="id1047371"></a>
+<a name="id1172225"></a>
<a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -223,7 +223,7 @@
zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.errors_in_cdf_of_the_noncentral_chi_squared"></a><p class="title"><b>Table 14. Errors In CDF of the Noncentral Chi-Squared</b></p>
+<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.errors_in_cdf_of_the_noncentral_chi_squared"></a><p class="title"><b>Table 17. Errors In CDF of the Noncentral Chi-Squared</b></p>
<div class="table-contents"><table class="table" summary="Errors In CDF of the Noncentral Chi-Squared">
<colgroup>
<col>
@@ -359,7 +359,7 @@
produce an accuracy greater than the square root of the machine epsilon.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.tests"></a><h5>
-<a name="id1047632"></a>
+<a name="id1172472"></a>
<a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.tests">Tests</a>
</h5>
<p>
@@ -373,7 +373,7 @@
to at least 50 decimal digits - and is the used for our accuracy tests.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.implementation"></a><h5>
-<a name="id1047651"></a>
+<a name="id1172492"></a>
<a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist"></a><a class="link" href="nc_f_dist.html" title="Noncentral F Distribution"> Noncentral
+<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist"></a><a class="link" href="nc_f_dist.html" title="Noncentral F Distribution">Noncentral
F Distribution</a>
</h5></div></div></div>
<p>
@@ -95,7 +95,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/nc_f_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.member_functions"></a><h5>
-<a name="id1048504"></a>
+<a name="id1173345"></a>
<a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.member_functions">Member
Functions</a>
</h5>
@@ -127,7 +127,7 @@
which this object was constructed.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.non_member_accessors"></a><h5>
-<a name="id1048693"></a>
+<a name="id1173531"></a>
<a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -147,7 +147,7 @@
The domain of the random variable is [0, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.accuracy"></a><h5>
-<a name="id1048792"></a>
+<a name="id1173630"></a>
<a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -155,7 +155,7 @@
Beta Distribution</a>: refer to that distribution for accuracy data.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.tests"></a><h5>
-<a name="id1048816"></a>
+<a name="id1173653"></a>
<a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.tests">Tests</a>
</h5>
<p>
@@ -164,7 +164,7 @@
Math library statistical package</a> and its pbeta and dbeta functions.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.implementation"></a><h5>
-<a name="id1048840"></a>
+<a name="id1173677"></a>
<a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.implementation">Implementation</a>
</h5>
<p>
@@ -234,8 +234,6 @@
<p>
y = x * v1 / v2
</p>
- <p>
- </p>
</td>
</tr>
<tr>
@@ -258,8 +256,6 @@
<p>
y = x * v1 / v2
</p>
- <p>
- </p>
</td>
</tr>
<tr>
@@ -290,8 +286,6 @@
<p>
is the noncentral beta quantile.
</p>
- <p>
- </p>
</td>
</tr>
<tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist"></a><a class="link" href="nc_t_dist.html" title="Noncentral T Distribution"> Noncentral
+<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist"></a><a class="link" href="nc_t_dist.html" title="Noncentral T Distribution">Noncentral
T Distribution</a>
</h5></div></div></div>
<p>
@@ -85,7 +85,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/nc_t_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.member_functions"></a><h5>
-<a name="id1050010"></a>
+<a name="id1175868"></a>
<a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.member_functions">Member
Functions</a>
</h5>
@@ -111,7 +111,7 @@
which this object was constructed.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.non_member_accessors"></a><h5>
-<a name="id1050149"></a>
+<a name="id1176006"></a>
<a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -131,7 +131,7 @@
The domain of the random variable is [-∞, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.accuracy"></a><h5>
-<a name="id1050249"></a>
+<a name="id1176106"></a>
<a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -141,7 +141,7 @@
one shown will have <a class="link" href="../../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.errors_in_cdf_of_the_noncentral_t_distribution"></a><p class="title"><b>Table 15. Errors In CDF of the Noncentral T Distribution</b></p>
+<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.errors_in_cdf_of_the_noncentral_t_distribution"></a><p class="title"><b>Table 18. Errors In CDF of the Noncentral T Distribution</b></p>
<div class="table-contents"><table class="table" summary="Errors In CDF of the Noncentral T Distribution">
<colgroup>
<col>
@@ -255,7 +255,7 @@
epsilon.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.tests"></a><h5>
-<a name="id1050449"></a>
+<a name="id1176299"></a>
<a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.tests">Tests</a>
</h5>
<p>
@@ -270,7 +270,7 @@
least 50 decimal places.
</p>
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.implementation"></a><h5>
-<a name="id1050468"></a>
+<a name="id1176318"></a>
<a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.implementation">Implementation</a>
</h5>
<p>
@@ -311,7 +311,7 @@
<p>
and therefore we have a means to compute either the probability or its
complement directly without the risk of cancellation error. The crossover
- criterion for choosing whether to calculate the CDF or it's complement
+ criterion for choosing whether to calculate the CDF or its complement
is the same as for the <a class="link" href="nc_beta_dist.html" title="Noncentral Beta Distribution">Noncentral
Beta Distribution</a>.
</p>
@@ -325,7 +325,7 @@
Where I<sub>x</sub><sup>'</sup>(a,b) is the derivative of the incomplete beta function.
</p>
<p>
- The quantile is calculated via the usual <a class="link" href="../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">derivative-free
+ The quantile is calculated via the usual <a class="link" href="../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">derivative-free
root-finding techniques</a>, with the initial guess taken as the quantile
of a normal approximation to the noncentral T.
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist"></a><a class="link" href="negative_binomial_dist.html" title="Negative Binomial Distribution">
- Negative Binomial Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist"></a><a class="link" href="negative_binomial_dist.html" title="Negative Binomial Distribution">Negative
+ Binomial Distribution</a>
</h5></div></div></div>
<p>
@@ -123,7 +123,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/negative_binomial_pdf_2.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.related_distributions"></a><h5>
-<a name="id1038389"></a>
+<a name="id1164279"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.related_distributions">Related
Distributions</a>
</h5>
@@ -158,10 +158,8 @@
The Poisson distribution is a special case for large successes
</p>
<p>
- poisson(λ) = lim <sub>r → ∞</sub> ​ negative_binomial(r, r / (λ + r)))
+ poisson(λ) = lim <sub>r → ∞</sub>   negative_binomial(r, r / (λ + r)))
</p>
-<p>
- </p>
<div class="caution"><table border="0" summary="Caution">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../../../../../doc/src/images/caution.png"></td>
@@ -169,43 +167,40 @@
</tr>
<tr><td align="left" valign="top">
<p>
- The Negative Binomial distribution is a discrete distribution: internally
- functions like the <code class="computeroutput"><span class="identifier">cdf</span></code>
- and <code class="computeroutput"><span class="identifier">pdf</span></code> are treated
- "as if" they are continuous functions, but in reality the
- results returned from these functions only have meaning if an integer
- value is provided for the random variate argument.
- </p>
-<p>
- The quantile function will by default return an integer result that
- has been <span class="emphasis"><em>rounded outwards</em></span>. That is to say lower
- quantiles (where the probability is less than 0.5) are rounded downward,
- and upper quantiles (where the probability is greater than 0.5) are
- rounded upwards. This behaviour ensures that if an X% quantile is
- requested, then <span class="emphasis"><em>at least</em></span> the requested coverage
- will be present in the central region, and <span class="emphasis"><em>no more than</em></span>
- the requested coverage will be present in the tails.
- </p>
-<p>
- This behaviour can be changed so that the quantile functions are
- rounded differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>. It is
- strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Quantiles of Discrete Distributions</a> before using the quantile
- function on the Negative Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
- docs</a> describe how to change the rounding policy for these
- distributions.
- </p>
+ The Negative Binomial distribution is a discrete distribution: internally,
+ functions like the <code class="computeroutput"><span class="identifier">cdf</span></code>
+ and <code class="computeroutput"><span class="identifier">pdf</span></code> are treated
+ "as if" they are continuous functions, but in reality the
+ results returned from these functions only have meaning if an integer
+ value is provided for the random variate argument.
+ </p>
+<p>
+ The quantile function will by default return an integer result that
+ has been <span class="emphasis"><em>rounded outwards</em></span>. That is to say lower
+ quantiles (where the probability is less than 0.5) are rounded downward,
+ and upper quantiles (where the probability is greater than 0.5) are
+ rounded upwards. This behaviour ensures that if an X% quantile is requested,
+ then <span class="emphasis"><em>at least</em></span> the requested coverage will be present
+ in the central region, and <span class="emphasis"><em>no more than</em></span> the requested
+ coverage will be present in the tails.
+ </p>
+<p>
+ This behaviour can be changed so that the quantile functions are rounded
+ differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>.
+ It is strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a> before using the quantile
+ function on the Negative Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
+ docs</a> describe how to change the rounding policy for these distributions.
+ </p>
</td></tr>
</table></div>
-<p>
- </p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.member_functions"></a><h5>
-<a name="id1038500"></a>
+<a name="id1164388"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.member_functions">Member
Functions</a>
</h5>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.construct"></a><h6>
-<a name="id1038513"></a>
+<a name="id1164403"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.construct">Construct</a>
</h6>
<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special">(</span><span class="identifier">RealType</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">RealType</span> <span class="identifier">p</span><span class="special">);</span>
@@ -221,7 +216,7 @@
<span class="special"><=</span> <span class="number">1</span></code>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accessors"></a><h6>
-<a name="id1038622"></a>
+<a name="id1164511"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accessors">Accessors</a>
</h6>
<pre class="programlisting"><span class="identifier">RealType</span> <span class="identifier">success_fraction</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span> <span class="comment">// successes / trials (0 <= p <= 1)
@@ -236,8 +231,13 @@
Returns the parameter <span class="emphasis"><em>r</em></span> from which this distribution
was constructed.
</p>
+<p>
+ The best method of calculation for the following functions is disputed:
+ see <a class="link" href="binomial_dist.html" title="Binomial Distribution">Binomial
+ Distribution</a> for more discussion.
+ </p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.lower_bound_on_parameter_p"></a><h6>
-<a name="id1038707"></a>
+<a name="id1164604"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.lower_bound_on_parameter_p">Lower
Bound on Parameter p</a>
</h6>
@@ -298,7 +298,7 @@
vol. 48, no3, 605-621</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.upper_bound_on_parameter_p"></a><h6>
-<a name="id1038975"></a>
+<a name="id1164871"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.upper_bound_on_parameter_p">Upper
Bound on Parameter p</a>
</h6>
@@ -358,7 +358,7 @@
vol. 48, no3, 605-621</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_at_least_a_certain_number_of_failures"></a><h6>
-<a name="id1039239"></a>
+<a name="id1165134"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_at_least_a_certain_number_of_failures">Estimating
Number of Trials to Ensure at Least a Certain Number of Failures</a>
</h6>
@@ -409,7 +409,7 @@
probability of observing k failures or fewer.
</p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_a_maximum_number_of_failures_or_less"></a><h6>
-<a name="id1039463"></a>
+<a name="id1165602"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_a_maximum_number_of_failures_or_less">Estimating
Number of Trials to Ensure a Maximum Number of Failures or Less</a>
</h6>
@@ -457,7 +457,7 @@
probability of observing more than k failures.
</p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.non_member_accessors"></a><h5>
-<a name="id1039695"></a>
+<a name="id1165834"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -478,7 +478,7 @@
in the context of this distribution:
</p>
<div class="table">
-<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.meaning_of_the_non_member_accessors_"></a><p class="title"><b>Table 12. Meaning of the non-member accessors.</b></p>
+<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.meaning_of_the_non_member_accessors_"></a><p class="title"><b>Table 15. Meaning of the non-member accessors.</b></p>
<div class="table-contents"><table class="table" summary="Meaning of the non-member accessors.">
<colgroup>
<col>
@@ -606,7 +606,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accuracy"></a><h5>
-<a name="id1041456"></a>
+<a name="id1166348"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -616,7 +616,7 @@
please refer to these functions for information on accuracy.
</p>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.implementation"></a><h5>
-<a name="id1041482"></a>
+<a name="id1166374"></a>
<a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.implementation">Implementation</a>
</h5>
<p>
@@ -827,8 +827,6 @@
</p>
</td>
<td>
- <p>
- </p>
</td>
</tr>
<tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.normal_dist"></a><a class="link" href="normal_dist.html" title="Normal (Gaussian) Distribution"> Normal
+<a name="math_toolkit.dist.dist_ref.dists.normal_dist"></a><a class="link" href="normal_dist.html" title="Normal (Gaussian) Distribution">Normal
(Gaussian) Distribution</a>
</h5></div></div></div>
<p>
@@ -66,7 +66,7 @@
Normal Distribution</em></span>.
</p>
<p>
- Given mean μ ​ and standard deviation σ ​ it has the PDF:
+ Given mean μ  and standard deviation σ  it has the PDF:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../../equations/normal_ref1.png"></span>
@@ -79,7 +79,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/normal_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.member_functions"></a><h5>
-<a name="id1051182"></a>
+<a name="id1177031"></a>
<a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.member_functions">Member
Functions</a>
</h5>
@@ -109,7 +109,7 @@
be used generically).
</p>
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.non_member_accessors"></a><h5>
-<a name="id1051378"></a>
+<a name="id1177228"></a>
<a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -131,7 +131,7 @@
and complement cdf -∞ = 1 and +∞ = 0, if RealType permits.
</p>
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.accuracy"></a><h5>
-<a name="id1051475"></a>
+<a name="id1177325"></a>
<a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -139,7 +139,7 @@
function</a>, and as such should have very low error rates.
</p>
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.implementation"></a><h5>
-<a name="id1051500"></a>
+<a name="id1177349"></a>
<a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.pareto"></a><a class="link" href="pareto.html" title="Pareto Distribution"> Pareto
- Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.pareto"></a><a class="link" href="pareto.html" title="Pareto Distribution">Pareto Distribution</a>
</h5></div></div></div>
<p>
@@ -64,7 +63,7 @@
f(x; α, β) = αβ<sup>α</sup> / x<sup>α+ 1</sup>
</p>
<p>
- For shape parameter α ​ > 0, and scale parameter β ​ > 0. If x < β ​, the
+ For shape parameter α   > 0, and scale parameter β   > 0. If x < β  , the
pdf is zero.
</p>
<p>
@@ -87,12 +86,12 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/pareto_pdf2.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.pareto.related_distributions"></a><h5>
-<a name="id1053547"></a>
+<a name="id1178190"></a>
<a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.related_distributions">Related
distributions</a>
</h5>
<a name="math_toolkit.dist.dist_ref.dists.pareto.member_functions"></a><h5>
-<a name="id1053565"></a>
+<a name="id1178208"></a>
<a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.member_functions">Member
Functions</a>
</h5>
@@ -118,7 +117,7 @@
Returns the <span class="emphasis"><em>shape</em></span> parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.pareto.non_member_accessors"></a><h5>
-<a name="id1053733"></a>
+<a name="id1178378"></a>
<a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -138,7 +137,7 @@
The supported domain of the random variable is [scale, ∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.pareto.accuracy"></a><h5>
-<a name="id1053832"></a>
+<a name="id1178478"></a>
<a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.accuracy">Accuracy</a>
</h5>
<p>
@@ -151,12 +150,12 @@
zero) see also <a class="link" href="../../stat_tut/overview/complements.html#why_complements">why complements?</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.pareto.implementation"></a><h5>
-<a name="id1053869"></a>
+<a name="id1178515"></a>
<a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.implementation">Implementation</a>
</h5>
<p>
- In the following table α ​ is the shape parameter of the distribution, and
- β ​ is its scale parameter, <span class="emphasis"><em>x</em></span> is the random variate,
+ In the following table α   is the shape parameter of the distribution, and
+ β   is its scale parameter, <span class="emphasis"><em>x</em></span> is the random variate,
<span class="emphasis"><em>p</em></span> is the probability and its complement <span class="emphasis"><em>q
= 1-p</em></span>.
</p>
@@ -198,7 +197,7 @@
</td>
<td>
<p>
- Using the relation: cdf p = 1 - (β ​ / x)<sup>α</sup>
+ Using the relation: cdf p = 1 - (β   / x)<sup>α</sup>
</p>
</td>
</tr>
@@ -210,7 +209,7 @@
</td>
<td>
<p>
- Using the relation: q = 1 - p = -(β ​ / x)<sup>α</sup>
+ Using the relation: q = 1 - p = -(β   / x)<sup>α</sup>
</p>
</td>
</tr>
@@ -319,7 +318,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.pareto.references"></a><h5>
-<a name="id1054177"></a>
+<a name="id1178820"></a>
<a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.poisson_dist"></a><a class="link" href="poisson_dist.html" title="Poisson Distribution"> Poisson
+<a name="math_toolkit.dist.dist_ref.dists.poisson_dist"></a><a class="link" href="poisson_dist.html" title="Poisson Distribution">Poisson
Distribution</a>
</h5></div></div></div>
<p>
@@ -59,7 +59,7 @@
distribution</a> is a well-known statistical discrete distribution.
It expresses the probability of a number of events (or failures, arrivals,
occurrences ...) occurring in a fixed period of time, provided these
- events occur with a known mean rate λ ​
+ events occur with a known mean rate λ  
(events/time), and are independent
of the time since the last event.
</p>
@@ -82,8 +82,6 @@
<p>
<span class="inlinemediaobject"><img src="../../../../../graphs/poisson_pdf_1.png" align="middle"></span>
</p>
-<p>
- </p>
<div class="caution"><table border="0" summary="Caution">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../../../../../doc/src/images/caution.png"></td>
@@ -91,38 +89,34 @@
</tr>
<tr><td align="left" valign="top">
<p>
- The Poisson distribution is a discrete distribution: internally functions
- like the <code class="computeroutput"><span class="identifier">cdf</span></code> and
- <code class="computeroutput"><span class="identifier">pdf</span></code> are treated "as
- if" they are continuous functions, but in reality the results
- returned from these functions only have meaning if an integer value
- is provided for the random variate argument.
- </p>
-<p>
- The quantile function will by default return an integer result that
- has been <span class="emphasis"><em>rounded outwards</em></span>. That is to say lower
- quantiles (where the probability is less than 0.5) are rounded downward,
- and upper quantiles (where the probability is greater than 0.5) are
- rounded upwards. This behaviour ensures that if an X% quantile is
- requested, then <span class="emphasis"><em>at least</em></span> the requested coverage
- will be present in the central region, and <span class="emphasis"><em>no more than</em></span>
- the requested coverage will be present in the tails.
- </p>
-<p>
- This behaviour can be changed so that the quantile functions are
- rounded differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>. It is
- strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Quantiles of Discrete Distributions</a> before using the quantile
- function on the Poisson distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
- docs</a> describe how to change the rounding policy for these
- distributions.
- </p>
+ The Poisson distribution is a discrete distribution: internally, functions
+ like the <code class="computeroutput"><span class="identifier">cdf</span></code> and <code class="computeroutput"><span class="identifier">pdf</span></code> are treated "as if"
+ they are continuous functions, but in reality the results returned
+ from these functions only have meaning if an integer value is provided
+ for the random variate argument.
+ </p>
+<p>
+ The quantile function will by default return an integer result that
+ has been <span class="emphasis"><em>rounded outwards</em></span>. That is to say lower
+ quantiles (where the probability is less than 0.5) are rounded downward,
+ and upper quantiles (where the probability is greater than 0.5) are
+ rounded upwards. This behaviour ensures that if an X% quantile is requested,
+ then <span class="emphasis"><em>at least</em></span> the requested coverage will be present
+ in the central region, and <span class="emphasis"><em>no more than</em></span> the requested
+ coverage will be present in the tails.
+ </p>
+<p>
+ This behaviour can be changed so that the quantile functions are rounded
+ differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>.
+ It is strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a> before using the quantile
+ function on the Poisson distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
+ docs</a> describe how to change the rounding policy for these distributions.
+ </p>
</td></tr>
</table></div>
-<p>
- </p>
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.member_functions"></a><h5>
-<a name="id1054709"></a>
+<a name="id1179350"></a>
<a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.member_functions">Member
Functions</a>
</h5>
@@ -137,7 +131,7 @@
Returns the <span class="emphasis"><em>mean</em></span> of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.non_member_accessors"></a><h5>
-<a name="id1054798"></a>
+<a name="id1179440"></a>
<a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -157,7 +151,7 @@
The domain of the random variable is [0, ∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.accuracy"></a><h5>
-<a name="id1054895"></a>
+<a name="id1179538"></a>
<a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -171,11 +165,11 @@
using an iterative method with a lower tolerance to avoid excessive computation.
</p>
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.implementation"></a><h5>
-<a name="id1054924"></a>
+<a name="id1179566"></a>
<a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.implementation">Implementation</a>
</h5>
<p>
- In the following table λ ​ is the mean of the distribution, <span class="emphasis"><em>k</em></span>
+ In the following table λ   is the mean of the distribution, <span class="emphasis"><em>k</em></span>
is the random variable, <span class="emphasis"><em>p</em></span> is the probability and
<span class="emphasis"><em>q = 1-p</em></span>.
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.rayleigh"></a><a class="link" href="rayleigh.html" title="Rayleigh Distribution"> Rayleigh
+<a name="math_toolkit.dist.dist_ref.dists.rayleigh"></a><a class="link" href="rayleigh.html" title="Rayleigh Distribution">Rayleigh
Distribution</a>
</h5></div></div></div>
<p>
@@ -64,7 +64,7 @@
f(x; sigma) = x * exp(-x<sup>2</sup>/2 σ<sup>2</sup>) / σ<sup>2</sup>
</p>
<p>
- For sigma parameter σ ​ > 0, and x > 0.
+ For sigma parameter σ   > 0, and x > 0.
</p>
<p>
The Rayleigh distribution is often used where two orthogonal components
@@ -86,7 +86,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/rayleigh_cdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.related_distributions"></a><h5>
-<a name="id1056490"></a>
+<a name="id1180720"></a>
<a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.related_distributions">Related
distributions</a>
</h5>
@@ -102,7 +102,7 @@
distribution</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.member_functions"></a><h5>
-<a name="id1056541"></a>
+<a name="id1180772"></a>
<a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.member_functions">Member
Functions</a>
</h5>
@@ -121,7 +121,7 @@
Returns the <span class="emphasis"><em>sigma</em></span> parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.non_member_accessors"></a><h5>
-<a name="id1056644"></a>
+<a name="id1180876"></a>
<a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -141,7 +141,7 @@
The domain of the random variable is [0, max_value].
</p>
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.accuracy"></a><h5>
-<a name="id1056744"></a>
+<a name="id1180976"></a>
<a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.accuracy">Accuracy</a>
</h5>
<p>
@@ -151,11 +151,11 @@
using NTL RR type with 150-bit accuracy, about 50 decimal digits.
</p>
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.implementation"></a><h5>
-<a name="id1056778"></a>
+<a name="id1181009"></a>
<a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.implementation">Implementation</a>
</h5>
<p>
- In the following table σ ​ is the sigma parameter of the distribution, <span class="emphasis"><em>x</em></span>
+ In the following table σ   is the sigma parameter of the distribution, <span class="emphasis"><em>x</em></span>
is the random variate, <span class="emphasis"><em>p</em></span> is the probability and
<span class="emphasis"><em>q = 1-p</em></span>.
</p>
@@ -197,7 +197,7 @@
</td>
<td>
<p>
- Using the relation: p = 1 - exp(-x<sup>2</sup>/2) σ<sup>2</sup> ​ = -<a class="link" href="../../../special/powers/expm1.html" title="expm1">expm1</a>(-x<sup>2</sup>/2)
+ Using the relation: p = 1 - exp(-x<sup>2</sup>/2) σ<sup>2</sup>   = -<a class="link" href="../../../special/powers/expm1.html" title="expm1">expm1</a>(-x<sup>2</sup>/2)
σ<sup>2</sup>
</p>
</td>
@@ -320,7 +320,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.references"></a><h5>
-<a name="id1057114"></a>
+<a name="id1181342"></a>
<a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.students_t_dist"></a><a class="link" href="students_t_dist.html" title="Students t Distribution">
- Students t Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.students_t_dist"></a><a class="link" href="students_t_dist.html" title="Students t Distribution">Students
+ t Distribution</a>
</h5></div></div></div>
<p>
@@ -97,7 +97,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/students_t_pdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.member_functions"></a><h5>
-<a name="id1057694"></a>
+<a name="id1181923"></a>
<a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.member_functions">Member
Functions</a>
</h5>
@@ -174,7 +174,7 @@
Engineering Statistics Handbook</a>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.non_member_accessors"></a><h5>
-<a name="id1057985"></a>
+<a name="id1182214"></a>
<a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -194,7 +194,7 @@
The domain of the random variable is [-∞, +∞].
</p>
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.examples"></a><h5>
-<a name="id1058084"></a>
+<a name="id1183407"></a>
<a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.examples">Examples</a>
</h5>
<p>
@@ -202,16 +202,16 @@
are available illustrating the use of the Student's t distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.accuracy"></a><h5>
-<a name="id1058111"></a>
+<a name="id1183433"></a>
<a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.accuracy">Accuracy</a>
</h5>
<p>
The normal distribution is implemented in terms of the <a class="link" href="../../../special/sf_beta/ibeta_function.html" title="Incomplete Beta Functions">incomplete
- beta function</a> and <a class="link" href="../../../special/sf_beta/ibeta_inv_function.html" title="The Incomplete Beta Function Inverses">it's
+ beta function</a> and <a class="link" href="../../../special/sf_beta/ibeta_inv_function.html" title="The Incomplete Beta Function Inverses">its
inverses</a>, refer to accuracy data on those functions for more information.
</p>
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.implementation"></a><h5>
-<a name="id1058142"></a>
+<a name="id1183464"></a>
<a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
<link rel="prev" href="students_t_dist.html" title="Students t Distribution">
-<link rel="next" href="weibull.html" title="Weibull Distribution">
+<link rel="next" href="uniform_dist.html" title="Uniform Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,12 +20,12 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="students_t_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="weibull.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="students_t_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="uniform_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.triangular_dist"></a><a class="link" href="triangular_dist.html" title="Triangular Distribution">
- Triangular Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.triangular_dist"></a><a class="link" href="triangular_dist.html" title="Triangular Distribution">Triangular
+ Distribution</a>
</h5></div></div></div>
<p>
@@ -128,7 +128,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/triangular_cdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.member_functions"></a><h5>
-<a name="id1059337"></a>
+<a name="id1184490"></a>
<a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.member_functions">Member
Functions</a>
</h5>
@@ -163,7 +163,7 @@
(default+1).
</p>
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.non_member_accessors"></a><h5>
-<a name="id1059555"></a>
+<a name="id1184709"></a>
<a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -184,7 +184,7 @@
range is lower <= x <= upper.
</p>
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.accuracy"></a><h5>
-<a name="id1059655"></a>
+<a name="id1184808"></a>
<a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -193,7 +193,7 @@
with arguments nearing the extremes of zero and unity.
</p>
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.implementation"></a><h5>
-<a name="id1059676"></a>
+<a name="id1184830"></a>
<a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.implementation">Implementation</a>
</h5>
<p>
@@ -378,7 +378,7 @@
Calculate and plot probability distributions</a>
</p>
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.references"></a><h5>
-<a name="id1060017"></a>
+<a name="id1185162"></a>
<a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
@@ -424,7 +424,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="students_t_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="weibull.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="students_t_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="uniform_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,8 +6,8 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
-<link rel="prev" href="weibull.html" title="Weibull Distribution">
-<link rel="next" href="../dist_algorithms.html" title="Distribution Algorithms">
+<link rel="prev" href="triangular_dist.html" title="Triangular Distribution">
+<link rel="next" href="weibull_dist.html" title="Weibull Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="weibull.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../dist_algorithms.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="triangular_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="weibull_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.uniform_dist"></a><a class="link" href="uniform_dist.html" title="Uniform Distribution"> Uniform
+<a name="math_toolkit.dist.dist_ref.dists.uniform_dist"></a><a class="link" href="uniform_dist.html" title="Uniform Distribution">Uniform
Distribution</a>
</h5></div></div></div>
<p>
@@ -117,7 +117,7 @@
<span class="inlinemediaobject"><img src="../../../../../graphs/uniform_cdf.png" align="middle"></span>
</p>
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.member_functions"></a><h5>
-<a name="id1063915"></a>
+<a name="id1186828"></a>
<a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.member_functions">Member
Functions</a>
</h5>
@@ -144,7 +144,7 @@
Returns the <span class="emphasis"><em>upper</em></span> parameter of this distribution.
</p>
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.non_member_accessors"></a><h5>
-<a name="id1064080"></a>
+<a name="id1186995"></a>
<a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.non_member_accessors">Non-member
Accessors</a>
</h5>
@@ -165,7 +165,7 @@
range is only <span class="emphasis"><em>lower</em></span> <= x <= <span class="emphasis"><em>upper</em></span>.
</p>
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.accuracy"></a><h5>
-<a name="id1064185"></a>
+<a name="id1187099"></a>
<a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.accuracy">Accuracy</a>
</h5>
<p>
@@ -173,7 +173,7 @@
and so should have errors within an epsilon or two.
</p>
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.implementation"></a><h5>
-<a name="id1064204"></a>
+<a name="id1187118"></a>
<a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.implementation">Implementation</a>
</h5>
<p>
@@ -337,7 +337,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.references"></a><h5>
-<a name="id1064482"></a>
+<a name="id1187394"></a>
<a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
@@ -367,7 +367,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="weibull.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../dist_algorithms.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="triangular_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="weibull_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
+++ (empty file)
@@ -1,373 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Weibull Distribution</title>
-<link rel="stylesheet" href="../../../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
-<link rel="home" href="../../../../index.html" title="Math Toolkit">
-<link rel="up" href="../dists.html" title="Distributions">
-<link rel="prev" href="triangular_dist.html" title="Triangular Distribution">
-<link rel="next" href="uniform_dist.html" title="Uniform Distribution">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="triangular_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="uniform_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.weibull"></a><a class="link" href="weibull.html" title="Weibull Distribution"> Weibull
- Distribution</a>
-</h5></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">weibull</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></pre>
-<p>
- </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span> <span class="special">=</span> <span class="keyword">double</span><span class="special">,</span>
- <span class="keyword">class</span> <a class="link" href="../../../policy.html" title="Policies">Policy</a> <span class="special">=</span> <a class="link" href="../../../policy/pol_ref/pol_ref_ref.html" title="Policy Class Reference">policies::policy<></a> <span class="special">></span>
-<span class="keyword">class</span> <span class="identifier">weibull_distribution</span><span class="special">;</span>
-
-<span class="keyword">typedef</span> <span class="identifier">weibull_distribution</span><span class="special"><></span> <span class="identifier">weibull</span><span class="special">;</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../../policy.html" title="Policies">Policy</a><span class="special">></span>
-<span class="keyword">class</span> <span class="identifier">weibull_distribution</span>
-<span class="special">{</span>
-<span class="keyword">public</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="identifier">RealType</span> <span class="identifier">value_type</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">Policy</span> <span class="identifier">policy_type</span><span class="special">;</span>
- <span class="comment">// Construct:
-</span> <span class="identifier">weibull_distribution</span><span class="special">(</span><span class="identifier">RealType</span> <span class="identifier">shape</span><span class="special">,</span> <span class="identifier">RealType</span> <span class="identifier">scale</span> <span class="special">=</span> <span class="number">1</span><span class="special">)</span>
- <span class="comment">// Accessors:
-</span> <span class="identifier">RealType</span> <span class="identifier">shape</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">RealType</span> <span class="identifier">scale</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
-<span class="special">};</span>
-
-<span class="special">}}</span> <span class="comment">// namespaces
-</span></pre>
-<p>
- The <a href="http://en.wikipedia.org/wiki/Weibull_distribution" target="_top">Weibull
- distribution</a> is a continuous distribution with the <a href="http://en.wikipedia.org/wiki/Probability_density_function" target="_top">probability
- density function</a>:
- </p>
-<p>
- f(x; α, β) = (α/β) * (x / β)<sup>α - 1</sup> * e<sup>-(x/β)<sup>α</sup></sup>
- </p>
-<p>
- For shape parameter α ​ > 0, and scale parameter β ​ > 0, and x > 0.
- </p>
-<p>
- The Weibull distribution is often used in the field of failure analysis;
- in particular it can mimic distributions where the failure rate varies
- over time. If the failure rate is:
- </p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- constant over time, then α ​ = 1, suggests that items are failing from
- random events.
- </li>
-<li>
- decreases over time, then α ​ < 1, suggesting "infant mortality".
- </li>
-<li>
- increases over time, then α ​ > 1, suggesting "wear out"
- - more likely to fail as time goes by.
- </li>
-</ul></div>
-<p>
- The following graph illustrates how the PDF varies with the shape parameter
- α:
- </p>
-<p>
- <span class="inlinemediaobject"><img src="../../../../../graphs/weibull_pdf1.png" align="middle"></span>
- </p>
-<p>
- While this graph illustrates how the PDF varies with the scale parameter
- β:
- </p>
-<p>
- <span class="inlinemediaobject"><img src="../../../../../graphs/weibull_pdf2.png" align="middle"></span>
- </p>
-<a name="math_toolkit.dist.dist_ref.dists.weibull.related_distributions"></a><h5>
-<a name="id1060611"></a>
- <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.related_distributions">Related
- distributions</a>
- </h5>
-<p>
- When α ​ = 3, the <a href="http://en.wikipedia.org/wiki/Weibull_distribution" target="_top">Weibull
- distribution</a> appears similar to the <a href="http://en.wikipedia.org/wiki/Normal_distribution" target="_top">normal
- distribution</a>. When α ​ = 1, the Weibull distribution reduces to the
- <a href="http://en.wikipedia.org/wiki/Exponential_distribution" target="_top">exponential
- distribution</a>. The relationship of the types of extreme value
- distributions, of which the Weibull is but one, is discussed by <a href="http://www.worldscibooks.com/mathematics/p191.html" target="_top">Extreme Value
- Distributions, Theory and Applications Samuel Kotz & Saralees Nadarajah</a>.
- </p>
-<a name="math_toolkit.dist.dist_ref.dists.weibull.member_functions"></a><h5>
-<a name="id1060652"></a>
- <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.member_functions">Member
- Functions</a>
- </h5>
-<pre class="programlisting"><span class="identifier">weibull_distribution</span><span class="special">(</span><span class="identifier">RealType</span> <span class="identifier">shape</span><span class="special">,</span> <span class="identifier">RealType</span> <span class="identifier">scale</span> <span class="special">=</span> <span class="number">1</span><span class="special">);</span>
-</pre>
-<p>
- Constructs a <a href="http://en.wikipedia.org/wiki/Weibull_distribution" target="_top">Weibull
- distribution</a> with shape <span class="emphasis"><em>shape</em></span> and scale
- <span class="emphasis"><em>scale</em></span>.
- </p>
-<p>
- Requires that the <span class="emphasis"><em>shape</em></span> and <span class="emphasis"><em>scale</em></span>
- parameters are both greater than zero, otherwise calls <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>.
- </p>
-<pre class="programlisting"><span class="identifier">RealType</span> <span class="identifier">shape</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
-</pre>
-<p>
- Returns the <span class="emphasis"><em>shape</em></span> parameter of this distribution.
- </p>
-<pre class="programlisting"><span class="identifier">RealType</span> <span class="identifier">scale</span><span class="special">()</span><span class="keyword">const</span><span class="special">;</span>
-</pre>
-<p>
- Returns the <span class="emphasis"><em>scale</em></span> parameter of this distribution.
- </p>
-<a name="math_toolkit.dist.dist_ref.dists.weibull.non_member_accessors"></a><h5>
-<a name="id1062804"></a>
- <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.non_member_accessors">Non-member
- Accessors</a>
- </h5>
-<p>
- All the <a class="link" href="../nmp.html" title="Non-Member Properties">usual non-member
- accessor functions</a> that are generic to all distributions are supported:
- <a class="link" href="../nmp.html#math.dist.cdf">Cumulative Distribution Function</a>,
- <a class="link" href="../nmp.html#math.dist.pdf">Probability Density Function</a>, <a class="link" href="../nmp.html#math.dist.quantile">Quantile</a>, <a class="link" href="../nmp.html#math.dist.hazard">Hazard
- Function</a>, <a class="link" href="../nmp.html#math.dist.chf">Cumulative Hazard Function</a>,
- <a class="link" href="../nmp.html#math.dist.mean">mean</a>, <a class="link" href="../nmp.html#math.dist.median">median</a>,
- <a class="link" href="../nmp.html#math.dist.mode">mode</a>, <a class="link" href="../nmp.html#math.dist.variance">variance</a>,
- <a class="link" href="../nmp.html#math.dist.sd">standard deviation</a>, <a class="link" href="../nmp.html#math.dist.skewness">skewness</a>,
- <a class="link" href="../nmp.html#math.dist.kurtosis">kurtosis</a>, <a class="link" href="../nmp.html#math.dist.kurtosis_excess">kurtosis_excess</a>,
- <a class="link" href="../nmp.html#math.dist.range">range</a> and <a class="link" href="../nmp.html#math.dist.support">support</a>.
- </p>
-<p>
- The domain of the random variable is [0, ∞].
- </p>
-<a name="math_toolkit.dist.dist_ref.dists.weibull.accuracy"></a><h5>
-<a name="id1062903"></a>
- <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.accuracy">Accuracy</a>
- </h5>
-<p>
- The Weibull distribution is implemented in terms of the standard library
- <code class="computeroutput"><span class="identifier">log</span></code> and <code class="computeroutput"><span class="identifier">exp</span></code> functions plus <a class="link" href="../../../special/powers/expm1.html" title="expm1">expm1</a>
- and <a class="link" href="../../../special/powers/log1p.html" title="log1p">log1p</a> and
- as such should have very low error rates.
- </p>
-<a name="math_toolkit.dist.dist_ref.dists.weibull.implementation"></a><h5>
-<a name="id1062944"></a>
- <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.implementation">Implementation</a>
- </h5>
-<p>
- In the following table α ​ is the shape parameter of the distribution, β ​ is
- it's scale parameter, <span class="emphasis"><em>x</em></span> is the random variate,
- <span class="emphasis"><em>p</em></span> is the probability and <span class="emphasis"><em>q = 1-p</em></span>.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Function
- </p>
- </th>
-<th>
- <p>
- Implementation Notes
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- pdf
- </p>
- </td>
-<td>
- <p>
- Using the relation: pdf = αβ<sup>-α </sup>x<sup>α - 1</sup> e<sup>-(x/beta)<sup>alpha</sup></sup>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- cdf
- </p>
- </td>
-<td>
- <p>
- Using the relation: p = -<a class="link" href="../../../special/powers/expm1.html" title="expm1">expm1</a>(-(x/β)<sup>α</sup>)
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- cdf complement
- </p>
- </td>
-<td>
- <p>
- Using the relation: q = e<sup>-(x/β)<sup>α</sup></sup>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- quantile
- </p>
- </td>
-<td>
- <p>
- Using the relation: x = β * (-<a class="link" href="../../../special/powers/log1p.html" title="log1p">log1p</a>(-p))<sup>1/α</sup>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- quantile from the complement
- </p>
- </td>
-<td>
- <p>
- Using the relation: x = β * (-log(q))<sup>1/α</sup>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- mean
- </p>
- </td>
-<td>
- <p>
- β * Γ(1 + 1/α)
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- variance
- </p>
- </td>
-<td>
- <p>
- β<sup>2</sup>(Γ(1 + 2/α) - Γ<sup>2</sup>(1 + 1/α))
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- mode
- </p>
- </td>
-<td>
- <p>
- β((α - 1) / α)<sup>1/α</sup>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- skewness
- </p>
- </td>
-<td>
- <p>
- Refer to <a href="http://mathworld.wolfram.com/WeibullDistribution.html" target="_top">Weisstein,
- Eric W. "Weibull Distribution." From MathWorld--A
- Wolfram Web Resource.</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- kurtosis
- </p>
- </td>
-<td>
- <p>
- Refer to <a href="http://mathworld.wolfram.com/WeibullDistribution.html" target="_top">Weisstein,
- Eric W. "Weibull Distribution." From MathWorld--A
- Wolfram Web Resource.</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- kurtosis excess
- </p>
- </td>
-<td>
- <p>
- Refer to <a href="http://mathworld.wolfram.com/WeibullDistribution.html" target="_top">Weisstein,
- Eric W. "Weibull Distribution." From MathWorld--A
- Wolfram Web Resource.</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="math_toolkit.dist.dist_ref.dists.weibull.references"></a><h5>
-<a name="id1063272"></a>
- <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.references">References</a>
- </h5>
-<div class="itemizedlist"><ul type="disc">
-<li>
- http://en.wikipedia.org/wiki/Weibull_distribution
- </li>
-<li>
- <a href="http://mathworld.wolfram.com/WeibullDistribution.html" target="_top">Weisstein,
- Eric W. "Weibull Distribution." From MathWorld--A Wolfram
- Web Resource.</a>
- </li>
-<li>
- <a href="http://www.itl.nist.gov/div898/handbook/eda/section3/eda3668.htm" target="_top">Weibull
- in NIST Exploratory Data Analysis</a>
- </li>
-</ul></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
- Thijs van den Berg<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="triangular_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="uniform_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.dist_ref.nmp"></a><a class="link" href="nmp.html" title="Non-Member Properties"> Non-Member Properties</a>
+<a name="math_toolkit.dist.dist_ref.nmp"></a><a class="link" href="nmp.html" title="Non-Member Properties">Non-Member Properties</a>
</h4></div></div></div>
<p>
Properties that are common to all distributions are accessed via non-member
@@ -36,10 +36,9 @@
<a class="link" href="nmp.html#function_index">function index</a> to go straight to
the function you want if you already know its name.
</p>
-<a name="function_index"></a><a name="math_toolkit.dist.dist_ref.nmp.function_index"></a><h5>
-<a name="id1001827"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.function_index">Function
- Index</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__function_index____function_index"></a><h5>
+<a name="id1118706"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__function_index____function_index"><a name="function_index"></a> Function Index</a>
</h5>
<div class="itemizedlist"><ul type="disc">
<li>
@@ -94,10 +93,9 @@
<a class="link" href="nmp.html#math.dist.variance">variance</a>.
</li>
</ul></div>
-<a name="concept_index"></a><a name="math_toolkit.dist.dist_ref.nmp.conceptual_index"></a><h5>
-<a name="id1002051"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.conceptual_index">Conceptual
- Index</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__concept_index____conceptual_index"></a><h5>
+<a name="id1118929"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__concept_index____conceptual_index"><a name="concept_index"></a> Conceptual Index</a>
</h5>
<div class="itemizedlist"><ul type="disc">
<li>
@@ -181,10 +179,9 @@
<a class="link" href="nmp.html#math.dist.variance">variance</a>.
</li>
</ul></div>
-<a name="math.dist.cdf"></a><a name="math_toolkit.dist.dist_ref.nmp.cumulative_distribution_function"></a><h5>
-<a name="id1002387"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.cumulative_distribution_function">Cumulative
- Distribution Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_cdf____cumulative_distribution_function"></a><h5>
+<a name="id1119260"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_cdf____cumulative_distribution_function"><a name="math.dist.cdf"></a> Cumulative Distribution Function</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">cdf</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
@@ -205,10 +202,9 @@
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/cdf.png" alt="cdf"></span>
</p>
-<a name="math.dist.ccdf"></a><a name="math_toolkit.dist.dist_ref.nmp.complement_of_the_cumulative_distribution_function"></a><h5>
-<a name="id1002558"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.complement_of_the_cumulative_distribution_function">Complement
- of the Cumulative Distribution Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_ccdf____complement_of_the_cumulative_distribution_function"></a><h5>
+<a name="id1119427"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_ccdf____complement_of_the_cumulative_distribution_function"><a name="math.dist.ccdf"></a> Complement of the Cumulative Distribution Function</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">Distribution</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">cdf</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Unspecified-Complement-Type</em></span><span class="special"><</span><span class="identifier">Distribution</span><span class="special">,</span> <span class="identifier">RealType</span><span class="special">>&</span> <span class="identifier">comp</span><span class="special">);</span>
@@ -246,9 +242,9 @@
See <a class="link" href="../stat_tut/overview/complements.html#why_complements">why complements?</a> for why the
complement is useful and when it should be used.
</p>
-<a name="math.dist.hazard"></a><a name="math_toolkit.dist.dist_ref.nmp.hazard_function"></a><h5>
-<a name="id1002847"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.hazard_function">Hazard Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_hazard____hazard_function"></a><h5>
+<a name="id1119714"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_hazard____hazard_function"><a name="math.dist.hazard"></a> Hazard Function</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">hazard</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
@@ -274,10 +270,9 @@
rather than the hazard function.
</p></td></tr>
</table></div>
-<a name="math.dist.chf"></a><a name="math_toolkit.dist.dist_ref.nmp.cumulative_hazard_function"></a><h5>
-<a name="id1003029"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.cumulative_hazard_function">Cumulative
- Hazard Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_chf____cumulative_hazard_function"></a><h5>
+<a name="id1119893"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_chf____cumulative_hazard_function"><a name="math.dist.chf"></a> Cumulative Hazard Function</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">chf</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
@@ -302,9 +297,9 @@
Some authors refer to this as simply the "Hazard Function".
</p></td></tr>
</table></div>
-<a name="math.dist.mean"></a><a name="math_toolkit.dist.dist_ref.nmp.mean"></a><h5>
-<a name="id1003212"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.mean">mean</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_mean____mean"></a><h5>
+<a name="id1120072"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_mean____mean"><a name="math.dist.mean"></a> mean</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">mean</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -317,9 +312,9 @@
if the distribution does not have a defined mean (for example the Cauchy
distribution).
</p>
-<a name="math.dist.median"></a><a name="math_toolkit.dist.dist_ref.nmp.median"></a><h5>
-<a name="id1003329"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.median">median</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_median____median"></a><h5>
+<a name="id1120188"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_median____median"><a name="math.dist.median"></a> median</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">median</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -327,9 +322,9 @@
<p>
Returns the median of the distribution <span class="emphasis"><em>dist</em></span>.
</p>
-<a name="math.dist.mode"></a><a name="math_toolkit.dist.dist_ref.nmp.mode"></a><h5>
-<a name="id1003439"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.mode">mode</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_mode____mode"></a><h5>
+<a name="id1120626"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_mode____mode"><a name="math.dist.mode"></a> mode</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">mode</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -341,10 +336,9 @@
This function may return a <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
if the distribution does not have a defined mode.
</p>
-<a name="math.dist.pdf"></a><a name="math_toolkit.dist.dist_ref.nmp.probability_density_function"></a><h5>
-<a name="id1003554"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.probability_density_function">Probability
- Density Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_pdf____probability_density_function"></a><h5>
+<a name="id1120738"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_pdf____probability_density_function"><a name="math.dist.pdf"></a> Probability Density Function</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">pdf</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
@@ -370,9 +364,9 @@
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/pdf.png" alt="pdf"></span>
</p>
-<a name="math.dist.range"></a><a name="math_toolkit.dist.dist_ref.nmp.range"></a><h5>
-<a name="id1003755"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.range">Range</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_range____range"></a><h5>
+<a name="id1120903"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_range____range"><a name="math.dist.range"></a> Range</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <span class="identifier">RealType</span><span class="special">></span> <span class="identifier">range</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -380,9 +374,9 @@
<p>
Returns the valid range of the random variable over distribution <span class="emphasis"><em>dist</em></span>.
</p>
-<a name="math.dist.quantile"></a><a name="math_toolkit.dist.dist_ref.nmp.quantile"></a><h5>
-<a name="id1003891"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.quantile">Quantile</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_quantile____quantile"></a><h5>
+<a name="id1121038"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_quantile____quantile"><a name="math.dist.quantile"></a> Quantile</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">quantile</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">p</span><span class="special">);</span>
@@ -395,8 +389,9 @@
</p>
<p>
This is also known as the <span class="emphasis"><em>percent point function</em></span>,
- or a <span class="emphasis"><em>percentile</em></span>, it is also the same as calculating
- the <span class="emphasis"><em>lower critical value</em></span> of a distribution.
+ or <span class="emphasis"><em>percentile</em></span>, or <span class="emphasis"><em>fractile</em></span>, it
+ is also the same as calculating the <span class="emphasis"><em>lower critical value</em></span>
+ of a distribution.
</p>
<p>
This function returns a <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
@@ -409,13 +404,12 @@
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/quantile.png" alt="quantile"></span>
</p>
-<a name="math.dist.quantile_c"></a><a name="math_toolkit.dist.dist_ref.nmp.quantile_from_the_complement_of_the_probability_"></a><h5>
-<a name="id1004114"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.quantile_from_the_complement_of_the_probability_">Quantile
- from the complement of the probability.</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_quantile_c____quantile_from_the_complement_of_the_probability_"></a><h5>
+<a name="id1121263"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_quantile_c____quantile_from_the_complement_of_the_probability_"><a name="math.dist.quantile_c"></a> Quantile from the complement of the probability.</a>
</h5>
<p>
- <a class="link" href="../stat_tut/overview.html#complements">complements</a>
+ <a class="link" href="../stat_tut/overview/complements.html#complements">complements</a>
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">Distribution</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">quantile</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Unspecified-Complement-Type</em></span><span class="special"><</span><span class="identifier">Distribution</span><span class="special">,</span> <span class="identifier">RealType</span><span class="special">>&</span> <span class="identifier">comp</span><span class="special">);</span>
@@ -455,10 +449,9 @@
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/survival_inv.png" alt="survival_inv"></span>
</p>
-<a name="math.dist.sd"></a><a name="math_toolkit.dist.dist_ref.nmp.standard_deviation"></a><h5>
-<a name="id1004455"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.standard_deviation">Standard
- Deviation</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_sd____standard_deviation"></a><h5>
+<a name="id1121603"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_sd____standard_deviation"><a name="math.dist.sd"></a> Standard Deviation</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">standard_deviation</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -470,9 +463,9 @@
This function may return a <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
if the distribution does not have a defined standard deviation.
</p>
-<a name="math.dist.support"></a><a name="math_toolkit.dist.dist_ref.nmp.support"></a><h5>
-<a name="id1004575"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.support">support</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_support____support"></a><h5>
+<a name="id1121722"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_support____support"><a name="math.dist.support"></a> support</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <span class="identifier">RealType</span><span class="special">></span> <span class="identifier">support</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -487,9 +480,9 @@
that has the cdf going from zero to unity. Outside are uninteresting zones
where the pdf is zero, and the cdf zero or unity.
</p>
-<a name="math.dist.variance"></a><a name="math_toolkit.dist.dist_ref.nmp.variance"></a><h5>
-<a name="id1004719"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.variance">Variance</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_variance____variance"></a><h5>
+<a name="id1121865"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_variance____variance"><a name="math.dist.variance"></a> Variance</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">variance</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -501,9 +494,9 @@
This function may return a <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
if the distribution does not have a defined variance.
</p>
-<a name="math.dist.skewness"></a><a name="math_toolkit.dist.dist_ref.nmp.skewness"></a><h5>
-<a name="id1004838"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.skewness">Skewness</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_skewness____skewness"></a><h5>
+<a name="id1121982"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_skewness____skewness"><a name="math.dist.skewness"></a> Skewness</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">skewness</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -515,9 +508,9 @@
This function may return a <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
if the distribution does not have a defined skewness.
</p>
-<a name="math.dist.kurtosis"></a><a name="math_toolkit.dist.dist_ref.nmp.kurtosis"></a><h5>
-<a name="id1004956"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.kurtosis">Kurtosis</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_kurtosis____kurtosis"></a><h5>
+<a name="id1122100"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_kurtosis____kurtosis"><a name="math.dist.kurtosis"></a> Kurtosis</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">kurtosis</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -527,11 +520,11 @@
<span class="emphasis"><em>dist</em></span>.
</p>
<p>
- kertosis = β<sub>2</sub> ​= μ<sub>4</sub> ​ / μ<sub>2</sub><sup>2</sup>
+ kertosis = β<sub>2</sub>  = μ<sub>4</sub>   / μ<sub>2</sub><sup>2</sup>
</p>
<p>
- Where μ<sub>i</sub> ​ is the i'th central moment of the distribution, and in particular
- μ<sub>2</sub> ​ is the variance of the distribution.
+ Where μ<sub>i</sub>   is the i'th central moment of the distribution, and in particular
+ μ<sub>2</sub>   is the variance of the distribution.
</p>
<p>
The kurtosis is a measure of the "peakedness" of a distribution.
@@ -557,10 +550,9 @@
<p>
'Proper' kurtosis can have a value from zero to + infinity.
</p>
-<a name="math.dist.kurtosis_excess"></a><a name="math_toolkit.dist.dist_ref.nmp.kurtosis_excess"></a><h5>
-<a name="id1005164"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.kurtosis_excess">Kurtosis
- excess</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_kurtosis_excess____kurtosis_excess"></a><h5>
+<a name="id1122306"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__math_dist_kurtosis_excess____kurtosis_excess"><a name="math.dist.kurtosis_excess"></a> Kurtosis excess</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
<span class="identifier">RealType</span> <span class="identifier">kurtosis_excess</span><span class="special">(</span><span class="keyword">const</span> <span class="emphasis"><em>Distribution-Type</em></span><span class="special"><</span><span class="identifier">RealType</span><span class="special">,</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">>&</span> <span class="identifier">dist</span><span class="special">);</span>
@@ -569,11 +561,11 @@
Returns the kurtosis excess of the distribution <span class="emphasis"><em>dist</em></span>.
</p>
<p>
- kurtosis excess = γ<sub>2</sub> ​= μ<sub>4</sub> ​ / μ<sub>2</sub><sup>2</sup> ​- 3 = kurtosis - 3
+ kurtosis excess = γ<sub>2</sub>  = μ<sub>4</sub>   / μ<sub>2</sub><sup>2</sup>  - 3 = kurtosis - 3
</p>
<p>
- Where μ<sub>i</sub> ​ is the i'th central moment of the distribution, and in particular
- μ<sub>2</sub> ​ is the variance of the distribution.
+ Where μ<sub>i</sub>   is the i'th central moment of the distribution, and in particular
+ μ<sub>2</sub>   is the variance of the distribution.
</p>
<p>
The kurtosis excess is a measure of the "peakedness" of a distribution,
@@ -592,9 +584,9 @@
<p>
The kurtosis excess of a normal distribution is zero.
</p>
-<a name="cdfPQ"></a><a name="math_toolkit.dist.dist_ref.nmp.p_and_q"></a><h5>
-<a name="id1005350"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.p_and_q">P and Q</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__cdfpq____p_and_q"></a><h5>
+<a name="id1122493"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__cdfpq____p_and_q"><a name="cdfPQ"></a> P and Q</a>
</h5>
<p>
The terms P and Q are sometimes used to refer to the <a class="link" href="nmp.html#math.dist.cdf">Cumulative
@@ -602,36 +594,32 @@
respectively. Lowercase p and q are sometimes used to refer to the values
returned by these functions.
</p>
-<a name="percent"></a><a name="math_toolkit.dist.dist_ref.nmp.percent_point_function"></a><h5>
-<a name="id1005380"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.percent_point_function">Percent
- Point Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__percent____percent_point_function_or_percentile"></a><h5>
+<a name="id1122525"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__percent____percent_point_function_or_percentile"><a name="percent"></a> Percent Point Function or Percentile</a>
</h5>
<p>
The percent point function, also known as the percentile, is the same as
the <a class="link" href="nmp.html#math.dist.quantile">Quantile</a>.
</p>
-<a name="cdf_inv"></a><a name="math_toolkit.dist.dist_ref.nmp.inverse_cdf_function_"></a><h5>
-<a name="id1005405"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.inverse_cdf_function_">Inverse
- CDF Function.</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__cdf_inv____inverse_cdf_function_"></a><h5>
+<a name="id1122549"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__cdf_inv____inverse_cdf_function_"><a name="cdf_inv"></a> Inverse CDF Function.</a>
</h5>
<p>
The inverse of the cumulative distribution function, is the same as the
<a class="link" href="nmp.html#math.dist.quantile">Quantile</a>.
</p>
-<a name="survival_inv"></a><a name="math_toolkit.dist.dist_ref.nmp.inverse_survival_function_"></a><h5>
-<a name="id1005433"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.inverse_survival_function_">Inverse
- Survival Function.</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__survival_inv____inverse_survival_function_"></a><h5>
+<a name="id1122573"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__survival_inv____inverse_survival_function_"><a name="survival_inv"></a> Inverse Survival Function.</a>
</h5>
<p>
The inverse of the survival function, is the same as computing the <a class="link" href="nmp.html#math.dist.quantile_c">quantile from the complement of the probability</a>.
</p>
-<a name="pmf"></a><a name="math_toolkit.dist.dist_ref.nmp.probability_mass_function"></a><h5>
-<a name="id1005463"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.probability_mass_function">Probability
- Mass Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__pmf____probability_mass_function"></a><h5>
+<a name="id1122597"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__pmf____probability_mass_function"><a name="pmf"></a> Probability Mass Function</a>
</h5>
<p>
The Probability Mass Function is the same as the <a class="link" href="nmp.html#math.dist.pdf">Probability
@@ -642,20 +630,18 @@
the term <a class="link" href="nmp.html#math.dist.pdf">Probability Density Function</a>
applies to continuous distributions.
</p>
-<a name="lower_critical"></a><a name="math_toolkit.dist.dist_ref.nmp.lower_critical_value_"></a><h5>
-<a name="id1005501"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.lower_critical_value_">Lower
- Critical Value.</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__lower_critical____lower_critical_value_"></a><h5>
+<a name="id1122630"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__lower_critical____lower_critical_value_"><a name="lower_critical"></a> Lower Critical Value.</a>
</h5>
<p>
The lower critical value calculates the value of the random variable given
the area under the left tail of the distribution. It is equivalent to calculating
the <a class="link" href="nmp.html#math.dist.quantile">Quantile</a>.
</p>
-<a name="upper_critical"></a><a name="math_toolkit.dist.dist_ref.nmp.upper_critical_value_"></a><h5>
-<a name="id1005526"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.upper_critical_value_">Upper
- Critical Value.</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__upper_critical____upper_critical_value_"></a><h5>
+<a name="id1122654"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__upper_critical____upper_critical_value_"><a name="upper_critical"></a> Upper Critical Value.</a>
</h5>
<p>
The upper critical value calculates the value of the random variable given
@@ -663,10 +649,9 @@
calculating the <a class="link" href="nmp.html#math.dist.quantile_c">quantile from the
complement of the probability</a>.
</p>
-<a name="survival"></a><a name="math_toolkit.dist.dist_ref.nmp.survival_function"></a><h5>
-<a name="id1005553"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.survival_function">Survival
- Function</a>
+<a name="math_toolkit.dist.dist_ref.nmp._anchor_id__survival____survival_function"></a><h5>
+<a name="id1122678"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp._anchor_id__survival____survival_function"><a name="survival"></a> Survival Function</a>
</h5>
<p>
Refer to the <a class="link" href="nmp.html#math.dist.ccdf">Complement of the Cumulative
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.dist.future"></a><a class="link" href="future.html" title="Extras/Future Directions"> Extras/Future Directions</a>
+<a name="math_toolkit.dist.future"></a><a class="link" href="future.html" title="Extras/Future Directions">Extras/Future Directions</a>
</h3></div></div></div>
<a name="math_toolkit.dist.future.adding_additional_location_and_scale_parameters"></a><h5>
-<a name="id1065718"></a>
+<a name="id1191359"></a>
<a class="link" href="future.html#math_toolkit.dist.future.adding_additional_location_and_scale_parameters">Adding
Additional Location and Scale Parameters</a>
</h5>
@@ -55,14 +55,14 @@
functions.
</p>
<a name="math_toolkit.dist.future.an__quot_any_distribution_quot__class"></a><h5>
-<a name="id1065882"></a>
+<a name="id1191523"></a>
<a class="link" href="future.html#math_toolkit.dist.future.an__quot_any_distribution_quot__class">An
"any_distribution" class</a>
</h5>
<p>
- It would be fairly trivial to add a distribution object that virtualises
- the actual type of the distribution, and can therefore hold "any"
- object that conforms to the conceptual requirements of a distribution:
+ It is easy to add a distribution object that virtualises the actual type
+ of the distribution, and can therefore hold "any" object that conforms
+ to the conceptual requirements of a distribution:
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
<span class="keyword">class</span> <span class="identifier">any_distribution</span>
@@ -79,12 +79,19 @@
</span></pre>
<p>
Such a class would facilitate the writing of non-template code that can function
- with any distribution type. It's not clear yet whether there is a compelling
- use case though. Possibly tests for goodness of fit might provide such a
- use case: this needs more investigation.
+ with any distribution type.
+ </p>
+<p>
+ The <a href="http://sourceforge.net/projects/distexplorer/" target="_top">Statistical
+ Distribution Explorer</a> utility for Windows is a usage example.
+ </p>
+<p>
+ It's not clear yet whether there is a compelling use case though. Possibly
+ tests for goodness of fit might provide such a use case: this needs more
+ investigation.
</p>
<a name="math_toolkit.dist.future.higher_level_hypothesis_tests"></a><h5>
-<a name="id1066091"></a>
+<a name="id1191744"></a>
<a class="link" href="future.html#math_toolkit.dist.future.higher_level_hypothesis_tests">Higher
Level Hypothesis Tests</a>
</h5>
@@ -104,7 +111,7 @@
<span class="emphasis"><em>expected_mean</em></span>.
</p>
<a name="math_toolkit.dist.future.integration_with_statistical_accumulators"></a><h5>
-<a name="id1066253"></a>
+<a name="id1191905"></a>
<a class="link" href="future.html#math_toolkit.dist.future.integration_with_statistical_accumulators">Integration
With Statistical Accumulators</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,110 +24,110 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.dist.stat_tut"></a><a class="link" href="stat_tut.html" title="Statistical Distributions Tutorial"> Statistical Distributions
+<a name="math_toolkit.dist.stat_tut"></a><a class="link" href="stat_tut.html" title="Statistical Distributions Tutorial">Statistical Distributions
Tutorial</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Overview of Distributions</span></dt>
+<dt><span class="section">Overview of Distributions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="stat_tut/overview/headers.html"> Headers
+<dt><span class="section"><a href="stat_tut/overview/headers.html">Headers
and Namespaces</a></span></dt>
-<dt><span class="section"><a href="stat_tut/overview/objects.html"> Distributions
+<dt><span class="section"><a href="stat_tut/overview/objects.html">Distributions
are Objects</a></span></dt>
-<dt><span class="section"><a href="stat_tut/overview/generic.html"> Generic
+<dt><span class="section"><a href="stat_tut/overview/generic.html">Generic
operations common to all distributions are non-member functions</a></span></dt>
-<dt><span class="section"><a href="stat_tut/overview/complements.html">
- Complements are supported too - and when to use them</a></span></dt>
-<dt><span class="section"><a href="stat_tut/overview/parameters.html">
- Parameters can be calculated</a></span></dt>
-<dt><span class="section"> Summary</span></dt>
-</dl></dd>
-<dt><span class="section"> Worked Examples</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="stat_tut/weg/dist_construct_eg.html">
- Distribution Construction Example</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/st_eg.html"> Student's
- t Distribution Examples</a></span></dt>
-<dd><dl>
-<dt><span class="section"><a href="stat_tut/weg/st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></span></dt>
+<dt><span class="section"><a href="stat_tut/overview/complements.html">Complements
+ are supported too - and when to use them</a></span></dt>
+<dt><span class="section"><a href="stat_tut/overview/parameters.html">Parameters
+ can be calculated</a></span></dt>
+<dt><span class="section">Summary</span></dt>
+</dl></dd>
+<dt><span class="section">Worked Examples</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="stat_tut/weg/dist_construct_eg.html">Distribution
+ Construction Example</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/st_eg.html">Student's t
+ Distribution Examples</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="stat_tut/weg/st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="stat_tut/weg/cs_eg.html"> Chi Squared
+<dt><span class="section"><a href="stat_tut/weg/cs_eg.html">Chi Squared
Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="stat_tut/weg/cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="stat_tut/weg/f_eg.html"> F Distribution
+<dt><span class="section"><a href="stat_tut/weg/f_eg.html">F Distribution
Examples</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/binom_eg.html"> Binomial
+<dt><span class="section"><a href="stat_tut/weg/binom_eg.html">Binomial
Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="stat_tut/weg/binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg.html"> Negative
+<dt><span class="section"><a href="stat_tut/weg/geometric_eg.html">Geometric
+ Distribution Examples</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg.html">Negative
Binomial Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="stat_tut/weg/normal_example.html"> Normal
+<dt><span class="section"><a href="stat_tut/weg/normal_example.html">Normal
Distribution Examples</a></span></dt>
-<dd><dl><dt><span class="section"><a href="stat_tut/weg/normal_example/normal_misc.html">
- Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></dd>
-<dt><span class="section"><a href="stat_tut/weg/nccs_eg.html"> Non Central
+<dd><dl><dt><span class="section"><a href="stat_tut/weg/normal_example/normal_misc.html">Some
+ Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></dd>
+<dt><span class="section"><a href="stat_tut/weg/nccs_eg.html">Non Central
Chi Squared Example</a></span></dt>
-<dd><dl><dt><span class="section"><a href="stat_tut/weg/nccs_eg/nccs_power_eg.html">
- Tables of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></dd>
-<dt><span class="section"><a href="stat_tut/weg/error_eg.html"> Error Handling
+<dd><dl><dt><span class="section"><a href="stat_tut/weg/nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></dd>
+<dt><span class="section"><a href="stat_tut/weg/error_eg.html">Error Handling
Example</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/find_eg.html"> Find Location
+<dt><span class="section"><a href="stat_tut/weg/find_eg.html">Find Location
and Scale Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="stat_tut/weg/find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></span></dt>
+<dt><span class="section"><a href="stat_tut/weg/find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="stat_tut/weg/nag_library.html"> Comparison
+<dt><span class="section"><a href="stat_tut/weg/nag_library.html">Comparison
with C, R, FORTRAN-style Free Functions</a></span></dt>
-<dt><span class="section"><a href="stat_tut/weg/c_sharp.html"> Using the
+<dt><span class="section"><a href="stat_tut/weg/c_sharp.html">Using the
Distributions from Within C#</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="stat_tut/variates.html"> Random Variates
+<dt><span class="section"><a href="stat_tut/variates.html">Random Variates
and Distribution Parameters</a></span></dt>
-<dt><span class="section"><a href="stat_tut/dist_params.html"> Discrete Probability
+<dt><span class="section"><a href="stat_tut/dist_params.html">Discrete Probability
Distributions</a></span></dt>
</dl></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.dist_params"></a><a class="link" href="dist_params.html" title="Discrete Probability Distributions"> Discrete Probability
+<a name="math_toolkit.dist.stat_tut.dist_params"></a><a class="link" href="dist_params.html" title="Discrete Probability Distributions">Discrete Probability
Distributions</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,23 +24,21 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.overview"></a><a class="link" href="overview.html" title="Overview of Distributions"> Overview of Distributions</a>
+<a name="math_toolkit.dist.stat_tut.overview"></a><a class="link" href="overview.html" title="Overview of Distributions">Overview of Distributions</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="overview/headers.html"> Headers
+<dt><span class="section"><a href="overview/headers.html">Headers
and Namespaces</a></span></dt>
-<dt><span class="section"><a href="overview/objects.html"> Distributions
+<dt><span class="section"><a href="overview/objects.html">Distributions
are Objects</a></span></dt>
-<dt><span class="section"><a href="overview/generic.html"> Generic
+<dt><span class="section"><a href="overview/generic.html">Generic
operations common to all distributions are non-member functions</a></span></dt>
-<dt><span class="section"><a href="overview/complements.html">
- Complements are supported too - and when to use them</a></span></dt>
-<dt><span class="section"><a href="overview/parameters.html">
- Parameters can be calculated</a></span></dt>
-<dt><span class="section"> Summary</span></dt>
+<dt><span class="section"><a href="overview/complements.html">Complements
+ are supported too - and when to use them</a></span></dt>
+<dt><span class="section"><a href="overview/parameters.html">Parameters
+ can be calculated</a></span></dt>
+<dt><span class="section">Summary</span></dt>
</dl></div>
-<a name="complements"></a><p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.complements"></a><a class="link" href="complements.html" title="Complements are supported too - and when to use them">
- Complements are supported too - and when to use them</a>
+<a name="math_toolkit.dist.stat_tut.overview.complements"></a><a class="link" href="complements.html" title="Complements are supported too - and when to use them">Complements
+ are supported too - and when to use them</a>
</h5></div></div></div>
-<p>
+<a name="complements"></a><p>
Often you don't want the value of the CDF, but its complement, which
is to say <code class="computeroutput"><span class="number">1</span><span class="special">-</span><span class="identifier">p</span></code> rather than <code class="computeroutput"><span class="identifier">p</span></code>.
It is tempting to calculate the CDF and subtract it from <code class="computeroutput"><span class="number">1</span></code>, but if <code class="computeroutput"><span class="identifier">p</span></code>
@@ -70,13 +70,11 @@
</tr>
<tr><td align="left" valign="top">
<p>
- </p>
-<p>
<span class="bold"><strong>Critical values are just quantiles</strong></span>
</p>
<p>
- Some texts talk about quantiles, or percentiles, others about critical
- values, the basic rule is:
+ Some texts talk about quantiles, or percentiles or fractiles, others
+ about critical values, the basic rule is:
</p>
<p>
<span class="emphasis"><em>Lower critical values</em></span> are the same as the quantile.
@@ -105,8 +103,6 @@
</p>
</td></tr>
</table></div>
-<a name="why_complements"></a><p>
- </p>
<div class="tip"><table border="0" summary="Tip">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../../../../doc/src/images/tip.png"></td>
@@ -114,9 +110,8 @@
</tr>
<tr><td align="left" valign="top">
<p>
- </p>
-<p>
- <span class="bold"><strong>Why bother with complements anyway?</strong></span>
+ <span class="bold"><strong><a name="why_complements"></a> Why bother with
+ complements anyway?</strong></span>
</p>
<p>
It's very tempting to dispense with complements, and simply subtract
@@ -186,8 +181,6 @@
This assumes that the 0.00001 value is either a constant, or can be
computed by some manner other than subtracting 0.99999 from 1.
</p>
-<p>
- </p>
</td></tr>
</table></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.generic"></a><a class="link" href="generic.html" title="Generic operations common to all distributions are non-member functions"> Generic
+<a name="math_toolkit.dist.stat_tut.overview.generic"></a><a class="link" href="generic.html" title="Generic operations common to all distributions are non-member functions">Generic
operations common to all distributions are non-member functions</a>
</h5></div></div></div>
<p>
@@ -59,8 +59,6 @@
</tr>
<tr><td align="left" valign="top">
<p>
- </p>
-<p>
<span class="bold"><strong>Random numbers that approximate Quantiles of
Distributions</strong></span>
</p>
@@ -102,8 +100,6 @@
</tr>
<tr><td align="left" valign="top">
<p>
- </p>
-<p>
<span class="bold"><strong>Random Variates and Distribution Parameters</strong></span>
</p>
<p>
@@ -194,8 +190,6 @@
</tr>
<tr><td align="left" valign="top">
<p>
- </p>
-<p>
<span class="bold"><strong>Discrete Probability Distributions</strong></span>
</p>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.headers"></a><a class="link" href="headers.html" title="Headers and Namespaces"> Headers
+<a name="math_toolkit.dist.stat_tut.overview.headers"></a><a class="link" href="headers.html" title="Headers and Namespaces">Headers
and Namespaces</a>
</h5></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.objects"></a><a class="link" href="objects.html" title="Distributions are Objects"> Distributions
+<a name="math_toolkit.dist.stat_tut.overview.objects"></a><a class="link" href="objects.html" title="Distributions are Objects">Distributions
are Objects</a>
</h5></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.parameters"></a><a class="link" href="parameters.html" title="Parameters can be calculated">
- Parameters can be calculated</a>
+<a name="math_toolkit.dist.stat_tut.overview.parameters"></a><a class="link" href="parameters.html" title="Parameters can be calculated">Parameters
+ can be calculated</a>
</h5></div></div></div>
<p>
Sometimes it's the parameters that define the distribution that you need
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.summary"></a><a class="link" href="summary.html" title="Summary"> Summary</a>
+<a name="math_toolkit.dist.stat_tut.overview.summary"></a><a class="link" href="summary.html" title="Summary">Summary</a>
</h5></div></div></div>
<div class="itemizedlist"><ul type="disc">
<li>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.variates"></a><a class="link" href="variates.html" title="Random Variates and Distribution Parameters"> Random Variates
+<a name="math_toolkit.dist.stat_tut.variates"></a><a class="link" href="variates.html" title="Random Variates and Distribution Parameters">Random Variates
and Distribution Parameters</a>
</h4></div></div></div>
<p>
@@ -51,8 +51,8 @@
</pre>
<p>
While the function <code class="computeroutput"><span class="identifier">pdf</span></code>
- has one argument specifying the distribution type (which includes it's
- parameters, if any), and a second argument for the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ has one argument specifying the distribution type (which includes its parameters,
+ if any), and a second argument for the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
variate</a>. So taking our binomial distribution example, we would
write:
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,94 +24,90 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.weg"></a><a class="link" href="weg.html" title="Worked Examples"> Worked Examples</a>
+<a name="math_toolkit.dist.stat_tut.weg"></a><a class="link" href="weg.html" title="Worked Examples">Worked Examples</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="weg/dist_construct_eg.html">
- Distribution Construction Example</a></span></dt>
-<dt><span class="section"><a href="weg/st_eg.html"> Student's
- t Distribution Examples</a></span></dt>
+<dt><span class="section"><a href="weg/dist_construct_eg.html">Distribution
+ Construction Example</a></span></dt>
+<dt><span class="section"><a href="weg/st_eg.html">Student's t
+ Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="weg/st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></span></dt>
-<dt><span class="section"><a href="weg/st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></span></dt>
-<dt><span class="section"><a href="weg/st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></span></dt>
-<dt><span class="section"><a href="weg/st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></span></dt>
-<dt><span class="section"><a href="weg/st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></span></dt>
+<dt><span class="section"><a href="weg/st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></span></dt>
+<dt><span class="section"><a href="weg/st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></span></dt>
+<dt><span class="section"><a href="weg/st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></span></dt>
+<dt><span class="section"><a href="weg/st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></span></dt>
+<dt><span class="section"><a href="weg/st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="weg/cs_eg.html"> Chi Squared
+<dt><span class="section"><a href="weg/cs_eg.html">Chi Squared
Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="weg/cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="weg/cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="weg/cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></span></dt>
+<dt><span class="section"><a href="weg/cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="weg/cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="weg/cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="weg/f_eg.html"> F Distribution
+<dt><span class="section"><a href="weg/f_eg.html">F Distribution
Examples</a></span></dt>
-<dt><span class="section"><a href="weg/binom_eg.html"> Binomial
+<dt><span class="section"><a href="weg/binom_eg.html">Binomial
Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="weg/binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></span></dt>
-<dt><span class="section"><a href="weg/binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></span></dt>
-<dt><span class="section"><a href="weg/binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></span></dt>
-<dt><span class="section"><a href="weg/binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></span></dt>
+<dt><span class="section"><a href="weg/binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></span></dt>
+<dt><span class="section"><a href="weg/binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></span></dt>
+<dt><span class="section"><a href="weg/binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="weg/binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="weg/neg_binom_eg.html"> Negative
+<dt><span class="section"><a href="weg/geometric_eg.html">Geometric
+ Distribution Examples</a></span></dt>
+<dt><span class="section"><a href="weg/neg_binom_eg.html">Negative
Binomial Distribution Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="weg/neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="weg/neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></span></dt>
-<dt><span class="section"><a href="weg/neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></span></dt>
-<dt><span class="section"><a href="weg/neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></span></dt>
+<dt><span class="section"><a href="weg/neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="weg/neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></span></dt>
+<dt><span class="section"><a href="weg/neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></span></dt>
+<dt><span class="section"><a href="weg/neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="weg/normal_example.html"> Normal
+<dt><span class="section"><a href="weg/normal_example.html">Normal
Distribution Examples</a></span></dt>
-<dd><dl><dt><span class="section"><a href="weg/normal_example/normal_misc.html">
- Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></dd>
-<dt><span class="section"><a href="weg/nccs_eg.html"> Non Central
+<dd><dl><dt><span class="section"><a href="weg/normal_example/normal_misc.html">Some
+ Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></dd>
+<dt><span class="section"><a href="weg/nccs_eg.html">Non Central
Chi Squared Example</a></span></dt>
-<dd><dl><dt><span class="section"><a href="weg/nccs_eg/nccs_power_eg.html">
- Tables of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></dd>
-<dt><span class="section"><a href="weg/error_eg.html"> Error Handling
+<dd><dl><dt><span class="section"><a href="weg/nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></dd>
+<dt><span class="section"><a href="weg/error_eg.html">Error Handling
Example</a></span></dt>
-<dt><span class="section"><a href="weg/find_eg.html"> Find Location
+<dt><span class="section"><a href="weg/find_eg.html">Find Location
and Scale Examples</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="weg/find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></span></dt>
-<dt><span class="section"><a href="weg/find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></span></dt>
-<dt><span class="section"><a href="weg/find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></span></dt>
+<dt><span class="section"><a href="weg/find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></span></dt>
+<dt><span class="section"><a href="weg/find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></span></dt>
+<dt><span class="section"><a href="weg/find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="weg/nag_library.html"> Comparison
+<dt><span class="section"><a href="weg/nag_library.html">Comparison
with C, R, FORTRAN-style Free Functions</a></span></dt>
-<dt><span class="section"><a href="weg/c_sharp.html"> Using the
+<dt><span class="section"><a href="weg/c_sharp.html">Using the
Distributions from Within C#</a></span></dt>
</dl></div>
-<p>
- </p>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,19 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg"></a><a class="link" href="binom_eg.html" title="Binomial Distribution Examples"> Binomial
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg"></a><a class="link" href="binom_eg.html" title="Binomial Distribution Examples">Binomial
Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></span></dt>
-<dt><span class="section"><a href="binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></span></dt>
-<dt><span class="section"><a href="binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></span></dt>
-<dt><span class="section"><a href="binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></span></dt>
+<dt><span class="section"><a href="binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></span></dt>
+<dt><span class="section"><a href="binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></span></dt>
+<dt><span class="section"><a href="binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></span></dt>
+<dt><span class="section"><a href="binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></span></dt>
</dl></div>
<p>
See also the reference documentation for the <a class="link" href="../../dist_ref/dists/binomial_dist.html" title="Binomial Distribution">Binomial
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,9 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_conf"></a><a class="link" href="binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for a Binomial Distribution">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_conf"></a><a class="link" href="binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for a Binomial Distribution">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a>
</h6></div></div></div>
<p>
Imagine you have a process that follows a binomial distribution: for
@@ -100,7 +99,7 @@
</p>
<p>
Please note that calculating two separate <span class="emphasis"><em>single sided bounds</em></span>,
- each with risk level α ​is not the same thing as calculating a two sided
+ each with risk level α  is not the same thing as calculating a two sided
interval. Had we calculate two single-sided intervals each with a risk
that the true value is outside the interval of α, then:
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../../index.html" title="Math Toolkit">
<link rel="up" href="../binom_eg.html" title="Binomial Distribution Examples">
<link rel="prev" href="binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for a Binomial Distribution">
-<link rel="next" href="../neg_binom_eg.html" title="Negative Binomial Distribution Examples">
+<link rel="next" href="../geometric_eg.html" title="Geometric Distribution Examples">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,12 +20,12 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="binom_conf.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../neg_binom_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="binom_conf.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../geometric_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_size_eg"></a><a class="link" href="binom_size_eg.html" title="Estimating Sample Sizes for a Binomial Distribution.">
- Estimating Sample Sizes for a Binomial Distribution.</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_size_eg"></a><a class="link" href="binom_size_eg.html" title="Estimating Sample Sizes for a Binomial Distribution.">Estimating
+ Sample Sizes for a Binomial Distribution.</a>
</h6></div></div></div>
<p>
Imagine you have a critical component that you know will fail in 1
@@ -153,7 +153,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="binom_conf.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../neg_binom_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="binom_conf.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../geometric_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,48 +24,36 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_coinflip_example"></a><a class="link" href="binomial_coinflip_example.html" title="Binomial Coin-Flipping Example">
- Binomial Coin-Flipping Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_coinflip_example"></a><a class="link" href="binomial_coinflip_example.html" title="Binomial Coin-Flipping Example">Binomial
+ Coin-Flipping Example</a>
</h6></div></div></div>
<p>
- </p>
-<p>
- An example of a <a href="http://en.wikipedia.org/wiki/Bernoulli_process" target="_top">Bernoulli
- process</a> is coin flipping. A variable in such a sequence may
- be called a Bernoulli variable.
- </p>
-<p>
- </p>
-<p>
- This example shows using the Binomial distribution to predict the
- probability of heads and tails when throwing a coin.
- </p>
-<p>
- </p>
-<p>
- The number of correct answers (say heads), X, is distributed as a
- binomial random variable with binomial distribution parameters number
- of trials (flips) n = 10 and probability (success_fraction) of getting
- a head p = 0.5 (a 'fair' coin).
- </p>
-<p>
- </p>
+ An example of a <a href="http://en.wikipedia.org/wiki/Bernoulli_process" target="_top">Bernoulli
+ process</a> is coin flipping. A variable in such a sequence may
+ be called a Bernoulli variable.
+ </p>
<p>
- (Our coin is assumed fair, but we could easily change the success_fraction
- parameter p from 0.5 to some other value to simulate an unfair coin,
- say 0.6 for one with chewing gum on the tail, so it is more likely
- to fall tails down and heads up).
- </p>
+ This example shows using the Binomial distribution to predict the probability
+ of heads and tails when throwing a coin.
+ </p>
<p>
- </p>
+ The number of correct answers (say heads), X, is distributed as a binomial
+ random variable with binomial distribution parameters number of trials
+ (flips) n = 10 and probability (success_fraction) of getting a head
+ p = 0.5 (a 'fair' coin).
+ </p>
<p>
- First we need some includes and using statements to be able to use
- the binomial distribution, some std input and output, and get started:
- </p>
+ (Our coin is assumed fair, but we could easily change the success_fraction
+ parameter p from 0.5 to some other value to simulate an unfair coin,
+ say 0.6 for one with chewing gum on the tail, so it is more likely
+ to fall tails down and heads up).
+ </p>
<p>
- </p>
+ First we need some includes and using statements to be able to use
+ the binomial distribution, some std input and output, and get started:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">binomial</span><span class="special">;</span>
@@ -81,23 +69,17 @@
<span class="keyword">try</span>
<span class="special">{</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- See note <a class="link" href="binomial_coinflip_example.html#coinflip_eg_catch">with the catch block</a>
- about why a try and catch block is always a good idea.
- </p>
-<p>
- </p>
+ </p>
<p>
- First, construct a binomial distribution with parameters success_fraction
- 1/2, and how many flips.
- </p>
+ See note <a class="link" href="binomial_coinflip_example.html#coinflip_eg_catch">with the catch block</a>
+ about why a try and catch block is always a good idea.
+ </p>
<p>
- </p>
+ First, construct a binomial distribution with parameters success_fraction
+ 1/2, and how many flips.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">const</span> <span class="keyword">double</span> <span class="identifier">success_fraction</span> <span class="special">=</span> <span class="number">0.5</span><span class="special">;</span> <span class="comment">// = 50% = 1/2 for a 'fair' coin.
</span><span class="keyword">int</span> <span class="identifier">flips</span> <span class="special">=</span> <span class="number">10</span><span class="special">;</span>
@@ -105,16 +87,12 @@
<span class="identifier">cout</span><span class="special">.</span><span class="identifier">precision</span><span class="special">(</span><span class="number">4</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Then some examples of using Binomial moments (and echoing the parameters).
- </p>
+ </p>
<p>
- </p>
+ Then some examples of using Binomial moments (and echoing the parameters).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"From "</span> <span class="special"><<</span> <span class="identifier">flips</span> <span class="special"><<</span> <span class="string">" one can expect to get on average "</span>
<span class="special"><<</span> <span class="identifier">mean</span><span class="special">(</span><span class="identifier">flip</span><span class="special">)</span> <span class="special"><<</span> <span class="string">" heads (or tails)."</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -130,141 +108,104 @@
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Skewness if success_fraction is "</span> <span class="special"><<</span> <span class="identifier">flip</span><span class="special">.</span><span class="identifier">success_fraction</span><span class="special">()</span>
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">skewness</span><span class="special">(</span><span class="identifier">flip</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// Expect zero for a 'fair' coin.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Now we show a variety of predictions on the probability of heads:
- </p>
+ </p>
<p>
- </p>
+ Now we show a variety of predictions on the probability of heads:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"For "</span> <span class="special"><<</span> <span class="identifier">flip</span><span class="special">.</span><span class="identifier">trials</span><span class="special">()</span> <span class="special"><<</span> <span class="string">" coin flips: "</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting no heads is "</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">0</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting at least one head is "</span> <span class="special"><<</span> <span class="number">1.</span> <span class="special">-</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">0</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- When we want to calculate the probability for a range or values we
- can sum the PDF's:
- </p>
+ </p>
<p>
- </p>
+ When we want to calculate the probability for a range or values we
+ can sum the PDF's:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting 0 or 1 heads is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">0</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// sum of exactly == probabilities</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Or we can use the cdf.
- </p>
+ </p>
<p>
- </p>
+ Or we can use the cdf.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting 0 or 1 (<= 1) heads is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting 9 or 10 heads is "</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">9</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">10</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Note that using
- </p>
+ </p>
<p>
- </p>
+ Note that using
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting 9 or 10 heads is "</span> <span class="special"><<</span> <span class="number">1.</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">8</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- is less accurate than using the complement
- </p>
+ </p>
<p>
- </p>
+ is less accurate than using the complement
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting 9 or 10 heads is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">8</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Since the subtraction may involve <a href="http://docs.sun.com/source/806-3568/ncg_goldberg.html" target="_top">cancellation
- error</a>, where as <code class="computeroutput"><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">8</span><span class="special">))</span></code> does not use such a subtraction
- internally, and so does not exhibit the problem.
- </p>
-<p>
- </p>
+ </p>
<p>
- To get the probability for a range of heads, we can either add the
- pdfs for each number of heads
- </p>
+ Since the subtraction may involve <a href="http://docs.sun.com/source/806-3568/ncg_goldberg.html" target="_top">cancellation
+ error</a>, where as <code class="computeroutput"><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">8</span><span class="special">))</span></code>
+ does not use such a subtraction internally, and so does not exhibit
+ the problem.
+ </p>
<p>
- </p>
+ To get the probability for a range of heads, we can either add the
+ pdfs for each number of heads
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of between 4 and 6 heads (4 or 5 or 6) is "</span>
<span class="comment">// P(X == 4) + P(X == 5) + P(X == 6)
</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">4</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">5</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- But this is probably less efficient than using the cdf
- </p>
+ </p>
<p>
- </p>
+ But this is probably less efficient than using the cdf
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of between 4 and 6 heads (4 or 5 or 6) is "</span>
<span class="comment">// P(X <= 6) - P(X <= 3) == P(X < 4)
</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">3</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Certainly for a bigger range like, 3 to 7
- </p>
+ </p>
<p>
- </p>
+ Certainly for a bigger range like, 3 to 7
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of between 3 and 7 heads (3, 4, 5, 6 or 7) is "</span>
<span class="comment">// P(X <= 7) - P(X <= 2) == P(X < 3)
</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">7</span><span class="special">)</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">flip</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Finally, print two tables of probability for the <span class="emphasis"><em>exactly</em></span>
- and <span class="emphasis"><em>at least</em></span> a number of heads.
- </p>
+ </p>
<p>
- </p>
+ Finally, print two tables of probability for the <span class="emphasis"><em>exactly</em></span>
+ and <span class="emphasis"><em>at least</em></span> a number of heads.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Print a table of probability for the exactly a number of heads.
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting exactly (==) heads"</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -288,58 +229,42 @@
<span class="special"><<</span> <span class="identifier">probability</span> <span class="special">*</span> <span class="number">100.</span> <span class="special"><<</span> <span class="string">"%"</span><span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span> <span class="comment">// for i</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- The last (0 to 10 heads) must, of course, be 100% probability.
- </p>
+ </p>
<p>
- </p>
+ The last (0 to 10 heads) must, of course, be 100% probability.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="special">}</span>
<span class="keyword">catch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span><span class="special">&</span> <span class="identifier">e</span><span class="special">)</span>
<span class="special">{</span>
<span class="comment">//</span></pre>
<p>
- </p>
-<p>
- <a name="coinflip_eg_catch"></a>
- </p>
-<p>
- It is always essential to include try & catch blocks because
- default policies are to throw exceptions on arguments that are out
- of domain or cause errors like numeric-overflow.
- </p>
-<p>
- </p>
+ </p>
<p>
- Lacking try & catch blocks, the program will abort, whereas the
- message below from the thrown exception will give some helpful clues
- as to the cause of the problem.
- </p>
+ <a name="coinflip_eg_catch"></a> It is always essential to include
+ try & catch blocks because default policies are to throw exceptions
+ on arguments that are out of domain or cause errors like numeric-overflow.
+ </p>
<p>
- </p>
+ Lacking try & catch blocks, the program will abort, whereas the
+ message below from the thrown exception will give some helpful clues
+ as to the cause of the problem.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span>
<span class="string">"\n"</span><span class="string">"Message from thrown exception was:\n "</span> <span class="special"><<</span> <span class="identifier">e</span><span class="special">.</span><span class="identifier">what</span><span class="special">()</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
See binomial_coinflip_example.cpp
for full source code, the program output looks like this:
</p>
-<p>
-
-</p>
<pre class="programlisting">Using Binomial distribution to predict how many heads and tails.
From 10 one can expect to get on average 5 heads (or tails).
Mode is 5
@@ -386,8 +311,6 @@
9 0.999 or 1 in 1.001, or 99.9%
10 1 or 1 in 1, or 100%
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,33 +24,27 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example"></a><a class="link" href="binomial_quiz_example.html" title="Binomial Quiz Example">
- Binomial Quiz Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example"></a><a class="link" href="binomial_quiz_example.html" title="Binomial Quiz Example">Binomial
+ Quiz Example</a>
</h6></div></div></div>
<p>
- </p>
-<p>
- A multiple choice test has four possible answers to each of 16 questions.
- A student guesses the answer to each question, so the probability
- of getting a correct answer on any given question is one in four,
- a quarter, 1/4, 25% or fraction 0.25. The conditions of the binomial
- experiment are assumed to be met: n = 16 questions constitute the
- trials; each question results in one of two possible outcomes (correct
- or incorrect); the probability of being correct is 0.25 and is constant
- if no knowledge about the subject is assumed; the questions are answered
- independently if the student's answer to a question in no way influences
- his/her answer to another question.
- </p>
-<p>
- </p>
-<p>
- First, we need to be able to use the binomial distribution constructor
- (and some std input/output, of course).
- </p>
+ A multiple choice test has four possible answers to each of 16 questions.
+ A student guesses the answer to each question, so the probability of
+ getting a correct answer on any given question is one in four, a quarter,
+ 1/4, 25% or fraction 0.25. The conditions of the binomial experiment
+ are assumed to be met: n = 16 questions constitute the trials; each
+ question results in one of two possible outcomes (correct or incorrect);
+ the probability of being correct is 0.25 and is constant if no knowledge
+ about the subject is assumed; the questions are answered independently
+ if the student's answer to a question in no way influences his/her
+ answer to another question.
+ </p>
<p>
- </p>
+ First, we need to be able to use the binomial distribution constructor
+ (and some std input/output, of course).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">binomial</span><span class="special">;</span>
@@ -66,50 +60,38 @@
</pre>
<p>
- </p>
-<p>
- </p>
-<p>
- The number of correct answers, X, is distributed as a binomial random
- variable with binomial distribution parameters: questions n and success
- fraction probability p. So we construct a binomial distribution:
- </p>
+ </p>
<p>
- </p>
+ The number of correct answers, X, is distributed as a binomial random
+ variable with binomial distribution parameters: questions n and success
+ fraction probability p. So we construct a binomial distribution:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">questions</span> <span class="special">=</span> <span class="number">16</span><span class="special">;</span> <span class="comment">// All the questions in the quiz.
</span><span class="keyword">int</span> <span class="identifier">answers</span> <span class="special">=</span> <span class="number">4</span><span class="special">;</span> <span class="comment">// Possible answers to each question.
</span><span class="keyword">double</span> <span class="identifier">success_fraction</span> <span class="special">=</span> <span class="number">1.</span> <span class="special">/</span> <span class="identifier">answers</span><span class="special">;</span> <span class="comment">// If a random guess, p = 1/4 = 0.25.
</span><span class="identifier">binomial</span> <span class="identifier">quiz</span><span class="special">(</span><span class="identifier">questions</span><span class="special">,</span> <span class="identifier">success_fraction</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- and display the distribution parameters we used thus:
- </p>
+ </p>
<p>
- </p>
+ and display the distribution parameters we used thus:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"In a quiz with "</span> <span class="special"><<</span> <span class="identifier">quiz</span><span class="special">.</span><span class="identifier">trials</span><span class="special">()</span>
<span class="special"><<</span> <span class="string">" questions and with a probability of guessing right of "</span>
<span class="special"><<</span> <span class="identifier">quiz</span><span class="special">.</span><span class="identifier">success_fraction</span><span class="special">()</span> <span class="special">*</span> <span class="number">100</span> <span class="special"><<</span> <span class="string">" %"</span>
<span class="special"><<</span> <span class="string">" or 1 in "</span> <span class="special"><<</span> <span class="keyword">static_cast</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="number">1.</span> <span class="special">/</span> <span class="identifier">quiz</span><span class="special">.</span><span class="identifier">success_fraction</span><span class="special">())</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Show a few probabilities of just guessing:
- </p>
+ </p>
<p>
- </p>
+ Show a few probabilities of just guessing:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting none right is "</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">0</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// 0.010023
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting exactly one right is "</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -120,10 +102,7 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting all "</span> <span class="special"><<</span> <span class="identifier">questions</span> <span class="special"><<</span> <span class="string">" answers right by chance is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">questions</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting none right is 0.0100226
Probability of getting exactly one right is 0.0534538
Probability of getting exactly two right is 0.133635
@@ -131,20 +110,13 @@
Probability of getting exactly all 16 answers right by chance is 2.32831e-010
</pre>
<p>
- </p>
-<p>
- These don't give any encouragement to guessers!
- </p>
-<p>
- </p>
-<p>
- We can tabulate the 'getting exactly right' ( == ) probabilities
- thus:
- </p>
+ These don't give any encouragement to guessers!
+ </p>
<p>
- </p>
+ We can tabulate the 'getting exactly right' ( == ) probabilities thus:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\n"</span> <span class="string">"Guessed Probability"</span> <span class="special"><<</span> <span class="identifier">right</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">successes</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">successes</span> <span class="special"><=</span> <span class="identifier">questions</span><span class="special">;</span> <span class="identifier">successes</span><span class="special">++)</span>
@@ -154,10 +126,7 @@
<span class="special">}</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Guessed Probability
0 0.0100226
1 0.0534538
@@ -178,152 +147,101 @@
16 2.32831e-010
</pre>
<p>
- </p>
-<p>
- Then we can add the probabilities of some 'exactly right' like this:
- </p>
-<p>
- </p>
+ Then we can add the probabilities of some 'exactly right' like this:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting none or one right is "</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">0</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting none or one right is 0.0634764
</pre>
<p>
- </p>
-<p>
- But if more than a couple of scores are involved, it is more convenient
- (and may be more accurate) to use the Cumulative Distribution Function
- (cdf) instead:
- </p>
-<p>
- </p>
+ But if more than a couple of scores are involved, it is more convenient
+ (and may be more accurate) to use the Cumulative Distribution Function
+ (cdf) instead:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting none or one right is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting none or one right is 0.0634764
</pre>
<p>
- </p>
-<p>
- Since the cdf is inclusive, we can get the probability of getting
- up to 10 right ( <= )
- </p>
-<p>
- </p>
+ Since the cdf is inclusive, we can get the probability of getting up
+ to 10 right ( <= )
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting <= 10 right (to fail) is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">10</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting <= 10 right (to fail) is 0.999715
</pre>
<p>
- </p>
-<p>
- To get the probability of getting 11 or more right (to pass), it
- is tempting to use
+ To get the probability of getting 11 or more right (to pass), it is
+ tempting to use
</p>
<pre class="programlisting"><span class="number">1</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">10</span><span class="special">)</span></pre>
<p>
- to get the probability of > 10
- </p>
-<p>
- </p>
+ to get the probability of > 10
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting > 10 right (to pass) is "</span> <span class="special"><<</span> <span class="number">1</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">10</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting > 10 right (to pass) is 0.000285239
</pre>
<p>
- </p>
-<p>
- But this should be resisted in favor of using the complement function.
- <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
- </p>
-<p>
- </p>
+ But this should be resisted in favor of using the complement function.
+ <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting > 10 right (to pass) is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">10</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting > 10 right (to pass) is 0.000285239
</pre>
<p>
- </p>
-<p>
- And we can check that these two, <= 10 and > 10, add up to
- unity.
- </p>
-<p>
- </p>
+ And we can check that these two, <= 10 and > 10, add up to unity.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">BOOST_ASSERT</span><span class="special">((</span><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">10</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">10</span><span class="special">)))</span> <span class="special">==</span> <span class="number">1.</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- If we want a < rather than a <= test, because the CDF is inclusive,
- we must subtract one from the score.
- </p>
+ </p>
<p>
- </p>
+ If we want a < rather than a <= test, because the CDF is inclusive,
+ we must subtract one from the score.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting less than "</span> <span class="special"><<</span> <span class="identifier">pass_score</span>
<span class="special"><<</span> <span class="string">" (< "</span> <span class="special"><<</span> <span class="identifier">pass_score</span> <span class="special"><<</span> <span class="string">") answers right by guessing is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">pass_score</span> <span class="special">-</span><span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting less than 11 (< 11) answers right by guessing is 0.999715
</pre>
<p>
- </p>
-<p>
- and similarly to get a >= rather than a > test we also need
- to subtract one from the score (and can again check the sum is unity).
- This is because if the cdf is <span class="emphasis"><em>inclusive</em></span>, then
- its complement must be <span class="emphasis"><em>exclusive</em></span> otherwise there
- would be one possible outcome counted twice!
- </p>
-<p>
- </p>
+ and similarly to get a >= rather than a > test we also need to
+ subtract one from the score (and can again check the sum is unity).
+ This is because if the cdf is <span class="emphasis"><em>inclusive</em></span>, then
+ its complement must be <span class="emphasis"><em>exclusive</em></span> otherwise there
+ would be one possible outcome counted twice!
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting at least "</span> <span class="special"><<</span> <span class="identifier">pass_score</span>
<span class="special"><<</span> <span class="string">"(>= "</span> <span class="special"><<</span> <span class="identifier">pass_score</span> <span class="special"><<</span> <span class="string">") answers right by guessing is "</span>
@@ -332,21 +250,14 @@
<span class="identifier">BOOST_ASSERT</span><span class="special">((</span><span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">pass_score</span> <span class="special">-</span><span class="number">1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">pass_score</span><span class="special">-</span><span class="number">1</span><span class="special">)))</span> <span class="special">==</span> <span class="number">1</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting at least 11 (>= 11) answers right by guessing is 0.000285239, only 1 in 3505.83
</pre>
<p>
- </p>
-<p>
- Finally we can tabulate some probabilities:
- </p>
-<p>
- </p>
+ Finally we can tabulate some probabilities:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\n"</span> <span class="string">"At most (<=)"</span><span class="string">"\n"</span><span class="string">"Guessed OK Probability"</span> <span class="special"><<</span> <span class="identifier">right</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">score</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">score</span> <span class="special"><=</span> <span class="identifier">questions</span><span class="special">;</span> <span class="identifier">score</span><span class="special">++)</span>
@@ -356,10 +267,7 @@
<span class="special">}</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">At most (<=)
Guessed OK Probability
0 0.01002259576
@@ -381,9 +289,7 @@
16 1
</pre>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\n"</span> <span class="string">"At least (>)"</span><span class="string">"\n"</span><span class="string">"Guessed OK Probability"</span> <span class="special"><<</span> <span class="identifier">right</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">score</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">score</span> <span class="special"><=</span> <span class="identifier">questions</span><span class="special">;</span> <span class="identifier">score</span><span class="special">++)</span>
@@ -392,10 +298,7 @@
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">score</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">At least (>)
Guessed OK Probability
0 0.9899774042
@@ -417,21 +320,15 @@
16 0
</pre>
<p>
- </p>
-<p>
- We now consider the probabilities of <span class="bold"><strong>ranges</strong></span>
- of correct guesses.
- </p>
-<p>
- </p>
-<p>
- First, calculate the probability of getting a range of guesses right,
- by adding the exact probabilities of each from low ... high.
- </p>
+ We now consider the probabilities of <span class="bold"><strong>ranges</strong></span>
+ of correct guesses.
+ </p>
<p>
- </p>
+ First, calculate the probability of getting a range of guesses right,
+ by adding the exact probabilities of each from low ... high.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">low</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span> <span class="comment">// Getting at least 3 right.
</span><span class="keyword">int</span> <span class="identifier">high</span> <span class="special">=</span> <span class="number">5</span><span class="special">;</span> <span class="comment">// Getting as most 5 right.
@@ -445,40 +342,26 @@
<span class="special"><<</span> <span class="identifier">low</span> <span class="special"><<</span> <span class="string">" and "</span> <span class="special"><<</span> <span class="identifier">high</span> <span class="special"><<</span> <span class="string">" answers right by guessing is "</span>
<span class="special"><<</span> <span class="identifier">sum</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// 0.61323</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting between 3 and 5 answers right by guessing is 0.6132
</pre>
<p>
- </p>
-<p>
- Or, usually better, we can use the difference of cdfs instead:
- </p>
-<p>
- </p>
+ Or, usually better, we can use the difference of cdfs instead:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting between "</span> <span class="special"><<</span> <span class="identifier">low</span> <span class="special"><<</span> <span class="string">" and "</span> <span class="special"><<</span> <span class="identifier">high</span> <span class="special"><<</span> <span class="string">" answers right by guessing is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">high</span><span class="special">)</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">low</span> <span class="special">-</span> <span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// 0.61323</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting between 3 and 5 answers right by guessing is 0.6132
</pre>
<p>
- </p>
-<p>
- And we can also try a few more combinations of high and low choices:
- </p>
-<p>
- </p>
+ And we can also try a few more combinations of high and low choices:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">low</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span> <span class="identifier">high</span> <span class="special">=</span> <span class="number">6</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting between "</span> <span class="special"><<</span> <span class="identifier">low</span> <span class="special"><<</span> <span class="string">" and "</span> <span class="special"><<</span> <span class="identifier">high</span> <span class="special"><<</span> <span class="string">" answers right by guessing is "</span>
@@ -490,32 +373,22 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of getting between "</span> <span class="special"><<</span> <span class="identifier">low</span> <span class="special"><<</span> <span class="string">" and "</span> <span class="special"><<</span> <span class="identifier">high</span> <span class="special"><<</span> <span class="string">" answers right by guessing is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">high</span><span class="special">)</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="identifier">low</span> <span class="special">-</span> <span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// 4 <= x 4 P = 0.22520</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of getting between 1 and 6 answers right by guessing is 0.9104
Probability of getting between 1 and 8 answers right by guessing is 0.9825
Probability of getting between 4 and 4 answers right by guessing is 0.2252
</pre>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments"></a><h5>
+<a name="id1063851"></a>
+ <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments">Using
+ Binomial distribution moments</a>
+ </h5>
<p>
- <a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments"></a>
- </p>
-<h5>
-<a name="id954256"></a>
- <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments">Using
- Binomial distribution moments</a>
- </h5>
-<p>
- </p>
-<p>
- Using moments of the distribution, we can say more about the spread
- of results from guessing.
- </p>
-<p>
- </p>
+ Using moments of the distribution, we can say more about the spread
+ of results from guessing.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"By guessing, on average, one can expect to get "</span> <span class="special"><<</span> <span class="identifier">mean</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">)</span> <span class="special"><<</span> <span class="string">" correct answers."</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Standard deviation is "</span> <span class="special"><<</span> <span class="identifier">standard_deviation</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -525,33 +398,23 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Mode (the most frequent) is "</span> <span class="special"><<</span> <span class="identifier">mode</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Skewness is "</span> <span class="special"><<</span> <span class="identifier">skewness</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">By guessing, on average, one can expect to get 4 correct answers.
Standard deviation is 1.732
So about 2/3 will lie within 1 standard deviation and get between 3 and 5 correct.
Mode (the most frequent) is 4
Skewness is 0.2887
</pre>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles"></a><h5>
+<a name="id1064223"></a>
+ <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles">Quantiles</a>
+ </h5>
<p>
- <a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles"></a>
- </p>
-<h5>
-<a name="id954628"></a>
- <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles">Quantiles</a>
- </h5>
-<p>
- </p>
-<p>
- The quantiles (percentiles or percentage points) for a few probability
- levels:
- </p>
-<p>
- </p>
+ The quantiles (percentiles or percentage points) for a few probability
+ levels:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quartiles "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">0.25</span><span class="special">)</span> <span class="special"><<</span> <span class="string">" to "</span>
<span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">0.25</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// Quartiles
@@ -569,16 +432,11 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"If guessing then percentiles 1 to 99% will get "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">0.01</span><span class="special">)</span>
<span class="special"><<</span> <span class="string">" to "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">0.01</span><span class="special">))</span> <span class="special"><<</span> <span class="string">" right."</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Notice that these output integral values because the default policy
- is <code class="computeroutput"><span class="identifier">integer_round_outwards</span></code>.
- </p>
+ </p>
<p>
-
-</p>
+ Notice that these output integral values because the default policy
+ is <code class="computeroutput"><span class="identifier">integer_round_outwards</span></code>.
+ </p>
<pre class="programlisting">Quartiles 2 to 5
1 standard deviation 2 to 5
Deciles 1 to 6
@@ -587,111 +445,74 @@
2 to 98% 0 to 8
</pre>
<p>
- </p>
+ Quantiles values are controlled by the <a class="link" href="../../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
+ quantile policy</a> chosen. The default is <code class="computeroutput"><span class="identifier">integer_round_outwards</span></code>,
+ so the lower quantile is rounded down, and the upper quantile is rounded
+ up.
+ </p>
<p>
- Quantiles values are controlled by the <a class="link" href="../../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
- quantile policy</a> chosen. The default is <code class="computeroutput"><span class="identifier">integer_round_outwards</span></code>,
- so the lower quantile is rounded down, and the upper quantile is
- rounded up.
- </p>
-<p>
- </p>
-<p>
- But we might believe that the real values tell us a little more -
- see <a class="link" href="../../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Discrete Quantile Policy</a>.
- </p>
-<p>
- </p>
-<p>
- We could control the policy for <span class="bold"><strong>all</strong></span>
- distributions by
- </p>
+ But we might believe that the real values tell us a little more - see
+ <a class="link" href="../../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Discrete Quantile Policy</a>.
+ </p>
<p>
-
-</p>
+ We could control the policy for <span class="bold"><strong>all</strong></span>
+ distributions by
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DISCRETE_QUANTILE_POLICY</span> <span class="identifier">real</span>
<span class="identifier">at</span> <span class="identifier">the</span> <span class="identifier">head</span> <span class="identifier">of</span> <span class="identifier">the</span> <span class="identifier">program</span> <span class="identifier">would</span> <span class="identifier">make</span> <span class="keyword">this</span> <span class="identifier">policy</span> <span class="identifier">apply</span>
</pre>
<p>
- </p>
+ to this <span class="bold"><strong>one, and only</strong></span>, translation
+ unit.
+ </p>
<p>
- #define BOOST_MATH_DISCRETE_QUANTILE_POLICY real
- </p>
+ Or we can now create a (typedef for) policy that has discrete quantiles
+ real (here avoiding any 'using namespaces ...' statements):
+ </p>
<p>
</p>
-<pre class="programlisting"><span class="identifier">at</span> <span class="identifier">the</span> <span class="identifier">head</span> <span class="identifier">of</span> <span class="identifier">the</span> <span class="identifier">program</span> <span class="identifier">would</span> <span class="identifier">make</span> <span class="keyword">this</span> <span class="identifier">policy</span> <span class="identifier">apply</span>
-</pre>
-<p>
- </p>
-<p>
- at the head of the program would make this policy apply to this
- <span class="bold"><strong>one, and only</strong></span>, translation unit.
- </p>
-<p>
- </p>
-<p>
- Or we can now create a (typedef for) policy that has discrete quantiles
- real (here avoiding any 'using namespaces ...' statements):
- </p>
-<p>
- </p>
-<p>
-
-</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">policy</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">discrete_quantile</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">real</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">integer_round_outwards</span><span class="special">;</span> <span class="comment">// Default.
</span><span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">policy</span><span class="special"><</span><span class="identifier">discrete_quantile</span><span class="special"><</span><span class="identifier">real</span><span class="special">></span> <span class="special">></span> <span class="identifier">real_quantile_policy</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<p>
- Add a custom binomial distribution called
+ Add a custom binomial distribution called
</p>
<pre class="programlisting"><span class="identifier">real_quantile_binomial</span></pre>
<p>
- that uses
+ that uses
</p>
<pre class="programlisting"><span class="identifier">real_quantile_policy</span></pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">binomial_distribution</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">,</span> <span class="identifier">real_quantile_policy</span><span class="special">></span> <span class="identifier">real_quantile_binomial</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Construct an object of this custom distribution:
- </p>
+ </p>
<p>
- </p>
+ Construct an object of this custom distribution:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">real_quantile_binomial</span> <span class="identifier">quiz_real</span><span class="special">(</span><span class="identifier">questions</span><span class="special">,</span> <span class="identifier">success_fraction</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And use this to show some quantiles - that now have real rather than
- integer values.
- </p>
+ </p>
<p>
- </p>
+ And use this to show some quantiles - that now have real rather than
+ integer values.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quartiles "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">quiz</span><span class="special">,</span> <span class="number">0.25</span><span class="special">)</span> <span class="special"><<</span> <span class="string">" to "</span>
<span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz_real</span><span class="special">,</span> <span class="number">0.25</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// Quartiles 2 to 4.6212
@@ -709,10 +530,7 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"If guessing, then percentiles 1 to 99% will get "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">quiz_real</span><span class="special">,</span> <span class="number">0.01</span><span class="special">)</span>
<span class="special"><<</span> <span class="string">" to "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">quiz_real</span><span class="special">,</span> <span class="number">0.01</span><span class="special">))</span> <span class="special"><<</span> <span class="string">" right."</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Real Quantiles
Quartiles 2 to 4.621
1 standard deviation 2.665 to 4.194
@@ -723,8 +541,6 @@
If guessing then percentiles 1 to 99% will get 0 to 7.788 right.
</pre>
<p>
- </p>
-<p>
See binomial_quiz_example.cpp
for full source code and output.
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.c_sharp"></a><a class="link" href="c_sharp.html" title="Using the Distributions from Within C#"> Using the
+<a name="math_toolkit.dist.stat_tut.weg.c_sharp"></a><a class="link" href="c_sharp.html" title="Using the Distributions from Within C#">Using the
Distributions from Within C#</a>
</h5></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,17 +24,16 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg"></a><a class="link" href="cs_eg.html" title="Chi Squared Distribution Examples"> Chi Squared
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg"></a><a class="link" href="cs_eg.html" title="Chi Squared Distribution Examples">Chi Squared
Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></span></dt>
-<dt><span class="section"><a href="cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></span></dt>
+<dt><span class="section"><a href="cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></span></dt>
+<dt><span class="section"><a href="cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals"></a><a class="link" href="chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">
- Confidence Intervals on the Standard Deviation</a>
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals"></a><a class="link" href="chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">Confidence
+ Intervals on the Standard Deviation</a>
</h6></div></div></div>
<p>
Once you have calculated the standard deviation for your data, a legitimate
@@ -139,7 +139,7 @@
is between 0.00551 and 0.00729.
</p>
<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals.confidence_intervals_as_a_function_of_the_number_of_observations"></a><h5>
-<a name="id938955"></a>
+<a name="id1048556"></a>
<a class="link" href="chi_sq_intervals.html#math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals.confidence_intervals_as_a_function_of_the_number_of_observations">Confidence
intervals as a function of the number of observations</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,9 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_size"></a><a class="link" href="chi_sq_size.html" title="Estimating the Required Sample Sizes for a Chi-Square Test for the Standard Deviation">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a>
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_size"></a><a class="link" href="chi_sq_size.html" title="Estimating the Required Sample Sizes for a Chi-Square Test for the Standard Deviation">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a>
</h6></div></div></div>
<p>
Suppose we conduct a Chi Squared test for standard deviation and the
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_test"></a><a class="link" href="chi_sq_test.html" title="Chi-Square Test for the Standard Deviation">
- Chi-Square Test for the Standard Deviation</a>
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_test"></a><a class="link" href="chi_sq_test.html" title="Chi-Square Test for the Standard Deviation">Chi-Square
+ Test for the Standard Deviation</a>
</h6></div></div></div>
<p>
We use this test to determine whether the standard deviation of a sample
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,34 +24,28 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg"></a><a class="link" href="dist_construct_eg.html" title="Distribution Construction Example">
- Distribution Construction Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg"></a><a class="link" href="dist_construct_eg.html" title="Distribution Construction Example">Distribution
+ Construction Example</a>
</h5></div></div></div>
<p>
See distribution_construction.cpp
for full source code.
</p>
<p>
- </p>
-<p>
- The structure of distributions is rather different from some other
- statistical libraries, for example in less object-oriented language
- like FORTRAN and C, that provide a few arguments to each free function.
- This library provides each distribution as a template C++ class. A
- distribution is constructed with a few arguments, and then member and
- non-member functions are used to find values of the distribution, often
- a function of a random variate.
- </p>
-<p>
- </p>
-<p>
- First we need some includes to access the negative binomial distribution
- (and the binomial, beta and gamma too).
- </p>
+ The structure of distributions is rather different from some other statistical
+ libraries, for example in less object-oriented language like FORTRAN
+ and C, that provide a few arguments to each free function. This library
+ provides each distribution as a template C++ class. A distribution is
+ constructed with a few arguments, and then member and non-member functions
+ are used to find values of the distribution, often a function of a random
+ variate.
+ </p>
<p>
- </p>
+ First we need some includes to access the negative binomial distribution
+ (and the binomial, beta and gamma too).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">negative_binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for negative_binomial_distribution
</span> <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial_distribution</span><span class="special">;</span> <span class="comment">// default type is double.
@@ -61,240 +55,167 @@
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for gamma_distribution.
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for normal_distribution.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Several examples of constructing distributions follow:
- </p>
-<p>
- </p>
+ </p>
<p>
- First, a negative binomial distribution with 8 successes and a success
- fraction 0.25, 25% or 1 in 4, is constructed like this:
- </p>
+ Several examples of constructing distributions follow:
+ </p>
<p>
- </p>
+ First, a negative binomial distribution with 8 successes and a success
+ fraction 0.25, 25% or 1 in 4, is constructed like this:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">mydist0</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- But this is inconveniently long, so we might be tempted to write
- </p>
+ </p>
<p>
- </p>
+ But this is inconveniently long, so we might be tempted to write
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- but this might risk ambiguity with names in std random so *much better
- is explicit <code class="computeroutput"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span> </code> * ... statements like
- </p>
+ </p>
<p>
- </p>
+ but this might risk ambiguity with names in std random so *much better
+ is explicit <code class="computeroutput"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span> </code> * ... statements like
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial_distribution</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- and we can still reduce typing.
- </p>
-<p>
- </p>
+ </p>
<p>
- Since the vast majority of applications use will be using double precision,
- the template argument to the distribution (RealType) defaults to type
- double, so we can also write:
- </p>
+ and we can still reduce typing.
+ </p>
<p>
- </p>
+ Since the vast majority of applications use will be using double precision,
+ the template argument to the distribution (RealType) defaults to type
+ double, so we can also write:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special"><></span> <span class="identifier">mydist9</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span> <span class="comment">// Uses default RealType = double.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- But the name "negative_binomial_distribution" is still inconveniently
- long, so for most distributions, a convenience typedef is provided,
- for example:
- </p>
+ </p>
<p>
-
-</p>
+ But the name "negative_binomial_distribution" is still inconveniently
+ long, so for most distributions, a convenience typedef is provided, for
+ example:
+ </p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">negative_binomial</span><span class="special">;</span> <span class="comment">// Reserved name of type double.
</span></pre>
-<p>
- </p>
<div class="caution"><table border="0" summary="Caution">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../../../../../doc/src/images/caution.png"></td>
<th align="left">Caution</th>
</tr>
<tr><td align="left" valign="top"><p>
- This convenience typedef is <span class="emphasis"><em>not</em></span> provided if
- a clash would occur with the name of a function: currently only "beta"
- and "gamma" fall into this category.
- </p></td></tr>
+ This convenience typedef is <span class="emphasis"><em>not</em></span> provided if a
+ clash would occur with the name of a function: currently only "beta"
+ and "gamma" fall into this category.
+ </p></td></tr>
</table></div>
<p>
- </p>
-<p>
- So, after a using statement,
- </p>
-<p>
- </p>
+ So, after a using statement,
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- we have a convenient typedef to <code class="computeroutput"><span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span></code>:
- </p>
+ </p>
<p>
- </p>
+ we have a convenient typedef to <code class="computeroutput"><span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span></code>:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">negative_binomial</span> <span class="identifier">mydist</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Some more examples using the convenience typedef:
- </p>
+ </p>
<p>
- </p>
+ Some more examples using the convenience typedef:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">negative_binomial</span> <span class="identifier">mydist10</span><span class="special">(</span><span class="number">5.</span><span class="special">,</span> <span class="number">0.4</span><span class="special">);</span> <span class="comment">// Both arguments double.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And automatic conversion takes place, so you can use integers and floats:
- </p>
+ </p>
<p>
- </p>
+ And automatic conversion takes place, so you can use integers and floats:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">negative_binomial</span> <span class="identifier">mydist11</span><span class="special">(</span><span class="number">5</span><span class="special">,</span> <span class="number">0.4</span><span class="special">);</span> <span class="comment">// Using provided typedef double, int and double arguments.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- This is probably the most common usage.
- </p>
+ </p>
<p>
- </p>
+ This is probably the most common usage.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">negative_binomial</span> <span class="identifier">mydist12</span><span class="special">(</span><span class="number">5.</span><span class="special">,</span> <span class="number">0.4F</span><span class="special">);</span> <span class="comment">// Double and float arguments.
</span><span class="identifier">negative_binomial</span> <span class="identifier">mydist13</span><span class="special">(</span><span class="number">5</span><span class="special">,</span> <span class="number">1</span><span class="special">);</span> <span class="comment">// Both arguments integer.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Similarly for most other distributions like the binomial.
- </p>
+ </p>
<p>
- </p>
+ Similarly for most other distributions like the binomial.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">binomial</span> <span class="identifier">mybinomial</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">0.5</span><span class="special">);</span> <span class="comment">// is more concise than
</span><span class="identifier">binomial_distribution</span><span class="special"><></span> <span class="identifier">mybinomd1</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">0.5</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- For cases when the typdef distribution name would clash with a math
- special function (currently only beta and gamma) the typedef is deliberately
- not provided, and the longer version of the name must be used. For
- example do not use:
- </p>
+ </p>
<p>
-
-</p>
+ For cases when the typdef distribution name would clash with a math special
+ function (currently only beta and gamma) the typedef is deliberately
+ not provided, and the longer version of the name must be used. For example
+ do not use:
+ </p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">beta</span><span class="special">;</span>
<span class="identifier">beta</span> <span class="identifier">mybetad0</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">0.5</span><span class="special">);</span> <span class="comment">// Error beta is a math FUNCTION!
</span></pre>
<p>
- </p>
-<p>
- Which produces the error messages:
- </p>
-<p>
-
-</p>
+ Which produces the error messages:
+ </p>
<pre class="programlisting">error C2146: syntax error : missing ';' before identifier 'mybetad0'
warning C4551: function call missing argument list
error C3861: 'mybetad0': identifier not found
</pre>
<p>
- </p>
-<p>
- Instead you should use:
- </p>
-<p>
- </p>
+ Instead you should use:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">beta_distribution</span><span class="special">;</span>
<span class="identifier">beta_distribution</span><span class="special"><></span> <span class="identifier">mybetad1</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">0.5</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- or for the gamma distribution:
- </p>
+ </p>
<p>
- </p>
+ or for the gamma distribution:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">gamma_distribution</span><span class="special"><></span> <span class="identifier">mygammad1</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">0.5</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We can, of course, still provide the type explicitly thus:
- </p>
+ </p>
<p>
- </p>
+ We can, of course, still provide the type explicitly thus:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Explicit double precision:
</span><span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">mydist1</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span>
@@ -317,65 +238,40 @@
<span class="comment">// Explicit long double precision:
</span><span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">long</span> <span class="keyword">double</span><span class="special">></span> <span class="identifier">mydist7</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And if you have your own RealType called MyFPType, for example NTL
- RR (an arbitrary precision type), then we can write:
- </p>
+ </p>
<p>
-
-</p>
+ And if you have your own RealType called MyFPType, for example NTL RR
+ (an arbitrary precision type), then we can write:
+ </p>
<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="identifier">MyFPType</span><span class="special">></span> <span class="identifier">mydist6</span><span class="special">(</span><span class="number">8</span><span class="special">,</span> <span class="number">1</span><span class="special">);</span> <span class="comment">// Integer arguments -> MyFPType.
</span></pre>
-<p>
- <a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_"></a>
- </p>
-<h6>
-<a name="id927637"></a>
- <a class="link" href="dist_construct_eg.html#math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_">Default
- arguments to distribution constructors.</a>
- </h6>
-<p>
- </p>
-<p>
- Note that default constructor arguments are only provided for some
- distributions. So if you wrongly assume a default argument you will
- get an error message, for example:
- </p>
-<p>
-
-</p>
+<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_"></a><h6>
+<a name="id1036922"></a>
+ <a class="link" href="dist_construct_eg.html#math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_">Default
+ arguments to distribution constructors.</a>
+ </h6>
+<p>
+ Note that default constructor arguments are only provided for some distributions.
+ So if you wrongly assume a default argument you will get an error message,
+ for example:
+ </p>
<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special"><></span> <span class="identifier">mydist8</span><span class="special">;</span>
</pre>
-<p>
-
-</p>
<pre class="programlisting">error C2512 no appropriate default constructor available.</pre>
<p>
- </p>
-<p>
- No default constructors are provided for the negative binomial, because
- it is difficult to chose any sensible default values for this distribution.
- For other distributions, like the normal distribution, it is obviously
- very useful to provide 'standard' defaults for the mean and standard
- deviation thus:
- </p>
-<p>
-
-</p>
+ No default constructors are provided for the negative binomial, because
+ it is difficult to chose any sensible default values for this distribution.
+ For other distributions, like the normal distribution, it is obviously
+ very useful to provide 'standard' defaults for the mean and standard
+ deviation thus:
+ </p>
<pre class="programlisting"><span class="identifier">normal_distribution</span><span class="special">(</span><span class="identifier">RealType</span> <span class="identifier">mean</span> <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">RealType</span> <span class="identifier">sd</span> <span class="special">=</span> <span class="number">1</span><span class="special">);</span>
</pre>
<p>
- </p>
-<p>
- So in this case we can write:
- </p>
-<p>
- </p>
+ So in this case we can write:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal</span><span class="special">;</span>
@@ -386,13 +282,9 @@
<span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
<span class="special">}</span> <span class="comment">// int main()</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- There is no useful output from this program, of course.
- </p>
+ </p>
<p>
+ There is no useful output from this program, of course.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.error_eg"></a><a class="link" href="error_eg.html" title="Error Handling Example"> Error Handling
+<a name="math_toolkit.dist.stat_tut.weg.error_eg"></a><a class="link" href="error_eg.html" title="Error Handling Example">Error Handling
Example</a>
</h5></div></div></div>
<p>
@@ -43,68 +43,43 @@
the policy.
</p>
<p>
- </p>
-<p>
- The following example demonstrates the effect of setting the macro
- BOOST_MATH_DOMAIN_ERROR_POLICY when an invalid argument is encountered.
- For the purposes of this example, we'll pass a negative degrees of
- freedom parameter to the student's t distribution.
- </p>
-<p>
- </p>
-<p>
- Since we know that this is a single file program we could just add:
- </p>
+ The following example demonstrates the effect of setting the macro BOOST_MATH_DOMAIN_ERROR_POLICY
+ when an invalid argument is encountered. For the purposes of this example,
+ we'll pass a negative degrees of freedom parameter to the student's t
+ distribution.
+ </p>
<p>
-
-</p>
+ Since we know that this is a single file program we could just add:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">ignore_error</span>
</pre>
<p>
- </p>
-<p>
- to the top of the source file to change the default policy to one that
- simply returns a NaN when a domain error occurs. Alternatively we could
- use:
- </p>
-<p>
-
-</p>
+ to the top of the source file to change the default policy to one that
+ simply returns a NaN when a domain error occurs. Alternatively we could
+ use:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">errno_on_error</span>
</pre>
<p>
- </p>
-<p>
- To ensure the <code class="computeroutput"><span class="special">::</span><span class="identifier">errno</span></code>
- is set when a domain error occurs as well as returning a NaN.
- </p>
-<p>
- </p>
-<p>
- This is safe provided the program consists of a single translation
- unit <span class="emphasis"><em>and</em></span> we place the define <span class="emphasis"><em>before</em></span>
- any #includes. Note that should we add the define after the includes
- then it will have no effect! A warning such as:
- </p>
+ To ensure the <code class="computeroutput"><span class="special">::</span><span class="identifier">errno</span></code>
+ is set when a domain error occurs as well as returning a NaN.
+ </p>
<p>
-
-</p>
+ This is safe provided the program consists of a single translation unit
+ <span class="emphasis"><em>and</em></span> we place the define <span class="emphasis"><em>before</em></span>
+ any #includes. Note that should we add the define after the includes
+ then it will have no effect! A warning such as:
+ </p>
<pre class="programlisting">warning C4005: 'BOOST_MATH_OVERFLOW_ERROR_POLICY' : macro redefinition</pre>
<p>
- </p>
-<p>
- is a certain sign that it will <span class="emphasis"><em>not</em></span> have the desired
- effect.
- </p>
-<p>
- </p>
-<p>
- We'll begin our sample program with the needed includes:
- </p>
+ is a certain sign that it will <span class="emphasis"><em>not</em></span> have the desired
+ effect.
+ </p>
<p>
- </p>
+ We'll begin our sample program with the needed includes:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Boost
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">students_t</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -116,20 +91,19 @@
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">stdexcept</span><span class="special">></span>
- <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span><span class="special">;</span></pre>
-<p>
- </p>
-<p>
- </p>
+ <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span><span class="special">;</span>
+
+<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">cstddef</span><span class="special">></span>
+ <span class="comment">// using ::errno</span></pre>
<p>
- Next we'll define the program's main() to call the student's t distribution
- with an invalid degrees of freedom parameter, the program is set up
- to handle either an exception or a NaN:
- </p>
+ </p>
<p>
- </p>
+ Next we'll define the program's main() to call the student's t distribution
+ with an invalid degrees of freedom parameter, the program is set up to
+ handle either an exception or a NaN:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -165,16 +139,11 @@
<span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
<span class="special">}</span> <span class="comment">// int main()</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Here's what the program output looks like with a default build (one
- that <span class="bold"><strong>does throw exceptions</strong></span>):
- </p>
+ </p>
<p>
-
-</p>
+ Here's what the program output looks like with a default build (one that
+ <span class="bold"><strong>does throw exceptions</strong></span>):
+ </p>
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: throw_on_error
@@ -183,52 +152,30 @@
Degrees of freedom argument is -1, but must be > 0 !
</pre>
<p>
- </p>
-<p>
- Alternatively let's build with:
- </p>
-<p>
-
-</p>
+ Alternatively let's build with:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">ignore_error</span>
</pre>
<p>
- </p>
-<p>
- Now the program output is:
- </p>
-<p>
-
-</p>
+ Now the program output is:
+ </p>
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: ignore_error
cdf returned a NaN!
</pre>
<p>
- </p>
-<p>
- And finally let's build with:
- </p>
-<p>
-
-</p>
+ And finally let's build with:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">errno_on_error</span>
</pre>
<p>
- </p>
-<p>
- Which gives the output show errno:
- </p>
-<p>
-
-</p>
+ Which gives the output show errno:
+ </p>
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: errno_on_error
cdf returned a NaN!
errno is set to: 33
</pre>
-<p>
- </p>
<div class="caution"><table border="0" summary="Caution">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../../../../../doc/src/images/caution.png"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.f_eg"></a><a class="link" href="f_eg.html" title="F Distribution Examples"> F Distribution
+<a name="math_toolkit.dist.stat_tut.weg.f_eg"></a><a class="link" href="f_eg.html" title="F Distribution Examples">F Distribution
Examples</a>
</h5></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,16 +24,16 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg"></a><a class="link" href="find_eg.html" title="Find Location and Scale Examples"> Find Location
+<a name="math_toolkit.dist.stat_tut.weg.find_eg"></a><a class="link" href="find_eg.html" title="Find Location and Scale Examples">Find Location
and Scale Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></span></dt>
-<dt><span class="section"><a href="find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></span></dt>
-<dt><span class="section"><a href="find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></span></dt>
+<dt><span class="section"><a href="find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></span></dt>
+<dt><span class="section"><a href="find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></span></dt>
+<dt><span class="section"><a href="find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,19 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg"></a><a class="link" href="find_location_eg.html" title="Find Location (Mean) Example">
- Find Location (Mean) Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg"></a><a class="link" href="find_location_eg.html" title="Find Location (Mean) Example">Find
+ Location (Mean) Example</a>
</h6></div></div></div>
<p>
- </p>
-<p>
- First we need some includes to access the normal distribution, the
- algorithms to find location (and some std output of course).
- </p>
-<p>
- </p>
+ First we need some includes to access the normal distribution, the
+ algorithms to find location (and some std output of course).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for normal_distribution
</span> <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal</span><span class="special">;</span> <span class="comment">// typedef provides default type is double.
@@ -58,34 +54,26 @@
</pre>
<p>
- </p>
-<p>
- </p>
-<p>
- For this example, we will use the standard normal distribution, with
- mean (location) zero and standard deviation (scale) unity. This is
- also the default for this implementation.
- </p>
+ </p>
<p>
- </p>
+ For this example, we will use the standard normal distribution, with
+ mean (location) zero and standard deviation (scale) unity. This is
+ also the default for this implementation.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">N01</span><span class="special">;</span> <span class="comment">// Default 'standard' normal distribution with zero mean and
</span><span class="keyword">double</span> <span class="identifier">sd</span> <span class="special">=</span> <span class="number">1.</span><span class="special">;</span> <span class="comment">// normal default standard deviation is 1.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Suppose we want to find a different normal distribution whose mean
- is shifted so that only fraction p (here 0.001 or 0.1%) are below
- a certain chosen limit (here -2, two standard deviations).
- </p>
+ </p>
<p>
- </p>
+ Suppose we want to find a different normal distribution whose mean
+ is shifted so that only fraction p (here 0.001 or 0.1%) are below a
+ certain chosen limit (here -2, two standard deviations).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">z</span> <span class="special">=</span> <span class="special">-</span><span class="number">2.</span><span class="special">;</span> <span class="comment">// z to give prob p
</span><span class="keyword">double</span> <span class="identifier">p</span> <span class="special">=</span> <span class="number">0.001</span><span class="special">;</span> <span class="comment">// only 0.1% below z
@@ -99,66 +87,44 @@
<span class="special"><<</span> <span class="string">", has "</span> <span class="special"><<</span> <span class="string">"fraction > "</span> <span class="special"><<</span> <span class="identifier">z</span>
<span class="special"><<</span> <span class="string">", p = "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">N01</span><span class="special">,</span> <span class="identifier">z</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// Note: uses complement.</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Normal distribution with mean = 0, standard deviation 1, has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0, standard deviation 1, has fraction > -2, p = 0.97725
</pre>
<p>
- </p>
-<p>
- We can now use ''find_location'' to give a new offset mean.
- </p>
-<p>
- </p>
+ We can now use ''find_location'' to give a new offset mean.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">l</span> <span class="special">=</span> <span class="identifier">find_location</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">sd</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"offset location (mean) = "</span> <span class="special"><<</span> <span class="identifier">l</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- that outputs:
- </p>
+ </p>
<p>
-
-</p>
+ that outputs:
+ </p>
<pre class="programlisting">offset location (mean) = 1.09023
</pre>
<p>
- </p>
-<p>
- showing that we need to shift the mean just over one standard deviation
- from its previous value of zero.
- </p>
-<p>
- </p>
-<p>
- Then we can check that we have achieved our objective by constructing
- a new distribution with the offset mean (but same standard deviation):
- </p>
+ showing that we need to shift the mean just over one standard deviation
+ from its previous value of zero.
+ </p>
<p>
- </p>
+ Then we can check that we have achieved our objective by constructing
+ a new distribution with the offset mean (but same standard deviation):
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">np001pc</span><span class="special">(</span><span class="identifier">l</span><span class="special">,</span> <span class="identifier">sd</span><span class="special">);</span> <span class="comment">// Same standard_deviation (scale) but with mean (location) shifted.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And re-calculating the fraction below our chosen limit.
- </p>
+ </p>
<p>
- </p>
+ And re-calculating the fraction below our chosen limit.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Normal distribution with mean = "</span> <span class="special"><<</span> <span class="identifier">l</span>
<span class="special"><<</span> <span class="string">" has "</span> <span class="special"><<</span> <span class="string">"fraction <= "</span> <span class="special"><<</span> <span class="identifier">z</span>
@@ -167,53 +133,37 @@
<span class="special"><<</span> <span class="string">" has "</span> <span class="special"><<</span> <span class="string">"fraction > "</span> <span class="special"><<</span> <span class="identifier">z</span>
<span class="special"><<</span> <span class="string">", p = "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">np001pc</span><span class="special">,</span> <span class="identifier">z</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Normal distribution with mean = 1.09023 has fraction <= -2, p = 0.001
Normal distribution with mean = 1.09023 has fraction > -2, p = 0.999
</pre>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location"></a><h5>
+<a name="id1105312"></a>
+ <a class="link" href="find_location_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location">Controlling
+ Error Handling from find_location</a>
+ </h5>
+<p>
+ We can also control the policy for handling various errors. For example,
+ we can define a new (possibly unwise) policy to ignore domain errors
+ ('bad' arguments).
+ </p>
<p>
- <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location"></a>
- </p>
-<h5>
-<a name="id988196"></a>
- <a class="link" href="find_location_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location">Controlling
- Error Handling from find_location</a>
- </h5>
-<p>
- </p>
-<p>
- We can also control the policy for handling various errors. For example,
- we can define a new (possibly unwise) policy to ignore domain errors
- ('bad' arguments).
- </p>
-<p>
- </p>
-<p>
- Unless we are using the boost::math namespace, we will need:
- </p>
-<p>
- </p>
+ Unless we are using the boost::math namespace, we will need:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">policy</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">domain_error</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">ignore_error</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Using a typedef is often convenient, especially if it is re-used,
- although it is not required, as the various examples below show.
- </p>
+ </p>
<p>
- </p>
+ Using a typedef is often convenient, especially if it is re-used, although
+ it is not required, as the various examples below show.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">policy</span><span class="special"><</span><span class="identifier">domain_error</span><span class="special"><</span><span class="identifier">ignore_error</span><span class="special">></span> <span class="special">></span> <span class="identifier">ignore_domain_policy</span><span class="special">;</span>
<span class="comment">// find_location with new policy, using typedef.
@@ -225,19 +175,15 @@
<span class="comment">// A new policy, ignoring domain errors, without using a typedef.
</span><span class="identifier">l</span> <span class="special">=</span> <span class="identifier">find_location</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">sd</span><span class="special">,</span> <span class="identifier">policy</span><span class="special"><</span><span class="identifier">domain_error</span><span class="special"><</span><span class="identifier">ignore_error</span><span class="special">></span> <span class="special">>());</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- If we want to use a probability that is the <a class="link" href="../../overview.html#complements">complement
- of our probability</a>, we should not even think of writing <code class="computeroutput"><span class="identifier">find_location</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="number">1</span> <span class="special">-</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">sd</span><span class="special">)</span></code>,
- but, <a class="link" href="../../overview/complements.html#why_complements">to avoid loss of accuracy</a>,
- use the complement version.
- </p>
+ </p>
<p>
- </p>
+ If we want to use a probability that is the <a class="link" href="../../overview/complements.html#complements">complement
+ of our probability</a>, we should not even think of writing <code class="computeroutput"><span class="identifier">find_location</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="number">1</span> <span class="special">-</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">sd</span><span class="special">)</span></code>,
+ but, <a class="link" href="../../overview/complements.html#why_complements">to avoid loss of accuracy</a>,
+ use the complement version.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">z</span> <span class="special">=</span> <span class="number">2.</span><span class="special">;</span>
<span class="keyword">double</span> <span class="identifier">q</span> <span class="special">=</span> <span class="number">0.95</span><span class="special">;</span> <span class="comment">// = 1 - p; // complement.
@@ -250,11 +196,11 @@
<span class="special"><<</span> <span class="string">"fraction > "</span> <span class="special"><<</span> <span class="identifier">z</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">np95pc</span><span class="special">,</span> <span class="identifier">z</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
- </p>
+ </p>
<p>
See find_location_example.cpp
- for full source code: the program output looks like this:
-</p>
+ for full source code: the program output looks like this:
+ </p>
<pre class="programlisting">Example: Find location (mean).
Normal distribution with mean = 0, standard deviation 1, has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0, standard deviation 1, has fraction > -2, p = 0.97725
@@ -264,8 +210,6 @@
Normal distribution with mean = 0.355146 has fraction <= 2 = 0.95
Normal distribution with mean = 0.355146 has fraction > 2 = 0.05
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,19 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg"></a><a class="link" href="find_mean_and_sd_eg.html" title="Find mean and standard deviation example">
- Find mean and standard deviation example</a>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg"></a><a class="link" href="find_mean_and_sd_eg.html" title="Find mean and standard deviation example">Find
+ mean and standard deviation example</a>
</h6></div></div></div>
<p>
- </p>
-<p>
- First we need some includes to access the normal distribution, the
- algorithms to find location and scale (and some std output of course).
- </p>
-<p>
- </p>
+ First we need some includes to access the normal distribution, the
+ algorithms to find location and scale (and some std output of course).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for normal_distribution
</span> <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal</span><span class="special">;</span> <span class="comment">// typedef provides default type is double.
@@ -59,108 +55,78 @@
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
- <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_find_location_and_find_scale_to_meet_dispensing_and_measurement_specifications"></a>
- </p>
-<h5>
-<a name="id993230"></a>
- <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_find_location_and_find_scale_to_meet_dispensing_and_measurement_specifications">Using
- find_location and find_scale to meet dispensing and measurement specifications</a>
- </h5>
-<p>
- </p>
-<p>
- Consider an example from K Krishnamoorthy, Handbook of Statistical
- Distributions with Applications, ISBN 1-58488-635-8, (2006) p 126,
- example 10.3.7.
- </p>
-<p>
- </p>
-<p>
- "A machine is set to pack 3 kg of ground beef per pack. Over
- a long period of time it is found that the average packed was 3 kg
- with a standard deviation of 0.1 kg. Assume the packing is normally
- distributed."
- </p>
-<p>
- </p>
+ </p>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_find_location_and_find_scale_to_meet_dispensing_and_measurement_specifications"></a><h5>
+<a name="id1112452"></a>
+ <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_find_location_and_find_scale_to_meet_dispensing_and_measurement_specifications">Using
+ find_location and find_scale to meet dispensing and measurement specifications</a>
+ </h5>
+<p>
+ Consider an example from K Krishnamoorthy, Handbook of Statistical
+ Distributions with Applications, ISBN 1-58488-635-8, (2006) p 126,
+ example 10.3.7.
+ </p>
<p>
- We start by constructing a normal distribution with the given parameters:
- </p>
+ "A machine is set to pack 3 kg of ground beef per pack. Over a
+ long period of time it is found that the average packed was 3 kg with
+ a standard deviation of 0.1 kg. Assume the packing is normally distributed."
+ </p>
<p>
- </p>
+ We start by constructing a normal distribution with the given parameters:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">mean</span> <span class="special">=</span> <span class="number">3.</span><span class="special">;</span> <span class="comment">// kg
</span><span class="keyword">double</span> <span class="identifier">standard_deviation</span> <span class="special">=</span> <span class="number">0.1</span><span class="special">;</span> <span class="comment">// kg
</span><span class="identifier">normal</span> <span class="identifier">packs</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We can then find the fraction (or %) of packages that weigh more
- than 3.1 kg.
- </p>
+ </p>
<p>
- </p>
+ We can then find the fraction (or %) of packages that weigh more than
+ 3.1 kg.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">max_weight</span> <span class="special">=</span> <span class="number">3.1</span><span class="special">;</span> <span class="comment">// kg
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Percentage of packs > "</span> <span class="special"><<</span> <span class="identifier">max_weight</span> <span class="special"><<</span> <span class="string">" is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">packs</span><span class="special">,</span> <span class="identifier">max_weight</span><span class="special">))</span> <span class="special">*</span> <span class="number">100.</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// P(X > 3.1)</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We might want to ensure that 95% of packs are over a minimum weight
- specification, then we want the value of the mean such that P(X <
- 2.9) = 0.05.
- </p>
-<p>
- </p>
+ </p>
<p>
- Using the mean of 3 kg, we can estimate the fraction of packs that
- fail to meet the specification of 2.9 kg.
- </p>
+ We might want to ensure that 95% of packs are over a minimum weight
+ specification, then we want the value of the mean such that P(X <
+ 2.9) = 0.05.
+ </p>
<p>
- </p>
+ Using the mean of 3 kg, we can estimate the fraction of packs that
+ fail to meet the specification of 2.9 kg.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">minimum_weight</span> <span class="special">=</span> <span class="number">2.9</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span><span class="string">"Fraction of packs <= "</span> <span class="special"><<</span> <span class="identifier">minimum_weight</span> <span class="special"><<</span> <span class="string">" with a mean of "</span> <span class="special"><<</span> <span class="identifier">mean</span>
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">packs</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// fraction of packs <= 2.9 with a mean of 3 is 0.841345</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- This is 0.84 - more than the target fraction of 0.95. If we want
- 95% to be over the minimum weight, what should we set the mean weight
- to be?
- </p>
-<p>
- </p>
-<p>
- Using the KK StatCalc program supplied with the book and the method
- given on page 126 gives 3.06449.
- </p>
+ </p>
<p>
- </p>
+ This is 0.84 - more than the target fraction of 0.95. If we want 95%
+ to be over the minimum weight, what should we set the mean weight to
+ be?
+ </p>
<p>
- We can confirm this by constructing a new distribution which we call
- 'xpacks' with a safety margin mean of 3.06449 thus:
- </p>
+ Using the KK StatCalc program supplied with the book and the method
+ given on page 126 gives 3.06449.
+ </p>
<p>
- </p>
+ We can confirm this by constructing a new distribution which we call
+ 'xpacks' with a safety margin mean of 3.06449 thus:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">over_mean</span> <span class="special">=</span> <span class="number">3.06449</span><span class="special">;</span>
<span class="identifier">normal</span> <span class="identifier">xpacks</span><span class="special">(</span><span class="identifier">over_mean</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">);</span>
@@ -169,17 +135,13 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">xpacks</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// fraction of packs >= 2.9 with a mean of 3.06449 is 0.950005</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Using this Math Toolkit, we can calculate the required mean directly
- thus:
- </p>
+ </p>
<p>
- </p>
+ Using this Math Toolkit, we can calculate the required mean directly
+ thus:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">under_fraction</span> <span class="special">=</span> <span class="number">0.05</span><span class="special">;</span> <span class="comment">// so 95% are above the minimum weight mean - sd = 2.9
</span><span class="keyword">double</span> <span class="identifier">low_limit</span> <span class="special">=</span> <span class="identifier">standard_deviation</span><span class="special">;</span>
@@ -193,94 +155,69 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">nominal_packs</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Setting the packer to 3.06449 will mean that fraction of packs >= 2.9 is 0.95</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- This calculation is generalized as the free function called <a class="link" href="../../../dist_ref/dist_algorithms.html" title="Distribution Algorithms">find_location</a>.
- </p>
-<p>
- </p>
+ </p>
<p>
- To use this we will need to
- </p>
+ This calculation is generalized as the free function called <a class="link" href="../../../dist_ref/dist_algorithms.html" title="Distribution Algorithms">find_location</a>.
+ </p>
<p>
- </p>
+ To use this we will need to
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">find_location</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">find_location</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- and then use find_location function to find safe_mean, & construct
- a new normal distribution called 'goodpacks'.
- </p>
+ </p>
<p>
- </p>
+ and then use find_location function to find safe_mean, & construct
+ a new normal distribution called 'goodpacks'.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">safe_mean</span> <span class="special">=</span> <span class="identifier">find_location</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">minimum_weight</span><span class="special">,</span> <span class="identifier">under_fraction</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">);</span>
<span class="identifier">normal</span> <span class="identifier">good_packs</span><span class="special">(</span><span class="identifier">safe_mean</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- with the same confirmation as before:
- </p>
+ </p>
<p>
- </p>
+ with the same confirmation as before:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Setting the packer to "</span> <span class="special"><<</span> <span class="identifier">nominal_mean</span> <span class="special"><<</span> <span class="string">" will mean that "</span>
<span class="special"><<</span> <span class="string">"fraction of packs >= "</span> <span class="special"><<</span> <span class="identifier">minimum_weight</span>
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">good_packs</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Setting the packer to 3.06449 will mean that fraction of packs >= 2.9 is 0.95</span></pre>
<p>
- </p>
+ </p>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_cauchy_lorentz_instead_of_normal_distribution"></a><h5>
+<a name="id1113633"></a>
+ <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_cauchy_lorentz_instead_of_normal_distribution">Using
+ Cauchy-Lorentz instead of normal distribution</a>
+ </h5>
+<p>
+ After examining the weight distribution of a large number of packs,
+ we might decide that, after all, the assumption of a normal distribution
+ is not really justified. We might find that the fit is better to a
+ <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
+ Distribution</a>. This distribution has wider 'wings', so that whereas
+ most of the values are closer to the mean than the normal, there are
+ also more values than 'normal' that lie further from the mean than
+ the normal.
+ </p>
<p>
- <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_cauchy_lorentz_instead_of_normal_distribution"></a>
- </p>
-<h5>
-<a name="id994412"></a>
- <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_cauchy_lorentz_instead_of_normal_distribution">Using
- Cauchy-Lorentz instead of normal distribution</a>
- </h5>
-<p>
- </p>
-<p>
- After examining the weight distribution of a large number of packs,
- we might decide that, after all, the assumption of a normal distribution
- is not really justified. We might find that the fit is better to
- a <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
- Distribution</a>. This distribution has wider 'wings', so that
- whereas most of the values are closer to the mean than the normal,
- there are also more values than 'normal' that lie further from the
- mean than the normal.
- </p>
-<p>
- </p>
-<p>
- This might happen because a larger than normal lump of meat is either
- included or excluded.
- </p>
-<p>
- </p>
-<p>
- We first create a <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
- Distribution</a> with the original mean and standard deviation,
- and estimate the fraction that lie below our minimum weight specification.
- </p>
+ This might happen because a larger than normal lump of meat is either
+ included or excluded.
+ </p>
<p>
- </p>
+ We first create a <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
+ Distribution</a> with the original mean and standard deviation,
+ and estimate the fraction that lie below our minimum weight specification.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cauchy</span> <span class="identifier">cpacks</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Cauchy Setting the packer to "</span> <span class="special"><<</span> <span class="identifier">mean</span> <span class="special"><<</span> <span class="string">" will mean that "</span>
@@ -288,39 +225,29 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">cpacks</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Cauchy Setting the packer to 3 will mean that fraction of packs >= 2.9 is 0.75</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Note that far fewer of the packs meet the specification, only 75%
- instead of 95%. Now we can repeat the find_location, using the cauchy
- distribution as template parameter, in place of the normal used above.
- </p>
+ </p>
<p>
- </p>
+ Note that far fewer of the packs meet the specification, only 75% instead
+ of 95%. Now we can repeat the find_location, using the cauchy distribution
+ as template parameter, in place of the normal used above.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">lc</span> <span class="special">=</span> <span class="identifier">find_location</span><span class="special"><</span><span class="identifier">cauchy</span><span class="special">>(</span><span class="identifier">minimum_weight</span><span class="special">,</span> <span class="identifier">under_fraction</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"find_location<cauchy>(minimum_weight, over fraction, standard_deviation); "</span> <span class="special"><<</span> <span class="identifier">lc</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// find_location<cauchy>(minimum_weight, over fraction, packs.standard_deviation()); 3.53138</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Note that the safe_mean setting needs to be much higher, 3.53138
- instead of 3.06449, so we will make rather less profit.
- </p>
-<p>
- </p>
+ </p>
<p>
- And again confirm that the fraction meeting specification is as expected.
- </p>
+ Note that the safe_mean setting needs to be much higher, 3.53138 instead
+ of 3.06449, so we will make rather less profit.
+ </p>
<p>
- </p>
+ And again confirm that the fraction meeting specification is as expected.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cauchy</span> <span class="identifier">goodcpacks</span><span class="special">(</span><span class="identifier">lc</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Cauchy Setting the packer to "</span> <span class="special"><<</span> <span class="identifier">lc</span> <span class="special"><<</span> <span class="string">" will mean that "</span>
@@ -328,17 +255,13 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">goodcpacks</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Cauchy Setting the packer to 3.53138 will mean that fraction of packs >= 2.9 is 0.95</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Finally we could estimate the effect of a much tighter specification,
- that 99% of packs met the specification.
- </p>
+ </p>
<p>
- </p>
+ Finally we could estimate the effect of a much tighter specification,
+ that 99% of packs met the specification.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Cauchy Setting the packer to "</span>
<span class="special"><<</span> <span class="identifier">find_location</span><span class="special"><</span><span class="identifier">cauchy</span><span class="special">>(</span><span class="identifier">minimum_weight</span><span class="special">,</span> <span class="number">0.99</span><span class="special">,</span> <span class="identifier">standard_deviation</span><span class="special">)</span>
@@ -346,114 +269,81 @@
<span class="special"><<</span> <span class="string">"fraction of packs >= "</span> <span class="special"><<</span> <span class="identifier">minimum_weight</span>
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">goodcpacks</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Setting the packer to 3.13263 will mean that fraction of packs >=
- 2.9 is 0.99, but will more than double the mean loss from 0.0644
- to 0.133 kg per pack.
- </p>
-<p>
- </p>
-<p>
- Of course, this calculation is not limited to packs of meat, it applies
- to dispensing anything, and it also applies to a 'virtual' material
- like any measurement.
- </p>
-<p>
- </p>
-<p>
- The only caveat is that the calculation assumes that the standard
- deviation (scale) is known with a reasonably low uncertainty, something
- that is not so easy to ensure in practice. And that the distribution
- is well defined, <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
- Distribution</a> or <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
- Distribution</a>, or some other.
- </p>
-<p>
- </p>
-<p>
- If one is simply dispensing a very large number of packs, then it
- may be feasible to measure the weight of hundreds or thousands of
- packs. With a healthy 'degrees of freedom', the confidence intervals
- for the standard deviation are not too wide, typically about + and
- - 10% for hundreds of observations.
- </p>
-<p>
- </p>
-<p>
- For other applications, where it is more difficult or expensive to
- make many observations, the confidence intervals are depressingly
- wide.
- </p>
-<p>
- </p>
+ </p>
<p>
- See <a class="link" href="../cs_eg/chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">Confidence
- Intervals on the standard deviation</a> for a worked example
- chi_square_std_dev_test.cpp
- of estimating these intervals.
- </p>
+ Setting the packer to 3.13263 will mean that fraction of packs >=
+ 2.9 is 0.99, but will more than double the mean loss from 0.0644 to
+ 0.133 kg per pack.
+ </p>
<p>
- <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.changing_the_scale_or_standard_deviation"></a>
- </p>
-<h5>
-<a name="id995060"></a>
- <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.changing_the_scale_or_standard_deviation">Changing
- the scale or standard deviation</a>
- </h5>
+ Of course, this calculation is not limited to packs of meat, it applies
+ to dispensing anything, and it also applies to a 'virtual' material
+ like any measurement.
+ </p>
<p>
- </p>
+ The only caveat is that the calculation assumes that the standard deviation
+ (scale) is known with a reasonably low uncertainty, something that
+ is not so easy to ensure in practice. And that the distribution is
+ well defined, <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
+ Distribution</a> or <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
+ Distribution</a>, or some other.
+ </p>
<p>
- Alternatively, we could invest in a better (more precise) packer
- (or measuring device) with a lower standard deviation, or scale.
- </p>
+ If one is simply dispensing a very large number of packs, then it may
+ be feasible to measure the weight of hundreds or thousands of packs.
+ With a healthy 'degrees of freedom', the confidence intervals for the
+ standard deviation are not too wide, typically about + and - 10% for
+ hundreds of observations.
+ </p>
<p>
- </p>
+ For other applications, where it is more difficult or expensive to
+ make many observations, the confidence intervals are depressingly wide.
+ </p>
<p>
- This might cost more, but would reduce the amount we have to 'give
- away' in order to meet the specification.
- </p>
+ See <a class="link" href="../cs_eg/chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">Confidence
+ Intervals on the standard deviation</a> for a worked example chi_square_std_dev_test.cpp
+ of estimating these intervals.
+ </p>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.changing_the_scale_or_standard_deviation"></a><h5>
+<a name="id1114279"></a>
+ <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.changing_the_scale_or_standard_deviation">Changing
+ the scale or standard deviation</a>
+ </h5>
<p>
- </p>
+ Alternatively, we could invest in a better (more precise) packer (or
+ measuring device) with a lower standard deviation, or scale.
+ </p>
<p>
- To estimate how much better (how much smaller standard deviation)
- it would have to be, we need to get the 5% quantile to be located
- at the under_weight limit, 2.9
- </p>
+ This might cost more, but would reduce the amount we have to 'give
+ away' in order to meet the specification.
+ </p>
<p>
- </p>
+ To estimate how much better (how much smaller standard deviation) it
+ would have to be, we need to get the 5% quantile to be located at the
+ under_weight limit, 2.9
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">p</span> <span class="special">=</span> <span class="number">0.05</span><span class="special">;</span> <span class="comment">// wanted p th quantile.
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quantile of "</span> <span class="special"><<</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">packs</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span>
<span class="special"><<</span> <span class="string">", mean = "</span> <span class="special"><<</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">mean</span><span class="special">()</span> <span class="special"><<</span> <span class="string">", sd = "</span> <span class="special"><<</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">standard_deviation</span><span class="special">()</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
- </p>
-<p>
- </p>
-<p>
- With the current packer (mean = 3, sd = 0.1), the 5% quantile is
- at 2.8551 kg, a little below our target of 2.9 kg. So we know that
- the standard deviation is going to have to be smaller.
- </p>
+ </p>
<p>
- </p>
+ Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
+ </p>
<p>
- Let's start by guessing that it (now 0.1) needs to be halved, to
- a standard deviation of 0.05 kg.
- </p>
+ With the current packer (mean = 3, sd = 0.1), the 5% quantile is at
+ 2.8551 kg, a little below our target of 2.9 kg. So we know that the
+ standard deviation is going to have to be smaller.
+ </p>
<p>
- </p>
+ Let's start by guessing that it (now 0.1) needs to be halved, to a
+ standard deviation of 0.05 kg.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">pack05</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="number">0.05</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quantile of "</span> <span class="special"><<</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">pack05</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span>
@@ -465,20 +355,15 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">pack05</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.05 is 0.97725</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- So 0.05 was quite a good guess, but we are a little over the 2.9
- target, so the standard deviation could be a tiny bit more. So we
- could do some more guessing to get closer, say by increasing standard
- deviation to 0.06 kg, constructing another new distribution called
- pack06.
- </p>
+ </p>
<p>
- </p>
+ So 0.05 was quite a good guess, but we are a little over the 2.9 target,
+ so the standard deviation could be a tiny bit more. So we could do
+ some more guessing to get closer, say by increasing standard deviation
+ to 0.06 kg, constructing another new distribution called pack06.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">pack06</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="number">0.06</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quantile of "</span> <span class="special"><<</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">pack06</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span>
@@ -490,46 +375,34 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">pack06</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.06 is 0.95221</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Now we are getting really close, but to do the job properly, we might
- need to use root finding method, for example the tools provided,
- and used elsewhere, in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">Root
- Finding Without Derivatives</a>.
- </p>
-<p>
- </p>
-<p>
- But in this (normal) distribution case, we can and should be even
- smarter and make a direct calculation.
- </p>
-<p>
- </p>
-<p>
- Our required limit is minimum_weight = 2.9 kg, often called the random
- variate z. For a standard normal distribution, then probability p
- = N((minimum_weight - mean) / sd).
- </p>
+ </p>
<p>
- </p>
+ Now we are getting really close, but to do the job properly, we might
+ need to use root finding method, for example the tools provided, and
+ used elsewhere, in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">Root
+ Finding Without Derivatives</a>.
+ </p>
<p>
- We want to find the standard deviation that would be required to
- meet this limit, so that the p th quantile is located at z (minimum_weight).
- In this case, the 0.05 (5%) quantile is at 2.9 kg pack weight, when
- the mean is 3 kg, ensuring that 0.95 (95%) of packs are above the
- minimum weight.
- </p>
+ But in this (normal) distribution case, we can and should be even smarter
+ and make a direct calculation.
+ </p>
<p>
- </p>
+ Our required limit is minimum_weight = 2.9 kg, often called the random
+ variate z. For a standard normal distribution, then probability p =
+ N((minimum_weight - mean) / sd).
+ </p>
<p>
- Rearranging, we can directly calculate the required standard deviation:
- </p>
+ We want to find the standard deviation that would be required to meet
+ this limit, so that the p th quantile is located at z (minimum_weight).
+ In this case, the 0.05 (5%) quantile is at 2.9 kg pack weight, when
+ the mean is 3 kg, ensuring that 0.95 (95%) of packs are above the minimum
+ weight.
+ </p>
<p>
- </p>
+ Rearranging, we can directly calculate the required standard deviation:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">N01</span><span class="special">;</span> <span class="comment">// standard normal distribution with meamn zero and unit standard deviation.
</span><span class="identifier">p</span> <span class="special">=</span> <span class="number">0.05</span><span class="special">;</span>
@@ -540,17 +413,13 @@
<span class="special"><<</span> <span class="identifier">minimum_weight</span> <span class="special"><<</span> <span class="string">", would need a standard deviation of "</span> <span class="special"><<</span> <span class="identifier">sd95</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// For the 0.05th quantile to be located at 2.9, would need a standard deviation of 0.0607957</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We can now construct a new (normal) distribution pack95 for the 'better'
- packer, and check that our distribution will meet the specification.
- </p>
+ </p>
<p>
- </p>
+ We can now construct a new (normal) distribution pack95 for the 'better'
+ packer, and check that our distribution will meet the specification.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">pack95</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="identifier">sd95</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span><span class="string">"Fraction of packs >= "</span> <span class="special"><<</span> <span class="identifier">minimum_weight</span> <span class="special"><<</span> <span class="string">" with a mean of "</span> <span class="special"><<</span> <span class="identifier">mean</span>
@@ -558,108 +427,75 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">pack95</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.0607957 is 0.95</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- This calculation is generalized in the free function find_scale,
- as shown below, giving the same standard deviation.
- </p>
+ </p>
<p>
- </p>
+ This calculation is generalized in the free function find_scale, as
+ shown below, giving the same standard deviation.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">ss</span> <span class="special">=</span> <span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">minimum_weight</span><span class="special">,</span> <span class="identifier">under_fraction</span><span class="special">,</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">mean</span><span class="special">());</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"find_scale<normal>(minimum_weight, under_fraction, packs.mean()); "</span> <span class="special"><<</span> <span class="identifier">ss</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// find_scale<normal>(minimum_weight, under_fraction, packs.mean()); 0.0607957</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- If we had defined an over_fraction, or percentage that must pass
- specification
- </p>
+ </p>
<p>
- </p>
+ If we had defined an over_fraction, or percentage that must pass specification
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">over_fraction</span> <span class="special">=</span> <span class="number">0.95</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And (wrongly) written
- </p>
+ </p>
<p>
-
-</p>
+ And (wrongly) written
+ </p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">sso</span> <span class="special">=</span> <span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">minimum_weight</span><span class="special">,</span> <span class="identifier">over_fraction</span><span class="special">,</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">mean</span><span class="special">());</span>
</pre>
<p>
- </p>
-<p>
- With the default policy, we would get a message like
- </p>
-<p>
-
-</p>
+ With the default policy, we would get a message like
+ </p>
<pre class="programlisting">Message from thrown exception was:
Error in function boost::math::find_scale<Dist, Policy>(double, double, double, Policy):
Computed scale (-0.060795683191176959) is <= 0! Was the complement intended?
</pre>
<p>
- </p>
-<p>
- But this would return a <span class="bold"><strong>negative</strong></span>
- standard deviation - obviously impossible. The probability should
- be 1 - over_fraction, not over_fraction, thus:
- </p>
-<p>
- </p>
+ But this would return a <span class="bold"><strong>negative</strong></span> standard
+ deviation - obviously impossible. The probability should be 1 - over_fraction,
+ not over_fraction, thus:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">ss1o</span> <span class="special">=</span> <span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">minimum_weight</span><span class="special">,</span> <span class="number">1</span> <span class="special">-</span> <span class="identifier">over_fraction</span><span class="special">,</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">mean</span><span class="special">());</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"find_scale<normal>(minimum_weight, under_fraction, packs.mean()); "</span> <span class="special"><<</span> <span class="identifier">ss1o</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// find_scale<normal>(minimum_weight, under_fraction, packs.mean()); 0.0607957</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- But notice that using '1 - over_fraction' - will lead to a <a class="link" href="../../overview/complements.html#why_complements">loss of accuracy, especially if over_fraction
- was close to unity.</a> In this (very common) case, we should
- instead use the <a class="link" href="../../overview.html#complements">complements</a>, giving
- the most accurate result.
- </p>
+ </p>
<p>
- </p>
+ But notice that using '1 - over_fraction' - will lead to a <a class="link" href="../../overview/complements.html#why_complements">loss
+ of accuracy, especially if over_fraction was close to unity.</a>
+ In this (very common) case, we should instead use the <a class="link" href="../../overview/complements.html#complements">complements</a>,
+ giving the most accurate result.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">ssc</span> <span class="special">=</span> <span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">minimum_weight</span><span class="special">,</span> <span class="identifier">over_fraction</span><span class="special">,</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">mean</span><span class="special">()));</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"find_scale<normal>(complement(minimum_weight, over_fraction, packs.mean())); "</span> <span class="special"><<</span> <span class="identifier">ssc</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// find_scale<normal>(complement(minimum_weight, over_fraction, packs.mean())); 0.0607957</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Note that our guess of 0.06 was close to the accurate value of 0.060795683191176959.
- </p>
-<p>
- </p>
+ </p>
<p>
- We can again confirm our prediction thus:
- </p>
+ Note that our guess of 0.06 was close to the accurate value of 0.060795683191176959.
+ </p>
<p>
- </p>
+ We can again confirm our prediction thus:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">pack95c</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="identifier">ssc</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span><span class="string">"Fraction of packs >= "</span> <span class="special"><<</span> <span class="identifier">minimum_weight</span> <span class="special"><<</span> <span class="string">" with a mean of "</span> <span class="special"><<</span> <span class="identifier">mean</span>
@@ -667,45 +503,31 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">pack95c</span><span class="special">,</span> <span class="identifier">minimum_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.0607957 is 0.95</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Notice that these two deceptively simple questions:
- </p>
+ </p>
<p>
- </p>
+ Notice that these two deceptively simple questions:
+ </p>
<div class="itemizedlist"><ul type="disc"><li>
- Do we over-fill to make sure we meet a minimum specification
- (or under-fill to avoid an overdose)?
- </li></ul></div>
-<p>
- </p>
+ Do we over-fill to make sure we meet a minimum specification (or
+ under-fill to avoid an overdose)?
+ </li></ul></div>
<p>
- and/or
- </p>
-<p>
- </p>
+ and/or
+ </p>
<div class="itemizedlist"><ul type="disc"><li>
- Do we measure better?
- </li></ul></div>
-<p>
- </p>
+ Do we measure better?
+ </li></ul></div>
<p>
- are actually extremely common.
- </p>
-<p>
- </p>
-<p>
- The weight of beef might be replaced by a measurement of more or
- less anything, from drug tablet content, Apollo landing rocket firing,
- X-ray treatment doses...
- </p>
+ are actually extremely common.
+ </p>
<p>
- </p>
+ The weight of beef might be replaced by a measurement of more or less
+ anything, from drug tablet content, Apollo landing rocket firing, X-ray
+ treatment doses...
+ </p>
<p>
- The scale can be variation in dispensing or uncertainty in measurement.
- </p>
+ The scale can be variation in dispensing or uncertainty in measurement.
+ </p>
<p>
See find_mean_and_sd_normal.cpp
for full source code & appended program output.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,20 +24,16 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg"></a><a class="link" href="find_scale_eg.html" title="Find Scale (Standard Deviation) Example">
- Find Scale (Standard Deviation) Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg"></a><a class="link" href="find_scale_eg.html" title="Find Scale (Standard Deviation) Example">Find
+ Scale (Standard Deviation) Example</a>
</h6></div></div></div>
<p>
- </p>
-<p>
- First we need some includes to access the <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
- Distribution</a>, the algorithms to find scale (and some std output
- of course).
- </p>
-<p>
- </p>
+ First we need some includes to access the <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
+ Distribution</a>, the algorithms to find scale (and some std output
+ of course).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for normal_distribution
</span> <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal</span><span class="special">;</span> <span class="comment">// typedef provides default type is double.
@@ -54,35 +50,27 @@
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
- </p>
-<p>
- For this example, we will use the standard <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
- Distribution</a>, with location (mean) zero and standard deviation
- (scale) unity. Conveniently, this is also the default for this implementation's
- constructor.
- </p>
+ </p>
<p>
- </p>
+ For this example, we will use the standard <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
+ Distribution</a>, with location (mean) zero and standard deviation
+ (scale) unity. Conveniently, this is also the default for this implementation's
+ constructor.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">N01</span><span class="special">;</span> <span class="comment">// Default 'standard' normal distribution with zero mean
</span><span class="keyword">double</span> <span class="identifier">sd</span> <span class="special">=</span> <span class="number">1.</span><span class="special">;</span> <span class="comment">// and standard deviation is 1.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Suppose we want to find a different normal distribution with standard
- deviation so that only fraction p (here 0.001 or 0.1%) are below
- a certain chosen limit (here -2. standard deviations).
- </p>
+ </p>
<p>
- </p>
+ Suppose we want to find a different normal distribution with standard
+ deviation so that only fraction p (here 0.001 or 0.1%) are below a
+ certain chosen limit (here -2. standard deviations).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">z</span> <span class="special">=</span> <span class="special">-</span><span class="number">2.</span><span class="special">;</span> <span class="comment">// z to give prob p
</span><span class="keyword">double</span> <span class="identifier">p</span> <span class="special">=</span> <span class="number">0.001</span><span class="special">;</span> <span class="comment">// only 0.1% below z = -2
@@ -96,70 +84,46 @@
<span class="special"><<</span> <span class="string">", has "</span> <span class="special"><<</span> <span class="string">"fraction > "</span> <span class="special"><<</span> <span class="identifier">z</span>
<span class="special"><<</span> <span class="string">", p = "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">N01</span><span class="special">,</span> <span class="identifier">z</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// Note: uses complement.</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Normal distribution with mean = 0 has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0 has fraction > -2, p = 0.97725
</pre>
<p>
- </p>
-<p>
- Noting that p = 0.02 instead of our target of 0.001, we can now use
- <code class="computeroutput"><span class="identifier">find_scale</span></code> to give
- a new standard deviation.
- </p>
-<p>
- </p>
+ Noting that p = 0.02 instead of our target of 0.001, we can now use
+ <code class="computeroutput"><span class="identifier">find_scale</span></code> to give
+ a new standard deviation.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">l</span> <span class="special">=</span> <span class="identifier">N01</span><span class="special">.</span><span class="identifier">location</span><span class="special">();</span>
<span class="keyword">double</span> <span class="identifier">s</span> <span class="special">=</span> <span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">l</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"scale (standard deviation) = "</span> <span class="special"><<</span> <span class="identifier">s</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- that outputs:
- </p>
+ </p>
<p>
-
-</p>
+ that outputs:
+ </p>
<pre class="programlisting">scale (standard deviation) = 0.647201
</pre>
<p>
- </p>
-<p>
- showing that we need to reduce the standard deviation from 1. to
- 0.65.
- </p>
-<p>
- </p>
-<p>
- Then we can check that we have achieved our objective by constructing
- a new distribution with the new standard deviation (but same zero
- mean):
- </p>
+ showing that we need to reduce the standard deviation from 1. to 0.65.
+ </p>
<p>
- </p>
+ Then we can check that we have achieved our objective by constructing
+ a new distribution with the new standard deviation (but same zero mean):
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">np001pc</span><span class="special">(</span><span class="identifier">N01</span><span class="special">.</span><span class="identifier">location</span><span class="special">(),</span> <span class="identifier">s</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And re-calculating the fraction below (and above) our chosen limit.
- </p>
+ </p>
<p>
- </p>
+ And re-calculating the fraction below (and above) our chosen limit.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Normal distribution with mean = "</span> <span class="special"><<</span> <span class="identifier">l</span>
<span class="special"><<</span> <span class="string">" has "</span> <span class="special"><<</span> <span class="string">"fraction <= "</span> <span class="special"><<</span> <span class="identifier">z</span>
@@ -168,53 +132,37 @@
<span class="special"><<</span> <span class="string">" has "</span> <span class="special"><<</span> <span class="string">"fraction > "</span> <span class="special"><<</span> <span class="identifier">z</span>
<span class="special"><<</span> <span class="string">", p = "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">np001pc</span><span class="special">,</span> <span class="identifier">z</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Normal distribution with mean = 0 has fraction <= -2, p = 0.001
Normal distribution with mean = 0 has fraction > -2, p = 0.999
</pre>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg.controlling_how_errors_from_find_scale_are_handled"></a><h5>
+<a name="id1109760"></a>
+ <a class="link" href="find_scale_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg.controlling_how_errors_from_find_scale_are_handled">Controlling
+ how Errors from find_scale are handled</a>
+ </h5>
+<p>
+ We can also control the policy for handling various errors. For example,
+ we can define a new (possibly unwise) policy to ignore domain errors
+ ('bad' arguments).
+ </p>
<p>
- <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg.controlling_how_errors_from_find_scale_are_handled"></a>
- </p>
-<h5>
-<a name="id991616"></a>
- <a class="link" href="find_scale_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg.controlling_how_errors_from_find_scale_are_handled">Controlling
- how Errors from find_scale are handled</a>
- </h5>
-<p>
- </p>
-<p>
- We can also control the policy for handling various errors. For example,
- we can define a new (possibly unwise) policy to ignore domain errors
- ('bad' arguments).
- </p>
-<p>
- </p>
-<p>
- Unless we are using the boost::math namespace, we will need:
- </p>
-<p>
- </p>
+ Unless we are using the boost::math namespace, we will need:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">policy</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">domain_error</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">ignore_error</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Using a typedef is convenient, especially if it is re-used, although
- it is not required, as the various examples below show.
- </p>
+ </p>
<p>
- </p>
+ Using a typedef is convenient, especially if it is re-used, although
+ it is not required, as the various examples below show.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">policy</span><span class="special"><</span><span class="identifier">domain_error</span><span class="special"><</span><span class="identifier">ignore_error</span><span class="special">></span> <span class="special">></span> <span class="identifier">ignore_domain_policy</span><span class="special">;</span>
<span class="comment">// find_scale with new policy, using typedef.
@@ -227,20 +175,16 @@
<span class="comment">// New policy, without typedef.
</span><span class="identifier">l</span> <span class="special">=</span> <span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">l</span><span class="special">,</span> <span class="identifier">policy</span><span class="special"><</span><span class="identifier">domain_error</span><span class="special"><</span><span class="identifier">ignore_error</span><span class="special">></span> <span class="special">>());</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- If we want to express a probability, say 0.999, that is a complement,
- <code class="computeroutput"><span class="number">1</span> <span class="special">-</span>
- <span class="identifier">p</span></code> we should not even think
- of writing <code class="computeroutput"><span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="number">1</span> <span class="special">-</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">l</span><span class="special">)</span></code>, but <a class="link" href="../../overview/complements.html#why_complements">instead</a>,
- use the <a class="link" href="../../overview.html#complements">complements</a> version.
- </p>
+ </p>
<p>
- </p>
+ If we want to express a probability, say 0.999, that is a complement,
+ <code class="computeroutput"><span class="number">1</span> <span class="special">-</span>
+ <span class="identifier">p</span></code> we should not even think
+ of writing <code class="computeroutput"><span class="identifier">find_scale</span><span class="special"><</span><span class="identifier">normal</span><span class="special">>(</span><span class="identifier">z</span><span class="special">,</span> <span class="number">1</span> <span class="special">-</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">l</span><span class="special">)</span></code>, but <a class="link" href="../../overview/complements.html#why_complements">instead</a>,
+ use the <a class="link" href="../../overview/complements.html#complements">complements</a> version.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">z</span> <span class="special">=</span> <span class="special">-</span><span class="number">2.</span><span class="special">;</span>
<span class="keyword">double</span> <span class="identifier">q</span> <span class="special">=</span> <span class="number">0.999</span><span class="special">;</span> <span class="comment">// = 1 - p; // complement of 0.001.
@@ -252,31 +196,24 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Normal distribution with mean = "</span> <span class="special"><<</span> <span class="identifier">l</span> <span class="special"><<</span> <span class="string">" has "</span>
<span class="special"><<</span> <span class="string">"fraction > "</span> <span class="special"><<</span> <span class="identifier">z</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">np95pc</span><span class="special">,</span> <span class="identifier">z</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Sadly, it is all too easy to get probabilities the wrong way round,
- when you may get a warning like this:
- </p>
+ </p>
<p>
-
-</p>
+ Sadly, it is all too easy to get probabilities the wrong way round,
+ when you may get a warning like this:
+ </p>
<pre class="programlisting">Message from thrown exception was:
Error in function boost::math::find_scale<Dist, Policy>(complement(double, double, double, Policy)):
Computed scale (-0.48043523852179076) is <= 0! Was the complement intended?
</pre>
<p>
- </p>
-<p>
- The default error handling policy is to throw an exception with this
- message, but if you chose a policy to ignore the error, the (impossible)
- negative scale is quietly returned.
- </p>
+ The default error handling policy is to throw an exception with this
+ message, but if you chose a policy to ignore the error, the (impossible)
+ negative scale is quietly returned.
+ </p>
<p>
See find_scale_example.cpp
- for full source code: the program output looks like this:
-</p>
+ for full source code: the program output looks like this:
+ </p>
<pre class="programlisting">Example: Find scale (standard deviation).
Normal distribution with mean = 0, standard deviation 1, has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0, standard deviation 1, has fraction > -2, p = 0.97725
@@ -286,8 +223,6 @@
Normal distribution with mean = 0.946339 has fraction <= -2 = 0.001
Normal distribution with mean = 0.946339 has fraction > -2 = 0.999
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.nag_library"></a><a class="link" href="nag_library.html" title="Comparison with C, R, FORTRAN-style Free Functions"> Comparison
+<a name="math_toolkit.dist.stat_tut.weg.nag_library"></a><a class="link" href="nag_library.html" title="Comparison with C, R, FORTRAN-style Free Functions">Comparison
with C, R, FORTRAN-style Free Functions</a>
</h5></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.nccs_eg"></a><a class="link" href="nccs_eg.html" title="Non Central Chi Squared Example"> Non Central
+<a name="math_toolkit.dist.stat_tut.weg.nccs_eg"></a><a class="link" href="nccs_eg.html" title="Non Central Chi Squared Example">Non Central
Chi Squared Example</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="nccs_eg/nccs_power_eg.html">
- Tables of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ<sup>2</sup> test.</a></span></dt></dl></div>
<p>
(See also the reference documentation for the <a class="link" href="../../dist_ref/dists/nc_chi_squared_dist.html" title="Noncentral Chi-Squared Distribution">Noncentral
Chi Squared Distribution</a>.)
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,29 +24,23 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.nccs_eg.nccs_power_eg"></a><a class="link" href="nccs_power_eg.html" title="Tables of the power function of the χ2 test.">
- Tables of the power function of the χ<sup>2</sup> test.</a>
+<a name="math_toolkit.dist.stat_tut.weg.nccs_eg.nccs_power_eg"></a><a class="link" href="nccs_power_eg.html" title="Tables of the power function of the χ2 test.">Tables
+ of the power function of the χ<sup>2</sup> test.</a>
</h6></div></div></div>
<p>
- </p>
-<p>
- This example computes a table of the power of the χ<sup>2</sup>
-test at the 5%
- significance level, for various degrees of freedom and non-centrality
- parameters. The table is deliberately the same as Table 6 from "The
- Non-Central χ<sup>2</sup> and F-Distributions and their applications.", P.
- B. Patnaik, Biometrika, Vol. 36, No. 1/2 (June 1949), 202-232.
- </p>
-<p>
- </p>
-<p>
- First we need some includes to access the non-central chi squared
- distribution (and some basic std output of course).
- </p>
+ This example computes a table of the power of the χ<sup>2</sup>
+test at the 5% significance
+ level, for various degrees of freedom and non-centrality parameters.
+ The table is deliberately the same as Table 6 from "The Non-Central
+ χ<sup>2</sup> and F-Distributions and their applications.", P. B. Patnaik,
+ Biometrika, Vol. 36, No. 1/2 (June 1949), 202-232.
+ </p>
<p>
- </p>
+ First we need some includes to access the non-central chi squared distribution
+ (and some basic std output of course).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">non_central_chi_squared</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">chi_squared</span><span class="special">;</span>
@@ -59,17 +53,13 @@
<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Create a table of the power of the χ<sup>2</sup> test at 5% significance level,
- start with a table header:
- </p>
+ </p>
<p>
- </p>
+ Create a table of the power of the χ<sup>2</sup> test at 5% significance level,
+ start with a table header:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"[table\n[[[nu]]"</span><span class="special">;</span>
<span class="keyword">for</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">lam</span> <span class="special">=</span> <span class="number">2</span><span class="special">;</span> <span class="identifier">lam</span> <span class="special"><=</span> <span class="number">20</span><span class="special">;</span> <span class="identifier">lam</span> <span class="special">+=</span> <span class="number">2</span><span class="special">)</span>
@@ -78,22 +68,16 @@
<span class="special">}</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"]\n"</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- (Note: the enclosing [] brackets are to format as a table in Boost.Quickbook).
- </p>
-<p>
- </p>
+ </p>
<p>
- Enumerate the rows and columns and print the power of the test for
- each table cell:
- </p>
+ (Note: the enclosing [] brackets are to format as a table in Boost.Quickbook).
+ </p>
<p>
- </p>
+ Enumerate the rows and columns and print the power of the test for
+ each table cell:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">for</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">n</span> <span class="special">=</span> <span class="number">2</span><span class="special">;</span> <span class="identifier">n</span> <span class="special"><=</span> <span class="number">20</span><span class="special">;</span> <span class="special">++</span><span class="identifier">n</span><span class="special">)</span>
<span class="special">{</span>
@@ -101,43 +85,31 @@
<span class="keyword">for</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">lam</span> <span class="special">=</span> <span class="number">2</span><span class="special">;</span> <span class="identifier">lam</span> <span class="special"><=</span> <span class="number">20</span><span class="special">;</span> <span class="identifier">lam</span> <span class="special">+=</span> <span class="number">2</span><span class="special">)</span>
<span class="special">{</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Calculate the χ<sup>2</sup> statistic for a 5% significance:
- </p>
+ </p>
<p>
- </p>
+ Calculate the χ<sup>2</sup> statistic for a 5% significance:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">cs</span> <span class="special">=</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">chi_squared</span><span class="special">(</span><span class="identifier">n</span><span class="special">),</span> <span class="number">0.05</span><span class="special">));</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- The power of the test is given by the complement of the CDF of the
- non-central χ<sup>2</sup> distribution:
- </p>
+ </p>
<p>
- </p>
+ The power of the test is given by the complement of the CDF of the
+ non-central χ<sup>2</sup> distribution:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">beta</span> <span class="special">=</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">non_central_chi_squared</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span> <span class="identifier">lam</span><span class="special">),</span> <span class="identifier">cs</span><span class="special">));</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Then output the cell value:
- </p>
+ </p>
<p>
- </p>
+ Then output the cell value:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"["</span> <span class="special"><<</span> <span class="identifier">setprecision</span><span class="special">(</span><span class="number">3</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">beta</span> <span class="special"><<</span> <span class="string">"]"</span><span class="special">;</span>
<span class="special">}</span>
@@ -146,24 +118,18 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"]"</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- The output from this program is a table in Boost.Quickbook format
- as shown below.
- </p>
-<p>
- </p>
+ </p>
<p>
- We can interpret this as follows - for example if ν=10 and λ=10 then
- the power of the test is 0.542 - so we have only a 54% chance of
- correctly detecting that our null hypothesis is false, and a 46%
- chance of incurring a type II error (failing to reject the null hypothesis
- when it is in fact false):
- </p>
+ The output from this program is a table in Boost.Quickbook format as
+ shown below.
+ </p>
<p>
- </p>
+ We can interpret this as follows - for example if ν=10 and λ=10 then
+ the power of the test is 0.542 - so we have only a 54% chance of correctly
+ detecting that our null hypothesis is false, and a 46% chance of incurring
+ a type II error (failing to reject the null hypothesis when it is in
+ fact false):
+ </p>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -180,1154 +146,1150 @@
</colgroup>
<thead><tr>
<th>
- <p>
- ν
- </p>
- </th>
+ <p>
+ ν
+ </p>
+ </th>
<th>
- <p>
- λ=2
- </p>
- </th>
+ <p>
+ λ=2
+ </p>
+ </th>
<th>
- <p>
- λ=4
- </p>
- </th>
+ <p>
+ λ=4
+ </p>
+ </th>
<th>
- <p>
- λ=6
- </p>
- </th>
+ <p>
+ λ=6
+ </p>
+ </th>
<th>
- <p>
- λ=8
- </p>
- </th>
+ <p>
+ λ=8
+ </p>
+ </th>
<th>
- <p>
- λ=10
- </p>
- </th>
+ <p>
+ λ=10
+ </p>
+ </th>
<th>
- <p>
- λ=12
- </p>
- </th>
+ <p>
+ λ=12
+ </p>
+ </th>
<th>
- <p>
- λ=14
- </p>
- </th>
+ <p>
+ λ=14
+ </p>
+ </th>
<th>
- <p>
- λ=16
- </p>
- </th>
+ <p>
+ λ=16
+ </p>
+ </th>
<th>
- <p>
- λ=18
- </p>
- </th>
+ <p>
+ λ=18
+ </p>
+ </th>
<th>
- <p>
- λ=20
- </p>
- </th>
+ <p>
+ λ=20
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- 2
- </p>
- </td>
-<td>
- <p>
- 0.226
- </p>
- </td>
-<td>
- <p>
- 0.415
- </p>
- </td>
-<td>
- <p>
- 0.584
- </p>
- </td>
-<td>
- <p>
- 0.718
- </p>
- </td>
-<td>
- <p>
- 0.815
- </p>
- </td>
-<td>
- <p>
- 0.883
- </p>
- </td>
-<td>
- <p>
- 0.928
- </p>
- </td>
-<td>
- <p>
- 0.957
- </p>
- </td>
-<td>
- <p>
- 0.974
- </p>
- </td>
-<td>
- <p>
- 0.985
- </p>
- </td>
+ <p>
+ 2
+ </p>
+ </td>
+<td>
+ <p>
+ 0.226
+ </p>
+ </td>
+<td>
+ <p>
+ 0.415
+ </p>
+ </td>
+<td>
+ <p>
+ 0.584
+ </p>
+ </td>
+<td>
+ <p>
+ 0.718
+ </p>
+ </td>
+<td>
+ <p>
+ 0.815
+ </p>
+ </td>
+<td>
+ <p>
+ 0.883
+ </p>
+ </td>
+<td>
+ <p>
+ 0.928
+ </p>
+ </td>
+<td>
+ <p>
+ 0.957
+ </p>
+ </td>
+<td>
+ <p>
+ 0.974
+ </p>
+ </td>
+<td>
+ <p>
+ 0.985
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 3
- </p>
- </td>
-<td>
- <p>
- 0.192
- </p>
- </td>
-<td>
- <p>
- 0.359
- </p>
- </td>
-<td>
- <p>
- 0.518
- </p>
- </td>
-<td>
- <p>
- 0.654
- </p>
- </td>
-<td>
- <p>
- 0.761
- </p>
- </td>
-<td>
- <p>
- 0.84
- </p>
- </td>
-<td>
- <p>
- 0.896
- </p>
- </td>
-<td>
- <p>
- 0.934
- </p>
- </td>
-<td>
- <p>
- 0.959
- </p>
- </td>
-<td>
- <p>
- 0.975
- </p>
- </td>
+ <p>
+ 3
+ </p>
+ </td>
+<td>
+ <p>
+ 0.192
+ </p>
+ </td>
+<td>
+ <p>
+ 0.359
+ </p>
+ </td>
+<td>
+ <p>
+ 0.518
+ </p>
+ </td>
+<td>
+ <p>
+ 0.654
+ </p>
+ </td>
+<td>
+ <p>
+ 0.761
+ </p>
+ </td>
+<td>
+ <p>
+ 0.84
+ </p>
+ </td>
+<td>
+ <p>
+ 0.896
+ </p>
+ </td>
+<td>
+ <p>
+ 0.934
+ </p>
+ </td>
+<td>
+ <p>
+ 0.959
+ </p>
+ </td>
+<td>
+ <p>
+ 0.975
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 4
- </p>
- </td>
-<td>
- <p>
- 0.171
- </p>
- </td>
-<td>
- <p>
- 0.32
- </p>
- </td>
-<td>
- <p>
- 0.47
- </p>
- </td>
-<td>
- <p>
- 0.605
- </p>
- </td>
-<td>
- <p>
- 0.716
- </p>
- </td>
-<td>
- <p>
- 0.802
- </p>
- </td>
-<td>
- <p>
- 0.866
- </p>
- </td>
-<td>
- <p>
- 0.912
- </p>
- </td>
-<td>
- <p>
- 0.943
- </p>
- </td>
-<td>
- <p>
- 0.964
- </p>
- </td>
+ <p>
+ 4
+ </p>
+ </td>
+<td>
+ <p>
+ 0.171
+ </p>
+ </td>
+<td>
+ <p>
+ 0.32
+ </p>
+ </td>
+<td>
+ <p>
+ 0.47
+ </p>
+ </td>
+<td>
+ <p>
+ 0.605
+ </p>
+ </td>
+<td>
+ <p>
+ 0.716
+ </p>
+ </td>
+<td>
+ <p>
+ 0.802
+ </p>
+ </td>
+<td>
+ <p>
+ 0.866
+ </p>
+ </td>
+<td>
+ <p>
+ 0.912
+ </p>
+ </td>
+<td>
+ <p>
+ 0.943
+ </p>
+ </td>
+<td>
+ <p>
+ 0.964
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 5
- </p>
- </td>
-<td>
- <p>
- 0.157
- </p>
- </td>
-<td>
- <p>
- 0.292
- </p>
- </td>
-<td>
- <p>
- 0.433
- </p>
- </td>
-<td>
- <p>
- 0.564
- </p>
- </td>
-<td>
- <p>
- 0.677
- </p>
- </td>
-<td>
- <p>
- 0.769
- </p>
- </td>
-<td>
- <p>
- 0.839
- </p>
- </td>
-<td>
- <p>
- 0.89
- </p>
- </td>
-<td>
- <p>
- 0.927
- </p>
- </td>
-<td>
- <p>
- 0.952
- </p>
- </td>
+ <p>
+ 5
+ </p>
+ </td>
+<td>
+ <p>
+ 0.157
+ </p>
+ </td>
+<td>
+ <p>
+ 0.292
+ </p>
+ </td>
+<td>
+ <p>
+ 0.433
+ </p>
+ </td>
+<td>
+ <p>
+ 0.564
+ </p>
+ </td>
+<td>
+ <p>
+ 0.677
+ </p>
+ </td>
+<td>
+ <p>
+ 0.769
+ </p>
+ </td>
+<td>
+ <p>
+ 0.839
+ </p>
+ </td>
+<td>
+ <p>
+ 0.89
+ </p>
+ </td>
+<td>
+ <p>
+ 0.927
+ </p>
+ </td>
+<td>
+ <p>
+ 0.952
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 6
- </p>
- </td>
-<td>
- <p>
- 0.146
- </p>
- </td>
-<td>
- <p>
- 0.27
- </p>
- </td>
-<td>
- <p>
- 0.403
- </p>
- </td>
-<td>
- <p>
- 0.531
- </p>
- </td>
-<td>
- <p>
- 0.644
- </p>
- </td>
-<td>
- <p>
- 0.738
- </p>
- </td>
-<td>
- <p>
- 0.813
- </p>
- </td>
-<td>
- <p>
- 0.869
- </p>
- </td>
-<td>
- <p>
- 0.911
- </p>
- </td>
-<td>
- <p>
- 0.94
- </p>
- </td>
+ <p>
+ 6
+ </p>
+ </td>
+<td>
+ <p>
+ 0.146
+ </p>
+ </td>
+<td>
+ <p>
+ 0.27
+ </p>
+ </td>
+<td>
+ <p>
+ 0.403
+ </p>
+ </td>
+<td>
+ <p>
+ 0.531
+ </p>
+ </td>
+<td>
+ <p>
+ 0.644
+ </p>
+ </td>
+<td>
+ <p>
+ 0.738
+ </p>
+ </td>
+<td>
+ <p>
+ 0.813
+ </p>
+ </td>
+<td>
+ <p>
+ 0.869
+ </p>
+ </td>
+<td>
+ <p>
+ 0.911
+ </p>
+ </td>
+<td>
+ <p>
+ 0.94
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 7
- </p>
- </td>
-<td>
- <p>
- 0.138
- </p>
- </td>
-<td>
- <p>
- 0.252
- </p>
- </td>
-<td>
- <p>
- 0.378
- </p>
- </td>
-<td>
- <p>
- 0.502
- </p>
- </td>
-<td>
- <p>
- 0.614
- </p>
- </td>
-<td>
- <p>
- 0.71
- </p>
- </td>
-<td>
- <p>
- 0.788
- </p>
- </td>
-<td>
- <p>
- 0.849
- </p>
- </td>
-<td>
- <p>
- 0.895
- </p>
- </td>
-<td>
- <p>
- 0.928
- </p>
- </td>
+ <p>
+ 7
+ </p>
+ </td>
+<td>
+ <p>
+ 0.138
+ </p>
+ </td>
+<td>
+ <p>
+ 0.252
+ </p>
+ </td>
+<td>
+ <p>
+ 0.378
+ </p>
+ </td>
+<td>
+ <p>
+ 0.502
+ </p>
+ </td>
+<td>
+ <p>
+ 0.614
+ </p>
+ </td>
+<td>
+ <p>
+ 0.71
+ </p>
+ </td>
+<td>
+ <p>
+ 0.788
+ </p>
+ </td>
+<td>
+ <p>
+ 0.849
+ </p>
+ </td>
+<td>
+ <p>
+ 0.895
+ </p>
+ </td>
+<td>
+ <p>
+ 0.928
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 8
- </p>
- </td>
-<td>
- <p>
- 0.131
- </p>
- </td>
-<td>
- <p>
- 0.238
- </p>
- </td>
-<td>
- <p>
- 0.357
- </p>
- </td>
-<td>
- <p>
- 0.477
- </p>
- </td>
-<td>
- <p>
- 0.588
- </p>
- </td>
-<td>
- <p>
- 0.685
- </p>
- </td>
-<td>
- <p>
- 0.765
- </p>
- </td>
-<td>
- <p>
- 0.829
- </p>
- </td>
-<td>
- <p>
- 0.879
- </p>
- </td>
-<td>
- <p>
- 0.915
- </p>
- </td>
+ <p>
+ 8
+ </p>
+ </td>
+<td>
+ <p>
+ 0.131
+ </p>
+ </td>
+<td>
+ <p>
+ 0.238
+ </p>
+ </td>
+<td>
+ <p>
+ 0.357
+ </p>
+ </td>
+<td>
+ <p>
+ 0.477
+ </p>
+ </td>
+<td>
+ <p>
+ 0.588
+ </p>
+ </td>
+<td>
+ <p>
+ 0.685
+ </p>
+ </td>
+<td>
+ <p>
+ 0.765
+ </p>
+ </td>
+<td>
+ <p>
+ 0.829
+ </p>
+ </td>
+<td>
+ <p>
+ 0.879
+ </p>
+ </td>
+<td>
+ <p>
+ 0.915
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 9
- </p>
- </td>
-<td>
- <p>
- 0.125
- </p>
- </td>
-<td>
- <p>
- 0.225
- </p>
- </td>
-<td>
- <p>
- 0.339
- </p>
- </td>
-<td>
- <p>
- 0.454
- </p>
- </td>
-<td>
- <p>
- 0.564
- </p>
- </td>
-<td>
- <p>
- 0.661
- </p>
- </td>
-<td>
- <p>
- 0.744
- </p>
- </td>
-<td>
- <p>
- 0.811
- </p>
- </td>
-<td>
- <p>
- 0.863
- </p>
- </td>
-<td>
- <p>
- 0.903
- </p>
- </td>
+ <p>
+ 9
+ </p>
+ </td>
+<td>
+ <p>
+ 0.125
+ </p>
+ </td>
+<td>
+ <p>
+ 0.225
+ </p>
+ </td>
+<td>
+ <p>
+ 0.339
+ </p>
+ </td>
+<td>
+ <p>
+ 0.454
+ </p>
+ </td>
+<td>
+ <p>
+ 0.564
+ </p>
+ </td>
+<td>
+ <p>
+ 0.661
+ </p>
+ </td>
+<td>
+ <p>
+ 0.744
+ </p>
+ </td>
+<td>
+ <p>
+ 0.811
+ </p>
+ </td>
+<td>
+ <p>
+ 0.863
+ </p>
+ </td>
+<td>
+ <p>
+ 0.903
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 10
- </p>
- </td>
-<td>
- <p>
- 0.121
- </p>
- </td>
-<td>
- <p>
- 0.215
- </p>
- </td>
-<td>
- <p>
- 0.323
- </p>
- </td>
-<td>
- <p>
- 0.435
- </p>
- </td>
-<td>
- <p>
- 0.542
- </p>
- </td>
-<td>
- <p>
- 0.64
- </p>
- </td>
-<td>
- <p>
- 0.723
- </p>
- </td>
-<td>
- <p>
- 0.793
- </p>
- </td>
-<td>
- <p>
- 0.848
- </p>
- </td>
-<td>
- <p>
- 0.891
- </p>
- </td>
+ <p>
+ 10
+ </p>
+ </td>
+<td>
+ <p>
+ 0.121
+ </p>
+ </td>
+<td>
+ <p>
+ 0.215
+ </p>
+ </td>
+<td>
+ <p>
+ 0.323
+ </p>
+ </td>
+<td>
+ <p>
+ 0.435
+ </p>
+ </td>
+<td>
+ <p>
+ 0.542
+ </p>
+ </td>
+<td>
+ <p>
+ 0.64
+ </p>
+ </td>
+<td>
+ <p>
+ 0.723
+ </p>
+ </td>
+<td>
+ <p>
+ 0.793
+ </p>
+ </td>
+<td>
+ <p>
+ 0.848
+ </p>
+ </td>
+<td>
+ <p>
+ 0.891
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 11
- </p>
- </td>
-<td>
- <p>
- 0.117
- </p>
- </td>
-<td>
- <p>
- 0.206
- </p>
- </td>
-<td>
- <p>
- 0.309
- </p>
- </td>
-<td>
- <p>
- 0.417
- </p>
- </td>
-<td>
- <p>
- 0.523
- </p>
- </td>
-<td>
- <p>
- 0.62
- </p>
- </td>
-<td>
- <p>
- 0.704
- </p>
- </td>
-<td>
- <p>
- 0.775
- </p>
- </td>
-<td>
- <p>
- 0.833
- </p>
- </td>
-<td>
- <p>
- 0.878
- </p>
- </td>
+ <p>
+ 11
+ </p>
+ </td>
+<td>
+ <p>
+ 0.117
+ </p>
+ </td>
+<td>
+ <p>
+ 0.206
+ </p>
+ </td>
+<td>
+ <p>
+ 0.309
+ </p>
+ </td>
+<td>
+ <p>
+ 0.417
+ </p>
+ </td>
+<td>
+ <p>
+ 0.523
+ </p>
+ </td>
+<td>
+ <p>
+ 0.62
+ </p>
+ </td>
+<td>
+ <p>
+ 0.704
+ </p>
+ </td>
+<td>
+ <p>
+ 0.775
+ </p>
+ </td>
+<td>
+ <p>
+ 0.833
+ </p>
+ </td>
+<td>
+ <p>
+ 0.878
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 12
- </p>
- </td>
-<td>
- <p>
- 0.113
- </p>
- </td>
-<td>
- <p>
- 0.198
- </p>
- </td>
-<td>
- <p>
- 0.297
- </p>
- </td>
-<td>
- <p>
- 0.402
- </p>
- </td>
-<td>
- <p>
- 0.505
- </p>
- </td>
-<td>
- <p>
- 0.601
- </p>
- </td>
-<td>
- <p>
- 0.686
- </p>
- </td>
-<td>
- <p>
- 0.759
- </p>
- </td>
-<td>
- <p>
- 0.818
- </p>
- </td>
-<td>
- <p>
- 0.866
- </p>
- </td>
+ <p>
+ 12
+ </p>
+ </td>
+<td>
+ <p>
+ 0.113
+ </p>
+ </td>
+<td>
+ <p>
+ 0.198
+ </p>
+ </td>
+<td>
+ <p>
+ 0.297
+ </p>
+ </td>
+<td>
+ <p>
+ 0.402
+ </p>
+ </td>
+<td>
+ <p>
+ 0.505
+ </p>
+ </td>
+<td>
+ <p>
+ 0.601
+ </p>
+ </td>
+<td>
+ <p>
+ 0.686
+ </p>
+ </td>
+<td>
+ <p>
+ 0.759
+ </p>
+ </td>
+<td>
+ <p>
+ 0.818
+ </p>
+ </td>
+<td>
+ <p>
+ 0.866
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 13
- </p>
- </td>
-<td>
- <p>
- 0.11
- </p>
- </td>
-<td>
- <p>
- 0.191
- </p>
- </td>
-<td>
- <p>
- 0.286
- </p>
- </td>
-<td>
- <p>
- 0.387
- </p>
- </td>
-<td>
- <p>
- 0.488
- </p>
- </td>
-<td>
- <p>
- 0.584
- </p>
- </td>
-<td>
- <p>
- 0.669
- </p>
- </td>
-<td>
- <p>
- 0.743
- </p>
- </td>
-<td>
- <p>
- 0.804
- </p>
- </td>
-<td>
- <p>
- 0.854
- </p>
- </td>
+ <p>
+ 13
+ </p>
+ </td>
+<td>
+ <p>
+ 0.11
+ </p>
+ </td>
+<td>
+ <p>
+ 0.191
+ </p>
+ </td>
+<td>
+ <p>
+ 0.286
+ </p>
+ </td>
+<td>
+ <p>
+ 0.387
+ </p>
+ </td>
+<td>
+ <p>
+ 0.488
+ </p>
+ </td>
+<td>
+ <p>
+ 0.584
+ </p>
+ </td>
+<td>
+ <p>
+ 0.669
+ </p>
+ </td>
+<td>
+ <p>
+ 0.743
+ </p>
+ </td>
+<td>
+ <p>
+ 0.804
+ </p>
+ </td>
+<td>
+ <p>
+ 0.854
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 14
- </p>
- </td>
-<td>
- <p>
- 0.108
- </p>
- </td>
-<td>
- <p>
- 0.185
- </p>
- </td>
-<td>
- <p>
- 0.276
- </p>
- </td>
-<td>
- <p>
- 0.374
- </p>
- </td>
-<td>
- <p>
- 0.473
- </p>
- </td>
-<td>
- <p>
- 0.567
- </p>
- </td>
-<td>
- <p>
- 0.653
- </p>
- </td>
-<td>
- <p>
- 0.728
- </p>
- </td>
-<td>
- <p>
- 0.791
- </p>
- </td>
-<td>
- <p>
- 0.842
- </p>
- </td>
+ <p>
+ 14
+ </p>
+ </td>
+<td>
+ <p>
+ 0.108
+ </p>
+ </td>
+<td>
+ <p>
+ 0.185
+ </p>
+ </td>
+<td>
+ <p>
+ 0.276
+ </p>
+ </td>
+<td>
+ <p>
+ 0.374
+ </p>
+ </td>
+<td>
+ <p>
+ 0.473
+ </p>
+ </td>
+<td>
+ <p>
+ 0.567
+ </p>
+ </td>
+<td>
+ <p>
+ 0.653
+ </p>
+ </td>
+<td>
+ <p>
+ 0.728
+ </p>
+ </td>
+<td>
+ <p>
+ 0.791
+ </p>
+ </td>
+<td>
+ <p>
+ 0.842
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 15
- </p>
- </td>
-<td>
- <p>
- 0.105
- </p>
- </td>
-<td>
- <p>
- 0.179
- </p>
- </td>
-<td>
- <p>
- 0.267
- </p>
- </td>
-<td>
- <p>
- 0.362
- </p>
- </td>
-<td>
- <p>
- 0.459
- </p>
- </td>
-<td>
- <p>
- 0.552
- </p>
- </td>
-<td>
- <p>
- 0.638
- </p>
- </td>
-<td>
- <p>
- 0.713
- </p>
- </td>
-<td>
- <p>
- 0.777
- </p>
- </td>
-<td>
- <p>
- 0.83
- </p>
- </td>
+ <p>
+ 15
+ </p>
+ </td>
+<td>
+ <p>
+ 0.105
+ </p>
+ </td>
+<td>
+ <p>
+ 0.179
+ </p>
+ </td>
+<td>
+ <p>
+ 0.267
+ </p>
+ </td>
+<td>
+ <p>
+ 0.362
+ </p>
+ </td>
+<td>
+ <p>
+ 0.459
+ </p>
+ </td>
+<td>
+ <p>
+ 0.552
+ </p>
+ </td>
+<td>
+ <p>
+ 0.638
+ </p>
+ </td>
+<td>
+ <p>
+ 0.713
+ </p>
+ </td>
+<td>
+ <p>
+ 0.777
+ </p>
+ </td>
+<td>
+ <p>
+ 0.83
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 16
- </p>
- </td>
-<td>
- <p>
- 0.103
- </p>
- </td>
-<td>
- <p>
- 0.174
- </p>
- </td>
-<td>
- <p>
- 0.259
- </p>
- </td>
-<td>
- <p>
- 0.351
- </p>
- </td>
-<td>
- <p>
- 0.446
- </p>
- </td>
-<td>
- <p>
- 0.538
- </p>
- </td>
-<td>
- <p>
- 0.623
- </p>
- </td>
-<td>
- <p>
- 0.699
- </p>
- </td>
-<td>
- <p>
- 0.764
- </p>
- </td>
-<td>
- <p>
- 0.819
- </p>
- </td>
+ <p>
+ 16
+ </p>
+ </td>
+<td>
+ <p>
+ 0.103
+ </p>
+ </td>
+<td>
+ <p>
+ 0.174
+ </p>
+ </td>
+<td>
+ <p>
+ 0.259
+ </p>
+ </td>
+<td>
+ <p>
+ 0.351
+ </p>
+ </td>
+<td>
+ <p>
+ 0.446
+ </p>
+ </td>
+<td>
+ <p>
+ 0.538
+ </p>
+ </td>
+<td>
+ <p>
+ 0.623
+ </p>
+ </td>
+<td>
+ <p>
+ 0.699
+ </p>
+ </td>
+<td>
+ <p>
+ 0.764
+ </p>
+ </td>
+<td>
+ <p>
+ 0.819
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 17
- </p>
- </td>
-<td>
- <p>
- 0.101
- </p>
- </td>
-<td>
- <p>
- 0.169
- </p>
- </td>
-<td>
- <p>
- 0.251
- </p>
- </td>
-<td>
- <p>
- 0.341
- </p>
- </td>
-<td>
- <p>
- 0.434
- </p>
- </td>
-<td>
- <p>
- 0.525
- </p>
- </td>
-<td>
- <p>
- 0.609
- </p>
- </td>
-<td>
- <p>
- 0.686
- </p>
- </td>
-<td>
- <p>
- 0.752
- </p>
- </td>
-<td>
- <p>
- 0.807
- </p>
- </td>
+ <p>
+ 17
+ </p>
+ </td>
+<td>
+ <p>
+ 0.101
+ </p>
+ </td>
+<td>
+ <p>
+ 0.169
+ </p>
+ </td>
+<td>
+ <p>
+ 0.251
+ </p>
+ </td>
+<td>
+ <p>
+ 0.341
+ </p>
+ </td>
+<td>
+ <p>
+ 0.434
+ </p>
+ </td>
+<td>
+ <p>
+ 0.525
+ </p>
+ </td>
+<td>
+ <p>
+ 0.609
+ </p>
+ </td>
+<td>
+ <p>
+ 0.686
+ </p>
+ </td>
+<td>
+ <p>
+ 0.752
+ </p>
+ </td>
+<td>
+ <p>
+ 0.807
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 18
- </p>
- </td>
-<td>
- <p>
- 0.0992
- </p>
- </td>
-<td>
- <p>
- 0.165
- </p>
- </td>
-<td>
- <p>
- 0.244
- </p>
- </td>
-<td>
- <p>
- 0.332
- </p>
- </td>
-<td>
- <p>
- 0.423
- </p>
- </td>
-<td>
- <p>
- 0.512
- </p>
- </td>
-<td>
- <p>
- 0.596
- </p>
- </td>
-<td>
- <p>
- 0.673
- </p>
- </td>
-<td>
- <p>
- 0.74
- </p>
- </td>
-<td>
- <p>
- 0.796
- </p>
- </td>
+ <p>
+ 18
+ </p>
+ </td>
+<td>
+ <p>
+ 0.0992
+ </p>
+ </td>
+<td>
+ <p>
+ 0.165
+ </p>
+ </td>
+<td>
+ <p>
+ 0.244
+ </p>
+ </td>
+<td>
+ <p>
+ 0.332
+ </p>
+ </td>
+<td>
+ <p>
+ 0.423
+ </p>
+ </td>
+<td>
+ <p>
+ 0.512
+ </p>
+ </td>
+<td>
+ <p>
+ 0.596
+ </p>
+ </td>
+<td>
+ <p>
+ 0.673
+ </p>
+ </td>
+<td>
+ <p>
+ 0.74
+ </p>
+ </td>
+<td>
+ <p>
+ 0.796
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 19
- </p>
- </td>
-<td>
- <p>
- 0.0976
- </p>
- </td>
-<td>
- <p>
- 0.161
- </p>
- </td>
-<td>
- <p>
- 0.238
- </p>
- </td>
-<td>
- <p>
- 0.323
- </p>
- </td>
-<td>
- <p>
- 0.412
- </p>
- </td>
-<td>
- <p>
- 0.5
- </p>
- </td>
-<td>
- <p>
- 0.584
- </p>
- </td>
-<td>
- <p>
- 0.66
- </p>
- </td>
-<td>
- <p>
- 0.728
- </p>
- </td>
-<td>
- <p>
- 0.786
- </p>
- </td>
+ <p>
+ 19
+ </p>
+ </td>
+<td>
+ <p>
+ 0.0976
+ </p>
+ </td>
+<td>
+ <p>
+ 0.161
+ </p>
+ </td>
+<td>
+ <p>
+ 0.238
+ </p>
+ </td>
+<td>
+ <p>
+ 0.323
+ </p>
+ </td>
+<td>
+ <p>
+ 0.412
+ </p>
+ </td>
+<td>
+ <p>
+ 0.5
+ </p>
+ </td>
+<td>
+ <p>
+ 0.584
+ </p>
+ </td>
+<td>
+ <p>
+ 0.66
+ </p>
+ </td>
+<td>
+ <p>
+ 0.728
+ </p>
+ </td>
+<td>
+ <p>
+ 0.786
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- 20
- </p>
- </td>
-<td>
- <p>
- 0.0961
- </p>
- </td>
-<td>
- <p>
- 0.158
- </p>
- </td>
-<td>
- <p>
- 0.232
- </p>
- </td>
-<td>
- <p>
- 0.315
- </p>
- </td>
-<td>
- <p>
- 0.402
- </p>
- </td>
-<td>
- <p>
- 0.489
- </p>
- </td>
-<td>
- <p>
- 0.572
- </p>
- </td>
-<td>
- <p>
- 0.648
- </p>
- </td>
-<td>
- <p>
- 0.716
- </p>
- </td>
-<td>
- <p>
- 0.775
- </p>
- </td>
+ <p>
+ 20
+ </p>
+ </td>
+<td>
+ <p>
+ 0.0961
+ </p>
+ </td>
+<td>
+ <p>
+ 0.158
+ </p>
+ </td>
+<td>
+ <p>
+ 0.232
+ </p>
+ </td>
+<td>
+ <p>
+ 0.315
+ </p>
+ </td>
+<td>
+ <p>
+ 0.402
+ </p>
+ </td>
+<td>
+ <p>
+ 0.489
+ </p>
+ </td>
+<td>
+ <p>
+ 0.572
+ </p>
+ </td>
+<td>
+ <p>
+ 0.648
+ </p>
+ </td>
+<td>
+ <p>
+ 0.716
+ </p>
+ </td>
+<td>
+ <p>
+ 0.775
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
<p>
- </p>
-<p>
- See nc_chi_sq_example.cpp
- for the full C++ source code.
- </p>
-<p>
+ See nc_chi_sq_example.cpp
+ for the full C++ source code.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../weg.html" title="Worked Examples">
-<link rel="prev" href="binom_eg/binom_size_eg.html" title="Estimating Sample Sizes for a Binomial Distribution.">
+<link rel="prev" href="geometric_eg.html" title="Geometric Distribution Examples">
<link rel="next" href="neg_binom_eg/neg_binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for the Negative Binomial Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,23 +20,23 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="binom_eg/binom_size_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="neg_binom_eg/neg_binom_conf.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="geometric_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="neg_binom_eg/neg_binom_conf.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg"></a><a class="link" href="neg_binom_eg.html" title="Negative Binomial Distribution Examples"> Negative
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg"></a><a class="link" href="neg_binom_eg.html" title="Negative Binomial Distribution Examples">Negative
Binomial Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></span></dt>
-<dt><span class="section"><a href="neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></span></dt>
-<dt><span class="section"><a href="neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></span></dt>
-<dt><span class="section"><a href="neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></span></dt>
+<dt><span class="section"><a href="neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></span></dt>
+<dt><span class="section"><a href="neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></span></dt>
+<dt><span class="section"><a href="neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></span></dt>
+<dt><span class="section"><a href="neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></span></dt>
</dl></div>
<p>
(See also the reference documentation for the <a class="link" href="../../dist_ref/dists/negative_binomial_dist.html" title="Negative Binomial Distribution">Negative
@@ -55,7 +55,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="binom_eg/binom_size_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="neg_binom_eg/neg_binom_conf.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="geometric_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="neg_binom_eg/neg_binom_conf.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,9 +24,9 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf"></a><a class="link" href="neg_binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for the Negative Binomial Distribution">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf"></a><a class="link" href="neg_binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for the Negative Binomial Distribution">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a>
</h6></div></div></div>
<p>
Imagine you have a process that follows a negative binomial distribution:
@@ -55,15 +55,11 @@
illustrates their use.
</p>
<p>
- </p>
-<p>
- First we need some includes to access the negative binomial distribution
- (and some basic std output of course).
- </p>
-<p>
- </p>
+ First we need some includes to access the negative binomial distribution
+ (and some basic std output of course).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">negative_binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial</span><span class="special">;</span>
@@ -74,39 +70,28 @@
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">setprecision</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">setw</span><span class="special">;</span> <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">left</span><span class="special">;</span> <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">fixed</span><span class="special">;</span> <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">right</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- First define a table of significance levels: these are the probabilities
- that the true occurrence frequency lies outside the calculated interval:
- </p>
+ </p>
<p>
- </p>
+ First define a table of significance levels: these are the probabilities
+ that the true occurrence frequency lies outside the calculated interval:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">alpha</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span> <span class="number">0.5</span><span class="special">,</span> <span class="number">0.25</span><span class="special">,</span> <span class="number">0.1</span><span class="special">,</span> <span class="number">0.05</span><span class="special">,</span> <span class="number">0.01</span><span class="special">,</span> <span class="number">0.001</span><span class="special">,</span> <span class="number">0.0001</span><span class="special">,</span> <span class="number">0.00001</span> <span class="special">};</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95%
- confidence that the true occurence frequency lies <span class="bold"><strong>inside</strong></span>
- the calculated interval.
- </p>
-<p>
- </p>
+ </p>
<p>
- We need a function to calculate and print confidence limits for an
- observed frequency of occurrence that follows a negative binomial
- distribution.
- </p>
+ Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95% confidence
+ that the true occurence frequency lies <span class="bold"><strong>inside</strong></span>
+ the calculated interval.
+ </p>
<p>
- </p>
+ We need a function to calculate and print confidence limits for an
+ observed frequency of occurrence that follows a negative binomial distribution.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">confidence_limits_on_frequency</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">trials</span><span class="special">,</span> <span class="keyword">unsigned</span> <span class="identifier">successes</span><span class="special">)</span>
<span class="special">{</span>
@@ -132,25 +117,21 @@
<span class="string">" Value (%) Limit Limit\n"</span>
<span class="string">"___________________________________________\n"</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And now for the important part - the bounds themselves. For each
- value of <span class="emphasis"><em>alpha</em></span>, we call <code class="computeroutput"><span class="identifier">find_lower_bound_on_p</span></code>
- and <code class="computeroutput"><span class="identifier">find_upper_bound_on_p</span></code>
- to obtain lower and upper bounds respectively. Note that since we
- are calculating a two-sided interval, we must divide the value of
- alpha in two. Had we been calculating a single-sided interval, for
- example: <span class="emphasis"><em>"Calculate a lower bound so that we are P%
- sure that the true occurrence frequency is greater than some value"</em></span>
- then we would <span class="bold"><strong>not</strong></span> have divided by
- two.
- </p>
+ </p>
<p>
- </p>
+ And now for the important part - the bounds themselves. For each value
+ of <span class="emphasis"><em>alpha</em></span>, we call <code class="computeroutput"><span class="identifier">find_lower_bound_on_p</span></code>
+ and <code class="computeroutput"><span class="identifier">find_upper_bound_on_p</span></code>
+ to obtain lower and upper bounds respectively. Note that since we are
+ calculating a two-sided interval, we must divide the value of alpha
+ in two. Had we been calculating a single-sided interval, for example:
+ <span class="emphasis"><em>"Calculate a lower bound so that we are P% sure that
+ the true occurrence frequency is greater than some value"</em></span>
+ then we would <span class="bold"><strong>not</strong></span> have divided by
+ two.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="comment">// Now print out the upper and lower limits for the alpha table values.
</span> <span class="keyword">for</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special"><</span> <span class="keyword">sizeof</span><span class="special">(</span><span class="identifier">alpha</span><span class="special">)/</span><span class="keyword">sizeof</span><span class="special">(</span><span class="identifier">alpha</span><span class="special">[</span><span class="number">0</span><span class="special">]);</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
@@ -167,17 +148,13 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span> <span class="comment">// void confidence_limits_on_frequency(unsigned trials, unsigned successes)</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And then call confidence_limits_on_frequency with increasing numbers
- of trials, but always the same success fraction 0.1, or 1 in 10.
- </p>
+ </p>
<p>
- </p>
+ And then call confidence_limits_on_frequency with increasing numbers
+ of trials, but always the same success fraction 0.1, or 1 in 10.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -190,7 +167,7 @@
</span>
</pre>
<p>
- </p>
+ </p>
<p>
Let's see some sample output for a 1 in 10 success ratio, first for
a mere 20 trials:
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_size_eg"></a><a class="link" href="neg_binom_size_eg.html" title="Estimating Sample Sizes for the Negative Binomial.">
- Estimating Sample Sizes for the Negative Binomial.</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_size_eg"></a><a class="link" href="neg_binom_size_eg.html" title="Estimating Sample Sizes for the Negative Binomial.">Estimating
+ Sample Sizes for the Negative Binomial.</a>
</h6></div></div></div>
<p>
Imagine you have an event (let's call it a "failure" - though
@@ -43,62 +43,45 @@
demonstrates its usage.
</p>
<p>
- </p>
-<p>
- It centres around a routine that prints out a table of minimum sample
- sizes for various probability thresholds:
- </p>
-<p>
- </p>
+ It centres around a routine that prints out a table of minimum sample
+ sizes (number of trials) for various probability thresholds:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">find_number_of_trials</span><span class="special">(</span><span class="keyword">double</span> <span class="identifier">failures</span><span class="special">,</span> <span class="keyword">double</span> <span class="identifier">p</span><span class="special">);</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- First define a table of significance levels: these are the maximum
- acceptable probability that <span class="emphasis"><em>failure</em></span> or fewer
- events will be observed.
- </p>
+ </p>
<p>
- </p>
+ First define a table of significance levels: these are the maximum
+ acceptable probability that <span class="emphasis"><em>failure</em></span> or fewer events
+ will be observed.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">alpha</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span> <span class="number">0.5</span><span class="special">,</span> <span class="number">0.25</span><span class="special">,</span> <span class="number">0.1</span><span class="special">,</span> <span class="number">0.05</span><span class="special">,</span> <span class="number">0.01</span><span class="special">,</span> <span class="number">0.001</span><span class="special">,</span> <span class="number">0.0001</span><span class="special">,</span> <span class="number">0.00001</span> <span class="special">};</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95%
- confidence that the desired number of failures will be observed.
- </p>
-<p>
- </p>
+ </p>
<p>
- Much of the rest of the program is pretty-printing, the important
- part is in the calculation of minimum number of trials required for
- each value of alpha using:
- </p>
+ Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95% confidence
+ that the desired number of failures will be observed. The values range
+ from a very low 0.5 or 50% confidence up to an extremely high confidence
+ of 99.999.
+ </p>
<p>
-
-</p>
+ Much of the rest of the program is pretty-printing, the important part
+ is in the calculation of minimum number of trials required for each
+ value of alpha using:
+ </p>
<pre class="programlisting"><span class="special">(</span><span class="keyword">int</span><span class="special">)</span><span class="identifier">ceil</span><span class="special">(</span><span class="identifier">negative_binomial</span><span class="special">::</span><span class="identifier">find_minimum_number_of_trials</span><span class="special">(</span><span class="identifier">failures</span><span class="special">,</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">alpha</span><span class="special">[</span><span class="identifier">i</span><span class="special">]);</span>
</pre>
<p>
- </p>
-<p>
- find_minimum_number_of_trials returns a double, so ceil rounds this
- up to ensure we have an integral minimum number of trials.
- </p>
-<p>
- </p>
+ find_minimum_number_of_trials returns a double, so <code class="computeroutput"><span class="identifier">ceil</span></code>
+ rounds this up to ensure we have an integral minimum number of trials.
+ </p>
<p>
-
+
</p>
<pre class="programlisting">
<span class="keyword">void</span> <span class="identifier">find_number_of_trials</span><span class="special">(</span><span class="keyword">double</span> <span class="identifier">failures</span><span class="special">,</span> <span class="keyword">double</span> <span class="identifier">p</span><span class="special">)</span>
@@ -110,11 +93,10 @@
</span> <span class="comment">// Calculate how many trials we need to ensure the
</span> <span class="comment">// required number of failures DOES exceed "failures".
</span>
- <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\n"</span><span class="string">"Target number of failures = "</span> <span class="special"><<</span> <span class="identifier">failures</span><span class="special">;</span>
- <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">", Success fraction = "</span> <span class="special"><<</span> <span class="number">100</span> <span class="special">*</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">"%"</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
+ <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\n"</span><span class="string">"Target number of failures = "</span> <span class="special"><<</span> <span class="special">(</span><span class="keyword">int</span><span class="special">)</span><span class="identifier">failures</span><span class="special">;</span>
+ <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">", Success fraction = "</span> <span class="special"><<</span> <span class="identifier">fixed</span> <span class="special"><<</span> <span class="identifier">setprecision</span><span class="special">(</span><span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="number">100</span> <span class="special">*</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">"%"</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// Print table header:
-</span> <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\n\n"</span>
- <span class="string">"____________________________\n"</span>
+</span> <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"____________________________\n"</span>
<span class="string">"Confidence Min Number\n"</span>
<span class="string">" Value (%) Of Trials \n"</span>
<span class="string">"____________________________\n"</span><span class="special">;</span>
@@ -130,17 +112,13 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span> <span class="comment">// void find_number_of_trials(double failures, double p)</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- finally we can produce some tables of minimum trials for the chosen
- confidence levels:
- </p>
+ </p>
<p>
- </p>
+ finally we can produce some tables of minimum trials for the chosen
+ confidence levels:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -156,8 +134,6 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
<div class="note"><table border="0" summary="Note">
<tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example1"></a><a class="link" href="negative_binomial_example1.html" title="Negative Binomial Sales Quota Example.">
- Negative Binomial Sales Quota Example.</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example1"></a><a class="link" href="negative_binomial_example1.html" title="Negative Binomial Sales Quota Example.">Negative
+ Binomial Sales Quota Example.</a>
</h6></div></div></div>
<p>
This example program <a href="../../../../../../../../example/negative_binomial_example1.cpp" target="_top">negative_binomial_example1.cpp
@@ -33,92 +33,69 @@
of meeting a sales quota.
</p>
<p>
- </p>
+ Based on <a href="http://en.wikipedia.org/wiki/Negative_binomial_distribution" target="_top">a
+ problem by Dr. Diane Evans, Professor of Mathematics at Rose-Hulman
+ Institute of Technology</a>.
+ </p>
+<p>
+ Pat is required to sell candy bars to raise money for the 6th grade
+ field trip. There are thirty houses in the neighborhood, and Pat is
+ not supposed to return home until five candy bars have been sold. So
+ the child goes door to door, selling candy bars. At each house, there
+ is a 0.4 probability (40%) of selling one candy bar and a 0.6 probability
+ (60%) of selling nothing.
+ </p>
+<p>
+ What is the probability mass (density) function (pdf) for selling the
+ last (fifth) candy bar at the nth house?
+ </p>
+<p>
+ The Negative Binomial(r, p) distribution describes the probability
+ of k failures and r successes in k+r Bernoulli(p) trials with success
+ on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
+ trial</a> is one with only two possible outcomes, success of failure,
+ and p is the probability of success). See also <a href="../../../../../" target="_top">http://en.wikipedia.org/wiki/Bernoulli_distribution
+ Bernoulli distribution</a> and <a href="http://www.math.uah.edu/stat/bernoulli/Introduction.xhtml" target="_top">Bernoulli
+ applications</a>.
+ </p>
<p>
- Based on <a href="http://en.wikipedia.org/wiki/Negative_binomial_distribution" target="_top">a
- problem by Dr. Diane Evans, Professor of Mathematics at Rose-Hulman
- Institute of Technology</a>.
- </p>
-<p>
- </p>
-<p>
- Pat is required to sell candy bars to raise money for the 6th grade
- field trip. There are thirty houses in the neighborhood, and Pat
- is not supposed to return home until five candy bars have been sold.
- So the child goes door to door, selling candy bars. At each house,
- there is a 0.4 probability (40%) of selling one candy bar and a 0.6
- probability (60%) of selling nothing.
- </p>
-<p>
- </p>
-<p>
- What is the probability mass (density) function (pdf) for selling
- the last (fifth) candy bar at the nth house?
- </p>
-<p>
- </p>
-<p>
- The Negative Binomial(r, p) distribution describes the probability
- of k failures and r successes in k+r Bernoulli(p) trials with success
- on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
- trial</a> is one with only two possible outcomes, success of
- failure, and p is the probability of success). See also <a href="../../../../../" target="_top">http://en.wikipedia.org/wiki/Bernoulli_distribution
- Bernoulli distribution</a> and <a href="http://www.math.uah.edu/stat/bernoulli/Introduction.xhtml" target="_top">Bernoulli
- applications</a>.
- </p>
-<p>
- </p>
-<p>
- In this example, we will deliberately produce a variety of calculations
- and outputs to demonstrate the ways that the negative binomial distribution
- can be implemented with this library: it is also deliberately over-commented.
- </p>
-<p>
- </p>
-<p>
- First we need to #define macros to control the error and discrete
- handling policies. For this simple example, we want to avoid throwing
- an exception (the default policy) and just return infinity. We want
- to treat the distribution as if it was continuous, so we choose a
- discrete_quantile policy of real, rather than the default policy
- integer_round_outwards.
- </p>
+ In this example, we will deliberately produce a variety of calculations
+ and outputs to demonstrate the ways that the negative binomial distribution
+ can be implemented with this library: it is also deliberately over-commented.
+ </p>
<p>
- </p>
+ First we need to #define macros to control the error and discrete handling
+ policies. For this simple example, we want to avoid throwing an exception
+ (the default policy) and just return infinity. We want to treat the
+ distribution as if it was continuous, so we choose a discrete_quantile
+ policy of real, rather than the default policy integer_round_outwards.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_OVERFLOW_ERROR_POLICY</span> <span class="identifier">ignore_error</span>
<span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DISCRETE_QUANTILE_POLICY</span> <span class="identifier">real</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- After that we need some includes to provide easy access to the negative
- binomial distribution,
- </p>
+ </p>
<p>
- </p>
+ After that we need some includes to provide easy access to the negative
+ binomial distribution,
+ </p>
<div class="caution"><table border="0" summary="Caution">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../../../../../../doc/src/images/caution.png"></td>
<th align="left">Caution</th>
</tr>
<tr><td align="left" valign="top"><p>
- It is vital to #include distributions etc <span class="bold"><strong>after</strong></span>
- the above #defines
- </p></td></tr>
+ It is vital to #include distributions etc <span class="bold"><strong>after</strong></span>
+ the above #defines
+ </p></td></tr>
</table></div>
<p>
- </p>
-<p>
- and we need some std library iostream, of course.
- </p>
-<p>
- </p>
+ and we need some std library iostream, of course.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">negative_binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="comment">// for negative_binomial_distribution
@@ -137,91 +114,67 @@
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
- </p>
-<p>
- It is always sensible to use try and catch blocks because defaults
- policies are to throw an exception if anything goes wrong.
- </p>
-<p>
- </p>
+ </p>
<p>
- A simple catch block (see below) will ensure that you get a helpful
- error message instead of an abrupt program abort.
- </p>
+ It is always sensible to use try and catch blocks because defaults
+ policies are to throw an exception if anything goes wrong.
+ </p>
<p>
- </p>
+ A simple catch block (see below) will ensure that you get a helpful
+ error message instead of an abrupt program abort.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">try</span>
<span class="special">{</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- 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.
- </p>
+ </p>
<p>
- </p>
+ 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.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">sales_quota</span> <span class="special">=</span> <span class="number">5</span><span class="special">;</span> <span class="comment">// Pat's sales quota - successes (r).</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- At each house, there is a 0.4 probability (40%) of selling one candy
- bar and a 0.6 probability (60%) of selling nothing.
- </p>
+ </p>
<p>
- </p>
+ At each house, there is a 0.4 probability (40%) of selling one candy
+ bar and a 0.6 probability (60%) of selling nothing.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">success_fraction</span> <span class="special">=</span> <span class="number">0.4</span><span class="special">;</span> <span class="comment">// success_fraction (p) - so failure_fraction is 0.6.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- The Negative Binomial(r, p) distribution describes the probability
- of k failures and r successes in k+r Bernoulli(p) trials with success
- on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
- trial</a> is one with only two possible outcomes, success of
- failure, and p is the probability of success).
- </p>
-<p>
- </p>
+ </p>
<p>
- We therefore start by constructing a negative binomial distribution
- with parameters sales_quota (required successes) and probability
- of success.
- </p>
+ The Negative Binomial(r, p) distribution describes the probability
+ of k failures and r successes in k+r Bernoulli(p) trials with success
+ on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
+ trial</a> is one with only two possible outcomes, success of failure,
+ and p is the probability of success).
+ </p>
<p>
- </p>
+ We therefore start by constructing a negative binomial distribution
+ with parameters sales_quota (required successes) and probability of
+ success.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">negative_binomial</span> <span class="identifier">nb</span><span class="special">(</span><span class="identifier">sales_quota</span><span class="special">,</span> <span class="identifier">success_fraction</span><span class="special">);</span> <span class="comment">// type double by default.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- To confirm, display the success_fraction & successes parameters
- of the distribution.
- </p>
+ </p>
<p>
- </p>
+ To confirm, display the success_fraction & successes parameters
+ of the distribution.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Pat has a sales per house success rate of "</span> <span class="special"><<</span> <span class="identifier">success_fraction</span>
<span class="special"><<</span> <span class="string">".\nTherefore he would, on average, sell "</span> <span class="special"><<</span> <span class="identifier">nb</span><span class="special">.</span><span class="identifier">success_fraction</span><span class="special">()</span> <span class="special">*</span> <span class="number">100</span>
@@ -234,57 +187,42 @@
<span class="string">"to need to visit about "</span> <span class="special"><<</span> <span class="identifier">success_fraction</span> <span class="special">*</span> <span class="identifier">all_houses</span>
<span class="special"><<</span> <span class="string">" houses in order to sell all "</span> <span class="special"><<</span> <span class="identifier">nb</span><span class="special">.</span><span class="identifier">successes</span><span class="special">()</span> <span class="special"><<</span> <span class="string">" bars. "</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Pat has a sales per house success rate of 0.4.
Therefore he would, on average, sell 40 bars after trying 100 houses.
With a success rate of 0.4, he might expect, on average,
to need to visit about 12 houses in order to sell all 5 bars.
</pre>
<p>
- </p>
-<p>
- The random variable of interest is the number of houses that must
- be visited to sell five candy bars, so we substitute k = n - 5 into
- a negative_binomial(5, 0.4) and obtain the <a class="link" href="../../../dist_ref/nmp.html#math.dist.pdf">probability
- mass (density) function (pdf or pmf)</a> of the distribution of
- houses visited. Obviously, the best possible case is that Pat makes
- sales on all the first five houses.
- </p>
-<p>
- </p>
-<p>
- We calculate this using the pdf function:
- </p>
+ The random variable of interest is the number of houses that must be
+ visited to sell five candy bars, so we substitute k = n - 5 into a
+ negative_binomial(5, 0.4) and obtain the <a class="link" href="../../../dist_ref/nmp.html#math.dist.pdf">probability
+ mass (density) function (pdf or pmf)</a> of the distribution of
+ houses visited. Obviously, the best possible case is that Pat makes
+ sales on all the first five houses.
+ </p>
<p>
- </p>
+ We calculate this using the pdf function:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability that Pat finishes on the "</span> <span class="special"><<</span> <span class="identifier">sales_quota</span> <span class="special"><<</span> <span class="string">"th house is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">5</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// == pdf(nb, 0)</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Of course, he could not finish on fewer than 5 houses because he
- must sell 5 candy bars. So the 5th house is the first that he could
- possibly finish on.
- </p>
-<p>
- </p>
+ </p>
<p>
- To finish on or before the 8th house, Pat must finish at the 5th,
- 6th, 7th or 8th house. The probability that he will finish on <span class="bold"><strong>exactly</strong></span> ( == ) on any house is the Probability
- Density Function (pdf).
- </p>
+ Of course, he could not finish on fewer than 5 houses because he must
+ sell 5 candy bars. So the 5th house is the first that he could possibly
+ finish on.
+ </p>
<p>
- </p>
+ To finish on or before the 8th house, Pat must finish at the 5th, 6th,
+ 7th or 8th house. The probability that he will finish on <span class="bold"><strong>exactly</strong></span> ( == ) on any house is the Probability
+ Density Function (pdf).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability that Pat finishes on the 6th house is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">6</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -293,24 +231,17 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability that Pat finishes on the 8th house is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">8</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability that Pat finishes on the 6th house is 0.03072
Probability that Pat finishes on the 7th house is 0.055296
Probability that Pat finishes on the 8th house is 0.077414
</pre>
<p>
- </p>
-<p>
- The sum of the probabilities for these houses is the Cumulative Distribution
- Function (cdf). We can calculate it by adding the individual probabilities.
- </p>
-<p>
- </p>
+ The sum of the probabilities for these houses is the Cumulative Distribution
+ Function (cdf). We can calculate it by adding the individual probabilities.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability that Pat finishes on or before the 8th house is sum "</span>
<span class="string">"\n"</span> <span class="special"><<</span> <span class="string">"pdf(sales_quota) + pdf(6) + pdf(7) + pdf(8) = "</span>
@@ -321,37 +252,25 @@
</span> <span class="special">+</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">8</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="comment">// 3 failures.
</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">pdf(sales_quota) + pdf(6) + pdf(7) + pdf(8) = 0.17367
</pre>
<p>
- </p>
-<p>
- Or, usually better, by using the negative binomial <span class="bold"><strong>cumulative</strong></span>
- distribution function.
- </p>
-<p>
- </p>
+ Or, usually better, by using the negative binomial <span class="bold"><strong>cumulative</strong></span>
+ distribution function.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\nProbability of selling his quota of "</span> <span class="special"><<</span> <span class="identifier">sales_quota</span>
<span class="special"><<</span> <span class="string">" bars\non or before the "</span> <span class="special"><<</span> <span class="number">8</span> <span class="special"><<</span> <span class="string">"th house is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">8</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of selling his quota of 5 bars on or before the 8th house is 0.17367
</pre>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\nProbability that Pat finishes exactly on the 10th house is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">10</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -359,17 +278,12 @@
<span class="special"><<</span> <span class="string">" bars\non or before the "</span> <span class="special"><<</span> <span class="number">10</span> <span class="special"><<</span> <span class="string">"th house is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">10</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability that Pat finishes exactly on the 10th house is 0.10033
Probability of selling his quota of 5 bars on or before the 10th house is 0.3669
</pre>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability that Pat finishes exactly on the 11th house is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">11</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -377,18 +291,13 @@
<span class="special"><<</span> <span class="string">" bars\non or before the "</span> <span class="special"><<</span> <span class="number">11</span> <span class="special"><<</span> <span class="string">"th house is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">11</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability that Pat finishes on the 11th house is 0.10033
Probability of selling his quota of 5 candy bars
on or before the 11th house is 0.46723
</pre>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability that Pat finishes exactly on the 12th house is "</span>
<span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">12</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -397,189 +306,135 @@
<span class="special"><<</span> <span class="string">" bars\non or before the "</span> <span class="special"><<</span> <span class="number">12</span> <span class="special"><<</span> <span class="string">"th house is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">12</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability that Pat finishes on the 12th house is 0.094596
Probability of selling his quota of 5 candy bars
on or before the 12th house is 0.56182
</pre>
<p>
- </p>
-<p>
- Finally consider the risk of Pat not selling his quota of 5 bars
- even after visiting all the houses. Calculate the probability that
- he <span class="emphasis"><em>will</em></span> sell on or before the last house: Calculate
- the probability that he would sell all his quota on the very last
- house.
- </p>
-<p>
- </p>
+ Finally consider the risk of Pat not selling his quota of 5 bars even
+ after visiting all the houses. Calculate the probability that he <span class="emphasis"><em>will</em></span>
+ sell on or before the last house: Calculate the probability that he
+ would sell all his quota on the very last house.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability that Pat finishes on the "</span> <span class="special"><<</span> <span class="identifier">all_houses</span>
<span class="special"><<</span> <span class="string">" house is "</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">all_houses</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Probability of selling his quota of 5 bars on the 30th house is
- </p>
+ </p>
<p>
-
-</p>
+ Probability of selling his quota of 5 bars on the 30th house is
+ </p>
<pre class="programlisting">Probability that Pat finishes on the 30 house is 0.00069145
</pre>
<p>
- </p>
-<p>
- when he'd be very unlucky indeed!
- </p>
-<p>
- </p>
-<p>
- What is the probability that Pat exhausts all 30 houses in the neighborhood,
- and <span class="bold"><strong>still</strong></span> doesn't sell the required
- 5 candy bars?
- </p>
+ when he'd be very unlucky indeed!
+ </p>
<p>
- </p>
+ What is the probability that Pat exhausts all 30 houses in the neighborhood,
+ and <span class="bold"><strong>still</strong></span> doesn't sell the required
+ 5 candy bars?
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\nProbability of selling his quota of "</span> <span class="special"><<</span> <span class="identifier">sales_quota</span>
<span class="special"><<</span> <span class="string">" bars\non or before the "</span> <span class="special"><<</span> <span class="identifier">all_houses</span> <span class="special"><<</span> <span class="string">"th house is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">all_houses</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of selling his quota of 5 bars
on or before the 30th house is 0.99849
</pre>
<p>
- </p>
-<p>
- /*<code class="computeroutput"><span class="identifier">So</span> <span class="identifier">the</span>
- <span class="identifier">risk</span> <span class="identifier">of</span>
- <span class="identifier">failing</span> <span class="identifier">even</span>
- <span class="identifier">after</span> <span class="identifier">visiting</span>
- <span class="identifier">all</span> <span class="identifier">the</span>
- <span class="identifier">houses</span> <span class="identifier">is</span>
- <span class="number">1</span> <span class="special">-</span>
- <span class="keyword">this</span> <span class="identifier">probability</span><span class="special">,</span> </code><code class="computeroutput"><span class="number">1</span>
- <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">all_houses</span>
- <span class="special">-</span> <span class="identifier">sales_quota</span></code><code class="computeroutput">
- <span class="identifier">But</span> <span class="keyword">using</span>
- <span class="keyword">this</span> <span class="identifier">expression</span>
- <span class="identifier">may</span> <span class="identifier">cause</span>
- <span class="identifier">serious</span> <span class="identifier">inaccuracy</span><span class="special">,</span> <span class="identifier">so</span>
- <span class="identifier">it</span> <span class="identifier">would</span>
- <span class="identifier">be</span> <span class="identifier">much</span>
- <span class="identifier">better</span> <span class="identifier">to</span>
- <span class="identifier">use</span> <span class="identifier">the</span>
- <span class="identifier">complement</span> <span class="identifier">of</span>
- <span class="identifier">the</span> <span class="identifier">cdf</span><span class="special">:</span> <span class="identifier">So</span>
- <span class="identifier">the</span> <span class="identifier">risk</span>
- <span class="identifier">of</span> <span class="identifier">failing</span>
- <span class="identifier">even</span> <span class="identifier">at</span><span class="special">,</span> <span class="keyword">or</span> <span class="identifier">after</span><span class="special">,</span>
- <span class="identifier">the</span> <span class="number">31</span><span class="identifier">th</span> <span class="special">(</span><span class="identifier">non</span><span class="special">-</span><span class="identifier">existent</span><span class="special">)</span>
- <span class="identifier">houses</span> <span class="identifier">is</span>
- <span class="number">1</span> <span class="special">-</span>
- <span class="keyword">this</span> <span class="identifier">probability</span><span class="special">,</span> </code><code class="computeroutput"><span class="number">1</span>
- <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">all_houses</span>
- <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span></code>` But using this expression may cause
- serious inaccuracy. So it would be much better to use the complement
- of the cdf. <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
- </p>
-<p>
- </p>
+ /*<code class="computeroutput"><span class="identifier">So</span> <span class="identifier">the</span>
+ <span class="identifier">risk</span> <span class="identifier">of</span>
+ <span class="identifier">failing</span> <span class="identifier">even</span>
+ <span class="identifier">after</span> <span class="identifier">visiting</span>
+ <span class="identifier">all</span> <span class="identifier">the</span>
+ <span class="identifier">houses</span> <span class="identifier">is</span>
+ <span class="number">1</span> <span class="special">-</span>
+ <span class="keyword">this</span> <span class="identifier">probability</span><span class="special">,</span> </code><code class="computeroutput"><span class="number">1</span>
+ <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">all_houses</span>
+ <span class="special">-</span> <span class="identifier">sales_quota</span></code><code class="computeroutput">
+ <span class="identifier">But</span> <span class="keyword">using</span>
+ <span class="keyword">this</span> <span class="identifier">expression</span>
+ <span class="identifier">may</span> <span class="identifier">cause</span>
+ <span class="identifier">serious</span> <span class="identifier">inaccuracy</span><span class="special">,</span> <span class="identifier">so</span> <span class="identifier">it</span> <span class="identifier">would</span>
+ <span class="identifier">be</span> <span class="identifier">much</span>
+ <span class="identifier">better</span> <span class="identifier">to</span>
+ <span class="identifier">use</span> <span class="identifier">the</span>
+ <span class="identifier">complement</span> <span class="identifier">of</span>
+ <span class="identifier">the</span> <span class="identifier">cdf</span><span class="special">:</span> <span class="identifier">So</span> <span class="identifier">the</span> <span class="identifier">risk</span>
+ <span class="identifier">of</span> <span class="identifier">failing</span>
+ <span class="identifier">even</span> <span class="identifier">at</span><span class="special">,</span> <span class="keyword">or</span> <span class="identifier">after</span><span class="special">,</span>
+ <span class="identifier">the</span> <span class="number">31</span><span class="identifier">th</span> <span class="special">(</span><span class="identifier">non</span><span class="special">-</span><span class="identifier">existent</span><span class="special">)</span>
+ <span class="identifier">houses</span> <span class="identifier">is</span>
+ <span class="number">1</span> <span class="special">-</span>
+ <span class="keyword">this</span> <span class="identifier">probability</span><span class="special">,</span> </code><code class="computeroutput"><span class="number">1</span>
+ <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">all_houses</span>
+ <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">)</span></code>` But using this expression may cause
+ serious inaccuracy. So it would be much better to use the complement
+ of the cdf. <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\nProbability of failing to sell his quota of "</span> <span class="special"><<</span> <span class="identifier">sales_quota</span>
<span class="special"><<</span> <span class="string">" bars\neven after visiting all "</span> <span class="special"><<</span> <span class="identifier">all_houses</span> <span class="special"><<</span> <span class="string">" houses is "</span>
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">all_houses</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of failing to sell his quota of 5 bars
even after visiting all 30 houses is 0.0015101
</pre>
<p>
- </p>
-<p>
- We can also use the quantile (percentile), the inverse of the cdf,
- to predict which house Pat will finish on. So for the 8th house:
- </p>
-<p>
- </p>
+ We can also use the quantile (percentile), the inverse of the cdf,
+ to predict which house Pat will finish on. So for the 8th house:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">p</span> <span class="special">=</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="special">(</span><span class="number">8</span> <span class="special">-</span> <span class="identifier">sales_quota</span><span class="special">));</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability of meeting sales quota on or before 8th house is "</span><span class="special"><<</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">Probability of meeting sales quota on or before 8th house is 0.174
</pre>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"If the confidence of meeting sales quota is "</span> <span class="special"><<</span> <span class="identifier">p</span>
<span class="special"><<</span> <span class="string">", then the finishing house is "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">sales_quota</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span><span class="special"><<</span> <span class="string">" quantile(nb, p) = "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">If the confidence of meeting sales quota is 0.17367, then the finishing house is 8
</pre>
<p>
- </p>
-<p>
- Demanding absolute certainty that all 5 will be sold, implies an
- infinite number of trials. (Of course, there are only 30 houses on
- the estate, so he can't ever be <span class="bold"><strong>certain</strong></span>
- of selling his quota).
- </p>
-<p>
- </p>
+ Demanding absolute certainty that all 5 will be sold, implies an infinite
+ number of trials. (Of course, there are only 30 houses on the estate,
+ so he can't ever be <span class="bold"><strong>certain</strong></span> of selling
+ his quota).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"If the confidence of meeting sales quota is "</span> <span class="special"><<</span> <span class="number">1.</span>
<span class="special"><<</span> <span class="string">", then the finishing house is "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">sales_quota</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// 1.#INF == infinity.</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">If the confidence of meeting sales quota is 1, then the finishing house is 1.#INF
</pre>
<p>
- </p>
-<p>
- And similarly for a few other probabilities:
- </p>
-<p>
- </p>
+ And similarly for a few other probabilities:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"If the confidence of meeting sales quota is "</span> <span class="special"><<</span> <span class="number">0.</span>
<span class="special"><<</span> <span class="string">", then the finishing house is "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">0.</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">sales_quota</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -590,51 +445,35 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"If the confidence of meeting sales quota is "</span> <span class="special"><<</span> <span class="number">1</span> <span class="special">-</span> <span class="number">0.00151</span> <span class="comment">// 30 th
</span> <span class="special"><<</span> <span class="string">", then the finishing house is "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="number">1</span> <span class="special">-</span> <span class="number">0.00151</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">sales_quota</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">If the confidence of meeting sales quota is 0, then the finishing house is 5
If the confidence of meeting sales quota is 0.5, then the finishing house is 11.337
If the confidence of meeting sales quota is 0.99849, then the finishing house is 30
</pre>
<p>
- </p>
-<p>
- Notice that because we chose a discrete quantile policy of real,
- the result can be an 'unreal' fractional house.
- </p>
-<p>
- </p>
-<p>
- If the opposite is true, we don't want to assume any confidence,
- then this is tantamount to assuming that all the first sales_quota
- trials will be successful sales.
- </p>
+ Notice that because we chose a discrete quantile policy of real, the
+ result can be an 'unreal' fractional house.
+ </p>
<p>
- </p>
+ If the opposite is true, we don't want to assume any confidence, then
+ this is tantamount to assuming that all the first sales_quota trials
+ will be successful sales.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"If confidence of meeting quota is zero\n(we assume all houses are successful sales)"</span>
<span class="string">", then finishing house is "</span> <span class="special"><<</span> <span class="identifier">sales_quota</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">If confidence of meeting quota is zero (we assume all houses are successful sales), then finishing house is 5
If confidence of meeting quota is 0, then finishing house is 5
</pre>
<p>
- </p>
-<p>
- We can list quantiles for a few probabilities:
- </p>
-<p>
- </p>
+ We can list quantiles for a few probabilities:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="keyword">double</span> <span class="identifier">ps</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">0.</span><span class="special">,</span> <span class="number">0.001</span><span class="special">,</span> <span class="number">0.01</span><span class="special">,</span> <span class="number">0.05</span><span class="special">,</span> <span class="number">0.1</span><span class="special">,</span> <span class="number">0.5</span><span class="special">,</span> <span class="number">0.9</span><span class="special">,</span> <span class="number">0.95</span><span class="special">,</span> <span class="number">0.99</span><span class="special">,</span> <span class="number">0.999</span><span class="special">,</span> <span class="number">1.</span><span class="special">};</span>
<span class="comment">// Confidence as fraction = 1-alpha, as percent = 100 * (1-alpha[i]) %
@@ -646,10 +485,7 @@
<span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">If confidence of meeting quota is 0, then finishing house is 5
If confidence of meeting quota is 0.001, then finishing house is 5
If confidence of meeting quota is 0.01, then finishing house is 5
@@ -663,53 +499,38 @@
If confidence of meeting quota is 1, then finishing house is 1.#INF
</pre>
<p>
- </p>
-<p>
- We could have applied a ceil function to obtain a 'worst case' integer
- value for house.
+ We could have applied a ceil function to obtain a 'worst case' integer
+ value for house.
</p>
<pre class="programlisting"><span class="identifier">ceil</span><span class="special">(</span><span class="identifier">quantile</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="identifier">ps</span><span class="special">[</span><span class="identifier">i</span><span class="special">]))</span></pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<p>
- Or, if we had used the default discrete quantile policy, integer_outside,
- by omitting
+ Or, if we had used the default discrete quantile policy, integer_outside,
+ by omitting
</p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DISCRETE_QUANTILE_POLICY</span> <span class="identifier">real</span></pre>
<p>
- we would have achieved the same effect.
- </p>
-<p>
- </p>
-<p>
- The real result gives some suggestion which house is most likely.
- For example, compare the real and integer_outside for 95% confidence.
- </p>
+ we would have achieved the same effect.
+ </p>
<p>
-
-</p>
+ The real result gives some suggestion which house is most likely. For
+ example, compare the real and integer_outside for 95% confidence.
+ </p>
<pre class="programlisting">If confidence of meeting quota is 0.95, then finishing house is 20.1
If confidence of meeting quota is 0.95, then finishing house is 21
</pre>
<p>
- </p>
-<p>
- The real value 20.1 is much closer to 20 than 21, so integer_outside
- is pessimistic. We could also use integer_round_nearest policy to
- suggest that 20 is more likely.
- </p>
-<p>
- </p>
-<p>
- Finally, we can tabulate the probability for the last sale being
- exactly on each house.
- </p>
+ The real value 20.1 is much closer to 20 than 21, so integer_outside
+ is pessimistic. We could also use integer_round_nearest policy to suggest
+ that 20 is more likely.
+ </p>
<p>
- </p>
+ Finally, we can tabulate the probability for the last sale being exactly
+ on each house.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\nHouse for "</span> <span class="special"><<</span> <span class="identifier">sales_quota</span> <span class="special"><<</span> <span class="string">"th (last) sale. Probability (%)"</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span><span class="special">.</span><span class="identifier">precision</span><span class="special">(</span><span class="number">5</span><span class="special">);</span>
@@ -719,10 +540,7 @@
<span class="special">}</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
-
-</p>
+ </p>
<pre class="programlisting">House for 5 th (last) sale. Probability (%)
5 0.01024
6 0.04096
@@ -752,15 +570,11 @@
30 0.99849
</pre>
<p>
- </p>
-<p>
- As noted above, using a catch block is always a good idea, even if
- you do not expect to use it.
- </p>
-<p>
- </p>
+ As noted above, using a catch block is always a good idea, even if
+ you do not expect to use it.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="special">}</span>
<span class="keyword">catch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span><span class="special">&</span> <span class="identifier">e</span><span class="special">)</span>
@@ -768,26 +582,19 @@
</span> <span class="comment">// an overflow exception should never be thrown.
</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"\nMessage from thrown exception was:\n "</span> <span class="special"><<</span> <span class="identifier">e</span><span class="special">.</span><span class="identifier">what</span><span class="special">()</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<p>
- For example, without a ignore domain error policy, if we asked for
-
+ For example, without a ignore domain error policy, if we asked for
+
</p>
<pre class="programlisting"><span class="identifier">pdf</span><span class="special">(</span><span class="identifier">nb</span><span class="special">,</span> <span class="special">-</span><span class="number">1</span><span class="special">)</span></pre>
<p>
- for example, we would get:
- </p>
-<p>
-
-</p>
+ for example, we would get:
+ </p>
<pre class="programlisting">Message from thrown exception was:
Error in function boost::math::pdf(const negative_binomial_distribution<double>&, double):
Number of failures argument is -1, but must be >= 0 !
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,17 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example2"></a><a class="link" href="negative_binomial_example2.html" title="Negative Binomial Table Printing Example.">
- Negative Binomial Table Printing Example.</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example2"></a><a class="link" href="negative_binomial_example2.html" title="Negative Binomial Table Printing Example.">Negative
+ Binomial Table Printing Example.</a>
</h6></div></div></div>
<p>
Example program showing output of a table of values of cdf and pdf
for various k failures.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Print a table of values that can be used to plot
</span><span class="comment">// using Excel, or some other superior graphical display tool.
@@ -56,11 +54,9 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">k</span> <span class="identifier">pdf</span> <span class="identifier">cdf</span>
<span class="number">0</span><span class="special">,</span> <span class="number">1.5258789062500000e-005</span> <span class="number">1.5258789062500003e-005</span>
@@ -129,8 +125,6 @@
<span class="number">63</span><span class="special">,</span> <span class="number">0.00024610318764958566</span> <span class="number">0.99882473495070978</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.normal_example"></a><a class="link" href="normal_example.html" title="Normal Distribution Examples"> Normal
+<a name="math_toolkit.dist.stat_tut.weg.normal_example"></a><a class="link" href="normal_example.html" title="Normal Distribution Examples">Normal
Distribution Examples</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="normal_example/normal_misc.html">
- Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="normal_example/normal_misc.html">Some
+ Miscellaneous Examples of the Normal (Gaussian) Distribution</a></span></dt></dl></div>
<p>
(See also the reference documentation for the <a class="link" href="../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
Distribution</a>.)
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,28 +24,24 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc"></a><a class="link" href="normal_misc.html" title="Some Miscellaneous Examples of the Normal (Gaussian) Distribution">
- Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc"></a><a class="link" href="normal_misc.html" title="Some Miscellaneous Examples of the Normal (Gaussian) Distribution">Some
+ Miscellaneous Examples of the Normal (Gaussian) Distribution</a>
</h6></div></div></div>
<p>
The sample program normal_misc_examples.cpp
illustrates their use.
</p>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.traditional_tables"></a><h5>
-<a name="id972622"></a>
+<a name="id1089796"></a>
<a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.traditional_tables">Traditional
Tables</a>
</h5>
<p>
- </p>
-<p>
- First we need some includes to access the normal distribution (and
- some std output of course).
- </p>
-<p>
- </p>
+ First we need some includes to access the normal distribution (and
+ some std output of course).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for normal_distribution
</span> <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal</span><span class="special">;</span> <span class="comment">// typedef provides default type is double.
@@ -65,36 +61,32 @@
<span class="special">{</span>
<span class="special">{</span> <span class="comment">// Traditional tables and values.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Let's start by printing some traditional tables.
- </p>
+ </p>
<p>
- </p>
+ Let's start by printing some traditional tables.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">step</span> <span class="special">=</span> <span class="number">1.</span><span class="special">;</span> <span class="comment">// in z
</span><span class="keyword">double</span> <span class="identifier">range</span> <span class="special">=</span> <span class="number">4</span><span class="special">;</span> <span class="comment">// min and max z = -range to +range.
</span><span class="keyword">int</span> <span class="identifier">precision</span> <span class="special">=</span> <span class="number">17</span><span class="special">;</span> <span class="comment">// traditional tables are only computed to much lower precision.
+</span><span class="comment">// but std::numeric_limits<double>::max_digits10; on new Standard Libraries gives
+</span><span class="comment">// 17, the maximum number of digits that can possibly be significant.
+</span><span class="comment">// std::numeric_limits<double>::digits10; == 15 is number of guaranteed digits,
+</span><span class="comment">// the other two digits being 'noisy'.
</span>
<span class="comment">// Construct a standard normal distribution s
</span> <span class="identifier">normal</span> <span class="identifier">s</span><span class="special">;</span> <span class="comment">// (default mean = zero, and standard deviation = unity)
</span> <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Standard normal distribution, mean = "</span><span class="special"><<</span> <span class="identifier">s</span><span class="special">.</span><span class="identifier">mean</span><span class="special">()</span>
<span class="special"><<</span> <span class="string">", standard deviation = "</span> <span class="special"><<</span> <span class="identifier">s</span><span class="special">.</span><span class="identifier">standard_deviation</span><span class="special">()</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- First the probability distribution function (pdf).
- </p>
+ </p>
<p>
- </p>
+ First the probability distribution function (pdf).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Probability distribution function values"</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">" z "</span> <span class="string">" pdf "</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -106,17 +98,13 @@
<span class="special">}</span>
<span class="identifier">cout</span><span class="special">.</span><span class="identifier">precision</span><span class="special">(</span><span class="number">6</span><span class="special">);</span> <span class="comment">// default</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And the area under the normal curve from -∞ up to z, the cumulative
- distribution function (cdf).
- </p>
+ </p>
<p>
- </p>
+ And the area under the normal curve from -∞ up to z, the cumulative distribution
+ function (cdf).
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// For a standard normal distribution
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Standard normal mean = "</span><span class="special"><<</span> <span class="identifier">s</span><span class="special">.</span><span class="identifier">mean</span><span class="special">()</span>
@@ -130,116 +118,88 @@
<span class="special">}</span>
<span class="identifier">cout</span><span class="special">.</span><span class="identifier">precision</span><span class="special">(</span><span class="number">6</span><span class="special">);</span> <span class="comment">// default</span></pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<p>
- And all this you can do with a nanoscopic amount of work compared
- to the team of <span class="bold"><strong>human computers</strong></span> toiling
- with Milton Abramovitz and Irene Stegen at the US National Bureau
- of Standards (now NIST).
- Starting in 1938, their "Handbook of Mathematical Functions
- with Formulas, Graphs and Mathematical Tables", was eventually
- published in 1964, and has been reprinted numerous times since. (A
- major replacement is planned at <a href="http://dlmf.nist.gov" target="_top">Digital
- Library of Mathematical Functions</a>).
- </p>
-<p>
- </p>
-<p>
- Pretty-printing a traditional 2-dimensional table is left as an exercise
- for the student, but why bother now that the Math Toolkit lets you
- write
- </p>
+ And all this you can do with a nanoscopic amount of work compared to
+ the team of <span class="bold"><strong>human computers</strong></span> toiling
+ with Milton Abramovitz and Irene Stegen at the US National Bureau of
+ Standards (now NIST). Starting
+ in 1938, their "Handbook of Mathematical Functions with Formulas,
+ Graphs and Mathematical Tables", was eventually published in 1964,
+ and has been reprinted numerous times since. (A major replacement is
+ planned at <a href="http://dlmf.nist.gov" target="_top">Digital Library of Mathematical
+ Functions</a>).
+ </p>
<p>
- </p>
+ Pretty-printing a traditional 2-dimensional table is left as an exercise
+ for the student, but why bother now that the Math Toolkit lets you
+ write
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">z</span> <span class="special">=</span> <span class="number">2.</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Area for z = "</span> <span class="special"><<</span> <span class="identifier">z</span> <span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="identifier">z</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// to get the area for z.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Correspondingly, we can obtain the traditional 'critical' values
- for significance levels. For the 95% confidence level, the significance
- level usually called alpha, is 0.05 = 1 - 0.95 (for a one-sided test),
- so we can write
- </p>
+ </p>
<p>
- </p>
+ Correspondingly, we can obtain the traditional 'critical' values for
+ significance levels. For the 95% confidence level, the significance
+ level usually called alpha, is 0.05 = 1 - 0.95 (for a one-sided test),
+ so we can write
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"95% of area has a z below "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="number">0.95</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// 95% of area has a z below 1.64485</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- and a two-sided test (a comparison between two levels, rather than
- a one-sided test)
- </p>
+ </p>
<p>
- </p>
+ and a two-sided test (a comparison between two levels, rather than
+ a one-sided test)
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"95% of area has a z between "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="number">0.975</span><span class="special">)</span>
<span class="special"><<</span> <span class="string">" and "</span> <span class="special"><<</span> <span class="special">-</span><span class="identifier">quantile</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="number">0.975</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// 95% of area has a z between 1.95996 and -1.95996</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- First, define a table of significance levels: these are the probabilities
- that the true occurrence frequency lies outside the calculated interval.
- </p>
-<p>
- </p>
+ </p>
<p>
- It is convenient to have an alpha level for the probability that
- z lies outside just one standard deviation. This will not be some
- nice neat number like 0.05, but we can easily calculate it,
- </p>
+ First, define a table of significance levels: these are the probabilities
+ that the true occurrence frequency lies outside the calculated interval.
+ </p>
<p>
- </p>
+ It is convenient to have an alpha level for the probability that z
+ lies outside just one standard deviation. This will not be some nice
+ neat number like 0.05, but we can easily calculate it,
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">alpha1</span> <span class="special">=</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="special">-</span><span class="number">1</span><span class="special">)</span> <span class="special">*</span> <span class="number">2</span><span class="special">;</span> <span class="comment">// 0.3173105078629142
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">setprecision</span><span class="special">(</span><span class="number">17</span><span class="special">)</span> <span class="special"><<</span> <span class="string">"Significance level for z == 1 is "</span> <span class="special"><<</span> <span class="identifier">alpha1</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- and place in our array of favorite alpha values.
- </p>
+ </p>
<p>
- </p>
+ and place in our array of favorite alpha values.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">alpha</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">0.3173105078629142</span><span class="special">,</span> <span class="comment">// z for 1 standard deviation.
</span> <span class="number">0.20</span><span class="special">,</span> <span class="number">0.1</span><span class="special">,</span> <span class="number">0.05</span><span class="special">,</span> <span class="number">0.01</span><span class="special">,</span> <span class="number">0.001</span><span class="special">,</span> <span class="number">0.0001</span><span class="special">,</span> <span class="number">0.00001</span> <span class="special">};</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Confidence value as % is (1 - alpha) * 100 (so alpha 0.05 == 95%
- confidence) that the true occurrence frequency lies <span class="bold"><strong>inside</strong></span>
- the calculated interval.
- </p>
+ </p>
<p>
- </p>
+ Confidence value as % is (1 - alpha) * 100 (so alpha 0.05 == 95% confidence)
+ that the true occurrence frequency lies <span class="bold"><strong>inside</strong></span>
+ the calculated interval.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"level of significance (alpha)"</span> <span class="special"><<</span> <span class="identifier">setprecision</span><span class="special">(</span><span class="number">4</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"2-sided 1 -sided z(alpha) "</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -250,49 +210,37 @@
</span><span class="special">}</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
+ </p>
<p>
- </p>
+ Notice the distinction between one-sided (also called one-tailed) where
+ we are using a > <span class="bold"><strong>or</strong></span> < test (and
+ not both) and considering the area of the tail (integral) from z up
+ to +∞, and a two-sided test where we are using two > <span class="bold"><strong>and</strong></span>
+ < tests, and thus considering two tails, from -∞ up to z low and z
+ high up to +∞.
+ </p>
<p>
- Notice the distinction between one-sided (also called one-tailed)
- where we are using a > <span class="bold"><strong>or</strong></span> <
- test (and not both) and considering the area of the tail (integral)
- from z up to +∞, and a two-sided test where we are using two >
- <span class="bold"><strong>and</strong></span> < tests, and thus considering
- two tails, from -∞ up to z low and z high up to +∞.
- </p>
-<p>
- </p>
-<p>
- So the 2-sided values alpha[i] are calculated using alpha[i]/2.
- </p>
-<p>
- </p>
-<p>
- If we consider a simple example of alpha = 0.05, then for a two-sided
- test, the lower tail area from -∞ up to -1.96 is 0.025 (alpha/2) and
- the upper tail area from +z up to +1.96 is also 0.025 (alpha/2),
- and the area between -1.96 up to 12.96 is alpha = 0.95. and the sum
- of the two tails is 0.025 + 0.025 = 0.05,
- </p>
+ So the 2-sided values alpha[i] are calculated using alpha[i]/2.
+ </p>
<p>
+ If we consider a simple example of alpha = 0.05, then for a two-sided
+ test, the lower tail area from -∞ up to -1.96 is 0.025 (alpha/2) and
+ the upper tail area from +z up to +1.96 is also 0.025 (alpha/2), and
+ the area between -1.96 up to 12.96 is alpha = 0.95. and the sum of
+ the two tails is 0.025 + 0.025 = 0.05,
</p>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.standard_deviations_either_side_of_the_mean"></a><h5>
-<a name="id976060"></a>
+<a name="id1093788"></a>
<a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.standard_deviations_either_side_of_the_mean">Standard
deviations either side of the Mean</a>
</h5>
<p>
- </p>
-<p>
- Armed with the cumulative distribution function, we can easily calculate
- the easy to remember proportion of values that lie within 1, 2 and
- 3 standard deviations from the mean.
- </p>
-<p>
- </p>
+ Armed with the cumulative distribution function, we can easily calculate
+ the easy to remember proportion of values that lie within 1, 2 and
+ 3 standard deviations from the mean.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span><span class="special">.</span><span class="identifier">precision</span><span class="special">(</span><span class="number">3</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">showpoint</span> <span class="special"><<</span> <span class="string">"cdf(s, s.standard_deviation()) = "</span>
@@ -306,105 +254,77 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Fraction 3 standard deviations within either side of mean is "</span>
<span class="special"><<</span> <span class="number">1</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="number">3</span> <span class="special">*</span> <span class="identifier">s</span><span class="special">.</span><span class="identifier">standard_deviation</span><span class="special">()))</span> <span class="special">*</span> <span class="number">2</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- To a useful precision, the 1, 2 & 3 percentages are 68, 95 and
- 99.7, and these are worth memorising as useful 'rules of thumb',
- as, for example, in <a href="http://en.wikipedia.org/wiki/Standard_deviation" target="_top">standard
- deviation</a>:
- </p>
+ </p>
<p>
-
-</p>
+ To a useful precision, the 1, 2 & 3 percentages are 68, 95 and
+ 99.7, and these are worth memorising as useful 'rules of thumb', as,
+ for example, in <a href="http://en.wikipedia.org/wiki/Standard_deviation" target="_top">standard
+ deviation</a>:
+ </p>
<pre class="programlisting">Fraction 1 standard deviation within either side of mean is 0.683
Fraction 2 standard deviations within either side of mean is 0.954
Fraction 3 standard deviations within either side of mean is 0.997
</pre>
<p>
- </p>
-<p>
- We could of course get some really accurate values for these <a href="http://en.wikipedia.org/wiki/Confidence_interval" target="_top">confidence
- intervals</a> by using cout.precision(15);
- </p>
-<p>
-
-</p>
+ We could of course get some really accurate values for these confidence intervals
+ by using cout.precision(15);
+ </p>
<pre class="programlisting">Fraction 1 standard deviation within either side of mean is 0.682689492137086
Fraction 2 standard deviations within either side of mean is 0.954499736103642
Fraction 3 standard deviations within either side of mean is 0.997300203936740
</pre>
<p>
- </p>
-<p>
- But before you get too excited about this impressive precision, don't
- forget that the <span class="bold"><strong>confidence intervals of the
- standard deviation</strong></span> are surprisingly wide, especially if
- you have estimated the standard deviation from only a few measurements.
- </p>
-<p>
+ But before you get too excited about this impressive precision, don't
+ forget that the <span class="bold"><strong>confidence intervals of the standard
+ deviation</strong></span> are surprisingly wide, especially if you have
+ estimated the standard deviation from only a few measurements.
</p>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.some_simple_examples"></a><h5>
-<a name="id976885"></a>
+<a name="id1094308"></a>
<a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.some_simple_examples">Some
simple examples</a>
</h5>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.life_of_light_bulbs"></a><h5>
-<a name="id976898"></a>
+<a name="id1094322"></a>
<a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.life_of_light_bulbs">Life
of light bulbs</a>
</h5>
<p>
- </p>
-<p>
- Examples from K. Krishnamoorthy, Handbook of Statistical Distributions
- with Applications, ISBN 1 58488 635 8, page 125... implemented using
- the Math Toolkit library.
- </p>
-<p>
- </p>
-<p>
- A few very simple examples are shown here:
- </p>
+ Examples from K. Krishnamoorthy, Handbook of Statistical Distributions
+ with Applications, ISBN 1 58488 635 8, page 125... implemented using
+ the Math Toolkit library.
+ </p>
<p>
- </p>
+ A few very simple examples are shown here:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// K. Krishnamoorthy, Handbook of Statistical Distributions with Applications,
</span> <span class="comment">// ISBN 1 58488 635 8, page 125, example 10.3.5</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Mean lifespan of 100 W bulbs is 1100 h with standard deviation of
- 100 h. Assuming, perhaps with little evidence and much faith, that
- the distribution is normal, we construct a normal distribution called
- <span class="emphasis"><em>bulbs</em></span> with these values:
- </p>
+ </p>
<p>
- </p>
+ Mean lifespan of 100 W bulbs is 1100 h with standard deviation of 100
+ h. Assuming, perhaps with little evidence and much faith, that the
+ distribution is normal, we construct a normal distribution called
+ <span class="emphasis"><em>bulbs</em></span> with these values:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">mean_life</span> <span class="special">=</span> <span class="number">1100.</span><span class="special">;</span>
<span class="keyword">double</span> <span class="identifier">life_standard_deviation</span> <span class="special">=</span> <span class="number">100.</span><span class="special">;</span>
<span class="identifier">normal</span> <span class="identifier">bulbs</span><span class="special">(</span><span class="identifier">mean_life</span><span class="special">,</span> <span class="identifier">life_standard_deviation</span><span class="special">);</span>
<span class="keyword">double</span> <span class="identifier">expected_life</span> <span class="special">=</span> <span class="number">1000.</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- The we can use the Cumulative distribution function to predict fractions
- (or percentages, if * 100) that will last various lifetimes.
- </p>
+ </p>
<p>
- </p>
+ The we can use the Cumulative distribution function to predict fractions
+ (or percentages, if * 100) that will last various lifetimes.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Fraction of bulbs that will last at best (<=) "</span> <span class="comment">// P(X <= 1000)
</span> <span class="special"><<</span> <span class="identifier">expected_life</span> <span class="special"><<</span> <span class="string">" is "</span><span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">bulbs</span><span class="special">,</span> <span class="identifier">expected_life</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -417,38 +337,30 @@
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">bulbs</span><span class="special">,</span> <span class="identifier">max_life</span><span class="special">)</span> <span class="comment">// P(X <= 1200)
</span> <span class="special">-</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">bulbs</span><span class="special">,</span> <span class="identifier">min_life</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// P(X <= 900)</span></pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
- Real-life failures are often very ab-normal, with a significant
- number that 'dead-on-arrival' or suffer failure very early in their
- life: the lifetime of the survivors of 'early mortality' may be
- well described by the normal distribution.
- </p></td></tr>
+ Real-life failures are often very ab-normal, with a significant number
+ that 'dead-on-arrival' or suffer failure very early in their life:
+ the lifetime of the survivors of 'early mortality' may be well described
+ by the normal distribution.
+ </p></td></tr>
</table></div>
-<p>
- </p>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.how_many_onions_"></a><h5>
-<a name="id977409"></a>
+<a name="id1094829"></a>
<a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.how_many_onions_">How
many onions?</a>
</h5>
<p>
- </p>
-<p>
- Weekly demand for 5 lb sacks of onions at a store is normally distributed
- with mean 140 sacks and standard deviation 10.
- </p>
-<p>
- </p>
+ Weekly demand for 5 lb sacks of onions at a store is normally distributed
+ with mean 140 sacks and standard deviation 10.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">mean</span> <span class="special">=</span> <span class="number">140.</span><span class="special">;</span> <span class="comment">// sacks per week.
</span><span class="keyword">double</span> <span class="identifier">standard_deviation</span> <span class="special">=</span> <span class="number">10</span><span class="special">;</span>
@@ -459,58 +371,44 @@
<span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">sacks</span><span class="special">,</span> <span class="identifier">stock</span><span class="special">)</span> <span class="special">*</span> <span class="number">100.</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// P(X <=160)
</span><span class="comment">// Percentage of weeks overstocked 97.7</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- So there will be lots of mouldy onions! So we should be able to say
- what stock level will meet demand 95% of the weeks.
- </p>
+ </p>
<p>
- </p>
+ So there will be lots of mouldy onions! So we should be able to say
+ what stock level will meet demand 95% of the weeks.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">stock_95</span> <span class="special">=</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">sacks</span><span class="special">,</span> <span class="number">0.95</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Store should stock "</span> <span class="special"><<</span> <span class="keyword">int</span><span class="special">(</span><span class="identifier">stock_95</span><span class="special">)</span> <span class="special"><<</span> <span class="string">" sacks to meet 95% of demands."</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- And it is easy to estimate how to meet 80% of demand, and waste even
- less.
- </p>
+ </p>
<p>
- </p>
+ And it is easy to estimate how to meet 80% of demand, and waste even
+ less.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">stock_80</span> <span class="special">=</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">sacks</span><span class="special">,</span> <span class="number">0.80</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Store should stock "</span> <span class="special"><<</span> <span class="keyword">int</span><span class="special">(</span><span class="identifier">stock_80</span><span class="special">)</span> <span class="special"><<</span> <span class="string">" sacks to meet 8 out of 10 demands."</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.packing_beef"></a><h5>
-<a name="id977827"></a>
+<a name="id1095244"></a>
<a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.packing_beef">Packing
beef</a>
</h5>
<p>
- </p>
-<p>
- A machine is set to pack 3 kg of ground beef per pack. Over a long
- period of time it is found that the average packed was 3 kg with
- a standard deviation of 0.1 kg. Assuming the packing is normally
- distributed, we can find the fraction (or %) of packages that weigh
- more than 3.1 kg.
- </p>
-<p>
- </p>
+ A machine is set to pack 3 kg of ground beef per pack. Over a long
+ period of time it is found that the average packed was 3 kg with a
+ standard deviation of 0.1 kg. Assuming the packing is normally distributed,
+ we can find the fraction (or %) of packages that weigh more than 3.1
+ kg.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">mean</span> <span class="special">=</span> <span class="number">3.</span><span class="special">;</span> <span class="comment">// kg
</span><span class="keyword">double</span> <span class="identifier">standard_deviation</span> <span class="special">=</span> <span class="number">0.1</span><span class="special">;</span> <span class="comment">// kg
@@ -543,65 +441,47 @@
<span class="special"><<</span> <span class="string">"fraction of packs >= "</span> <span class="special"><<</span> <span class="identifier">under_weight</span>
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">nominal_packs</span><span class="special">,</span> <span class="identifier">under_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Setting the packer to 3.06449 will mean that fraction of packs >=
- 2.9 is 0.95.
- </p>
-<p>
- </p>
-<p>
- Setting the packer to 3.13263 will mean that fraction of packs >=
- 2.9 is 0.99, but will more than double the mean loss from 0.0644
- to 0.133.
- </p>
-<p>
- </p>
+ </p>
<p>
- Alternatively, we could invest in a better (more precise) packer
- with a lower standard deviation.
- </p>
+ Setting the packer to 3.06449 will mean that fraction of packs >=
+ 2.9 is 0.95.
+ </p>
<p>
- </p>
+ Setting the packer to 3.13263 will mean that fraction of packs >=
+ 2.9 is 0.99, but will more than double the mean loss from 0.0644 to
+ 0.133.
+ </p>
<p>
- To estimate how much better (how much smaller standard deviation)
- it would have to be, we need to get the 5% quantile to be located
- at the under_weight limit, 2.9
- </p>
+ Alternatively, we could invest in a better (more precise) packer with
+ a lower standard deviation.
+ </p>
<p>
- </p>
+ To estimate how much better (how much smaller standard deviation) it
+ would have to be, we need to get the 5% quantile to be located at the
+ under_weight limit, 2.9
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">p</span> <span class="special">=</span> <span class="number">0.05</span><span class="special">;</span> <span class="comment">// wanted p th quantile.
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quantile of "</span> <span class="special"><<</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">packs</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span>
<span class="special"><<</span> <span class="string">", mean = "</span> <span class="special"><<</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">mean</span><span class="special">()</span> <span class="special"><<</span> <span class="string">", sd = "</span> <span class="special"><<</span> <span class="identifier">packs</span><span class="special">.</span><span class="identifier">standard_deviation</span><span class="special">()</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">//</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
- </p>
-<p>
- </p>
-<p>
- With the current packer (mean = 3, sd = 0.1), the 5% quantile is
- at 2.8551 kg, a little below our target of 2.9 kg. So we know that
- the standard deviation is going to have to be smaller.
- </p>
+ </p>
<p>
- </p>
+ Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
+ </p>
<p>
- Let's start by guessing that it (now 0.1) needs to be halved, to
- a standard deviation of 0.05
- </p>
+ With the current packer (mean = 3, sd = 0.1), the 5% quantile is at
+ 2.8551 kg, a little below our target of 2.9 kg. So we know that the
+ standard deviation is going to have to be smaller.
+ </p>
<p>
- </p>
+ Let's start by guessing that it (now 0.1) needs to be halved, to a
+ standard deviation of 0.05
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">pack05</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="number">0.05</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quantile of "</span> <span class="special"><<</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">pack05</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span>
@@ -612,24 +492,18 @@
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">pack05</span><span class="special">,</span> <span class="identifier">under_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="comment">//</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Fraction of packs >= 2.9 with a mean of 3 and standard deviation
- of 0.05 is 0.9772
- </p>
-<p>
- </p>
+ </p>
<p>
- So 0.05 was quite a good guess, but we are a little over the 2.9
- target, so the standard deviation could be a tiny bit more. So we
- could do some more guessing to get closer, say by increasing to 0.06
- </p>
+ Fraction of packs >= 2.9 with a mean of 3 and standard deviation
+ of 0.05 is 0.9772
+ </p>
<p>
- </p>
+ So 0.05 was quite a good guess, but we are a little over the 2.9 target,
+ so the standard deviation could be a tiny bit more. So we could do
+ some more guessing to get closer, say by increasing to 0.06
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">pack06</span><span class="special">(</span><span class="identifier">mean</span><span class="special">,</span> <span class="number">0.06</span><span class="special">);</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Quantile of "</span> <span class="special"><<</span> <span class="identifier">p</span> <span class="special"><<</span> <span class="string">" = "</span> <span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">pack06</span><span class="special">,</span> <span class="identifier">p</span><span class="special">)</span>
@@ -639,31 +513,23 @@
<span class="special"><<</span> <span class="string">" and standard deviation of "</span> <span class="special"><<</span> <span class="identifier">pack06</span><span class="special">.</span><span class="identifier">standard_deviation</span><span class="special">()</span>
<span class="special"><<</span> <span class="string">" is "</span> <span class="special"><<</span> <span class="identifier">cdf</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">pack06</span><span class="special">,</span> <span class="identifier">under_weight</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Fraction of packs >= 2.9 with a mean of 3 and standard deviation
- of 0.06 is 0.9522
- </p>
-<p>
- </p>
-<p>
- Now we are getting really close, but to do the job properly, we could
- use root finding method, for example the tools provided, and used
- elsewhere, in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">Root
- Finding Without Derivatives</a>.
- </p>
+ </p>
<p>
- </p>
+ Fraction of packs >= 2.9 with a mean of 3 and standard deviation
+ of 0.06 is 0.9522
+ </p>
<p>
- But in this normal distribution case, we could be even smarter and
- make a direct calculation.
- </p>
+ Now we are getting really close, but to do the job properly, we could
+ use root finding method, for example the tools provided, and used elsewhere,
+ in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">Root
+ Finding Without Derivatives</a>.
+ </p>
<p>
- </p>
+ But in this normal distribution case, we could be even smarter and
+ make a direct calculation.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">normal</span> <span class="identifier">s</span><span class="special">;</span> <span class="comment">// For standard normal distribution,
</span><span class="keyword">double</span> <span class="identifier">sd</span> <span class="special">=</span> <span class="number">0.1</span><span class="special">;</span>
@@ -689,37 +555,29 @@
<span class="comment">// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.0608 is 0.95</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Notice that these two deceptively simple questions (do we over-fill
- or measure better) are actually very common. The weight of beef might
- be replaced by a measurement of more or less anything. But the calculations
- rely on the accuracy of the standard deviation - something that is
- almost always less good than we might wish, especially if based on
- a few measurements.
- </p>
+ </p>
<p>
+ Notice that these two deceptively simple questions (do we over-fill
+ or measure better) are actually very common. The weight of beef might
+ be replaced by a measurement of more or less anything. But the calculations
+ rely on the accuracy of the standard deviation - something that is
+ almost always less good than we might wish, especially if based on
+ a few measurements.
</p>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.length_of_bolts"></a><h5>
-<a name="id980594"></a>
+<a name="id1097598"></a>
<a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.length_of_bolts">Length
of bolts</a>
</h5>
<p>
- </p>
-<p>
- A bolt is usable if between 3.9 and 4.1 long. From a large batch
- of bolts, a sample of 50 show a mean length of 3.95 with standard
- deviation 0.1. Assuming a normal distribution, what proportion is
- usable? The true sample mean is unknown, but we can use the sample
- mean and standard deviation to find approximate solutions.
- </p>
-<p>
- </p>
+ A bolt is usable if between 3.9 and 4.1 long. From a large batch of
+ bolts, a sample of 50 show a mean length of 3.95 with standard deviation
+ 0.1. Assuming a normal distribution, what proportion is usable? The
+ true sample mean is unknown, but we can use the sample mean and standard
+ deviation to find approximate solutions.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="identifier">normal</span> <span class="identifier">bolts</span><span class="special">(</span><span class="number">3.95</span><span class="special">,</span> <span class="number">0.1</span><span class="special">);</span>
<span class="keyword">double</span> <span class="identifier">top</span> <span class="special">=</span> <span class="number">4.1</span><span class="special">;</span>
@@ -738,8 +596,6 @@
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,21 +24,21 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg"></a><a class="link" href="st_eg.html" title="Student's t Distribution Examples"> Student's
- t Distribution Examples</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg"></a><a class="link" href="st_eg.html" title="Student's t Distribution Examples">Student's t
+ Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></span></dt>
-<dt><span class="section"><a href="st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></span></dt>
-<dt><span class="section"><a href="st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></span></dt>
-<dt><span class="section"><a href="st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></span></dt>
-<dt><span class="section"><a href="st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></span></dt>
+<dt><span class="section"><a href="st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></span></dt>
+<dt><span class="section"><a href="st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></span></dt>
+<dt><span class="section"><a href="st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></span></dt>
+<dt><span class="section"><a href="st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></span></dt>
+<dt><span class="section"><a href="st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.paired_st"></a><a class="link" href="paired_st.html" title="Comparing two paired samples with the Student's t distribution">
- Comparing two paired samples with the Student's t distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.paired_st"></a><a class="link" href="paired_st.html" title="Comparing two paired samples with the Student's t distribution">Comparing
+ two paired samples with the Student's t distribution</a>
</h6></div></div></div>
<p>
Imagine that we have a before and after reading for each item in the
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_intervals"></a><a class="link" href="tut_mean_intervals.html" title="Calculating confidence intervals on the mean with the Students-t distribution">
- Calculating confidence intervals on the mean with the Students-t distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_intervals"></a><a class="link" href="tut_mean_intervals.html" title="Calculating confidence intervals on the mean with the Students-t distribution">Calculating
+ confidence intervals on the mean with the Students-t distribution</a>
</h6></div></div></div>
<p>
Let's say you have a sample mean, you may wish to know what confidence
@@ -57,7 +57,7 @@
</tr>
<tr><td align="left" valign="top">
<p>
- The quantity α ​ is the maximum acceptable risk of falsely rejecting
+ The quantity α   is the maximum acceptable risk of falsely rejecting
the null-hypothesis. The smaller the value of α the greater the strength
of the test.
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,9 +24,9 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_size"></a><a class="link" href="tut_mean_size.html" title="Estimating how large a sample size would have to become in order to give a significant Students-t test result with a single sample test">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_size"></a><a class="link" href="tut_mean_size.html" title="Estimating how large a sample size would have to become in order to give a significant Students-t test result with a single sample test">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a>
</h6></div></div></div>
<p>
Imagine you have conducted a Students-t test on a single sample in
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_test"></a><a class="link" href="tut_mean_test.html" title='Testing a sample mean for difference from a "true" mean'>
- Testing a sample mean for difference from a "true" mean</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_test"></a><a class="link" href="tut_mean_test.html" title='Testing a sample mean for difference from a "true" mean'>Testing
+ a sample mean for difference from a "true" mean</a>
</h6></div></div></div>
<p>
When calibrating or comparing a scientific instrument or measurement
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.two_sample_students_t"></a><a class="link" href="two_sample_students_t.html" title="Comparing the means of two samples with the Students-t test">
- Comparing the means of two samples with the Students-t test</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.two_sample_students_t"></a><a class="link" href="two_sample_students_t.html" title="Comparing the means of two samples with the Students-t test">Comparing
+ the means of two samples with the Students-t test</a>
</h6></div></div></div>
<p>
Imagine that we have two samples, and we wish to determine whether
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.extern_c"></a><a class="link" href="extern_c.html" title='TR1 and C99 external "C" Functions'> TR1 and C99 external "C"
+<a name="math_toolkit.extern_c"></a><a class="link" href="extern_c.html" title='TR1 and C99 external "C" Functions'>TR1 and C99 external "C"
Functions</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> C99 and TR1 C Functions Overview</span></dt>
-<dt><span class="section"> C99 C Functions</span></dt>
-<dt><span class="section"><a href="extern_c/tr1_ref.html"> TR1 C Functions Quick
+<dt><span class="section">C99 and TR1 C Functions Overview</span></dt>
+<dt><span class="section">C99 C Functions</span></dt>
+<dt><span class="section"><a href="extern_c/tr1_ref.html">TR1 C Functions Quick
Reference</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.extern_c.c99"></a><a class="link" href="c99.html" title="C99 C Functions"> C99 C Functions</a>
+<a name="math_toolkit.extern_c.c99"></a><a class="link" href="c99.html" title="C99 C Functions">C99 C Functions</a>
</h3></div></div></div>
<a name="math_toolkit.extern_c.c99.supported_c99_functions"></a><h5>
-<a name="id1172292"></a>
+<a name="id1301593"></a>
<a class="link" href="c99.html#math_toolkit.extern_c.c99.supported_c99_functions">Supported
C99 Functions</a>
</h5>
@@ -138,7 +138,7 @@
</span><span class="identifier">acosh</span><span class="special">(</span><span class="number">2</span><span class="special">);</span> <span class="comment">// integer argument is treated as a double, returns double.
</span></pre>
<a name="math_toolkit.extern_c.c99.quick_reference"></a><h5>
-<a name="id1176218"></a>
+<a name="id1304411"></a>
<a class="link" href="c99.html#math_toolkit.extern_c.c99.quick_reference">Quick Reference</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,86 +24,68 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.extern_c.tr1"></a><a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview"> C99 and TR1 C Functions Overview</a>
+<a name="math_toolkit.extern_c.tr1"></a><a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview">C99 and TR1 C Functions Overview</a>
</h3></div></div></div>
<p>
- </p>
-<p>
- Many of the special functions included in this library are also a part
- of the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
- Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
- Report on C++ Library Extensions</a>. Therefore this library includes
- a thin wrapper header <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span></code>
- that provides compatibility with these two standards.
- </p>
-<p>
- </p>
-<p>
- There are various pros and cons to using the library in this way:
- </p>
-<p>
- </p>
+ Many of the special functions included in this library are also a part of
+ the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
+ Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
+ Report on C++ Library Extensions</a>. Therefore this library includes
+ a thin wrapper header <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ that provides compatibility with these two standards.
+ </p>
<p>
- Pros:
- </p>
+ There are various pros and cons to using the library in this way:
+ </p>
<p>
- </p>
+ Pros:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- The header to include is lightweight (i.e. fast to compile).
- </li>
+ The header to include is lightweight (i.e. fast to compile).
+ </li>
<li>
- The functions have extern "C" linkage, and so are usable
- from other languages (not just C and C++).
- </li>
+ The functions have extern "C" linkage, and so are usable from
+ other languages (not just C and C++).
+ </li>
<li>
- C99 and C++ TR1 Standard compatibility.
- </li>
+ C99 and C++ TR1 Standard compatibility.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- Cons:
- </p>
-<p>
- </p>
+ Cons:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- You will need to compile and link to the external Boost.Math libraries.
- </li>
+ You will need to compile and link to the external Boost.Math libraries.
+ </li>
<li>
- Limited to support for the types, <code class="computeroutput"><span class="keyword">float</span></code>,
- <code class="computeroutput"><span class="keyword">double</span></code> and <code class="computeroutput"><span class="keyword">long</span> <span class="keyword">double</span></code>.
- </li>
+ Limited to support for the types, <code class="computeroutput"><span class="keyword">float</span></code>,
+ <code class="computeroutput"><span class="keyword">double</span></code> and <code class="computeroutput"><span class="keyword">long</span> <span class="keyword">double</span></code>.
+ </li>
<li>
- Error handling is handled via setting ::errno and returning NaN's and
- infinities: this may be less flexible than an C++ exception based approach.
- </li>
+ Error handling is handled via setting ::errno and returning NaN's and
+ infinities: this may be less flexible than an C++ exception based approach.
+ </li>
</ul></div>
-<p>
- </p>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
- The separate libraries are required <span class="bold"><strong>only</strong></span>
- if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
- header, the rest of Boost.Math remains header-only.
- </p></td></tr>
+ The separate libraries are required <span class="bold"><strong>only</strong></span>
+ if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
+ header, the rest of Boost.Math remains header-only.
+ </p></td></tr>
</table></div>
<p>
- </p>
-<p>
- The separate libraries required in order to use tr1.hpp can be compiled
- using bjam from within the libs/math/build directory, or from the Boost
- root directory using the usual Boost-wide install procedure. Alternatively
- the source files are located in libs/math/src and each have the same name
- as the function they implement. The various libraries are named as follows:
- </p>
-<p>
- </p>
+ The separate libraries required in order to use tr1.hpp can be compiled using
+ bjam from within the libs/math/build directory, or from the Boost root directory
+ using the usual Boost-wide install procedure. Alternatively the source files
+ are located in libs/math/src and each have the same name as the function
+ they implement. The various libraries are named as follows:
+ </p>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -112,140 +94,136 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Name
- </p>
- </th>
+ <p>
+ Name
+ </p>
+ </th>
<th>
- <p>
- Type
- </p>
- </th>
+ <p>
+ Type
+ </p>
+ </th>
<th>
- <p>
- Functions
- </p>
- </th>
+ <p>
+ Functions
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- boost_math_c99f-<suffix>
- </p>
- </td>
-<td>
- <p>
- float
- </p>
- </td>
-<td>
- <p>
- C99 Functions
- </p>
- </td>
+ <p>
+ boost_math_c99f-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ float
+ </p>
+ </td>
+<td>
+ <p>
+ C99 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_c99-<suffix>
- </p>
- </td>
-<td>
- <p>
- double
- </p>
- </td>
-<td>
- <p>
- C99 Functions
- </p>
- </td>
+ <p>
+ boost_math_c99-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ double
+ </p>
+ </td>
+<td>
+ <p>
+ C99 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_c99l-<suffix>
- </p>
- </td>
-<td>
- <p>
- long double
- </p>
- </td>
-<td>
- <p>
- C99 Functions
- </p>
- </td>
+ <p>
+ boost_math_c99l-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ long double
+ </p>
+ </td>
+<td>
+ <p>
+ C99 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_tr1f-<suffix>
- </p>
- </td>
-<td>
- <p>
- float
- </p>
- </td>
-<td>
- <p>
- TR1 Functions
- </p>
- </td>
+ <p>
+ boost_math_tr1f-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ float
+ </p>
+ </td>
+<td>
+ <p>
+ TR1 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_tr1-<suffix>
- </p>
- </td>
-<td>
- <p>
- double
- </p>
- </td>
-<td>
- <p>
- TR1 Functions
- </p>
- </td>
+ <p>
+ boost_math_tr1-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ double
+ </p>
+ </td>
+<td>
+ <p>
+ TR1 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_tr1l-<suffix>
- </p>
- </td>
-<td>
- <p>
- long double
- </p>
- </td>
-<td>
- <p>
- TR1 Functions
- </p>
- </td>
+ <p>
+ boost_math_tr1l-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ long double
+ </p>
+ </td>
+<td>
+ <p>
+ TR1 Functions
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
<p>
- </p>
-<p>
- Where <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> encodes the compiler and build options
- used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
- would be the statically linked TR1 library to use with Visual C++ 8.0,
- in multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
- would be import library for the TR1 DLL to be used with Visual C++ 8.0
- with the release multithreaded DLL VC++ runtime. Refer to the getting started
- guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
- explanation of the <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> meanings</a>.
- </p>
-<p>
- </p>
+ Where <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> encodes the compiler and build options
+ used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
+ would be the statically linked TR1 library to use with Visual C++ 8.0, in
+ multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
+ would be import library for the TR1 DLL to be used with Visual C++ 8.0 with
+ the release multithreaded DLL VC++ runtime. Refer to the getting started
+ guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
+ explanation of the <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> meanings</a>.
+ </p>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
@@ -253,102 +231,78 @@
</tr>
<tr><td align="left" valign="top">
<p>
- Visual C++ users will typically have the correct library variant to link
- against selected for them by boost/math/tr1.hpp based on your compiler
- settings.
- </p>
-<p>
- Users will need to define BOOST_MATH_TR1_DYN_LINK when building their
- code if they want to link against the DLL versions of these libraries
- rather than the static versions.
- </p>
-<p>
- Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when
- building: this is typically only used when linking against a customised
- build of the libraries.
- </p>
-</td></tr>
-</table></div>
+ Visual C++ users will typically have the correct library variant to link
+ against selected for them by boost/math/tr1.hpp based on your compiler
+ settings.
+ </p>
+<p>
+ Users will need to define BOOST_MATH_TR1_DYN_LINK when building their code
+ if they want to link against the DLL versions of these libraries rather
+ than the static versions.
+ </p>
<p>
+ Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when building:
+ this is typically only used when linking against a customised build of
+ the libraries.
</p>
+</td></tr>
+</table></div>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
- Linux and Unix users will generally only have one variant of these libraries
- installed, and can generally just link against -lboost_math_tr1 etc.
- </p></td></tr>
+ Linux and Unix users will generally only have one variant of these libraries
+ installed, and can generally just link against -lboost_math_tr1 etc.
+ </p></td></tr>
</table></div>
+<a name="math_toolkit.extern_c.tr1.usage_recomendations"></a><h5>
+<a name="id1290975"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.usage_recomendations">Usage Recomendations</a>
+ </h5>
<p>
- <a name="math_toolkit.extern_c.tr1.usage_recomendations"></a>
- </p>
-<h5>
-<a name="id1163343"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.usage_recomendations">Usage Recomendations</a>
- </h5>
-<p>
- </p>
-<p>
- This library now presents the user with a choice:
- </p>
-<p>
- </p>
+ This library now presents the user with a choice:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- To include the header only versions of the functions and have an easier
- time linking, but a longer compile time.
- </li>
+ To include the header only versions of the functions and have an easier
+ time linking, but a longer compile time.
+ </li>
<li>
- To include the TR1 headers and link against an external library.
- </li>
+ To include the TR1 headers and link against an external library.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- Which option you choose depends largely on how you prefer to work and how
- your system is set up.
- </p>
-<p>
- </p>
-<p>
- For example a casual user who just needs the acosh function, would probably
- be better off including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">acosh</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
- and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> in
- their code.
- </p>
-<p>
- </p>
-<p>
- However, for large scale software development where compile times are significant,
- and where the Boost libraries are already built and installed on the system,
- then including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code> and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- will speed up compile times, reduce object files sizes (since there are
- no templates being instantiated any more), and also speed up debugging
- runtimes - since the externally compiled libraries can be compiler optimised,
- rather than built using full settings - the difference in performance between
- <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release and debug builds
- can be as much as 20 times</a>, so for complex applications this can
- be a big win.
- </p>
-<p>
- <a name="math_toolkit.extern_c.tr1.supported_c99_functions"></a>
- </p>
-<h5>
-<a name="id1163545"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_c99_functions">Supported
- C99 Functions</a>
- </h5>
+ Which option you choose depends largely on how you prefer to work and how
+ your system is set up.
+ </p>
<p>
- </p>
+ For example a casual user who just needs the acosh function, would probably
+ be better off including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">acosh</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> in their
+ code.
+ </p>
<p>
- See also the <a class="link" href="c99.html" title="C99 C Functions">quick reference
- guide for these functions</a>.
- </p>
+ However, for large scale software development where compile times are significant,
+ and where the Boost libraries are already built and installed on the system,
+ then including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code> and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> will
+ speed up compile times, reduce object files sizes (since there are no templates
+ being instantiated any more), and also speed up debugging runtimes - since
+ the externally compiled libraries can be compiler optimised, rather than
+ built using full settings - the difference in performance between <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release
+ and debug builds can be as much as 20 times</a>, so for complex applications
+ this can be a big win.
+ </p>
+<a name="math_toolkit.extern_c.tr1.supported_c99_functions"></a><h5>
+<a name="id1291177"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_c99_functions">Supported
+ C99 Functions</a>
+ </h5>
<p>
-
-</p>
+ See also the <a class="link" href="c99.html" title="C99 C Functions">quick reference guide
+ for these functions</a>.
+ </p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tr1</span><span class="special">{</span> <span class="keyword">extern</span> <span class="string">"C"</span><span class="special">{</span>
<span class="keyword">typedef</span> <span class="identifier">unspecified</span> <span class="identifier">float_t</span><span class="special">;</span>
@@ -436,23 +390,15 @@
<span class="special">}}}}</span> <span class="comment">// namespaces
</span></pre>
+<a name="math_toolkit.extern_c.tr1.supported_tr1_functions"></a><h5>
+<a name="id1295522"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_tr1_functions">Supported
+ TR1 Functions</a>
+ </h5>
<p>
- <a name="math_toolkit.extern_c.tr1.supported_tr1_functions"></a>
- </p>
-<h5>
-<a name="id1165668"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_tr1_functions">Supported
- TR1 Functions</a>
- </h5>
-<p>
- </p>
-<p>
- See also the <a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview">quick reference
- guide for these functions</a>.
- </p>
-<p>
-
-</p>
+ See also the <a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview">quick reference guide
+ for these functions</a>.
+ </p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tr1</span><span class="special">{</span> <span class="keyword">extern</span> <span class="string">"C"</span><span class="special">{</span>
<span class="comment">// [5.2.1.1] associated Laguerre polynomials:
@@ -565,27 +511,19 @@
<span class="special">}}}}</span> <span class="comment">// namespaces
</span></pre>
<p>
- </p>
-<p>
- In addition sufficient additional overloads of the <code class="computeroutput"><span class="keyword">double</span></code>
- versions of the above functions are provided, so that calling the function
- with any mixture of <code class="computeroutput"><span class="keyword">float</span></code>,
- <code class="computeroutput"><span class="keyword">double</span></code>, <code class="computeroutput"><span class="keyword">long</span>
- <span class="keyword">double</span></code>, or <span class="emphasis"><em>integer</em></span>
- arguments is supported, with the return type determined by the <a class="link" href="../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>result
- type calculation rules</em></span></a>.
- </p>
-<p>
- <a name="math_toolkit.extern_c.tr1.currently_unsupported_c99_functions"></a>
- </p>
-<h5>
-<a name="id1170189"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_c99_functions">Currently
- Unsupported C99 Functions</a>
- </h5>
-<p>
-
-</p>
+ In addition sufficient additional overloads of the <code class="computeroutput"><span class="keyword">double</span></code>
+ versions of the above functions are provided, so that calling the function
+ with any mixture of <code class="computeroutput"><span class="keyword">float</span></code>,
+ <code class="computeroutput"><span class="keyword">double</span></code>, <code class="computeroutput"><span class="keyword">long</span>
+ <span class="keyword">double</span></code>, or <span class="emphasis"><em>integer</em></span>
+ arguments is supported, with the return type determined by the <a class="link" href="../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>result
+ type calculation rules</em></span></a>.
+ </p>
+<a name="math_toolkit.extern_c.tr1.currently_unsupported_c99_functions"></a><h5>
+<a name="id1298399"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_c99_functions">Currently
+ Unsupported C99 Functions</a>
+ </h5>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">exp2</span><span class="special">(</span><span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">float</span> <span class="identifier">exp2f</span><span class="special">(</span><span class="keyword">float</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">exp2l</span><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
@@ -646,17 +584,11 @@
<span class="keyword">float</span> <span class="identifier">scalbnf</span><span class="special">(</span><span class="keyword">float</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">ex</span><span class="special">);</span>
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">scalbnl</span><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">ex</span><span class="special">);</span>
</pre>
-<p>
- <a name="math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions"></a>
- </p>
-<h5>
-<a name="id1171861"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions">Currently
- Unsupported TR1 Functions</a>
- </h5>
-<p>
-
-</p>
+<a name="math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions"></a><h5>
+<a name="id1301164"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions">Currently
+ Unsupported TR1 Functions</a>
+ </h5>
<pre class="programlisting"><span class="comment">// [5.2.1.7] confluent hypergeometric functions:
</span><span class="keyword">double</span> <span class="identifier">conf_hyperg</span><span class="special">(</span><span class="keyword">double</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">double</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">float</span> <span class="identifier">conf_hypergf</span><span class="special">(</span><span class="keyword">float</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">float</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">float</span> <span class="identifier">x</span><span class="special">);</span>
@@ -668,8 +600,6 @@
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">hypergl</span><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">b</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">c</span><span class="special">,</span>
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../extern_c.html" title='TR1 and C99 external "C" Functions'>
<link rel="prev" href="c99.html" title="C99 C Functions">
-<link rel="next" href="../toolkit.html" title="Internal Details and Tools (Experimental)">
+<link rel="next" href="../toolkit.html" title="Tools, Constants and Internal Details">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.extern_c.tr1_ref"></a><a class="link" href="tr1_ref.html" title="TR1 C Functions Quick Reference"> TR1 C Functions Quick
+<a name="math_toolkit.extern_c.tr1_ref"></a><a class="link" href="tr1_ref.html" title="TR1 C Functions Quick Reference">TR1 C Functions Quick
Reference</a>
</h3></div></div></div>
<a name="math_toolkit.extern_c.tr1_ref.supported_tr1_functions"></a><h5>
-<a name="id1180196"></a>
+<a name="id1308390"></a>
<a class="link" href="tr1_ref.html#math_toolkit.extern_c.tr1_ref.supported_tr1_functions">Supported
TR1 Functions</a>
</h5>
@@ -163,7 +163,7 @@
</span><span class="identifier">expint</span><span class="special">(</span><span class="number">2</span><span class="special">);</span> <span class="comment">// integer argument is treated as a double, returns double.
</span></pre>
<a name="math_toolkit.extern_c.tr1_ref.quick_reference"></a><h5>
-<a name="id1183738"></a>
+<a name="id1312608"></a>
<a class="link" href="tr1_ref.html#math_toolkit.extern_c.tr1_ref.quick_reference">Quick Reference</a>
</h5>
<pre class="programlisting"><span class="comment">// [5.2.1.1] associated Laguerre polynomials:
@@ -494,7 +494,7 @@
for the full template (header only) version of this function.
</p>
<a name="math_toolkit.extern_c.tr1_ref.currently_unsupported_tr1_functions"></a><h5>
-<a name="id1189089"></a>
+<a name="id1317542"></a>
<a class="link" href="tr1_ref.html#math_toolkit.extern_c.tr1_ref.currently_unsupported_tr1_functions">Currently
Unsupported TR1 Functions</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,39 +24,34 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.main_overview"></a><a class="link" href="main_overview.html" title="Overview"> Overview</a>
+<a name="math_toolkit.main_overview"></a><a class="link" href="main_overview.html" title="Overview">Overview</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> About the Math Toolkit</span></dt>
-<dt><span class="section"> Navigation</span></dt>
-<dt><span class="section"><a href="main_overview/directories.html"> Directory and
+<dt><span class="section">About the Math Toolkit</span></dt>
+<dt><span class="section">Navigation</span></dt>
+<dt><span class="section"><a href="main_overview/directories.html">Directory and
File Structure</a></span></dt>
-<dt><span class="section"> Namespaces</span></dt>
-<dt><span class="section"><a href="main_overview/result_type.html"> Calculation
- of the Type of the Result</a></span></dt>
-<dt><span class="section"> Error Handling</span></dt>
-<dt><span class="section"> Compilers</span></dt>
-<dt><span class="section"><a href="main_overview/pol_overview.html"> Configuration
- and Policies</a></span></dt>
-<dt><span class="section"> Thread Safety</span></dt>
-<dt><span class="section"> Performance</span></dt>
-<dt><span class="section"><a href="main_overview/building.html"> If and How to Build
+<dt><span class="section">Namespaces</span></dt>
+<dt><span class="section"><a href="main_overview/result_type.html">Calculation of
+ the Type of the Result</a></span></dt>
+<dt><span class="section">Error Handling</span></dt>
+<dt><span class="section">Compilers</span></dt>
+<dt><span class="section"><a href="main_overview/config_macros.html">Configuration
+ Macros</a></span></dt>
+<dt><span class="section">Policies</span></dt>
+<dt><span class="section">Thread Safety</span></dt>
+<dt><span class="section">Performance</span></dt>
+<dt><span class="section"><a href="main_overview/building.html">If and How to Build
a Boost.Math Library, and its Examples and Tests</a></span></dt>
-<dt><span class="section"><a href="main_overview/history1.html"> History and What's
+<dt><span class="section"><a href="main_overview/history1.html">History and What's
New</a></span></dt>
-<dt><span class="section"><a href="main_overview/tr1.html"> C99 and C++ TR1 C-style
+<dt><span class="section"><a href="main_overview/tr1.html">C99 and C++ TR1 C-style
Functions</a></span></dt>
-<dt><span class="section"><a href="main_overview/faq.html"> Frequently Asked Questions
+<dt><span class="section"><a href="main_overview/faq.html">Frequently Asked Questions
FAQ</a></span></dt>
-<dt><span class="section"><a href="main_overview/contact.html"> Contact Info and
+<dt><span class="section"><a href="main_overview/contact.html">Contact Info and
Support</a></span></dt>
</dl></div>
-<p>
- </p>
-<p>
- </p>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.building"></a><a class="link" href="building.html" title="If and How to Build a Boost.Math Library, and its Examples and Tests"> If and How to Build
+<a name="math_toolkit.main_overview.building"></a><a class="link" href="building.html" title="If and How to Build a Boost.Math Library, and its Examples and Tests">If and How to Build
a Boost.Math Library, and its Examples and Tests</a>
</h3></div></div></div>
<a name="math_toolkit.main_overview.building.building_a_library__shared__dynamic__dll_or_static__lib_"></a><h5>
-<a name="id910772"></a>
+<a name="id1017746"></a>
<a class="link" href="building.html#math_toolkit.main_overview.building.building_a_library__shared__dynamic__dll_or_static__lib_">Building
a Library (shared, dynamic .dll or static .lib)</a>
</h5>
@@ -100,7 +100,7 @@
building the sources. Boost.Build will do this automatically when appropriate.
</p>
<a name="math_toolkit.main_overview.building.building_the_examples"></a><h5>
-<a name="id911223"></a>
+<a name="id1018951"></a>
<a class="link" href="building.html#math_toolkit.main_overview.building.building_the_examples">Building
the Examples</a>
</h5>
@@ -111,7 +111,7 @@
the Boost headers are in your compilers #include search path.
</p>
<a name="math_toolkit.main_overview.building.building_the_tests"></a><h5>
-<a name="id911263"></a>
+<a name="id1018993"></a>
<a class="link" href="building.html#math_toolkit.main_overview.building.building_the_tests">Building
the Tests</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../main_overview.html" title="Overview">
<link rel="prev" href="error_handling.html" title="Error Handling">
-<link rel="next" href="pol_overview.html" title="Configuration and Policies">
+<link rel="next" href="config_macros.html" title="Configuration Macros">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,22 +20,18 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="error_handling.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pol_overview.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="error_handling.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="config_macros.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.compilers_overview"></a><a class="link" href="compilers_overview.html" title="Compilers"> Compilers</a>
+<a name="math_toolkit.main_overview.compilers_overview"></a><a class="link" href="compilers_overview.html" title="Compilers">Compilers</a>
</h3></div></div></div>
<p>
- </p>
-<p>
- This section contains some information about how various compilers work
- with this library. It is not comprehensive and updated experiences are
- always welcome. Some effort has been made to suppress unhelpful warnings
- but it is difficult to achieve this on all systems.
- </p>
-<p>
- </p>
+ This section contains some information about how various compilers work with
+ this library. It is not comprehensive and updated experiences are always
+ welcome. Some effort has been made to suppress unhelpful warnings but it
+ is difficult to achieve this on all systems.
+ </p>
<div class="table">
<a name="math_toolkit.main_overview.compilers_overview.supported_tested_compilers"></a><p class="title"><b>Table 9. Supported/Tested Compilers</b></p>
<div class="table-contents"><table class="table" summary="Supported/Tested Compilers">
@@ -47,508 +43,498 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Platform
- </p>
- </th>
+ <p>
+ Platform
+ </p>
+ </th>
<th>
- <p>
- Compiler
- </p>
- </th>
+ <p>
+ Compiler
+ </p>
+ </th>
<th>
- <p>
- Has long double support
- </p>
- </th>
+ <p>
+ Has long double support
+ </p>
+ </th>
<th>
- <p>
- Notes
- </p>
- </th>
+ <p>
+ Notes
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- Windows
- </p>
- </td>
-<td>
- <p>
- MSVC 7.1 and later
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- We aim to keep our headers warning free at level 4 with this
- compiler.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Windows
- </p>
- </td>
-<td>
- <p>
- Intel 8.1 and later
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- We aim to keep our headers warning free at level 4 with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Windows
- </p>
- </td>
-<td>
- <p>
- GNU Mingw32 C++
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- We aim to keep our headers warning free with -Wall with this
- compiler.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Windows
- </p>
- </td>
-<td>
- <p>
- GNU Cygwin C++
- </p>
- </td>
-<td>
- <p>
- No
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- We aim to keep our headers warning free with -Wall with this
- compiler.
- </p>
- <p>
- Long double support has been disabled because there are no native
- long double C std library functions available.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Windows
- </p>
- </td>
-<td>
- <p>
- Borland C++ 5.8.2 (Developer studio 2006)
- </p>
- </td>
-<td>
- <p>
- No
- </p>
- </td>
-<td>
- <p>
- We have only partial compatability with this compiler:
- </p>
- <p>
- Long double support has been disabled because the native long
- double C standard library functions really only forward to the
- double versions. This can result in unpredictable behaviour when
- using the long double overloads: for example <code class="computeroutput"><span class="identifier">sqrtl</span></code>
- applied to a finite value, can result in an infinite result.
- </p>
- <p>
- Some functions still fail to compile, there are no known workarounds
- at present.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Linux
- </p>
- </td>
-<td>
- <p>
- GNU C++ 3.4 and later
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- We aim to keep our headers warning free with -Wall with this
- compiler.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Linux
- </p>
- </td>
-<td>
- <p>
- Intel C++ 10.0 and later
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- We aim to keep our headers warning free with -Wall with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Linux
- </p>
- </td>
-<td>
- <p>
- Intel C++ 8.1 and 9.1
- </p>
- </td>
-<td>
- <p>
- No
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- Long double support has been disabled with these compiler releases
- because calling the standard library long double math functions
- can result in a segfault. The issue is Linux distribution and
- glibc version specific and is Intel bug report #409291. Fully
- up to date releases of Intel 9.1 (post version l_cc_c_9.1.046)
- shouldn't have this problem. If you need long double support
- with this compiler, then comment out the define of BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
- at line 55 of boost/math/tools/config.hpp.
- </p>
- <p>
- We aim to keep our headers warning free with -Wall with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Linux
- </p>
- </td>
-<td>
- <p>
- QLogic PathScale 3.0
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- Some tests involving conceptual checks fail to build, otherwise
- there appear to be no issues.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Linux
- </p>
- </td>
-<td>
- <p>
- Sun Studio 12
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- Some tests involving function overload resolution fail to build,
- these issues should be rairly encountered in practice.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Solaris
- </p>
- </td>
-<td>
- <p>
- Sun Studio 12
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- Some tests involving function overload resolution fail to build,
- these issues should be rairly encountered in practice.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Solaris
- </p>
- </td>
-<td>
- <p>
- GNU C++ 4.x
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- We aim to keep our headers warning free with -Wall with this
- compiler.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- HP Tru64
- </p>
- </td>
-<td>
- <p>
- Compaq C++ 7.1
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- HP-UX Itanium
- </p>
- </td>
-<td>
- <p>
- HP aCC 6.x
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- Unfortunately this compiler emits quite a few warnings from libraries
- upon which we depend (TR1, Array etc).
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- HP-UX PA-RISC
- </p>
- </td>
-<td>
- <p>
- GNU C++ 3.4
- </p>
- </td>
-<td>
- <p>
- No
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Apple Mac OS X, Intel
- </p>
- </td>
-<td>
- <p>
- Darwin/GNU C++ 4.x
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Apple Mac OS X, PowerPC
- </p>
- </td>
-<td>
- <p>
- Darwin/GNU C++ 4.x
- </p>
- </td>
-<td>
- <p>
- No
- </p>
- </td>
-<td>
- <p>
- All tests OK.
- </p>
- <p>
- Long double support has been disabled on this platform due to
- the rather strange nature of Darwin's 106-bit long double implementation.
- It should be possible to make this work if someone is prepared
- to offer assistance.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- IMB AIX
- </p>
- </td>
-<td>
- <p>
- IBM xlc 5.3
- </p>
- </td>
-<td>
- <p>
- Yes
- </p>
- </td>
-<td>
- <p>
- All tests pass except for our fpclassify tests which fail due
- to a bug in <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span></code>,
- the bug effects the test code, not fpclassify itself. The IBM
- compiler group are aware of the problem.
- </p>
- </td>
+ <p>
+ Windows
+ </p>
+ </td>
+<td>
+ <p>
+ MSVC 7.1 and later
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ We aim to keep our headers warning free at level 4 with this compiler.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Windows
+ </p>
+ </td>
+<td>
+ <p>
+ Intel 8.1 and later
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ We aim to keep our headers warning free at level 4 with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Windows
+ </p>
+ </td>
+<td>
+ <p>
+ GNU Mingw32 C++
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ We aim to keep our headers warning free with -Wall with this compiler.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Windows
+ </p>
+ </td>
+<td>
+ <p>
+ GNU Cygwin C++
+ </p>
+ </td>
+<td>
+ <p>
+ No
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ We aim to keep our headers warning free with -Wall with this compiler.
+ </p>
+ <p>
+ Long double support has been disabled because there are no native
+ long double C std library functions available.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Windows
+ </p>
+ </td>
+<td>
+ <p>
+ Borland C++ 5.8.2 (Developer studio 2006)
+ </p>
+ </td>
+<td>
+ <p>
+ No
+ </p>
+ </td>
+<td>
+ <p>
+ We have only partial compatability with this compiler:
+ </p>
+ <p>
+ Long double support has been disabled because the native long double
+ C standard library functions really only forward to the double
+ versions. This can result in unpredictable behaviour when using
+ the long double overloads: for example <code class="computeroutput"><span class="identifier">sqrtl</span></code>
+ applied to a finite value, can result in an infinite result.
+ </p>
+ <p>
+ Some functions still fail to compile, there are no known workarounds
+ at present.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Linux
+ </p>
+ </td>
+<td>
+ <p>
+ GNU C++ 3.4 and later
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ We aim to keep our headers warning free with -Wall with this compiler.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Linux
+ </p>
+ </td>
+<td>
+ <p>
+ Intel C++ 10.0 and later
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ We aim to keep our headers warning free with -Wall with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Linux
+ </p>
+ </td>
+<td>
+ <p>
+ Intel C++ 8.1 and 9.1
+ </p>
+ </td>
+<td>
+ <p>
+ No
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ Long double support has been disabled with these compiler releases
+ because calling the standard library long double math functions
+ can result in a segfault. The issue is Linux distribution and glibc
+ version specific and is Intel bug report #409291. Fully up to date
+ releases of Intel 9.1 (post version l_cc_c_9.1.046) shouldn't have
+ this problem. If you need long double support with this compiler,
+ then comment out the define of BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
+ at line 55 of boost/math/tools/config.hpp.
+ </p>
+ <p>
+ We aim to keep our headers warning free with -Wall with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Linux
+ </p>
+ </td>
+<td>
+ <p>
+ QLogic PathScale 3.0
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ Some tests involving conceptual checks fail to build, otherwise
+ there appear to be no issues.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Linux
+ </p>
+ </td>
+<td>
+ <p>
+ Sun Studio 12
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ Some tests involving function overload resolution fail to build,
+ these issues should be rairly encountered in practice.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Solaris
+ </p>
+ </td>
+<td>
+ <p>
+ Sun Studio 12
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ Some tests involving function overload resolution fail to build,
+ these issues should be rairly encountered in practice.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Solaris
+ </p>
+ </td>
+<td>
+ <p>
+ GNU C++ 4.x
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ We aim to keep our headers warning free with -Wall with this compiler.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ HP Tru64
+ </p>
+ </td>
+<td>
+ <p>
+ Compaq C++ 7.1
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ HP-UX Itanium
+ </p>
+ </td>
+<td>
+ <p>
+ HP aCC 6.x
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ Unfortunately this compiler emits quite a few warnings from libraries
+ upon which we depend (TR1, Array etc).
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ HP-UX PA-RISC
+ </p>
+ </td>
+<td>
+ <p>
+ GNU C++ 3.4
+ </p>
+ </td>
+<td>
+ <p>
+ No
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Apple Mac OS X, Intel
+ </p>
+ </td>
+<td>
+ <p>
+ Darwin/GNU C++ 4.x
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Apple Mac OS X, PowerPC
+ </p>
+ </td>
+<td>
+ <p>
+ Darwin/GNU C++ 4.x
+ </p>
+ </td>
+<td>
+ <p>
+ No
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ <p>
+ Long double support has been disabled on this platform due to the
+ rather strange nature of Darwin's 106-bit long double implementation.
+ It should be possible to make this work if someone is prepared
+ to offer assistance.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ IMB AIX
+ </p>
+ </td>
+<td>
+ <p>
+ IBM xlc 5.3
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests pass except for our fpclassify tests which fail due to
+ a bug in <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span></code>, the bug effects
+ the test code, not fpclassify itself. The IBM compiler group are
+ aware of the problem.
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
-<p><br class="table-break">
- </p>
-<div class="table">
+<br class="table-break"><div class="table">
<a name="math_toolkit.main_overview.compilers_overview.unsupported_compilers"></a><p class="title"><b>Table 10. Unsupported Compilers</b></p>
<div class="table-contents"><table class="table" summary="Unsupported Compilers">
<colgroup>
@@ -557,68 +543,59 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Platform
- </p>
- </th>
+ <p>
+ Platform
+ </p>
+ </th>
<th>
- <p>
- Compiler
- </p>
- </th>
+ <p>
+ Compiler
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- Windows
- </p>
- </td>
-<td>
- <p>
- Borland C++ 5.9.2 (Borland Developer Studio 2007)
- </p>
- </td>
+ <p>
+ Windows
+ </p>
+ </td>
+<td>
+ <p>
+ Borland C++ 5.9.2 (Borland Developer Studio 2007)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Windows
- </p>
- </td>
-<td>
- <p>
- MSVC 6 and 7
- </p>
- </td>
+ <p>
+ Windows
+ </p>
+ </td>
+<td>
+ <p>
+ MSVC 6 and 7
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
-<p><br class="table-break">
- </p>
-<p>
- If you're compiler or platform is not listed above, please try running
- the regression tests: cd into boost-root/libs/math/test and do a:
- </p>
-<p>
-
-</p>
+<br class="table-break"><p>
+ If your compiler or platform is not listed above, please try running the
+ regression tests: cd into boost-root/libs/math/test and do a:
+ </p>
<pre class="programlisting"><span class="identifier">bjam</span> <span class="identifier">mytoolset</span>
</pre>
<p>
- </p>
-<p>
- where "mytoolset" is the name of the Boost.Build
- toolset used for your compiler. The chances are that <span class="bold"><strong>many
- of the accuracy tests will fail at this stage</strong></span> - don't panic
- - the default acceptable error tolerances are quite tight, especially for
- long double types with an extended exponent range (these cause more extreme
- test cases to be executed for some functions). You will need to cast an
- eye over the output from the failing tests and make a judgement as to whether
- the error rates are acceptable or not.
- </p>
-<p>
+ where "mytoolset" is the name of the Boost.Build
+ toolset used for your compiler. The chances are that <span class="bold"><strong>many
+ of the accuracy tests will fail at this stage</strong></span> - don't panic -
+ the default acceptable error tolerances are quite tight, especially for long
+ double types with an extended exponent range (these cause more extreme test
+ cases to be executed for some functions). You will need to cast an eye over
+ the output from the failing tests and make a judgement as to whether the
+ error rates are acceptable or not.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -633,7 +610,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="error_handling.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pol_overview.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="error_handling.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="config_macros.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.contact"></a><a class="link" href="contact.html" title="Contact Info and Support"> Contact Info and
+<a name="math_toolkit.main_overview.contact"></a><a class="link" href="contact.html" title="Contact Info and Support">Contact Info and
Support</a>
</h3></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.directories"></a><a class="link" href="directories.html" title="Directory and File Structure"> Directory and
+<a name="math_toolkit.main_overview.directories"></a><a class="link" href="directories.html" title="Directory and File Structure">Directory and
File Structure</a>
</h3></div></div></div>
<a name="math_toolkit.main_overview.directories.boost_math"></a><h5>
-<a name="id895299"></a>
+<a name="id1004511"></a>
<a class="link" href="directories.html#math_toolkit.main_overview.directories.boost_math">boost/math</a>
</h5>
<div class="variablelist">
@@ -73,7 +73,7 @@
</dl>
</div>
<a name="math_toolkit.main_overview.directories.boost_libs"></a><h5>
-<a name="id903100"></a>
+<a name="id1004660"></a>
<a class="link" href="directories.html#math_toolkit.main_overview.directories.boost_libs">boost/libs</a>
</h5>
<div class="variablelist">
@@ -94,8 +94,8 @@
</p></dd>
<dt><span class="term">/test/</span></dt>
<dd><p>
- Test files, in various .cpp files, most using Boost.Test (some with
- test data as .ipp files, usually generated using NTL RR type with ample
+ Test files, in many .cpp files, most using Boost.Test (some with test
+ data as .ipp files, usually generated using NTL RR type with ample
precision for the type, often for precisions suitable for up to 256-bit
significand real types).
</p></dd>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.error_handling"></a><a class="link" href="error_handling.html" title="Error Handling"> Error Handling</a>
+<a name="math_toolkit.main_overview.error_handling"></a><a class="link" href="error_handling.html" title="Error Handling">Error Handling</a>
</h3></div></div></div>
<a name="math_toolkit.main_overview.error_handling.quick_reference"></a><h5>
-<a name="id904070"></a>
+<a name="id1010627"></a>
<a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.quick_reference">Quick
Reference</a>
</h5>
@@ -85,9 +85,10 @@
</p></dd>
<dt><span class="term">Evaluation Error</span></dt>
<dd><p>
- Occurs when an internal error occured that prevented the result from
- being evaluated: this should never occur, but if it does, then it's
- likely to be due to an iterative method not converging fast enough.
+ Occurs if no method of evaluation is known, or when an internal error
+ occurred that prevented the result from being evaluated: this should
+ never occur, but if it does, then it's likely to be due to an iterative
+ method not converging fast enough.
</p></dd>
<dt><span class="term">Indeterminate Result Error</span></dt>
<dd><p>
@@ -550,7 +551,9 @@
<p>
Sets <code class="computeroutput"><span class="special">::</span><span class="identifier">errno</span></code>
to <code class="computeroutput"><span class="identifier">ERANGE</span></code> and returns
- an unspecified value.
+ the largest representable value of the target integer type (or
+ the most negative value if the argument to the function was less
+ than zero).
</p>
</td>
</tr>
@@ -562,7 +565,9 @@
</td>
<td>
<p>
- <span class="bold"><strong>Returns the an unspecified value.</strong></span>
+ <span class="bold"><strong>Returns the largest representable value of
+ the target integer type (or the most negative value if the argument
+ to the function was less than zero).</strong></span>
</p>
</td>
</tr>
@@ -742,7 +747,7 @@
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">overflow_error</span><span class="special">;</span></code>.
</p>
<a name="math_toolkit.main_overview.error_handling.rationale"></a><h5>
-<a name="id906640"></a>
+<a name="id1012642"></a>
<a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.rationale">Rationale</a>
</h5>
<p>
@@ -761,12 +766,12 @@
</li>
</ul></div>
<a name="math_toolkit.main_overview.error_handling.finding_more_information"></a><h5>
-<a name="id906685"></a>
+<a name="id1012688"></a>
<a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.finding_more_information">Finding
More Information</a>
</h5>
<p>
- There are some pre-processor macro defines that can be used to <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">change
+ There are some pre-processor macro defines that can be used to <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using Macros to Change the Policy Defaults">change
the policy defaults</a>. See also the <a class="link" href="../policy.html" title="Policies">policy
section</a>.
</p>
@@ -782,10 +787,9 @@
<p>
The various kind of errors are described in more detail below.
</p>
-<a name="domain_error"></a><a name="math_toolkit.main_overview.error_handling.domain_errors"></a><h5>
-<a name="id906738"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.domain_errors">Domain
- Errors</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__domain_error____domain_errors"></a><h5>
+<a name="id1012737"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__domain_error____domain_errors"><a name="domain_error"></a> Domain Errors</a>
</h5>
<p>
When a special function is passed an argument that is outside the range of
@@ -854,10 +858,9 @@
<a href="../../../../../../format/index.html" target="_top">Boost.Format</a> documentation
for more details.
</p>
-<a name="pole_error"></a><a name="math_toolkit.main_overview.error_handling.evaluation_at_a_pole"></a><h5>
-<a name="id906997"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.evaluation_at_a_pole">Evaluation
- at a pole</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__pole_error____evaluation_at_a_pole"></a><h5>
+<a name="id1012991"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__pole_error____evaluation_at_a_pole"><a name="pole_error"></a> Evaluation at a pole</a>
</h5>
<p>
When a special function is passed an argument that is at a pole without a
@@ -893,10 +896,9 @@
<a href="../../../../../../format/index.html" target="_top">Boost.Format</a> documentation
for more details.
</p>
-<a name="overflow_error"></a><a name="math_toolkit.main_overview.error_handling.numeric_overflow"></a><h5>
-<a name="id907205"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.numeric_overflow">Numeric
- Overflow</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__overflow_error____numeric_overflow"></a><h5>
+<a name="id1013193"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__overflow_error____numeric_overflow"><a name="overflow_error"></a> Numeric Overflow</a>
</h5>
<p>
When the result of a special function is too large to fit in the argument
@@ -918,10 +920,9 @@
In this situation if the type <code class="computeroutput"><span class="identifier">T</span></code>
doesn't support infinities, the maximum value for the type is returned.
</p>
-<a name="underflow_error"></a><a name="math_toolkit.main_overview.error_handling.numeric_underflow"></a><h5>
-<a name="id907393"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.numeric_underflow">Numeric
- Underflow</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__underflow_error____numeric_underflow"></a><h5>
+<a name="id1013374"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__underflow_error____numeric_underflow"><a name="underflow_error"></a> Numeric Underflow</a>
</h5>
<p>
If the result of a special function is known to be non-zero, but the calculated
@@ -941,10 +942,9 @@
like <code class="computeroutput"><span class="identifier">throw_on_error</span></code>, throws
an <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">underflow_error</span></code> C++ exception.
</p>
-<a name="denorm_error"></a><a name="math_toolkit.main_overview.error_handling.denormalisation_errors"></a><h5>
-<a name="id907538"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.denormalisation_errors">Denormalisation
- Errors</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__denorm_error____denormalisation_errors"></a><h5>
+<a name="id1013514"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__denorm_error____denormalisation_errors"><a name="denorm_error"></a> Denormalisation Errors</a>
</h5>
<p>
If the result of a special function is a denormalised value <span class="emphasis"><em>z</em></span>
@@ -964,10 +964,9 @@
with another policy, like <code class="computeroutput"><span class="identifier">throw_on_error</span></code>
throws an <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">underflow_error</span></code> C++ exception.
</p>
-<a name="evaluation_error"></a><a name="math_toolkit.main_overview.error_handling.evaluation_errors"></a><h5>
-<a name="id907700"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.evaluation_errors">Evaluation
- Errors</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__evaluation_error____evaluation_errors"></a><h5>
+<a name="id1013670"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__evaluation_error____evaluation_errors"><a name="evaluation_error"></a> Evaluation Errors</a>
</h5>
<p>
When a special function calculates a result that is known to be erroneous,
@@ -1001,10 +1000,9 @@
<a href="../../../../../../format/index.html" target="_top">Boost.Format</a> documentation
for more details.
</p>
-<a name="indeterminate_result_error"></a><a name="math_toolkit.main_overview.error_handling.indeterminate_result_errors"></a><h5>
-<a name="id907915"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.indeterminate_result_errors">Indeterminate
- Result Errors</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__indeterminate_result_error____indeterminate_result_errors"></a><h5>
+<a name="id1013880"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__indeterminate_result_error____indeterminate_result_errors"><a name="indeterminate_result_error"></a> Indeterminate Result Errors</a>
</h5>
<p>
When the result of a special function is indeterminate for the value that
@@ -1030,10 +1028,9 @@
for what the result should be: for example the C99 standard specifies that
the result of 0<sup>0</sup> is 1, even though the result is actually mathematically indeterminate.
</p>
-<a name="rounding_error"></a><a name="math_toolkit.main_overview.error_handling.rounding_errors"></a><h5>
-<a name="id909172"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.rounding_errors">Rounding
- Errors</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__rounding_error____rounding_errors"></a><h5>
+<a name="id1014040"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__rounding_error____rounding_errors"><a name="rounding_error"></a> Rounding Errors</a>
</h5>
<p>
When one of the rounding functions <a class="link" href="../utils/rounding/round.html" title="Rounding Functions">round</a>,
@@ -1070,10 +1067,9 @@
<a href="../../../../../../format/index.html" target="_top">Boost.Format</a> documentation
for more details.
</p>
-<a name="checked_narrowing_cast"></a><a name="math_toolkit.main_overview.error_handling.errors_from_typecasts"></a><h5>
-<a name="id909404"></a>
- <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.errors_from_typecasts">Errors
- from typecasts</a>
+<a name="math_toolkit.main_overview.error_handling._anchor_id__checked_narrowing_cast____errors_from_typecasts"></a><h5>
+<a name="id1014264"></a>
+ <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling._anchor_id__checked_narrowing_cast____errors_from_typecasts"><a name="checked_narrowing_cast"></a> Errors from typecasts</a>
</h5>
<p>
Many special functions evaluate their results at a higher precision than
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.faq"></a><a class="link" href="faq.html" title="Frequently Asked Questions FAQ"> Frequently Asked Questions
+<a name="math_toolkit.main_overview.faq"></a><a class="link" href="faq.html" title="Frequently Asked Questions FAQ">Frequently Asked Questions
FAQ</a>
</h3></div></div></div>
<div class="orderedlist"><ol type="1">
@@ -43,6 +43,15 @@
<br>
</li>
<li>
+ I'm a user of <a href="http://support.sas.com/rnd/app/da/new/probabilityfunctions.html" target="_top">New
+ SAS Functions for Computing Probabilities</a>. <br> You will find
+ the interface more familar, but to be able to select a distribution (perhaps
+ using a string) see the Extras/Future Directions section, and /boost/libs/math/dot_net_example/boost_math.cpp
+ for an example that is used to create a C# utility (that you might also
+ find useful): see <a href="http://sourceforge.net/projects/distexplorer/" target="_top">Statistical
+ Distribution Explorer</a> <br> .
+ </li>
+<li>
<span class="emphasis"><em>I'm allegic to reading manuals and prefer to learn from examples.</em></span><br>
Fear not - you are not alone! Many examples are available for functions
and distributions. Some are referenced directly from the text. Others
@@ -126,7 +135,7 @@
<span class="emphasis"><em>My environment doesn't allow and/or I don't want exceptions.
Can I still user Boost.Math?</em></span> <br> Yes but you must customise
the error handling: see <a class="link" href="../policy/pol_tutorial/user_def_err_pol.html" title="Calling User Defined Error Handlers">user
- error handling</a> and <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">changing
+ error handling</a> and <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using Macros to Change the Policy Defaults">changing
policies defaults</a> .
</li>
<li>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,346 +24,293 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.history1"></a><a class="link" href="history1.html" title="History and What's New"> History and What's
+<a name="math_toolkit.main_overview.history1"></a><a class="link" href="history1.html" title="History and What's New">History and What's
New</a>
</h3></div></div></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_45_0"></a>
- </p>
-<h5>
-<a name="id911497"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_45_0">Boost-1.45.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.boost_1_46_0"></a><h5>
+<a name="id1019226"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_46_0">Boost-1.46.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added warnings about potential ambiguity with std random library in
- distribution and function names.
- </li>
+ Added Wald, Inverse Gaussian and geometric distributions.
+ </li>
<li>
- Added inverse gamma distribution and inverse chi_square and scaled
- inverse chi_square.
- </li>
+ Added information about configuration macros.
+ </li>
<li>
- Editorial revision of documentation, and added FAQ.
- </li>
+ Added support for mpreal as a real-numered type.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_44_0"></a>
- </p>
-<h5>
-<a name="id911536"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_44_0">Boost-1.44.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.boost_1_45_0"></a><h5>
+<a name="id1019264"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_45_0">Boost-1.45.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Fixed incorrect range and support for Rayleigh distribution.
- </li>
+ Added warnings about potential ambiguity with std random library in distribution
+ and function names.
+ </li>
+<li>
+ Added inverse gamma distribution and inverse chi_square and scaled inverse
+ chi_square.
+ </li>
<li>
- Fixed numerical error in the quantile of the Student's T distribution:
- the function was returning garbage values for non-integer degrees of
- freedom between 2 and 3.
- </li>
+ Editorial revision of documentation, and added FAQ.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_41_0"></a>
- </p>
-<h5>
-<a name="id911567"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_41_0">Boost-1.41.0</a>
- </h5>
-<p>
- </p>
-<div class="itemizedlist"><ul type="disc"><li>
- Significantly improved performance for the incomplete gamma function
- and its inverse.
- </li></ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_40_0"></a>
- </p>
-<h5>
-<a name="id911591"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_40_0">Boost-1.40.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.boost_1_44_0"></a><h5>
+<a name="id1019302"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_44_0">Boost-1.44.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added support for MPFR as a bignum type.
- </li>
-<li>
- Added some full specializations of the policy classes to reduce compile
- times.
- </li>
+ Fixed incorrect range and support for Rayleigh distribution.
+ </li>
<li>
- Added logistic and hypergeometric distributions, from Gautam Sewani's
- Google Summer of Code project.
- </li>
-<li>
- Added Laplace distribution submitted by Thijs van den Berg.
- </li>
-<li>
- Updated performance test code to include new distributions, and improved
- the performance of the non-central distributions.
- </li>
+ Fixed numerical error in the quantile of the Student's T distribution:
+ the function was returning garbage values for non-integer degrees of
+ freedom between 2 and 3.
+ </li>
+</ul></div>
+<a name="math_toolkit.main_overview.history1.boost_1_41_0"></a><h5>
+<a name="id1019334"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_41_0">Boost-1.41.0</a>
+ </h5>
+<div class="itemizedlist"><ul type="disc"><li>
+ Significantly improved performance for the incomplete gamma function
+ and its inverse.
+ </li></ul></div>
+<a name="math_toolkit.main_overview.history1.boost_1_40_0"></a><h5>
+<a name="id1019358"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_40_0">Boost-1.40.0</a>
+ </h5>
+<div class="itemizedlist"><ul type="disc">
<li>
- Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
- approximation</a> code, from Gautam Sewani's Google Summer of Code
- project.
- </li>
+ Added support for MPFR as a bignum type.
+ </li>
<li>
- Fixed bug in cyl_bessel_i that used an incorrect approximation for
- ν = 0.5, also effects the non-central Chi Square Distribution when ν =
- 3, see bug report #2877.
- </li>
+ Added some full specializations of the policy classes to reduce compile
+ times.
+ </li>
+<li>
+ Added logistic and hypergeometric distributions, from Gautam Sewani's
+ Google Summer of Code project.
+ </li>
+<li>
+ Added Laplace distribution submitted by Thijs van den Berg.
+ </li>
+<li>
+ Updated performance test code to include new distributions, and improved
+ the performance of the non-central distributions.
+ </li>
+<li>
+ Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
+ approximation</a> code, from Gautam Sewani's Google Summer of Code
+ project.
+ </li>
+<li>
+ Fixed bug in cyl_bessel_i that used an incorrect approximation for ν =
+ 0.5, also effects the non-central Chi Square Distribution when ν = 3, see
+ bug report #2877.
+ </li>
<li>
- Fixed minor bugs #2873.
- </li>
+ Fixed minor bugs #2873.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_38_0"></a>
- </p>
-<h5>
-<a name="id911680"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_38_0">Boost-1.38.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.boost_1_38_0"></a><h5>
+<a name="id1019446"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_38_0">Boost-1.38.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Johan Råde's optimised floating point classification routines.
- </li>
+ Added Johan Råde's optimised floating point classification routines.
+ </li>
<li>
- Fixed code so that it compiles in GCC's -pedantic mode (bug report
- #1451).
- </li>
+ Fixed code so that it compiles in GCC's -pedantic mode (bug report #1451).
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_37_0"></a>
- </p>
-<h5>
-<a name="id911716"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_37_0">Boost-1.37.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.boost_1_37_0"></a><h5>
+<a name="id1019482"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_37_0">Boost-1.37.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc"><li>
- Improved accuracy and testing of the inverse hypergeometric functions.
- </li></ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_36_0"></a>
- </p>
-<h5>
-<a name="id911740"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_36_0">Boost-1.36.0</a>
- </h5>
-<p>
- </p>
+ Improved accuracy and testing of the inverse hypergeometric functions.
+ </li></ul></div>
+<a name="math_toolkit.main_overview.history1.boost_1_36_0"></a><h5>
+<a name="id1019506"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_36_0">Boost-1.36.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Noncentral Chi Squared Distribution.
- </li>
+ Added Noncentral Chi Squared Distribution.
+ </li>
<li>
- Added Noncentral Beta Distribution.
- </li>
+ Added Noncentral Beta Distribution.
+ </li>
<li>
- Added Noncentral F Distribution.
- </li>
+ Added Noncentral F Distribution.
+ </li>
<li>
- Added Noncentral T Distribution.
- </li>
+ Added Noncentral T Distribution.
+ </li>
<li>
- Added Exponential Integral Functions.
- </li>
+ Added Exponential Integral Functions.
+ </li>
<li>
- Added Zeta Function.
- </li>
+ Added Zeta Function.
+ </li>
<li>
- Added Rounding and Truncation functions.
- </li>
+ Added Rounding and Truncation functions.
+ </li>
<li>
- Added Compile time powers of runtime bases.
- </li>
+ Added Compile time powers of runtime bases.
+ </li>
<li>
- Added SSE2 optimizations for Lanczos evaluation.
- </li>
+ Added SSE2 optimizations for Lanczos evaluation.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release"></a>
- </p>
-<h5>
-<a name="id911825"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release">Boost-1.35.0:
- Post Review First Official Release</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release"></a><h5>
+<a name="id1019588"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release">Boost-1.35.0:
+ Post Review First Official Release</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Policy based framework that allows fine grained control over
- function behaviour.
- </li>
-<li>
- <span class="bold"><strong>Breaking change:</strong></span> Changed default behaviour
- for domain, pole and overflow errors to throw an exception (based on
- review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- <span class="bold"><strong>Breaking change:</strong></span> Changed exception
- thrown when an internal evaluation error occurs to boost::math::evaluation_error.
- </li>
-<li>
- <span class="bold"><strong>Breaking change:</strong></span> Changed discrete
- quantiles to return an integer result: this is anything up to 20 times
- faster than finding the true root, this behaviour can be customised
- using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- Polynomial/rational function evaluation is now customisable and hopefully
- faster than before.
- </li>
+ Added Policy based framework that allows fine grained control over function
+ behaviour.
+ </li>
+<li>
+ <span class="bold"><strong>Breaking change:</strong></span> Changed default behaviour
+ for domain, pole and overflow errors to throw an exception (based on
+ review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ <span class="bold"><strong>Breaking change:</strong></span> Changed exception thrown
+ when an internal evaluation error occurs to boost::math::evaluation_error.
+ </li>
+<li>
+ <span class="bold"><strong>Breaking change:</strong></span> Changed discrete quantiles
+ to return an integer result: this is anything up to 20 times faster than
+ finding the true root, this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ Polynomial/rational function evaluation is now customisable and hopefully
+ faster than before.
+ </li>
<li>
- Added performance test program.
- </li>
+ Added performance test program.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_"></a>
- </p>
-<h5>
-<a name="id911911"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_">Milestone
- 4: Second Review Candidate (1st March 2007)</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_"></a><h5>
+<a name="id1019672"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_">Milestone
+ 4: Second Review Candidate (1st March 2007)</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Moved Xiaogang Zhang's Bessel Functions code into the library, and
- brought them into line with the rest of the code.
- </li>
+ Moved Xiaogang Zhang's Bessel Functions code into the library, and brought
+ them into line with the rest of the code.
+ </li>
<li>
- Added C# "Distribution Explorer" demo application.
- </li>
+ Added C# "Distribution Explorer" demo application.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a>
- </p>
-<h5>
-<a name="id911944"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_">Milestone
- 3: First Review Candidate (31st Dec 2006)</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a><h5>
+<a name="id1019703"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_">Milestone
+ 3: First Review Candidate (31st Dec 2006)</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Implemented the main probability distribution and density functions.
- </li>
-<li>
- Implemented digamma.
- </li>
+ Implemented the main probability distribution and density functions.
+ </li>
<li>
- Added more factorial functions.
- </li>
+ Implemented digamma.
+ </li>
<li>
- Implemented the Hermite, Legendre and Laguerre polynomials plus the
- spherical harmonic functions from TR1.
- </li>
+ Added more factorial functions.
+ </li>
<li>
- Moved Xiaogang Zhang's elliptic integral code into the library, and
- brought them into line with the rest of the code.
- </li>
-<li>
- Moved Hubert Holin's existing Boost.Math special functions into this
- library and brought them into line with the rest of the code.
- </li>
+ Implemented the Hermite, Legendre and Laguerre polynomials plus the spherical
+ harmonic functions from TR1.
+ </li>
+<li>
+ Moved Xiaogang Zhang's elliptic integral code into the library, and brought
+ them into line with the rest of the code.
+ </li>
+<li>
+ Moved Hubert Holin's existing Boost.Math special functions into this
+ library and brought them into line with the rest of the code.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006"></a>
- </p>
-<h5>
-<a name="id912006"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006">Milestone
- 2: Released September 10th 2006</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006"></a><h5>
+<a name="id1019763"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006">Milestone
+ 2: Released September 10th 2006</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement preview release of the statistical distributions.
- </li>
+ Implement preview release of the statistical distributions.
+ </li>
<li>
- Added statistical distributions tutorial.
- </li>
+ Added statistical distributions tutorial.
+ </li>
<li>
- Implemented root finding algorithms.
- </li>
+ Implemented root finding algorithms.
+ </li>
<li>
- Implemented the inverses of the incomplete gamma and beta functions.
- </li>
+ Implemented the inverses of the incomplete gamma and beta functions.
+ </li>
<li>
- Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
- </li>
+ Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
+ </li>
<li>
- Integrated the statistical results generated from the test data with
- Boost.Test: uses a database of expected results, indexed by test, floating
- point type, platform, and compiler.
- </li>
+ Integrated the statistical results generated from the test data with
+ Boost.Test: uses a database of expected results, indexed by test, floating
+ point type, platform, and compiler.
+ </li>
<li>
- Improved lgamma near 1 and 2 (rational approximations).
- </li>
+ Improved lgamma near 1 and 2 (rational approximations).
+ </li>
<li>
- Improved erf/erfc inverses (rational approximations).
- </li>
+ Improved erf/erfc inverses (rational approximations).
+ </li>
<li>
- Implemented Rational function generation (the Remez method).
- </li>
+ Implemented Rational function generation (the Remez method).
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006"></a>
- </p>
-<h5>
-<a name="id912088"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006">Milestone
- 1: Released March 31st 2006</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006"></a><h5>
+<a name="id1019845"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006">Milestone
+ 1: Released March 31st 2006</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement gamma/beta/erf functions along with their incomplete counterparts.
- </li>
-<li>
- Generate high quality test data, against which future improvements
- can be judged.
- </li>
-<li>
- Provide tools for the evaluation of infinite series, continued fractions,
- and rational functions.
- </li>
+ Implement gamma/beta/erf functions along with their incomplete counterparts.
+ </li>
<li>
- Provide tools for testing against tabulated test data, and collecting
- statistics on error rates.
- </li>
-<li>
- Provide sufficient docs for people to be able to find their way around
- the library.
- </li>
+ Generate high quality test data, against which future improvements can
+ be judged.
+ </li>
+<li>
+ Provide tools for the evaluation of infinite series, continued fractions,
+ and rational functions.
+ </li>
+<li>
+ Provide tools for testing against tabulated test data, and collecting
+ statistics on error rates.
+ </li>
+<li>
+ Provide sufficient docs for people to be able to find their way around
+ the library.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- SVN Revisions:
- </p>
-<p>
- </p>
-<p>
- Sandbox and trunk last synchonised at revision: .
- </p>
+ SVN Revisions:
+ </p>
<p>
+ Sandbox and trunk last synchonised at revision: .
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.intro"></a><a class="link" href="intro.html" title="About the Math Toolkit"> About the Math Toolkit</a>
+<a name="math_toolkit.main_overview.intro"></a><a class="link" href="intro.html" title="About the Math Toolkit">About the Math Toolkit</a>
</h3></div></div></div>
<p>
This library is divided into three interconnected parts:
</p>
<a name="math_toolkit.main_overview.intro.statistical_distributions"></a><h5>
-<a name="id894863"></a>
+<a name="id1004074"></a>
<a class="link" href="intro.html#math_toolkit.main_overview.intro.statistical_distributions">Statistical
Distributions</a>
</h5>
@@ -56,7 +56,7 @@
tests.
</p>
<a name="math_toolkit.main_overview.intro.mathematical_special_functions"></a><h5>
-<a name="id894947"></a>
+<a name="id1004158"></a>
<a class="link" href="intro.html#math_toolkit.main_overview.intro.mathematical_special_functions">Mathematical
Special Functions</a>
</h5>
@@ -83,12 +83,12 @@
<span class="keyword">double</span></code>.
</p>
<a name="math_toolkit.main_overview.intro.implementation_toolkit"></a><h5>
-<a name="id895014"></a>
+<a name="id1004225"></a>
<a class="link" href="intro.html#math_toolkit.main_overview.intro.implementation_toolkit">Implementation
Toolkit</a>
</h5>
<p>
- Provides <a class="link" href="../toolkit.html" title="Internal Details and Tools (Experimental)">many of the tools</a> required
+ Provides <a class="link" href="../toolkit.html" title="Tools, Constants and Internal Details">many of the tools</a> required
to implement mathematical special functions: hopefully the presence of these
will encourage other authors to contribute more special function implementations
in the future. These tools are currently considered experimental: they are
@@ -102,8 +102,8 @@
approximations</a>.
</p>
<p>
- There is a fairly comprehensive set of root finding and <a class="link" href="../toolkit/internals1/minima.html" title="Locating Function Minima">function
- minimisation algorithms</a>: the root finding algorithms are both <a class="link" href="../toolkit/internals1/roots.html" title="Root Finding With Derivatives">with</a> and <a class="link" href="../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">without</a>
+ There is a fairly comprehensive set of root finding and <a class="link" href="../toolkit/internals1/minima.html" title="Locating Function Minima: Brent's algorithm">function
+ minimisation algorithms</a>: the root finding algorithms are both <a class="link" href="../toolkit/internals1/roots.html" title="Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder">with</a> and <a class="link" href="../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">without</a>
derivative support.
</p>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.namespaces"></a><a class="link" href="namespaces.html" title="Namespaces"> Namespaces</a>
+<a name="math_toolkit.main_overview.namespaces"></a><a class="link" href="namespaces.html" title="Namespaces">Namespaces</a>
</h3></div></div></div>
<p>
All math functions and distributions are in <code class="computeroutput"><span class="keyword">namespace</span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,14 +24,14 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.navigation"></a><a class="link" href="navigation.html" title="Navigation"> Navigation</a>
+<a name="math_toolkit.main_overview.navigation"></a><a class="link" href="navigation.html" title="Navigation">Navigation</a>
</h3></div></div></div>
<p>
Used in combination with the configured browser key, the following keys act
as handy shortcuts for common navigation tasks.
</p>
<a name="math_toolkit.main_overview.navigation.shortcuts"></a><h6>
-<a name="id895113"></a>
+<a name="id1004326"></a>
<a class="link" href="navigation.html#math_toolkit.main_overview.navigation.shortcuts">Shortcuts</a>
</h6>
<div class="blockquote"><blockquote class="blockquote">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,56 +24,44 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.perf_over"></a><a class="link" href="perf_over.html" title="Performance"> Performance</a>
+<a name="math_toolkit.main_overview.perf_over"></a><a class="link" href="perf_over.html" title="Performance">Performance</a>
</h3></div></div></div>
<p>
- </p>
-<p>
- By and large the performance of this library should be acceptable for most
- needs. However, you should note that this library's primary emphasis is
- on accuracy and numerical stability, and <span class="emphasis"><em>not</em></span> speed.
- </p>
-<p>
- </p>
-<p>
- In terms of the algorithms used, this library aims to use the same "best
- of breed" algorithms as many other libraries: the principle difference
- is that this library is implemented in C++ - taking advantage of all the
- abstraction mechanisms that C++ offers - where as most traditional numeric
- libraries are implemented in C or FORTRAN. Traditionally languages such
- as C or FORTRAN are perceived as easier to optimise than more complex languages
- like C++, so in a sense this library provides a good test of current compiler
- technology, and the "abstraction penalty" - if any - of C++ compared
- to other languages.
- </p>
-<p>
- </p>
+ By and large the performance of this library should be acceptable for most
+ needs. However, you should note that this library's primary emphasis is on
+ accuracy and numerical stability, and <span class="emphasis"><em>not</em></span> speed.
+ </p>
<p>
- The two most important things you can do to ensure the best performance
- from this library are:
- </p>
+ In terms of the algorithms used, this library aims to use the same "best
+ of breed" algorithms as many other libraries: the principle difference
+ is that this library is implemented in C++ - taking advantage of all the
+ abstraction mechanisms that C++ offers - where as most traditional numeric
+ libraries are implemented in C or FORTRAN. Traditionally languages such as
+ C or FORTRAN are perceived as easier to optimise than more complex languages
+ like C++, so in a sense this library provides a good test of current compiler
+ technology, and the "abstraction penalty" - if any - of C++ compared
+ to other languages.
+ </p>
<p>
- </p>
+ The two most important things you can do to ensure the best performance from
+ this library are:
+ </p>
<div class="orderedlist"><ol type="1">
<li>
- Turn on your compilers optimisations: the difference between "release"
- and "debug" builds can easily be a <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">factor
- of 20</a>.
- </li>
+ Turn on your compilers optimisations: the difference between "release"
+ and "debug" builds can easily be a <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">factor
+ of 20</a>.
+ </li>
<li>
- Pick your compiler carefully: <a class="link" href="../perf/comp_compilers.html" title="Comparing Compilers">performance
- differences of up to 8 fold</a> have been found between some Windows
- compilers for example.
- </li>
+ Pick your compiler carefully: <a class="link" href="../perf/comp_compilers.html" title="Comparing Compilers">performance
+ differences of up to 8 fold</a> have been found between some Windows
+ compilers for example.
+ </li>
</ol></div>
<p>
- </p>
-<p>
- The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
- more information on the performance of this library, what you can do to
- fine tune it, and how this library compares to some other open source alternatives.
- </p>
-<p>
+ The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
+ more information on the performance of this library, what you can do to fine
+ tune it, and how this library compares to some other open source alternatives.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,12 +1,12 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Configuration and Policies</title>
+<title>Policies</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../main_overview.html" title="Overview">
-<link rel="prev" href="compilers_overview.html" title="Compilers">
+<link rel="prev" href="config_macros.html" title="Configuration Macros">
<link rel="next" href="threads.html" title="Thread Safety">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,104 +20,85 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="compilers_overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="threads.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="config_macros.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="threads.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.pol_overview"></a><a class="link" href="pol_overview.html" title="Configuration and Policies"> Configuration
- and Policies</a>
+<a name="math_toolkit.main_overview.pol_overview"></a><a class="link" href="pol_overview.html" title="Policies">Policies</a>
</h3></div></div></div>
<p>
- </p>
-<p>
- Policies are a powerful fine-grain mechanism that allow you to customise
- the behaviour of this library according to your needs. There is more information
- available in the <a class="link" href="../policy/pol_tutorial.html" title="Policy Tutorial">policy
- tutorial</a> and the <a class="link" href="../policy/pol_ref.html" title="Policy Reference">policy
- reference</a>.
- </p>
-<p>
- </p>
-<p>
- Generally speaking, unless you find that the <a class="link" href="../policy/pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
- policy behaviour</a> when encountering 'bad' argument values does not
- meet your needs, you should not need to worry about policies.
- </p>
-<p>
- </p>
-<p>
- Policies are a compile-time mechanism that allow you to change error-handling
- or calculation precision either program wide, or at the call site.
- </p>
-<p>
- </p>
+ Policies are a powerful fine-grain mechanism that allow you to customise
+ the behaviour of this library according to your needs. There is more information
+ available in the <a class="link" href="../policy/pol_tutorial.html" title="Policy Tutorial">policy
+ tutorial</a> and the <a class="link" href="../policy/pol_ref.html" title="Policy Reference">policy
+ reference</a>.
+ </p>
<p>
- Although the policy mechanism itself is rather complicated, in practice
- it is easy to use, and very flexible.
- </p>
+ Generally speaking, unless you find that the <a class="link" href="../policy/pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
+ policy behaviour</a> when encountering 'bad' argument values does not
+ meet your needs, you should not need to worry about policies.
+ </p>
<p>
- </p>
+ Policies are a compile-time mechanism that allow you to change error-handling
+ or calculation precision either program wide, or at the call site.
+ </p>
<p>
- Using policies you can control:
- </p>
+ Although the policy mechanism itself is rather complicated, in practice it
+ is easy to use, and very flexible.
+ </p>
<p>
- </p>
+ Using policies you can control:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- <a class="link" href="../policy/pol_ref/error_handling_policies.html" title="Error Handling Policies">How
- results from 'bad' arguments are handled</a>, including those that
- cannot be fully evaluated.
- </li>
-<li>
- How <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">accuracy
- is controlled by internal promotion</a> to use more precise types.
- </li>
-<li>
- What working <a class="link" href="../policy/pol_ref/precision_pol.html" title="Precision Policies">precision</a>
- should be used to calculate results.
- </li>
-<li>
- What to do when a <a class="link" href="../policy/pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
- undefined function</a> is used: Should this raise a run-time or
- compile-time error?
- </li>
-<li>
- Whether <a class="link" href="../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
- functions</a>, like the binomial, should return real or only integral
- values, and how they are rounded.
- </li>
-<li>
- How many iterations a special function is permitted to perform in a
- series evaluation or root finding algorithm before it gives up and
- raises an <a class="link" href="error_handling.html#evaluation_error">evaluation_error</a>.
- </li>
+ <a class="link" href="../policy/pol_ref/error_handling_policies.html" title="Error Handling Policies">How
+ results from 'bad' arguments are handled</a>, including those that
+ cannot be fully evaluated.
+ </li>
+<li>
+ How <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">accuracy
+ is controlled by internal promotion</a> to use more precise types.
+ </li>
+<li>
+ What working <a class="link" href="../policy/pol_ref/precision_pol.html" title="Precision Policies">precision</a>
+ should be used to calculate results.
+ </li>
+<li>
+ What to do when a <a class="link" href="../policy/pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
+ undefined function</a> is used: Should this raise a run-time or compile-time
+ error?
+ </li>
+<li>
+ Whether <a class="link" href="../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
+ functions</a>, like the binomial, should return real or only integral
+ values, and how they are rounded.
+ </li>
+<li>
+ How many iterations a special function is permitted to perform in a series
+ evaluation or root finding algorithm before it gives up and raises an
+ <a class="link" href="error_handling.html#evaluation_error">evaluation_error</a>.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- You can control policies:
- </p>
-<p>
- </p>
+ You can control policies:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- Using <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">macros</a>
- to change any default policy: the is the prefered method for installation
- wide policies.
- </li>
-<li>
- At your chosen <a class="link" href="../policy/pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
- scope</a> for distributions and/or functions: this is the prefered
- method for project, namespace, or translation unit scope policies.
- </li>
-<li>
- In an ad-hoc manner <a class="link" href="../policy/pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
- passing a specific policy to a special function</a>, or to a <a class="link" href="../policy/pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
- distribution</a>.
- </li>
+ Using <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using Macros to Change the Policy Defaults">macros</a>
+ to change any default policy: the is the prefered method for installation
+ wide policies.
+ </li>
+<li>
+ At your chosen <a class="link" href="../policy/pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
+ scope</a> for distributions and/or functions: this is the prefered
+ method for project, namespace, or translation unit scope policies.
+ </li>
+<li>
+ In an ad-hoc manner <a class="link" href="../policy/pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
+ passing a specific policy to a special function</a>, or to a <a class="link" href="../policy/pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
+ distribution</a>.
+ </li>
</ul></div>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
@@ -131,7 +112,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="compilers_overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="threads.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="config_macros.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="threads.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.result_type"></a><a class="link" href="result_type.html" title="Calculation of the Type of the Result"> Calculation
- of the Type of the Result</a>
+<a name="math_toolkit.main_overview.result_type"></a><a class="link" href="result_type.html" title="Calculation of the Type of the Result">Calculation of
+ the Type of the Result</a>
</h3></div></div></div>
<p>
The functions in this library are all overloaded to accept mixed floating
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../main_overview.html" title="Overview">
-<link rel="prev" href="pol_overview.html" title="Configuration and Policies">
+<link rel="prev" href="pol_overview.html" title="Policies">
<link rel="next" href="perf_over.html" title="Performance">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.threads"></a><a class="link" href="threads.html" title="Thread Safety"> Thread Safety</a>
+<a name="math_toolkit.main_overview.threads"></a><a class="link" href="threads.html" title="Thread Safety">Thread Safety</a>
</h3></div></div></div>
<p>
The library is fully thread safe and re-entrant provided the function and
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,87 +24,69 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.tr1"></a><a class="link" href="tr1.html" title="C99 and C++ TR1 C-style Functions"> C99 and C++ TR1 C-style
+<a name="math_toolkit.main_overview.tr1"></a><a class="link" href="tr1.html" title="C99 and C++ TR1 C-style Functions">C99 and C++ TR1 C-style
Functions</a>
</h3></div></div></div>
<p>
- </p>
-<p>
- Many of the special functions included in this library are also a part
- of the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
- Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
- Report on C++ Library Extensions</a>. Therefore this library includes
- a thin wrapper header <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span></code>
- that provides compatibility with these two standards.
- </p>
-<p>
- </p>
-<p>
- There are various pros and cons to using the library in this way:
- </p>
-<p>
- </p>
+ Many of the special functions included in this library are also a part of
+ the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
+ Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
+ Report on C++ Library Extensions</a>. Therefore this library includes
+ a thin wrapper header <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ that provides compatibility with these two standards.
+ </p>
<p>
- Pros:
- </p>
+ There are various pros and cons to using the library in this way:
+ </p>
<p>
- </p>
+ Pros:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- The header to include is lightweight (i.e. fast to compile).
- </li>
+ The header to include is lightweight (i.e. fast to compile).
+ </li>
<li>
- The functions have extern "C" linkage, and so are usable
- from other languages (not just C and C++).
- </li>
+ The functions have extern "C" linkage, and so are usable from
+ other languages (not just C and C++).
+ </li>
<li>
- C99 and C++ TR1 Standard compatibility.
- </li>
+ C99 and C++ TR1 Standard compatibility.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- Cons:
- </p>
-<p>
- </p>
+ Cons:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- You will need to compile and link to the external Boost.Math libraries.
- </li>
+ You will need to compile and link to the external Boost.Math libraries.
+ </li>
<li>
- Limited to support for the types, <code class="computeroutput"><span class="keyword">float</span></code>,
- <code class="computeroutput"><span class="keyword">double</span></code> and <code class="computeroutput"><span class="keyword">long</span> <span class="keyword">double</span></code>.
- </li>
+ Limited to support for the types, <code class="computeroutput"><span class="keyword">float</span></code>,
+ <code class="computeroutput"><span class="keyword">double</span></code> and <code class="computeroutput"><span class="keyword">long</span> <span class="keyword">double</span></code>.
+ </li>
<li>
- Error handling is handled via setting ::errno and returning NaN's and
- infinities: this may be less flexible than an C++ exception based approach.
- </li>
+ Error handling is handled via setting ::errno and returning NaN's and
+ infinities: this may be less flexible than an C++ exception based approach.
+ </li>
</ul></div>
-<p>
- </p>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
- The separate libraries are required <span class="bold"><strong>only</strong></span>
- if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
- header, the rest of Boost.Math remains header-only.
- </p></td></tr>
+ The separate libraries are required <span class="bold"><strong>only</strong></span>
+ if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
+ header, the rest of Boost.Math remains header-only.
+ </p></td></tr>
</table></div>
<p>
- </p>
-<p>
- The separate libraries required in order to use tr1.hpp can be compiled
- using bjam from within the libs/math/build directory, or from the Boost
- root directory using the usual Boost-wide install procedure. Alternatively
- the source files are located in libs/math/src and each have the same name
- as the function they implement. The various libraries are named as follows:
- </p>
-<p>
- </p>
+ The separate libraries required in order to use tr1.hpp can be compiled using
+ bjam from within the libs/math/build directory, or from the Boost root directory
+ using the usual Boost-wide install procedure. Alternatively the source files
+ are located in libs/math/src and each have the same name as the function
+ they implement. The various libraries are named as follows:
+ </p>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -113,140 +95,136 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Name
- </p>
- </th>
+ <p>
+ Name
+ </p>
+ </th>
<th>
- <p>
- Type
- </p>
- </th>
+ <p>
+ Type
+ </p>
+ </th>
<th>
- <p>
- Functions
- </p>
- </th>
+ <p>
+ Functions
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- boost_math_c99f-<suffix>
- </p>
- </td>
-<td>
- <p>
- float
- </p>
- </td>
-<td>
- <p>
- C99 Functions
- </p>
- </td>
+ <p>
+ boost_math_c99f-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ float
+ </p>
+ </td>
+<td>
+ <p>
+ C99 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_c99-<suffix>
- </p>
- </td>
-<td>
- <p>
- double
- </p>
- </td>
-<td>
- <p>
- C99 Functions
- </p>
- </td>
+ <p>
+ boost_math_c99-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ double
+ </p>
+ </td>
+<td>
+ <p>
+ C99 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_c99l-<suffix>
- </p>
- </td>
-<td>
- <p>
- long double
- </p>
- </td>
-<td>
- <p>
- C99 Functions
- </p>
- </td>
+ <p>
+ boost_math_c99l-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ long double
+ </p>
+ </td>
+<td>
+ <p>
+ C99 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_tr1f-<suffix>
- </p>
- </td>
-<td>
- <p>
- float
- </p>
- </td>
-<td>
- <p>
- TR1 Functions
- </p>
- </td>
+ <p>
+ boost_math_tr1f-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ float
+ </p>
+ </td>
+<td>
+ <p>
+ TR1 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_tr1-<suffix>
- </p>
- </td>
-<td>
- <p>
- double
- </p>
- </td>
-<td>
- <p>
- TR1 Functions
- </p>
- </td>
+ <p>
+ boost_math_tr1-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ double
+ </p>
+ </td>
+<td>
+ <p>
+ TR1 Functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- boost_math_tr1l-<suffix>
- </p>
- </td>
-<td>
- <p>
- long double
- </p>
- </td>
-<td>
- <p>
- TR1 Functions
- </p>
- </td>
+ <p>
+ boost_math_tr1l-<suffix>
+ </p>
+ </td>
+<td>
+ <p>
+ long double
+ </p>
+ </td>
+<td>
+ <p>
+ TR1 Functions
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
<p>
- </p>
-<p>
- Where <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> encodes the compiler and build options
- used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
- would be the statically linked TR1 library to use with Visual C++ 8.0,
- in multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
- would be import library for the TR1 DLL to be used with Visual C++ 8.0
- with the release multithreaded DLL VC++ runtime. Refer to the getting started
- guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
- explanation of the <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> meanings</a>.
- </p>
-<p>
- </p>
+ Where <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> encodes the compiler and build options
+ used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
+ would be the statically linked TR1 library to use with Visual C++ 8.0, in
+ multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
+ would be import library for the TR1 DLL to be used with Visual C++ 8.0 with
+ the release multithreaded DLL VC++ runtime. Refer to the getting started
+ guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
+ explanation of the <code class="computeroutput"><span class="special"><</span><span class="identifier">suffix</span><span class="special">></span></code> meanings</a>.
+ </p>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
@@ -254,103 +232,79 @@
</tr>
<tr><td align="left" valign="top">
<p>
- Visual C++ users will typically have the correct library variant to link
- against selected for them by boost/math/tr1.hpp based on your compiler
- settings.
- </p>
-<p>
- Users will need to define BOOST_MATH_TR1_DYN_LINK when building their
- code if they want to link against the DLL versions of these libraries
- rather than the static versions.
- </p>
-<p>
- Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when
- building: this is typically only used when linking against a customised
- build of the libraries.
- </p>
-</td></tr>
-</table></div>
+ Visual C++ users will typically have the correct library variant to link
+ against selected for them by boost/math/tr1.hpp based on your compiler
+ settings.
+ </p>
+<p>
+ Users will need to define BOOST_MATH_TR1_DYN_LINK when building their code
+ if they want to link against the DLL versions of these libraries rather
+ than the static versions.
+ </p>
<p>
+ Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when building:
+ this is typically only used when linking against a customised build of
+ the libraries.
</p>
+</td></tr>
+</table></div>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
- Linux and Unix users will generally only have one variant of these libraries
- installed, and can generally just link against -lboost_math_tr1 etc.
- </p></td></tr>
+ Linux and Unix users will generally only have one variant of these libraries
+ installed, and can generally just link against -lboost_math_tr1 etc.
+ </p></td></tr>
</table></div>
+<a name="math_toolkit.main_overview.tr1.usage_recomendations"></a><h5>
+<a name="id1020315"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.usage_recomendations">Usage
+ Recomendations</a>
+ </h5>
<p>
- <a name="math_toolkit.main_overview.tr1.usage_recomendations"></a>
- </p>
-<h5>
-<a name="id912561"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.usage_recomendations">Usage
- Recomendations</a>
- </h5>
-<p>
- </p>
-<p>
- This library now presents the user with a choice:
- </p>
-<p>
- </p>
+ This library now presents the user with a choice:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- To include the header only versions of the functions and have an easier
- time linking, but a longer compile time.
- </li>
+ To include the header only versions of the functions and have an easier
+ time linking, but a longer compile time.
+ </li>
<li>
- To include the TR1 headers and link against an external library.
- </li>
+ To include the TR1 headers and link against an external library.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- Which option you choose depends largely on how you prefer to work and how
- your system is set up.
- </p>
-<p>
- </p>
-<p>
- For example a casual user who just needs the acosh function, would probably
- be better off including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">acosh</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
- and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> in
- their code.
- </p>
-<p>
- </p>
-<p>
- However, for large scale software development where compile times are significant,
- and where the Boost libraries are already built and installed on the system,
- then including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code> and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- will speed up compile times, reduce object files sizes (since there are
- no templates being instantiated any more), and also speed up debugging
- runtimes - since the externally compiled libraries can be compiler optimised,
- rather than built using full settings - the difference in performance between
- <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release and debug builds
- can be as much as 20 times</a>, so for complex applications this can
- be a big win.
- </p>
-<p>
- <a name="math_toolkit.main_overview.tr1.supported_c99_functions"></a>
- </p>
-<h5>
-<a name="id912763"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_c99_functions">Supported
- C99 Functions</a>
- </h5>
+ Which option you choose depends largely on how you prefer to work and how
+ your system is set up.
+ </p>
<p>
- </p>
+ For example a casual user who just needs the acosh function, would probably
+ be better off including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">acosh</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> in their
+ code.
+ </p>
<p>
- See also the <a class="link" href="../extern_c/c99.html" title="C99 C Functions">quick reference
- guide for these functions</a>.
- </p>
+ However, for large scale software development where compile times are significant,
+ and where the Boost libraries are already built and installed on the system,
+ then including <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tr1</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code> and using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">acosh</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> will
+ speed up compile times, reduce object files sizes (since there are no templates
+ being instantiated any more), and also speed up debugging runtimes - since
+ the externally compiled libraries can be compiler optimised, rather than
+ built using full settings - the difference in performance between <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release
+ and debug builds can be as much as 20 times</a>, so for complex applications
+ this can be a big win.
+ </p>
+<a name="math_toolkit.main_overview.tr1.supported_c99_functions"></a><h5>
+<a name="id1020518"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_c99_functions">Supported
+ C99 Functions</a>
+ </h5>
<p>
-
-</p>
+ See also the <a class="link" href="../extern_c/c99.html" title="C99 C Functions">quick reference guide
+ for these functions</a>.
+ </p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tr1</span><span class="special">{</span> <span class="keyword">extern</span> <span class="string">"C"</span><span class="special">{</span>
<span class="keyword">typedef</span> <span class="identifier">unspecified</span> <span class="identifier">float_t</span><span class="special">;</span>
@@ -438,23 +392,15 @@
<span class="special">}}}}</span> <span class="comment">// namespaces
</span></pre>
+<a name="math_toolkit.main_overview.tr1.supported_tr1_functions"></a><h5>
+<a name="id1023485"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_tr1_functions">Supported
+ TR1 Functions</a>
+ </h5>
<p>
- <a name="math_toolkit.main_overview.tr1.supported_tr1_functions"></a>
- </p>
-<h5>
-<a name="id914871"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_tr1_functions">Supported
- TR1 Functions</a>
- </h5>
-<p>
- </p>
-<p>
- See also the <a class="link" href="../extern_c/tr1.html" title="C99 and TR1 C Functions Overview">quick reference
- guide for these functions</a>.
- </p>
-<p>
-
-</p>
+ See also the <a class="link" href="../extern_c/tr1.html" title="C99 and TR1 C Functions Overview">quick reference guide
+ for these functions</a>.
+ </p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tr1</span><span class="special">{</span> <span class="keyword">extern</span> <span class="string">"C"</span><span class="special">{</span>
<span class="comment">// [5.2.1.1] associated Laguerre polynomials:
@@ -567,27 +513,19 @@
<span class="special">}}}}</span> <span class="comment">// namespaces
</span></pre>
<p>
- </p>
-<p>
- In addition sufficient additional overloads of the <code class="computeroutput"><span class="keyword">double</span></code>
- versions of the above functions are provided, so that calling the function
- with any mixture of <code class="computeroutput"><span class="keyword">float</span></code>,
- <code class="computeroutput"><span class="keyword">double</span></code>, <code class="computeroutput"><span class="keyword">long</span>
- <span class="keyword">double</span></code>, or <span class="emphasis"><em>integer</em></span>
- arguments is supported, with the return type determined by the <a class="link" href="result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>result
- type calculation rules</em></span></a>.
- </p>
-<p>
- <a name="math_toolkit.main_overview.tr1.currently_unsupported_c99_functions"></a>
- </p>
-<h5>
-<a name="id919390"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_c99_functions">Currently
- Unsupported C99 Functions</a>
- </h5>
-<p>
-
-</p>
+ In addition sufficient additional overloads of the <code class="computeroutput"><span class="keyword">double</span></code>
+ versions of the above functions are provided, so that calling the function
+ with any mixture of <code class="computeroutput"><span class="keyword">float</span></code>,
+ <code class="computeroutput"><span class="keyword">double</span></code>, <code class="computeroutput"><span class="keyword">long</span>
+ <span class="keyword">double</span></code>, or <span class="emphasis"><em>integer</em></span>
+ arguments is supported, with the return type determined by the <a class="link" href="result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>result
+ type calculation rules</em></span></a>.
+ </p>
+<a name="math_toolkit.main_overview.tr1.currently_unsupported_c99_functions"></a><h5>
+<a name="id1027452"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_c99_functions">Currently
+ Unsupported C99 Functions</a>
+ </h5>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">exp2</span><span class="special">(</span><span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">float</span> <span class="identifier">exp2f</span><span class="special">(</span><span class="keyword">float</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">exp2l</span><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
@@ -648,17 +586,11 @@
<span class="keyword">float</span> <span class="identifier">scalbnf</span><span class="special">(</span><span class="keyword">float</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">ex</span><span class="special">);</span>
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">scalbnl</span><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">ex</span><span class="special">);</span>
</pre>
-<p>
- <a name="math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions"></a>
- </p>
-<h5>
-<a name="id921604"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions">Currently
- Unsupported TR1 Functions</a>
- </h5>
-<p>
-
-</p>
+<a name="math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions"></a><h5>
+<a name="id1029119"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions">Currently
+ Unsupported TR1 Functions</a>
+ </h5>
<pre class="programlisting"><span class="comment">// [5.2.1.7] confluent hypergeometric functions:
</span><span class="keyword">double</span> <span class="identifier">conf_hyperg</span><span class="special">(</span><span class="keyword">double</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">double</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">float</span> <span class="identifier">conf_hypergf</span><span class="special">(</span><span class="keyword">float</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">float</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">float</span> <span class="identifier">x</span><span class="special">);</span>
@@ -670,8 +602,6 @@
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">hypergl</span><span class="special">(</span><span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">b</span><span class="special">,</span> <span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">c</span><span class="special">,</span>
<span class="keyword">long</span> <span class="keyword">double</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,18 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.perf"></a><a class="link" href="perf.html" title="Performance"> Performance</a>
+<a name="math_toolkit.perf"></a><a class="link" href="perf.html" title="Performance">Performance</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Performance Overview</span></dt>
-<dt><span class="section"> Interpreting these Results</span></dt>
-<dt><span class="section"><a href="perf/getting_best.html"> Getting the Best Performance
+<dt><span class="section">Performance Overview</span></dt>
+<dt><span class="section">Interpreting these Results</span></dt>
+<dt><span class="section"><a href="perf/getting_best.html">Getting the Best Performance
from this Library</a></span></dt>
-<dt><span class="section"> Comparing Compilers</span></dt>
-<dt><span class="section"> Performance Tuning Macros</span></dt>
-<dt><span class="section"><a href="perf/comparisons.html"> Comparisons to Other
- Open Source Libraries</a></span></dt>
-<dt><span class="section"><a href="perf/perf_test_app.html"> The Performance Test
+<dt><span class="section">Comparing Compilers</span></dt>
+<dt><span class="section">Performance Tuning Macros</span></dt>
+<dt><span class="section"><a href="perf/comparisons.html">Comparisons to Other Open
+ Source Libraries</a></span></dt>
+<dt><span class="section"><a href="perf/perf_test_app.html">The Performance Test
Application</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.comp_compilers"></a><a class="link" href="comp_compilers.html" title="Comparing Compilers"> Comparing Compilers</a>
+<a name="math_toolkit.perf.comp_compilers"></a><a class="link" href="comp_compilers.html" title="Comparing Compilers">Comparing Compilers</a>
</h3></div></div></div>
<p>
After a good choice of build settings the next most important thing you can
@@ -35,7 +35,7 @@
in this respect).
</p>
<div class="table">
-<a name="math_toolkit.perf.comp_compilers.performance_comparison_of_various_windows_compilers"></a><p class="title"><b>Table 48. Performance Comparison of Various Windows Compilers</b></p>
+<a name="math_toolkit.perf.comp_compilers.performance_comparison_of_various_windows_compilers"></a><p class="title"><b>Table 51. Performance Comparison of Various Windows Compilers</b></p>
<div class="table-contents"><table class="table" summary="Performance Comparison of Various Windows Compilers">
<colgroup>
<col>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.comparisons"></a><a class="link" href="comparisons.html" title="Comparisons to Other Open Source Libraries"> Comparisons to Other
- Open Source Libraries</a>
+<a name="math_toolkit.perf.comparisons"></a><a class="link" href="comparisons.html" title="Comparisons to Other Open Source Libraries">Comparisons to Other Open
+ Source Libraries</a>
</h3></div></div></div>
<p>
We've run our performance tests both for our own code, and against other
@@ -46,7 +46,7 @@
</p></td></tr>
</table></div>
<a name="math_toolkit.perf.comparisons.comparison_to_gsl_1_13_and_cephes"></a><h5>
-<a name="id1277204"></a>
+<a name="id1411310"></a>
<a class="link" href="comparisons.html#math_toolkit.perf.comparisons.comparison_to_gsl_1_13_and_cephes">Comparison
to GSL-1.13 and Cephes</a>
</h5>
@@ -344,7 +344,7 @@
</td>
<td>
<p>
- +INF <sup>[<a name="id1277760" href="#ftn.id1277760" class="footnote">1</a>]</sup>
+ +INF <sup>[<a name="id1412455" href="#ftn.id1412455" class="footnote">1</a>]</sup>
</p>
</td>
</tr>
@@ -423,7 +423,7 @@
<td>
<p>
</p>
-<p>17.89<sup>[<a name="id1277918" href="#ftn.id1277918" class="footnote">2</a>]</sup></p>
+<p>17.89<sup>[<a name="id1412612" href="#ftn.id1412612" class="footnote">2</a>]</sup></p>
<p> </p>
<p>(4.248e-005s)</p>
<p>
@@ -548,11 +548,11 @@
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="4">
-<div class="footnote"><p><sup>[<a name="ftn.id1277760" href="#id1277760" class="para">1</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1412455" href="#id1412455" class="para">1</a>] </sup>
Cephes gets stuck in an infinite loop while trying to execute
our test cases.
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1277918" href="#id1277918" class="para">2</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1412612" href="#id1412612" class="para">2</a>] </sup>
The performance here is dominated by a few cases where the parameters
grow very large: faster asymptotic expansions are available,
but are of limited (or even frankly terrible) precision. The
@@ -563,7 +563,7 @@
</td></tr></tbody>
</table></div>
<a name="math_toolkit.perf.comparisons.comparison_to_the_r_and_dcdflib_statistical_libraries_on_windows"></a><h5>
-<a name="id1278161"></a>
+<a name="id1412856"></a>
<a class="link" href="comparisons.html#math_toolkit.perf.comparisons.comparison_to_the_r_and_dcdflib_statistical_libraries_on_windows">Comparison
to the R and DCDFLIB Statistical Libraries on Windows</a>
</h5>
@@ -574,7 +574,7 @@
(R-2.9.2 appears not to be buildable with Visual C++).
</p>
<div class="table">
-<a name="math_toolkit.perf.comparisons.a_comparison_to_the_r_statistical_library_on_windows_xp"></a><p class="title"><b>Table 51. A Comparison to the R Statistical Library on Windows XP</b></p>
+<a name="math_toolkit.perf.comparisons.a_comparison_to_the_r_statistical_library_on_windows_xp"></a><p class="title"><b>Table 54. A Comparison to the R Statistical Library on Windows XP</b></p>
<div class="table-contents"><table class="table" summary="A Comparison to the R Statistical Library on Windows XP">
<colgroup>
<col>
@@ -659,7 +659,7 @@
<td>
<p>
</p>
-<p>67.66<sup>[<a name="id1278326" href="#ftn.id1278326" class="footnote">1</a>]</sup></p>
+<p>67.66<sup>[<a name="id1413019" href="#ftn.id1413019" class="footnote">1</a>]</sup></p>
<p> </p>
<p>(3.366e-004s)</p>
<p>
@@ -1082,14 +1082,13 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/hypergeometric_dist.html" title="Hypergeometric Distribution">Hypergeometric
- Distribution</a> CDF
+ __hypergeometric_distrib CDF
</p>
</td>
<td>
<p>
</p>
-<p>3.60<sup>[<a name="id1279161" href="#ftn.id1279161" class="footnote">2</a>]</sup></p>
+<p>3.60<sup>[<a name="id1413772" href="#ftn.id1413772" class="footnote">2</a>]</sup></p>
<p> </p>
<p>(5.987e-007s)</p>
<p>
@@ -1113,8 +1112,7 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/hypergeometric_dist.html" title="Hypergeometric Distribution">Hypergeometric
- Distribution</a> Quantile
+ __hypergeometric_distrib Quantile
</p>
</td>
<td>
@@ -1319,7 +1317,7 @@
<td>
<p>
</p>
-<p>43.43<sup>[<a name="id1279573" href="#ftn.id1279573" class="footnote">3</a>]</sup></p>
+<p>43.43<sup>[<a name="id1414179" href="#ftn.id1414179" class="footnote">3</a>]</sup></p>
<p> </p>
<p>(3.732e-004s)</p>
<p>
@@ -1389,7 +1387,7 @@
<td>
<p>
</p>
-<p>393.90<sup>[<a name="id1279699" href="#ftn.id1279699" class="footnote">4</a>]</sup></p>
+<p>393.90<sup>[<a name="id1414305" href="#ftn.id1414305" class="footnote">4</a>]</sup></p>
<p> </p>
<p>(2.673e-002s)</p>
<p>
@@ -1525,7 +1523,7 @@
<td>
<p>
</p>
-<p><span class="bold"><strong>1.00</strong></span><sup>[<a name="id1279950" href="#ftn.id1279950" class="footnote">5</a>]</sup></p>
+<p><span class="bold"><strong>1.00</strong></span><sup>[<a name="id1414708" href="#ftn.id1414708" class="footnote">5</a>]</sup></p>
<p> </p>
<p>(4.411e-004s)</p>
<p>
@@ -1750,7 +1748,7 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/weibull.html" title="Weibull Distribution">Weibull
+ <a class="link" href="../dist/dist_ref/dists/weibull_dist.html" title="Weibull Distribution">Weibull
Distribution</a> CDF
</p>
</td>
@@ -1781,7 +1779,7 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/weibull.html" title="Weibull Distribution">Weibull
+ <a class="link" href="../dist/dist_ref/dists/weibull_dist.html" title="Weibull Distribution">Weibull
Distribution</a> Quantile
</p>
</td>
@@ -1811,28 +1809,28 @@
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="4">
-<div class="footnote"><p><sup>[<a name="ftn.id1278326" href="#id1278326" class="para">1</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1413019" href="#id1413019" class="para">1</a>] </sup>
There are a small number of our test cases where the R library
fails to converge on a result: these tend to dominate the performance
result.
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1279161" href="#id1279161" class="para">2</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1413772" href="#id1413772" class="para">2</a>] </sup>
This result is somewhat misleading: for small values of the parameters
there is virtually no difference between the two libraries, but
for large values the Boost implementation is <span class="emphasis"><em>much</em></span>
slower, albeit with much improved precision.
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1279573" href="#id1279573" class="para">3</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1414179" href="#id1414179" class="para">3</a>] </sup>
The R library appears to use a linear-search strategy, that can
perform very badly in a small number of pathological cases, but
may or may not be more efficient in "typical" cases
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1279699" href="#id1279699" class="para">4</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1414305" href="#id1414305" class="para">4</a>] </sup>
There are a small number of our test cases where the R library
fails to converge on a result: these tend to dominate the performance
result.
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1279950" href="#id1279950" class="para">5</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1414708" href="#id1414708" class="para">5</a>] </sup>
There are a small number of our test cases where the R library
fails to converge on a result: these tend to dominate the performance
result.
@@ -1841,7 +1839,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.perf.comparisons.comparison_to_the_r_statistical_library_on_linux"></a><h5>
-<a name="id1280454"></a>
+<a name="id1415212"></a>
<a class="link" href="comparisons.html#math_toolkit.perf.comparisons.comparison_to_the_r_statistical_library_on_linux">Comparison
to the R Statistical Library on Linux</a>
</h5>
@@ -1851,7 +1849,7 @@
G++ 4.3.3 using -O3 -DNDEBUG=1.
</p>
<div class="table">
-<a name="math_toolkit.perf.comparisons.a_comparison_to_the_r_statistical_library_on_linux"></a><p class="title"><b>Table 52. A Comparison to the R Statistical Library on Linux</b></p>
+<a name="math_toolkit.perf.comparisons.a_comparison_to_the_r_statistical_library_on_linux"></a><p class="title"><b>Table 55. A Comparison to the R Statistical Library on Linux</b></p>
<div class="table-contents"><table class="table" summary="A Comparison to the R Statistical Library on Linux">
<colgroup>
<col>
@@ -1936,7 +1934,7 @@
<td>
<p>
</p>
-<p>30.51<sup>[<a name="id1280619" href="#ftn.id1280619" class="footnote">1</a>]</sup></p>
+<p>30.51<sup>[<a name="id1415375" href="#ftn.id1415375" class="footnote">1</a>]</sup></p>
<p> </p>
<p>(3.616e-004s)</p>
<p>
@@ -2359,14 +2357,13 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/hypergeometric_dist.html" title="Hypergeometric Distribution">Hypergeometric
- Distribution</a> CDF
+ __hypergeometric_distrib CDF
</p>
</td>
<td>
<p>
</p>
-<p>2.20<sup>[<a name="id1281376" href="#ftn.id1281376" class="footnote">2</a>]</sup></p>
+<p>2.20<sup>[<a name="id1416126" href="#ftn.id1416126" class="footnote">2</a>]</sup></p>
<p> </p>
<p>(3.522e-007s)</p>
<p>
@@ -2390,8 +2387,7 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/hypergeometric_dist.html" title="Hypergeometric Distribution">Hypergeometric
- Distribution</a> Quantile
+ __hypergeometric_distrib Quantile
</p>
</td>
<td>
@@ -2596,7 +2592,7 @@
<td>
<p>
</p>
-<p>25.92<sup>[<a name="id1281790" href="#ftn.id1281790" class="footnote">3</a>]</sup></p>
+<p>25.92<sup>[<a name="id1416535" href="#ftn.id1416535" class="footnote">3</a>]</sup></p>
<p> </p>
<p>(4.407e-004s)</p>
<p>
@@ -2666,7 +2662,7 @@
<td>
<p>
</p>
-<p>144.91<sup>[<a name="id1281916" href="#ftn.id1281916" class="footnote">4</a>]</sup></p>
+<p>144.91<sup>[<a name="id1416661" href="#ftn.id1416661" class="footnote">4</a>]</sup></p>
<p> </p>
<p>(3.214e-002s)</p>
<p>
@@ -2802,7 +2798,7 @@
<td>
<p>
</p>
-<p><span class="bold"><strong>1.00</strong></span><sup>[<a name="id1282162" href="#ftn.id1282162" class="footnote">5</a>]</sup></p>
+<p><span class="bold"><strong>1.00</strong></span><sup>[<a name="id1417454" href="#ftn.id1417454" class="footnote">5</a>]</sup></p>
<p> </p>
<p>(5.916e-004s)</p>
<p>
@@ -3027,7 +3023,7 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/weibull.html" title="Weibull Distribution">Weibull
+ <a class="link" href="../dist/dist_ref/dists/weibull_dist.html" title="Weibull Distribution">Weibull
Distribution</a> CDF
</p>
</td>
@@ -3058,7 +3054,7 @@
<tr>
<td>
<p>
- <a class="link" href="../dist/dist_ref/dists/weibull.html" title="Weibull Distribution">Weibull
+ <a class="link" href="../dist/dist_ref/dists/weibull_dist.html" title="Weibull Distribution">Weibull
Distribution</a> Quantile
</p>
</td>
@@ -3088,28 +3084,28 @@
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="4">
-<div class="footnote"><p><sup>[<a name="ftn.id1280619" href="#id1280619" class="para">1</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1415375" href="#id1415375" class="para">1</a>] </sup>
There are a small number of our test cases where the R library
fails to converge on a result: these tend to dominate the performance
result.
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1281376" href="#id1281376" class="para">2</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1416126" href="#id1416126" class="para">2</a>] </sup>
This result is somewhat misleading: for small values of the parameters
there is virtually no difference between the two libraries, but
for large values the Boost implementation is <span class="emphasis"><em>much</em></span>
slower, albeit with much improved precision.
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1281790" href="#id1281790" class="para">3</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1416535" href="#id1416535" class="para">3</a>] </sup>
The R library appears to use a linear-search strategy, that can
perform very badly in a small number of pathological cases, but
may or may not be more efficient in "typical" cases
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1281916" href="#id1281916" class="para">4</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1416661" href="#id1416661" class="para">4</a>] </sup>
There are a small number of our test cases where the R library
fails to converge on a result: these tend to dominate the performance
result.
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id1282162" href="#id1282162" class="para">5</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1417454" href="#id1417454" class="para">5</a>] </sup>
There are a small number of our test cases where the R library
fails to converge on a result: these tend to dominate the performance
result.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.getting_best"></a><a class="link" href="getting_best.html" title="Getting the Best Performance from this Library"> Getting the Best Performance
+<a name="math_toolkit.perf.getting_best"></a><a class="link" href="getting_best.html" title="Getting the Best Performance from this Library">Getting the Best Performance
from this Library</a>
</h3></div></div></div>
<p>
@@ -33,7 +33,7 @@
penalty for using the library in debug mode can be quite large.
</p>
<div class="table">
-<a name="math_toolkit.perf.getting_best.performance_comparison_of_release_and_debug_settings"></a><p class="title"><b>Table 47. Performance Comparison of Release and Debug Settings</b></p>
+<a name="math_toolkit.perf.getting_best.performance_comparison_of_release_and_debug_settings"></a><p class="title"><b>Table 50. Performance Comparison of Release and Debug Settings</b></p>
<div class="table-contents"><table class="table" summary="Performance Comparison of Release and Debug Settings">
<colgroup>
<col>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.interp"></a><a class="link" href="interp.html" title="Interpreting these Results"> Interpreting these Results</a>
+<a name="math_toolkit.perf.interp"></a><a class="link" href="interp.html" title="Interpreting these Results">Interpreting these Results</a>
</h3></div></div></div>
<p>
In all of the following tables, the best performing result in each row, is
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,56 +24,44 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.perf_over"></a><a class="link" href="perf_over.html" title="Performance Overview"> Performance Overview</a>
+<a name="math_toolkit.perf.perf_over"></a><a class="link" href="perf_over.html" title="Performance Overview">Performance Overview</a>
</h3></div></div></div>
<p>
- </p>
-<p>
- By and large the performance of this library should be acceptable for most
- needs. However, you should note that this library's primary emphasis is
- on accuracy and numerical stability, and <span class="emphasis"><em>not</em></span> speed.
- </p>
-<p>
- </p>
-<p>
- In terms of the algorithms used, this library aims to use the same "best
- of breed" algorithms as many other libraries: the principle difference
- is that this library is implemented in C++ - taking advantage of all the
- abstraction mechanisms that C++ offers - where as most traditional numeric
- libraries are implemented in C or FORTRAN. Traditionally languages such
- as C or FORTRAN are perceived as easier to optimise than more complex languages
- like C++, so in a sense this library provides a good test of current compiler
- technology, and the "abstraction penalty" - if any - of C++ compared
- to other languages.
- </p>
-<p>
- </p>
+ By and large the performance of this library should be acceptable for most
+ needs. However, you should note that this library's primary emphasis is on
+ accuracy and numerical stability, and <span class="emphasis"><em>not</em></span> speed.
+ </p>
<p>
- The two most important things you can do to ensure the best performance
- from this library are:
- </p>
+ In terms of the algorithms used, this library aims to use the same "best
+ of breed" algorithms as many other libraries: the principle difference
+ is that this library is implemented in C++ - taking advantage of all the
+ abstraction mechanisms that C++ offers - where as most traditional numeric
+ libraries are implemented in C or FORTRAN. Traditionally languages such as
+ C or FORTRAN are perceived as easier to optimise than more complex languages
+ like C++, so in a sense this library provides a good test of current compiler
+ technology, and the "abstraction penalty" - if any - of C++ compared
+ to other languages.
+ </p>
<p>
- </p>
+ The two most important things you can do to ensure the best performance from
+ this library are:
+ </p>
<div class="orderedlist"><ol type="1">
<li>
- Turn on your compilers optimisations: the difference between "release"
- and "debug" builds can easily be a <a class="link" href="getting_best.html" title="Getting the Best Performance from this Library">factor
- of 20</a>.
- </li>
+ Turn on your compilers optimisations: the difference between "release"
+ and "debug" builds can easily be a <a class="link" href="getting_best.html" title="Getting the Best Performance from this Library">factor
+ of 20</a>.
+ </li>
<li>
- Pick your compiler carefully: <a class="link" href="comp_compilers.html" title="Comparing Compilers">performance
- differences of up to 8 fold</a> have been found between some Windows
- compilers for example.
- </li>
+ Pick your compiler carefully: <a class="link" href="comp_compilers.html" title="Comparing Compilers">performance
+ differences of up to 8 fold</a> have been found between some Windows
+ compilers for example.
+ </li>
</ol></div>
<p>
- </p>
-<p>
- The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
- more information on the performance of this library, what you can do to
- fine tune it, and how this library compares to some other open source alternatives.
- </p>
-<p>
+ The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
+ more information on the performance of this library, what you can do to fine
+ tune it, and how this library compares to some other open source alternatives.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.perf_test_app"></a><a class="link" href="perf_test_app.html" title="The Performance Test Application"> The Performance Test
+<a name="math_toolkit.perf.perf_test_app"></a><a class="link" href="perf_test_app.html" title="The Performance Test Application">The Performance Test
Application</a>
</h3></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.tuning"></a><a class="link" href="tuning.html" title="Performance Tuning Macros"> Performance Tuning Macros</a>
+<a name="math_toolkit.perf.tuning"></a><a class="link" href="tuning.html" title="Performance Tuning Macros">Performance Tuning Macros</a>
</h3></div></div></div>
<p>
There are a small number of performance tuning options that are determined
@@ -238,7 +238,7 @@
highly vectorisable processors in the future.
</p>
<div class="table">
-<a name="math_toolkit.perf.tuning.a_comparison_of_polynomial_evaluation_methods"></a><p class="title"><b>Table 49. A Comparison of Polynomial Evaluation Methods</b></p>
+<a name="math_toolkit.perf.tuning.a_comparison_of_polynomial_evaluation_methods"></a><p class="title"><b>Table 52. A Comparison of Polynomial Evaluation Methods</b></p>
<div class="table-contents"><table class="table" summary="A Comparison of Polynomial Evaluation Methods">
<colgroup>
<col>
@@ -630,7 +630,7 @@
<span class="keyword">double</span></code> precision internally: this
helps to ensure that as close to full <code class="computeroutput"><span class="keyword">double</span></code>
precision as possible is achieved, but may slow down execution in some environments.
- The defaults for this policy can be changed by <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">defining
+ The defaults for this policy can be changed by <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using Macros to Change the Policy Defaults">defining
the macro <code class="computeroutput"><span class="identifier">BOOST_MATH_PROMOTE_DOUBLE_POLICY</span></code></a>
to <code class="computeroutput"><span class="keyword">false</span></code>, or <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">by
specifying a specific policy</a> when calling the special functions or
@@ -638,7 +638,7 @@
tutorial</a>.
</p>
<div class="table">
-<a name="math_toolkit.perf.tuning.performance_comparison_with_and_without_internal_promotion_to_long_double"></a><p class="title"><b>Table 50. Performance Comparison with and Without Internal Promotion to long
+<a name="math_toolkit.perf.tuning.performance_comparison_with_and_without_internal_promotion_to_long_double"></a><p class="title"><b>Table 53. Performance Comparison with and Without Internal Promotion to long
double</b></p>
<div class="table-contents"><table class="table" summary="Performance Comparison with and Without Internal Promotion to long
double">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../index.html" title="Math Toolkit">
<link rel="up" href="../index.html" title="Math Toolkit">
-<link rel="prev" href="using_udt/archetypes.html" title="Conceptual Archetypes and Testing">
+<link rel="prev" href="using_udt/archetypes.html" title="Conceptual Archetypes for Reals and Distributions">
<link rel="next" href="policy/pol_overview.html" title="Policy Overview">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -24,55 +24,53 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.policy"></a><a class="link" href="policy.html" title="Policies"> Policies</a>
+<a name="math_toolkit.policy"></a><a class="link" href="policy.html" title="Policies">Policies</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Policy Overview</span></dt>
-<dt><span class="section"> Policy Tutorial</span></dt>
+<dt><span class="section">Policy Overview</span></dt>
+<dt><span class="section">Policy Tutorial</span></dt>
<dd><dl>
-<dt><span class="section"><a href="policy/pol_tutorial/what_is_a_policy.html">
- So Just What is a Policy Anyway?</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/policy_tut_defaults.html">
- Policies Have Sensible Defaults</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/policy_usage.html"> So
- How are Policies Used Anyway?</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/changing_policy_defaults.html">
- Changing the Policy Defaults</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/ad_hoc_dist_policies.html">
- Setting Policies for Distributions on an Ad Hoc Basis</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/ad_hoc_sf_policies.html">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/namespace_policies.html">
- Setting Policies at Namespace or Translation Unit Scope</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/user_def_err_pol.html">
- Calling User Defined Error Handlers</a></span></dt>
-<dt><span class="section"><a href="policy/pol_tutorial/understand_dis_quant.html">
- Understanding Quantiles of Discrete Distributions</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/what_is_a_policy.html">So
+ Just What is a Policy Anyway?</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/policy_tut_defaults.html">Policies
+ Have Sensible Defaults</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/policy_usage.html">So How
+ are Policies Used Anyway?</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/changing_policy_defaults.html">Changing
+ the Policy Defaults</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/ad_hoc_dist_policies.html">Setting
+ Policies for Distributions on an Ad Hoc Basis</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/ad_hoc_sf_policies.html">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/namespace_policies.html">Setting
+ Policies at Namespace or Translation Unit Scope</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/user_def_err_pol.html">Calling
+ User Defined Error Handlers</a></span></dt>
+<dt><span class="section"><a href="policy/pol_tutorial/understand_dis_quant.html">Understanding
+ Quantiles of Discrete Distributions</a></span></dt>
</dl></dd>
-<dt><span class="section"> Policy Reference</span></dt>
+<dt><span class="section">Policy Reference</span></dt>
<dd><dl>
-<dt><span class="section"><a href="policy/pol_ref/error_handling_policies.html">
- Error Handling Policies</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/internal_promotion.html"> Internal
+<dt><span class="section"><a href="policy/pol_ref/error_handling_policies.html">Error
+ Handling Policies</a></span></dt>
+<dt><span class="section"><a href="policy/pol_ref/internal_promotion.html">Internal
Floating-point Promotion Policies</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/assert_undefined.html"> Mathematically
+<dt><span class="section"><a href="policy/pol_ref/assert_undefined.html">Mathematically
Undefined Function Policies</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/discrete_quant_ref.html"> Discrete
+<dt><span class="section"><a href="policy/pol_ref/discrete_quant_ref.html">Discrete
Quantile Policies</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/precision_pol.html"> Precision
+<dt><span class="section"><a href="policy/pol_ref/precision_pol.html">Precision
Policies</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/iteration_pol.html"> Iteration
+<dt><span class="section"><a href="policy/pol_ref/iteration_pol.html">Iteration
Limits Policies</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/policy_defaults.html"> Using
- macros to Change the Policy Defaults</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/namespace_pol.html"> Setting
+<dt><span class="section"><a href="policy/pol_ref/policy_defaults.html">Using
+ Macros to Change the Policy Defaults</a></span></dt>
+<dt><span class="section"><a href="policy/pol_ref/namespace_pol.html">Setting
Polices at Namespace Scope</a></span></dt>
-<dt><span class="section"><a href="policy/pol_ref/pol_ref_ref.html"> Policy Class
+<dt><span class="section"><a href="policy/pol_ref/pol_ref_ref.html">Policy Class
Reference</a></span></dt>
</dl></dd>
</dl></div>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,99 +24,81 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.policy.pol_overview"></a><a class="link" href="pol_overview.html" title="Policy Overview"> Policy Overview</a>
+<a name="math_toolkit.policy.pol_overview"></a><a class="link" href="pol_overview.html" title="Policy Overview">Policy Overview</a>
</h3></div></div></div>
<p>
- </p>
-<p>
- Policies are a powerful fine-grain mechanism that allow you to customise
- the behaviour of this library according to your needs. There is more information
- available in the <a class="link" href="pol_tutorial.html" title="Policy Tutorial">policy
- tutorial</a> and the <a class="link" href="pol_ref.html" title="Policy Reference">policy
- reference</a>.
- </p>
-<p>
- </p>
-<p>
- Generally speaking, unless you find that the <a class="link" href="pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
- policy behaviour</a> when encountering 'bad' argument values does not
- meet your needs, you should not need to worry about policies.
- </p>
-<p>
- </p>
-<p>
- Policies are a compile-time mechanism that allow you to change error-handling
- or calculation precision either program wide, or at the call site.
- </p>
-<p>
- </p>
+ Policies are a powerful fine-grain mechanism that allow you to customise
+ the behaviour of this library according to your needs. There is more information
+ available in the <a class="link" href="pol_tutorial.html" title="Policy Tutorial">policy
+ tutorial</a> and the <a class="link" href="pol_ref.html" title="Policy Reference">policy
+ reference</a>.
+ </p>
<p>
- Although the policy mechanism itself is rather complicated, in practice
- it is easy to use, and very flexible.
- </p>
+ Generally speaking, unless you find that the <a class="link" href="pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
+ policy behaviour</a> when encountering 'bad' argument values does not
+ meet your needs, you should not need to worry about policies.
+ </p>
<p>
- </p>
+ Policies are a compile-time mechanism that allow you to change error-handling
+ or calculation precision either program wide, or at the call site.
+ </p>
<p>
- Using policies you can control:
- </p>
+ Although the policy mechanism itself is rather complicated, in practice it
+ is easy to use, and very flexible.
+ </p>
<p>
- </p>
+ Using policies you can control:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- <a class="link" href="pol_ref/error_handling_policies.html" title="Error Handling Policies">How
- results from 'bad' arguments are handled</a>, including those that
- cannot be fully evaluated.
- </li>
-<li>
- How <a class="link" href="pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">accuracy
- is controlled by internal promotion</a> to use more precise types.
- </li>
-<li>
- What working <a class="link" href="pol_ref/precision_pol.html" title="Precision Policies">precision</a>
- should be used to calculate results.
- </li>
-<li>
- What to do when a <a class="link" href="pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
- undefined function</a> is used: Should this raise a run-time or
- compile-time error?
- </li>
-<li>
- Whether <a class="link" href="pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
- functions</a>, like the binomial, should return real or only integral
- values, and how they are rounded.
- </li>
-<li>
- How many iterations a special function is permitted to perform in a
- series evaluation or root finding algorithm before it gives up and
- raises an <a class="link" href="../main_overview/error_handling.html#evaluation_error">evaluation_error</a>.
- </li>
+ <a class="link" href="pol_ref/error_handling_policies.html" title="Error Handling Policies">How
+ results from 'bad' arguments are handled</a>, including those that
+ cannot be fully evaluated.
+ </li>
+<li>
+ How <a class="link" href="pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">accuracy
+ is controlled by internal promotion</a> to use more precise types.
+ </li>
+<li>
+ What working <a class="link" href="pol_ref/precision_pol.html" title="Precision Policies">precision</a>
+ should be used to calculate results.
+ </li>
+<li>
+ What to do when a <a class="link" href="pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
+ undefined function</a> is used: Should this raise a run-time or compile-time
+ error?
+ </li>
+<li>
+ Whether <a class="link" href="pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
+ functions</a>, like the binomial, should return real or only integral
+ values, and how they are rounded.
+ </li>
+<li>
+ How many iterations a special function is permitted to perform in a series
+ evaluation or root finding algorithm before it gives up and raises an
+ <a class="link" href="../main_overview/error_handling.html#evaluation_error">evaluation_error</a>.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- You can control policies:
- </p>
-<p>
- </p>
+ You can control policies:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- Using <a class="link" href="pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">macros</a>
- to change any default policy: the is the prefered method for installation
- wide policies.
- </li>
-<li>
- At your chosen <a class="link" href="pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
- scope</a> for distributions and/or functions: this is the prefered
- method for project, namespace, or translation unit scope policies.
- </li>
-<li>
- In an ad-hoc manner <a class="link" href="pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
- passing a specific policy to a special function</a>, or to a <a class="link" href="pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
- distribution</a>.
- </li>
+ Using <a class="link" href="pol_ref/policy_defaults.html" title="Using Macros to Change the Policy Defaults">macros</a>
+ to change any default policy: the is the prefered method for installation
+ wide policies.
+ </li>
+<li>
+ At your chosen <a class="link" href="pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
+ scope</a> for distributions and/or functions: this is the prefered
+ method for project, namespace, or translation unit scope policies.
+ </li>
+<li>
+ In an ad-hoc manner <a class="link" href="pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
+ passing a specific policy to a special function</a>, or to a <a class="link" href="pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
+ distribution</a>.
+ </li>
</ul></div>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,26 +24,26 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.policy.pol_ref"></a><a class="link" href="pol_ref.html" title="Policy Reference"> Policy Reference</a>
+<a name="math_toolkit.policy.pol_ref"></a><a class="link" href="pol_ref.html" title="Policy Reference">Policy Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="pol_ref/error_handling_policies.html">
- Error Handling Policies</a></span></dt>
-<dt><span class="section"><a href="pol_ref/internal_promotion.html"> Internal
+<dt><span class="section"><a href="pol_ref/error_handling_policies.html">Error
+ Handling Policies</a></span></dt>
+<dt><span class="section"><a href="pol_ref/internal_promotion.html">Internal
Floating-point Promotion Policies</a></span></dt>
-<dt><span class="section"><a href="pol_ref/assert_undefined.html"> Mathematically
+<dt><span class="section"><a href="pol_ref/assert_undefined.html">Mathematically
Undefined Function Policies</a></span></dt>
-<dt><span class="section"><a href="pol_ref/discrete_quant_ref.html"> Discrete
+<dt><span class="section"><a href="pol_ref/discrete_quant_ref.html">Discrete
Quantile Policies</a></span></dt>
-<dt><span class="section"><a href="pol_ref/precision_pol.html"> Precision
+<dt><span class="section"><a href="pol_ref/precision_pol.html">Precision
Policies</a></span></dt>
-<dt><span class="section"><a href="pol_ref/iteration_pol.html"> Iteration
+<dt><span class="section"><a href="pol_ref/iteration_pol.html">Iteration
Limits Policies</a></span></dt>
-<dt><span class="section"><a href="pol_ref/policy_defaults.html"> Using
- macros to Change the Policy Defaults</a></span></dt>
-<dt><span class="section"><a href="pol_ref/namespace_pol.html"> Setting
+<dt><span class="section"><a href="pol_ref/policy_defaults.html">Using
+ Macros to Change the Policy Defaults</a></span></dt>
+<dt><span class="section"><a href="pol_ref/namespace_pol.html">Setting
Polices at Namespace Scope</a></span></dt>
-<dt><span class="section"><a href="pol_ref/pol_ref_ref.html"> Policy Class
+<dt><span class="section"><a href="pol_ref/pol_ref_ref.html">Policy Class
Reference</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.assert_undefined"></a><a class="link" href="assert_undefined.html" title="Mathematically Undefined Function Policies"> Mathematically
+<a name="math_toolkit.policy.pol_ref.assert_undefined"></a><a class="link" href="assert_undefined.html" title="Mathematically Undefined Function Policies">Mathematically
Undefined Function Policies</a>
</h4></div></div></div>
<p>
@@ -72,6 +72,16 @@
<span class="comment">// This will compile, but raises a domain error!
</span><span class="keyword">double</span> <span class="identifier">m2</span> <span class="special">=</span> <span class="identifier">mean</span><span class="special">(</span><span class="identifier">cauchy_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">,</span> <span class="identifier">policy</span><span class="special"><</span><span class="identifier">assert_undefined</span><span class="special"><</span><span class="keyword">false</span><span class="special">></span> <span class="special">></span> <span class="special">>());</span>
</pre>
+<p>
+ <code class="computeroutput"><span class="identifier">policy</span><span class="special"><</span><span class="identifier">assert_undefined</span><span class="special"><</span><span class="keyword">false</span><span class="special">></span></code>
+ behaviour can also be obtained by defining the macro
+ </p>
+<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_ASSERT_UNDEFINED_POLICY</span> <span class="keyword">false</span>
+</pre>
+<p>
+ at the head of the file - see <a class="link" href="policy_defaults.html" title="Using Macros to Change the Policy Defaults">Using
+ Macros to Change the Policy Defaults</a>.
+ </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.discrete_quant_ref"></a><a class="link" href="discrete_quant_ref.html" title="Discrete Quantile Policies"> Discrete
+<a name="math_toolkit.policy.pol_ref.discrete_quant_ref"></a><a class="link" href="discrete_quant_ref.html" title="Discrete Quantile Policies">Discrete
Quantile Policies</a>
</h4></div></div></div>
<p>
@@ -55,7 +55,7 @@
can take have the following meanings:
</p>
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.real"></a><h6>
-<a name="id1263626"></a>
+<a name="id1396786"></a>
<a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.real">real</a>
</h6>
<p>
@@ -63,9 +63,7 @@
result. For example:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">negative_binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial_distribution</span><span class="special">;</span>
@@ -84,8 +82,6 @@
</pre>
<p>
- </p>
-<p>
</p>
<p>
Results in <code class="computeroutput"><span class="identifier">x</span> <span class="special">=</span>
@@ -93,7 +89,7 @@
<span class="special">=</span> <span class="number">68.1584</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_outwards"></a><h6>
-<a name="id1263981"></a>
+<a name="id1397137"></a>
<a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_outwards">integer_round_outwards</a>
</h6>
<p>
@@ -115,9 +111,7 @@
the requested coverage. For example:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">negative_binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial</span><span class="special">;</span>
@@ -130,8 +124,6 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Results in <code class="computeroutput"><span class="identifier">x</span> <span class="special">=</span>
@@ -151,7 +143,7 @@
in each tail</em></span>.
</p>
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_inwards"></a><h6>
-<a name="id1264937"></a>
+<a name="id1397533"></a>
<a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_inwards">integer_round_inwards</a>
</h6>
<p>
@@ -172,9 +164,7 @@
For example:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">negative_binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial_distribution</span><span class="special">;</span>
@@ -193,8 +183,6 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Results in <code class="computeroutput"><span class="identifier">x</span> <span class="special">=</span>
@@ -214,7 +202,7 @@
in each tail</em></span>.
</p>
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_down"></a><h6>
-<a name="id1265434"></a>
+<a name="id1398028"></a>
<a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_down">integer_round_down</a>
</h6>
<p>
@@ -222,7 +210,7 @@
or a lower quantile.
</p>
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_up"></a><h6>
-<a name="id1265453"></a>
+<a name="id1398047"></a>
<a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_up">integer_round_up</a>
</h6>
<p>
@@ -230,7 +218,7 @@
a lower quantile.
</p>
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_nearest"></a><h6>
-<a name="id1265472"></a>
+<a name="id1398066"></a>
<a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_nearest">integer_round_nearest</a>
</h6>
<p>
@@ -244,9 +232,7 @@
For example:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">negative_binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">negative_binomial_distribution</span><span class="special">;</span>
@@ -258,15 +244,13 @@
<span class="identifier">policy</span><span class="special"><</span><span class="identifier">discrete_quantile</span><span class="special"><</span><span class="identifier">integer_round_nearest</span><span class="special">></span> <span class="special">></span>
<span class="special">></span> <span class="identifier">dist_type</span><span class="special">;</span>
-<span class="comment">// Lower quantile rounded up:
+<span class="comment">// Lower quantile rounded (down) to nearest:
</span><span class="keyword">double</span> <span class="identifier">x</span> <span class="special">=</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">dist_type</span><span class="special">(</span><span class="number">20</span><span class="special">,</span> <span class="number">0.3</span><span class="special">),</span> <span class="number">0.05</span><span class="special">);</span> <span class="comment">// 27
-</span><span class="comment">// Upper quantile rounded down:
+</span><span class="comment">// Upper quantile rounded (down) to nearest:
</span><span class="keyword">double</span> <span class="identifier">y</span> <span class="special">=</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">dist_type</span><span class="special">(</span><span class="number">20</span><span class="special">,</span> <span class="number">0.3</span><span class="special">),</span> <span class="number">0.05</span><span class="special">));</span> <span class="comment">// 68
</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Results in <code class="computeroutput"><span class="identifier">x</span> <span class="special">=</span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.error_handling_policies"></a><a class="link" href="error_handling_policies.html" title="Error Handling Policies">
- Error Handling Policies</a>
+<a name="math_toolkit.policy.pol_ref.error_handling_policies"></a><a class="link" href="error_handling_policies.html" title="Error Handling Policies">Error
+ Handling Policies</a>
</h4></div></div></div>
<p>
There are two orthogonal aspects to error handling:
@@ -39,7 +39,7 @@
</li>
</ul></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.available_actions_when_an_error_is_raised"></a><h5>
-<a name="id1257650"></a>
+<a name="id1390715"></a>
<a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.available_actions_when_an_error_is_raised">Available
Actions When an Error is Raised</a>
</h5>
@@ -62,7 +62,7 @@
The various enumerated values have the following meanings:
</p>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.throw_on_error"></a><h6>
-<a name="id1257832"></a>
+<a name="id1390896"></a>
<a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.throw_on_error">throw_on_error</a>
</h6>
<p>
@@ -174,7 +174,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.errno_on_error"></a><h6>
-<a name="id1258018"></a>
+<a name="id1391074"></a>
<a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.errno_on_error">errno_on_error</a>
</h6>
<p>
@@ -289,7 +289,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.ignore_error"></a><h6>
-<a name="id1258220"></a>
+<a name="id1391275"></a>
<a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.ignore_error">ignore_error</a>
</h6>
<p>
@@ -382,8 +382,8 @@
</td>
<td>
<p>
- The best guess as to the result: which may be significantly in
- error.
+ The best guess (perhaps NaN) as to the result: which may be significantly
+ in error.
</p>
</td>
</tr>
@@ -402,7 +402,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.user_error"></a><h6>
-<a name="id1258414"></a>
+<a name="id1391466"></a>
<a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.user_error">user_error</a>
</h6>
<p>
@@ -451,7 +451,7 @@
here</a>.
</p>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.kinds_of_error_raised"></a><h5>
-<a name="id1259412"></a>
+<a name="id1392354"></a>
<a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.kinds_of_error_raised">Kinds
of Error Raised</a>
</h5>
@@ -691,7 +691,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.examples"></a><h5>
-<a name="id1260254"></a>
+<a name="id1393904"></a>
<a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.examples">Examples</a>
</h5>
<p>
@@ -700,9 +700,7 @@
we can achieve this at the call site using:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">;</span>
@@ -740,17 +738,13 @@
<span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Suppose we want a statistical distribution to return infinities, rather
than throw exceptions, then we can use:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal_distribution</span><span class="special">;</span>
@@ -771,8 +765,6 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.internal_promotion"></a><a class="link" href="internal_promotion.html" title="Internal Floating-point Promotion Policies"> Internal
+<a name="math_toolkit.policy.pol_ref.internal_promotion"></a><a class="link" href="internal_promotion.html" title="Internal Floating-point Promotion Policies">Internal
Floating-point Promotion Policies</a>
</h4></div></div></div>
<p>
@@ -85,7 +85,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.internal_promotion.examples"></a><h5>
-<a name="id1262551"></a>
+<a name="id1395096"></a>
<a class="link" href="internal_promotion.html#math_toolkit.policy.pol_ref.internal_promotion.examples">Examples</a>
</h5>
<p>
@@ -94,9 +94,7 @@
<span class="keyword">double</span></code>, then we could use:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -117,17 +115,13 @@
</pre>
<p>
- </p>
-<p>
</p>
<p>
Alternatively, suppose we want a distribution to perform calculations without
promoting <code class="computeroutput"><span class="keyword">float</span></code> to <code class="computeroutput"><span class="keyword">double</span></code>, then we could use:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal_distribution</span><span class="special">;</span>
@@ -147,8 +141,6 @@
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../pol_ref.html" title="Policy Reference">
<link rel="prev" href="precision_pol.html" title="Precision Policies">
-<link rel="next" href="policy_defaults.html" title="Using macros to Change the Policy Defaults">
+<link rel="next" href="policy_defaults.html" title="Using Macros to Change the Policy Defaults">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.iteration_pol"></a><a class="link" href="iteration_pol.html" title="Iteration Limits Policies"> Iteration
+<a name="math_toolkit.policy.pol_ref.iteration_pol"></a><a class="link" href="iteration_pol.html" title="Iteration Limits Policies">Iteration
Limits Policies</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../pol_ref.html" title="Policy Reference">
-<link rel="prev" href="policy_defaults.html" title="Using macros to Change the Policy Defaults">
+<link rel="prev" href="policy_defaults.html" title="Using Macros to Change the Policy Defaults">
<link rel="next" href="pol_ref_ref.html" title="Policy Class Reference">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.namespace_pol"></a><a class="link" href="namespace_pol.html" title="Setting Polices at Namespace Scope"> Setting
+<a name="math_toolkit.policy.pol_ref.namespace_pol"></a><a class="link" href="namespace_pol.html" title="Setting Polices at Namespace Scope">Setting
Polices at Namespace Scope</a>
</h4></div></div></div>
<p>
@@ -45,9 +45,7 @@
or distribution header. For example:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="comment">//using boost::math::tgamma;
@@ -74,8 +72,6 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
In this example, using BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS results in
@@ -99,9 +95,7 @@
to specify the floating-point type to use:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">cauchy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -144,8 +138,6 @@
</pre>
<p>
- </p>
-<p>
</p>
<p>
In this example the result of BOOST_MATH_DECLARE_DISTRIBUTIONS is to declare
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.pol_ref_ref"></a><a class="link" href="pol_ref_ref.html" title="Policy Class Reference"> Policy Class
+<a name="math_toolkit.policy.pol_ref.pol_ref_ref"></a><a class="link" href="pol_ref_ref.html" title="Policy Class Reference">Policy Class
Reference</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,7 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Using macros to Change the Policy Defaults</title>
+<title>Using Macros to Change the Policy Defaults</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.policy_defaults"></a><a class="link" href="policy_defaults.html" title="Using macros to Change the Policy Defaults"> Using
- macros to Change the Policy Defaults</a>
+<a name="math_toolkit.policy.pol_ref.policy_defaults"></a><a class="link" href="policy_defaults.html" title="Using Macros to Change the Policy Defaults">Using
+ Macros to Change the Policy Defaults</a>
</h4></div></div></div>
<p>
You can use the various macros below to change any (or all) of the policies.
@@ -61,7 +61,7 @@
then you can do so by defining various macros in boost/math/tools/user.hpp.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_domain_error_policy"></a><h6>
-<a name="id1266837"></a>
+<a name="id1401216"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_domain_error_policy">BOOST_MATH_DOMAIN_ERROR_POLICY</a>
</h6>
<p>
@@ -71,7 +71,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_pole_error_policy"></a><h6>
-<a name="id1266890"></a>
+<a name="id1401268"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_pole_error_policy">BOOST_MATH_POLE_ERROR_POLICY</a>
</h6>
<p>
@@ -81,7 +81,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_overflow_error_policy"></a><h6>
-<a name="id1268172"></a>
+<a name="id1401321"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_overflow_error_policy">BOOST_MATH_OVERFLOW_ERROR_POLICY</a>
</h6>
<p>
@@ -91,7 +91,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_rounding_error_policy"></a><h6>
-<a name="id1268224"></a>
+<a name="id1401374"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_rounding_error_policy">BOOST_MATH_ROUNDING_ERROR_POLICY</a>
</h6>
<p>
@@ -101,7 +101,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_evaluation_error_policy"></a><h6>
-<a name="id1268277"></a>
+<a name="id1401427"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_evaluation_error_policy">BOOST_MATH_EVALUATION_ERROR_POLICY</a>
</h6>
<p>
@@ -111,7 +111,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_underflow_error_policy"></a><h6>
-<a name="id1268330"></a>
+<a name="id1401480"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_underflow_error_policy">BOOST_MATH_UNDERFLOW_ERROR_POLICY</a>
</h6>
<p>
@@ -121,7 +121,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_denorm_error_policy"></a><h6>
-<a name="id1268383"></a>
+<a name="id1401532"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_denorm_error_policy">BOOST_MATH_DENORM_ERROR_POLICY</a>
</h6>
<p>
@@ -131,7 +131,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_indeterminate_result_error_policy"></a><h6>
-<a name="id1268436"></a>
+<a name="id1401585"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_indeterminate_result_error_policy">BOOST_MATH_INDETERMINATE_RESULT_ERROR_POLICY</a>
</h6>
<p>
@@ -142,7 +142,7 @@
<code class="computeroutput"><span class="identifier">ignore_error</span></code> or <code class="computeroutput"><span class="identifier">user_error</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_digits10_policy"></a><h6>
-<a name="id1268488"></a>
+<a name="id1401638"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_digits10_policy">BOOST_MATH_DIGITS10_POLICY</a>
</h6>
<p>
@@ -153,7 +153,7 @@
recommended that you change this from the default.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_float_policy"></a><h6>
-<a name="id1268512"></a>
+<a name="id1401662"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_float_policy">BOOST_MATH_PROMOTE_FLOAT_POLICY</a>
</h6>
<p>
@@ -165,7 +165,7 @@
off.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_double_policy"></a><h6>
-<a name="id1268565"></a>
+<a name="id1401716"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_double_policy">BOOST_MATH_PROMOTE_DOUBLE_POLICY</a>
</h6>
<p>
@@ -177,7 +177,7 @@
off.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_discrete_quantile_policy"></a><h6>
-<a name="id1268623"></a>
+<a name="id1401775"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_discrete_quantile_policy">BOOST_MATH_DISCRETE_QUANTILE_POLICY</a>
</h6>
<p>
@@ -188,7 +188,7 @@
Defaults to <code class="computeroutput"><span class="identifier">integer_round_outwards</span></code>.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_assert_undefined_policy"></a><h6>
-<a name="id1268690"></a>
+<a name="id1401842"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_assert_undefined_policy">BOOST_MATH_ASSERT_UNDEFINED_POLICY</a>
</h6>
<p>
@@ -201,7 +201,7 @@
whether or not a particular property is well defined.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_series_iteration_policy"></a><h6>
-<a name="id1268721"></a>
+<a name="id1401873"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_series_iteration_policy">BOOST_MATH_MAX_SERIES_ITERATION_POLICY</a>
</h6>
<p>
@@ -210,7 +210,7 @@
Defaults to 1000000.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_root_iteration_policy"></a><h6>
-<a name="id1268743"></a>
+<a name="id1401895"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_root_iteration_policy">BOOST_MATH_MAX_ROOT_ITERATION_POLICY</a>
</h6>
<p>
@@ -219,7 +219,7 @@
Defaults to 200.
</p>
<a name="math_toolkit.policy.pol_ref.policy_defaults.example"></a><h6>
-<a name="id1268764"></a>
+<a name="id1401918"></a>
<a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.example">Example</a>
</h6>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.precision_pol"></a><a class="link" href="precision_pol.html" title="Precision Policies"> Precision
+<a name="math_toolkit.policy.pol_ref.precision_pol"></a><a class="link" href="precision_pol.html" title="Precision Policies">Precision
Policies</a>
</h4></div></div></div>
<p>
@@ -60,9 +60,7 @@
to approximately 5 decimal digits using:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">;</span>
@@ -73,16 +71,12 @@
</span><span class="comment">// to calculate tgamma to accuracy of approximately 5 decimal digits.
</span></pre>
<p>
- </p>
-<p>
</p>
<p>
Or again using helper function <code class="computeroutput"><span class="identifier">make_policy</span></code>:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">;</span>
@@ -93,16 +87,12 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
And for a quantile of a distribution to approximately 25-bit precision:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal_distribution</span><span class="special">;</span>
@@ -117,8 +107,6 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,27 +24,27 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.policy.pol_tutorial"></a><a class="link" href="pol_tutorial.html" title="Policy Tutorial"> Policy Tutorial</a>
+<a name="math_toolkit.policy.pol_tutorial"></a><a class="link" href="pol_tutorial.html" title="Policy Tutorial">Policy Tutorial</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="pol_tutorial/what_is_a_policy.html">
- So Just What is a Policy Anyway?</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/policy_tut_defaults.html">
- Policies Have Sensible Defaults</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/policy_usage.html"> So
- How are Policies Used Anyway?</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/changing_policy_defaults.html">
- Changing the Policy Defaults</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/ad_hoc_dist_policies.html">
- Setting Policies for Distributions on an Ad Hoc Basis</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/ad_hoc_sf_policies.html">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/namespace_policies.html">
- Setting Policies at Namespace or Translation Unit Scope</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/user_def_err_pol.html">
- Calling User Defined Error Handlers</a></span></dt>
-<dt><span class="section"><a href="pol_tutorial/understand_dis_quant.html">
- Understanding Quantiles of Discrete Distributions</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/what_is_a_policy.html">So
+ Just What is a Policy Anyway?</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/policy_tut_defaults.html">Policies
+ Have Sensible Defaults</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/policy_usage.html">So How
+ are Policies Used Anyway?</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/changing_policy_defaults.html">Changing
+ the Policy Defaults</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/ad_hoc_dist_policies.html">Setting
+ Policies for Distributions on an Ad Hoc Basis</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/ad_hoc_sf_policies.html">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/namespace_policies.html">Setting
+ Policies at Namespace or Translation Unit Scope</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/user_def_err_pol.html">Calling
+ User Defined Error Handlers</a></span></dt>
+<dt><span class="section"><a href="pol_tutorial/understand_dis_quant.html">Understanding
+ Quantiles of Discrete Distributions</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.ad_hoc_dist_policies"></a><a class="link" href="ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">
- Setting Policies for Distributions on an Ad Hoc Basis</a>
+<a name="math_toolkit.policy.pol_tutorial.ad_hoc_dist_policies"></a><a class="link" href="ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">Setting
+ Policies for Distributions on an Ad Hoc Basis</a>
</h4></div></div></div>
<p>
All of the statistical distributions in this library are class templates
@@ -55,9 +55,7 @@
then here's how it can be done:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">binomial_distribution</span><span class="special">;</span>
@@ -89,8 +87,6 @@
</pre>
<p>
- </p>
-<p>
</p>
<p>
Which outputs:
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.ad_hoc_sf_policies"></a><a class="link" href="ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a>
+<a name="math_toolkit.policy.pol_tutorial.ad_hoc_sf_policies"></a><a class="link" href="ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a>
</h4></div></div></div>
<p>
All of the special functions in this library come in two overloaded forms,
@@ -59,15 +59,26 @@
throw an exception:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">;</span>
<span class="comment">// Define the policy to use:
-</span><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">;</span>
+</span><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">;</span> <span class="comment">// may be convenient, or
+</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">policy</span><span class="special">;</span>
+<span class="comment">// Types of error whose action can be altered by policies:.
+</span><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">evaluation_error</span><span class="special">;</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">domain_error</span><span class="special">;</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">overflow_error</span><span class="special">;</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">domain_error</span><span class="special">;</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">pole_error</span><span class="special">;</span>
+<span class="comment">// Actions on error (in enum error_policy_type):
+</span><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">errno_on_error</span><span class="special">;</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">ignore_error</span><span class="special">;</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">throw_on_error</span><span class="special">;</span>
+<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">policies</span><span class="special">::</span><span class="identifier">user_error</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">policy</span><span class="special"><</span>
<span class="identifier">domain_error</span><span class="special"><</span><span class="identifier">errno_on_error</span><span class="special">>,</span>
@@ -94,8 +105,6 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
which outputs:
@@ -111,9 +120,7 @@
so is probably only preferred when a policy is going to be used once only:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">;</span>
@@ -158,8 +165,6 @@
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.changing_policy_defaults"></a><a class="link" href="changing_policy_defaults.html" title="Changing the Policy Defaults">
- Changing the Policy Defaults</a>
+<a name="math_toolkit.policy.pol_tutorial.changing_policy_defaults"></a><a class="link" href="changing_policy_defaults.html" title="Changing the Policy Defaults">Changing
+ the Policy Defaults</a>
</h4></div></div></div>
<p>
The default policies used by the library are changed by the usual configuration
@@ -129,68 +129,42 @@
unit only: <span class="emphasis"><em>don't say that you weren't warned!</em></span>
</p>
<p>
- </p>
-<p>
- The following example demonstrates the effect of setting the macro BOOST_MATH_DOMAIN_ERROR_POLICY
- when an invalid argument is encountered. For the purposes of this example,
- we'll pass a negative degrees of freedom parameter to the student's t
- distribution.
- </p>
-<p>
- </p>
-<p>
- Since we know that this is a single file program we could just add:
- </p>
+ The following example demonstrates the effect of setting the macro BOOST_MATH_DOMAIN_ERROR_POLICY
+ when an invalid argument is encountered. For the purposes of this example,
+ we'll pass a negative degrees of freedom parameter to the student's t distribution.
+ </p>
<p>
-
-</p>
+ Since we know that this is a single file program we could just add:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">ignore_error</span>
</pre>
<p>
- </p>
-<p>
- to the top of the source file to change the default policy to one that
- simply returns a NaN when a domain error occurs. Alternatively we could
- use:
- </p>
-<p>
-
-</p>
+ to the top of the source file to change the default policy to one that
+ simply returns a NaN when a domain error occurs. Alternatively we could
+ use:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">errno_on_error</span>
</pre>
<p>
- </p>
-<p>
- To ensure the <code class="computeroutput"><span class="special">::</span><span class="identifier">errno</span></code>
- is set when a domain error occurs as well as returning a NaN.
- </p>
-<p>
- </p>
-<p>
- This is safe provided the program consists of a single translation unit
- <span class="emphasis"><em>and</em></span> we place the define <span class="emphasis"><em>before</em></span>
- any #includes. Note that should we add the define after the includes
- then it will have no effect! A warning such as:
- </p>
+ To ensure the <code class="computeroutput"><span class="special">::</span><span class="identifier">errno</span></code>
+ is set when a domain error occurs as well as returning a NaN.
+ </p>
<p>
-
-</p>
+ This is safe provided the program consists of a single translation unit
+ <span class="emphasis"><em>and</em></span> we place the define <span class="emphasis"><em>before</em></span>
+ any #includes. Note that should we add the define after the includes then
+ it will have no effect! A warning such as:
+ </p>
<pre class="programlisting">warning C4005: 'BOOST_MATH_OVERFLOW_ERROR_POLICY' : macro redefinition</pre>
<p>
- </p>
-<p>
- is a certain sign that it will <span class="emphasis"><em>not</em></span> have the desired
- effect.
- </p>
-<p>
- </p>
-<p>
- We'll begin our sample program with the needed includes:
- </p>
+ is a certain sign that it will <span class="emphasis"><em>not</em></span> have the desired
+ effect.
+ </p>
<p>
- </p>
+ We'll begin our sample program with the needed includes:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Boost
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">students_t</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -202,20 +176,19 @@
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">stdexcept</span><span class="special">></span>
- <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span><span class="special">;</span></pre>
-<p>
- </p>
-<p>
- </p>
+ <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span><span class="special">;</span>
+
+<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">cstddef</span><span class="special">></span>
+ <span class="comment">// using ::errno</span></pre>
<p>
- Next we'll define the program's main() to call the student's t distribution
- with an invalid degrees of freedom parameter, the program is set up to
- handle either an exception or a NaN:
- </p>
+ </p>
<p>
- </p>
+ Next we'll define the program's main() to call the student's t distribution
+ with an invalid degrees of freedom parameter, the program is set up to
+ handle either an exception or a NaN:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -251,16 +224,11 @@
<span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
<span class="special">}</span> <span class="comment">// int main()</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Here's what the program output looks like with a default build (one that
- <span class="bold"><strong>does throw exceptions</strong></span>):
- </p>
+ </p>
<p>
-
-</p>
+ Here's what the program output looks like with a default build (one that
+ <span class="bold"><strong>does throw exceptions</strong></span>):
+ </p>
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: throw_on_error
@@ -269,52 +237,30 @@
Degrees of freedom argument is -1, but must be > 0 !
</pre>
<p>
- </p>
-<p>
- Alternatively let's build with:
- </p>
-<p>
-
-</p>
+ Alternatively let's build with:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">ignore_error</span>
</pre>
<p>
- </p>
-<p>
- Now the program output is:
- </p>
-<p>
-
-</p>
+ Now the program output is:
+ </p>
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: ignore_error
cdf returned a NaN!
</pre>
<p>
- </p>
-<p>
- And finally let's build with:
- </p>
-<p>
-
-</p>
+ And finally let's build with:
+ </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_DOMAIN_ERROR_POLICY</span> <span class="identifier">errno_on_error</span>
</pre>
<p>
- </p>
-<p>
- Which gives the output show errno:
- </p>
-<p>
-
-</p>
+ Which gives the output show errno:
+ </p>
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: errno_on_error
cdf returned a NaN!
errno is set to: 33
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.namespace_policies"></a><a class="link" href="namespace_policies.html" title="Setting Policies at Namespace or Translation Unit Scope">
- Setting Policies at Namespace or Translation Unit Scope</a>
+<a name="math_toolkit.policy.pol_tutorial.namespace_policies"></a><a class="link" href="namespace_policies.html" title="Setting Policies at Namespace or Translation Unit Scope">Setting
+ Policies at Namespace or Translation Unit Scope</a>
</h4></div></div></div>
<p>
Sometimes what you want to do is just change a set of policies within the
@@ -43,42 +43,30 @@
current file only.
</p>
<p>
- </p>
-<p>
- Suppose we want <code class="computeroutput"><span class="identifier">C</span><span class="special">::</span><span class="identifier">foo</span><span class="special">()</span></code>
- to behave in a C-compatible way and set <code class="computeroutput"><span class="special">::</span><span class="identifier">errno</span></code> on error rather than throwing
- any exceptions.
- </p>
-<p>
- </p>
-<p>
- We'll begin by including the needed header for our function:
- </p>
+ Suppose we want <code class="computeroutput"><span class="identifier">C</span><span class="special">::</span><span class="identifier">foo</span><span class="special">()</span></code>
+ to behave in a C-compatible way and set <code class="computeroutput"><span class="special">::</span><span class="identifier">errno</span></code> on error rather than throwing any
+ exceptions.
+ </p>
<p>
- </p>
+ We'll begin by including the needed header for our function:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="comment">//using boost::math::tgamma; // Not needed because using C::tgamma.</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Open up the "C" namespace that we'll use for our functions,
- and define the policy type we want: in this case a C-style one that sets
- ::errno and returns a standard value, rather than throwing exceptions.
- </p>
-<p>
- </p>
+ </p>
<p>
- Any policies we don't specify here will inherit the defaults.
- </p>
+ Open up the "C" namespace that we'll use for our functions, and
+ define the policy type we want: in this case a C-style one that sets ::errno
+ and returns a standard value, rather than throwing exceptions.
+ </p>
<p>
- </p>
+ Any policies we don't specify here will inherit the defaults.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">C</span>
<span class="special">{</span> <span class="comment">// To hold our C-style policy.
@@ -98,33 +86,25 @@
<span class="identifier">evaluation_error</span><span class="special"><</span><span class="identifier">errno_on_error</span><span class="special">></span>
<span class="special">></span> <span class="identifier">c_policy</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- All we need do now is invoke the BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS
- macro passing our policy type c_policy as the single argument:
- </p>
+ </p>
<p>
- </p>
+ All we need do now is invoke the BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS macro
+ passing our policy type c_policy as the single argument:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS</span><span class="special">(</span><span class="identifier">c_policy</span><span class="special">)</span>
<span class="special">}</span> <span class="comment">// close namespace C</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We now have a set of forwarding functions defined in namespace C that
- all look something like this:
- </p>
+ </p>
<p>
- </p>
+ We now have a set of forwarding functions defined in namespace C that all
+ look something like this:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tools</span><span class="special">::</span><span class="identifier">promote_args</span><span class="special"><</span><span class="identifier">RT</span><span class="special">>::</span><span class="identifier">type</span>
@@ -134,16 +114,14 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
- </p>
-<p>
- So that when we call <code class="computeroutput"><span class="identifier">C</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code>, we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">C</span><span class="special">::</span><span class="identifier">c_policy</span><span class="special">())</span></code>:
- </p>
+ </p>
<p>
- </p>
+ So that when we call <code class="computeroutput"><span class="identifier">C</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code>,
+ we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span>
+ <span class="identifier">C</span><span class="special">::</span><span class="identifier">c_policy</span><span class="special">())</span></code>:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -156,28 +134,19 @@
<span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"errno = "</span> <span class="special"><<</span> <span class="identifier">errno</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// errno = 33, overwriting previous value of 34.
</span><span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Which outputs:
- </p>
+ </p>
<p>
-
-</p>
+ Which outputs:
+ </p>
<pre class="programlisting">Result of C::tgamma(30000) is: 1.#INF
errno = 34
Result of C::tgamma(-10) is: 1.#QNAN
errno = 33
</pre>
<p>
- </p>
-<p>
- This mechanism is particularly useful when we want to define a project-wide
- policy, and don't want to modify the Boost source, or to set project
- wide build macros (possibly fragile and easy to forget).
- </p>
-<p>
+ This mechanism is particularly useful when we want to define a project-wide
+ policy, and don't want to modify the Boost source, or to set project wide
+ build macros (possibly fragile and easy to forget).
</p>
<p>
The same mechanism works well at file scope as well, by using an unnamed
@@ -185,9 +154,7 @@
alternate policies present in other translation units:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="comment">// using boost::math::tgamma; // Would create an ambiguity between
@@ -208,16 +175,14 @@
<span class="identifier">BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS</span><span class="special">(</span><span class="identifier">c_policy</span><span class="special">)</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- So that when we call <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code>, we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">anonymous</span><span class="special">-</span><span class="keyword">namespace</span><span class="special">::</span><span class="identifier">c_policy</span><span class="special">())</span></code>.
- </p>
+ </p>
<p>
- </p>
+ So that when we call <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code>,
+ we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span>
+ <span class="identifier">anonymous</span><span class="special">-</span><span class="keyword">namespace</span><span class="special">::</span><span class="identifier">c_policy</span><span class="special">())</span></code>.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="special">}</span> <span class="comment">// close unnamed namespace
</span>
@@ -236,8 +201,6 @@
</pre>
<p>
- </p>
-<p>
</p>
<p>
Handling policies for the statistical distributions is very similar except
@@ -256,48 +219,35 @@
template, but without the "_distribution" suffix.
</p>
<p>
- </p>
-<p>
- Suppose we want a set of distributions to behave as follows:
- </p>
-<p>
- </p>
+ Suppose we want a set of distributions to behave as follows:
+ </p>
<div class="itemizedlist"><ul type="disc">
<li>
- Return infinity on overflow, rather than throwing an exception.
- </li>
+ Return infinity on overflow, rather than throwing an exception.
+ </li>
<li>
- Don't perform any promotion from double to long double internally.
- </li>
+ Don't perform any promotion from double to long double internally.
+ </li>
<li>
- Return the closest integer result from the quantiles of discrete
- distributions.
- </li>
+ Return the closest integer result from the quantiles of discrete distributions.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- We'll begin by including the needed header for all the distributions:
- </p>
-<p>
- </p>
+ We'll begin by including the needed header for all the distributions:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Open up an appropriate namespace, calling it <code class="computeroutput"><span class="identifier">my_distributions</span></code>,
- for our distributions, and define the policy type we want. Any policies
- we don't specify here will inherit the defaults:
- </p>
+ </p>
<p>
- </p>
+ Open up an appropriate namespace, calling it <code class="computeroutput"><span class="identifier">my_distributions</span></code>,
+ for our distributions, and define the policy type we want. Any policies
+ we don't specify here will inherit the defaults:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">my_distributions</span>
<span class="special">{</span>
@@ -313,35 +263,27 @@
</span> <span class="identifier">discrete_quantile</span><span class="special"><</span><span class="identifier">integer_round_nearest</span><span class="special">></span>
<span class="special">></span> <span class="identifier">my_policy</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- All we need do now is invoke the BOOST_MATH_DECLARE_DISTRIBUTIONS macro
- passing the floating point type <code class="computeroutput"><span class="keyword">double</span></code>
- and policy types <code class="computeroutput"><span class="identifier">my_policy</span></code>
- as arguments:
- </p>
+ </p>
<p>
- </p>
+ All we need do now is invoke the BOOST_MATH_DECLARE_DISTRIBUTIONS macro
+ passing the floating point type <code class="computeroutput"><span class="keyword">double</span></code>
+ and policy types <code class="computeroutput"><span class="identifier">my_policy</span></code>
+ as arguments:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">BOOST_MATH_DECLARE_DISTRIBUTIONS</span><span class="special">(</span><span class="keyword">double</span><span class="special">,</span> <span class="identifier">my_policy</span><span class="special">)</span>
<span class="special">}</span> <span class="comment">// close namespace my_namespace</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We now have a set of typedefs defined in namespace my_distributions that
- all look something like this:
- </p>
+ </p>
<p>
- </p>
+ We now have a set of typedefs defined in namespace my_distributions that
+ all look something like this:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">,</span> <span class="identifier">my_policy</span><span class="special">></span> <span class="identifier">normal</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">cauchy_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">,</span> <span class="identifier">my_policy</span><span class="special">></span> <span class="identifier">cauchy</span><span class="special">;</span>
@@ -349,17 +291,12 @@
<span class="comment">// etc
</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- So that when we use my_distributions::normal we really end up using
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">,</span> <span class="identifier">my_policy</span><span class="special">></span></code>:
- </p>
+ </p>
<p>
- </p>
+ So that when we use my_distributions::normal we really end up using <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">normal_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">,</span> <span class="identifier">my_policy</span><span class="special">></span></code>:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -384,15 +321,10 @@
<span class="special"><<</span> <span class="identifier">quantile</span><span class="special">(</span><span class="identifier">complement</span><span class="special">(</span><span class="identifier">binom</span><span class="special">,</span> <span class="number">0.05</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Which outputs:
- </p>
+ </p>
<p>
-
-</p>
+ Which outputs:
+ </p>
<pre class="programlisting">Result of quantile(norm, 0) is: -1.#INF
errno = 34
Result of quantile(norm, 1) is: 1.#INF
@@ -401,13 +333,9 @@
Result of quantile(complement(binom, 0.05)) is: 8
</pre>
<p>
- </p>
-<p>
- This mechanism is particularly useful when we want to define a project-wide
- policy, and don't want to modify the Boost source or set project wide
- build macros (possibly fragile and easy to forget).
- </p>
-<p>
+ This mechanism is particularly useful when we want to define a project-wide
+ policy, and don't want to modify the Boost source or set project wide build
+ macros (possibly fragile and easy to forget).
</p>
<div class="note"><table border="0" summary="Note">
<tr>
@@ -427,9 +355,7 @@
with any alternate policies present in other translation units:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// All distributions.
</span><span class="comment">// using boost::math::normal; // Would create an ambguity between
@@ -477,8 +403,6 @@
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.policy_tut_defaults"></a><a class="link" href="policy_tut_defaults.html" title="Policies Have Sensible Defaults">
- Policies Have Sensible Defaults</a>
+<a name="math_toolkit.policy.pol_tutorial.policy_tut_defaults"></a><a class="link" href="policy_tut_defaults.html" title="Policies Have Sensible Defaults">Policies
+ Have Sensible Defaults</a>
</h4></div></div></div>
<p>
Most of the time you can just ignore the policy framework.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.policy_usage"></a><a class="link" href="policy_usage.html" title="So How are Policies Used Anyway?"> So
- How are Policies Used Anyway?</a>
+<a name="math_toolkit.policy.pol_tutorial.policy_usage"></a><a class="link" href="policy_usage.html" title="So How are Policies Used Anyway?">So How
+ are Policies Used Anyway?</a>
</h4></div></div></div>
<p>
The details follow later, but basically policies can be set by either:
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.understand_dis_quant"></a><a class="link" href="understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">
- Understanding Quantiles of Discrete Distributions</a>
+<a name="math_toolkit.policy.pol_tutorial.understand_dis_quant"></a><a class="link" href="understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a>
</h4></div></div></div>
<p>
Discrete distributions present us with a problem when calculating the quantile:
@@ -177,7 +177,7 @@
<span class="emphasis"><em>base your comparisons on CDF's instead</em></span>.
</p>
<a name="math_toolkit.policy.pol_tutorial.understand_dis_quant.other_rounding_policies_are_available"></a><h6>
-<a name="id1254402"></a>
+<a name="id1386778"></a>
<a class="link" href="understand_dis_quant.html#math_toolkit.policy.pol_tutorial.understand_dis_quant.other_rounding_policies_are_available">Other
Rounding Policies are Available</a>
</h6>
@@ -239,23 +239,16 @@
</dl>
</div>
<p>
- </p>
-<p>
- To understand how the rounding policies for the discrete distributions
- can be used, we'll use the 50-sample binomial distribution with a success
- fraction of 0.5 once again, and calculate all the possible quantiles
- at 0.05 and 0.95.
- </p>
-<p>
- </p>
-<p>
- Begin by including the needed headers (and some using statements for
- conciseness):
- </p>
+ To understand how the rounding policies for the discrete distributions
+ can be used, we'll use the 50-sample binomial distribution with a success
+ fraction of 0.5 once again, and calculate all the possible quantiles at
+ 0.05 and 0.95.
+ </p>
<p>
- </p>
+ Begin by including the needed headers (and some using statements for conciseness):
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">;</span> <span class="keyword">using</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
@@ -266,17 +259,13 @@
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">binomial</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Next we'll bring the needed declarations into scope, and define distribution
- types for all the available rounding policies:
- </p>
+ </p>
<p>
- </p>
+ Next we'll bring the needed declarations into scope, and define distribution
+ types for all the available rounding policies:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Avoid
</span><span class="comment">// using namespace std; // and
@@ -328,16 +317,12 @@
<span class="identifier">policy</span><span class="special"><</span><span class="identifier">discrete_quantile</span><span class="special"><</span><span class="identifier">real</span><span class="special">></span> <span class="special">></span> <span class="special">></span>
<span class="identifier">binom_real_quantile</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Now let's set to work calling those quantiles:
- </p>
+ </p>
<p>
- </p>
+ Now let's set to work calling those quantiles:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -407,15 +392,10 @@
<span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span> <span class="comment">// int main()</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Which produces the program output:
- </p>
+ </p>
<p>
-
-</p>
+ Which produces the program output:
+ </p>
<pre class="programlisting">policy_eg_10.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\policy_eg_10.exe
Testing rounding policies for a 50 sample binomial distribution,
with a success fraction of 0.5.
@@ -432,8 +412,6 @@
integer_round_nearest 19 30
real 18.701 30.299
</pre>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,22 +24,17 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.user_def_err_pol"></a><a class="link" href="user_def_err_pol.html" title="Calling User Defined Error Handlers">
- Calling User Defined Error Handlers</a>
+<a name="math_toolkit.policy.pol_tutorial.user_def_err_pol"></a><a class="link" href="user_def_err_pol.html" title="Calling User Defined Error Handlers">Calling
+ User Defined Error Handlers</a>
</h4></div></div></div>
<p>
- </p>
-<p>
- Suppose we want our own user-defined error handlers rather than the any
- of the default ones supplied by the library to be used. If we set the
- policy for a specific type of error to <code class="computeroutput"><span class="identifier">user_error</span></code>
- then the library will call a user-supplied error handler. These are forward
- declared, but not defined in boost/math/policies/error_handling.hpp like
- this:
- </p>
-<p>
-
-</p>
+ Suppose we want our own user-defined error handlers rather than the any
+ of the default ones supplied by the library to be used. If we set the policy
+ for a specific type of error to <code class="computeroutput"><span class="identifier">user_error</span></code>
+ then the library will call a user-supplied error handler. These are forward
+ declared, but not defined in boost/math/policies/error_handling.hpp like
+ this:
+ </p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">policies</span><span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -54,23 +49,21 @@
<span class="identifier">T</span> <span class="identifier">user_denorm_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_evaluation_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">);</span>
+<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">TargetType</span><span class="special">></span>
+<span class="identifier">T</span> <span class="identifier">user_rounding_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">TargetType</span><span class="special">&</span> <span class="identifier">t</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_indeterminate_result_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">);</span>
<span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<p>
- </p>
-<p>
- So out first job is to include the header we want to use, and then provide
- definitions for our user-defined error handlers that we want to use.
- We only provide our special domain and pole error handlers; other errors
- like overflow and underflow use the default.
- </p>
-<p>
- </p>
+ So out first job is to include the header we want to use, and then provide
+ definitions for our user-defined error handlers that we want to use. We
+ only provide our special domain and pole error handlers; other errors like
+ overflow and underflow use the default.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -94,17 +87,13 @@
<span class="special">}</span> <span class="comment">// namespace policies
</span><span class="special">}}</span> <span class="comment">// namespace boost{ namespace math</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Now we'll need to define a suitable policy that will call these handlers,
- and define some forwarding functions that make use of the policy:
- </p>
+ </p>
<p>
- </p>
+ Now we'll need to define a suitable policy that will call these handlers,
+ and define some forwarding functions that make use of the policy:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span><span class="special">{</span>
@@ -119,17 +108,13 @@
<span class="special">}</span> <span class="comment">// close unnamed namespace</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We now have a set of forwarding functions defined in an unnamed namespace
- that all look something like this:
- </p>
+ </p>
<p>
- </p>
+ We now have a set of forwarding functions defined in an unnamed namespace
+ that all look something like this:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tools</span><span class="special">::</span><span class="identifier">promote_args</span><span class="special"><</span><span class="identifier">RT</span><span class="special">>::</span><span class="identifier">type</span>
@@ -139,17 +124,15 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
- </p>
-<p>
- So that when we call <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code> we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">user_error_policy</span><span class="special">())</span></code>,
- and any errors will get directed to our own error handlers.
- </p>
+ </p>
<p>
- </p>
+ So that when we call <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code>
+ we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span>
+ <span class="identifier">user_error_policy</span><span class="special">())</span></code>,
+ and any errors will get directed to our own error handlers.
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -159,38 +142,24 @@
<span class="special"><<</span> <span class="identifier">tgamma</span><span class="special">(-</span><span class="number">10</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Which outputs:
- </p>
+ </p>
<p>
-
-</p>
+ Which outputs:
+ </p>
<pre class="programlisting">Domain Error!
Pole Error!
Result of erf_inv(-10) is: 1.#QNAN
Result of tgamma(-10) is: 1.#QNAN
</pre>
<p>
+ The previous example was all well and good, but the custom error handlers
+ didn't really do much of any use. In this example we'll implement all the
+ custom handlers and show how the information provided to them can be used
+ to generate nice formatted error messages.
</p>
<p>
- </p>
-<p>
- The previous example was all well and good, but the custom error handlers
- didn't really do much of any use. In this example we'll implement all
- the custom handlers and show how the information provided to them can
- be used to generate nice formatted error messages.
- </p>
-<p>
- </p>
-<p>
- Each error handler has the general form:
- </p>
-<p>
-
-</p>
+ Each error handler has the general form:
+ </p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_</span><span class="emphasis"><em>error_type</em></span><span class="special">(</span>
<span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span>
@@ -198,61 +167,49 @@
<span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">);</span>
</pre>
<p>
- </p>
-<p>
- and accepts three arguments:
- </p>
-<p>
- </p>
+ and accepts three arguments:
+ </p>
<div class="variablelist">
<p class="title"><b></b></p>
<dl>
<dt><span class="term">const char* function</span></dt>
<dd><p>
- The name of the function that raised the error, this string contains
- one or more %1% format specifiers that should be replaced by the
- name of real type T, like float or double.
- </p></dd>
+ The name of the function that raised the error, this string contains
+ one or more %1% format specifiers that should be replaced by the
+ name of real type T, like float or double.
+ </p></dd>
<dt><span class="term">const char* message</span></dt>
<dd><p>
- A message associated with the error, normally this contains a %1%
- format specifier that should be replaced with the value of <span class="emphasis"><em>value</em></span>:
- however note that overflow and underflow messages do not contain
- this %1% specifier (since the value of <span class="emphasis"><em>value</em></span>
- is immaterial in these cases).
- </p></dd>
+ A message associated with the error, normally this contains a %1%
+ format specifier that should be replaced with the value of <span class="emphasis"><em>value</em></span>:
+ however note that overflow and underflow messages do not contain
+ this %1% specifier (since the value of <span class="emphasis"><em>value</em></span>
+ is immaterial in these cases).
+ </p></dd>
<dt><span class="term">const T& value</span></dt>
<dd><p>
- The value that caused the error: either an argument to the function
- if this is a domain or pole error, the tentative result if this
- is a denorm or evaluation error, or zero or infinity for underflow
- or overflow errors.
- </p></dd>
+ The value that caused the error: either an argument to the function
+ if this is a domain or pole error, the tentative result if this is
+ a denorm or evaluation error, or zero or infinity for underflow or
+ overflow errors.
+ </p></dd>
</dl>
</div>
<p>
- </p>
-<p>
- As before we'll include the headers we need first:
- </p>
-<p>
- </p>
+ As before we'll include the headers we need first:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Next we'll implement our own error handlers for each type of error, starting
- with domain errors:
- </p>
+ </p>
<p>
- </p>
+ Next we'll implement our own error handlers for each type of error, starting
+ with domain errors:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
<span class="keyword">namespace</span> <span class="identifier">policies</span>
@@ -262,96 +219,71 @@
<span class="identifier">T</span> <span class="identifier">user_domain_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">)</span>
<span class="special">{</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We'll begin with a bit of defensive programming in case function or message
- are empty:
- </p>
+ </p>
<p>
- </p>
+ We'll begin with a bit of defensive programming in case function or message
+ are empty:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">if</span><span class="special">(</span><span class="identifier">function</span> <span class="special">==</span> <span class="number">0</span><span class="special">)</span>
<span class="identifier">function</span> <span class="special">=</span> <span class="string">"Unknown function with arguments of type %1%"</span><span class="special">;</span>
<span class="keyword">if</span><span class="special">(</span><span class="identifier">message</span> <span class="special">==</span> <span class="number">0</span><span class="special">)</span>
<span class="identifier">message</span> <span class="special">=</span> <span class="string">"Cause unknown with bad argument %1%"</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Next we'll format the name of the function with the name of type T, perhaps
- double:
- </p>
+ </p>
<p>
- </p>
+ Next we'll format the name of the function with the name of type T, perhaps
+ double:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">msg</span><span class="special">(</span><span class="string">"Error in function "</span><span class="special">);</span>
<span class="identifier">msg</span> <span class="special">+=</span> <span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">format</span><span class="special">(</span><span class="identifier">function</span><span class="special">)</span> <span class="special">%</span> <span class="keyword">typeid</span><span class="special">(</span><span class="identifier">T</span><span class="special">).</span><span class="identifier">name</span><span class="special">()).</span><span class="identifier">str</span><span class="special">();</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Then likewise format the error message with the value of parameter <span class="emphasis"><em>val</em></span>,
- making sure we output all the potentially significant digits of <span class="emphasis"><em>val</em></span>:
- </p>
+ </p>
<p>
- </p>
+ Then likewise format the error message with the value of parameter <span class="emphasis"><em>val</em></span>,
+ making sure we output all the potentially significant digits of <span class="emphasis"><em>val</em></span>:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">msg</span> <span class="special">+=</span> <span class="string">": \n"</span><span class="special">;</span>
<span class="keyword">int</span> <span class="identifier">prec</span> <span class="special">=</span> <span class="number">2</span> <span class="special">+</span> <span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">digits</span> <span class="special">*</span> <span class="number">30103UL</span><span class="special">)</span> <span class="special">/</span> <span class="number">100000UL</span><span class="special">;</span>
<span class="comment">// int prec = std::numeric_limits<T>::max_digits10; // For C++0X Standard Library
</span><span class="identifier">msg</span> <span class="special">+=</span> <span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">format</span><span class="special">(</span><span class="identifier">message</span><span class="special">)</span> <span class="special">%</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">io</span><span class="special">::</span><span class="identifier">group</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">setprecision</span><span class="special">(</span><span class="identifier">prec</span><span class="special">),</span> <span class="identifier">val</span><span class="special">)).</span><span class="identifier">str</span><span class="special">();</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Now we just have to do something with the message, we could throw an
- exception, but for the purposes of this example we'll just dump the message
- to std::cerr:
- </p>
+ </p>
<p>
- </p>
+ Now we just have to do something with the message, we could throw an exception,
+ but for the purposes of this example we'll just dump the message to std::cerr:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cerr</span> <span class="special"><<</span> <span class="identifier">msg</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Finally the only sensible value we can return from a domain error is
- a NaN:
- </p>
+ </p>
<p>
- </p>
+ Finally the only sensible value we can return from a domain error is a
+ NaN:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"> <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">quiet_NaN</span><span class="special">();</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Pole errors are essentially a special case of domain errors, so in this
- example we'll just return the result of a domain error:
- </p>
+ </p>
<p>
- </p>
+ Pole errors are essentially a special case of domain errors, so in this
+ example we'll just return the result of a domain error:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_pole_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">)</span>
@@ -359,17 +291,13 @@
<span class="keyword">return</span> <span class="identifier">user_domain_error</span><span class="special">(</span><span class="identifier">function</span><span class="special">,</span> <span class="identifier">message</span><span class="special">,</span> <span class="identifier">val</span><span class="special">);</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Overflow errors are very similar to domain errors, except that there's
- no %1% format specifier in the <span class="emphasis"><em>message</em></span> parameter:
- </p>
+ </p>
<p>
- </p>
+ Overflow errors are very similar to domain errors, except that there's
+ no %1% format specifier in the <span class="emphasis"><em>message</em></span> parameter:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_overflow_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">)</span>
@@ -391,16 +319,12 @@
</span> <span class="keyword">return</span> <span class="identifier">val</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Underflow errors are much the same as overflow:
- </p>
+ </p>
<p>
- </p>
+ Underflow errors are much the same as overflow:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_underflow_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">)</span>
@@ -422,16 +346,12 @@
</span> <span class="keyword">return</span> <span class="identifier">val</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Denormalised results are much the same as underflow:
- </p>
+ </p>
<p>
- </p>
+ Denormalised results are much the same as underflow:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_denorm_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">)</span>
@@ -453,19 +373,15 @@
</span> <span class="keyword">return</span> <span class="identifier">val</span><span class="special">;</span>
<span class="special">}</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Which leaves us with evaluation errors: these occur when an internal
- error occurs that prevents the function being fully evaluated. The parameter
- <span class="emphasis"><em>val</em></span> contains the closest approximation to the result
- found so far:
- </p>
+ </p>
<p>
- </p>
+ Which leaves us with evaluation errors: these occur when an internal error
+ occurs that prevents the function being fully evaluated. The parameter
+ <span class="emphasis"><em>val</em></span> contains the closest approximation to the result
+ found so far:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">user_evaluation_error</span><span class="special">(</span><span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">function</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">message</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">)</span>
@@ -494,17 +410,13 @@
<span class="special">}</span> <span class="comment">// policies
</span><span class="special">}}</span> <span class="comment">// boost::math</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Now we'll need to define a suitable policy that will call these handlers,
- and define some forwarding functions that make use of the policy:
- </p>
+ </p>
<p>
- </p>
+ Now we'll need to define a suitable policy that will call these handlers,
+ and define some forwarding functions that make use of the policy:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span>
<span class="special">{</span> <span class="comment">// unnamed.
@@ -524,17 +436,13 @@
<span class="special">}</span> <span class="comment">// unnamed namespace</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- We now have a set of forwarding functions, defined in an unnamed namespace,
- that all look something like this:
- </p>
+ </p>
<p>
- </p>
+ We now have a set of forwarding functions, defined in an unnamed namespace,
+ that all look something like this:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tools</span><span class="special">::</span><span class="identifier">promote_args</span><span class="special"><</span><span class="identifier">RT</span><span class="special">>::</span><span class="identifier">type</span>
@@ -544,17 +452,15 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
- </p>
-<p>
- So that when we call <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code> we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span> <span class="identifier">user_error_policy</span><span class="special">())</span></code>,
- and any errors will get directed to our own error handlers:
- </p>
+ </p>
<p>
- </p>
+ So that when we call <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span></code>
+ we really end up calling <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span>
+ <span class="identifier">user_error_policy</span><span class="special">())</span></code>,
+ and any errors will get directed to our own error handlers:
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
<span class="special">{</span>
@@ -575,15 +481,10 @@
</span> <span class="comment">// since these should never really occur!
</span><span class="special">}</span> <span class="comment">// int main()</span></pre>
<p>
- </p>
-<p>
- </p>
-<p>
- Which outputs:
- </p>
+ </p>
<p>
-
-</p>
+ Which outputs:
+ </p>
<pre class="programlisting">Error in function boost::math::erf_inv<double>(double, double):
Argument outside range [-1, 1] in inverse erf function (got p=-10).
Result of erf_inv(-10) is: 1.#QNAN
@@ -605,18 +506,14 @@
Result of tgamma(-190.5) is: 0
</pre>
<p>
- </p>
-<p>
- Notice how some of the calls result in an error handler being called
- more than once, or for more than one handler to be called: this is an
- artefact of the fact that many functions are implemented in terms of
- one or more sub-routines each of which may have it's own error handling.
- For example <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(-</span><span class="number">190.5</span><span class="special">)</span></code>
- is implemented in terms of <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="number">190.5</span><span class="special">)</span></code> - which overflows - the reflection formula
- for <code class="computeroutput"><span class="identifier">tgamma</span></code> then notices
- that it is dividing by infinity and so underflows.
- </p>
-<p>
+ Notice how some of the calls result in an error handler being called more
+ than once, or for more than one handler to be called: this is an artefact
+ of the fact that many functions are implemented in terms of one or more
+ sub-routines each of which may have it's own error handling. For example
+ <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(-</span><span class="number">190.5</span><span class="special">)</span></code> is
+ implemented in terms of <code class="computeroutput"><span class="identifier">tgamma</span><span class="special">(</span><span class="number">190.5</span><span class="special">)</span></code>
+ - which overflows - the reflection formula for <code class="computeroutput"><span class="identifier">tgamma</span></code>
+ then notices that it is dividing by infinity and so underflows.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.what_is_a_policy"></a><a class="link" href="what_is_a_policy.html" title="So Just What is a Policy Anyway?">
- So Just What is a Policy Anyway?</a>
+<a name="math_toolkit.policy.pol_tutorial.what_is_a_policy"></a><a class="link" href="what_is_a_policy.html" title="So Just What is a Policy Anyway?">So
+ Just What is a Policy Anyway?</a>
</h4></div></div></div>
<p>
A policy is a compile-time mechanism for customising the behaviour of a
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,122 +24,121 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.special"></a><a class="link" href="special.html" title="Special Functions"> Special Functions</a>
+<a name="math_toolkit.special"></a><a class="link" href="special.html" title="Special Functions">Special Functions</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Gamma Functions</span></dt>
+<dt><span class="section">Gamma Functions</span></dt>
<dd><dl>
-<dt><span class="section"> Gamma</span></dt>
-<dt><span class="section"> Log Gamma</span></dt>
-<dt><span class="section"> Digamma</span></dt>
-<dt><span class="section"><a href="special/sf_gamma/gamma_ratios.html"> Ratios
+<dt><span class="section">Gamma</span></dt>
+<dt><span class="section">Log Gamma</span></dt>
+<dt><span class="section">Digamma</span></dt>
+<dt><span class="section"><a href="special/sf_gamma/gamma_ratios.html">Ratios
of Gamma Functions</a></span></dt>
-<dt><span class="section"><a href="special/sf_gamma/igamma.html"> Incomplete Gamma
+<dt><span class="section"><a href="special/sf_gamma/igamma.html">Incomplete Gamma
Functions</a></span></dt>
-<dt><span class="section"><a href="special/sf_gamma/igamma_inv.html"> Incomplete
+<dt><span class="section"><a href="special/sf_gamma/igamma_inv.html">Incomplete
Gamma Function Inverses</a></span></dt>
-<dt><span class="section"><a href="special/sf_gamma/gamma_derivatives.html"> Derivative
+<dt><span class="section"><a href="special/sf_gamma/gamma_derivatives.html">Derivative
of the Incomplete Gamma Function</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="special/factorials.html"> Factorials and Binomial
+<dt><span class="section"><a href="special/factorials.html">Factorials and Binomial
Coefficients</a></span></dt>
<dd><dl>
-<dt><span class="section"> Factorial</span></dt>
-<dt><span class="section"><a href="special/factorials/sf_double_factorial.html">
- Double Factorial</a></span></dt>
-<dt><span class="section"><a href="special/factorials/sf_rising_factorial.html">
- Rising Factorial</a></span></dt>
-<dt><span class="section"><a href="special/factorials/sf_falling_factorial.html">
- Falling Factorial</a></span></dt>
-<dt><span class="section"><a href="special/factorials/sf_binomial.html"> Binomial
+<dt><span class="section">Factorial</span></dt>
+<dt><span class="section"><a href="special/factorials/sf_double_factorial.html">Double
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="special/factorials/sf_rising_factorial.html">Rising
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="special/factorials/sf_falling_factorial.html">Falling
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="special/factorials/sf_binomial.html">Binomial
Coefficients</a></span></dt>
</dl></dd>
-<dt><span class="section"> Beta Functions</span></dt>
+<dt><span class="section">Beta Functions</span></dt>
<dd><dl>
-<dt><span class="section"> Beta</span></dt>
-<dt><span class="section"><a href="special/sf_beta/ibeta_function.html"> Incomplete
+<dt><span class="section">Beta</span></dt>
+<dt><span class="section"><a href="special/sf_beta/ibeta_function.html">Incomplete
Beta Functions</a></span></dt>
-<dt><span class="section"><a href="special/sf_beta/ibeta_inv_function.html"> The
+<dt><span class="section"><a href="special/sf_beta/ibeta_inv_function.html">The
Incomplete Beta Function Inverses</a></span></dt>
-<dt><span class="section"><a href="special/sf_beta/beta_derivative.html"> Derivative
+<dt><span class="section"><a href="special/sf_beta/beta_derivative.html">Derivative
of the Incomplete Beta Function</a></span></dt>
</dl></dd>
-<dt><span class="section"> Error Functions</span></dt>
+<dt><span class="section">Error Functions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="special/sf_erf/error_function.html"> Error
- Functions</a></span></dt>
-<dt><span class="section"><a href="special/sf_erf/error_inv.html"> Error Function
+<dt><span class="section">Error Functions</span></dt>
+<dt><span class="section"><a href="special/sf_erf/error_inv.html">Error Function
Inverses</a></span></dt>
</dl></dd>
-<dt><span class="section"> Polynomials</span></dt>
+<dt><span class="section">Polynomials</span></dt>
<dd><dl>
-<dt><span class="section"><a href="special/sf_poly/legendre.html"> Legendre (and
+<dt><span class="section"><a href="special/sf_poly/legendre.html">Legendre (and
Associated) Polynomials</a></span></dt>
-<dt><span class="section"><a href="special/sf_poly/laguerre.html"> Laguerre (and
+<dt><span class="section"><a href="special/sf_poly/laguerre.html">Laguerre (and
Associated) Polynomials</a></span></dt>
-<dt><span class="section"> Hermite Polynomials</span></dt>
-<dt><span class="section"> Spherical Harmonics</span></dt>
+<dt><span class="section">Hermite Polynomials</span></dt>
+<dt><span class="section">Spherical Harmonics</span></dt>
</dl></dd>
-<dt><span class="section"> Bessel Functions</span></dt>
+<dt><span class="section">Bessel Functions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="special/bessel/bessel_over.html"> Bessel Function
+<dt><span class="section"><a href="special/bessel/bessel_over.html">Bessel Function
Overview</a></span></dt>
-<dt><span class="section"><a href="special/bessel/bessel.html"> Bessel Functions
+<dt><span class="section"><a href="special/bessel/bessel.html">Bessel Functions
of the First and Second Kinds</a></span></dt>
-<dt><span class="section"><a href="special/bessel/mbessel.html"> Modified Bessel
+<dt><span class="section"><a href="special/bessel/mbessel.html">Modified Bessel
+ Functions of the First and Second Kinds</a></span></dt>
+<dt><span class="section"><a href="special/bessel/sph_bessel.html">Spherical Bessel
Functions of the First and Second Kinds</a></span></dt>
-<dt><span class="section"><a href="special/bessel/sph_bessel.html"> Spherical
- Bessel Functions of the First and Second Kinds</a></span></dt>
</dl></dd>
-<dt><span class="section"> Elliptic Integrals</span></dt>
+<dt><span class="section">Elliptic Integrals</span></dt>
<dd><dl>
-<dt><span class="section"><a href="special/ellint/ellint_intro.html"> Elliptic
+<dt><span class="section"><a href="special/ellint/ellint_intro.html">Elliptic
Integral Overview</a></span></dt>
-<dt><span class="section"><a href="special/ellint/ellint_carlson.html"> Elliptic
+<dt><span class="section"><a href="special/ellint/ellint_carlson.html">Elliptic
Integrals - Carlson Form</a></span></dt>
-<dt><span class="section"><a href="special/ellint/ellint_1.html"> Elliptic Integrals
+<dt><span class="section"><a href="special/ellint/ellint_1.html">Elliptic Integrals
of the First Kind - Legendre Form</a></span></dt>
-<dt><span class="section"><a href="special/ellint/ellint_2.html"> Elliptic Integrals
+<dt><span class="section"><a href="special/ellint/ellint_2.html">Elliptic Integrals
of the Second Kind - Legendre Form</a></span></dt>
-<dt><span class="section"><a href="special/ellint/ellint_3.html"> Elliptic Integrals
+<dt><span class="section"><a href="special/ellint/ellint_3.html">Elliptic Integrals
of the Third Kind - Legendre Form</a></span></dt>
</dl></dd>
-<dt><span class="section"> Zeta Functions</span></dt>
-<dd><dl><dt><span class="section"> Riemann Zeta Function</span></dt></dl></dd>
-<dt><span class="section"> Exponential Integrals</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="special/expint/expint_n.html"> Exponential
- Integral En</a></span></dt>
-<dt><span class="section"><a href="special/expint/expint_i.html"> Exponential
- Integral Ei</a></span></dt>
+<dt><span class="section">Zeta Functions</span></dt>
+<dd><dl><dt><span class="section">Riemann Zeta Function</span></dt></dl></dd>
+<dt><span class="section">Exponential Integrals</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="special/expint/expint_n.html">Exponential Integral
+ En</a></span></dt>
+<dt><span class="section"><a href="special/expint/expint_i.html">Exponential Integral
+ Ei</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="special/powers.html"> Logs, Powers, Roots and
+<dt><span class="section"><a href="special/powers.html">Logs, Powers, Roots and
Exponentials</a></span></dt>
<dd><dl>
-<dt><span class="section"> log1p</span></dt>
-<dt><span class="section"> expm1</span></dt>
-<dt><span class="section"> cbrt</span></dt>
-<dt><span class="section"> sqrt1pm1</span></dt>
-<dt><span class="section"> powm1</span></dt>
-<dt><span class="section"> hypot</span></dt>
-<dt><span class="section"><a href="special/powers/ct_pow.html"> Compile Time Power
+<dt><span class="section">log1p</span></dt>
+<dt><span class="section">expm1</span></dt>
+<dt><span class="section">cbrt</span></dt>
+<dt><span class="section">sqrt1pm1</span></dt>
+<dt><span class="section">powm1</span></dt>
+<dt><span class="section">hypot</span></dt>
+<dt><span class="section"><a href="special/powers/ct_pow.html">Compile Time Power
of a Runtime Base</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="special/sinc.html"> Sinus Cardinal and Hyperbolic
+<dt><span class="section"><a href="special/sinc.html">Sinus Cardinal and Hyperbolic
Sinus Cardinal Functions</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="special/sinc/sinc_overview.html"> Sinus Cardinal
+<dt><span class="section"><a href="special/sinc/sinc_overview.html">Sinus Cardinal
and Hyperbolic Sinus Cardinal Functions Overview</a></span></dt>
<dt><span class="section">sinc_pi</span></dt>
<dt><span class="section">sinhc_pi</span></dt>
</dl></dd>
-<dt><span class="section"> Inverse Hyperbolic Functions</span></dt>
+<dt><span class="section">Inverse Hyperbolic Functions</span></dt>
<dd><dl>
-<dt><span class="section"><a href="special/inv_hyper/inv_hyper_over.html"> Inverse
+<dt><span class="section"><a href="special/inv_hyper/inv_hyper_over.html">Inverse
Hyperbolic Functions Overview</a></span></dt>
-<dt><span class="section"> acosh</span></dt>
-<dt><span class="section"> asinh</span></dt>
-<dt><span class="section"> atanh</span></dt>
+<dt><span class="section">acosh</span></dt>
+<dt><span class="section">asinh</span></dt>
+<dt><span class="section">atanh</span></dt>
</dl></dd>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,26 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions"> Bessel Functions</a>
+<a name="math_toolkit.special.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions">Bessel Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="bessel/bessel_over.html"> Bessel Function
+<dt><span class="section"><a href="bessel/bessel_over.html">Bessel Function
Overview</a></span></dt>
-<dt><span class="section"><a href="bessel/bessel.html"> Bessel Functions
+<dt><span class="section"><a href="bessel/bessel.html">Bessel Functions
of the First and Second Kinds</a></span></dt>
-<dt><span class="section"><a href="bessel/mbessel.html"> Modified Bessel
+<dt><span class="section"><a href="bessel/mbessel.html">Modified Bessel
+ Functions of the First and Second Kinds</a></span></dt>
+<dt><span class="section"><a href="bessel/sph_bessel.html">Spherical Bessel
Functions of the First and Second Kinds</a></span></dt>
-<dt><span class="section"><a href="bessel/sph_bessel.html"> Spherical
- Bessel Functions of the First and Second Kinds</a></span></dt>
</dl></div>
-<p>
- </p>
-<p>
- </p>
-<p>
- </p>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions of the First and Second Kinds"> Bessel Functions
+<a name="math_toolkit.special.bessel.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions of the First and Second Kinds">Bessel Functions
of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.bessel.synopsis"></a><h5>
-<a name="id1123256"></a>
+<a name="id1252048"></a>
<a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.synopsis">Synopsis</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
@@ -44,7 +44,7 @@
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">cyl_neumann</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">v</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
</pre>
<a name="math_toolkit.special.bessel.bessel.description"></a><h5>
-<a name="id1123623"></a>
+<a name="id1252416"></a>
<a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.description">Description</a>
</h5>
<p>
@@ -75,14 +75,9 @@
is an integer.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
The functions return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
@@ -104,13 +99,13 @@
</p>
<p>
The following graph shows the behaviour of Y<sub>v</sub>: this is also cyclic for
- large <span class="emphasis"><em>x</em></span>, but tends to -∞ ​ for small <span class="emphasis"><em>x</em></span>:
+ large <span class="emphasis"><em>x</em></span>, but tends to -∞   for small <span class="emphasis"><em>x</em></span>:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/cyl_neumann.png" align="middle"></span>
</p>
<a name="math_toolkit.special.bessel.bessel.testing"></a><h5>
-<a name="id1123906"></a>
+<a name="id1253515"></a>
<a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.testing">Testing</a>
</h5>
<p>
@@ -119,7 +114,7 @@
(with all the special case handling removed).
</p>
<a name="math_toolkit.special.bessel.bessel.accuracy"></a><h5>
-<a name="id1123928"></a>
+<a name="id1253537"></a>
<a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.accuracy">Accuracy</a>
</h5>
<p>
@@ -135,7 +130,7 @@
zero error</a>. All values are relative errors in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.bessel.bessel.errors_rates_in_cyl_bessel_j"></a><p class="title"><b>Table 36. Errors Rates in cyl_bessel_j</b></p>
+<a name="math_toolkit.special.bessel.bessel.errors_rates_in_cyl_bessel_j"></a><p class="title"><b>Table 39. Errors Rates in cyl_bessel_j</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_bessel_j">
<colgroup>
<col>
@@ -157,7 +152,7 @@
</th>
<th>
<p>
- J<sub>0</sub> ​ and J<sub>1</sub>
+ J<sub>0</sub>   and J<sub>1</sub>
</p>
</th>
<th>
@@ -167,7 +162,7 @@
</th>
<th>
<p>
- J<sub>v</sub> ​ (large values of x > 1000)
+ J<sub>v</sub>   (large values of x > 1000)
</p>
</th>
</tr></thead>
@@ -242,7 +237,7 @@
</td>
<td>
<p>
- Peak=2x10<sup>4</sup> ​ Mean=6x10<sup>3</sup>
+ Peak=2x10<sup>4</sup>   Mean=6x10<sup>3</sup>
</p>
</td>
</tr>
@@ -269,7 +264,7 @@
</td>
<td>
<p>
- Peak=2x10<sup>4</sup> ​ Mean=1x10<sup>4</sup>
+ Peak=2x10<sup>4</sup>   Mean=1x10<sup>4</sup>
</p>
</td>
</tr>
@@ -304,7 +299,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.bessel.bessel.errors_rates_in_cyl_neumann"></a><p class="title"><b>Table 37. Errors Rates in cyl_neumann</b></p>
+<a name="math_toolkit.special.bessel.bessel.errors_rates_in_cyl_neumann"></a><p class="title"><b>Table 40. Errors Rates in cyl_neumann</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_neumann">
<colgroup>
<col>
@@ -326,7 +321,7 @@
</th>
<th>
<p>
- J<sub>0</sub> ​ and J<sub>1</sub>
+ J<sub>0</sub>   and J<sub>1</sub>
</p>
</th>
<th>
@@ -381,7 +376,7 @@
Peak=561 Mean=36
</p>
<p>
- GSL Peak=1.4x10<sup>6</sup> ​ Mean=7x10<sup>4</sup> ​
+ GSL Peak=1.4x10<sup>6</sup>   Mean=7x10<sup>4</sup>  
</p>
<p>
<a href="http://www.netlib.org/cephes/" target="_top">Cephes</a> Peak=+INF
@@ -433,12 +428,12 @@
</td>
<td>
<p>
- Peak=2x10<sup>4</sup> ​ Mean=8x10<sup>3</sup>
+ Peak=2x10<sup>4</sup>   Mean=8x10<sup>3</sup>
</p>
</td>
<td>
<p>
- Peak=1x10<sup>5</sup> ​ Mean=6x10<sup>3</sup>
+ Peak=1x10<sup>5</sup>   Mean=6x10<sup>3</sup>
</p>
</td>
</tr>
@@ -465,7 +460,7 @@
</td>
<td>
<p>
- Peak=2x10<sup>4</sup> ​ Mean=1200
+ Peak=2x10<sup>4</sup>   Mean=1200
</p>
</td>
</tr>
@@ -494,7 +489,7 @@
were found.
</p>
<a name="math_toolkit.special.bessel.bessel.implementation"></a><h5>
-<a name="id1126433"></a>
+<a name="id1254231"></a>
<a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.implementation">Implementation</a>
</h5>
<p>
@@ -538,9 +533,9 @@
</p>
<p>
When the order <span class="emphasis"><em>v</em></span> is an integer the method first relates
- the result to J<sub>0</sub>, J<sub>1</sub>, Y<sub>0</sub> ​ and Y<sub>1</sub> ​ using either forwards or backwards recurrence
+ the result to J<sub>0</sub>, J<sub>1</sub>, Y<sub>0</sub>   and Y<sub>1</sub>   using either forwards or backwards recurrence
(Miller's algorithm) depending upon which is stable. The values for J<sub>0</sub>,
- J<sub>1</sub>, Y<sub>0</sub> ​ and Y<sub>1</sub> ​ are calculated using the rational minimax approximations on
+ J<sub>1</sub>, Y<sub>0</sub>   and Y<sub>1</sub>   are calculated using the rational minimax approximations on
root-bracketing intervals for small <span class="emphasis"><em>|x|</em></span> and Hankel
asymptotic expansion for large <span class="emphasis"><em>|x|</em></span>. The coefficients
are from:
@@ -562,18 +557,18 @@
these methods are not used when type T has more than 64 binary digits.
</p>
<p>
- When <span class="emphasis"><em>x</em></span> is small, J<sub>x</sub> ​ is best computed directly from
+ When <span class="emphasis"><em>x</em></span> is small, J<sub>x</sub>   is best computed directly from
the series:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../equations/bessel2.png"></span>
</p>
<p>
- In the general case we compute J<sub>v</sub> ​ and Y<sub>v</sub> ​ simultaneously.
+ In the general case we compute J<sub>v</sub>   and Y<sub>v</sub>   simultaneously.
</p>
<p>
- To get the initial values, let μ ​ = ν - floor(ν + 1/2), then μ ​ is the fractional
- part of ν ​ such that |μ| <= 1/2 (we need this for convergence later). The
+ To get the initial values, let μ   = ν - floor(ν + 1/2), then μ   is the fractional
+ part of ν   such that |μ| <= 1/2 (we need this for convergence later). The
idea is to calculate J<sub>μ</sub>(x), J<sub>μ+1</sub>(x), Y<sub>μ</sub>(x), Y<sub>μ+1</sub>(x) and use them to obtain
J<sub>ν</sub>(x), Y<sub>ν</sub>(x).
</p>
@@ -642,7 +637,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/bessel16.png"></span>
</p>
<p>
- g<sub>k</sub> ​ and h<sub>k</sub> ​
+ g<sub>k</sub>   and h<sub>k</sub>  
are also computed by recursions (involving gamma functions), but
the formulas are a little complicated, readers are refered to N.M. Temme,
<span class="emphasis"><em>On the numerical evaluation of the ordinary Bessel function of
@@ -650,7 +645,7 @@
(1976). Note Temme's series converge only for |μ| <= 1/2.
</p>
<p>
- As the previous case, Y<sub>ν</sub> ​ is calculated from the forward recurrence, so is
+ As the previous case, Y<sub>ν</sub>   is calculated from the forward recurrence, so is
Y<sub>ν+1</sub>. With these two values and f<sub>ν</sub>, the Wronskian yields J<sub>ν</sub>(x) directly without
backward recurrence.
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.bessel_over"></a><a class="link" href="bessel_over.html" title="Bessel Function Overview"> Bessel Function
+<a name="math_toolkit.special.bessel.bessel_over"></a><a class="link" href="bessel_over.html" title="Bessel Function Overview">Bessel Function
Overview</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.bessel_over.ordinary_bessel_functions"></a><h5>
-<a name="id1122507"></a>
+<a name="id1251303"></a>
<a class="link" href="bessel_over.html#math_toolkit.special.bessel.bessel_over.ordinary_bessel_functions">Ordinary
Bessel Functions</a>
</h5>
@@ -39,7 +39,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/bessel1.png"></span>
</p>
<p>
- where ν ​ is the <span class="emphasis"><em>order</em></span> of the equation, and may be an
+ where ν   is the <span class="emphasis"><em>order</em></span> of the equation, and may be an
arbitrary real or complex number, although integer orders are the most
common occurrence.
</p>
@@ -48,7 +48,7 @@
</p>
<p>
Since this is a second order differential equation, there must be two linearly
- independent solutions, the first of these is denoted J<sub>v</sub> ​
+ independent solutions, the first of these is denoted J<sub>v</sub>  
and known as a Bessel
function of the first kind:
</p>
@@ -59,7 +59,7 @@
This function is implemented in this library as <a class="link" href="bessel.html" title="Bessel Functions of the First and Second Kinds">cyl_bessel_j</a>.
</p>
<p>
- The second solution is denoted either Y<sub>v</sub> ​ or N<sub>v</sub> ​
+ The second solution is denoted either Y<sub>v</sub>   or N<sub>v</sub>  
and is known as either a Bessel
Function of the second kind, or as a Neumann function:
</p>
@@ -103,7 +103,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/bessel10.png"></span>
</p>
<a name="math_toolkit.special.bessel.bessel_over.modified_bessel_functions"></a><h5>
-<a name="id1122827"></a>
+<a name="id1251624"></a>
<a class="link" href="bessel_over.html#math_toolkit.special.bessel.bessel_over.modified_bessel_functions">Modified
Bessel Functions</a>
</h5>
@@ -119,7 +119,7 @@
<p>
The solutions are known as the modified Bessel functions of the first and
second kind (or occasionally as the hyperbolic Bessel functions of the
- first and second kind). They are denoted I<sub>v</sub> ​ and K<sub>v</sub> ​
+ first and second kind). They are denoted I<sub>v</sub>   and K<sub>v</sub>  
respectively:
</p>
<p>
@@ -167,7 +167,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/mbessel10.png"></span>
</p>
<a name="math_toolkit.special.bessel.bessel_over.spherical_bessel_functions"></a><h5>
-<a name="id1123132"></a>
+<a name="id1251928"></a>
<a class="link" href="bessel_over.html#math_toolkit.special.bessel.bessel_over.spherical_bessel_functions">Spherical
Bessel Functions</a>
</h5>
@@ -180,14 +180,14 @@
</p>
<p>
The two linearly independent solutions to this equation are called the
- spherical Bessel functions j<sub>n</sub> ​ and y<sub>n</sub> ​, and are related to the ordinary Bessel
- functions J<sub>n</sub> ​ and Y<sub>n</sub> ​ by:
+ spherical Bessel functions j<sub>n</sub>   and y<sub>n</sub>  , and are related to the ordinary Bessel
+ functions J<sub>n</sub>   and Y<sub>n</sub>   by:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../equations/sbessel2.png"></span>
</p>
<p>
- The spherical Bessel function of the second kind y<sub>n</sub> ​
+ The spherical Bessel function of the second kind y<sub>n</sub>  
is also known as the
spherical Neumann function n<sub>n</sub>.
</p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.mbessel"></a><a class="link" href="mbessel.html" title="Modified Bessel Functions of the First and Second Kinds"> Modified Bessel
+<a name="math_toolkit.special.bessel.mbessel"></a><a class="link" href="mbessel.html" title="Modified Bessel Functions of the First and Second Kinds">Modified Bessel
Functions of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.mbessel.synopsis"></a><h5>
-<a name="id1127045"></a>
+<a name="id1254837"></a>
<a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.synopsis">Synopsis</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
@@ -44,7 +44,7 @@
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">cyl_bessel_k</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">v</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
</pre>
<a name="math_toolkit.special.bessel.mbessel.description"></a><h5>
-<a name="id1127412"></a>
+<a name="id1255205"></a>
<a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.description">Description</a>
</h5>
<p>
@@ -75,14 +75,9 @@
is an integer.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
The functions return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
@@ -109,7 +104,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/cyl_bessel_k.png" align="middle"></span>
</p>
<a name="math_toolkit.special.bessel.mbessel.testing"></a><h5>
-<a name="id1127684"></a>
+<a name="id1255473"></a>
<a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.testing">Testing</a>
</h5>
<p>
@@ -118,7 +113,7 @@
(with all the special case handling removed).
</p>
<a name="math_toolkit.special.bessel.mbessel.accuracy"></a><h5>
-<a name="id1127706"></a>
+<a name="id1255495"></a>
<a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.accuracy">Accuracy</a>
</h5>
<p>
@@ -129,7 +124,7 @@
zero error</a>. All values are relative errors in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.bessel.mbessel.errors_rates_in_cyl_bessel_i"></a><p class="title"><b>Table 38. Errors Rates in cyl_bessel_i</b></p>
+<a name="math_toolkit.special.bessel.mbessel.errors_rates_in_cyl_bessel_i"></a><p class="title"><b>Table 41. Errors Rates in cyl_bessel_i</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_bessel_i">
<colgroup>
<col>
@@ -226,7 +221,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.bessel.mbessel.errors_rates_in_cyl_bessel_k"></a><p class="title"><b>Table 39. Errors Rates in cyl_bessel_k</b></p>
+<a name="math_toolkit.special.bessel.mbessel.errors_rates_in_cyl_bessel_k"></a><p class="title"><b>Table 42. Errors Rates in cyl_bessel_k</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_bessel_k">
<colgroup>
<col>
@@ -326,19 +321,19 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.bessel.mbessel.implementation"></a><h5>
-<a name="id1128049"></a>
+<a name="id1256120"></a>
<a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.implementation">Implementation</a>
</h5>
<p>
The following are handled as special cases first:
</p>
<p>
- When computing I<sub>v</sub> ​ for <span class="emphasis"><em>x < 0</em></span>, then ν ​ must be an integer
- or a domain error occurs. If ν ​ is an integer, then the function is odd if
- ν ​ is odd and even if ν ​ is even, and we can reflect to <span class="emphasis"><em>x > 0</em></span>.
+ When computing I<sub>v</sub>   for <span class="emphasis"><em>x < 0</em></span>, then ν   must be an integer
+ or a domain error occurs. If ν   is an integer, then the function is odd if
+ ν   is odd and even if ν   is even, and we can reflect to <span class="emphasis"><em>x > 0</em></span>.
</p>
<p>
- For I<sub>v</sub> ​ with v equal to 0, 1 or 0.5 are handled as special cases.
+ For I<sub>v</sub>   with v equal to 0, 1 or 0.5 are handled as special cases.
</p>
<p>
The 0 and 1 cases use minimax rational approximations on finite and infinite
@@ -362,20 +357,20 @@
I<sub>0.5</sub>(x) = sqrt(2 / πx) * sinh(x)
</p>
<p>
- For K<sub>v</sub> ​ with <span class="emphasis"><em>v</em></span> an integer, the result is calculated
+ For K<sub>v</sub>   with <span class="emphasis"><em>v</em></span> an integer, the result is calculated
using the recurrence relation:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../equations/mbessel5.png"></span>
</p>
<p>
- starting from K<sub>0</sub> ​ and K<sub>1</sub> ​ which are calculated using rational the approximations
+ starting from K<sub>0</sub>   and K<sub>1</sub>   which are calculated using rational the approximations
above. These rational approximations are accurate to around 19 digits,
and are therefore only used when T has no more than 64 binary digits of
precision.
</p>
<p>
- In the general case, we first normalize ν ​ to [<code class="literal">0, [inf</code>])
+ In the general case, we first normalize ν   to [<code class="literal">0, [inf</code>])
with the help of the reflection formulae:
</p>
<p>
@@ -385,7 +380,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/mbessel10.png"></span>
</p>
<p>
- Let μ ​ = ν - floor(ν + 1/2), then μ ​ is the fractional part of ν ​ such that |μ| <=
+ Let μ   = ν - floor(ν + 1/2), then μ   is the fractional part of ν   such that |μ| <=
1/2 (we need this for convergence later). The idea is to calculate K<sub>μ</sub>(x)
and K<sub>μ+1</sub>(x), and use them to obtain I<sub>ν</sub>(x) and K<sub>ν</sub>(x).
</p>
@@ -422,7 +417,7 @@
<p>
When <span class="emphasis"><em>x</em></span> is large (<span class="emphasis"><em>x</em></span> > 2), both
continued fractions converge (CF1 may be slow for really large <span class="emphasis"><em>x</em></span>).
- K<sub>μ</sub> ​ and K<sub>μ+1</sub> ​
+ K<sub>μ</sub>   and K<sub>μ+1</sub>  
can be calculated by
</p>
<p>
@@ -455,7 +450,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/mbessel16.png"></span>
</p>
<p>
- f<sub>k</sub> ​ and h<sub>k</sub> ​
+ f<sub>k</sub>   and h<sub>k</sub>  
are also computed by recursions (involving gamma functions), but
the formulas are a little complicated, readers are referred to N.M. Temme,
<span class="emphasis"><em>On the numerical evaluation of the modified Bessel function of
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.sph_bessel"></a><a class="link" href="sph_bessel.html" title="Spherical Bessel Functions of the First and Second Kinds"> Spherical
- Bessel Functions of the First and Second Kinds</a>
+<a name="math_toolkit.special.bessel.sph_bessel"></a><a class="link" href="sph_bessel.html" title="Spherical Bessel Functions of the First and Second Kinds">Spherical Bessel
+ Functions of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.sph_bessel.synopsis"></a><h5>
-<a name="id1129669"></a>
+<a name="id1256634"></a>
<a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.synopsis">Synopsis</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
@@ -44,7 +44,7 @@
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">sph_neumann</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">v</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
</pre>
<a name="math_toolkit.special.bessel.sph_bessel.description"></a><h5>
-<a name="id1130036"></a>
+<a name="id1257001"></a>
<a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.description">Description</a>
</h5>
<p>
@@ -70,34 +70,29 @@
type calculation rules</em></span></a> for the single argument type T.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
The functions return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
whenever the result is undefined or complex: this occurs when <code class="computeroutput"><span class="identifier">x</span> <span class="special"><</span> <span class="number">0</span></code>.
</p>
<p>
- The j<sub>v</sub> ​ function is cyclic like J<sub>v</sub> ​ but differs in its behaviour at the origin:
+ The j<sub>v</sub>   function is cyclic like J<sub>v</sub>   but differs in its behaviour at the origin:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/sph_bessel.png" align="middle"></span>
</p>
<p>
- Likewise y<sub>v</sub> ​ is also cyclic for large x, but tends to -∞ ​
+ Likewise y<sub>v</sub>   is also cyclic for large x, but tends to -∞  
for small <span class="emphasis"><em>x</em></span>:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/sph_neumann.png" align="middle"></span>
</p>
<a name="math_toolkit.special.bessel.sph_bessel.testing"></a><h5>
-<a name="id1130235"></a>
+<a name="id1257197"></a>
<a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.testing">Testing</a>
</h5>
<p>
@@ -106,7 +101,7 @@
implementation (with all the special case handling removed).
</p>
<a name="math_toolkit.special.bessel.sph_bessel.accuracy"></a><h5>
-<a name="id1130257"></a>
+<a name="id1257218"></a>
<a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.accuracy">Accuracy</a>
</h5>
<p>
@@ -116,7 +111,7 @@
refer to these functions for accuracy data.
</p>
<a name="math_toolkit.special.bessel.sph_bessel.implementation"></a><h5>
-<a name="id1130283"></a>
+<a name="id1257245"></a>
<a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.implementation">Implementation</a>
</h5>
<p>
@@ -130,7 +125,7 @@
The special cases occur for:
</p>
<p>
- j<sub>0</sub> ​= <a class="link" href="../sinc/sinc_pi.html" title="sinc_pi">sinc_pi</a>(x)
+ j<sub>0</sub>  = <a class="link" href="../sinc/sinc_pi.html" title="sinc_pi">sinc_pi</a>(x)
= sin(x) / x
</p>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,18 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.ellint"></a><a class="link" href="ellint.html" title="Elliptic Integrals"> Elliptic Integrals</a>
+<a name="math_toolkit.special.ellint"></a><a class="link" href="ellint.html" title="Elliptic Integrals">Elliptic Integrals</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="ellint/ellint_intro.html"> Elliptic
+<dt><span class="section"><a href="ellint/ellint_intro.html">Elliptic
Integral Overview</a></span></dt>
-<dt><span class="section"><a href="ellint/ellint_carlson.html"> Elliptic
+<dt><span class="section"><a href="ellint/ellint_carlson.html">Elliptic
Integrals - Carlson Form</a></span></dt>
-<dt><span class="section"><a href="ellint/ellint_1.html"> Elliptic Integrals
+<dt><span class="section"><a href="ellint/ellint_1.html">Elliptic Integrals
of the First Kind - Legendre Form</a></span></dt>
-<dt><span class="section"><a href="ellint/ellint_2.html"> Elliptic Integrals
+<dt><span class="section"><a href="ellint/ellint_2.html">Elliptic Integrals
of the Second Kind - Legendre Form</a></span></dt>
-<dt><span class="section"><a href="ellint/ellint_3.html"> Elliptic Integrals
+<dt><span class="section"><a href="ellint/ellint_3.html">Elliptic Integrals
of the Third Kind - Legendre Form</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_1"></a><a class="link" href="ellint_1.html" title="Elliptic Integrals of the First Kind - Legendre Form"> Elliptic Integrals
+<a name="math_toolkit.special.ellint.ellint_1"></a><a class="link" href="ellint_1.html" title="Elliptic Integrals of the First Kind - Legendre Form">Elliptic Integrals
of the First Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_1.synopsis"></a><h6>
-<a name="id1137461"></a>
+<a name="id1262795"></a>
<a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.synopsis">Synopsis</a>
</h6>
<p>
@@ -55,7 +55,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.ellint.ellint_1.description"></a><h6>
-<a name="id1137865"></a>
+<a name="id1263199"></a>
<a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.description">Description</a>
</h6>
<p>
@@ -88,14 +88,9 @@
Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ellint_1</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">k</span><span class="special">);</span>
@@ -113,17 +108,12 @@
Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.ellint.ellint_1.accuracy"></a><h6>
-<a name="id1138330"></a>
+<a name="id1263656"></a>
<a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.accuracy">Accuracy</a>
</h6>
<p>
@@ -134,7 +124,7 @@
All values are relative errors in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.ellint.ellint_1.errors_rates_in_the_elliptic_integrals_of_the_first_kind"></a><p class="title"><b>Table 41. Errors Rates in the Elliptic Integrals of the First Kind</b></p>
+<a name="math_toolkit.special.ellint.ellint_1.errors_rates_in_the_elliptic_integrals_of_the_first_kind"></a><p class="title"><b>Table 44. Errors Rates in the Elliptic Integrals of the First Kind</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in the Elliptic Integrals of the First Kind">
<colgroup>
<col>
@@ -235,7 +225,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.ellint.ellint_1.testing"></a><h6>
-<a name="id1138516"></a>
+<a name="id1263830"></a>
<a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.testing">Testing</a>
</h6>
<p>
@@ -245,7 +235,7 @@
this implementation.
</p>
<a name="math_toolkit.special.ellint.ellint_1.implementation"></a><h6>
-<a name="id1138537"></a>
+<a name="id1263852"></a>
<a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.implementation">Implementation</a>
</h6>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_2"></a><a class="link" href="ellint_2.html" title="Elliptic Integrals of the Second Kind - Legendre Form"> Elliptic Integrals
+<a name="math_toolkit.special.ellint.ellint_2"></a><a class="link" href="ellint_2.html" title="Elliptic Integrals of the Second Kind - Legendre Form">Elliptic Integrals
of the Second Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_2.synopsis"></a><h6>
-<a name="id1138618"></a>
+<a name="id1264632"></a>
<a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.synopsis">Synopsis</a>
</h6>
<p>
@@ -55,7 +55,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.ellint.ellint_2.description"></a><h6>
-<a name="id1139023"></a>
+<a name="id1265036"></a>
<a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.description">Description</a>
</h6>
<p>
@@ -88,14 +88,9 @@
Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ellint_2</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">k</span><span class="special">);</span>
@@ -113,17 +108,12 @@
Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.ellint.ellint_2.accuracy"></a><h6>
-<a name="id1139487"></a>
+<a name="id1265493"></a>
<a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.accuracy">Accuracy</a>
</h6>
<p>
@@ -134,7 +124,7 @@
All values are relative errors in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.ellint.ellint_2.errors_rates_in_the_elliptic_integrals_of_the_second_kind"></a><p class="title"><b>Table 42. Errors Rates in the Elliptic Integrals of the Second Kind</b></p>
+<a name="math_toolkit.special.ellint.ellint_2.errors_rates_in_the_elliptic_integrals_of_the_second_kind"></a><p class="title"><b>Table 45. Errors Rates in the Elliptic Integrals of the Second Kind</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in the Elliptic Integrals of the Second Kind">
<colgroup>
<col>
@@ -235,7 +225,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.ellint.ellint_2.testing"></a><h6>
-<a name="id1139674"></a>
+<a name="id1265667"></a>
<a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.testing">Testing</a>
</h6>
<p>
@@ -245,7 +235,7 @@
this implementation.
</p>
<a name="math_toolkit.special.ellint.ellint_2.implementation"></a><h6>
-<a name="id1139696"></a>
+<a name="id1265689"></a>
<a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.implementation">Implementation</a>
</h6>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_3"></a><a class="link" href="ellint_3.html" title="Elliptic Integrals of the Third Kind - Legendre Form"> Elliptic Integrals
+<a name="math_toolkit.special.ellint.ellint_3"></a><a class="link" href="ellint_3.html" title="Elliptic Integrals of the Third Kind - Legendre Form">Elliptic Integrals
of the Third Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_3.synopsis"></a><h6>
-<a name="id1139776"></a>
+<a name="id1265768"></a>
<a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.synopsis">Synopsis</a>
</h6>
<p>
@@ -55,7 +55,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.ellint.ellint_3.description"></a><h6>
-<a name="id1140286"></a>
+<a name="id1266278"></a>
<a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.description">Description</a>
</h6>
<p>
@@ -91,14 +91,9 @@
(outside this range the result would be complex).
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ellint_3</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">k</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">n</span><span class="special">);</span>
@@ -119,17 +114,12 @@
(outside this range the result would be complex).
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.ellint.ellint_3.accuracy"></a><h6>
-<a name="id1140887"></a>
+<a name="id1268647"></a>
<a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.accuracy">Accuracy</a>
</h6>
<p>
@@ -140,7 +130,7 @@
All values are relative errors in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.ellint.ellint_3.errors_rates_in_the_elliptic_integrals_of_the_third_kind"></a><p class="title"><b>Table 43. Errors Rates in the Elliptic Integrals of the Third Kind</b></p>
+<a name="math_toolkit.special.ellint.ellint_3.errors_rates_in_the_elliptic_integrals_of_the_third_kind"></a><p class="title"><b>Table 46. Errors Rates in the Elliptic Integrals of the Third Kind</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in the Elliptic Integrals of the Third Kind">
<colgroup>
<col>
@@ -241,7 +231,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.ellint.ellint_3.testing"></a><h6>
-<a name="id1141074"></a>
+<a name="id1268821"></a>
<a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.testing">Testing</a>
</h6>
<p>
@@ -251,7 +241,7 @@
this implementation.
</p>
<a name="math_toolkit.special.ellint.ellint_3.implementation"></a><h6>
-<a name="id1141096"></a>
+<a name="id1268843"></a>
<a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.implementation">Implementation</a>
</h6>
<p>
@@ -288,10 +278,10 @@
<span class="emphasis"><em>Π(n, φ+mπ, k) = Π(n, φ, k) + 2mΠ(n, k) ; n <= 1</em></span>
</p>
<p>
- <span class="emphasis"><em>Π(n, φ+mπ, k) = Π(n, φ, k) ; n > 1</em></span> <sup>[<a name="id1141210" href="#ftn.id1141210" class="footnote">1</a>]</sup>
+ <span class="emphasis"><em>Π(n, φ+mπ, k) = Π(n, φ, k) ; n > 1</em></span> <sup>[<a name="id1268958" href="#ftn.id1268958" class="footnote">1</a>]</sup>
</p>
<p>
- are used to move φ ​ to the range [0, π/2].
+ are used to move φ   to the range [0, π/2].
</p>
<p>
The functions are then implemented in terms of Carlson's integrals using
@@ -308,7 +298,7 @@
</p>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id1141210" href="#id1141210" class="para">1</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1268958" href="#id1268958" class="para">1</a>] </sup>
I haven't been able to find a literature reference for this relation,
but it appears to be the convention used by Mathematica. Intuitively
the first <span class="emphasis"><em>2 * m * Π(n, k)</em></span> terms cancel out as the
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_carlson"></a><a class="link" href="ellint_carlson.html" title="Elliptic Integrals - Carlson Form"> Elliptic
+<a name="math_toolkit.special.ellint.ellint_carlson"></a><a class="link" href="ellint_carlson.html" title="Elliptic Integrals - Carlson Form">Elliptic
Integrals - Carlson Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_carlson.synopsis"></a><h6>
-<a name="id1132727"></a>
+<a name="id1259749"></a>
<a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.synopsis">Synopsis</a>
</h6>
<p>
@@ -100,7 +100,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.ellint.ellint_carlson.description"></a><h6>
-<a name="id1134026"></a>
+<a name="id1261048"></a>
<a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.description">Description</a>
</h6>
<p>
@@ -133,14 +133,9 @@
be zero. Otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ellint_rd</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">y</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">z</span><span class="special">)</span>
@@ -159,14 +154,9 @@
and that z >= 0. Otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T4</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ellint_rj</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">y</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">z</span><span class="special">,</span> <span class="identifier">T4</span> <span class="identifier">p</span><span class="special">)</span>
@@ -186,14 +176,9 @@
<a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
When <span class="emphasis"><em>p < 0</em></span> the function returns the <a href="http://en.wikipedia.org/wiki/Cauchy_principal_value" target="_top">Cauchy
@@ -219,14 +204,9 @@
Otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
When <span class="emphasis"><em>y < 0</em></span> the function returns the <a href="http://mathworld.wolfram.com/CauchyPrincipalValue.html" target="_top">Cauchy
@@ -236,7 +216,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/ellint18.png"></span>
</p>
<a name="math_toolkit.special.ellint.ellint_carlson.testing"></a><h6>
-<a name="id1136970"></a>
+<a name="id1262324"></a>
<a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.testing">Testing</a>
</h6>
<p>
@@ -259,7 +239,7 @@
to verify their correctness: see the above Carlson paper for details.
</p>
<a name="math_toolkit.special.ellint.ellint_carlson.accuracy"></a><h6>
-<a name="id1137011"></a>
+<a name="id1262365"></a>
<a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.accuracy">Accuracy</a>
</h6>
<p>
@@ -270,7 +250,7 @@
All values are relative errors in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.ellint.ellint_carlson.errors_rates_in_the_carlson_elliptic_integrals"></a><p class="title"><b>Table 40. Errors Rates in the Carlson Elliptic Integrals</b></p>
+<a name="math_toolkit.special.ellint.ellint_carlson.errors_rates_in_the_carlson_elliptic_integrals"></a><p class="title"><b>Table 43. Errors Rates in the Carlson Elliptic Integrals</b></p>
<div class="table-contents"><table class="table" summary="Errors Rates in the Carlson Elliptic Integrals">
<colgroup>
<col>
@@ -413,7 +393,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.ellint.ellint_carlson.implementation"></a><h6>
-<a name="id1137277"></a>
+<a name="id1262612"></a>
<a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.implementation">Implementation</a>
</h6>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_intro"></a><a class="link" href="ellint_intro.html" title="Elliptic Integral Overview"> Elliptic
+<a name="math_toolkit.special.ellint.ellint_intro"></a><a class="link" href="ellint_intro.html" title="Elliptic Integral Overview">Elliptic
Integral Overview</a>
</h4></div></div></div>
<p>
@@ -49,15 +49,15 @@
Elliptic integral</a>.
</p>
<a name="math_toolkit.special.ellint.ellint_intro.notation"></a><h5>
-<a name="id1130431"></a>
+<a name="id1257392"></a>
<a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.notation">Notation</a>
</h5>
<p>
All variables are real numbers unless otherwise noted.
</p>
-<a name="ellint_def"></a><a name="math_toolkit.special.ellint.ellint_intro.definition"></a><h5>
-<a name="id1130451"></a>
- <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.definition">Definition</a>
+<a name="math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_def____definition"></a><h5>
+<a name="id1257409"></a>
+ <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_def____definition"><a name="ellint_def"></a> Definition</a>
</h5>
<p>
<span class="inlinemediaobject"><img src="../../../../equations/ellint1.png"></span>
@@ -244,10 +244,9 @@
</p>
</td></tr>
</table></div>
-<a name="ellint_theorem"></a><a name="math_toolkit.special.ellint.ellint_intro.duplication_theorem"></a><h5>
-<a name="id1131051"></a>
- <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.duplication_theorem">Duplication
- Theorem</a>
+<a name="math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_theorem____duplication_theorem"></a><h5>
+<a name="id1258006"></a>
+ <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_theorem____duplication_theorem"><a name="ellint_theorem"></a> Duplication Theorem</a>
</h5>
<p>
Carlson proved in [<a class="link" href="ellint_intro.html#ellint_ref_carlson78">Carlson78</a>]
@@ -256,10 +255,9 @@
<p>
<span class="inlinemediaobject"><img src="../../../../equations/ellint13.png"></span>
</p>
-<a name="ellint_formula"></a><a name="math_toolkit.special.ellint.ellint_intro.carlson_s_formulas"></a><h5>
-<a name="id1131105"></a>
- <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.carlson_s_formulas">Carlson's
- Formulas</a>
+<a name="math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_formula____carlson_s_formulas"></a><h5>
+<a name="id1258054"></a>
+ <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_formula____carlson_s_formulas"><a name="ellint_formula"></a> Carlson's Formulas</a>
</h5>
<p>
The Legendre form and Carlson form of elliptic integrals are related by
@@ -275,7 +273,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/ellint15.png"></span>
</p>
<a name="math_toolkit.special.ellint.ellint_intro.numerical_algorithms"></a><h5>
-<a name="id1131178"></a>
+<a name="id1258127"></a>
<a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.numerical_algorithms">Numerical
Algorithms</a>
</h5>
@@ -288,9 +286,9 @@
by contrast, provides a unified method for all three kinds of elliptic
integrals with satisfactory precisions.
</p>
-<a name="ellint_refs"></a><a name="math_toolkit.special.ellint.ellint_intro.references"></a><h5>
-<a name="id1131211"></a>
- <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.references">References</a>
+<a name="math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_refs____references"></a><h5>
+<a name="id1258157"></a>
+ <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro._anchor_id__ellint_refs____references"><a name="ellint_refs"></a> References</a>
</h5>
<p>
Special mention goes to:
@@ -302,30 +300,32 @@
<p>
However the main references are:
</p>
-<a name="ellint_ref_AS"></a><a name="ellint_ref_carlson79"></a><a name="ellint_ref_carlson77"></a><a name="ellint_ref_carlson78"></a><a name="ellint_ref_carlson81"></a><div class="orderedlist"><ol type="1">
+<div class="orderedlist"><ol type="1">
<li>
- M. Abramowitz and I. A. Stegun (Eds.) (1964) Handbook of Mathematical
- Functions with Formulas, Graphs, and Mathematical Tables, National
- Bureau of Standards Applied Mathematics Series, U.S. Government Printing
- Office, Washington, D.C.
+ <a name="ellint_ref_AS"></a> M. Abramowitz and I. A. Stegun (Eds.)
+ (1964) Handbook of Mathematical Functions with Formulas, Graphs, and
+ Mathematical Tables, National Bureau of Standards Applied Mathematics
+ Series, U.S. Government Printing Office, Washington, D.C.
</li>
<li>
- B.C. Carlson, <span class="emphasis"><em>Computing elliptic integrals by duplication</em></span>,
- Numerische Mathematik, vol 33, 1 (1979).
+ <a name="ellint_ref_carlson79"></a> B.C. Carlson, <span class="emphasis"><em>Computing
+ elliptic integrals by duplication</em></span>, Numerische Mathematik,
+ vol 33, 1 (1979).
</li>
<li>
- B.C. Carlson, <span class="emphasis"><em>Elliptic Integrals of the First Kind</em></span>,
- SIAM Journal on Mathematical Analysis, vol 8, 231 (1977).
+ <a name="ellint_ref_carlson77"></a> B.C. Carlson, <span class="emphasis"><em>Elliptic
+ Integrals of the First Kind</em></span>, SIAM Journal on Mathematical
+ Analysis, vol 8, 231 (1977).
</li>
<li>
- B.C. Carlson, <span class="emphasis"><em>Short Proofs of Three Theorems on Elliptic
- Integrals</em></span>, SIAM Journal on Mathematical Analysis, vol 9,
- 524 (1978).
+ <a name="ellint_ref_carlson78"></a> B.C. Carlson, <span class="emphasis"><em>Short Proofs
+ of Three Theorems on Elliptic Integrals</em></span>, SIAM Journal on
+ Mathematical Analysis, vol 9, 524 (1978).
</li>
<li>
- B.C. Carlson and E.M. Notis, <span class="emphasis"><em>ALGORITHM 577: Algorithms for
- Incomplete Elliptic Integrals</em></span>, ACM Transactions on Mathematmal
- Software, vol 7, 398 (1981).
+ <a name="ellint_ref_carlson81"></a> B.C. Carlson and E.M. Notis, <span class="emphasis"><em>ALGORITHM
+ 577: Algorithms for Incomplete Elliptic Integrals</em></span>, ACM Transactions
+ on Mathematmal Software, vol 7, 398 (1981).
</li>
<li>
B. C. Carlson, <span class="emphasis"><em>On computing elliptic integrals and functions</em></span>.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.expint"></a><a class="link" href="expint.html" title="Exponential Integrals"> Exponential Integrals</a>
+<a name="math_toolkit.special.expint"></a><a class="link" href="expint.html" title="Exponential Integrals">Exponential Integrals</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="expint/expint_n.html"> Exponential
- Integral En</a></span></dt>
-<dt><span class="section"><a href="expint/expint_i.html"> Exponential
- Integral Ei</a></span></dt>
+<dt><span class="section"><a href="expint/expint_n.html">Exponential Integral
+ En</a></span></dt>
+<dt><span class="section"><a href="expint/expint_i.html">Exponential Integral
+ Ei</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.expint.expint_i"></a><a class="link" href="expint_i.html" title="Exponential Integral Ei"> Exponential
- Integral Ei</a>
+<a name="math_toolkit.special.expint.expint_i"></a><a class="link" href="expint_i.html" title="Exponential Integral Ei">Exponential Integral
+ Ei</a>
</h4></div></div></div>
<a name="math_toolkit.special.expint.expint_i.synopsis"></a><h5>
-<a name="id1144541"></a>
+<a name="id1271012"></a>
<a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.synopsis">Synopsis</a>
</h5>
<p>
@@ -53,17 +53,12 @@
type calculation rules</em></span></a>: the return type is <code class="computeroutput"><span class="keyword">double</span></code> if T is an integer type, and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.expint.expint_i.description"></a><h5>
-<a name="id1144802"></a>
+<a name="id1271269"></a>
<a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -83,7 +78,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/expint_i.png" align="middle"></span>
</p>
<a name="math_toolkit.special.expint.expint_i.accuracy"></a><h5>
-<a name="id1145000"></a>
+<a name="id1271468"></a>
<a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.accuracy">Accuracy</a>
</h5>
<p>
@@ -95,7 +90,7 @@
error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.expint.expint_i.errors_in_the_function_expint_z_"></a><p class="title"><b>Table 46. Errors In the Function expint(z)</b></p>
+<a name="math_toolkit.special.expint.expint_i.errors_in_the_function_expint_z_"></a><p class="title"><b>Table 49. Errors In the Function expint(z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function expint(z)">
<colgroup>
<col>
@@ -207,7 +202,7 @@
slightly over the range [4,6].
</p>
<a name="math_toolkit.special.expint.expint_i.testing"></a><h5>
-<a name="id1145199"></a>
+<a name="id1271656"></a>
<a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.testing">Testing</a>
</h5>
<p>
@@ -222,7 +217,7 @@
check.
</p>
<a name="math_toolkit.special.expint.expint_i.implementation"></a><h5>
-<a name="id1145225"></a>
+<a name="id1271683"></a>
<a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.implementation">Implementation</a>
</h5>
<p>
@@ -252,7 +247,7 @@
a minimax rational approximation rescaled so that it is evaluated over
[-1,1]. Note that while the rational approximation over [0,6] converges
rapidly to the minimax solution it is rather ill-conditioned in practice.
- Cody and Thacher <sup>[<a name="id1145313" href="#ftn.id1145313" class="footnote">2</a>]</sup> experienced the same issue and converted the polynomials into
+ Cody and Thacher <sup>[<a name="id1271770" href="#ftn.id1271770" class="footnote">2</a>]</sup> experienced the same issue and converted the polynomials into
Chebeshev form to ensure stable computation. By experiment we found that
the polynomials are just as stable in polynomial as Chebyshev form, <span class="emphasis"><em>provided</em></span>
they are computed over the interval [-1,1].
@@ -282,7 +277,7 @@
</p>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id1145313" href="#id1145313" class="para">2</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id1271770" href="#id1271770" class="para">2</a>] </sup>
W. J. Cody and H. C. Thacher, Jr., Rational Chebyshev approximations
for the exponential integral E<sub>1</sub>(x), Math. Comp. 22 (1968), 641-649, and
W. J. Cody and H. C. Thacher, Jr., Chebyshev approximations for the exponential
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.expint.expint_n"></a><a class="link" href="expint_n.html" title="Exponential Integral En"> Exponential
- Integral En</a>
+<a name="math_toolkit.special.expint.expint_n"></a><a class="link" href="expint_n.html" title="Exponential Integral En">Exponential Integral
+ En</a>
</h4></div></div></div>
<a name="math_toolkit.special.expint.expint_n.synopsis"></a><h5>
-<a name="id1142284"></a>
+<a name="id1270011"></a>
<a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.synopsis">Synopsis</a>
</h5>
<p>
@@ -53,17 +53,12 @@
type calculation rules</em></span></a>: the return type is <code class="computeroutput"><span class="keyword">double</span></code> if T is an integer type, and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.expint.expint_n.description"></a><h5>
-<a name="id1142570"></a>
+<a name="id1270294"></a>
<a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -83,7 +78,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/expint2.png" align="middle"></span>
</p>
<a name="math_toolkit.special.expint.expint_n.accuracy"></a><h5>
-<a name="id1142795"></a>
+<a name="id1270518"></a>
<a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.accuracy">Accuracy</a>
</h5>
<p>
@@ -94,7 +89,7 @@
the one shown will have <a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.expint.expint_n.errors_in_the_function_expint_n__z_"></a><p class="title"><b>Table 45. Errors In the Function expint(n, z)</b></p>
+<a name="math_toolkit.special.expint.expint_n.errors_in_the_function_expint_n__z_"></a><p class="title"><b>Table 48. Errors In the Function expint(n, z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function expint(n, z)">
<colgroup>
<col>
@@ -225,7 +220,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.expint.expint_n.testing"></a><h5>
-<a name="id1143038"></a>
+<a name="id1270772"></a>
<a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.testing">Testing</a>
</h5>
<p>
@@ -240,7 +235,7 @@
check.
</p>
<a name="math_toolkit.special.expint.expint_n.implementation"></a><h5>
-<a name="id1143065"></a>
+<a name="id1270798"></a>
<a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,18 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.factorials"></a><a class="link" href="factorials.html" title="Factorials and Binomial Coefficients"> Factorials and Binomial
+<a name="math_toolkit.special.factorials"></a><a class="link" href="factorials.html" title="Factorials and Binomial Coefficients">Factorials and Binomial
Coefficients</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Factorial</span></dt>
-<dt><span class="section"><a href="factorials/sf_double_factorial.html">
- Double Factorial</a></span></dt>
-<dt><span class="section"><a href="factorials/sf_rising_factorial.html">
- Rising Factorial</a></span></dt>
-<dt><span class="section"><a href="factorials/sf_falling_factorial.html">
- Falling Factorial</a></span></dt>
-<dt><span class="section"><a href="factorials/sf_binomial.html"> Binomial
+<dt><span class="section">Factorial</span></dt>
+<dt><span class="section"><a href="factorials/sf_double_factorial.html">Double
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="factorials/sf_rising_factorial.html">Rising
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="factorials/sf_falling_factorial.html">Falling
+ Factorial</a></span></dt>
+<dt><span class="section"><a href="factorials/sf_binomial.html">Binomial
Coefficients</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_binomial"></a><a class="link" href="sf_binomial.html" title="Binomial Coefficients"> Binomial
+<a name="math_toolkit.special.factorials.sf_binomial"></a><a class="link" href="sf_binomial.html" title="Binomial Coefficients">Binomial
Coefficients</a>
</h4></div></div></div>
<p>
@@ -51,14 +51,9 @@
Requires k <= n.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
@@ -95,7 +90,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.special.factorials.sf_binomial.accuracy"></a><h5>
-<a name="id1091077"></a>
+<a name="id1219253"></a>
<a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.accuracy">Accuracy</a>
</h5>
<p>
@@ -104,14 +99,14 @@
function for larger arguments.
</p>
<a name="math_toolkit.special.factorials.sf_binomial.testing"></a><h5>
-<a name="id1091098"></a>
+<a name="id1219274"></a>
<a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.testing">Testing</a>
</h5>
<p>
The spot tests for the binomial coefficients use data generated by functions.wolfram.com.
</p>
<a name="math_toolkit.special.factorials.sf_binomial.implementation"></a><h5>
-<a name="id1091118"></a>
+<a name="id1219293"></a>
<a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_double_factorial"></a><a class="link" href="sf_double_factorial.html" title="Double Factorial">
- Double Factorial</a>
+<a name="math_toolkit.special.factorials.sf_double_factorial"></a><a class="link" href="sf_double_factorial.html" title="Double Factorial">Double
+ Factorial</a>
</h4></div></div></div>
<p>
@@ -48,14 +48,9 @@
Returns <code class="literal">i!!</code>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
@@ -78,9 +73,9 @@
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">double_factorial</span><span class="special">(</span><span class="number">2</span><span class="special">);</span></code>
</p>
<p>
- You will get a compiler error, ususally indicating that there is no such
- function to be found. Instead you need to specifiy the return type explicity
- and write:
+ You will get a (possibly perplexing) compiler error, ususally indicating
+ that there is no such function to be found. Instead you need to specifiy
+ the return type explicity and write:
</p>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">double_factorial</span><span class="special"><</span><span class="keyword">double</span><span class="special">>(</span><span class="number">2</span><span class="special">);</span></code>
@@ -91,10 +86,27 @@
or <code class="computeroutput"><span class="keyword">double</span></code> and not an integer
type - that would overflow far too easily!
</p>
+<p>
+ The source code <code class="computeroutput"><span class="identifier">static_assert</span></code>
+ and comment just after the will be:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">BOOST_STATIC_ASSERT</span><span class="special">(!</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_integral</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">value</span><span class="special">);</span>
+<span class="comment">// factorial<unsigned int>(n) is not implemented
+</span><span class="comment">// because it would overflow integral type T for too small n
+</span><span class="comment">// to be useful. Use instead a floating-point type,
+</span><span class="comment">// and convert to an unsigned type if essential, for example:
+</span><span class="comment">// unsigned int nfac = static_cast<unsigned int>(factorial<double>(n));
+</span><span class="comment">// See factorial documentation for more detail.
+</span></pre>
+<p>
+ </p>
</td></tr>
</table></div>
<a name="math_toolkit.special.factorials.sf_double_factorial.accuracy"></a><h5>
-<a name="id1085385"></a>
+<a name="id1216160"></a>
<a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.accuracy">Accuracy</a>
</h5>
<p>
@@ -102,14 +114,14 @@
so error rates should be no more than a couple of epsilon higher.
</p>
<a name="math_toolkit.special.factorials.sf_double_factorial.testing"></a><h5>
-<a name="id1085407"></a>
+<a name="id1216182"></a>
<a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.testing">Testing</a>
</h5>
<p>
The spot tests for the double factorial use data generated by functions.wolfram.com.
</p>
<a name="math_toolkit.special.factorials.sf_double_factorial.implementation"></a><h5>
-<a name="id1085426"></a>
+<a name="id1216201"></a>
<a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_factorial"></a><a class="link" href="sf_factorial.html" title="Factorial"> Factorial</a>
+<a name="math_toolkit.special.factorials.sf_factorial"></a><a class="link" href="sf_factorial.html" title="Factorial">Factorial</a>
</h4></div></div></div>
<a name="math_toolkit.special.factorials.sf_factorial.synopsis"></a><h5>
-<a name="id1084145"></a>
+<a name="id1214766"></a>
<a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.synopsis">Synopsis</a>
</h5>
<p>
@@ -54,7 +54,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.factorials.sf_factorial.description"></a><h5>
-<a name="id1084454"></a>
+<a name="id1215074"></a>
<a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.description">Description</a>
</h5>
<div class="important"><table border="0" summary="Important">
@@ -65,25 +65,45 @@
<tr><td align="left" valign="top">
<p>
The functions described below are templates where the template argument
- T can not be deduced from the arguments passed to the function. Therefore
+ T CANNOT be deduced from the arguments passed to the function. Therefore
if you write something like:
</p>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">factorial</span><span class="special">(</span><span class="number">2</span><span class="special">);</span></code>
</p>
<p>
- You will get a compiler error, ususally indicating that there is no such
- function to be found. Instead you need to specifiy the return type explicity
- and write:
+ You will get a (perhaps perplexing) compiler error, ususally indicating
+ that there is no such function to be found. Instead you need to specify
+ the return type explicity and write:
</p>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">factorial</span><span class="special"><</span><span class="keyword">double</span><span class="special">>(</span><span class="number">2</span><span class="special">);</span></code>
</p>
<p>
- So that the return type is known. Further, the template argument must
- be a real-valued type such as <code class="computeroutput"><span class="keyword">float</span></code>
- or <code class="computeroutput"><span class="keyword">double</span></code> and not an integer
- type - that would overflow far too easily!
+ So that the return type is known.
+ </p>
+<p>
+ Furthermore, the template argument must be a real-valued type such as
+ <code class="computeroutput"><span class="keyword">float</span></code> or <code class="computeroutput"><span class="keyword">double</span></code>
+ and not an integer type - that would overflow far too easily for quite
+ small values of parameter <code class="computeroutput"><span class="identifier">i</span></code>!
+ </p>
+<p>
+ The source code <code class="computeroutput"><span class="identifier">static_assert</span></code>
+ and comment just after the will be:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">BOOST_STATIC_ASSERT</span><span class="special">(!</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_integral</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">value</span><span class="special">);</span>
+<span class="comment">// factorial<unsigned int>(n) is not implemented
+</span><span class="comment">// because it would overflow integral type T for too small n
+</span><span class="comment">// to be useful. Use instead a floating-point type,
+</span><span class="comment">// and convert to an unsigned type if essential, for example:
+</span><span class="comment">// unsigned int nfac = static_cast<unsigned int>(factorial<double>(n));
+</span><span class="comment">// See factorial documentation for more detail.
+</span></pre>
+<p>
</p>
</td></tr>
</table></div>
@@ -97,14 +117,9 @@
Returns <code class="literal">i!</code>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
For <code class="literal">i <= max_factorial<T>::value</code> this is implemented
@@ -142,7 +157,7 @@
the size of further tables that depend on the factorials.
</p>
<a name="math_toolkit.special.factorials.sf_factorial.accuracy"></a><h5>
-<a name="id1084922"></a>
+<a name="id1215626"></a>
<a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.accuracy">Accuracy</a>
</h5>
<p>
@@ -151,7 +166,7 @@
will be the same as for <a class="link" href="../sf_gamma/tgamma.html" title="Gamma">tgamma</a>.
</p>
<a name="math_toolkit.special.factorials.sf_factorial.testing"></a><h5>
-<a name="id1084965"></a>
+<a name="id1215669"></a>
<a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.testing">Testing</a>
</h5>
<p>
@@ -160,7 +175,7 @@
function handle those cases already.
</p>
<a name="math_toolkit.special.factorials.sf_factorial.implementation"></a><h5>
-<a name="id1084990"></a>
+<a name="id1215693"></a>
<a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_falling_factorial"></a><a class="link" href="sf_falling_factorial.html" title="Falling Factorial">
- Falling Factorial</a>
+<a name="math_toolkit.special.factorials.sf_falling_factorial"></a><a class="link" href="sf_falling_factorial.html" title="Falling Factorial">Falling
+ Factorial</a>
</h4></div></div></div>
<p>
@@ -57,14 +57,9 @@
however.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
@@ -76,7 +71,7 @@
the type of the result is T.
</p>
<a name="math_toolkit.special.factorials.sf_falling_factorial.accuracy"></a><h5>
-<a name="id1090597"></a>
+<a name="id1218774"></a>
<a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.accuracy">Accuracy</a>
</h5>
<p>
@@ -84,14 +79,14 @@
function.
</p>
<a name="math_toolkit.special.factorials.sf_falling_factorial.testing"></a><h5>
-<a name="id1090623"></a>
+<a name="id1218801"></a>
<a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.testing">Testing</a>
</h5>
<p>
The spot tests for the falling factorials use data generated by functions.wolfram.com.
</p>
<a name="math_toolkit.special.factorials.sf_falling_factorial.implementation"></a><h5>
-<a name="id1090642"></a>
+<a name="id1218821"></a>
<a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_rising_factorial"></a><a class="link" href="sf_rising_factorial.html" title="Rising Factorial">
- Rising Factorial</a>
+<a name="math_toolkit.special.factorials.sf_rising_factorial"></a><a class="link" href="sf_rising_factorial.html" title="Rising Factorial">Rising
+ Factorial</a>
</h4></div></div></div>
<p>
@@ -61,14 +61,9 @@
negative as well as positive.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
@@ -80,7 +75,7 @@
the type of the result is T.
</p>
<a name="math_toolkit.special.factorials.sf_rising_factorial.accuracy"></a><h5>
-<a name="id1090201"></a>
+<a name="id1218381"></a>
<a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.accuracy">Accuracy</a>
</h5>
<p>
@@ -88,14 +83,14 @@
function.
</p>
<a name="math_toolkit.special.factorials.sf_rising_factorial.testing"></a><h5>
-<a name="id1090227"></a>
+<a name="id1218409"></a>
<a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.testing">Testing</a>
</h5>
<p>
The spot tests for the rising factorials use data generated by functions.wolfram.com.
</p>
<a name="math_toolkit.special.factorials.sf_rising_factorial.implementation"></a><h5>
-<a name="id1090246"></a>
+<a name="id1218428"></a>
<a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,14 +24,14 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.inv_hyper"></a><a class="link" href="inv_hyper.html" title="Inverse Hyperbolic Functions"> Inverse Hyperbolic Functions</a>
+<a name="math_toolkit.special.inv_hyper"></a><a class="link" href="inv_hyper.html" title="Inverse Hyperbolic Functions">Inverse Hyperbolic Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="inv_hyper/inv_hyper_over.html"> Inverse
+<dt><span class="section"><a href="inv_hyper/inv_hyper_over.html">Inverse
Hyperbolic Functions Overview</a></span></dt>
-<dt><span class="section"> acosh</span></dt>
-<dt><span class="section"> asinh</span></dt>
-<dt><span class="section"> atanh</span></dt>
+<dt><span class="section">acosh</span></dt>
+<dt><span class="section">asinh</span></dt>
+<dt><span class="section">atanh</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.acosh"></a><a class="link" href="acosh.html" title="acosh"> acosh</a>
+<a name="math_toolkit.special.inv_hyper.acosh"></a><a class="link" href="acosh.html" title="acosh">acosh</a>
</h4></div></div></div>
<p>
@@ -54,27 +54,22 @@
otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/acosh.png" align="middle"></span>
</p>
<a name="math_toolkit.special.inv_hyper.acosh.accuracy"></a><h5>
-<a name="id1154237"></a>
+<a name="id1279901"></a>
<a class="link" href="acosh.html#math_toolkit.special.inv_hyper.acosh.accuracy">Accuracy</a>
</h5>
<p>
Generally accuracy is to within 1 or 2 epsilon across all supported platforms.
</p>
<a name="math_toolkit.special.inv_hyper.acosh.testing"></a><h5>
-<a name="id1154253"></a>
+<a name="id1279918"></a>
<a class="link" href="acosh.html#math_toolkit.special.inv_hyper.acosh.testing">Testing</a>
</h5>
<p>
@@ -90,7 +85,7 @@
to at least 50 decimal digits.
</p>
<a name="math_toolkit.special.inv_hyper.acosh.implementation"></a><h5>
-<a name="id1154298"></a>
+<a name="id1279962"></a>
<a class="link" href="acosh.html#math_toolkit.special.inv_hyper.acosh.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.asinh"></a><a class="link" href="asinh.html" title="asinh"> asinh</a>
+<a name="math_toolkit.special.inv_hyper.asinh"></a><a class="link" href="asinh.html" title="asinh">asinh</a>
</h4></div></div></div>
<p>
@@ -52,24 +52,19 @@
<span class="inlinemediaobject"><img src="../../../../graphs/asinh.png" align="middle"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.inv_hyper.asinh.accuracy"></a><h5>
-<a name="id1154705"></a>
+<a name="id1280366"></a>
<a class="link" href="asinh.html#math_toolkit.special.inv_hyper.asinh.accuracy">Accuracy</a>
</h5>
<p>
Generally accuracy is to within 1 or 2 epsilon across all supported platforms.
</p>
<a name="math_toolkit.special.inv_hyper.asinh.testing"></a><h5>
-<a name="id1154721"></a>
+<a name="id1280382"></a>
<a class="link" href="asinh.html#math_toolkit.special.inv_hyper.asinh.testing">Testing</a>
</h5>
<p>
@@ -85,7 +80,7 @@
to at least 50 decimal digits.
</p>
<a name="math_toolkit.special.inv_hyper.asinh.implementation"></a><h5>
-<a name="id1154766"></a>
+<a name="id1280427"></a>
<a class="link" href="asinh.html#math_toolkit.special.inv_hyper.asinh.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.atanh"></a><a class="link" href="atanh.html" title="atanh"> atanh</a>
+<a name="math_toolkit.special.inv_hyper.atanh"></a><a class="link" href="atanh.html" title="atanh">atanh</a>
</h4></div></div></div>
<p>
@@ -44,26 +44,21 @@
hyperbolic tangent function</a>, at x.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
If x is in the range <code class="literal">]-∞;-1[</code> or in the range <code class="literal">]+1;+∞[</code>
then returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- If x is in the range <code class="literal">[-1;-1+ε[</code>, then the result of -<a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε ​
+ If x is in the range <code class="literal">[-1;-1+ε[</code>, then the result of -<a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε  
denoting
numeric_limits<T>::epsilon().
</p>
<p>
- If x is in the range <code class="literal">]+1-ε;+1]</code>, then the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε ​
+ If x is in the range <code class="literal">]+1-ε;+1]</code>, then the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε  
denoting
numeric_limits<T>::epsilon().
</p>
@@ -76,14 +71,14 @@
<span class="inlinemediaobject"><img src="../../../../graphs/atanh.png" align="middle"></span>
</p>
<a name="math_toolkit.special.inv_hyper.atanh.accuracy"></a><h5>
-<a name="id1155216"></a>
+<a name="id1280873"></a>
<a class="link" href="atanh.html#math_toolkit.special.inv_hyper.atanh.accuracy">Accuracy</a>
</h5>
<p>
Generally accuracy is to within 1 or 2 epsilon across all supported platforms.
</p>
<a name="math_toolkit.special.inv_hyper.atanh.testing"></a><h5>
-<a name="id1155233"></a>
+<a name="id1280890"></a>
<a class="link" href="atanh.html#math_toolkit.special.inv_hyper.atanh.testing">Testing</a>
</h5>
<p>
@@ -99,7 +94,7 @@
to at least 50 decimal digits.
</p>
<a name="math_toolkit.special.inv_hyper.atanh.implementation"></a><h5>
-<a name="id1155277"></a>
+<a name="id1280934"></a>
<a class="link" href="atanh.html#math_toolkit.special.inv_hyper.atanh.implementation">Implementation</a>
</h5>
<p>
@@ -116,7 +111,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/atanh1.png"></span>
</p>
<p>
- or it's equivalent form:
+ or its equivalent form:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../equations/atanh3.png"></span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.inv_hyper_over"></a><a class="link" href="inv_hyper_over.html" title="Inverse Hyperbolic Functions Overview"> Inverse
+<a name="math_toolkit.special.inv_hyper.inv_hyper_over"></a><a class="link" href="inv_hyper_over.html" title="Inverse Hyperbolic Functions Overview">Inverse
Hyperbolic Functions Overview</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,17 +24,17 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.powers"></a><a class="link" href="powers.html" title="Logs, Powers, Roots and Exponentials"> Logs, Powers, Roots and
+<a name="math_toolkit.special.powers"></a><a class="link" href="powers.html" title="Logs, Powers, Roots and Exponentials">Logs, Powers, Roots and
Exponentials</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> log1p</span></dt>
-<dt><span class="section"> expm1</span></dt>
-<dt><span class="section"> cbrt</span></dt>
-<dt><span class="section"> sqrt1pm1</span></dt>
-<dt><span class="section"> powm1</span></dt>
-<dt><span class="section"> hypot</span></dt>
-<dt><span class="section"><a href="powers/ct_pow.html"> Compile Time Power
+<dt><span class="section">log1p</span></dt>
+<dt><span class="section">expm1</span></dt>
+<dt><span class="section">cbrt</span></dt>
+<dt><span class="section">sqrt1pm1</span></dt>
+<dt><span class="section">powm1</span></dt>
+<dt><span class="section">hypot</span></dt>
+<dt><span class="section"><a href="powers/ct_pow.html">Compile Time Power
of a Runtime Base</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.cbrt"></a><a class="link" href="cbrt.html" title="cbrt"> cbrt</a>
+<a name="math_toolkit.special.powers.cbrt"></a><a class="link" href="cbrt.html" title="cbrt">cbrt</a>
</h4></div></div></div>
<p>
@@ -52,14 +52,9 @@
when <span class="emphasis"><em>x</em></span> is an integer type and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
Implemented using Halley iteration.
@@ -71,7 +66,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/cbrt.png" align="middle"></span>
</p>
<a name="math_toolkit.special.powers.cbrt.accuracy"></a><h5>
-<a name="id1147832"></a>
+<a name="id1273917"></a>
<a class="link" href="cbrt.html#math_toolkit.special.powers.cbrt.accuracy">Accuracy</a>
</h5>
<p>
@@ -79,7 +74,7 @@
should have approximately 2 epsilon accuracy.
</p>
<a name="math_toolkit.special.powers.cbrt.testing"></a><h5>
-<a name="id1147856"></a>
+<a name="id1273941"></a>
<a class="link" href="cbrt.html#math_toolkit.special.powers.cbrt.testing">Testing</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.ct_pow"></a><a class="link" href="ct_pow.html" title="Compile Time Power of a Runtime Base"> Compile Time Power
+<a name="math_toolkit.special.powers.ct_pow"></a><a class="link" href="ct_pow.html" title="Compile Time Power of a Runtime Base">Compile Time Power
of a Runtime Base</a>
</h4></div></div></div>
<p>
@@ -32,7 +32,7 @@
computes the compile-time integral power of a run-time base.
</p>
<a name="math_toolkit.special.powers.ct_pow.synopsis"></a><h5>
-<a name="id1149008"></a>
+<a name="id1275081"></a>
<a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.synopsis">Synopsis</a>
</h5>
<p>
@@ -49,7 +49,7 @@
<span class="special">}}</span>
</pre>
<a name="math_toolkit.special.powers.ct_pow.rationale_and_usage"></a><h5>
-<a name="id1149270"></a>
+<a name="id1275342"></a>
<a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.rationale_and_usage">Rationale
and Usage</a>
</h5>
@@ -91,7 +91,7 @@
Only 3 different products were actually computed.
</p>
<a name="math_toolkit.special.powers.ct_pow.return_type"></a><h5>
-<a name="id1149542"></a>
+<a name="id1275616"></a>
<a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.return_type">Return Type</a>
</h5>
<p>
@@ -112,21 +112,16 @@
</li>
</ul></div>
<a name="math_toolkit.special.powers.ct_pow.policies"></a><h5>
-<a name="id1149636"></a>
+<a name="id1275710"></a>
<a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.policies">Policies</a>
</h5>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.powers.ct_pow.error_handling"></a><h5>
-<a name="id1149666"></a>
+<a name="id1276975"></a>
<a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.error_handling">Error
Handling</a>
</h5>
@@ -232,7 +227,7 @@
<span class="keyword">double</span> <span class="identifier">result</span> <span class="special">=</span> <span class="identifier">pow</span><span class="special"><-</span><span class="number">5</span><span class="special">>(</span><span class="identifier">base</span><span class="special">);</span>
</pre>
<a name="math_toolkit.special.powers.ct_pow.acknowledgements"></a><h5>
-<a name="id1151189"></a>
+<a name="id1277815"></a>
<a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.acknowledgements">Acknowledgements</a>
</h5>
<p>
@@ -243,7 +238,7 @@
improving the implementation.
</p>
<a name="math_toolkit.special.powers.ct_pow.references"></a><h5>
-<a name="id1151209"></a>
+<a name="id1277835"></a>
<a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.references">References</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.expm1"></a><a class="link" href="expm1.html" title="expm1"> expm1</a>
+<a name="math_toolkit.special.powers.expm1"></a><a class="link" href="expm1.html" title="expm1">expm1</a>
</h4></div></div></div>
<p>
@@ -52,14 +52,9 @@
when <span class="emphasis"><em>x</em></span> is an integer type and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
For small x, then <code class="computeroutput">e<sup>x</sup></code> is very close to 1, as a result calculating <code class="computeroutput">e<sup>x</sup> - 1</code> results in
@@ -80,7 +75,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/expm1.png" align="middle"></span>
</p>
<a name="math_toolkit.special.powers.expm1.accuracy"></a><h5>
-<a name="id1146513"></a>
+<a name="id1273577"></a>
<a class="link" href="expm1.html#math_toolkit.special.powers.expm1.accuracy">Accuracy</a>
</h5>
<p>
@@ -88,7 +83,7 @@
should have approximately 1 epsilon accuracy.
</p>
<a name="math_toolkit.special.powers.expm1.testing"></a><h5>
-<a name="id1147513"></a>
+<a name="id1273601"></a>
<a class="link" href="expm1.html#math_toolkit.special.powers.expm1.testing">Testing</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.hypot"></a><a class="link" href="hypot.html" title="hypot"> hypot</a>
+<a name="math_toolkit.special.powers.hypot"></a><a class="link" href="hypot.html" title="hypot">hypot</a>
</h4></div></div></div>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">hypot</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">y</span><span class="special">);</span>
@@ -43,14 +43,9 @@
types.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
When calculating <span class="inlinemediaobject"><img src="../../../../equations/hypot.png"></span> it's quite easy for the intermediate terms to
@@ -58,7 +53,7 @@
representable.
</p>
<a name="math_toolkit.special.powers.hypot.implementation"></a><h5>
-<a name="id1148924"></a>
+<a name="id1274997"></a>
<a class="link" href="hypot.html#math_toolkit.special.powers.hypot.implementation">Implementation</a>
</h5>
<p>
@@ -67,7 +62,7 @@
arguments if this is not the case).
</p>
<p>
- Then if <span class="emphasis"><em>x * ε ​ >= y</em></span> we can simply return <span class="emphasis"><em>x</em></span>.
+ Then if <span class="emphasis"><em>x * ε   >= y</em></span> we can simply return <span class="emphasis"><em>x</em></span>.
</p>
<p>
Otherwise the result is given by:
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.log1p"></a><a class="link" href="log1p.html" title="log1p"> log1p</a>
+<a name="math_toolkit.special.powers.log1p"></a><a class="link" href="log1p.html" title="log1p">log1p</a>
</h4></div></div></div>
<p>
@@ -52,14 +52,9 @@
when <span class="emphasis"><em>x</em></span> is an integer type and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
There are many situations where it is desirable to compute <code class="computeroutput"><span class="identifier">log</span><span class="special">(</span><span class="identifier">x</span><span class="special">+</span><span class="number">1</span><span class="special">)</span></code>. However, for small <code class="computeroutput"><span class="identifier">x</span></code>
@@ -93,7 +88,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/log1p.png" align="middle"></span>
</p>
<a name="math_toolkit.special.powers.log1p.accuracy"></a><h5>
-<a name="id1146107"></a>
+<a name="id1272560"></a>
<a class="link" href="log1p.html#math_toolkit.special.powers.log1p.accuracy">Accuracy</a>
</h5>
<p>
@@ -101,7 +96,7 @@
should have approximately 1 epsilon accuracy.
</p>
<a name="math_toolkit.special.powers.log1p.testing"></a><h5>
-<a name="id1146131"></a>
+<a name="id1272584"></a>
<a class="link" href="log1p.html#math_toolkit.special.powers.log1p.testing">Testing</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.powm1"></a><a class="link" href="powm1.html" title="powm1"> powm1</a>
+<a name="math_toolkit.special.powers.powm1"></a><a class="link" href="powm1.html" title="powm1">powm1</a>
</h4></div></div></div>
<p>
@@ -51,14 +51,9 @@
type calculation rules</em></span></a> when T1 and T2 are dufferent types.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
There are two domains where this is useful: when y is very small, or when
@@ -74,14 +69,14 @@
<span class="inlinemediaobject"><img src="../../../../graphs/powm1.png" align="middle"></span>
</p>
<a name="math_toolkit.special.powers.powm1.accuracy"></a><h5>
-<a name="id1148621"></a>
+<a name="id1274698"></a>
<a class="link" href="powm1.html#math_toolkit.special.powers.powm1.accuracy">Accuracy</a>
</h5>
<p>
Should have approximately 2-3 epsilon accuracy.
</p>
<a name="math_toolkit.special.powers.powm1.testing"></a><h5>
-<a name="id1148637"></a>
+<a name="id1274715"></a>
<a class="link" href="powm1.html#math_toolkit.special.powers.powm1.testing">Testing</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.sqrt1pm1"></a><a class="link" href="sqrt1pm1.html" title="sqrt1pm1"> sqrt1pm1</a>
+<a name="math_toolkit.special.powers.sqrt1pm1"></a><a class="link" href="sqrt1pm1.html" title="sqrt1pm1">sqrt1pm1</a>
</h4></div></div></div>
<p>
@@ -52,14 +52,9 @@
when <span class="emphasis"><em>x</em></span> is an integer type and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
This function is useful when you need the difference between sqrt(x) and
@@ -76,7 +71,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/sqrt1pm1.png" align="middle"></span>
</p>
<a name="math_toolkit.special.powers.sqrt1pm1.accuracy"></a><h5>
-<a name="id1148225"></a>
+<a name="id1274306"></a>
<a class="link" href="sqrt1pm1.html#math_toolkit.special.powers.sqrt1pm1.accuracy">Accuracy</a>
</h5>
<p>
@@ -84,7 +79,7 @@
should have approximately 3 epsilon accuracy.
</p>
<a name="math_toolkit.special.powers.sqrt1pm1.testing"></a><h5>
-<a name="id1148249"></a>
+<a name="id1274330"></a>
<a class="link" href="sqrt1pm1.html#math_toolkit.special.powers.sqrt1pm1.testing">Testing</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,15 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_beta"></a><a class="link" href="sf_beta.html" title="Beta Functions"> Beta Functions</a>
+<a name="math_toolkit.special.sf_beta"></a><a class="link" href="sf_beta.html" title="Beta Functions">Beta Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Beta</span></dt>
-<dt><span class="section"><a href="sf_beta/ibeta_function.html"> Incomplete
+<dt><span class="section">Beta</span></dt>
+<dt><span class="section"><a href="sf_beta/ibeta_function.html">Incomplete
Beta Functions</a></span></dt>
-<dt><span class="section"><a href="sf_beta/ibeta_inv_function.html"> The
+<dt><span class="section"><a href="sf_beta/ibeta_inv_function.html">The
Incomplete Beta Function Inverses</a></span></dt>
-<dt><span class="section"><a href="sf_beta/beta_derivative.html"> Derivative
+<dt><span class="section"><a href="sf_beta/beta_derivative.html">Derivative
of the Incomplete Beta Function</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.beta_derivative"></a><a class="link" href="beta_derivative.html" title="Derivative of the Incomplete Beta Function"> Derivative
+<a name="math_toolkit.special.sf_beta.beta_derivative"></a><a class="link" href="beta_derivative.html" title="Derivative of the Incomplete Beta Function">Derivative
of the Incomplete Beta Function</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_beta.beta_derivative.synopsis"></a><h5>
-<a name="id1104931"></a>
+<a name="id1232767"></a>
<a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.synopsis">Synopsis</a>
</h5>
<p>
@@ -49,7 +49,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_beta.beta_derivative.description"></a><h5>
-<a name="id1105265"></a>
+<a name="id1233102"></a>
<a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.description">Description</a>
</h5>
<p>
@@ -66,24 +66,19 @@
types.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.sf_beta.beta_derivative.accuracy"></a><h5>
-<a name="id1105345"></a>
+<a name="id1233176"></a>
<a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.accuracy">Accuracy</a>
</h5>
<p>
Almost identical to the incomplete beta function <a class="link" href="ibeta_function.html" title="Incomplete Beta Functions">ibeta</a>.
</p>
<a name="math_toolkit.special.sf_beta.beta_derivative.implementation"></a><h5>
-<a name="id1105370"></a>
+<a name="id1233202"></a>
<a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.beta_function"></a><a class="link" href="beta_function.html" title="Beta"> Beta</a>
+<a name="math_toolkit.special.sf_beta.beta_function"></a><a class="link" href="beta_function.html" title="Beta">Beta</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_beta.beta_function.synopsis"></a><h5>
-<a name="id1091208"></a>
+<a name="id1219383"></a>
<a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.synopsis">Synopsis</a>
</h5>
<p>
@@ -48,7 +48,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_beta.beta_function.description"></a><h5>
-<a name="id1091487"></a>
+<a name="id1219663"></a>
<a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.description">Description</a>
</h5>
<p>
@@ -61,14 +61,9 @@
<span class="inlinemediaobject"><img src="../../../../graphs/beta.png" align="middle"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
There are effectively two versions of this function internally: a fully
@@ -86,7 +81,7 @@
type calculation rules</em></span></a> when T1 and T2 are different types.
</p>
<a name="math_toolkit.special.sf_beta.beta_function.accuracy"></a><h5>
-<a name="id1091599"></a>
+<a name="id1219775"></a>
<a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.accuracy">Accuracy</a>
</h5>
<p>
@@ -98,7 +93,7 @@
zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_beta.beta_function.peak_errors_in_the_beta_function"></a><p class="title"><b>Table 22. Peak Errors In the Beta Function</b></p>
+<a name="math_toolkit.special.sf_beta.beta_function.peak_errors_in_the_beta_function"></a><p class="title"><b>Table 25. Peak Errors In the Beta Function</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Beta Function">
<colgroup>
<col>
@@ -244,7 +239,7 @@
very small.
</p>
<a name="math_toolkit.special.sf_beta.beta_function.testing"></a><h5>
-<a name="id1091863"></a>
+<a name="id1220024"></a>
<a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.testing">Testing</a>
</h5>
<p>
@@ -253,7 +248,7 @@
at 1000-bit precision.
</p>
<a name="math_toolkit.special.sf_beta.beta_function.implementation"></a><h5>
-<a name="id1091887"></a>
+<a name="id1220048"></a>
<a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.ibeta_function"></a><a class="link" href="ibeta_function.html" title="Incomplete Beta Functions"> Incomplete
+<a name="math_toolkit.special.sf_beta.ibeta_function"></a><a class="link" href="ibeta_function.html" title="Incomplete Beta Functions">Incomplete
Beta Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_beta.ibeta_function.synopsis"></a><h5>
-<a name="id1092121"></a>
+<a name="id1220570"></a>
<a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.synopsis">Synopsis</a>
</h5>
<p>
@@ -67,7 +67,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_beta.ibeta_function.description"></a><h5>
-<a name="id1094852"></a>
+<a name="id1221586"></a>
<a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.description">Description</a>
</h5>
<p>
@@ -99,14 +99,9 @@
types.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ibeta</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">x</span><span class="special">);</span>
@@ -163,7 +158,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/ibeta2.png"></span>
</p>
<a name="math_toolkit.special.sf_beta.ibeta_function.accuracy"></a><h5>
-<a name="id1096026"></a>
+<a name="id1223849"></a>
<a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.accuracy">Accuracy</a>
</h5>
<p>
@@ -182,7 +177,7 @@
with the wider exponent range of the long double types.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_ibeta_a_b_x_"></a><p class="title"><b>Table 23. Errors In the Function ibeta(a,b,x)</b></p>
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_ibeta_a_b_x_"></a><p class="title"><b>Table 26. Errors In the Function ibeta(a,b,x)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function ibeta(a,b,x)">
<colgroup>
<col>
@@ -274,13 +269,13 @@
</td>
<td>
<p>
- Peak=4x10<sup>3</sup> ​ Mean=203
+ Peak=4x10<sup>3</sup>   Mean=203
</p>
<p>
- (GSL Peak~3x10<sup>5</sup> ​ Mean~2x10<sup>4</sup> ​)
+ (GSL Peak~3x10<sup>5</sup>   Mean~2x10<sup>4</sup>  )
</p>
<p>
- (Cephes Peak~5x10<sup>5</sup> ​ Mean~2x10<sup>4</sup> ​)
+ (Cephes Peak~5x10<sup>5</sup>   Mean~2x10<sup>4</sup>  )
</p>
</td>
</tr>
@@ -307,7 +302,7 @@
</td>
<td>
<p>
- Peak~5x10<sup>4</sup> ​ Mean=3x10<sup>3</sup> ​
+ Peak~5x10<sup>4</sup>   Mean=3x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -334,7 +329,7 @@
</td>
<td>
<p>
- Peak~5x10<sup>4</sup> ​ Mean=3x10<sup>3</sup> ​
+ Peak~5x10<sup>4</sup>   Mean=3x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -361,7 +356,7 @@
</td>
<td>
<p>
- Peak~2x10<sup>4</sup> ​ Mean=1x10<sup>3</sup> ​
+ Peak~2x10<sup>4</sup>   Mean=1x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -369,7 +364,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_ibetac_a_b_x_"></a><p class="title"><b>Table 24. Errors In the Function ibetac(a,b,x)</b></p>
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_ibetac_a_b_x_"></a><p class="title"><b>Table 27. Errors In the Function ibetac(a,b,x)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function ibetac(a,b,x)">
<colgroup>
<col>
@@ -447,7 +442,7 @@
</td>
<td>
<p>
- Peak=3x10<sup>3</sup> ​ Mean=159
+ Peak=3x10<sup>3</sup>   Mean=159
</p>
</td>
</tr>
@@ -474,7 +469,7 @@
</td>
<td>
<p>
- Peak~9x10<sup>4</sup> ​ Mean=3x10<sup>3</sup> ​
+ Peak~9x10<sup>4</sup>   Mean=3x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -501,7 +496,7 @@
</td>
<td>
<p>
- Peak~9x10<sup>4</sup> ​ Mean=3x10<sup>3</sup> ​
+ Peak~9x10<sup>4</sup>   Mean=3x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -528,7 +523,7 @@
</td>
<td>
<p>
- Peak~3x10<sup>4</sup> ​ Mean=1x10<sup>3</sup> ​
+ Peak~3x10<sup>4</sup>   Mean=1x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -536,7 +531,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_beta_a__b__x_"></a><p class="title"><b>Table 25. Errors In the Function beta(a, b, x)</b></p>
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_beta_a__b__x_"></a><p class="title"><b>Table 28. Errors In the Function beta(a, b, x)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function beta(a, b, x)">
<colgroup>
<col>
@@ -641,7 +636,7 @@
</td>
<td>
<p>
- Peak~7x10<sup>4</sup> ​ Mean=3x10<sup>3</sup> ​
+ Peak~7x10<sup>4</sup>   Mean=3x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -668,7 +663,7 @@
</td>
<td>
<p>
- Peak~7x10<sup>4</sup> ​ Mean=3x10<sup>3</sup> ​
+ Peak~7x10<sup>4</sup>   Mean=3x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -695,7 +690,7 @@
</td>
<td>
<p>
- Peak~6x10<sup>4</sup> ​ Mean=3x10<sup>3</sup> ​
+ Peak~6x10<sup>4</sup>   Mean=3x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -703,7 +698,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_betac_a_b_x_"></a><p class="title"><b>Table 26. Errors In the Function betac(a,b,x)</b></p>
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_betac_a_b_x_"></a><p class="title"><b>Table 29. Errors In the Function betac(a,b,x)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function betac(a,b,x)">
<colgroup>
<col>
@@ -781,7 +776,7 @@
</td>
<td>
<p>
- Peak=4x10<sup>3</sup> ​ Mean=113
+ Peak=4x10<sup>3</sup>   Mean=113
</p>
</td>
</tr>
@@ -808,7 +803,7 @@
</td>
<td>
<p>
- Peak~1x10<sup>5</sup> ​ Mean=5x10<sup>3</sup> ​
+ Peak~1x10<sup>5</sup>   Mean=5x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -835,7 +830,7 @@
</td>
<td>
<p>
- Peak~1x10<sup>5</sup> ​ Mean=5x10<sup>3</sup> ​
+ Peak~1x10<sup>5</sup>   Mean=5x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -862,7 +857,7 @@
</td>
<td>
<p>
- Peak~9x10<sup>4</sup> ​ Mean=5x10<sup>3</sup> ​
+ Peak~9x10<sup>4</sup>   Mean=5x10<sup>3</sup>  
</p>
</td>
</tr>
@@ -870,7 +865,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.sf_beta.ibeta_function.testing"></a><h5>
-<a name="id1097271"></a>
+<a name="id1225028"></a>
<a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.testing">Testing</a>
</h5>
<p>
@@ -888,7 +883,7 @@
have test data that is fully independent of the code.
</p>
<a name="math_toolkit.special.sf_beta.ibeta_function.implementation"></a><h5>
-<a name="id1097307"></a>
+<a name="id1225064"></a>
<a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.ibeta_inv_function"></a><a class="link" href="ibeta_inv_function.html" title="The Incomplete Beta Function Inverses"> The
+<a name="math_toolkit.special.sf_beta.ibeta_inv_function"></a><a class="link" href="ibeta_inv_function.html" title="The Incomplete Beta Function Inverses">The
Incomplete Beta Function Inverses</a>
</h4></div></div></div>
<p>
@@ -87,7 +87,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.description"></a><h5>
-<a name="id1099642"></a>
+<a name="id1227619"></a>
<a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.description">Description</a>
</h5>
<p>
@@ -97,14 +97,9 @@
incomplete beta (p) or its complement (q).
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<div class="tip"><table border="0" summary="Tip">
<tr>
@@ -166,14 +161,9 @@
1</em></span>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ibetac_inv</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">q</span><span class="special">);</span>
@@ -209,14 +199,9 @@
1</em></span>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ibeta_inva</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">p</span><span class="special">);</span>
@@ -235,14 +220,9 @@
and <span class="emphasis"><em>0 <= p <= 1</em></span>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ibetac_inva</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">p</span><span class="special">);</span>
@@ -261,14 +241,9 @@
and <span class="emphasis"><em>0 <= q <= 1</em></span>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ibeta_invb</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">p</span><span class="special">);</span>
@@ -287,14 +262,9 @@
and <span class="emphasis"><em>0 <= p <= 1</em></span>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T3</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">ibetac_invb</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T3</span> <span class="identifier">p</span><span class="special">);</span>
@@ -313,17 +283,12 @@
and <span class="emphasis"><em>0 <= q <= 1</em></span>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.accuracy"></a><h5>
-<a name="id1103459"></a>
+<a name="id1230865"></a>
<a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.accuracy">Accuracy</a>
</h5>
<p>
@@ -335,7 +300,7 @@
or <code class="computeroutput"><span class="number">1</span></code>.
</p>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.testing"></a><h5>
-<a name="id1103500"></a>
+<a name="id1230907"></a>
<a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.testing">Testing</a>
</h5>
<p>
@@ -359,7 +324,7 @@
</li>
</ul></div>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_ibeta_inv_and_ibetac_inv"></a><h5>
-<a name="id1103556"></a>
+<a name="id1230963"></a>
<a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_ibeta_inv_and_ibetac_inv">Implementation
of ibeta_inv and ibetac_inv</a>
</h5>
@@ -527,7 +492,7 @@
rapidly converges on the true value.
</p>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_inverses_on_the_a_and_b_parameters"></a><h5>
-<a name="id1104868"></a>
+<a name="id1232706"></a>
<a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_inverses_on_the_a_and_b_parameters">Implementation
of inverses on the a and b parameters</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,12 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_erf"></a><a class="link" href="sf_erf.html" title="Error Functions"> Error Functions</a>
+<a name="math_toolkit.special.sf_erf"></a><a class="link" href="sf_erf.html" title="Error Functions">Error Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="sf_erf/error_function.html"> Error
- Functions</a></span></dt>
-<dt><span class="section"><a href="sf_erf/error_inv.html"> Error Function
+<dt><span class="section">Error Functions</span></dt>
+<dt><span class="section"><a href="sf_erf/error_inv.html">Error Function
Inverses</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_erf.error_function"></a><a class="link" href="error_function.html" title="Error Functions"> Error
- Functions</a>
+<a name="math_toolkit.special.sf_erf.error_function"></a><a class="link" href="error_function.html" title="Error Functions">Error Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_erf.error_function.synopsis"></a><h5>
-<a name="id1105415"></a>
+<a name="id1233247"></a>
<a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.synopsis">Synopsis</a>
</h5>
<p>
@@ -59,17 +58,12 @@
type calculation rules</em></span></a>: the return type is <code class="computeroutput"><span class="keyword">double</span></code> if T is an integer type, and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.sf_erf.error_function.description"></a><h5>
-<a name="id1105798"></a>
+<a name="id1233626"></a>
<a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -106,7 +100,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/erfc.png" align="middle"></span>
</p>
<a name="math_toolkit.special.sf_erf.error_function.accuracy"></a><h5>
-<a name="id1106186"></a>
+<a name="id1234014"></a>
<a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.accuracy">Accuracy</a>
</h5>
<p>
@@ -119,7 +113,7 @@
the one shown will have <a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_erf.error_function.errors_in_the_function_erf_z_"></a><p class="title"><b>Table 27. Errors In the Function erf(z)</b></p>
+<a name="math_toolkit.special.sf_erf.error_function.errors_in_the_function_erf_z_"></a><p class="title"><b>Table 30. Errors In the Function erf(z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function erf(z)">
<colgroup>
<col>
@@ -325,7 +319,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_erf.error_function.errors_in_the_function_erfc_z_"></a><p class="title"><b>Table 28. Errors In the Function erfc(z)</b></p>
+<a name="math_toolkit.special.sf_erf.error_function.errors_in_the_function_erfc_z_"></a><p class="title"><b>Table 31. Errors In the Function erfc(z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function erfc(z)">
<colgroup>
<col>
@@ -531,7 +525,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.sf_erf.error_function.testing"></a><h5>
-<a name="id1108310"></a>
+<a name="id1235470"></a>
<a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.testing">Testing</a>
</h5>
<p>
@@ -546,7 +540,7 @@
check.
</p>
<a name="math_toolkit.special.sf_erf.error_function.implementation"></a><h5>
-<a name="id1108339"></a>
+<a name="id1235499"></a>
<a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_erf.error_inv"></a><a class="link" href="error_inv.html" title="Error Function Inverses"> Error Function
+<a name="math_toolkit.special.sf_erf.error_inv"></a><a class="link" href="error_inv.html" title="Error Function Inverses">Error Function
Inverses</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_erf.error_inv.synopsis"></a><h5>
-<a name="id1109069"></a>
+<a name="id1236229"></a>
<a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.synopsis">Synopsis</a>
</h5>
<p>
@@ -59,17 +59,12 @@
type calculation rules</em></span></a>: the return type is <code class="computeroutput"><span class="keyword">double</span></code> if T is an integer type, and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.sf_erf.error_inv.description"></a><h5>
-<a name="id1109452"></a>
+<a name="id1236609"></a>
<a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -103,7 +98,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/erfc_inv.png" align="middle"></span>
</p>
<a name="math_toolkit.special.sf_erf.error_inv.accuracy"></a><h5>
-<a name="id1109839"></a>
+<a name="id1236996"></a>
<a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.accuracy">Accuracy</a>
</h5>
<p>
@@ -113,7 +108,7 @@
error functions</a>.
</p>
<a name="math_toolkit.special.sf_erf.error_inv.testing"></a><h5>
-<a name="id1109861"></a>
+<a name="id1237018"></a>
<a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.testing">Testing</a>
</h5>
<p>
@@ -136,7 +131,7 @@
</li>
</ul></div>
<a name="math_toolkit.special.sf_erf.error_inv.implementation"></a><h5>
-<a name="id1109910"></a>
+<a name="id1237067"></a>
<a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,19 +24,19 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_gamma"></a><a class="link" href="sf_gamma.html" title="Gamma Functions"> Gamma Functions</a>
+<a name="math_toolkit.special.sf_gamma"></a><a class="link" href="sf_gamma.html" title="Gamma Functions">Gamma Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Gamma</span></dt>
-<dt><span class="section"> Log Gamma</span></dt>
-<dt><span class="section"> Digamma</span></dt>
-<dt><span class="section"><a href="sf_gamma/gamma_ratios.html"> Ratios
+<dt><span class="section">Gamma</span></dt>
+<dt><span class="section">Log Gamma</span></dt>
+<dt><span class="section">Digamma</span></dt>
+<dt><span class="section"><a href="sf_gamma/gamma_ratios.html">Ratios
of Gamma Functions</a></span></dt>
-<dt><span class="section"><a href="sf_gamma/igamma.html"> Incomplete Gamma
+<dt><span class="section"><a href="sf_gamma/igamma.html">Incomplete Gamma
Functions</a></span></dt>
-<dt><span class="section"><a href="sf_gamma/igamma_inv.html"> Incomplete
+<dt><span class="section"><a href="sf_gamma/igamma_inv.html">Incomplete
Gamma Function Inverses</a></span></dt>
-<dt><span class="section"><a href="sf_gamma/gamma_derivatives.html"> Derivative
+<dt><span class="section"><a href="sf_gamma/gamma_derivatives.html">Derivative
of the Incomplete Gamma Function</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.digamma"></a><a class="link" href="digamma.html" title="Digamma"> Digamma</a>
+<a name="math_toolkit.special.sf_gamma.digamma"></a><a class="link" href="digamma.html" title="Digamma">Digamma</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.digamma.synopsis"></a><h5>
-<a name="id1072621"></a>
+<a name="id1202734"></a>
<a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.synopsis">Synopsis</a>
</h5>
<p>
@@ -48,7 +48,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_gamma.digamma.description"></a><h5>
-<a name="id1072848"></a>
+<a name="id1202961"></a>
<a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.description">Description</a>
</h5>
<p>
@@ -62,14 +62,9 @@
<span class="inlinemediaobject"><img src="../../../../graphs/digamma.png" align="middle"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
There is no fully generic version of this function: all the implementations
@@ -82,7 +77,7 @@
T otherwise.
</p>
<a name="math_toolkit.special.sf_gamma.digamma.accuracy"></a><h5>
-<a name="id1072956"></a>
+<a name="id1203065"></a>
<a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.accuracy">Accuracy</a>
</h5>
<p>
@@ -270,7 +265,7 @@
absolute error will remain very low.
</p>
<a name="math_toolkit.special.sf_gamma.digamma.testing"></a><h5>
-<a name="id1073260"></a>
+<a name="id1203341"></a>
<a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.testing">Testing</a>
</h5>
<p>
@@ -280,7 +275,7 @@
see below).
</p>
<a name="math_toolkit.special.sf_gamma.digamma.implementation"></a><h5>
-<a name="id1073281"></a>
+<a name="id1203364"></a>
<a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.gamma_derivatives"></a><a class="link" href="gamma_derivatives.html" title="Derivative of the Incomplete Gamma Function"> Derivative
+<a name="math_toolkit.special.sf_gamma.gamma_derivatives"></a><a class="link" href="gamma_derivatives.html" title="Derivative of the Incomplete Gamma Function">Derivative
of the Incomplete Gamma Function</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.synopsis"></a><h5>
-<a name="id1083704"></a>
+<a name="id1214328"></a>
<a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.synopsis">Synopsis</a>
</h5>
<p>
@@ -49,7 +49,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.description"></a><h5>
-<a name="id1083988"></a>
+<a name="id1214612"></a>
<a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.description">Description</a>
</h5>
<p>
@@ -61,14 +61,9 @@
<span class="inlinemediaobject"><img src="../../../../equations/derivative1.png"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
Note that the derivative of the function <a class="link" href="igamma.html" title="Incomplete Gamma Functions">gamma_q</a>
@@ -80,7 +75,7 @@
otherwise the return type is simply T1.
</p>
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.accuracy"></a><h5>
-<a name="id1084072"></a>
+<a name="id1214693"></a>
<a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.accuracy">Accuracy</a>
</h5>
<p>
@@ -88,7 +83,7 @@
refer to the documentation for that function for more information.
</p>
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.implementation"></a><h5>
-<a name="id1084100"></a>
+<a name="id1214720"></a>
<a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.gamma_ratios"></a><a class="link" href="gamma_ratios.html" title="Ratios of Gamma Functions"> Ratios
+<a name="math_toolkit.special.sf_gamma.gamma_ratios"></a><a class="link" href="gamma_ratios.html" title="Ratios of Gamma Functions">Ratios
of Gamma Functions</a>
</h4></div></div></div>
<p>
@@ -51,7 +51,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_gamma.gamma_ratios.description"></a><h5>
-<a name="id1074244"></a>
+<a name="id1205306"></a>
<a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
@@ -67,14 +67,9 @@
<span class="inlinemediaobject"><img src="../../../../equations/gamma_ratio0.png"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
Internally this just calls <code class="computeroutput"><span class="identifier">tgamma_delta_ratio</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span>
@@ -93,14 +88,9 @@
<span class="inlinemediaobject"><img src="../../../../equations/gamma_ratio1.png"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
Note that the result is calculated accurately even when <span class="emphasis"><em>delta</em></span>
@@ -117,7 +107,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/tgamma_delta_ratio.png" align="middle"></span>
</p>
<a name="math_toolkit.special.sf_gamma.gamma_ratios.accuracy"></a><h5>
-<a name="id1074822"></a>
+<a name="id1205853"></a>
<a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.accuracy">Accuracy</a>
</h5>
<p>
@@ -127,7 +117,7 @@
<a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_gamma.gamma_ratios.errors_in_the_function_tgamma_delta_ratio_a__delta_"></a><p class="title"><b>Table 16. Errors In the Function tgamma_delta_ratio(a, delta)</b></p>
+<a name="math_toolkit.special.sf_gamma.gamma_ratios.errors_in_the_function_tgamma_delta_ratio_a__delta_"></a><p class="title"><b>Table 19. Errors In the Function tgamma_delta_ratio(a, delta)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma_delta_ratio(a, delta)">
<colgroup>
<col>
@@ -230,7 +220,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_gamma.gamma_ratios.errors_in_the_function_tgamma_ratio_a__b_"></a><p class="title"><b>Table 17. Errors In the Function tgamma_ratio(a, b)</b></p>
+<a name="math_toolkit.special.sf_gamma.gamma_ratios.errors_in_the_function_tgamma_ratio_a__b_"></a><p class="title"><b>Table 20. Errors In the Function tgamma_ratio(a, b)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma_ratio(a, b)">
<colgroup>
<col>
@@ -327,7 +317,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.sf_gamma.gamma_ratios.testing"></a><h5>
-<a name="id1075164"></a>
+<a name="id1206178"></a>
<a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.testing">Testing</a>
</h5>
<p>
@@ -336,7 +326,7 @@
a deliberately naive calculation of Γ(x)/Γ(y).
</p>
<a name="math_toolkit.special.sf_gamma.gamma_ratios.implementation"></a><h5>
-<a name="id1075188"></a>
+<a name="id1206202"></a>
<a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.igamma"></a><a class="link" href="igamma.html" title="Incomplete Gamma Functions"> Incomplete Gamma
+<a name="math_toolkit.special.sf_gamma.igamma"></a><a class="link" href="igamma.html" title="Incomplete Gamma Functions">Incomplete Gamma
Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.igamma.synopsis"></a><h5>
-<a name="id1075230"></a>
+<a name="id1206244"></a>
<a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.synopsis">Synopsis</a>
</h5>
<p>
@@ -67,7 +67,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_gamma.igamma.description"></a><h5>
-<a name="id1076036"></a>
+<a name="id1207049"></a>
<a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.description">Description</a>
</h5>
<p>
@@ -83,14 +83,9 @@
>= 0</em></span>, otherwise they return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
The return type of these functions is computed using the <a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>result
@@ -160,7 +155,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/igamma1.png"></span>
</p>
<a name="math_toolkit.special.sf_gamma.igamma.accuracy"></a><h5>
-<a name="id1078096"></a>
+<a name="id1209371"></a>
<a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.accuracy">Accuracy</a>
</h5>
<p>
@@ -185,7 +180,7 @@
All values are in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_gamma_p_a_z_"></a><p class="title"><b>Table 18. Errors In the Function gamma_p(a,z)</b></p>
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_gamma_p_a_z_"></a><p class="title"><b>Table 21. Errors In the Function gamma_p(a,z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function gamma_p(a,z)">
<colgroup>
<col>
@@ -372,7 +367,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_gamma_q_a_z_"></a><p class="title"><b>Table 19. Errors In the Function gamma_q(a,z)</b></p>
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_gamma_q_a_z_"></a><p class="title"><b>Table 22. Errors In the Function gamma_q(a,z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function gamma_q(a,z)">
<colgroup>
<col>
@@ -558,7 +553,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_tgamma_lower_a_z_"></a><p class="title"><b>Table 20. Errors In the Function tgamma_lower(a,z)</b></p>
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_tgamma_lower_a_z_"></a><p class="title"><b>Table 23. Errors In the Function tgamma_lower(a,z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma_lower(a,z)">
<colgroup>
<col>
@@ -693,7 +688,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_tgamma_a_z_"></a><p class="title"><b>Table 21. Errors In the Function tgamma(a,z)</b></p>
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_tgamma_a_z_"></a><p class="title"><b>Table 24. Errors In the Function tgamma(a,z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma(a,z)">
<colgroup>
<col>
@@ -828,7 +823,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.sf_gamma.igamma.testing"></a><h5>
-<a name="id1079240"></a>
+<a name="id1210445"></a>
<a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.testing">Testing</a>
</h5>
<p>
@@ -844,7 +839,7 @@
fraction (see below) is unstable for small a and z.
</p>
<a name="math_toolkit.special.sf_gamma.igamma.implementation"></a><h5>
-<a name="id1079266"></a>
+<a name="id1210472"></a>
<a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.implementation">Implementation</a>
</h5>
<p>
@@ -1013,7 +1008,7 @@
by Temme (see references below).
</p>
<a name="math_toolkit.special.sf_gamma.igamma.references"></a><h5>
-<a name="id1081114"></a>
+<a name="id1212123"></a>
<a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.references">References</a>
</h5>
<div class="itemizedlist"><ul type="disc">
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.igamma_inv"></a><a class="link" href="igamma_inv.html" title="Incomplete Gamma Function Inverses"> Incomplete
+<a name="math_toolkit.special.sf_gamma.igamma_inv"></a><a class="link" href="igamma_inv.html" title="Incomplete Gamma Function Inverses">Incomplete
Gamma Function Inverses</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.igamma_inv.synopsis"></a><h5>
-<a name="id1081175"></a>
+<a name="id1212184"></a>
<a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.synopsis">Synopsis</a>
</h5>
<p>
@@ -67,7 +67,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_gamma.igamma_inv.description"></a><h5>
-<a name="id1081980"></a>
+<a name="id1212990"></a>
<a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.description">Description</a>
</h5>
<p>
@@ -83,14 +83,9 @@
otherwise the return type is simply T1.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<div class="tip"><table border="0" summary="Tip">
<tr>
@@ -173,7 +168,7 @@
0</em></span>.
</p>
<a name="math_toolkit.special.sf_gamma.igamma_inv.accuracy"></a><h5>
-<a name="id1082993"></a>
+<a name="id1214178"></a>
<a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.accuracy">Accuracy</a>
</h5>
<p>
@@ -187,7 +182,7 @@
functions.
</p>
<a name="math_toolkit.special.sf_gamma.igamma_inv.testing"></a><h5>
-<a name="id1083019"></a>
+<a name="id1214205"></a>
<a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.testing">Testing</a>
</h5>
<p>
@@ -211,7 +206,7 @@
</li>
</ul></div>
<a name="math_toolkit.special.sf_gamma.igamma_inv.implementation"></a><h5>
-<a name="id1083638"></a>
+<a name="id1214262"></a>
<a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.lgamma"></a><a class="link" href="lgamma.html" title="Log Gamma"> Log Gamma</a>
+<a name="math_toolkit.special.sf_gamma.lgamma"></a><a class="link" href="lgamma.html" title="Log Gamma">Log Gamma</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.lgamma.synopsis"></a><h5>
-<a name="id1069234"></a>
+<a name="id1199768"></a>
<a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.synopsis">Synopsis</a>
</h5>
<p>
@@ -54,7 +54,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_gamma.lgamma.description"></a><h5>
-<a name="id1069617"></a>
+<a name="id1200151"></a>
<a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.description">Description</a>
</h5>
<p>
@@ -69,14 +69,9 @@
non-null is set on output to the sign of tgamma(z).
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/lgamma.png" align="middle"></span>
@@ -98,7 +93,7 @@
T otherwise.
</p>
<a name="math_toolkit.special.sf_gamma.lgamma.accuracy"></a><h5>
-<a name="id1069744"></a>
+<a name="id1200278"></a>
<a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.accuracy">Accuracy</a>
</h5>
<p>
@@ -349,7 +344,7 @@
</tbody>
</table></div>
<a name="math_toolkit.special.sf_gamma.lgamma.testing"></a><h5>
-<a name="id1070207"></a>
+<a name="id1201954"></a>
<a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.testing">Testing</a>
</h5>
<p>
@@ -360,7 +355,7 @@
Random tests in key problem areas are also used.
</p>
<a name="math_toolkit.special.sf_gamma.lgamma.implementation"></a><h5>
-<a name="id1070228"></a>
+<a name="id1201975"></a>
<a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.implementation">Implementation</a>
</h5>
<p>
@@ -390,7 +385,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/lgamm4.png"></span>
</p>
<p>
- Where L<sub>e,g</sub> ​ is the Lanczos sum, scaled by e<sup>g</sup>.
+ Where L<sub>e,g</sub>   is the Lanczos sum, scaled by e<sup>g</sup>.
</p>
<p>
As before the reflection formula is used for <span class="emphasis"><em>z < 0</em></span>.
@@ -460,7 +455,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/lgamm5.png"></span>
</p>
<p>
- The C<sub>k</sub> ​ terms in the above are the same as in the <a class="link" href="../../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
+ The C<sub>k</sub>   terms in the above are the same as in the <a class="link" href="../../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
approximation</a>.
</p>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.tgamma"></a><a class="link" href="tgamma.html" title="Gamma"> Gamma</a>
+<a name="math_toolkit.special.sf_gamma.tgamma"></a><a class="link" href="tgamma.html" title="Gamma">Gamma</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.tgamma.synopsis"></a><h5>
-<a name="id1066483"></a>
+<a name="id1192135"></a>
<a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.synopsis">Synopsis</a>
</h5>
<p>
@@ -54,7 +54,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_gamma.tgamma.description"></a><h5>
-<a name="id1066832"></a>
+<a name="id1192484"></a>
<a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -73,14 +73,9 @@
<span class="inlinemediaobject"><img src="../../../../graphs/tgamma.png" align="middle"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
There are effectively two versions of the tgamma
@@ -119,17 +114,12 @@
when T is an integer type, and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.sf_gamma.tgamma.accuracy"></a><h5>
-<a name="id1068285"></a>
+<a name="id1198849"></a>
<a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.accuracy">Accuracy</a>
</h5>
<p>
@@ -384,7 +374,7 @@
</tbody>
</table></div>
<a name="math_toolkit.special.sf_gamma.tgamma.testing"></a><h5>
-<a name="id1068759"></a>
+<a name="id1199292"></a>
<a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.testing">Testing</a>
</h5>
<p>
@@ -399,7 +389,7 @@
a lanczos approximation accurate to around 100 decimal digits.
</p>
<a name="math_toolkit.special.sf_gamma.tgamma.implementation"></a><h5>
-<a name="id1068815"></a>
+<a name="id1199348"></a>
<a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.implementation">Implementation</a>
</h5>
<p>
@@ -440,7 +430,7 @@
</p>
<p>
is used. Particular care has to be taken to evaluate the <code class="computeroutput"><span class="identifier">z</span> <span class="special">*</span> <span class="identifier">sin</span><span class="special">([</span><span class="identifier">pi</span><span class="special">][</span><span class="identifier">space</span><span class="special">]</span> <span class="special">*</span> <span class="identifier">z</span><span class="special">)</span></code>
- part: a special routine is used to reduce z prior to multiplying by π ​ to
+ part: a special routine is used to reduce z prior to multiplying by π   to
ensure that the result in is the range [0, π/2]. Without this an excessive
amount of error occurs in this region (which is hard enough already, as
the rate of change near a negative pole is <span class="emphasis"><em>exceptionally</em></span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,15 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_poly"></a><a class="link" href="sf_poly.html" title="Polynomials"> Polynomials</a>
+<a name="math_toolkit.special.sf_poly"></a><a class="link" href="sf_poly.html" title="Polynomials">Polynomials</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="sf_poly/legendre.html"> Legendre (and
+<dt><span class="section"><a href="sf_poly/legendre.html">Legendre (and
Associated) Polynomials</a></span></dt>
-<dt><span class="section"><a href="sf_poly/laguerre.html"> Laguerre (and
+<dt><span class="section"><a href="sf_poly/laguerre.html">Laguerre (and
Associated) Polynomials</a></span></dt>
-<dt><span class="section"> Hermite Polynomials</span></dt>
-<dt><span class="section"> Spherical Harmonics</span></dt>
+<dt><span class="section">Hermite Polynomials</span></dt>
+<dt><span class="section">Spherical Harmonics</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.hermite"></a><a class="link" href="hermite.html" title="Hermite Polynomials"> Hermite Polynomials</a>
+<a name="math_toolkit.special.sf_poly.hermite"></a><a class="link" href="hermite.html" title="Hermite Polynomials">Hermite Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.hermite.synopsis"></a><h5>
-<a name="id1118289"></a>
+<a name="id1246192"></a>
<a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.synopsis">Synopsis</a>
</h5>
<p>
@@ -51,7 +51,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_poly.hermite.description"></a><h5>
-<a name="id1118656"></a>
+<a name="id1246641"></a>
<a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.description">Description</a>
</h5>
<p>
@@ -74,14 +74,9 @@
<span class="inlinemediaobject"><img src="../../../../equations/hermite_0.png"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
The following graph illustrates the behaviour of the first few Hermite
@@ -136,7 +131,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.hermite.accuracy"></a><h5>
-<a name="id1119551"></a>
+<a name="id1247394"></a>
<a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.accuracy">Accuracy</a>
</h5>
<p>
@@ -146,7 +141,7 @@
zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_poly.hermite.peak_errors_in_the_hermite_polynomial"></a><p class="title"><b>Table 34. Peak Errors In the Hermite Polynomial</b></p>
+<a name="math_toolkit.special.sf_poly.hermite.peak_errors_in_the_hermite_polynomial"></a><p class="title"><b>Table 37. Peak Errors In the Hermite Polynomial</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Hermite Polynomial">
<colgroup>
<col>
@@ -253,7 +248,7 @@
is very close to a root.
</p>
<a name="math_toolkit.special.sf_poly.hermite.testing"></a><h5>
-<a name="id1119733"></a>
+<a name="id1247571"></a>
<a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.testing">Testing</a>
</h5>
<p>
@@ -263,7 +258,7 @@
precision.
</p>
<a name="math_toolkit.special.sf_poly.hermite.implementation"></a><h5>
-<a name="id1119755"></a>
+<a name="id1247592"></a>
<a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.laguerre"></a><a class="link" href="laguerre.html" title="Laguerre (and Associated) Polynomials"> Laguerre (and
+<a name="math_toolkit.special.sf_poly.laguerre"></a><a class="link" href="laguerre.html" title="Laguerre (and Associated) Polynomials">Laguerre (and
Associated) Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.laguerre.synopsis"></a><h5>
-<a name="id1114441"></a>
+<a name="id1242150"></a>
<a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.synopsis">Synopsis</a>
</h5>
<p>
@@ -62,7 +62,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_poly.laguerre.description"></a><h5>
-<a name="id1115111"></a>
+<a name="id1242820"></a>
<a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.description">Description</a>
</h5>
<p>
@@ -72,14 +72,9 @@
type.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">laguerre</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">x</span><span class="special">);</span>
@@ -210,7 +205,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.laguerre.accuracy"></a><h5>
-<a name="id1117888"></a>
+<a name="id1245806"></a>
<a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.accuracy">Accuracy</a>
</h5>
<p>
@@ -220,7 +215,7 @@
zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_poly.laguerre.peak_errors_in_the_laguerre_polynomial"></a><p class="title"><b>Table 32. Peak Errors In the Laguerre Polynomial</b></p>
+<a name="math_toolkit.special.sf_poly.laguerre.peak_errors_in_the_laguerre_polynomial"></a><p class="title"><b>Table 35. Peak Errors In the Laguerre Polynomial</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Laguerre Polynomial">
<colgroup>
<col>
@@ -320,7 +315,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_poly.laguerre.peak_errors_in_the_associated_laguerre_polynomial"></a><p class="title"><b>Table 33. Peak Errors In the Associated Laguerre Polynomial</b></p>
+<a name="math_toolkit.special.sf_poly.laguerre.peak_errors_in_the_associated_laguerre_polynomial"></a><p class="title"><b>Table 36. Peak Errors In the Associated Laguerre Polynomial</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Associated Laguerre Polynomial">
<colgroup>
<col>
@@ -427,7 +422,7 @@
is very close to a root.
</p>
<a name="math_toolkit.special.sf_poly.laguerre.testing"></a><h5>
-<a name="id1118240"></a>
+<a name="id1246143"></a>
<a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.testing">Testing</a>
</h5>
<p>
@@ -437,7 +432,7 @@
precision.
</p>
<a name="math_toolkit.special.sf_poly.laguerre.implementation"></a><h5>
-<a name="id1118262"></a>
+<a name="id1246164"></a>
<a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.legendre"></a><a class="link" href="legendre.html" title="Legendre (and Associated) Polynomials"> Legendre (and
+<a name="math_toolkit.special.sf_poly.legendre"></a><a class="link" href="legendre.html" title="Legendre (and Associated) Polynomials">Legendre (and
Associated) Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.legendre.synopsis"></a><h5>
-<a name="id1110272"></a>
+<a name="id1237477"></a>
<a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.synopsis">Synopsis</a>
</h5>
<p>
@@ -74,17 +74,12 @@
type.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.sf_poly.legendre.description"></a><h5>
-<a name="id1111412"></a>
+<a name="id1238325"></a>
<a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -213,9 +208,13 @@
</p>
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">x</span> <span class="special">=</span> <span class="number">0.5</span><span class="special">;</span> <span class="comment">// Abscissa value
</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">v</span><span class="special">;</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="number">0</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)).</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
+<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="number">0</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
+<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
<span class="keyword">for</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">l</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span> <span class="identifier">l</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">l</span><span class="special">)</span>
<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_next</span><span class="special">(</span><span class="identifier">l</span><span class="special">,</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">],</span> <span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">-</span><span class="number">1</span><span class="special">]));</span>
+<span class="comment">// Double check values:
+</span><span class="keyword">for</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">l</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span> <span class="identifier">l</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">l</span><span class="special">)</span>
+ <span class="identifier">assert</span><span class="special">(</span><span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">]</span> <span class="special">==</span> <span class="identifier">legendre_p</span><span class="special">(</span><span class="identifier">l</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
</pre>
<p>
Formally the arguments are:
@@ -259,9 +258,13 @@
<pre class="programlisting"><span class="keyword">double</span> <span class="identifier">x</span> <span class="special">=</span> <span class="number">0.5</span><span class="special">;</span> <span class="comment">// Abscissa value
</span><span class="keyword">int</span> <span class="identifier">m</span> <span class="special">=</span> <span class="number">10</span><span class="special">;</span> <span class="comment">// order
</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">v</span><span class="special">;</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="identifier">m</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)).</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="number">1</span> <span class="special">+</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
-<span class="keyword">for</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">l</span> <span class="special">=</span> <span class="number">1</span> <span class="special">+</span> <span class="identifier">m</span><span class="special">;</span> <span class="identifier">l</span> <span class="special"><</span> <span class="identifier">m</span> <span class="special">+</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">l</span><span class="special">)</span>
- <span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_next</span><span class="special">(</span><span class="identifier">l</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">],</span> <span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">-</span><span class="number">1</span><span class="special">]));</span>
+<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="identifier">m</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
+<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_p</span><span class="special">(</span><span class="number">1</span> <span class="special">+</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
+<span class="keyword">for</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">l</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span> <span class="identifier">l</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">l</span><span class="special">)</span>
+ <span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">legendre_next</span><span class="special">(</span><span class="identifier">l</span> <span class="special">+</span> <span class="number">10</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">],</span> <span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">-</span><span class="number">1</span><span class="special">]));</span>
+<span class="comment">// Double check values:
+</span><span class="keyword">for</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">l</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span> <span class="identifier">l</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">l</span><span class="special">)</span>
+ <span class="identifier">assert</span><span class="special">(</span><span class="identifier">v</span><span class="special">[</span><span class="identifier">l</span><span class="special">]</span> <span class="special">==</span> <span class="identifier">legendre_p</span><span class="special">(</span><span class="number">10</span> <span class="special">+</span> <span class="identifier">l</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">x</span><span class="special">));</span>
</pre>
<p>
Formally the arguments are:
@@ -292,7 +295,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.legendre.accuracy"></a><h5>
-<a name="id1113804"></a>
+<a name="id1241539"></a>
<a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.accuracy">Accuracy</a>
</h5>
<p>
@@ -302,7 +305,7 @@
zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_legendre_p_function"></a><p class="title"><b>Table 29. Peak Errors In the Legendre P Function</b></p>
+<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_legendre_p_function"></a><p class="title"><b>Table 32. Peak Errors In the Legendre P Function</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Legendre P Function">
<colgroup>
<col>
@@ -431,7 +434,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_associated_legendre_p_function"></a><p class="title"><b>Table 30. Peak Errors In the Associated Legendre P Function</b></p>
+<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_associated_legendre_p_function"></a><p class="title"><b>Table 33. Peak Errors In the Associated Legendre P Function</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Associated Legendre P Function">
<colgroup>
<col>
@@ -531,7 +534,7 @@
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_legendre_q_function"></a><p class="title"><b>Table 31. Peak Errors In the Legendre Q Function</b></p>
+<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_legendre_q_function"></a><p class="title"><b>Table 34. Peak Errors In the Legendre Q Function</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Legendre Q Function">
<colgroup>
<col>
@@ -673,7 +676,7 @@
given here.
</p>
<a name="math_toolkit.special.sf_poly.legendre.testing"></a><h5>
-<a name="id1114392"></a>
+<a name="id1242101"></a>
<a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.testing">Testing</a>
</h5>
<p>
@@ -683,7 +686,7 @@
precision.
</p>
<a name="math_toolkit.special.sf_poly.legendre.implementation"></a><h5>
-<a name="id1114414"></a>
+<a name="id1242122"></a>
<a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.sph_harm"></a><a class="link" href="sph_harm.html" title="Spherical Harmonics"> Spherical Harmonics</a>
+<a name="math_toolkit.special.sf_poly.sph_harm"></a><a class="link" href="sph_harm.html" title="Spherical Harmonics">Spherical Harmonics</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.sph_harm.synopsis"></a><h5>
-<a name="id1119782"></a>
+<a name="id1247620"></a>
<a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.synopsis">Synopsis</a>
</h5>
<p>
@@ -60,7 +60,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.special.sf_poly.sph_harm.description"></a><h5>
-<a name="id1120607"></a>
+<a name="id1248444"></a>
<a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.description">Description</a>
</h5>
<p>
@@ -68,14 +68,9 @@
type calculation rules</em></span></a> when T1 and T2 are different types.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">complex</span><span class="special"><</span><a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a><span class="special">></span> <span class="identifier">spherical_harmonic</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">T1</span> <span class="identifier">theta</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">phi</span><span class="special">);</span>
@@ -102,8 +97,8 @@
<tr><td align="left" valign="top">
<p>
Care must be taken in correctly identifying the arguments to this function:
- θ ​ is taken as the polar (colatitudinal) coordinate with θ ​ in [0, π], and φ ​ as
- the azimuthal (longitudinal) coordinate with φ ​ in [0,2π). This is the convention
+ θ   is taken as the polar (colatitudinal) coordinate with θ   in [0, π], and φ   as
+ the azimuthal (longitudinal) coordinate with φ   in [0,2π). This is the convention
used in Physics, and matches the definition used by <a href="http://documents.wolfram.com/mathematica/functions/SphericalHarmonicY" target="_top">Mathematica
in the function SpericalHarmonicY</a>, but is opposite to the usual
mathematical conventions.
@@ -117,11 +112,11 @@
This implementation returns zero for m > n
</p>
<p>
- For θ ​ outside [0, π] and φ ​ outside [0, 2π] this implementation follows the
+ For θ   outside [0, π] and φ   outside [0, 2π] this implementation follows the
convention used by Mathematica: the function is periodic with period
- π ​ in θ ​ and 2π ​ in φ. Please note that this is not the behaviour one would get
+ π   in θ   and 2π   in φ. Please note that this is not the behaviour one would get
from a casual application of the function's definition. Cautious users
- should keep θ ​ and φ ​ to the range [0, π] and [0, 2π] respectively.
+ should keep θ   and φ   to the range [0, π] and [0, 2π] respectively.
</p>
<p>
See: <a href="http://mathworld.wolfram.com/SphericalHarmonic.html" target="_top">Weisstein,
@@ -155,7 +150,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/spherical_2.png"></span>
</p>
<a name="math_toolkit.special.sf_poly.sph_harm.accuracy"></a><h5>
-<a name="id1122231"></a>
+<a name="id1251038"></a>
<a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.accuracy">Accuracy</a>
</h5>
<p>
@@ -170,7 +165,7 @@
All values are in units of epsilon.
</p>
<div class="table">
-<a name="math_toolkit.special.sf_poly.sph_harm.peak_errors_in_the_sperical_harmonic_functions"></a><p class="title"><b>Table 35. Peak Errors In the Sperical Harmonic Functions</b></p>
+<a name="math_toolkit.special.sf_poly.sph_harm.peak_errors_in_the_sperical_harmonic_functions"></a><p class="title"><b>Table 38. Peak Errors In the Sperical Harmonic Functions</b></p>
<div class="table-contents"><table class="table" summary="Peak Errors In the Sperical Harmonic Functions">
<colgroup>
<col>
@@ -276,7 +271,7 @@
arbitrarily large when the function is very close to a root.
</p>
<a name="math_toolkit.special.sf_poly.sph_harm.testing"></a><h5>
-<a name="id1122423"></a>
+<a name="id1251223"></a>
<a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.testing">Testing</a>
</h5>
<p>
@@ -286,7 +281,7 @@
precision.
</p>
<a name="math_toolkit.special.sf_poly.sph_harm.implementation"></a><h5>
-<a name="id1122444"></a>
+<a name="id1251244"></a>
<a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sinc"></a><a class="link" href="sinc.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions"> Sinus Cardinal and Hyperbolic
+<a name="math_toolkit.special.sinc"></a><a class="link" href="sinc.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions">Sinus Cardinal and Hyperbolic
Sinus Cardinal Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="sinc/sinc_overview.html"> Sinus Cardinal
+<dt><span class="section"><a href="sinc/sinc_overview.html">Sinus Cardinal
and Hyperbolic Sinus Cardinal Functions Overview</a></span></dt>
<dt><span class="section">sinc_pi</span></dt>
<dt><span class="section">sinhc_pi</span></dt>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sinc.sinc_overview"></a><a class="link" href="sinc_overview.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions Overview"> Sinus Cardinal
+<a name="math_toolkit.special.sinc.sinc_overview"></a><a class="link" href="sinc_overview.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions Overview">Sinus Cardinal
and Hyperbolic Sinus Cardinal Functions Overview</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -59,14 +59,9 @@
<span class="inlinemediaobject"><img src="../../../../graphs/sinc_pi.png" align="middle"></span>
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -60,14 +60,9 @@
type calculation rules</em></span></a> when T is an integer type.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../graphs/sinhc_pi.png" align="middle"></span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,9 +24,9 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.zetas"></a><a class="link" href="zetas.html" title="Zeta Functions"> Zeta Functions</a>
+<a name="math_toolkit.special.zetas"></a><a class="link" href="zetas.html" title="Zeta Functions">Zeta Functions</a>
</h3></div></div></div>
-<div class="toc"><dl><dt><span class="section"> Riemann Zeta Function</span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section">Riemann Zeta Function</span></dt></dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.zetas.zeta"></a><a class="link" href="zeta.html" title="Riemann Zeta Function"> Riemann Zeta Function</a>
+<a name="math_toolkit.special.zetas.zeta"></a><a class="link" href="zeta.html" title="Riemann Zeta Function">Riemann Zeta Function</a>
</h4></div></div></div>
<a name="math_toolkit.special.zetas.zeta.synopsis"></a><h5>
-<a name="id1141306"></a>
+<a name="id1269054"></a>
<a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.synopsis">Synopsis</a>
</h5>
<p>
@@ -52,17 +52,12 @@
type calculation rules</em></span></a>: the return type is <code class="computeroutput"><span class="keyword">double</span></code> if T is an integer type, and T otherwise.
</p>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<a name="math_toolkit.special.zetas.zeta.description"></a><h5>
-<a name="id1141566"></a>
+<a name="id1269311"></a>
<a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -85,7 +80,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/zeta2.png" align="middle"></span>
</p>
<a name="math_toolkit.special.zetas.zeta.accuracy"></a><h5>
-<a name="id1141790"></a>
+<a name="id1269535"></a>
<a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.accuracy">Accuracy</a>
</h5>
<p>
@@ -97,7 +92,7 @@
shown will have <a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
</p>
<div class="table">
-<a name="math_toolkit.special.zetas.zeta.errors_in_the_function_zeta_z_"></a><p class="title"><b>Table 44. Errors In the Function zeta(z)</b></p>
+<a name="math_toolkit.special.zetas.zeta.errors_in_the_function_zeta_z_"></a><p class="title"><b>Table 47. Errors In the Function zeta(z)</b></p>
<div class="table-contents"><table class="table" summary="Errors In the Function zeta(z)">
<colgroup>
<col>
@@ -234,7 +229,7 @@
</table></div>
</div>
<br class="table-break"><a name="math_toolkit.special.zetas.zeta.testing"></a><h5>
-<a name="id1142051"></a>
+<a name="id1269777"></a>
<a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.testing">Testing</a>
</h5>
<p>
@@ -249,7 +244,7 @@
check.
</p>
<a name="math_toolkit.special.zetas.zeta.implementation"></a><h5>
-<a name="id1142077"></a>
+<a name="id1269803"></a>
<a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,13 +24,12 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.status"></a><a class="link" href="status.html" title="Library Status"> Library Status</a>
+<a name="math_toolkit.status"></a><a class="link" href="status.html" title="Library Status">Library Status</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> History and What's New</span></dt>
-<dt><span class="section"> Compilers</span></dt>
-<dt><span class="section"> Known Issues, and Todo List</span></dt>
-<dt><span class="section"> Credits and Acknowledgements</span></dt>
+<dt><span class="section">History and What's New</span></dt>
+<dt><span class="section">Known Issues, and TODO List</span></dt>
+<dt><span class="section">Credits and Acknowledgements</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,7 +6,8 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../status.html" title="Library Status">
-<link rel="prev" href="issues.html" title="Known Issues, and Todo List">
+<link rel="prev" href="issues.html" title="Known Issues, and TODO List">
+<link rel="next" href="../../index/s12.html" title="Function Index">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -19,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="issues.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a>
+<a accesskey="p" href="issues.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../index/s12.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.status.credits"></a><a class="link" href="credits.html" title="Credits and Acknowledgements"> Credits and Acknowledgements</a>
+<a name="math_toolkit.status.credits"></a><a class="link" href="credits.html" title="Credits and Acknowledgements">Credits and Acknowledgements</a>
</h3></div></div></div>
<p>
Hubert Holin started the Boost.Math library. The inverse hyperbolic functions,
@@ -113,7 +114,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="issues.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a>
+<a accesskey="p" href="issues.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../index/s12.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../status.html" title="Library Status">
<link rel="prev" href="../status.html" title="Library Status">
-<link rel="next" href="compilers.html" title="Compilers">
+<link rel="next" href="issues.html" title="Known Issues, and TODO List">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,349 +20,296 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../status.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compilers.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../status.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="issues.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.status.history1"></a><a class="link" href="history1.html" title="History and What's New"> History and What's New</a>
+<a name="math_toolkit.status.history1"></a><a class="link" href="history1.html" title="History and What's New">History and What's New</a>
</h3></div></div></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_45_0"></a>
- </p>
-<h5>
-<a name="id1290324"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_45_0">Boost-1.45.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.boost_1_46_0"></a><h5>
+<a name="id1424660"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_46_0">Boost-1.46.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added warnings about potential ambiguity with std random library in
- distribution and function names.
- </li>
+ Added Wald, Inverse Gaussian and geometric distributions.
+ </li>
<li>
- Added inverse gamma distribution and inverse chi_square and scaled
- inverse chi_square.
- </li>
+ Added information about configuration macros.
+ </li>
<li>
- Editorial revision of documentation, and added FAQ.
- </li>
+ Added support for mpreal as a real-numered type.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_44_0"></a>
- </p>
-<h5>
-<a name="id1290363"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_44_0">Boost-1.44.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.boost_1_45_0"></a><h5>
+<a name="id1424698"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_45_0">Boost-1.45.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Fixed incorrect range and support for Rayleigh distribution.
- </li>
+ Added warnings about potential ambiguity with std random library in distribution
+ and function names.
+ </li>
+<li>
+ Added inverse gamma distribution and inverse chi_square and scaled inverse
+ chi_square.
+ </li>
<li>
- Fixed numerical error in the quantile of the Student's T distribution:
- the function was returning garbage values for non-integer degrees of
- freedom between 2 and 3.
- </li>
+ Editorial revision of documentation, and added FAQ.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_41_0"></a>
- </p>
-<h5>
-<a name="id1290394"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_41_0">Boost-1.41.0</a>
- </h5>
-<p>
- </p>
-<div class="itemizedlist"><ul type="disc"><li>
- Significantly improved performance for the incomplete gamma function
- and its inverse.
- </li></ul></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_40_0"></a>
- </p>
-<h5>
-<a name="id1290418"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_40_0">Boost-1.40.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.boost_1_44_0"></a><h5>
+<a name="id1424736"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_44_0">Boost-1.44.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added support for MPFR as a bignum type.
- </li>
-<li>
- Added some full specializations of the policy classes to reduce compile
- times.
- </li>
+ Fixed incorrect range and support for Rayleigh distribution.
+ </li>
<li>
- Added logistic and hypergeometric distributions, from Gautam Sewani's
- Google Summer of Code project.
- </li>
-<li>
- Added Laplace distribution submitted by Thijs van den Berg.
- </li>
-<li>
- Updated performance test code to include new distributions, and improved
- the performance of the non-central distributions.
- </li>
+ Fixed numerical error in the quantile of the Student's T distribution:
+ the function was returning garbage values for non-integer degrees of
+ freedom between 2 and 3.
+ </li>
+</ul></div>
+<a name="math_toolkit.status.history1.boost_1_41_0"></a><h5>
+<a name="id1424768"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_41_0">Boost-1.41.0</a>
+ </h5>
+<div class="itemizedlist"><ul type="disc"><li>
+ Significantly improved performance for the incomplete gamma function
+ and its inverse.
+ </li></ul></div>
+<a name="math_toolkit.status.history1.boost_1_40_0"></a><h5>
+<a name="id1424792"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_40_0">Boost-1.40.0</a>
+ </h5>
+<div class="itemizedlist"><ul type="disc">
<li>
- Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
- approximation</a> code, from Gautam Sewani's Google Summer of Code
- project.
- </li>
+ Added support for MPFR as a bignum type.
+ </li>
<li>
- Fixed bug in cyl_bessel_i that used an incorrect approximation for
- ν = 0.5, also effects the non-central Chi Square Distribution when ν =
- 3, see bug report #2877.
- </li>
+ Added some full specializations of the policy classes to reduce compile
+ times.
+ </li>
+<li>
+ Added logistic and hypergeometric distributions, from Gautam Sewani's
+ Google Summer of Code project.
+ </li>
+<li>
+ Added Laplace distribution submitted by Thijs van den Berg.
+ </li>
+<li>
+ Updated performance test code to include new distributions, and improved
+ the performance of the non-central distributions.
+ </li>
+<li>
+ Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
+ approximation</a> code, from Gautam Sewani's Google Summer of Code
+ project.
+ </li>
+<li>
+ Fixed bug in cyl_bessel_i that used an incorrect approximation for ν =
+ 0.5, also effects the non-central Chi Square Distribution when ν = 3, see
+ bug report #2877.
+ </li>
<li>
- Fixed minor bugs #2873.
- </li>
+ Fixed minor bugs #2873.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_38_0"></a>
- </p>
-<h5>
-<a name="id1290507"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_38_0">Boost-1.38.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.boost_1_38_0"></a><h5>
+<a name="id1424880"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_38_0">Boost-1.38.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Johan Råde's optimised floating point classification routines.
- </li>
+ Added Johan Råde's optimised floating point classification routines.
+ </li>
<li>
- Fixed code so that it compiles in GCC's -pedantic mode (bug report
- #1451).
- </li>
+ Fixed code so that it compiles in GCC's -pedantic mode (bug report #1451).
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_37_0"></a>
- </p>
-<h5>
-<a name="id1290543"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_37_0">Boost-1.37.0</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.boost_1_37_0"></a><h5>
+<a name="id1424916"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_37_0">Boost-1.37.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc"><li>
- Improved accuracy and testing of the inverse hypergeometric functions.
- </li></ul></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_36_0"></a>
- </p>
-<h5>
-<a name="id1290567"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_36_0">Boost-1.36.0</a>
- </h5>
-<p>
- </p>
+ Improved accuracy and testing of the inverse hypergeometric functions.
+ </li></ul></div>
+<a name="math_toolkit.status.history1.boost_1_36_0"></a><h5>
+<a name="id1424940"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_36_0">Boost-1.36.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Noncentral Chi Squared Distribution.
- </li>
+ Added Noncentral Chi Squared Distribution.
+ </li>
<li>
- Added Noncentral Beta Distribution.
- </li>
+ Added Noncentral Beta Distribution.
+ </li>
<li>
- Added Noncentral F Distribution.
- </li>
+ Added Noncentral F Distribution.
+ </li>
<li>
- Added Noncentral T Distribution.
- </li>
+ Added Noncentral T Distribution.
+ </li>
<li>
- Added Exponential Integral Functions.
- </li>
+ Added Exponential Integral Functions.
+ </li>
<li>
- Added Zeta Function.
- </li>
+ Added Zeta Function.
+ </li>
<li>
- Added Rounding and Truncation functions.
- </li>
+ Added Rounding and Truncation functions.
+ </li>
<li>
- Added Compile time powers of runtime bases.
- </li>
+ Added Compile time powers of runtime bases.
+ </li>
<li>
- Added SSE2 optimizations for Lanczos evaluation.
- </li>
+ Added SSE2 optimizations for Lanczos evaluation.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release"></a>
- </p>
-<h5>
-<a name="id1292582"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release">Boost-1.35.0:
- Post Review First Official Release</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release"></a><h5>
+<a name="id1425022"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release">Boost-1.35.0:
+ Post Review First Official Release</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Policy based framework that allows fine grained control over
- function behaviour.
- </li>
-<li>
- <span class="bold"><strong>Breaking change:</strong></span> Changed default behaviour
- for domain, pole and overflow errors to throw an exception (based on
- review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- <span class="bold"><strong>Breaking change:</strong></span> Changed exception
- thrown when an internal evaluation error occurs to boost::math::evaluation_error.
- </li>
-<li>
- <span class="bold"><strong>Breaking change:</strong></span> Changed discrete
- quantiles to return an integer result: this is anything up to 20 times
- faster than finding the true root, this behaviour can be customised
- using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- Polynomial/rational function evaluation is now customisable and hopefully
- faster than before.
- </li>
+ Added Policy based framework that allows fine grained control over function
+ behaviour.
+ </li>
+<li>
+ <span class="bold"><strong>Breaking change:</strong></span> Changed default behaviour
+ for domain, pole and overflow errors to throw an exception (based on
+ review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ <span class="bold"><strong>Breaking change:</strong></span> Changed exception thrown
+ when an internal evaluation error occurs to boost::math::evaluation_error.
+ </li>
+<li>
+ <span class="bold"><strong>Breaking change:</strong></span> Changed discrete quantiles
+ to return an integer result: this is anything up to 20 times faster than
+ finding the true root, this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ Polynomial/rational function evaluation is now customisable and hopefully
+ faster than before.
+ </li>
<li>
- Added performance test program.
- </li>
+ Added performance test program.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_"></a>
- </p>
-<h5>
-<a name="id1292669"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_">Milestone
- 4: Second Review Candidate (1st March 2007)</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_"></a><h5>
+<a name="id1425106"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_">Milestone
+ 4: Second Review Candidate (1st March 2007)</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Moved Xiaogang Zhang's Bessel Functions code into the library, and
- brought them into line with the rest of the code.
- </li>
+ Moved Xiaogang Zhang's Bessel Functions code into the library, and brought
+ them into line with the rest of the code.
+ </li>
<li>
- Added C# "Distribution Explorer" demo application.
- </li>
+ Added C# "Distribution Explorer" demo application.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a>
- </p>
-<h5>
-<a name="id1292701"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_">Milestone
- 3: First Review Candidate (31st Dec 2006)</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a><h5>
+<a name="id1425137"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_">Milestone
+ 3: First Review Candidate (31st Dec 2006)</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Implemented the main probability distribution and density functions.
- </li>
-<li>
- Implemented digamma.
- </li>
+ Implemented the main probability distribution and density functions.
+ </li>
<li>
- Added more factorial functions.
- </li>
+ Implemented digamma.
+ </li>
<li>
- Implemented the Hermite, Legendre and Laguerre polynomials plus the
- spherical harmonic functions from TR1.
- </li>
+ Added more factorial functions.
+ </li>
<li>
- Moved Xiaogang Zhang's elliptic integral code into the library, and
- brought them into line with the rest of the code.
- </li>
-<li>
- Moved Hubert Holin's existing Boost.Math special functions into this
- library and brought them into line with the rest of the code.
- </li>
+ Implemented the Hermite, Legendre and Laguerre polynomials plus the spherical
+ harmonic functions from TR1.
+ </li>
+<li>
+ Moved Xiaogang Zhang's elliptic integral code into the library, and brought
+ them into line with the rest of the code.
+ </li>
+<li>
+ Moved Hubert Holin's existing Boost.Math special functions into this
+ library and brought them into line with the rest of the code.
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.milestone_2__released_september_10th_2006"></a>
- </p>
-<h5>
-<a name="id1292764"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.milestone_2__released_september_10th_2006">Milestone
- 2: Released September 10th 2006</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.milestone_2__released_september_10th_2006"></a><h5>
+<a name="id1425197"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.milestone_2__released_september_10th_2006">Milestone
+ 2: Released September 10th 2006</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement preview release of the statistical distributions.
- </li>
+ Implement preview release of the statistical distributions.
+ </li>
<li>
- Added statistical distributions tutorial.
- </li>
+ Added statistical distributions tutorial.
+ </li>
<li>
- Implemented root finding algorithms.
- </li>
+ Implemented root finding algorithms.
+ </li>
<li>
- Implemented the inverses of the incomplete gamma and beta functions.
- </li>
+ Implemented the inverses of the incomplete gamma and beta functions.
+ </li>
<li>
- Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
- </li>
+ Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
+ </li>
<li>
- Integrated the statistical results generated from the test data with
- Boost.Test: uses a database of expected results, indexed by test, floating
- point type, platform, and compiler.
- </li>
+ Integrated the statistical results generated from the test data with
+ Boost.Test: uses a database of expected results, indexed by test, floating
+ point type, platform, and compiler.
+ </li>
<li>
- Improved lgamma near 1 and 2 (rational approximations).
- </li>
+ Improved lgamma near 1 and 2 (rational approximations).
+ </li>
<li>
- Improved erf/erfc inverses (rational approximations).
- </li>
+ Improved erf/erfc inverses (rational approximations).
+ </li>
<li>
- Implemented Rational function generation (the Remez method).
- </li>
+ Implemented Rational function generation (the Remez method).
+ </li>
</ul></div>
-<p>
- <a name="math_toolkit.status.history1.milestone_1__released_march_31st_2006"></a>
- </p>
-<h5>
-<a name="id1292845"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.milestone_1__released_march_31st_2006">Milestone
- 1: Released March 31st 2006</a>
- </h5>
-<p>
- </p>
+<a name="math_toolkit.status.history1.milestone_1__released_march_31st_2006"></a><h5>
+<a name="id1425279"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.milestone_1__released_march_31st_2006">Milestone
+ 1: Released March 31st 2006</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement gamma/beta/erf functions along with their incomplete counterparts.
- </li>
-<li>
- Generate high quality test data, against which future improvements
- can be judged.
- </li>
-<li>
- Provide tools for the evaluation of infinite series, continued fractions,
- and rational functions.
- </li>
+ Implement gamma/beta/erf functions along with their incomplete counterparts.
+ </li>
<li>
- Provide tools for testing against tabulated test data, and collecting
- statistics on error rates.
- </li>
-<li>
- Provide sufficient docs for people to be able to find their way around
- the library.
- </li>
+ Generate high quality test data, against which future improvements can
+ be judged.
+ </li>
+<li>
+ Provide tools for the evaluation of infinite series, continued fractions,
+ and rational functions.
+ </li>
+<li>
+ Provide tools for testing against tabulated test data, and collecting
+ statistics on error rates.
+ </li>
+<li>
+ Provide sufficient docs for people to be able to find their way around
+ the library.
+ </li>
</ul></div>
<p>
- </p>
-<p>
- SVN Revisions:
- </p>
-<p>
- </p>
-<p>
- Sandbox and trunk last synchonised at revision: .
- </p>
+ SVN Revisions:
+ </p>
<p>
+ Sandbox and trunk last synchonised at revision: .
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -377,7 +324,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../status.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compilers.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../status.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="issues.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,12 +1,12 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Known Issues, and Todo List</title>
+<title>Known Issues, and TODO List</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../status.html" title="Library Status">
-<link rel="prev" href="compilers.html" title="Compilers">
+<link rel="prev" href="history1.html" title="History and What's New">
<link rel="next" href="credits.html" title="Credits and Acknowledgements">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,16 +20,13 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="compilers.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="credits.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="history1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="credits.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.status.issues"></a><a class="link" href="issues.html" title="Known Issues, and Todo List"> Known Issues, and Todo List</a>
+<a name="math_toolkit.status.issues"></a><a class="link" href="issues.html" title="Known Issues, and TODO List">Known Issues, and TODO List</a>
</h3></div></div></div>
<p>
- This section lists those issues that are known about.
- </p>
-<p>
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
@@ -43,7 +40,7 @@
with it.
</p>
<a name="math_toolkit.status.issues.tgamma"></a><h5>
-<a name="id1293781"></a>
+<a name="id1425358"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.tgamma">tgamma</a>
</h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -51,7 +48,7 @@
be optimized any further? (low priority)
</li></ul></div>
<a name="math_toolkit.status.issues.incomplete_beta"></a><h5>
-<a name="id1293810"></a>
+<a name="id1425387"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.incomplete_beta">Incomplete Beta</a>
</h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -59,7 +56,7 @@
b (medium priority).
</li></ul></div>
<a name="math_toolkit.status.issues.inverse_gamma"></a><h5>
-<a name="id1293834"></a>
+<a name="id1425411"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.inverse_gamma">Inverse Gamma</a>
</h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -67,7 +64,7 @@
is good enough (Medium Priority).
</li></ul></div>
<a name="math_toolkit.status.issues.polynomials"></a><h5>
-<a name="id1293858"></a>
+<a name="id1425435"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.polynomials">Polynomials</a>
</h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -77,7 +74,7 @@
not (Low Priority).
</li></ul></div>
<a name="math_toolkit.status.issues.elliptic_integrals"></a><h5>
-<a name="id1293882"></a>
+<a name="id1425459"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.elliptic_integrals">Elliptic Integrals</a>
</h5>
<div class="itemizedlist"><ul type="disc">
@@ -130,7 +127,7 @@
</li>
</ul></div>
<a name="math_toolkit.status.issues.inverse_hyperbolic_functions"></a><h5>
-<a name="id1294013"></a>
+<a name="id1425591"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.inverse_hyperbolic_functions">Inverse
Hyperbolic Functions</a>
</h5>
@@ -140,7 +137,7 @@
This is probably only an issue for very high precision types (Low Priority).
</li></ul></div>
<a name="math_toolkit.status.issues.statistical_distributions"></a><h5>
-<a name="id1294042"></a>
+<a name="id1425620"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.statistical_distributions">Statistical
distributions</a>
</h5>
@@ -149,7 +146,7 @@
for very large degrees of freedom?
</li></ul></div>
<a name="math_toolkit.status.issues.feature_requests"></a><h5>
-<a name="id1294066"></a>
+<a name="id1425644"></a>
<a class="link" href="issues.html#math_toolkit.status.issues.feature_requests">Feature Requests</a>
</h5>
<p>
@@ -202,38 +199,6 @@
<tr>
<td>
<p>
- Inverse Gausian / Inverse Normal
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-<td>
- <p>
- X
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-<td>
- <p>
- X
- </p>
- </td>
-<td>
- <p>
- X
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
Geometric
</p>
</td>
@@ -682,38 +647,6 @@
<tr>
<td>
<p>
- Laplace
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-<td>
- <p>
- X
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
Maxwell
</p>
</td>
@@ -1256,7 +1189,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="compilers.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="credits.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="history1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="credits.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,7 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Internal Details and Tools (Experimental)</title>
+<title>Tools, Constants and Internal Details</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../index.html" title="Math Toolkit">
@@ -24,36 +24,37 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.toolkit"></a><a class="link" href="toolkit.html" title="Internal Details and Tools (Experimental)"> Internal Details and Tools (Experimental)</a>
+<a name="math_toolkit.toolkit"></a><a class="link" href="toolkit.html" title="Tools, Constants and Internal Details">Tools, Constants and Internal Details</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Overview</span></dt>
-<dt><span class="section"> Reused Utilities</span></dt>
+<dt><span class="section">Overview</span></dt>
+<dt><span class="section"><a href="toolkit/internals1.html">Utilities - Constants
+ & Tools</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="toolkit/internals1/constants.html"> Numeric
+<dt><span class="section"><a href="toolkit/internals1/constants.html">Numeric
Constants</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals1/series_evaluation.html">
- Series Evaluation</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals1/cf.html"> Continued Fraction
+<dt><span class="section"><a href="toolkit/internals1/series_evaluation.html">Series
Evaluation</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals1/rational.html"> Polynomial
+<dt><span class="section"><a href="toolkit/internals1/cf.html">Continued Fraction
+ Evaluation</a></span></dt>
+<dt><span class="section"><a href="toolkit/internals1/rational.html">Polynomial
and Rational Function Evaluation</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals1/roots.html"> Root Finding
- With Derivatives</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals1/roots2.html"> Root Finding
- Without Derivatives</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals1/minima.html"> Locating Function
- Minima</a></span></dt>
-<dt><span class="section"> Tuples</span></dt>
+<dt><span class="section"><a href="toolkit/internals1/roots.html">Root Finding
+ With Derivatives: Newton-Raphson, Halley & Schroeder</a></span></dt>
+<dt><span class="section"><a href="toolkit/internals1/roots2.html">Root Finding
+ Without Derivatives: Bisection, Bracket and TOMS748</a></span></dt>
+<dt><span class="section"><a href="toolkit/internals1/minima.html">Locating Function
+ Minima: Brent's algorithm</a></span></dt>
+<dt><span class="section">Tuples</span></dt>
</dl></dd>
-<dt><span class="section"> Testing and Development</span></dt>
+<dt><span class="section">Testing and Development</span></dt>
<dd><dl>
-<dt><span class="section"> Polynomials</span></dt>
-<dt><span class="section"><a href="toolkit/internals2/minimax.html"> Minimax Approximations
+<dt><span class="section">Polynomials</span></dt>
+<dt><span class="section"><a href="toolkit/internals2/minimax.html">Minimax Approximations
and the Remez Algorithm</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals2/error_test.html"> Relative
+<dt><span class="section"><a href="toolkit/internals2/error_test.html">Relative
Error and Testing</a></span></dt>
-<dt><span class="section"><a href="toolkit/internals2/test_data.html"> Graphing,
+<dt><span class="section"><a href="toolkit/internals2/test_data.html">Graphing,
Profiling, and Generating Test Data for Special Functions</a></span></dt>
</dl></dd>
</dl></div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,11 +1,11 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Reused Utilities</title>
+<title>Utilities - Constants & Tools</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
-<link rel="up" href="../toolkit.html" title="Internal Details and Tools (Experimental)">
+<link rel="up" href="../toolkit.html" title="Tools, Constants and Internal Details">
<link rel="prev" href="internals_overview.html" title="Overview">
<link rel="next" href="internals1/constants.html" title="Numeric Constants">
</head>
@@ -24,24 +24,25 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.toolkit.internals1"></a><a class="link" href="internals1.html" title="Reused Utilities"> Reused Utilities</a>
+<a name="math_toolkit.toolkit.internals1"></a><a class="link" href="internals1.html" title="Utilities - Constants & Tools">Utilities - Constants
+ & Tools</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="internals1/constants.html"> Numeric
+<dt><span class="section"><a href="internals1/constants.html">Numeric
Constants</a></span></dt>
-<dt><span class="section"><a href="internals1/series_evaluation.html">
- Series Evaluation</a></span></dt>
-<dt><span class="section"><a href="internals1/cf.html"> Continued Fraction
+<dt><span class="section"><a href="internals1/series_evaluation.html">Series
Evaluation</a></span></dt>
-<dt><span class="section"><a href="internals1/rational.html"> Polynomial
+<dt><span class="section"><a href="internals1/cf.html">Continued Fraction
+ Evaluation</a></span></dt>
+<dt><span class="section"><a href="internals1/rational.html">Polynomial
and Rational Function Evaluation</a></span></dt>
-<dt><span class="section"><a href="internals1/roots.html"> Root Finding
- With Derivatives</a></span></dt>
-<dt><span class="section"><a href="internals1/roots2.html"> Root Finding
- Without Derivatives</a></span></dt>
-<dt><span class="section"><a href="internals1/minima.html"> Locating Function
- Minima</a></span></dt>
-<dt><span class="section"> Tuples</span></dt>
+<dt><span class="section"><a href="internals1/roots.html">Root Finding
+ With Derivatives: Newton-Raphson, Halley & Schroeder</a></span></dt>
+<dt><span class="section"><a href="internals1/roots2.html">Root Finding
+ Without Derivatives: Bisection, Bracket and TOMS748</a></span></dt>
+<dt><span class="section"><a href="internals1/minima.html">Locating Function
+ Minima: Brent's algorithm</a></span></dt>
+<dt><span class="section">Tuples</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
<link rel="prev" href="series_evaluation.html" title="Series Evaluation">
<link rel="next" href="rational.html" title="Polynomial and Rational Function Evaluation">
</head>
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.cf"></a><a class="link" href="cf.html" title="Continued Fraction Evaluation"> Continued Fraction
+<a name="math_toolkit.toolkit.internals1.cf"></a><a class="link" href="cf.html" title="Continued Fraction Evaluation">Continued Fraction
Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.cf.synopsis"></a><h5>
-<a name="id1193644"></a>
+<a name="id1322220"></a>
<a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.synopsis">Synopsis</a>
</h5>
<p>
@@ -78,7 +78,7 @@
<span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.toolkit.internals1.cf.description"></a><h5>
-<a name="id1195904"></a>
+<a name="id1323252"></a>
<a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.description">Description</a>
</h5>
<p>
@@ -178,7 +178,7 @@
a continued fraction for convergence.
</p>
<a name="math_toolkit.toolkit.internals1.cf.implementation"></a><h5>
-<a name="id1196116"></a>
+<a name="id1323461"></a>
<a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.implementation">Implementation</a>
</h5>
<p>
@@ -188,7 +188,7 @@
Lentz, W.J. 1976, Applied Optics, vol. 15, pp. 668-671.
</p>
<a name="math_toolkit.toolkit.internals1.cf.examples"></a><h5>
-<a name="id1196132"></a>
+<a name="id1323477"></a>
<a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.examples">Examples</a>
</h5>
<p>
@@ -229,7 +229,7 @@
<span class="inlinemediaobject"><img src="../../../../equations/fraction4.png"></span>
</p>
<p>
- So it's generator object would look like:
+ So its generator object would look like:
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">tan_fraction</span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -5,8 +5,8 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
-<link rel="prev" href="../internals1.html" title="Reused Utilities">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
+<link rel="prev" href="../internals1.html" title="Utilities - Constants & Tools">
<link rel="next" href="series_evaluation.html" title="Series Evaluation">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.constants"></a><a class="link" href="constants.html" title="Numeric Constants"> Numeric
+<a name="math_toolkit.toolkit.internals1.constants"></a><a class="link" href="constants.html" title="Numeric Constants">Numeric
Constants</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.constants.synopsis"></a><h5>
-<a name="id1189569"></a>
+<a name="id1318024"></a>
<a class="link" href="constants.html#math_toolkit.toolkit.internals1.constants.synopsis">Synopsis</a>
</h5>
<p>
@@ -59,7 +59,7 @@
<span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.toolkit.internals1.constants.description"></a><h5>
-<a name="id1190209"></a>
+<a name="id1318663"></a>
<a class="link" href="constants.html#math_toolkit.toolkit.internals1.constants.description">Description</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,12 +1,12 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Locating Function Minima</title>
+<title>Locating Function Minima: Brent's algorithm</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
-<link rel="prev" href="roots2.html" title="Root Finding Without Derivatives">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
+<link rel="prev" href="roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">
<link rel="next" href="tuples.html" title="Tuples">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.minima"></a><a class="link" href="minima.html" title="Locating Function Minima"> Locating Function
- Minima</a>
+<a name="math_toolkit.toolkit.internals1.minima"></a><a class="link" href="minima.html" title="Locating Function Minima: Brent's algorithm">Locating Function
+ Minima: Brent's algorithm</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.minima.synopsis"></a><h5>
-<a name="id1212850"></a>
+<a name="id1340649"></a>
<a class="link" href="minima.html#math_toolkit.toolkit.internals1.minima.synopsis">synopsis</a>
</h5>
<p>
@@ -45,7 +45,7 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span> <span class="identifier">brent_find_minima</span><span class="special">(</span><span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">bits</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
</pre>
<a name="math_toolkit.toolkit.internals1.minima.description"></a><h5>
-<a name="id1213196"></a>
+<a name="id1340994"></a>
<a class="link" href="minima.html#math_toolkit.toolkit.internals1.minima.description">Description</a>
</h5>
<p>
@@ -72,9 +72,10 @@
<dd><p>
The number of bits precision to which the minima should be found.
Note that in principle, the minima can not be located to greater
- accuracy than the square root of machine epsilon, therefore if <span class="emphasis"><em>bits</em></span>
- is set to a value greater than one half of the bits in type T, then
- the value will be ignored.
+ accuracy than the square root of machine epsilon (for 64-bit double,
+ sqrt(1e-16)≅1e-8), therefore if <span class="emphasis"><em>bits</em></span> is set to
+ a value greater than one half of the bits in type T, then the value
+ will be ignored.
</p></dd>
<dt><span class="term">max_iter</span></dt>
<dd><p>
@@ -89,7 +90,7 @@
the abscissa at the minima and the value of f(x) at the minima.
</p>
<a name="math_toolkit.toolkit.internals1.minima.implementation"></a><h5>
-<a name="id1213308"></a>
+<a name="id1341105"></a>
<a class="link" href="minima.html#math_toolkit.toolkit.internals1.minima.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -5,9 +5,9 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
<link rel="prev" href="cf.html" title="Continued Fraction Evaluation">
-<link rel="next" href="roots.html" title="Root Finding With Derivatives">
+<link rel="next" href="roots.html" title="Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.rational"></a><a class="link" href="rational.html" title="Polynomial and Rational Function Evaluation"> Polynomial
+<a name="math_toolkit.toolkit.internals1.rational"></a><a class="link" href="rational.html" title="Polynomial and Rational Function Evaluation">Polynomial
and Rational Function Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.rational.synopsis"></a><h5>
-<a name="id1196860"></a>
+<a name="id1324202"></a>
<a class="link" href="rational.html#math_toolkit.toolkit.internals1.rational.synopsis">synopsis</a>
</h5>
<p>
@@ -79,7 +79,7 @@
<span class="identifier">V</span> <span class="identifier">evaluate_rational</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">*</span> <span class="identifier">num</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">U</span><span class="special">*</span> <span class="identifier">denom</span><span class="special">,</span> <span class="identifier">V</span> <span class="identifier">z</span><span class="special">,</span> <span class="keyword">unsigned</span> <span class="identifier">count</span><span class="special">);</span>
</pre>
<a name="math_toolkit.toolkit.internals1.rational.description"></a><h5>
-<a name="id1198990"></a>
+<a name="id1326879"></a>
<a class="link" href="rational.html#math_toolkit.toolkit.internals1.rational.description">Description</a>
</h5>
<p>
@@ -193,7 +193,7 @@
evaluation with compile-time array sizes may offer slightly better performance.
</p>
<a name="math_toolkit.toolkit.internals1.rational.implementation"></a><h5>
-<a name="id1200830"></a>
+<a name="id1329950"></a>
<a class="link" href="rational.html#math_toolkit.toolkit.internals1.rational.implementation">Implementation</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,13 +1,13 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Root Finding With Derivatives</title>
+<title>Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
<link rel="prev" href="rational.html" title="Polynomial and Rational Function Evaluation">
-<link rel="next" href="roots2.html" title="Root Finding Without Derivatives">
+<link rel="next" href="roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.roots"></a><a class="link" href="roots.html" title="Root Finding With Derivatives"> Root Finding
- With Derivatives</a>
+<a name="math_toolkit.toolkit.internals1.roots"></a><a class="link" href="roots.html" title="Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder">Root Finding
+ With Derivatives: Newton-Raphson, Halley & Schroeder</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.roots.synopsis"></a><h5>
-<a name="id1200892"></a>
+<a name="id1330011"></a>
<a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.synopsis">Synopsis</a>
</h5>
<p>
@@ -38,7 +38,8 @@
</pre>
<p>
</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tools</span><span class="special">{</span>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
+<span class="keyword">namespace</span> <span class="identifier">tools</span><span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">newton_raphson_iterate</span><span class="special">(</span><span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">guess</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">digits</span><span class="special">);</span>
@@ -61,17 +62,23 @@
<span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.toolkit.internals1.roots.description"></a><h5>
-<a name="id1201759"></a>
+<a name="id1330878"></a>
<a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.description">Description</a>
</h5>
<p>
- These functions all perform iterative root finding: <code class="computeroutput"><span class="identifier">newton_raphson_iterate</span></code>
- performs second order <a class="link" href="roots.html#newton">Newton Raphson iteration</a>,
- while <code class="computeroutput"><span class="identifier">halley_iterate</span></code> and
- <code class="computeroutput"><span class="identifier">schroeder_iterate</span></code> perform
- third order <a class="link" href="roots.html#halley">Halley</a> and <a class="link" href="roots.html#schroeder">Schroeder</a>
- iteration respectively.
+ These functions all perform iterative root finding using derivatives:
</p>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ <code class="computeroutput"><span class="identifier">newton_raphson_iterate</span></code>performs
+ second order <a class="link" href="roots.html#newton">Newton-Raphson iteration</a>,
+ </li>
+<li>
+ <code class="computeroutput"><span class="identifier">halley_iterate</span></code> and<code class="computeroutput"><span class="identifier">schroeder_iterate</span></code> perform third order
+ <a class="link" href="roots.html#halley">Halley</a> and <a class="link" href="roots.html#schroeder">Schroeder</a>
+ iteration.
+ </li>
+</ul></div>
<p>
The functions all take the same parameters:
</p>
@@ -85,19 +92,21 @@
and returns a <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>:
</p>
<p>
- For the second order iterative methods (Newton Raphson) the <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>
- should have two elements containing the evaluation of the function
- and it's first derivative.
+ For the second order iterative methods (<a href="http://en.wikipedia.org/wiki/Newton_Raphson" target="_top">Newton
+ Raphson</a>) the <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>
+ should have <span class="bold"><strong>two</strong></span> elements containing
+ the evaluation of the function and its first derivative.
</p>
<p>
- For the third order methods (Halley and Schroeder) the <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>
- should have three elements containing the evaluation of the function
- and its first and second derivatives.
+ For the third order methods (Halley
+ and Schroeder) the <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>
+ should have <span class="bold"><strong>three</strong></span> elements containing
+ the evaluation of the function and its first and second derivatives.
</p>
</dd>
<dt><span class="term">T guess</span></dt>
<dd><p>
- The initial starting value.
+ The initial starting value. A good guess is crucial to quick convergence!
</p></dd>
<dt><span class="term">T min</span></dt>
<dd><p>
@@ -124,16 +133,19 @@
</p>
<div class="itemizedlist"><ul type="disc">
<li>
+ Default max_iter = <code class="computeroutput"><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">>::</span><span class="identifier">max</span><span class="special">)()</span></code> is effectively 'iterate for ever'!.
+ </li>
+<li>
They may be very sensitive to the initial guess, typically they converge
very rapidly if the initial guess has two or three decimal digits correct.
However convergence can be no better than bisection, or in some rare
- cases even worse than bisection if the initial guess is a long way
+ cases, even worse than bisection if the initial guess is a long way
from the correct value and the derivatives are close to zero.
</li>
<li>
These functions include special cases to handle zero first (and second
where appropriate) derivatives, and fall back to bisection in this
- case. However, it is helpful if F is defined to return an arbitrarily
+ case. However, it is helpful if functor F is defined to return an arbitrarily
small value <span class="emphasis"><em>of the correct sign</em></span> rather than zero.
</li>
<li>
@@ -144,11 +156,21 @@
not be appropriate in such cases.
</li>
<li>
+ If the function is 'Really Well Behaved' (monotonic and has only one
+ root) the bracket bounds min and max may as well be set to the widest
+ limits like zero and <code class="computeroutput"><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">max</span><span class="special">()</span></code>.
+ </li>
+<li>
+ But if the function more complex and may have more than one root or
+ a pole, the choice of bounds is protection against jumping out to seek
+ the 'wrong' root.
+ </li>
+<li>
These functions fall back to bisection if the next computed step would
take the next value out of bounds. The bounds are updated after each
step to ensure this leads to convergence. However, a good initial guess
backed up by asymptotically-tight bounds will improve performance no
- end rather than relying on bisection.
+ end - rather than relying on bisection.
</li>
<li>
The value of <span class="emphasis"><em>digits</em></span> is crucial to good performance
@@ -166,6 +188,16 @@
becomes inaccurate.
</li>
<li>
+ To get the binary digits of accuracy, use policies::get_max_root_iterations<Policy>()).
+ </li>
+<li>
+ If you need some diagnostic output to see what is going on, you can
+ <code class="computeroutput"><span class="preprocessor">#define</span> <span class="identifier">BOOST_MATH_INSTRUMENT</span></code>
+ before the <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">tools</span><span class="special">/</span><span class="identifier">roots</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>, and also ensure that display of
+ all the possibly significant digits with <code class="computeroutput"> <span class="identifier">cout</span><span class="special">.</span><span class="identifier">precision</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="keyword">double</span><span class="special">>::</span><span class="identifier">max_digits10</span><span class="special">)</span></code>: but be warned, this may produce copious
+ output!
+ </li>
+<li>
Finally: you may well be able to do better than these functions by
hand-coding the heuristics used so that they are tailored to a specific
function. You may also be able to compute the ratio of derivatives
@@ -173,10 +205,8 @@
themselves. As ever, algebraic simplification can be a big win.
</li>
</ul></div>
-<a name="newton"></a><p>
- </p>
-<a name="math_toolkit.toolkit.internals1.roots.newton_raphson_method"></a><h5>
-<a name="id1202008"></a>
+<a name="newton"></a><a name="math_toolkit.toolkit.internals1.roots.newton_raphson_method"></a><h5>
+<a name="id1331551"></a>
<a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.newton_raphson_method">Newton
Raphson Method</a>
</h5>
@@ -193,10 +223,8 @@
Under ideal conditions, the number of correct digits doubles with each
iteration.
</p>
-<a name="halley"></a><p>
- </p>
-<a name="math_toolkit.toolkit.internals1.roots.halley_s_method"></a><h5>
-<a name="id1202066"></a>
+<a name="halley"></a><a name="math_toolkit.toolkit.internals1.roots.halley_s_method"></a><h5>
+<a name="id1331606"></a>
<a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.halley_s_method">Halley's
Method</a>
</h5>
@@ -217,10 +245,8 @@
Under ideal conditions, the number of correct digits trebles with each
iteration.
</p>
-<a name="schroeder"></a><p>
- </p>
-<a name="math_toolkit.toolkit.internals1.roots.schroeder_s_method"></a><h5>
-<a name="id1202127"></a>
+<a name="schroeder"></a><a name="math_toolkit.toolkit.internals1.roots.schroeder_s_method"></a><h5>
+<a name="id1331664"></a>
<a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.schroeder_s_method">Schroeder's
Method</a>
</h5>
@@ -244,33 +270,36 @@
iteration.
</p>
<a name="math_toolkit.toolkit.internals1.roots.example"></a><h5>
-<a name="id1204047"></a>
+<a name="id1331719"></a>
<a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.example">Example</a>
</h5>
<p>
- Lets suppose we want to find the cube root of a number, the equation we
+ Let's suppose we want to find the cube root of a number: the equation we
want to solve along with its derivatives are:
</p>
<p>
<span class="inlinemediaobject"><img src="../../../../equations/roots4.png"></span>
</p>
<p>
- To begin with lets solve the problem using Newton Raphson iterations, we'll
- begin be defining a function object that returns the evaluation of the
- function to solve, along with its first derivative:
+ To begin with lets solve the problem using Newton-Raphson iterations, we'll
+ begin by defining a function object (functor) that returns the evaluation
+ of the function to solve, along with its first derivative f'(x):
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">cbrt_functor</span>
<span class="special">{</span>
- <span class="identifier">cbrt_functor</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">target</span><span class="special">)</span> <span class="special">:</span> <span class="identifier">a</span><span class="special">(</span><span class="identifier">target</span><span class="special">){}</span>
+ <span class="identifier">cbrt_functor</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">target</span><span class="special">)</span> <span class="special">:</span> <span class="identifier">a</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span>
+ <span class="special">{</span> <span class="comment">// Constructor stores value to be 'cube-rooted'.
+</span> <span class="special">}</span>
<a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">z</span><span class="special">)</span>
- <span class="special">{</span>
- <span class="identifier">T</span> <span class="identifier">sqr</span> <span class="special">=</span> <span class="identifier">z</span> <span class="special">*</span> <span class="identifier">z</span><span class="special">;</span>
- <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">make_tuple</span><span class="special">(</span><span class="identifier">sqr</span> <span class="special">*</span> <span class="identifier">z</span> <span class="special">-</span> <span class="identifier">a</span><span class="special">,</span> <span class="number">3</span> <span class="special">*</span> <span class="identifier">sqr</span><span class="special">);</span>
- <span class="special">}</span>
+ <span class="special">{</span> <span class="comment">// z is estimate so far.
+</span> <span class="keyword">return</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">make_tuple</span><span class="special">(</span>
+ <span class="identifier">z</span><span class="special">*</span><span class="identifier">z</span><span class="special">*</span><span class="identifier">z</span> <span class="special">-</span> <span class="identifier">a</span><span class="special">,</span> <span class="comment">// return both f(x)
+</span> <span class="number">3</span> <span class="special">*</span> <span class="identifier">z</span><span class="special">*</span><span class="identifier">z</span><span class="special">);</span> <span class="comment">// and f'(x)
+</span> <span class="special">}</span>
<span class="keyword">private</span><span class="special">:</span>
- <span class="identifier">T</span> <span class="identifier">a</span><span class="special">;</span>
-<span class="special">};</span>
+ <span class="identifier">T</span> <span class="identifier">a</span><span class="special">;</span> <span class="comment">// to be 'cube-rooted'.
+</span><span class="special">};</span>
</pre>
<p>
Implementing the cube root is fairly trivial now, the hardest part is finding
@@ -280,14 +309,16 @@
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">T</span> <span class="identifier">cbrt</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">z</span><span class="special">)</span>
<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">std</span><span class="special">;</span>
+ <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">std</span><span class="special">;</span> <span class="comment">// for frexp, ldexp, numeric_limits.
+</span> <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tools</span><span class="special">;</span>
+
<span class="keyword">int</span> <span class="identifier">exp</span><span class="special">;</span>
- <span class="identifier">frexp</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span> <span class="special">&</span><span class="identifier">exp</span><span class="special">);</span>
- <span class="identifier">T</span> <span class="identifier">min</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">0.5</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span>
+ <span class="identifier">frexp</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span> <span class="special">&</span><span class="identifier">exp</span><span class="special">);</span> <span class="comment">// Get exponent of z (ignore mantissa).
+</span> <span class="identifier">T</span> <span class="identifier">min</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">0.5</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span>
<span class="identifier">T</span> <span class="identifier">max</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">2.0</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span>
- <span class="identifier">T</span> <span class="identifier">guess</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">1.0</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span>
- <span class="keyword">int</span> <span class="identifier">digits</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">digits</span><span class="special">;</span>
- <span class="keyword">return</span> <span class="identifier">tools</span><span class="special">::</span><span class="identifier">newton_raphson_iterate</span><span class="special">(</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">cbrt_functor</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">z</span><span class="special">),</span> <span class="identifier">guess</span><span class="special">,</span> <span class="identifier">min</span><span class="special">,</span> <span class="identifier">max</span><span class="special">,</span> <span class="identifier">digits</span><span class="special">);</span>
+ <span class="identifier">T</span> <span class="identifier">guess</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">1.0</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span> <span class="comment">// Rough guess is to divide the exponent by three.
+</span> <span class="keyword">int</span> <span class="identifier">digits</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">digits</span><span class="special">;</span> <span class="comment">// Maximum possible binary digits accuracy for type T.
+</span> <span class="keyword">return</span> <span class="identifier">newton_raphson_iterate</span><span class="special">(</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">cbrt_functor</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">z</span><span class="special">),</span> <span class="identifier">guess</span><span class="special">,</span> <span class="identifier">min</span><span class="special">,</span> <span class="identifier">max</span><span class="special">,</span> <span class="identifier">digits</span><span class="special">);</span>
<span class="special">}</span>
</pre>
<p>
@@ -295,7 +326,7 @@
root exact to the last digit in every case, and in no more than 6 iterations
at double precision. However, you will note that a high precision was used
in this example, exactly what was warned against earlier on in these docs!
- In this particular case its possible to compute f(x) exactly and without
+ In this particular case it is possible to compute f(x) exactly and without
undue cancellation error, so a high limit is not too much of an issue.
However, reducing the limit to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">digits</span>
<span class="special">*</span> <span class="number">2</span> <span class="special">/</span> <span class="number">3</span></code> gave
@@ -304,12 +335,15 @@
cases was reduced by one.
</p>
<p>
- Note also that the above code omits error handling, and does not handle
- negative values of z correctly. That will be left as an exercise for the
- reader!
+ Note also that the above code omits a probably optimization by computing
+ z², and reusing it, omits error handling, and does not handle negative values
+ of z correctly. (These are left as an exercise for the reader!)
+ </p>
+<p>
+ The boost::math::cbrt function also includes these and other improvements.
</p>
<p>
- Now lets adapt the functor slightly to return the second derivative as
+ Now let's adapt the functor slightly to return the second derivative as
well:
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -318,8 +352,10 @@
<span class="identifier">cbrt_functor</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">target</span><span class="special">)</span> <span class="special">:</span> <span class="identifier">a</span><span class="special">(</span><span class="identifier">target</span><span class="special">){}</span>
<a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">z</span><span class="special">)</span>
<span class="special">{</span>
- <span class="identifier">T</span> <span class="identifier">sqr</span> <span class="special">=</span> <span class="identifier">z</span> <span class="special">*</span> <span class="identifier">z</span><span class="special">;</span>
- <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">make_tuple</span><span class="special">(</span><span class="identifier">sqr</span> <span class="special">*</span> <span class="identifier">z</span> <span class="special">-</span> <span class="identifier">a</span><span class="special">,</span> <span class="number">3</span> <span class="special">*</span> <span class="identifier">sqr</span><span class="special">,</span> <span class="number">6</span> <span class="special">*</span> <span class="identifier">z</span><span class="special">);</span>
+ <span class="keyword">return</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">make_tuple</span><span class="special">(</span>
+ <span class="identifier">z</span><span class="special">*</span><span class="identifier">z</span><span class="special">*</span><span class="identifier">z</span> <span class="special">-</span> <span class="identifier">a</span><span class="special">,</span>
+ <span class="number">3</span> <span class="special">*</span> <span class="identifier">z</span><span class="special">*</span><span class="identifier">z</span><span class="special">,</span>
+ <span class="number">6</span> <span class="special">*</span> <span class="identifier">z</span><span class="special">);</span>
<span class="special">}</span>
<span class="keyword">private</span><span class="special">:</span>
<span class="identifier">T</span> <span class="identifier">a</span><span class="special">;</span>
@@ -333,18 +369,20 @@
<span class="identifier">T</span> <span class="identifier">cbrt</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">z</span><span class="special">)</span>
<span class="special">{</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">std</span><span class="special">;</span>
+ <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tools</span><span class="special">;</span>
+
<span class="keyword">int</span> <span class="identifier">exp</span><span class="special">;</span>
<span class="identifier">frexp</span><span class="special">(</span><span class="identifier">z</span><span class="special">,</span> <span class="special">&</span><span class="identifier">exp</span><span class="special">);</span>
<span class="identifier">T</span> <span class="identifier">min</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">0.5</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span>
<span class="identifier">T</span> <span class="identifier">max</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">2.0</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span>
<span class="identifier">T</span> <span class="identifier">guess</span> <span class="special">=</span> <span class="identifier">ldexp</span><span class="special">(</span><span class="number">1.0</span><span class="special">,</span> <span class="identifier">exp</span><span class="special">/</span><span class="number">3</span><span class="special">);</span>
<span class="keyword">int</span> <span class="identifier">digits</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">digits</span> <span class="special">/</span> <span class="number">2</span><span class="special">;</span>
- <span class="keyword">return</span> <span class="identifier">tools</span><span class="special">::</span><span class="identifier">halley_iterate</span><span class="special">(</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">cbrt_functor</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">z</span><span class="special">),</span> <span class="identifier">guess</span><span class="special">,</span> <span class="identifier">min</span><span class="special">,</span> <span class="identifier">max</span><span class="special">,</span> <span class="identifier">digits</span><span class="special">);</span>
+ <span class="keyword">return</span> <span class="identifier">halley_iterate</span><span class="special">(</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">cbrt_functor</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">z</span><span class="special">),</span> <span class="identifier">guess</span><span class="special">,</span> <span class="identifier">min</span><span class="special">,</span> <span class="identifier">max</span><span class="special">,</span> <span class="identifier">digits</span><span class="special">);</span>
<span class="special">}</span>
</pre>
<p>
Note that the iterations are set to stop at just one-half of full precision,
- and yet even so not one of the test cases had a single bit wrong. What's
+ and yet, even so, not one of the test cases had a single bit wrong. What's
more, the maximum number of iterations was now just 4.
</p>
<p>
@@ -359,12 +397,15 @@
<p>
Finally, had we called cbrt with NTL::RR
set to 1000 bit precision, then full precision can be obtained with just
- 7 iterations. To put that in perspective an increase in precision by a
+ 7 iterations. To put that in perspective, an increase in precision by a
factor of 20, has less than doubled the number of iterations. That just
goes to emphasise that most of the iterations are used up getting the first
few digits correct: after that these methods can churn out further digits
- with remarkable efficiency. Or to put it another way: <span class="emphasis"><em>nothing
- beats a really good initial guess!</em></span>
+ with remarkable efficiency.
+ </p>
+<p>
+ Or to put it another way: <span class="emphasis"><em>nothing beats a really good initial
+ guess!</em></span>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,13 +1,13 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Root Finding Without Derivatives</title>
+<title>Root Finding Without Derivatives: Bisection, Bracket and TOMS748</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
-<link rel="prev" href="roots.html" title="Root Finding With Derivatives">
-<link rel="next" href="minima.html" title="Locating Function Minima">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
+<link rel="prev" href="roots.html" title="Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder">
+<link rel="next" href="minima.html" title="Locating Function Minima: Brent's algorithm">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.roots2"></a><a class="link" href="roots2.html" title="Root Finding Without Derivatives"> Root Finding
- Without Derivatives</a>
+<a name="math_toolkit.toolkit.internals1.roots2"></a><a class="link" href="roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">Root Finding
+ Without Derivatives: Bisection, Bracket and TOMS748</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.roots2.synopsis"></a><h5>
-<a name="id1205569"></a>
+<a name="id1333312"></a>
<a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.synopsis">Synopsis</a>
</h5>
<p>
@@ -38,118 +38,124 @@
</pre>
<p>
</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tools</span><span class="special">{</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">bisect</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span>
- <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">bisect</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span>
- <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">bisect</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span>
- <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
- <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">bracket_and_solve_root</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">guess</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">factor</span><span class="special">,</span>
- <span class="keyword">bool</span> <span class="identifier">rising</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">bracket_and_solve_root</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">guess</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">factor</span><span class="special">,</span>
- <span class="keyword">bool</span> <span class="identifier">rising</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
- <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">toms748_solve</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">toms748_solve</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
- <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">toms748_solve</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fa</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fb</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
-
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
- <span class="identifier">toms748_solve</span><span class="special">(</span>
- <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fa</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fb</span><span class="special">,</span>
- <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
- <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
-
-<span class="comment">// Termination conditions:
-</span><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
-<span class="keyword">struct</span> <span class="identifier">eps_tolerance</span><span class="special">;</span>
-
-<span class="keyword">struct</span> <span class="identifier">equal_floor</span><span class="special">;</span>
-<span class="keyword">struct</span> <span class="identifier">equal_ceil</span><span class="special">;</span>
-<span class="keyword">struct</span> <span class="identifier">equal_nearest_integer</span><span class="special">;</span>
-
-<span class="special">}}}</span> <span class="comment">// namespaces
+<pre class="programlisting"> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
+ <span class="keyword">namespace</span> <span class="identifier">tools</span><span class="special">{</span>
+ <span class="comment">// Bisection
+</span> <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">bisect</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span>
+ <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">bisect</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span>
+ <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">bisect</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="identifier">T</span> <span class="identifier">min</span><span class="special">,</span>
+ <span class="identifier">T</span> <span class="identifier">max</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
+ <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
+
+ <span class="comment">// Bracket and Solve Root
+</span> <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">bracket_and_solve_root</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">guess</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">factor</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="identifier">rising</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">bracket_and_solve_root</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">guess</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">factor</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="identifier">rising</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
+ <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
+
+<span class="comment">// TOMS 748 algorithm
+</span> <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">toms748_solve</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">toms748_solve</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
+ <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
+
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">toms748_solve</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fa</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fb</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">,</span> <span class="keyword">class</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="identifier">toms748_solve</span><span class="special">(</span>
+ <span class="identifier">F</span> <span class="identifier">f</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fa</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">fb</span><span class="special">,</span>
+ <span class="identifier">Tol</span> <span class="identifier">tol</span><span class="special">,</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">uintmax_t</span><span class="special">&</span> <span class="identifier">max_iter</span><span class="special">,</span>
+ <span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
+
+ <span class="comment">// Termination conditions:
+</span> <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
+ <span class="keyword">struct</span> <span class="identifier">eps_tolerance</span><span class="special">;</span>
+
+ <span class="keyword">struct</span> <span class="identifier">equal_floor</span><span class="special">;</span>
+ <span class="keyword">struct</span> <span class="identifier">equal_ceil</span><span class="special">;</span>
+ <span class="keyword">struct</span> <span class="identifier">equal_nearest_integer</span><span class="special">;</span>
+
+ <span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.toolkit.internals1.roots2.description"></a><h5>
-<a name="id1207558"></a>
+<a name="id1336724"></a>
<a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.description">Description</a>
</h5>
<p>
These functions solve the root of some function <span class="emphasis"><em>f(x)</em></span>
- without the need for the derivatives of <span class="emphasis"><em>f(x)</em></span>. The
- functions here that use TOMS Algorithm 748 are asymptotically the most
- efficient known, and have been shown to be optimal for a certain classes
- of smooth functions.
+ <span class="emphasis"><em>without the need for any derivatives of <span class="emphasis"><em>f(x)</em></span></em></span>.
+ </p>
+<p>
+ The <code class="computeroutput"><span class="identifier">bracket_and_solve_root</span></code>
+ functions use TOMS Algorithm 748 that is asymptotically the most efficient
+ known, and have been shown to be optimal for a certain classes of smooth
+ functions. Variants with and without __policies are provided.
</p>
<p>
Alternatively, there is a simple bisection routine which can be useful
@@ -174,6 +180,10 @@
to be an integer. Other user-defined termination conditions are likely
to be used only rarely, but may be useful in some specific circumstances.
</p>
+<a name="math_toolkit.toolkit.internals1.roots2.bisection"></a><h5>
+<a name="id1336788"></a>
+ <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.bisection">Bisection</a>
+ </h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">bisect</span><span class="special">(</span>
@@ -202,7 +212,7 @@
<span class="keyword">const</span> <a class="link" href="../../policy.html" title="Policies">Policy</a><span class="special">&);</span>
</pre>
<p>
- These functions locate the root using bisection, function arguments are:
+ These functions locate the root using bisection: function arguments are:
</p>
<div class="variablelist">
<p class="title"><b></b></p>
@@ -238,14 +248,9 @@
</dl>
</div>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
Returns: a pair of values <span class="emphasis"><em>r</em></span> that bracket the root
@@ -270,10 +275,15 @@
<p>
In other words, it's up to the caller to verify whether termination occurred
as a result of exceeding <span class="emphasis"><em>max_iter</em></span> function invocations
- (easily done by checking the value of <span class="emphasis"><em>max_iter</em></span> when
- the function returns), rather than because the termination condition <span class="emphasis"><em>tol</em></span>
- was satisfied.
- </p>
+ (easily done by checking the updated value of <span class="emphasis"><em>max_iter</em></span>
+ when the function returns), rather than because the termination condition
+ <span class="emphasis"><em>tol</em></span> was satisfied.
+ </p>
+<a name="math_toolkit.toolkit.internals1.roots2.bracket_and_solve"></a><h5>
+<a name="id1338146"></a>
+ <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.bracket_and_solve">Bracket
+ and solve</a>
+ </h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">bracket_and_solve_root</span><span class="special">(</span>
@@ -346,14 +356,9 @@
</dl>
</div>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
Returns: a pair of values <span class="emphasis"><em>r</em></span> that bracket the root
@@ -382,6 +387,11 @@
the function returns), rather than because the termination condition <span class="emphasis"><em>tol</em></span>
was satisfied.
</p>
+<a name="math_toolkit.toolkit.internals1.roots2.algorithm_toms_748__alefeld__potra_and_shi__enclosing_zeros_of_continuous_functions"></a><h5>
+<a name="id1338929"></a>
+ <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.algorithm_toms_748__alefeld__potra_and_shi__enclosing_zeros_of_continuous_functions">Algorithm
+ TOMS 748: Alefeld, Potra and Shi: Enclosing zeros of continuous functions</a>
+ </h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">F</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Tol</span><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">toms748_solve</span><span class="special">(</span>
@@ -429,7 +439,7 @@
cubic, quadratic and linear (secant) interpolation to locate the root of
<span class="emphasis"><em>f(x)</em></span>. The two functions differ only by whether values
for <span class="emphasis"><em>f(a)</em></span> and <span class="emphasis"><em>f(b)</em></span> are already
- available. The parameters are:
+ available. The toms748_solve parameters are:
</p>
<div class="variablelist">
<p class="title"><b></b></p>
@@ -463,7 +473,7 @@
<dd><p>
A binary functor that determines the termination condition for the
search for the root. <span class="emphasis"><em>tol</em></span> is passed the current
- brackets at each step, when it returns true then the current brackets
+ brackets at each step, when it returns true, then the current brackets
are returned as the result.
</p></dd>
<dt><span class="term">max_iter</span></dt>
@@ -475,40 +485,22 @@
</dl>
</div>
<p>
- </p>
-<p>
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- </p>
-<p>
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
</p>
<p>
- Returns: a pair of values <span class="emphasis"><em>r</em></span> that bracket the root
- so that:
- </p>
-<pre class="programlisting"><span class="identifier">f</span><span class="special">(</span><span class="identifier">r</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">f</span><span class="special">(</span><span class="identifier">r</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span> <span class="special"><=</span> <span class="number">0</span>
-</pre>
-<p>
- and either
- </p>
-<pre class="programlisting"><span class="identifier">tol</span><span class="special">(</span><span class="identifier">r</span><span class="special">.</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">true</span>
-</pre>
-<p>
- or
- </p>
-<pre class="programlisting"><span class="identifier">max_iter</span> <span class="special">>=</span> <span class="identifier">m</span>
-</pre>
-<p>
- where <span class="emphasis"><em>m</em></span> is the initial value of <span class="emphasis"><em>max_iter</em></span>
- passed to the function.
+ toms748_solve returns: a pair of values <span class="emphasis"><em>r</em></span> that bracket
+ the root so that: f(r.first) * f(r.second) <= 0 and either tol(r.first,
+ r.second) <code class="literal">= true or max_iter ></code> m where <span class="emphasis"><em>m</em></span>
+ is the initial value of <span class="emphasis"><em>max_iter</em></span> passed to the function.
</p>
<p>
In other words, it's up to the caller to verify whether termination occurred
as a result of exceeding <span class="emphasis"><em>max_iter</em></span> function invocations
- (easily done by checking the value of <span class="emphasis"><em>max_iter</em></span>), rather
- than because the termination condition <span class="emphasis"><em>tol</em></span> was satisfied.
+ (easily done by checking the updated value of <span class="emphasis"><em>max_iter</em></span>
+ against its previous value passed as parameter), rather than because the
+ termination condition <span class="emphasis"><em>tol</em></span> was satisfied.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">eps_tolerance</span>
@@ -518,10 +510,11 @@
<span class="special">};</span>
</pre>
<p>
- This is the usual termination condition used with these root finding functions.
- Its operator() will return true when the relative distance between <span class="emphasis"><em>a</em></span>
+ <code class="computeroutput"><span class="identifier">eps_tolerance</span></code> is the usual
+ termination condition used with these root finding functions. Its operator()
+ will return true when the relative distance between <span class="emphasis"><em>a</em></span>
and <span class="emphasis"><em>b</em></span> is less than twice the machine epsilon for T,
- or 2<sup>1-bits</sup>, whichever is the larger. In other words you set <span class="emphasis"><em>bits</em></span>
+ or 2<sup>1-bits</sup>, whichever is the larger. In other words, you set <span class="emphasis"><em>bits</em></span>
to the number of bits of precision you want in the result. The minimal
tolerance of twice the machine epsilon of T is required to ensure that
we get back a bracketing interval: since this must clearly be at least
@@ -561,12 +554,14 @@
as soon as both ends of the interval round to the same nearest integer.
</p>
<a name="math_toolkit.toolkit.internals1.roots2.implementation"></a><h5>
-<a name="id1212812"></a>
+<a name="id1340606"></a>
<a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.implementation">Implementation</a>
</h5>
<p>
The implementation of the bisection algorithm is extremely straightforward
- and not detailed here. TOMS algorithm 748 is described in detail in:
+ and not detailed here. <a href="http://portal.acm.org/citation.cfm?id=210111" target="_top">TOMS
+ Algorithm 748: enclosing zeros of continuous functions</a> is described
+ in detail in:
</p>
<p>
<span class="emphasis"><em>Algorithm 748: Enclosing Zeros of Continuous Functions, G. E.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
<link rel="prev" href="constants.html" title="Numeric Constants">
<link rel="next" href="cf.html" title="Continued Fraction Evaluation">
</head>
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.series_evaluation"></a><a class="link" href="series_evaluation.html" title="Series Evaluation">
- Series Evaluation</a>
+<a name="math_toolkit.toolkit.internals1.series_evaluation"></a><a class="link" href="series_evaluation.html" title="Series Evaluation">Series
+ Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.series_evaluation.synopsis"></a><h5>
-<a name="id1191938"></a>
+<a name="id1320518"></a>
<a class="link" href="series_evaluation.html#math_toolkit.toolkit.internals1.series_evaluation.synopsis">Synopsis</a>
</h5>
<p>
@@ -70,7 +70,7 @@
<span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.toolkit.internals1.series_evaluation.description"></a><h5>
-<a name="id1192949"></a>
+<a name="id1321529"></a>
<a class="link" href="series_evaluation.html#math_toolkit.toolkit.internals1.series_evaluation.description">Description</a>
</h5>
<p>
@@ -127,7 +127,7 @@
summation in this way.
</p>
<a name="math_toolkit.toolkit.internals1.series_evaluation.example"></a><h5>
-<a name="id1193048"></a>
+<a name="id1321628"></a>
<a class="link" href="series_evaluation.html#math_toolkit.toolkit.internals1.series_evaluation.example">Example</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -5,8 +5,8 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../internals1.html" title="Reused Utilities">
-<link rel="prev" href="minima.html" title="Locating Function Minima">
+<link rel="up" href="../internals1.html" title="Utilities - Constants & Tools">
+<link rel="prev" href="minima.html" title="Locating Function Minima: Brent's algorithm">
<link rel="next" href="../internals2.html" title="Testing and Development">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.tuples"></a><a class="link" href="tuples.html" title="Tuples"> Tuples</a>
+<a name="math_toolkit.toolkit.internals1.tuples"></a><a class="link" href="tuples.html" title="Tuples">Tuples</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.tuples.synopsis"></a><h5>
-<a name="id1213346"></a>
+<a name="id1341143"></a>
<a class="link" href="tuples.html#math_toolkit.toolkit.internals1.tuples.synopsis">Synopsis</a>
</h5>
<p>
@@ -38,7 +38,7 @@
<p>
</p>
<a name="math_toolkit.toolkit.internals1.tuples.description"></a><h5>
-<a name="id1213412"></a>
+<a name="id1341209"></a>
<a class="link" href="tuples.html#math_toolkit.toolkit.internals1.tuples.description">Description</a>
</h5>
<p>
@@ -65,6 +65,10 @@
boost::tuple.
</li>
</ul></div>
+<p>
+ So this <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tuple</span></code> is strongly recommended for maximum
+ portability.
+ </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
-<link rel="up" href="../toolkit.html" title="Internal Details and Tools (Experimental)">
+<link rel="up" href="../toolkit.html" title="Tools, Constants and Internal Details">
<link rel="prev" href="internals1/tuples.html" title="Tuples">
<link rel="next" href="internals2/polynomials.html" title="Polynomials">
</head>
@@ -24,15 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.toolkit.internals2"></a><a class="link" href="internals2.html" title="Testing and Development"> Testing and Development</a>
+<a name="math_toolkit.toolkit.internals2"></a><a class="link" href="internals2.html" title="Testing and Development">Testing and Development</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Polynomials</span></dt>
-<dt><span class="section"><a href="internals2/minimax.html"> Minimax Approximations
+<dt><span class="section">Polynomials</span></dt>
+<dt><span class="section"><a href="internals2/minimax.html">Minimax Approximations
and the Remez Algorithm</a></span></dt>
-<dt><span class="section"><a href="internals2/error_test.html"> Relative
+<dt><span class="section"><a href="internals2/error_test.html">Relative
Error and Testing</a></span></dt>
-<dt><span class="section"><a href="internals2/test_data.html"> Graphing,
+<dt><span class="section"><a href="internals2/test_data.html">Graphing,
Profiling, and Generating Test Data for Special Functions</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.error_test"></a><a class="link" href="error_test.html" title="Relative Error and Testing"> Relative
+<a name="math_toolkit.toolkit.internals2.error_test"></a><a class="link" href="error_test.html" title="Relative Error and Testing">Relative
Error and Testing</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals2.error_test.synopsis"></a><h5>
-<a name="id1216523"></a>
+<a name="id1345978"></a>
<a class="link" href="error_test.html#math_toolkit.toolkit.internals2.error_test.synopsis">Synopsis</a>
</h5>
<p>
@@ -45,7 +45,7 @@
<span class="identifier">test_result</span><span class="special"><</span><span class="identifier">see</span><span class="special">-</span><span class="identifier">below</span><span class="special">></span> <span class="identifier">test</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">A</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">F1</span> <span class="identifier">test_func</span><span class="special">,</span> <span class="identifier">F2</span> <span class="identifier">expect_func</span><span class="special">);</span>
</pre>
<a name="math_toolkit.toolkit.internals2.error_test.description"></a><h5>
-<a name="id1216779"></a>
+<a name="id1346475"></a>
<a class="link" href="error_test.html#math_toolkit.toolkit.internals2.error_test.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
@@ -157,7 +157,7 @@
is mainly a debugging/development aid (and a good place for a breakpoint).
</p>
<a name="math_toolkit.toolkit.internals2.error_test.example"></a><h5>
-<a name="id1219562"></a>
+<a name="id1347194"></a>
<a class="link" href="error_test.html#math_toolkit.toolkit.internals2.error_test.example">Example</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.minimax"></a><a class="link" href="minimax.html" title="Minimax Approximations and the Remez Algorithm"> Minimax Approximations
+<a name="math_toolkit.toolkit.internals2.minimax"></a><a class="link" href="minimax.html" title="Minimax Approximations and the Remez Algorithm">Minimax Approximations
and the Remez Algorithm</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.polynomials"></a><a class="link" href="polynomials.html" title="Polynomials"> Polynomials</a>
+<a name="math_toolkit.toolkit.internals2.polynomials"></a><a class="link" href="polynomials.html" title="Polynomials">Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals2.polynomials.synopsis"></a><h5>
-<a name="id1213552"></a>
+<a name="id1341374"></a>
<a class="link" href="polynomials.html#math_toolkit.toolkit.internals2.polynomials.synopsis">Synopsis</a>
</h5>
<p>
@@ -103,7 +103,7 @@
<span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.toolkit.internals2.polynomials.description"></a><h5>
-<a name="id1215611"></a>
+<a name="id1345071"></a>
<a class="link" href="polynomials.html#math_toolkit.toolkit.internals2.polynomials.description">Description</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.test_data"></a><a class="link" href="test_data.html" title="Graphing, Profiling, and Generating Test Data for Special Functions"> Graphing,
+<a name="math_toolkit.toolkit.internals2.test_data"></a><a class="link" href="test_data.html" title="Graphing, Profiling, and Generating Test Data for Special Functions">Graphing,
Profiling, and Generating Test Data for Special Functions</a>
</h4></div></div></div>
<p>
@@ -46,7 +46,7 @@
</li>
</ul></div>
<a name="math_toolkit.toolkit.internals2.test_data.synopsis"></a><h5>
-<a name="id1220365"></a>
+<a name="id1347993"></a>
<a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.synopsis">Synopsis</a>
</h5>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tools</span><span class="special">{</span>
@@ -147,7 +147,7 @@
<span class="special">}}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.toolkit.internals2.test_data.description"></a><h5>
-<a name="id1223079"></a>
+<a name="id1351390"></a>
<a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.description">Description</a>
</h5>
<p>
@@ -177,7 +177,7 @@
</li>
</ul></div>
<a name="math_toolkit.toolkit.internals2.test_data.example_1__output_data_for_graph_plotting"></a><h6>
-<a name="id1223135"></a>
+<a name="id1351446"></a>
<a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.example_1__output_data_for_graph_plotting">Example
1: Output Data for Graph Plotting</a>
</h6>
@@ -211,7 +211,7 @@
<span class="inlinemediaobject"><img src="../../../../graphs/lgamma.png" align="middle"></span>
</p>
<a name="math_toolkit.toolkit.internals2.test_data.example_2__creating_test_data"></a><h6>
-<a name="id1223539"></a>
+<a name="id1351852"></a>
<a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.example_2__creating_test_data">Example
2: Creating Test Data</a>
</h6>
@@ -376,7 +376,7 @@
used by default as it's rather hard on the compiler when the table is large.
</p>
<a name="math_toolkit.toolkit.internals2.test_data.example_3__profiling_a_continued_fraction_for_convergence_and_accuracy"></a><h6>
-<a name="id1227084"></a>
+<a name="id1354372"></a>
<a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.example_3__profiling_a_continued_fraction_for_convergence_and_accuracy">Example
3: Profiling a Continued Fraction for Convergence and Accuracy</a>
</h6>
@@ -482,14 +482,13 @@
of a and z.
</p>
<a name="math_toolkit.toolkit.internals2.test_data.reference"></a><h5>
-<a name="id1228743"></a>
+<a name="id1356035"></a>
<a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.reference">reference</a>
</h5>
-<a name="test_data_reference"></a><p>
- </p>
<p>
- Most of this tool has been described already in the examples above, we'll
- just add the following notes on the non-member functions:
+ <a name="test_data_reference"></a> Most of this tool has been described
+ already in the examples above, we'll just add the following notes on the
+ non-member functions:
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">parameter_info</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">make_random_param</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">start_range</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">end_range</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">n_points</span><span class="special">);</span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -5,9 +5,9 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
-<link rel="up" href="../toolkit.html" title="Internal Details and Tools (Experimental)">
-<link rel="prev" href="../toolkit.html" title="Internal Details and Tools (Experimental)">
-<link rel="next" href="internals1.html" title="Reused Utilities">
+<link rel="up" href="../toolkit.html" title="Tools, Constants and Internal Details">
+<link rel="prev" href="../toolkit.html" title="Tools, Constants and Internal Details">
+<link rel="next" href="internals1.html" title="Utilities - Constants & Tools">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.toolkit.internals_overview"></a><a class="link" href="internals_overview.html" title="Overview"> Overview</a>
+<a name="math_toolkit.toolkit.internals_overview"></a><a class="link" href="internals_overview.html" title="Overview">Overview</a>
</h3></div></div></div>
<p>
This section contains internal utilities used by the library's implementation
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,20 +24,20 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.using_udt"></a><a class="link" href="using_udt.html" title="Use with User-Defined Floating-Point Types"> Use with User-Defined Floating-Point
+<a name="math_toolkit.using_udt"></a><a class="link" href="using_udt.html" title="Use with User-Defined Floating-Point Types">Use with User-Defined Floating-Point
Types</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="using_udt/use_ntl.html"> Using With NTL - a High-Precision
+<dt><span class="section"><a href="using_udt/use_ntl.html">Using With NTL - a High-Precision
Floating-Point Library</a></span></dt>
-<dt><span class="section"><a href="using_udt/use_mpfr.html"> Using With MPFR / GMP
+<dt><span class="section"><a href="using_udt/use_mpfr.html">Using With MPFR / GMP
- a High-Precision Floating-Point Library</a></span></dt>
-<dt><span class="section"><a href="using_udt/concepts.html"> Conceptual Requirements
+<dt><span class="section"><a href="using_udt/concepts.html">Conceptual Requirements
for Real Number Types</a></span></dt>
-<dt><span class="section"><a href="using_udt/dist_concept.html"> Conceptual Requirements
+<dt><span class="section"><a href="using_udt/dist_concept.html">Conceptual Requirements
for Distribution Types</a></span></dt>
-<dt><span class="section"><a href="using_udt/archetypes.html"> Conceptual Archetypes
- and Testing</a></span></dt>
+<dt><span class="section"><a href="using_udt/archetypes.html">Conceptual Archetypes
+ for Reals and Distributions</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,7 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Conceptual Archetypes and Testing</title>
+<title>Conceptual Archetypes for Reals and Distributions</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
@@ -24,11 +24,27 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.archetypes"></a><a class="link" href="archetypes.html" title="Conceptual Archetypes and Testing"> Conceptual Archetypes
- and Testing</a>
+<a name="math_toolkit.using_udt.archetypes"></a><a class="link" href="archetypes.html" title="Conceptual Archetypes for Reals and Distributions">Conceptual Archetypes
+ for Reals and Distributions</a>
</h3></div></div></div>
<p>
- There are several concept archetypes available:
+ There are a few concept archetypes available:
+ </p>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ Real concept for floating-point types.
+ </li>
+<li>
+ distribution Concept for statistical distributions.
+ </li>
+</ul></div>
+<a name="math_toolkit.using_udt.archetypes.real_concept"></a><h6>
+<a name="id1364732"></a>
+ <a class="link" href="archetypes.html#math_toolkit.using_udt.archetypes.real_concept">Real concept</a>
+ </h6>
+<p>
+ <code class="computeroutput"><span class="identifier">std_real_concept</span></code> is an archetype
+ for theReal types, including the built-in float, double, long double.
</p>
<p>
@@ -38,17 +54,13 @@
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span>
<span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
-<span class="keyword">namespace</span> <span class="identifier">concepts</span><span class="special">{</span>
-
-<span class="keyword">class</span> <span class="identifier">std_real_concept</span><span class="special">;</span>
-
-<span class="special">}}}</span> <span class="comment">// namespaces
+<span class="keyword">namespace</span> <span class="identifier">concepts</span>
+<span class="special">{</span>
+ <span class="keyword">class</span> <span class="identifier">std_real_concept</span><span class="special">;</span>
+<span class="special">}</span>
+<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<p>
- <code class="computeroutput"><span class="identifier">std_real_concept</span></code> is an archetype
- for the built-in Real types.
- </p>
-<p>
The main purpose in providing this type is to verify that standard library
functions are found via a using declaration - bringing those functions into
the current scope - and not just because they happen to be in global scope.
@@ -57,8 +69,9 @@
In order to ensure that a call to say <code class="computeroutput"><span class="identifier">pow</span></code>
can be found either via argument dependent lookup, or failing that then in
the std namespace: all calls to standard library functions are unqualified,
- with the std:: versions found via a using declaration to make them visible
- in the current scope. Unfortunately it's all to easy to forget the using
+ with the std:: versions found via a <code class="computeroutput"><span class="keyword">using</span></code>
+ declaration to make them visible in the current scope. Unfortunately it's
+ all to easy to forget the <code class="computeroutput"><span class="keyword">using</span></code>
declaration, and call the double version of the function that happens to
be in the global scope by mistake.
</p>
@@ -70,9 +83,14 @@
library functions used have been brought into the current scope with a using
declaration.
</p>
+<a name="math_toolkit.using_udt.archetypes.testing_the_real_concept"></a><h4>
+<a name="id1364911"></a>
+ <a class="link" href="archetypes.html#math_toolkit.using_udt.archetypes.testing_the_real_concept">Testing
+ the real concept</a>
+ </h4>
<p>
There is a test program libs/math/test/std_real_concept_check.cpp
- that instantiates every template in this library with type <code class="computeroutput"><span class="identifier">std_real_concept</span></code> to verify it's usage of
+ that instantiates every template in this library with type <code class="computeroutput"><span class="identifier">std_real_concept</span></code> to verify its usage of
standard library functions.
</p>
<p>
@@ -92,12 +110,13 @@
<p>
<code class="computeroutput"><span class="identifier">real_concept</span></code> is an archetype
for <a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types">user defined real types</a>,
- it declares it's standard library functions in it's own namespace: these
- will only be found if they are called unqualified allowing argument dependent
+ it declares its standard library functions in its own namespace: these will
+ only be found if they are called unqualified allowing argument dependent
lookup to locate them. In addition this type is useable at runtime: this
allows code that would not otherwise be exercised by the built-in floating
point types to be tested. There is no std::numeric_limits<> support
- for this type, since this is not a conceptual requirement for <a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types">RealType</a>'s.
+ for this type, since numeric_limits is not a conceptual requirement for
+ <a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types">RealType</a>s.
</p>
<p>
NTL RR is an example of a type meeting the requirements that this type models,
@@ -110,6 +129,14 @@
as well as testing <code class="computeroutput"><span class="keyword">float</span></code>, <code class="computeroutput"><span class="keyword">double</span></code> and <code class="computeroutput"><span class="keyword">long</span>
<span class="keyword">double</span></code>, also tests <code class="computeroutput"><span class="identifier">real_concept</span></code>.
</p>
+<a name="math_toolkit.using_udt.archetypes.distribution_concept"></a><h4>
+<a name="id1365133"></a>
+ <a class="link" href="archetypes.html#math_toolkit.using_udt.archetypes.distribution_concept">Distribution
+ Concept</a>
+ </h4>
+<p>
+ Distribution Concept models statistical distributions.
+ </p>
<p>
</p>
@@ -118,8 +145,8 @@
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">{</span>
<span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
-<span class="keyword">namespace</span> <span class="identifier">concepts</span><span class="special">{</span>
-
+<span class="keyword">namespace</span> <span class="identifier">concepts</span>
+<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
<span class="keyword">class</span> <span class="identifier">distribution_archetype</span><span class="special">;</span>
@@ -138,6 +165,11 @@
is a <a href="../../../../../../../libs/concept_check/index.html" target="_top">concept checking
class</a> for distribution types.
</p>
+<a name="math_toolkit.using_udt.archetypes.testing_the_distribution_concept"></a><h4>
+<a name="id1365360"></a>
+ <a class="link" href="archetypes.html#math_toolkit.using_udt.archetypes.testing_the_distribution_concept">Testing
+ the distribution concept</a>
+ </h4>
<p>
The test program distribution_concept_check.cpp
is responsible for using <code class="computeroutput"><span class="identifier">DistributionConcept</span></code>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.concepts"></a><a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types"> Conceptual Requirements
+<a name="math_toolkit.using_udt.concepts"></a><a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types">Conceptual Requirements
for Real Number Types</a>
</h3></div></div></div>
<p>
@@ -42,7 +42,7 @@
behaves just like a built in floating point type.
</p>
<a name="math_toolkit.using_udt.concepts.basic_arithmetic_requirements"></a><h5>
-<a name="id1229795"></a>
+<a name="id1359242"></a>
<a class="link" href="concepts.html#math_toolkit.using_udt.concepts.basic_arithmetic_requirements">Basic
Arithmetic Requirements</a>
</h5>
@@ -1035,7 +1035,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.using_udt.concepts.standard_library_support_requirements"></a><h5>
-<a name="id1233610"></a>
+<a name="id1362896"></a>
<a class="link" href="concepts.html#math_toolkit.using_udt.concepts.standard_library_support_requirements">Standard
Library Support Requirements</a>
</h5>
@@ -1324,8 +1324,9 @@
<code class="computeroutput"><span class="identifier">cosh</span></code>, <code class="computeroutput"><span class="identifier">sinh</span></code>,
<code class="computeroutput"><span class="identifier">tanh</span></code>, <code class="computeroutput"><span class="identifier">log10</span></code>,
<code class="computeroutput"><span class="identifier">lround</span></code>, <code class="computeroutput"><span class="identifier">llround</span></code>,
- ltrunc<code class="computeroutput"><span class="special">,</span> </code>lltrunc<code class="computeroutput"> <span class="keyword">and</span> </code>modf` are not currently used, but may
- be if further special functions are added.
+ <code class="computeroutput"><span class="identifier">ltrunc</span></code>, <code class="computeroutput"><span class="identifier">lltrunc</span></code>
+ and <code class="computeroutput"><span class="identifier">modf</span></code> are not currently
+ used, but may be if further special functions are added.
</p>
<p>
Note that the <code class="computeroutput"><span class="identifier">round</span></code>, <code class="computeroutput"><span class="identifier">trunc</span></code> and <code class="computeroutput"><span class="identifier">modf</span></code>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,7 @@
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../using_udt.html" title="Use with User-Defined Floating-Point Types">
<link rel="prev" href="concepts.html" title="Conceptual Requirements for Real Number Types">
-<link rel="next" href="archetypes.html" title="Conceptual Archetypes and Testing">
+<link rel="next" href="archetypes.html" title="Conceptual Archetypes for Reals and Distributions">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.dist_concept"></a><a class="link" href="dist_concept.html" title="Conceptual Requirements for Distribution Types"> Conceptual Requirements
+<a name="math_toolkit.using_udt.dist_concept"></a><a class="link" href="dist_concept.html" title="Conceptual Requirements for Distribution Types">Conceptual Requirements
for Distribution Types</a>
</h3></div></div></div>
<p>
@@ -202,7 +202,7 @@
</td>
<td>
<p>
- Returns the quantile of the distribution.
+ Returns the quantile (or percentile) of the distribution.
</p>
</td>
</tr>
@@ -219,8 +219,9 @@
</td>
<td>
<p>
- Returns the quantile of the distribution, starting from the complement
- of the probability, the same as: <code class="computeroutput"><span class="identifier">quantile</span><span class="special">(</span><span class="identifier">cd</span><span class="special">,</span> <span class="number">1</span><span class="special">-</span><span class="identifier">cr</span><span class="special">)</span></code>
+ Returns the quantile (or percentile) of the distribution, starting
+ from the complement of the probability, the same as: <code class="computeroutput"><span class="identifier">quantile</span><span class="special">(</span><span class="identifier">cd</span><span class="special">,</span>
+ <span class="number">1</span><span class="special">-</span><span class="identifier">cr</span><span class="special">)</span></code>
</p>
</td>
</tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,26 +24,31 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.use_mpfr"></a><a class="link" href="use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library"> Using With MPFR / GMP
+<a name="math_toolkit.using_udt.use_mpfr"></a><a class="link" href="use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library">Using With MPFR / GMP
- a High-Precision Floating-Point Library</a>
</h3></div></div></div>
<p>
The special functions and tools in this library can be used with <a href="http://www.mpfr.org" target="_top">MPFR
- (an arbitrary precision number type based on the GMP library)</a>, via
- the bindings in boost/math/bindings/mpfr.hpp.
+ (an arbitrary precision number type based on the GMP library)</a>, either
+ via the bindings in boost/math/bindings/mpfr.hpp,
+ or via boost/math/bindings/mpreal.hpp.
</p>
<p>
In order to use these binings you will need to have installed MPFR
- plus it's dependency the GMP library
- and the C++ wrapper for MPFR known as <a href="http://math.berkeley.edu/~wilken/code/gmpfrxx/" target="_top">gmpfrxx
- (or mpfr_class)</a>.
+ plus its dependency the GMP library.
+ You will also need one of the two supported C++ wrappers for MPFR: gmpfrxx (or mpfr_class),
+ or mpfr-C++ (mpreal).
</p>
<p>
- Unfortunately <code class="computeroutput"><span class="identifier">mpfr_class</span></code>
- doesn't quite satisfy our conceptual requirements, so there is a very thin
- set of additional interfaces and some helper traits defined in boost/math/bindings/mpfr.hpp
- that you should use in place of including 'gmpfrxx.h' directly. The existing
- mpfr_class is then usable unchanged once this header is included, so it's
+ Unfortunately neither <code class="computeroutput"><span class="identifier">mpfr_class</span></code>
+ nor <code class="computeroutput"><span class="identifier">mpreal</span></code> quite satisfy
+ our conceptual requirements, so there is a very thin set of additional interfaces
+ and some helper traits defined in boost/math/bindings/mpfr.hpp
+ and boost/math/bindings/mpreal.hpp
+ that you should use in place of including 'gmpfrxx.h' or 'mpreal.h' directly.
+ The classes <code class="computeroutput"><span class="identifier">mpfr_class</span></code> or
+ <code class="computeroutput"><span class="identifier">mpreal</span></code> are then usable unchanged
+ once this header is included, so for example <code class="computeroutput"><span class="identifier">mpfr_class</span></code>'s
performance-enhancing expression templates are preserved and fully supported
by this library:
</p>
@@ -62,14 +67,30 @@
<span class="special">}</span>
</pre>
<p>
+ Alternatively use with <code class="computeroutput"><span class="identifier">mpreal</span></code>
+ would look like:
+ </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">bindings</span><span class="special">/</span><span class="identifier">mpreal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
+<span class="special">{</span>
+ <span class="identifier">mpfr</span><span class="special">::</span><span class="identifier">mpreal</span><span class="special">::</span><span class="identifier">set_precision</span><span class="special">(</span><span class="number">500</span><span class="special">);</span> <span class="comment">// 500 bit precision
+</span> <span class="identifier">mpfr</span><span class="special">::</span><span class="identifier">mpreal</span> <span class="identifier">v</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">tgamma</span><span class="special">(</span><span class="identifier">sqrt</span><span class="special">(</span><span class="identifier">mpfr</span><span class="special">::</span><span class="identifier">mpreal</span><span class="special">(</span><span class="number">2</span><span class="special">)));</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">setprecision</span><span class="special">(</span><span class="number">50</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">v</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
For those functions that are based upon the <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
approximation</a>, the bindings defines a series of approximations with
up to 61 terms and accuracy up to approximately 3e-113. This therefore sets
the upper limit for accuracy to the majority of functions defined this library
- when used with <code class="computeroutput"><span class="identifier">mpfr_class</span></code>.
+ when used with either <code class="computeroutput"><span class="identifier">mpfr_class</span></code>
+ or <code class="computeroutput"><span class="identifier">mpreal</span></code>.
</p>
<p>
- There is a concept checking test program for mpfr support here.
+ There is a concept checking test program for mpfr support here
+ and here.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.use_ntl"></a><a class="link" href="use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library"> Using With NTL - a High-Precision
+<a name="math_toolkit.using_udt.use_ntl"></a><a class="link" href="use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">Using With NTL - a High-Precision
Floating-Point Library</a>
</h3></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,38 +24,36 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.utils"></a><a class="link" href="utils.html" title="Floating Point Utilities"> Floating Point Utilities</a>
+<a name="math_toolkit.utils"></a><a class="link" href="utils.html" title="Floating Point Utilities">Floating Point Utilities</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="utils/rounding.html"> Rounding Truncation and
+<dt><span class="section"><a href="utils/rounding.html">Rounding Truncation and
Integer Conversion</a></span></dt>
<dd><dl>
-<dt><span class="section"> Rounding Functions</span></dt>
-<dt><span class="section"> Truncation Functions</span></dt>
-<dt><span class="section"><a href="utils/rounding/modf.html"> Integer and Fractional
+<dt><span class="section">Rounding Functions</span></dt>
+<dt><span class="section">Truncation Functions</span></dt>
+<dt><span class="section"><a href="utils/rounding/modf.html">Integer and Fractional
Part Splitting (modf)</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="utils/fpclass.html"> Floating-Point Classification:
+<dt><span class="section"><a href="utils/fpclass.html">Floating-Point Classification:
Infinities and NaN's</a></span></dt>
-<dt><span class="section"><a href="utils/sign_functions.html"> Sign Manipulation
+<dt><span class="section"><a href="utils/sign_functions.html">Sign Manipulation
Functions</a></span></dt>
-<dt><span class="section"><a href="utils/next_float.html"> Floating-Point Representation
+<dt><span class="section"><a href="utils/next_float.html">Floating-Point Representation
Distance (ULP), and Finding Adjacent Floating-Point Values</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="utils/next_float/nextafter.html"> Finding the
+<dt><span class="section"><a href="utils/next_float/nextafter.html">Finding the
Next Representable Value in a Specific Direction (nextafter)</a></span></dt>
-<dt><span class="section"><a href="utils/next_float/float_next.html"> Finding
- the Next Greater Representable Value (float_next)</a></span></dt>
-<dt><span class="section"><a href="utils/next_float/float_prior.html"> Finding
+<dt><span class="section"><a href="utils/next_float/float_next.html">Finding the
+ Next Greater Representable Value (float_next)</a></span></dt>
+<dt><span class="section"><a href="utils/next_float/float_prior.html">Finding
the Next Smaller Representable Value (float_prior)</a></span></dt>
-<dt><span class="section"><a href="utils/next_float/float_distance.html"> Calculating
+<dt><span class="section"><a href="utils/next_float/float_distance.html">Calculating
the Representation Distance Between Two Floating Point Values (ULP) float_distance</a></span></dt>
-<dt><span class="section"><a href="utils/next_float/float_advance.html"> Advancing
+<dt><span class="section"><a href="utils/next_float/float_advance.html">Advancing
a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a></span></dt>
</dl></dd>
</dl></div>
-<p>
- </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.fpclass"></a><a class="link" href="fpclass.html" title="Floating-Point Classification: Infinities and NaN's"> Floating-Point Classification:
+<a name="math_toolkit.utils.fpclass"></a><a class="link" href="fpclass.html" title="Floating-Point Classification: Infinities and NaN's">Floating-Point Classification:
Infinities and NaN's</a>
</h3></div></div></div>
<a name="math_toolkit.utils.fpclass.synopsis"></a><h5>
-<a name="id1157706"></a>
+<a name="id1285750"></a>
<a class="link" href="fpclass.html#math_toolkit.utils.fpclass.synopsis">Synopsis</a>
</h5>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">FP_ZERO</span> <span class="comment">/* implementation specific value */</span>
@@ -58,7 +58,7 @@
to use these functions.
</p>
<a name="math_toolkit.utils.fpclass.description"></a><h5>
-<a name="id1158097"></a>
+<a name="id1286143"></a>
<a class="link" href="fpclass.html#math_toolkit.utils.fpclass.description">Description</a>
</h5>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,19 +24,19 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.next_float"></a><a class="link" href="next_float.html" title="Floating-Point Representation Distance (ULP), and Finding Adjacent Floating-Point Values"> Floating-Point Representation
+<a name="math_toolkit.utils.next_float"></a><a class="link" href="next_float.html" title="Floating-Point Representation Distance (ULP), and Finding Adjacent Floating-Point Values">Floating-Point Representation
Distance (ULP), and Finding Adjacent Floating-Point Values</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="next_float/nextafter.html"> Finding the
+<dt><span class="section"><a href="next_float/nextafter.html">Finding the
Next Representable Value in a Specific Direction (nextafter)</a></span></dt>
-<dt><span class="section"><a href="next_float/float_next.html"> Finding
- the Next Greater Representable Value (float_next)</a></span></dt>
-<dt><span class="section"><a href="next_float/float_prior.html"> Finding
+<dt><span class="section"><a href="next_float/float_next.html">Finding the
+ Next Greater Representable Value (float_next)</a></span></dt>
+<dt><span class="section"><a href="next_float/float_prior.html">Finding
the Next Smaller Representable Value (float_prior)</a></span></dt>
-<dt><span class="section"><a href="next_float/float_distance.html"> Calculating
+<dt><span class="section"><a href="next_float/float_distance.html">Calculating
the Representation Distance Between Two Floating Point Values (ULP) float_distance</a></span></dt>
-<dt><span class="section"><a href="next_float/float_advance.html"> Advancing
+<dt><span class="section"><a href="next_float/float_advance.html">Advancing
a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a></span></dt>
</dl></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_advance"></a><a class="link" href="float_advance.html" title="Advancing a Floating Point Value by a Specific Representation Distance (ULP) float_advance"> Advancing
+<a name="math_toolkit.utils.next_float.float_advance"></a><a class="link" href="float_advance.html" title="Advancing a Floating Point Value by a Specific Representation Distance (ULP) float_advance">Advancing
a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a>
</h4></div></div></div>
<p>
@@ -32,7 +32,7 @@
number of ULP.
</p>
<a name="math_toolkit.utils.next_float.float_advance.synopsis"></a><h5>
-<a name="id1162698"></a>
+<a name="id1290333"></a>
<a class="link" href="float_advance.html#math_toolkit.utils.next_float.float_advance.synopsis">Synopsis</a>
</h5>
<p>
@@ -50,7 +50,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.utils.next_float.float_advance.description___float_advance"></a><h5>
-<a name="id1162863"></a>
+<a name="id1290497"></a>
<a class="link" href="float_advance.html#math_toolkit.utils.next_float.float_advance.description___float_advance">Description
- float_advance</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_distance"></a><a class="link" href="float_distance.html" title="Calculating the Representation Distance Between Two Floating Point Values (ULP) float_distance"> Calculating
+<a name="math_toolkit.utils.next_float.float_distance"></a><a class="link" href="float_distance.html" title="Calculating the Representation Distance Between Two Floating Point Values (ULP) float_distance">Calculating
the Representation Distance Between Two Floating Point Values (ULP) float_distance</a>
</h4></div></div></div>
<p>
@@ -34,7 +34,7 @@
different.
</p>
<a name="math_toolkit.utils.next_float.float_distance.synopsis"></a><h5>
-<a name="id1162327"></a>
+<a name="id1289961"></a>
<a class="link" href="float_distance.html#math_toolkit.utils.next_float.float_distance.synopsis">Synopsis</a>
</h5>
<p>
@@ -52,7 +52,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.utils.next_float.float_distance.description___float_distance"></a><h5>
-<a name="id1162492"></a>
+<a name="id1290125"></a>
<a class="link" href="float_distance.html#math_toolkit.utils.next_float.float_distance.description___float_distance">Description
- float_distance</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_next"></a><a class="link" href="float_next.html" title="Finding the Next Greater Representable Value (float_next)"> Finding
- the Next Greater Representable Value (float_next)</a>
+<a name="math_toolkit.utils.next_float.float_next"></a><a class="link" href="float_next.html" title="Finding the Next Greater Representable Value (float_next)">Finding the
+ Next Greater Representable Value (float_next)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.float_next.synopsis"></a><h5>
-<a name="id1161129"></a>
+<a name="id1288347"></a>
<a class="link" href="float_next.html#math_toolkit.utils.next_float.float_next.synopsis">Synopsis</a>
</h5>
<p>
@@ -46,7 +46,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.utils.next_float.float_next.description___float_next"></a><h5>
-<a name="id1161281"></a>
+<a name="id1288498"></a>
<a class="link" href="float_next.html#math_toolkit.utils.next_float.float_next.description___float_next">Description
- float_next</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_prior"></a><a class="link" href="float_prior.html" title="Finding the Next Smaller Representable Value (float_prior)"> Finding
+<a name="math_toolkit.utils.next_float.float_prior"></a><a class="link" href="float_prior.html" title="Finding the Next Smaller Representable Value (float_prior)">Finding
the Next Smaller Representable Value (float_prior)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.float_prior.synopsis"></a><h5>
-<a name="id1161381"></a>
+<a name="id1288599"></a>
<a class="link" href="float_prior.html#math_toolkit.utils.next_float.float_prior.synopsis">Synopsis</a>
</h5>
<p>
@@ -46,7 +46,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.utils.next_float.float_prior.description___float_prior"></a><h5>
-<a name="id1162216"></a>
+<a name="id1289849"></a>
<a class="link" href="float_prior.html#math_toolkit.utils.next_float.float_prior.description___float_prior">Description
- float_prior</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.nextafter"></a><a class="link" href="nextafter.html" title="Finding the Next Representable Value in a Specific Direction (nextafter)"> Finding the
+<a name="math_toolkit.utils.next_float.nextafter"></a><a class="link" href="nextafter.html" title="Finding the Next Representable Value in a Specific Direction (nextafter)">Finding the
Next Representable Value in a Specific Direction (nextafter)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.nextafter.synopsis"></a><h5>
-<a name="id1160603"></a>
+<a name="id1287819"></a>
<a class="link" href="nextafter.html#math_toolkit.utils.next_float.nextafter.synopsis">Synopsis</a>
</h5>
<p>
@@ -46,7 +46,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.utils.next_float.nextafter.description___nextafter"></a><h5>
-<a name="id1160769"></a>
+<a name="id1287986"></a>
<a class="link" href="nextafter.html#math_toolkit.utils.next_float.nextafter.description___nextafter">Description
- nextafter</a>
</h5>
@@ -76,7 +76,7 @@
returns an <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>.
</p>
<a name="math_toolkit.utils.next_float.nextafter.examples___nextafter"></a><h5>
-<a name="id1160855"></a>
+<a name="id1288071"></a>
<a class="link" href="nextafter.html#math_toolkit.utils.next_float.nextafter.examples___nextafter">Examples
- nextafter</a>
</h5>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.rounding"></a><a class="link" href="rounding.html" title="Rounding Truncation and Integer Conversion"> Rounding Truncation and
+<a name="math_toolkit.utils.rounding"></a><a class="link" href="rounding.html" title="Rounding Truncation and Integer Conversion">Rounding Truncation and
Integer Conversion</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Rounding Functions</span></dt>
-<dt><span class="section"> Truncation Functions</span></dt>
-<dt><span class="section"><a href="rounding/modf.html"> Integer and Fractional
+<dt><span class="section">Rounding Functions</span></dt>
+<dt><span class="section">Truncation Functions</span></dt>
+<dt><span class="section"><a href="rounding/modf.html">Integer and Fractional
Part Splitting (modf)</a></span></dt>
</dl></div>
</div>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.rounding.modf"></a><a class="link" href="modf.html" title="Integer and Fractional Part Splitting (modf)"> Integer and Fractional
+<a name="math_toolkit.utils.rounding.modf"></a><a class="link" href="modf.html" title="Integer and Fractional Part Splitting (modf)">Integer and Fractional
Part Splitting (modf)</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.rounding.round"></a><a class="link" href="round.html" title="Rounding Functions"> Rounding Functions</a>
+<a name="math_toolkit.utils.rounding.round"></a><a class="link" href="round.html" title="Rounding Functions">Rounding Functions</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.rounding.trunc"></a><a class="link" href="trunc.html" title="Truncation Functions"> Truncation Functions</a>
+<a name="math_toolkit.utils.rounding.trunc"></a><a class="link" href="trunc.html" title="Truncation Functions">Truncation Functions</a>
</h4></div></div></div>
<p>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.sign_functions"></a><a class="link" href="sign_functions.html" title="Sign Manipulation Functions"> Sign Manipulation
+<a name="math_toolkit.utils.sign_functions"></a><a class="link" href="sign_functions.html" title="Sign Manipulation Functions">Sign Manipulation
Functions</a>
</h3></div></div></div>
<a name="math_toolkit.utils.sign_functions.synopsis"></a><h5>
-<a name="id1159947"></a>
+<a name="id1287164"></a>
<a class="link" href="sign_functions.html#math_toolkit.utils.sign_functions.synopsis">Synopsis</a>
</h5>
<p>
@@ -52,7 +52,7 @@
<span class="special">}}</span> <span class="comment">// namespaces
</span></pre>
<a name="math_toolkit.utils.sign_functions.description"></a><h5>
-<a name="id1160241"></a>
+<a name="id1287458"></a>
<a class="link" href="sign_functions.html#math_toolkit.utils.sign_functions.description">Description</a>
</h5>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -69,6 +69,7 @@
[template thetasym[]'''ϑ'''] [/ ? Greek small letter theta symbol]
[template upsih[]'''ϒ'''] [/ ? Greek upsilon with hook symbol]
[template piv[]'''ϖ'''] [/ ? Greek pi symbol]
+
[template bull[]'''•'''] [/ • bullet = black small circle]
[template hellip[]'''…'''] [/ … horizontal ellipsis = three dot leader]
[template prime[]'''′'''] [/ ' prime = minutes = feet]
@@ -141,15 +142,49 @@
[template hearts[]'''♥'''] [/ ? black heart suit = valentine]
[template diams[]'''♦'''] [/ ? black diamond suit]
[template euro[]'''€'''] [/ ? Euro currency symbol]
+[template lchev[]'''⟨'''] [/ ? left chevron]
+[template rchev[]'''⟩'''] [/ right chevron]
+[template rflat[]'''⟮'''] [/ right flat bracket Misc Math Symbol A]
+[template lflat[]'''⟮'''] [/ left flat bracket]
+[/ U2000.pdf punctuation]
+[template endash[]'''–'''] [/ em width dash]
+[template emdash[]'''—'''] [/ en width dash]
+[template hbar[]'''―'''] [/ ? horizontal bar - introducing quoted text]
+[template vert2bar[]'''‖'''] [/ ? double vertical bar]
+[template line2[]'''‖'''] [/ ? double low line bar]
+[template dagger[]'''†'''] [/ ? dagger]
+[template dagger2[]'''‡'''] [/ ? double dagger]
+[template dot[]'''․'''] [/ dot leader]
+[template dot2[]'''‥'''] [/ ? dots leader]
+[template ellipsis[]'''…'''] [/ horizontal ellipsis]
+
+[template dotover[]'''̇'''] [/ dot over symbol]
+[template recur[]''' ̇'''] [/ math recurring symbol, eg after 0.333]
+[/ Note use of a thin space before digit, so that dot isn't placed directly over the digit.]
+[/ Use:1[recur]]
[/ Other symbols, not in the HTML4 list:]
-[template plusminus[]'''±'''] [/ ? plus or minus sign]
-[template space[] '''​'''] [/ plain space]
-[template spaces[] '''ߐ'''] [/ spaces - but produces a funny symbol!]
-[template nbsp[] '''�A0;'''] [/ non-breaking space]
-[template narrownbsp[] '''ÊF;'''] [/ narrow non-breaking space]
-[template wordjoin[] '''ࠌ'''] [/ word joiner - no line break either side]
+[template enquad[] ''' '''] [/ en quad space]
+[template emquad[] ''' '''] [/ em quad space]
+[template enspace[] ''' '''] [/ em half en space]
+[template emspace[] ''' '''] [/ em space type size in points]
+[template thickspace[] ''' '''] [/ 3 per em space]
+[template midspace[] ''' '''] [/ 4 per em space]
+[template sixemspace[] ''' '''] [/ 6 em space]
+[template figspace[] ''' '''] [/ space = width fixed font digit]
+[template punctspace[] ''' '''] [/ space = width punctuation]
+[template thin[] ''' '''] [/ thin space ]
+[template hair[] ''' '''] [/ hair space]
+[template nbsp[] ''' '''] [/ non-breaking space]
+[template space[] ''' '''] [/ plain non-breaking space]
+[template nospace[] '''​'''] [/ zero width space]
+[template wordjoin[] '''⁠'''] [/ word joiner - no line break either side]
+[template narrownbsp[] ''' '''] [/ narrow non-breaking space]
+[template hyphen[] '''‐'''] [/ soft hyphen]
+[template nbhyphen[] '''‑'''] [/ non-breaking hyphen]
+
+[template plusminus[]'''±'''] [/ ? plus or minus sign]
[template sqrt[]'''√'''] [/ ? square root sqrt symbol]
[/template pow2[]'''⁳'''] [/ 2073 is NOT superscript 2 character]
[template pow2[]'''²'''] [/ superscript 2 character]
@@ -158,7 +193,18 @@
[template frac12[]'''½'''] [/ fraction half]
[template frac14[]'''¼'''] [/ fraction quarter]
[template frac34[]'''¾'''] [/ fraction three quarter]
-
+[template sup1[]'''¹'''] [/ superscript one = superscript digit one ]
+[template sup2[]'''²'''] [/ superscript two = superscript digit two = squared ]
+[template cubed[]'''³'''] [/ superscript three = superscript digit three = cubed ]
+[template macron[]'''¯'''] [/ macron = spacing macron = overline = APL overbar ]
+[template deg[]'''°'''] [/ degree sign ]
+[template plusmn[]'''±'''] [/ plus-minus sign = plus-or-minus sign ]
+[template micro[]'''µ'''] [/ micro sign ]
+[template cedil[]'''¸'''] [/ cedilla = spacing cedilla ]
+[template ordm[]'''º'''] [/ masculine ordinal indicator ]
+[template ordf[]'''ª'''] [/ feminine ordinal indicator ]
+[template laquo[]'''«'''] [/ left-pointing double angle quotation mark = left pointing guillemet ]
+[template raquo[]'''»'''] [/ right-pointing double angle quotation mark = right pointing guillemet ]
[/
Copyright 2007, 2010 Paul A. Bristow.
==============================================================================
--- (empty file)
+++ branches/release/libs/math/doc/sf_and_dist/index.idx 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -0,0 +1,23 @@
+
+"Lanczos approximation" lanczos
+
+!scan-path boost/math .*\.hpp true
+
+!exclude policy precision apply evaluation polynomial name helper
+!exclude true_type false_type polynomial type d reference terminate
+!exclude arg1 arg2 charT const_iterator const_reference container_type
+!exclude result_type difference_type dummy iterator max_value result_type
+!exclude row_type size_type tag traits
+!exclude a abs acos add asin atan atan2 b begin bracket ceil check clear
+!exclude cos cosh digits end exp fabs floor fmod frexp g if in log log10
+!exclude modf pow real result sin sinh sqrt swap tan tanh
+
+!rewrite-name "(?i)(?:A|The)\s+(.*)" "\1"
+!rewrite-name "Additional Implementation Notes" "Implementation Notes"
+!rewrite-name "(?i)Calculating(?:\s+the)?\s+(.*)" "\1"
+!rewrite-id math_toolkit\.dist\.stat_tut\.weg.* Examples
+
+
+
+
+
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/internals_overview.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/internals_overview.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -2,8 +2,7 @@
This section contains internal utilities used by the library's implementation
along with tools used in development and testing. These tools have
-only minimal documentation, and crucially
-['do not have stable interfaces].
+only minimal documentation, and crucially ['do not have stable interfaces].
There is no doubt that these components can be improved, but they are also
largely incidental to the main purpose of this library.
@@ -15,7 +14,7 @@
[endsect][/section:internals_overview Overview]
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/inv_hyper.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/inv_hyper.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -268,7 +268,7 @@
[equation atanh1]
-or it's equivalent form:
+or its equivalent form:
[equation atanh3]
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/issues.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/issues.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,6 +1,4 @@
-[section:issues Known Issues, and Todo List]
-
-This section lists those issues that are known about.
+[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
@@ -78,7 +76,8 @@
[h4 Statistical distributions]
-* Student's t Perhaps switch to normal distribution as a better approximation for very large degrees of freedom?
+* Student's t Perhaps switch to normal distribution
+as a better approximation for very large degrees of freedom?
[h4 Feature Requests]
@@ -90,7 +89,6 @@
[[Distribution][R][Mathematica 6][NIST][Regress+][Matlab]]
[/3 votes:]
-[[Inverse Gausian / Inverse Normal][-][X][-][X][X]]
[[Geometric][X][X][-][-][X]]
[/2 votes:]
@@ -109,7 +107,6 @@
[[Wilcoxon rank sum][X][-][-][-][-]]
[[Wincoxon signed rank][X][-][-][-][-]]
[[Non-central Beta][X][-][-][-][-]]
-[[Laplace][-][X][-][-][-]]
[[Maxwell][-][X][-][-][-]]
[[Beta-Binomial][-][X][-][-][-]]
[[Beta-negative Binomial][-][X][-][-][-]]
@@ -133,13 +130,15 @@
* Add support for interpolated distributions, possibly combine with numeric
integration and differentiation.
* Add support for bivariate and multivariate distributions: most especially the normal.
-* Add support for the log of the cdf and pdf: this is mainly a performance optimisation since we can avoid
-some special function calls for some distributions by returning the log of the result.
+* Add support for the log of the cdf and pdf:
+this is mainly a performance optimisation since we can avoid
+some special function calls for some distributions
+by returning the log of the result.
-[endsect][/section:issues Known Issues, and Todo List]
+[endsect] [/section:issues Known Issues, and Todo List]
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -31,7 +31,7 @@
[template cubed[]'''³'''] [/ superscript three = superscript digit three = cubed ]
[template acute[]'''´'''] [/ acute accent = spacing acute ]
[template micro[]'''µ'''] [/ micro sign ]
-[template para[]'''¶'''] [/ pilcrow sign = paragraph sign ]
+[template polcrow[]'''¶'''] [/ pilcrow sign = paragraph sign - care ! name para conflicts with para macro!!]
[template middot[]'''·'''] [/ middle dot = Georgian comma = Greek middle dot ]
[template cedil[]'''¸'''] [/ cedilla = spacing cedilla ]
[template sup1[]'''¹'''] [/ superscript one = superscript digit one ]
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/legendre.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/legendre.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -136,9 +136,13 @@
double x = 0.5; // Abscissa value
vector<double> v;
- v.push_back(legendre_p(0, x)).push_back(legendre_p(1, x));
+ v.push_back(legendre_p(0, x));
+ v.push_back(legendre_p(1, x));
for(unsigned l = 1; l < 10; ++l)
v.push_back(legendre_next(l, x, v[l], v[l-1]));
+ // Double check values:
+ for(unsigned l = 1; l < 10; ++l)
+ assert(v[l] == legendre_p(l, x));
Formally the arguments are:
@@ -164,9 +168,13 @@
double x = 0.5; // Abscissa value
int m = 10; // order
vector<double> v;
- v.push_back(legendre_p(m, m, x)).push_back(legendre_p(1 + m, m, x));
- for(unsigned l = 1 + m; l < m + 10; ++l)
- v.push_back(legendre_next(l, m, x, v[l], v[l-1]));
+ v.push_back(legendre_p(m, m, x));
+ v.push_back(legendre_p(1 + m, m, x));
+ for(unsigned l = 1; l < 10; ++l)
+ v.push_back(legendre_next(l + 10, m, x, v[l], v[l-1]));
+ // Double check values:
+ for(unsigned l = 1; l < 10; ++l)
+ assert(v[l] == legendre_p(10 + l, m, x));
Formally the arguments are:
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/math.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/math.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -11,7 +11,7 @@
[/last-revision $Date$]
]
-[/ \u00E5 = Latin small letter A wiht ring above doesn't seem to work in authors]
+[/ \u00E5 = Latin small letter A with ring above doesn't seem to work in authors with Quickbook 1.5]
[template equation[name] '''<inlinemediaobject>
<imageobject role="html">
@@ -55,10 +55,10 @@
[def __eacute '''é''']
[def __quarter '''¼''']
[def __nearequal '''≊''']
-[def __spaces ''' '''] [/spaces - useful for an indent.]
+[def __spaces '''  '''] [/ two spaces - useful for an indent.]
[def __caution This is now an official Boost library, but remains a library under
- construction, the code is fully functional and robust, but
+ development, the code is fully functional and robust, but
interfaces, library structure, and function and distribution names
may still be changed without notice.]
@@ -80,7 +80,7 @@
[def __sf_result [link math_toolkit.main_overview.result_type ['calculated-result-type]]]
[/ The following macros expand to links to the various special functions
-and use the function's name as the link text]
+and use the function's name as the link text.]
[/Misc]
[def __lanczos [link math_toolkit.backgrounders.lanczos Lanczos approximation]]
@@ -227,8 +227,9 @@
[def __exp_distrib [link math_toolkit.dist.dist_ref.dists.exp_dist Exponential Distribution]]
[def __F_distrib [link math_toolkit.dist.dist_ref.dists.f_dist Fisher F Distribution]]
[def __gamma_distrib [link math_toolkit.dist.dist_ref.dists.gamma_dist Gamma Distribution]]
-[def __hypergeometric_distrib [link math_toolkit.dist.dist_ref.dists.hypergeometric_dist Hypergeometric Distribution]]
+[def __geometric_distrib [link math_toolkit.dist.dist_ref.dists.geometric_dist Geometric Distribution]]
[def __inverse_gamma_distrib [link math_toolkit.dist.dist_ref.dists.inverse_gamma_dist Inverse Gamma Distribution]]
+[def __inverse_gaussian_distrib [link math_toolkit.dist.dist_ref.dists.inverse_gaussian_dist Inverse Gaussian Distribution]]
[def __inverse_chi_squared_distrib [link math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist Inverse chi squared Distribution]]
[def __laplace_distrib [link math_toolkit.dist.dist_ref.dists.laplace_dist Laplace Distribution]]
[def __logistic_distrib [link math_toolkit.dist.dist_ref.dists.logistic_dist Logistic Distribution]]
@@ -242,11 +243,11 @@
[def __normal_distrib [link math_toolkit.dist.dist_ref.dists.normal_dist Normal Distribution]]
[def __poisson_distrib [link math_toolkit.dist.dist_ref.dists.poisson_dist Poisson Distribution]]
[def __students_t_distrib [link math_toolkit.dist.dist_ref.dists.students_t_dist Students t Distribution]]
-[def __weibull_distrib [link math_toolkit.dist.dist_ref.dists.weibull Weibull Distribution]]
+[def __weibull_distrib [link math_toolkit.dist.dist_ref.dists.weibull_dist Weibull Distribution]]
[/links to policy]
[def __Policy [link math_toolkit.policy Policy]] [/ Used in distribution template specifications]
-[def __policy_section [link math_toolkit.policy Policies]] [/ Used in text to refer too.]
+[def __policy_section [link math_toolkit.policy Policies]] [/ Used in text to refer to.]
[def __policy_class [link math_toolkit.policy.pol_ref.pol_ref_ref policies::policy<>]]
[def __math_undefined [link math_toolkit.policy.pol_ref.assert_undefined mathematically undefined function]]
[def __policy_ref [link math_toolkit.policy.pol_ref policy reference]]
@@ -256,6 +257,7 @@
[def __user_error_handling [link math_toolkit.policy.pol_tutorial.user_def_err_pol user error handling]]
[def __promotion_policy [link math_toolkit.policy.pol_ref.internal_promotion internal promotion policy]]
[def __precision_policy [link math_toolkit.policy.pol_ref.precision_pol precision policy]]
+[def __policy_macros [link math_toolkit.policy.pol_ref.policy_defaults Using Macros to Change the Policy Defaults]]
[def __random_variate [@http://en.wikipedia.org/wiki/Random_variate random variate]]
[def __random_variable [@http://en.wikipedia.org/wiki/Random_variable random variable]]
@@ -279,9 +281,7 @@
[def __errno [@http://en.wikipedia.org/wiki/Errno `::errno`]]
[def __Mathworld [@http://mathworld.wolfram.com Wolfram MathWorld]]
[def __Mathematica [@http://www.wolfram.com/products/mathematica/index.html Wolfram Mathematica]]
-
-
-
+[def __TOMS748 [@http://portal.acm.org/citation.cfm?id=210111 TOMS Algorithm 748: enclosing zeros of continuous functions]]
[def __why_complements [link why_complements why complements?]]
[def __complements [link complements complements]]
[def __performance [link math_toolkit.perf performance]]
@@ -304,7 +304,7 @@
[template discrete_quantile_warning[NAME]
[caution
-The [NAME] distribution is a discrete distribution: internally
+The [NAME] distribution is a discrete distribution: internally,
functions like the `cdf` and `pdf` are treated "as if" they are continuous
functions, but in reality the results returned from these functions
only have meaning if an integer value is provided for the random variate
@@ -332,23 +332,21 @@
] [/ template discrete_quantile_warning]
This manual is also available in
-[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf
+[@http://sourceforge.net/projects/boost/files/boost-docs/
printer friendly PDF format],
and as a CD ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22.
-
[section:main_overview Overview]
-
[include overview.qbk]
[include structure.qbk] [/getting about, directory and file structure.]
-
[include result_type_calc.qbk]
[include error_handling.qbk]
[section:compilers_overview Compilers]
[compilers_overview]
[endsect]
-[section:pol_overview Configuration and Policies]
+[include config_macros.qbk]
+[section:pol_overview Policies]
[policy_overview]
[endsect]
@@ -447,11 +445,11 @@
[include tr1_ref.qbk]
[endsect]
-[section:toolkit Internal Details and Tools (Experimental)]
+[section:toolkit Tools, Constants and Internal Details]
[include internals_overview.qbk]
-[section:internals1 Reused Utilities]
+[section:internals1 Utilities - Constants & Tools]
[include constants.qbk]
[include series.qbk]
[include fraction.qbk]
@@ -460,7 +458,7 @@
[include roots_without_derivatives.qbk]
[include minima.qbk]
[include tuple.qbk]
-[endsect] [/section:internals1 Reused Utilities]
+[endsect] [/section:internals1 Utilities - Constants & Tools]
[section:internals2 Testing and Development]
[include polynomial.qbk]
@@ -491,9 +489,6 @@
[section:history1 History and What's New]
[history]
[endsect]
-[section:compilers Compilers]
-[compilers_overview]
-[endsect]
[include issues.qbk]
[include credits.qbk]
[/include test_HTML4_symbols.qbk]
@@ -501,9 +496,28 @@
[endsect] [/section:status Status and Roadmap]
+[? enable_index
+'''
+ <index type="function_name">
+ <title>Function Index</title>
+ </index>
+ <index type="class_name">
+ <title>Class Index</title>
+ </index>
+ <index type="typedef_name">
+ <title>Typedef Index</title>
+ </index>
+ <index type="macro_name">
+ <title>Macro Index</title>
+ </index>
+ <index/>
+'''
+]
+
[/ math.qbk
- Copyright 2008 John Maddock and Paul A. Bristow.
+ Copyright 2008, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
]
+
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/minima.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/minima.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,4 +1,4 @@
-[section:minima Locating Function Minima]
+[section:minima Locating Function Minima: Brent's algorithm]
[h4 synopsis]
@@ -26,9 +26,9 @@
for the minima.]]
[[bits] [The number of bits precision to which the minima should be found.
Note that in principle, the minima can not be located to greater
- accuracy than the square root of machine epsilon, therefore if /bits/
- is set to a value greater than one half of the bits in type T, then
- the value will be ignored.]]
+ accuracy than the square root of machine epsilon (for 64-bit double, sqrt(1e-16)[cong]1e-8),
+ therefore if /bits/ is set to a value greater than one half of the bits in type T,
+ then the value will be ignored.]]
[[max_iter] [The maximum number of iterations to use
in the algorithm, if not provided the algorithm will just
keep on going until the minima is found.]]
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/poisson_optimisation.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/poisson_optimisation.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -26,7 +26,7 @@
Will produce a value much smaller than the largest of the terms, so you get
cancellation error: and then when you pass the result to exp() which
-converts the absolute error in it's argument to a relative error in the
+converts the absolute error in its argument to a relative error in the
result (explanation available if required), you effectively amplify the
error further still.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/policy.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/policy.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -75,7 +75,7 @@
[[Overflow Error][std::numeric_limits<T>::infinity()]]
[[Underflow Error][0]]
[[Denorm Error][The denormalised value.]]
- [[Evaluation Error][The best guess as to the result: which
+ [[Evaluation Error][The best guess (perhaps NaN) as to the result: which
may be significantly in error.]]
[[Indeterminate Result Error][Depends on the function where the error occurred]]
]
@@ -301,6 +301,12 @@
// This will compile, but raises a domain error!
double m2 = mean(cauchy_distribution<double, policy<assert_undefined<false> > >());
+
+`policy<assert_undefined<false>` behaviour can also be obtained by defining the macro
+
+ #define BOOST_MATH_ASSERT_UNDEFINED_POLICY false
+
+at the head of the file - see __policy_macros.
[endsect][/section:assert_undefined Mathematically Undefined Function Policies]
@@ -482,9 +488,9 @@
of iterations permitted in a root-finding algorithm before the special
function gives up and returns the result of __evaluation_error.
-[endsect][/section:iteration_pol Iteration Limits Policies]
+[endsect] [/section:iteration_pol Iteration Limits Policies]
-[section:policy_defaults Using macros to Change the Policy Defaults]
+[section:policy_defaults Using Macros to Change the Policy Defaults]
You can use the various macros below to change any (or all) of the policies.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/references.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/references.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -15,11 +15,6 @@
Mathematical Tables,
National Bureau of Standards Applied Mathematics Series, U.S. Government Printing Office, Washington, D.C..
-[@http://functions.wolfram.com/ The Wolfram Functions Site]
-The Wolfram Functions Site - Providing
-the mathematical and scientific community with the world's largest
-(and most authorititive) collection of formulas and graphics about mathematical functions.
-
[@http://www.itl.nist.gov/div898/handbook/index.htm NIST/SEMATECH e-Handbook of Statistical Methods]
[@http://documents.wolfram.com/mathematica/Add-onsLinks/StandardPackages/Statistics/DiscreteDistributions.html Mathematica Documentation: DiscreteDistributions]
@@ -40,22 +35,30 @@
[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003 N1514, 03-0097, A Proposal to Add Mathematical Special Functions to the C++ Standard Library (version 2), Walter E. Brown]
-[h4 Calculators* that we found (and used to cross-check - as far as their widely-varying accuracy allowed).]
+[h4 Calculators]
+
+We found (and used to create cross-check spot values - as far as their accuracy allowed).
+
+[@http://functions.wolfram.com/ The Wolfram Functions Site]
+The Wolfram Functions Site - Providing
+the mathematical and scientific community with the world's largest
+(and most authorititive) collection of formulas and graphics about mathematical functions.
+
+[@http://www.moshier.net/cephes28.zip 100-decimal digit calculator] provided some spot values.
[@http://www.adsciengineering.com/bpdcalc/ http://www.adsciengineering.com/bpdcalc/] Binomial Probability Distribution Calculator.
+
[h4 Other Libraries]
[@http://www.moshier.net/#Cephes Cephes library] by Shephen Moshier and his book:
Methods and programs for mathematical functions, Stephen L B Moshier, Ellis Horwood (1989) ISBN 0745802893 0470216093 provided inspiration.
-[@http://www.moshier.net/cephes28.zip 100-decimal digit calculator] provided some spot values.
-
-[@http://www.csit.fsu.edu/~burkardt/cpp_src/dcdflib/dcdflib.html C++ version].
-
[@http://lib.stat.cmu.edu/general/cdflib CDFLIB Library of Fortran Routines for Cumulative Distribution functions.]
+[@http://www.csit.fsu.edu/~burkardt/cpp_src/dcdflib/dcdflib.html DCFLIB C++ version].
+
[@http://www.csit.fsu.edu/~burkardt/f_src/dcdflib/dcdflib.html DCDFLIB C++ version]
DCDFLIB is a library of C++ routines, using double precision arithmetic, for evaluating cumulative probability density functions.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/remez.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/remez.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -169,7 +169,7 @@
where P(x) and Q(x) are polynomials, then we proceed as before, except that now
we have N+M+2 unknowns if P(x) is of order N and Q(x) is of order M. This assumes
-that Q(x) is normalised so that it's leading coefficient is 1, giving
+that Q(x) is normalised so that its leading coefficient is 1, giving
N+M+1 polynomial coefficients in total, plus the error term E.
The simultaneous equations to be solved are now:
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/roadmap.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/roadmap.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,5 +1,11 @@
[template history[]
+[h4 Boost-1.46.0]
+
+* Added Wald, Inverse Gaussian and geometric distributions.
+* Added information about configuration macros.
+* Added support for mpreal as a real-numered type.
+
[h4 Boost-1.45.0]
* Added warnings about potential ambiguity with std random library in distribution and function names.
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/roots.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/roots.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,4 +1,4 @@
-[section:roots Root Finding With Derivatives]
+[section:roots Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder]
[h4 Synopsis]
@@ -6,7 +6,8 @@
#include <boost/math/tools/roots.hpp>
``
- namespace boost{ namespace math{ namespace tools{
+ namespace boost{ namespace math{
+ namespace tools{
template <class F, class T>
T newton_raphson_iterate(F f, T guess, T min, T max, int digits);
@@ -30,10 +31,13 @@
[h4 Description]
-These functions all perform iterative root finding: `newton_raphson_iterate`
-performs second order [link newton Newton Raphson iteration], while `halley_iterate` and
-`schroeder_iterate` perform third order [link halley Halley] and
-[link schroeder Schroeder] iteration respectively.
+These functions all perform iterative root finding using derivatives:
+
+* `newton_raphson_iterate`performs second order
+[link newton Newton-Raphson iteration],
+
+* `halley_iterate` and`schroeder_iterate` perform third order
+[link halley Halley] and [link schroeder Schroeder] iteration.
The functions all take the same parameters:
@@ -41,38 +45,47 @@
[[F f] [Type F must be a callable function object that accepts one parameter and
returns a __tuple:
-For the second order iterative methods (Newton Raphson)
- the __tuple should have two elements containing the evaluation
- of the function and it's first derivative.
+For the second order iterative methods ([@http://en.wikipedia.org/wiki/Newton_Raphson Newton Raphson])
+ the __tuple should have *two* elements containing the evaluation
+ of the function and its first derivative.
-For the third order methods (Halley and Schroeder) the __tuple
- should have three elements containing the evaluation of
+For the third order methods
+([@http://en.wikipedia.org/wiki/Halley%27s_method Halley] and
+Schroeder)
+ the __tuple should have *three* elements containing the evaluation of
the function and its first and second derivatives.]]
-[[T guess] [The initial starting value.]]
+[[T guess] [The initial starting value. A good guess is crucial to quick convergence!]]
[[T min] [The minimum possible value for the result, this is used as an initial lower bracket.]]
[[T max] [The maximum possible value for the result, this is used as an initial upper bracket.]]
[[int digits] [The desired number of binary digits.]]
-[[uintmax_t max_iter] [An optional maximum number of iterations to perform.]]
+[[uintmax_t max_iter] [An optional maximum number of iterations to perform.
+]]
]
When using these functions you should note that:
+* Default max_iter = `(std::numeric_limits<boost::uintmax_t>::max)()` is effectively 'iterate for ever'!.
* They may be very sensitive to the initial guess, typically they converge very rapidly
if the initial guess has two or three decimal digits correct. However convergence
-can be no better than bisection, or in some rare cases even worse than bisection if the
+can be no better than bisection, or in some rare cases, even worse than bisection if the
initial guess is a long way from the correct value and the derivatives are close to zero.
* These functions include special cases to handle zero first (and second where appropriate)
derivatives, and fall back to bisection in this case. However, it is helpful
-if F is defined to return an arbitrarily small value ['of the correct sign] rather
+if functor F is defined to return an arbitrarily small value ['of the correct sign] rather
than zero.
* If the derivative at the current best guess for the result is infinite (or
very close to being infinite) then these functions may terminate prematurely.
A large first derivative leads to a very small next step, triggering the termination
condition. Derivative based iteration may not be appropriate in such cases.
+* If the function is 'Really Well Behaved' (monotonic and has only one root)
+the bracket bounds min and max may as well be set to the widest limits
+like zero and `numeric_limits<T>::max()`.
+*But if the function more complex and may have more than one root or a pole,
+the choice of bounds is protection against jumping out to seek the 'wrong' root.
* These functions fall back to bisection if the next computed step would take the
next value out of bounds. The bounds are updated after each step to ensure this leads
to convergence. However, a good initial guess backed up by asymptotically-tight
-bounds will improve performance no end rather than relying on bisection.
+bounds will improve performance no end - rather than relying on bisection.
* The value of /digits/ is crucial to good performance of these functions,
if it is set too high then at best you will get one extra (unnecessary)
iteration, and at worst the last few steps will proceed by bisection.
@@ -84,6 +97,12 @@
digits in the result is increasing quite
substantially with each iteration, /digits/ should be set by experiment so that the final
iteration just takes the next value into the zone where f(x) becomes inaccurate.
+* To get the binary digits of accuracy, use policies::get_max_root_iterations<Policy>()).
+* If you need some diagnostic output to see what is going on, you can
+`#define BOOST_MATH_INSTRUMENT` before the `#include <boost/math/tools/roots.hpp>`,
+and also ensure that display of all the possibly significant digits with
+` cout.precision(std::numeric_limits<double>::max_digits10)`:
+but be warned, this may produce copious output!
* Finally: you may well be able to do better than these functions by hand-coding
the heuristics used so that they are tailored to a specific function. You may also
be able to compute the ratio of derivatives used by these methods more efficiently
@@ -133,26 +152,29 @@
[h4 Example]
-Lets suppose we want to find the cube root of a number, the equation we want to
+Let's suppose we want to find the cube root of a number: the equation we want to
solve along with its derivatives are:
[equation roots4]
-To begin with lets solve the problem using Newton Raphson iterations, we'll
-begin be defining a function object that returns the evaluation of the function
-to solve, along with its first derivative:
+To begin with lets solve the problem using Newton-Raphson iterations, we'll
+begin by defining a function object (functor) that returns the evaluation
+of the function to solve, along with its first derivative f'(x):
template <class T>
struct cbrt_functor
{
- cbrt_functor(T const& target) : a(target){}
+ cbrt_functor(T const& target) : a(target)
+ { // Constructor stores value to be 'cube-rooted'.
+ }
``__tuple``<T, T> operator()(T const& z)
- {
- T sqr = z * z;
- return std::tr1::make_tuple(sqr * z - a, 3 * sqr);
+ { // z is estimate so far.
+ return boost::math::make_tuple(
+ z*z*z - a, // return both f(x)
+ 3 * z*z); // and f'(x)
}
private:
- T a;
+ T a; // to be 'cube-rooted'.
};
Implementing the cube root is fairly trivial now, the hardest part is finding
@@ -162,30 +184,35 @@
template <class T>
T cbrt(T z)
{
- using namespace std;
+ using namespace std; // for frexp, ldexp, numeric_limits.
+ using namespace boost::math::tools;
+
int exp;
- frexp(z, &exp);
+ frexp(z, &exp); // Get exponent of z (ignore mantissa).
T min = ldexp(0.5, exp/3);
T max = ldexp(2.0, exp/3);
- T guess = ldexp(1.0, exp/3);
- int digits = std::numeric_limits<T>::digits;
- return tools::newton_raphson_iterate(detail::cbrt_functor<T>(z), guess, min, max, digits);
+ T guess = ldexp(1.0, exp/3); // Rough guess is to divide the exponent by three.
+ int digits = std::numeric_limits<T>::digits; // Maximum possible binary digits accuracy for type T.
+ return newton_raphson_iterate(detail::cbrt_functor<T>(z), guess, min, max, digits);
}
Using the test data in libs/math/test/cbrt_test.cpp this found the cube root
exact to the last digit in every case, and in no more than 6 iterations at double
precision. However, you will note that a high precision was used in this
example, exactly what was warned against earlier on in these docs! In this
-particular case its possible to compute f(x) exactly and without undue
+particular case it is possible to compute f(x) exactly and without undue
cancellation error, so a high limit is not too much of an issue. However,
reducing the limit to `std::numeric_limits<T>::digits * 2 / 3` gave full
precision in all but one of the test cases (and that one was out by just one bit).
The maximum number of iterations remained 6, but in most cases was reduced by one.
-Note also that the above code omits error handling, and does not handle
-negative values of z correctly. That will be left as an exercise for the reader!
+Note also that the above code omits a probably optimization by computing z[sup2],
+and reusing it, omits error handling, and does not handle
+negative values of z correctly. (These are left as an exercise for the reader!)
-Now lets adapt the functor slightly to return the second derivative as well:
+The boost::math::cbrt function also includes these and other improvements.
+
+Now let's adapt the functor slightly to return the second derivative as well:
template <class T>
struct cbrt_functor
@@ -193,8 +220,10 @@
cbrt_functor(T const& target) : a(target){}
``__tuple``<T, T, T> operator()(T const& z)
{
- T sqr = z * z;
- return std::tr1::make_tuple(sqr * z - a, 3 * sqr, 6 * z);
+ return boost::math::make_tuple(
+ z*z*z - a,
+ 3 * z*z,
+ 6 * z);
}
private:
T a;
@@ -206,17 +235,19 @@
T cbrt(T z)
{
using namespace std;
+ using namespace boost::math::tools;
+
int exp;
frexp(z, &exp);
T min = ldexp(0.5, exp/3);
T max = ldexp(2.0, exp/3);
T guess = ldexp(1.0, exp/3);
int digits = std::numeric_limits<T>::digits / 2;
- return tools::halley_iterate(detail::cbrt_functor<T>(z), guess, min, max, digits);
+ return halley_iterate(detail::cbrt_functor<T>(z), guess, min, max, digits);
}
Note that the iterations are set to stop at just one-half of full precision,
-and yet even so not one of the test cases had a single bit wrong.
+and yet, even so, not one of the test cases had a single bit wrong.
What's more, the maximum number of iterations was now just 4.
Just to complete the picture, we could have called `schroeder_iterate` in the last
@@ -228,17 +259,18 @@
Finally, had we called cbrt with [@http://shoup.net/ntl/doc/RR.txt NTL::RR]
set to 1000 bit precision, then full precision can be obtained with just 7 iterations.
-To put that in perspective
+To put that in perspective,
an increase in precision by a factor of 20, has less than doubled the number of
iterations. That just goes to emphasise that most of the iterations are used
up getting the first few digits correct: after that these methods can churn out
-further digits with remarkable efficiency. Or to put it another way: ['nothing beats
-a really good initial guess!]
+further digits with remarkable efficiency.
+
+Or to put it another way: ['nothing beats a really good initial guess!]
-[endsect][/section:roots Root Finding With Derivatives]
+[endsect] [/section:roots Root Finding With Derivatives]
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/roots_without_derivatives.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/roots_without_derivatives.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,13 +1,14 @@
-[section:roots2 Root Finding Without Derivatives]
+[section:roots2 Root Finding Without Derivatives: Bisection, Bracket and TOMS748]
[h4 Synopsis]
``
#include <boost/math/tools/roots.hpp>
``
-
- namespace boost{ namespace math{ namespace tools{
-
+
+ namespace boost{ namespace math{
+ namespace tools{
+ // Bisection
template <class F, class T, class Tol>
std::pair<T, T>
bisect(
@@ -35,6 +36,7 @@
boost::uintmax_t& max_iter,
const ``__Policy``&);
+ // Bracket and Solve Root
template <class F, class T, class Tol>
std::pair<T, T>
bracket_and_solve_root(
@@ -56,6 +58,7 @@
boost::uintmax_t& max_iter,
const ``__Policy``&);
+ // TOMS 748 algorithm
template <class F, class T, class Tol>
std::pair<T, T>
toms748_solve(
@@ -110,10 +113,12 @@
[h4 Description]
-These functions solve the root of some function /f(x)/ without the
-need for the derivatives of /f(x)/. The functions here that use TOMS
-Algorithm 748 are asymptotically the most efficient known, and have
-been shown to be optimal for a certain classes of smooth functions.
+These functions solve the root of some function /f(x)/ ['without the
+need for any derivatives of /f(x)/].
+
+The `bracket_and_solve_root` functions use TOMS Algorithm 748 that is asymptotically the most efficient known,
+and have been shown to be optimal for a certain classes of smooth functions.
+Variants with and without __policies are provided.
Alternatively, there is a simple bisection routine which can be useful
in its own right in some situations, or alternatively for narrowing
@@ -136,6 +141,8 @@
an integer. Other user-defined termination conditions are likely to be used
only rarely, but may be useful in some specific circumstances.
+[h6 Bisection]
+
template <class F, class T, class Tol>
std::pair<T, T>
bisect(
@@ -163,7 +170,7 @@
boost::uintmax_t& max_iter,
const ``__Policy``&);
-These functions locate the root using bisection, function arguments are:
+These functions locate the root using bisection: function arguments are:
[variablelist
[[f] [A unary functor which is the function whose root is to be found.]]
@@ -196,9 +203,11 @@
In other words, it's up to the caller to verify whether termination occurred
as a result of exceeding /max_iter/ function invocations (easily done by
-checking the value of /max_iter/ when the function returns), rather than
+checking the updated value of /max_iter/ when the function returns), rather than
because the termination condition /tol/ was satisfied.
+[h6 Bracket and solve]
+
template <class F, class T, class Tol>
std::pair<T, T>
bracket_and_solve_root(
@@ -266,6 +275,8 @@
checking the value of /max_iter/ when the function returns), rather than
because the termination condition /tol/ was satisfied.
+[h6 Algorithm TOMS 748: Alefeld, Potra and Shi: Enclosing zeros of continuous functions]
+
template <class F, class T, class Tol>
std::pair<T, T>
toms748_solve(
@@ -311,7 +322,7 @@
These two functions implement TOMS Algorithm 748: it uses a mixture of
cubic, quadratic and linear (secant) interpolation to locate the root of
/f(x)/. The two functions differ only by whether values for /f(a)/ and
-/f(b)/ are already available. The parameters are:
+/f(b)/ are already available. The toms748_solve parameters are:
[variablelist
[[f] [A unary functor that is the function whose root is to be solved.
@@ -325,7 +336,7 @@
[[fb] [Optional: the value of /f(b)/.]]
[[tol] [A binary functor that determines the termination condition for the search
for the root. /tol/ is passed the current brackets at each step,
- when it returns true then the current brackets are returned as the result.]]
+ when it returns true, then the current brackets are returned as the result.]]
[[max_iter] [The maximum number of function invocations to perform in the search
for the root. On exit /max_iter/ is set to actual number of function
invocations used.]]
@@ -333,24 +344,19 @@
[optional_policy]
-Returns: a pair of values /r/ that bracket the root so that:
-
+toms748_solve returns: a pair of values /r/ that bracket the root so that:
f(r.first) * f(r.second) <= 0
-
and either
-
tol(r.first, r.second) == true
-
or
-
max_iter >= m
-
where /m/ is the initial value of /max_iter/ passed to the function.
In other words, it's up to the caller to verify whether termination occurred
as a result of exceeding /max_iter/ function invocations (easily done by
-checking the value of /max_iter/), rather than because the termination
-condition /tol/ was satisfied.
+checking the updated value of /max_iter/
+against its previous value passed as parameter),
+rather than because the termination condition /tol/ was satisfied.
template <class T>
struct eps_tolerance
@@ -359,10 +365,10 @@
bool operator()(const T& a, const T& b)const;
};
-This is the usual termination condition used with these root finding functions.
+`eps_tolerance` is the usual termination condition used with these root finding functions.
Its operator() will return true when the relative distance between /a/ and /b/
is less than twice the machine epsilon for T, or 2[super 1-bits], whichever is
-the larger. In other words you set /bits/ to the number of bits of precision you
+the larger. In other words, you set /bits/ to the number of bits of precision you
want in the result. The minimal tolerance of twice the machine epsilon of T is
required to ensure that we get back a bracketing interval: since this must clearly
be at least 1 epsilon in size.
@@ -400,7 +406,7 @@
[h4 Implementation]
The implementation of the bisection algorithm is extremely straightforward
-and not detailed here. TOMS algorithm 748 is described in detail in:
+and not detailed here. __TOMS748 is described in detail in:
['Algorithm 748: Enclosing Zeros of Continuous Functions,
G. E. Alefeld, F. A. Potra and Yixun Shi,
@@ -409,10 +415,10 @@
The implementation here is a faithful translation of this paper into C++.
-[endsect][/section:roots2 Root Finding Without Derivatives]
+[endsect] [/section:roots2 Root Finding Without Derivatives]
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/structure.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/structure.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -82,7 +82,7 @@
[Performance testing and tuning program.]]
[[\/test\/]
- [Test files, in various .cpp files, most using Boost.Test
+ [Test files, in many .cpp files, most using Boost.Test
(some with test data as .ipp files, usually generated using NTL RR
type with ample precision for the type, often for precisions
suitable for up to 256-bit significand real types).]]
@@ -124,7 +124,7 @@
[endsect]
[/ structure.qbk
- Copyright 2006 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt).
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/tuple.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/tuple.qbk 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -8,8 +8,9 @@
[h4 Description]
-This header defines the type `boost::math::tuple`, the associated free functions `ignore`, `tie`, `make_tuple`, `get`, and associated types
-`tuple_size` and `tuple_element`.
+This header defines the type `boost::math::tuple`,
+the associated free functions `ignore`, `tie`, `make_tuple`, `get`,
+and associated types `tuple_size` and `tuple_element`.
These types and functions are aliases for:
@@ -18,6 +19,8 @@
* boost::fusion::tuple etc if the compiler supports it, otherwise:
* boost::tuple.
+So this `boost::math::tuple` is strongly recommended for maximum portability.
+
[endsect][/section:Tuples Tuples]
[/
Copyright 2010 John Maddock.
==============================================================================
--- branches/release/libs/math/dot_net_example/Setupdistex/Setupdistex.vdproj (original)
+++ branches/release/libs/math/dot_net_example/Setupdistex/Setupdistex.vdproj 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,4 +1,4 @@
-"DeployProject"
+"DeployProject"
{
"VSVersion" = "3:800"
"ProjectType" = "8:{978C614F-708E-4E1A-B201-565925725DBA}"
@@ -21,14 +21,14 @@
}
"Entry"
{
- "MsmKey" = "8:_CAB578E889B9DB0C72DF603D9321F8AC"
- "OwnerKey" = "8:_E013438B00CC4DFFB5C0037F77E7EF5E"
+ "MsmKey" = "8:_E013438B00CC4DFFB5C0037F77E7EF5E"
+ "OwnerKey" = "8:_UNDEFINED"
"MsmSig" = "8:_UNDEFINED"
}
"Entry"
{
- "MsmKey" = "8:_E013438B00CC4DFFB5C0037F77E7EF5E"
- "OwnerKey" = "8:_UNDEFINED"
+ "MsmKey" = "8:_FB62FDEC0F5B4CE14900FC0F977E3BEA"
+ "OwnerKey" = "8:_E013438B00CC4DFFB5C0037F77E7EF5E"
"MsmSig" = "8:_UNDEFINED"
}
"Entry"
@@ -40,7 +40,7 @@
"Entry"
{
"MsmKey" = "8:_UNDEFINED"
- "OwnerKey" = "8:_CAB578E889B9DB0C72DF603D9321F8AC"
+ "OwnerKey" = "8:_FB62FDEC0F5B4CE14900FC0F977E3BEA"
"MsmSig" = "8:_UNDEFINED"
}
}
@@ -102,6 +102,21 @@
"ComponentsUrl" = "8:"
"Items"
{
+ "{EDC2488A-8267-493A-A98E-7D9C3B36CDF3}:.NETFramework,Version=v4.0,Profile=Client"
+ {
+ "Name" = "8:Microsoft .NET Framework 4 Client Profile (x86 and x64)"
+ "ProductCode" = "8:.NETFramework,Version=v4.0,Profile=Client"
+ }
+ "{EDC2488A-8267-493A-A98E-7D9C3B36CDF3}:Microsoft.Visual.C++.10.0.x86"
+ {
+ "Name" = "8:Visual C++ 2010 Runtime Libraries (x86)"
+ "ProductCode" = "8:Microsoft.Visual.C++.10.0.x86"
+ }
+ "{EDC2488A-8267-493A-A98E-7D9C3B36CDF3}:Microsoft.Windows.Installer.4.5"
+ {
+ "Name" = "8:Windows Installer 4.5"
+ "ProductCode" = "8:Microsoft.Windows.Installer.4.5"
+ }
}
}
}
@@ -121,13 +136,13 @@
{
"LaunchCondition"
{
- "{A06ECF26-33A3-4562-8140-9B0E340D4F24}:_AEF480F71EBE4AFBBD48CB522592A6B7"
+ "{A06ECF26-33A3-4562-8140-9B0E340D4F24}:_87D6521D9A764588ADCCF384CEE6300E"
{
"Name" = "8:.NET Framework"
"Message" = "8:[VSDNETMSG]"
- "Version" = "8:2.0.50727"
+ "FrameworkVersion" = "8:.NETFramework,Version=v4.0,Profile=Client"
"AllowLaterVersions" = "11:FALSE"
- "InstallUrl" = "8:http://go.microsoft.com/fwlink/?LinkId=9832"
+ "InstallUrl" = "8:http://go.microsoft.com/fwlink/?LinkId=131000"
}
}
}
@@ -153,14 +168,14 @@
"IsDependency" = "11:FALSE"
"IsolateTo" = "8:"
}
- "{9F6F8455-1EF1-4B85-886A-4223BCC8E7F7}:_CAB578E889B9DB0C72DF603D9321F8AC"
+ "{9F6F8455-1EF1-4B85-886A-4223BCC8E7F7}:_FB62FDEC0F5B4CE14900FC0F977E3BEA"
{
"AssemblyRegister" = "3:1"
"AssemblyIsInGAC" = "11:FALSE"
- "AssemblyAsmDisplayName" = "8:boost_math, Version=1.1.3517.21485, Culture=neutral, processorArchitecture=x86"
+ "AssemblyAsmDisplayName" = "8:boost_math, Version=1.1.3986.26717, Culture=neutral, processorArchitecture=x86"
"ScatterAssemblies"
{
- "_CAB578E889B9DB0C72DF603D9321F8AC"
+ "_FB62FDEC0F5B4CE14900FC0F977E3BEA"
{
"Name" = "8:boost_math.dll"
"Attributes" = "3:512"
@@ -240,14 +255,15 @@
{
"Name" = "8:Microsoft Visual Studio"
"ProductName" = "8:Distex"
- "ProductCode" = "8:{552F94DB-DB2D-42FA-8D56-9BE2C1D92B8F}"
- "PackageCode" = "8:{6AABF60D-ABA2-4DF9-81F7-AD8DE5A60E03}"
+ "ProductCode" = "8:{185E41A5-00EC-4487-BFB9-F3170DD17988}"
+ "PackageCode" = "8:{BC62A97F-3C54-431B-9178-38070981A05C}"
"UpgradeCode" = "8:{DB0FCB69-2AFF-4EFE-B2F9-1ADA0638268C}"
+ "AspNetVersion" = "8:4.0.30319.0"
"RestartWWWService" = "11:FALSE"
"RemovePreviousVersions" = "11:TRUE"
"DetectNewerInstalledVersion" = "11:TRUE"
"InstallAllUsers" = "11:TRUE"
- "ProductVersion" = "8:1.0.1"
+ "ProductVersion" = "8:1.0.9"
"Manufacturer" = "8:hetp"
"ARPHELPTELEPHONE" = "8:"
"ARPHELPLINK" = "8:"
==============================================================================
--- branches/release/libs/math/dot_net_example/boost_math/AssemblyInfo.cpp (original)
+++ branches/release/libs/math/dot_net_example/boost_math/AssemblyInfo.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,6 +1,6 @@
#include "stdafx.h"
-// Copyright Paul A. Bristow & John Maddock 2009
+// Copyright Paul A. Bristow & John Maddock 2009, 2010
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
@@ -12,17 +12,15 @@
using namespace System::Runtime::InteropServices;
using namespace System::Security::Permissions;
-//
-// General Information about an assembly is controlled through the following
-// set of attributes. Change these attribute values to modify the information
-// associated with an assembly.
-//
+// General Information about an assembly is controlled through the following set of attributes.
+// Change these attribute values to modify the information associated with an assembly.
+
[assembly:AssemblyTitleAttribute("boost_math")];
[assembly:AssemblyDescriptionAttribute("Math Toolkit")];
[assembly:AssemblyConfigurationAttribute("")];
[assembly:AssemblyCompanyAttribute("jmc")];
[assembly:AssemblyProductAttribute("boost_math")];
-[assembly:AssemblyCopyrightAttribute("Copyright (c) jmc 2007, 2009")];
+[assembly:AssemblyCopyrightAttribute("Copyright (c) jmc 2007 - 2010")];
[assembly:AssemblyTrademarkAttribute("")];
[assembly:AssemblyCultureAttribute("")];
==============================================================================
--- branches/release/libs/math/dot_net_example/boost_math/Stdafx.h (original)
+++ branches/release/libs/math/dot_net_example/boost_math/Stdafx.h 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -3,14 +3,14 @@
// but are changed infrequently.
// Copyright John Maddock 2007.
-// Copyright Paul A. Bristow 2007, 2009
+// Copyright Paul A. Bristow 2007, 2009, 2010
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
// or copy at http://www.boost.org/LICENSE_1_0.txt)
-// Laplace added Aug 2009 PAB
+// Laplace added Aug 2009 PAB, and several others Nov 2010.
#pragma once
@@ -26,9 +26,19 @@
#include <boost/math/distributions/extreme_value.hpp>
#include <boost/math/distributions/fisher_f.hpp>
#include <boost/math/distributions/gamma.hpp>
+#include <boost/math/distributions/geometric.hpp>
+#include <boost/math/distributions/hypergeometric.hpp>
+#include <boost/math/distributions/inverse_chi_squared.hpp>
+#include <boost/math/distributions/inverse_gamma.hpp>
+#include <boost/math/distributions/inverse_gaussian.hpp>
#include <boost/math/distributions/laplace.hpp>
+#include <boost/math/distributions/logistic.hpp>
#include <boost/math/distributions/lognormal.hpp>
#include <boost/math/distributions/negative_binomial.hpp>
+#include <boost/math/distributions/non_central_beta.hpp>
+#include <boost/math/distributions/non_central_chi_squared.hpp>
+#include <boost/math/distributions/non_central_f.hpp>
+#include <boost/math/distributions/non_central_t.hpp>
#include <boost/math/distributions/normal.hpp>
#include <boost/math/distributions/pareto.hpp>
#include <boost/math/distributions/poisson.hpp>
@@ -37,4 +47,3 @@
#include <boost/math/distributions/triangular.hpp>
#include <boost/math/distributions/uniform.hpp>
#include <boost/math/distributions/weibull.hpp>
-
==============================================================================
--- branches/release/libs/math/dot_net_example/boost_math/boost_math.cpp (original)
+++ branches/release/libs/math/dot_net_example/boost_math/boost_math.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -21,7 +21,9 @@
#include "stdafx.h"
#pragma warning(disable: 4400) // 'const boost_math::any_distribution ^' : const/volatile qualifiers on this type are not supported
-
+#pragma warning(disable: 4244) // 'argument' : conversion from 'double' to 'unsigned int', possible loss of data
+#pragma warning(disable: 4512) // assignment operator could not be generated
+// hypergeometric expects integer parameters.
#include "boost_math.h"
namespace boost_math
@@ -32,7 +34,7 @@
TRANSLATE_EXCEPTIONS_BEGIN
// This is where all the work gets done:
switch(t) // index of distribution to distribution_info distributions[]
- { // New entires must match distribution names, parameter name(s) and defaults defined below.
+ { // New entries must match distribution names, parameter name(s) and defaults defined below.
case 0:
this->reset(new concrete_distribution<boost::math::bernoulli>(boost::math::bernoulli(arg1)));
break;
@@ -61,42 +63,72 @@
this->reset(new concrete_distribution<boost::math::gamma_distribution<> >(boost::math::gamma_distribution<>(arg1, arg2)));
break;
case 9:
- this->reset(new concrete_distribution<boost::math::laplace_distribution<> >(boost::math::laplace_distribution<>(arg1, arg2)));
+ this->reset(new concrete_distribution<boost::math::geometric_distribution<> >(boost::math::geometric_distribution<>(arg1)));
break;
case 10:
- this->reset(new concrete_distribution<boost::math::lognormal_distribution<> >(boost::math::lognormal_distribution<>(arg1, arg2)));
+ this->reset(new concrete_distribution<boost::math::hypergeometric_distribution<> >(boost::math::hypergeometric_distribution<>(arg1, arg2, arg3)));
break;
case 11:
+ this->reset(new concrete_distribution<boost::math::inverse_chi_squared_distribution<> >(boost::math::inverse_chi_squared_distribution<>(arg1, arg2)));
+ break;
+ case 12:
+ this->reset(new concrete_distribution<boost::math::inverse_gamma_distribution<> >(boost::math::inverse_gamma_distribution<>(arg1, arg2)));
+ break;
+ case 13:
+ this->reset(new concrete_distribution<boost::math::inverse_gaussian_distribution<> >(boost::math::inverse_gaussian_distribution<>(arg1, arg2)));
+ break;
+ case 14:
+ this->reset(new concrete_distribution<boost::math::laplace_distribution<> >(boost::math::laplace_distribution<>(arg1, arg2)));
+ break;
+ case 15:
+ this->reset(new concrete_distribution<boost::math::logistic_distribution<> >(boost::math::logistic_distribution<>(arg1, arg2)));
+ break;
+ case 16:
+ this->reset(new concrete_distribution<boost::math::lognormal_distribution<> >(boost::math::lognormal_distribution<>(arg1, arg2)));
+ break;
+ case 17:
this->reset(new concrete_distribution<boost::math::negative_binomial_distribution<> >(boost::math::negative_binomial_distribution<>(arg1, arg2)));
break;
- case 12:
+ case 18:
+ this->reset(new concrete_distribution<boost::math::non_central_beta_distribution<> >(boost::math::non_central_beta_distribution<>(arg1, arg2, arg3)));
+ break;
+ case 19:
+ this->reset(new concrete_distribution<boost::math::non_central_chi_squared_distribution<> >(boost::math::non_central_chi_squared_distribution<>(arg1, arg2)));
+ break;
+ case 20:
+ this->reset(new concrete_distribution<boost::math::non_central_f_distribution<> >(boost::math::non_central_f_distribution<>(arg1, arg2, arg3)));
+ break;
+ case 21:
+ this->reset(new concrete_distribution<boost::math::non_central_t_distribution<> >(boost::math::non_central_t_distribution<>(arg1, arg2)));
+ break;
+ case 22:
this->reset(new concrete_distribution<boost::math::normal_distribution<> >(boost::math::normal_distribution<>(arg1, arg2)));
break;
- case 13:
+ case 23:
this->reset(new concrete_distribution<boost::math::pareto>(boost::math::pareto(arg1, arg2)));
break;
- case 14:
+ case 24:
this->reset(new concrete_distribution<boost::math::poisson>(boost::math::poisson(arg1)));
break;
- case 15:
+ case 25:
this->reset(new concrete_distribution<boost::math::rayleigh>(boost::math::rayleigh(arg1)));
break;
- case 16:
+ case 26:
this->reset(new concrete_distribution<boost::math::students_t>(boost::math::students_t(arg1)));
break;
- case 17:
+ case 27:
this->reset(new concrete_distribution<boost::math::triangular>(boost::math::triangular(arg1, arg2, arg3)));
break;
- case 18:
+ case 28:
this->reset(new concrete_distribution<boost::math::uniform>(boost::math::uniform(arg1, arg2)));
break;
- case 19:
+ case 29:
this->reset(new concrete_distribution<boost::math::weibull>(boost::math::weibull(arg1, arg2)));
break;
+
default:
- // TODO:
- // Need some proper error handling here:
+ // TODO Need some proper error handling here?
assert(0);
}
TRANSLATE_EXCEPTIONS_END
@@ -105,10 +137,10 @@
struct distribution_info
{
const char* name; // of distribution.
- const char* first_param; // parameters name like "degrees of freedom"
- const char* second_param; // if required, else "".
+ const char* first_param; // Parameters' name like "degrees of freedom",
+ const char* second_param; // if required, else "",
const char* third_param; // if required, else "".
- // triangular need 3 parameters.
+ // triangular and non-centrals need 3 parameters.
// (Only the Bi-Weibull would need 5 parameters?)
double first_default; // distribution parameter value, often 0, 0.5 or 1.
double second_default; // 0 if there isn't a second argument.
@@ -129,19 +161,29 @@
{ "Exponential", "lambda", "", "", 1, 0, 0}, // case 5
{ "Extreme value", "Location", "Scale", "", 0, 1, 0}, // case 6
{ "Fisher-F", "Degrees of freedom 1", "Degrees of freedom 2", "", 1, 1, 0}, // case 7
- { "Gamma", "Shape", "Scale", "", 1, 1, }, // case 8
- { "Laplace", "Location", "Scale", "", 0, 1, 0}, // case 9
- { "Lognormal", "Location", "Scale", "", 0, 1, 0}, // case 10
- { "Negative Binomial", "Successes", "Probability of success", "", 1, 0.5, 0}, // case 11
- { "Normal (Gaussian)", "Mean", "Standard Deviation", "", 0, 1, 0}, // case 12
- { "Pareto", "Location", "Shape","", 1, 1, 0}, // case 13
- { "Poisson", "Mean", "", "", 1, 0, 0}, // case 14
- { "Rayleigh", "Sigma", "", "", 1, 0, 0}, // case 15
- { "Student's t", "Degrees of Freedom", "", "", 1, 0, 0}, // case 16
- { "Triangular", "Lower", "Mode", "Upper", -1, 0, +1 }, // case 17 3rd parameter!
+ { "Gamma (Erlang)", "Shape", "Scale", "", 1, 1, 0}, // case 8
+ { "Geometric", "Probability", "", "", 1, 0, 0}, // case 9
+ { "HyperGeometric", "Defects", "Samples", "Objects", 1, 0, 1}, // case 10
+ { "InverseChiSq", "Degrees of Freedom", "Scale", "", 1, 1, 0}, // case 11
+ { "InverseGamma", "Shape", "Scale", "", 1, 1, 0}, // case 12
+ { "InverseGaussian", "Mean", "Scale", "", 1, 1, 0}, // case 13
+ { "Laplace", "Location", "Scale", "", 0, 1, 0}, // case 14
+ { "Logistic", "Location", "Scale", "", 0, 1, 0}, // case 15
+ { "LogNormal", "Location", "Scale", "", 0, 1, 0}, // case 16
+ { "Negative Binomial", "Successes", "Probability of success", "", 1, 0.5, 0}, // case 17
+ { "Noncentral Beta", "Shape alpha", "Shape beta", "Non-centrality", 1, 1, 0}, // case 18
+ { "Noncentral ChiSquare", "Degrees of Freedom", "Non-centrality", "", 1, 0, 0}, // case 19
+ { "Noncentral F", "Degrees of Freedom 1", "Degrees of Freedom 2", "Non-centrality", 1, 1, 0}, // case 20
+ { "Noncentral t", "Degrees of Freedom", "Non-centrality", "", 1, 0, 0}, // case 21
+ { "Normal (Gaussian)", "Mean", "Standard Deviation", "", 0, 1, 0}, // case 22
+ { "Pareto", "Location", "Shape","", 1, 1, 0}, // case 23
+ { "Poisson", "Mean", "", "", 1, 0, 0}, // case 24
+ { "Rayleigh", "Shape", "", "", 1, 0, 0}, // case 25
+ { "Student's t", "Degrees of Freedom", "", "", 1, 0, 0}, // case 26
+ { "Triangular", "Lower", "Mode", "Upper", -1, 0, +1 }, // case 27 3rd parameter!
// 0, 0.5, 1 also said to be 'standard' but this is most like an approximation to Gaussian distribution.
- { "Uniform", "Lower", "Upper", "", 0, 1, 0}, // case 18
- { "Weibull", "Shape", "Scale", "", 1, 1, 0}, // case 19
+ { "Uniform", "Lower", "Upper", "", 0, 1, 0}, // case 28
+ { "Weibull", "Shape", "Scale", "", 1, 1, 0}, // case 29
};
// How many distributions are supported:
==============================================================================
--- branches/release/libs/math/dot_net_example/boost_math/boost_math.sln (original)
+++ branches/release/libs/math/dot_net_example/boost_math/boost_math.sln 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,7 @@

-Microsoft Visual Studio Solution File, Format Version 10.00
-# Visual Studio 2008
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "boost_math", "boost_math.vcproj", "{CEE4BAD0-967A-4193-9EDB-C0DD6C3B05C9}"
+Microsoft Visual Studio Solution File, Format Version 11.00
+# Visual Studio 2010
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "boost_math", "boost_math.vcxproj", "{CEE4BAD0-967A-4193-9EDB-C0DD6C3B05C9}"
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution
==============================================================================
--- branches/release/libs/math/dot_net_example/boost_math/boost_math.vcproj (original)
+++ branches/release/libs/math/dot_net_example/boost_math/boost_math.vcproj 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -169,17 +169,17 @@
<References>
<AssemblyReference
RelativePath="System.dll"
- AssemblyName="System, Version=2.0.0.0, PublicKeyToken=b77a5c561934e089, processorArchitecture=MSIL"
+ AssemblyName="System, Version=4.0.0.0, PublicKeyToken=b77a5c561934e089, processorArchitecture=MSIL"
MinFrameworkVersion="131072"
/>
<AssemblyReference
RelativePath="System.Data.dll"
- AssemblyName="System.Data, Version=2.0.0.0, PublicKeyToken=b77a5c561934e089, processorArchitecture=x86"
+ AssemblyName="System.Data, Version=4.0.0.0, PublicKeyToken=b77a5c561934e089, processorArchitecture=x86"
MinFrameworkVersion="131072"
/>
<AssemblyReference
RelativePath="System.XML.dll"
- AssemblyName="System.Xml, Version=2.0.0.0, PublicKeyToken=b77a5c561934e089, processorArchitecture=MSIL"
+ AssemblyName="System.Xml, Version=4.0.0.0, PublicKeyToken=b77a5c561934e089, processorArchitecture=MSIL"
MinFrameworkVersion="131072"
/>
</References>
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/DistexForm.cs (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/DistexForm.cs 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -554,7 +554,7 @@
private void contentsToolStripMenuItem_Click(object sender, EventArgs e)
{ // In lieu of proper help.
string helpText = "\n" + AssemblyDescription +
- "Version " + Assembly.GetExecutingAssembly().GetName().Version.ToString() +
+ "\nVersion " + Assembly.GetExecutingAssembly().GetName().Version.ToString() +
"\nA Windows utility to show the properties of distributions" +
"\n and permits calculation of probability density (or mass) function (PDF)" +
"\nand cumulative distribution function (CDF) and complement from values provided." +
@@ -570,11 +570,11 @@
"\nalthough not all computed values will be as accurate as this.\n" +
"\nValues shown as NaN cannot be calculated from the value given," +
"\nmost commonly because the value is outside the range for the distribution." +
- "n" +
- "\nFor more information, including downloads see " +
- "\nhttp://boost-consulting.com/vault/index.php?action=downloadfile&filename=math_toolkit.html&directory=Math%20-%20Numerics&" +
- "\n(Note that .NET framework 2.0 and VCredist are requirements for this program.)" +
- "\n\nCopyright John Maddock & Paul A. Bristow 2007, 2009";
+ "\n" +
+ "\nFor more information, including downloads, see " +
+ "\nhttp://sourceforge.net/projects/distexplorer/" +
+ "\n(Note that .NET framework 4.0 and VC Redistribution X86 are requirements for this program.)" +
+ "\n\nCopyright John Maddock & Paul A. Bristow 2007, 2009, 2010";
MessageBox.Show("Statistical Distribution Explorer\n" + helpText);
}
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/Properties/AssemblyInfo.cs (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/Properties/AssemblyInfo.cs 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,11 +6,11 @@
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
[assembly: AssemblyTitle("Statistical Distribution Explorer")]
-[assembly: AssemblyDescription("Shows distribution properties, PDF, CDF, complement and quantile.")]
+[assembly: AssemblyDescription("Shows distribution properties, PDF, CDF, quantile and complements.")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("hetp")]
-[assembly: AssemblyProduct("Distribution Explorer")]
-[assembly: AssemblyCopyright("Copyright © John Maddock 2007, Paul A. Bristow 2009")]
+[assembly: AssemblyProduct("Statistical Distribution Explorer")]
+[assembly: AssemblyCopyright("Copyright © John Maddock & Paul A. Bristow 2007 - 2010")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
@@ -29,5 +29,5 @@
// Build Number
// Revision
//
-[assembly: AssemblyVersion("1.0.0.6")]
-[assembly: AssemblyFileVersion("1.0.0.0")]
+[assembly: AssemblyVersion("1.0.1.1")]
+[assembly: AssemblyFileVersion("1.0.1.1")]
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Resources.Designer.cs (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Resources.Designer.cs 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,7 @@
//------------------------------------------------------------------------------
// <auto-generated>
// This code was generated by a tool.
-// Runtime Version:2.0.50727.4016
+// Runtime Version:4.0.30319.1
//
// Changes to this file may cause incorrect behavior and will be lost if
// the code is regenerated.
@@ -19,7 +19,7 @@
// class via a tool like ResGen or Visual Studio.
// To add or remove a member, edit your .ResX file then rerun ResGen
// with the /str option, or rebuild your VS project.
- [global::System.CodeDom.Compiler.GeneratedCodeAttribute("System.Resources.Tools.StronglyTypedResourceBuilder", "2.0.0.0")]
+ [global::System.CodeDom.Compiler.GeneratedCodeAttribute("System.Resources.Tools.StronglyTypedResourceBuilder", "4.0.0.0")]
[global::System.Diagnostics.DebuggerNonUserCodeAttribute()]
[global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
internal class Resources {
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Settings.Designer.cs (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/Properties/Settings.Designer.cs 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,7 @@
//------------------------------------------------------------------------------
// <auto-generated>
// This code was generated by a tool.
-// Runtime Version:2.0.50727.4016
+// Runtime Version:4.0.30319.1
//
// Changes to this file may cause incorrect behavior and will be lost if
// the code is regenerated.
@@ -12,7 +12,7 @@
[global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
- [global::System.CodeDom.Compiler.GeneratedCodeAttribute("Microsoft.VisualStudio.Editors.SettingsDesigner.SettingsSingleFileGenerator", "9.0.0.0")]
+ [global::System.CodeDom.Compiler.GeneratedCodeAttribute("Microsoft.VisualStudio.Editors.SettingsDesigner.SettingsSingleFileGenerator", "10.0.0.0")]
internal sealed partial class Settings : global::System.Configuration.ApplicationSettingsBase {
private static Settings defaultInstance = ((Settings)(global::System.Configuration.ApplicationSettingsBase.Synchronized(new Settings())));
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.cs (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.cs 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -23,7 +23,7 @@
this.labelCopyright.Text = AssemblyCopyright;
this.labelCompanyName.Text = AssemblyCompany;
this.textBoxDescription.Text = AssemblyDescription;
- // URL http://boost-consulting.com/vault/index.php?action=downloadfile&filename=math_toolkit.html&directory=Math%20-%20Numerics&
+ // URL http://sourceforge.net/projects/distexplorer
}
#region Assembly Attribute Accessors
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.resx (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/distexAboutBox.resx 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -112,9 +112,9 @@
<value>2.0</value>
</resheader>
<resheader name="reader">
- <value>System.Resources.ResXResourceReader, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089</value>
+ <value>System.Resources.ResXResourceReader, System.Windows.Forms, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089</value>
</resheader>
<resheader name="writer">
- <value>System.Resources.ResXResourceWriter, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089</value>
+ <value>System.Resources.ResXResourceWriter, System.Windows.Forms, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089</value>
</resheader>
</root>
\ No newline at end of file
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/distribution.txt (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/distribution.txt 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,8 +1,8 @@
Statistical Distribution Explorer
-Version 1.0.0.7
+Version 1.0.1.1
Company jmc Use, modification and distribution are subject to the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-Copyright Copyright © John Maddock and Paul A. Bristow 2009
-Product Distribution_explorer 1
+Copyright Copyright © John Maddock and Paul A. Bristow 2009, 2010
+Product Distribution_explorer
Title distribution_explorer
Mean
MeanParameter 1 0
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,4 +1,5 @@
-<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003" ToolsVersion="3.5">
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003" ToolsVersion="4.0">
<PropertyGroup>
<Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>
<Platform Condition=" '$(Platform)' == '' ">AnyCPU</Platform>
@@ -14,27 +15,34 @@
<IsWebBootstrapper>false</IsWebBootstrapper>
<ManifestCertificateThumbprint>393B9B4A721C946375D6D44F80492CFFA03E57B5</ManifestCertificateThumbprint>
<ManifestKeyFile>distribution_explorer_TemporaryKey.pfx</ManifestKeyFile>
- <GenerateManifests>false</GenerateManifests>
+ <GenerateManifests>true</GenerateManifests>
<TargetZone>LocalIntranet</TargetZone>
<SignManifests>false</SignManifests>
<FileUpgradeFlags>
</FileUpgradeFlags>
<UpgradeBackupLocation>
</UpgradeBackupLocation>
- <OldToolsVersion>2.0</OldToolsVersion>
- <PublishUrl>\\hetp7\H%24\Distex\</PublishUrl>
+ <OldToolsVersion>3.5</OldToolsVersion>
+ <TargetFrameworkVersion>v4.0</TargetFrameworkVersion>
+ <TargetFrameworkProfile>Client</TargetFrameworkProfile>
+ <PublishUrl>\\hetpA\H%24\Distex\</PublishUrl>
<Install>true</Install>
<InstallFrom>Unc</InstallFrom>
- <UpdateEnabled>true</UpdateEnabled>
+ <UpdateEnabled>false</UpdateEnabled>
<UpdateMode>Foreground</UpdateMode>
<UpdateInterval>7</UpdateInterval>
<UpdateIntervalUnits>Days</UpdateIntervalUnits>
<UpdatePeriodically>false</UpdatePeriodically>
<UpdateRequired>false</UpdateRequired>
<MapFileExtensions>true</MapFileExtensions>
- <ApplicationRevision>0</ApplicationRevision>
- <ApplicationVersion>1.0.0.0</ApplicationVersion>
+ <SupportUrl>http://sourceforge.net/projects/distexplorer/>
+ <ProductName>Statistical Distribution Explorer</ProductName>
+ <PublisherName>hetp</PublisherName>
+ <ApplicationRevision>8</ApplicationRevision>
+ <ApplicationVersion>1.0.1.8</ApplicationVersion>
<UseApplicationTrust>false</UseApplicationTrust>
+ <CreateDesktopShortcut>true</CreateDesktopShortcut>
+ <PublishWizardCompleted>true</PublishWizardCompleted>
<BootstrapperEnabled>true</BootstrapperEnabled>
</PropertyGroup>
<PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' ">
@@ -108,6 +116,7 @@
<DependentUpon>Resources.resx</DependentUpon>
<DesignTime>True</DesignTime>
</Compile>
+ <None Include="app.config" />
<None Include="Properties\Settings.settings">
<Generator>SettingsSingleFileGenerator</Generator>
<LastGenOutput>Settings.Designer.cs</LastGenOutput>
@@ -134,10 +143,20 @@
<None Include="ToolkitLogo.bmp" />
</ItemGroup>
<ItemGroup>
+ <BootstrapperPackage Include=".NETFramework,Version=v4.0,Profile=Client">
+ <Visible>False</Visible>
+ <ProductName>Microsoft .NET Framework 4 Client Profile %28x86 and x64%29</ProductName>
+ <Install>true</Install>
+ </BootstrapperPackage>
+ <BootstrapperPackage Include="Microsoft.Net.Client.3.5">
+ <Visible>False</Visible>
+ <ProductName>.NET Framework 3.5 SP1 Client Profile</ProductName>
+ <Install>false</Install>
+ </BootstrapperPackage>
<BootstrapperPackage Include="Microsoft.Net.Framework.2.0">
<Visible>False</Visible>
<ProductName>.NET Framework 2.0 %28x86%29</ProductName>
- <Install>true</Install>
+ <Install>false</Install>
</BootstrapperPackage>
<BootstrapperPackage Include="Microsoft.Net.Framework.3.0">
<Visible>False</Visible>
@@ -149,9 +168,19 @@
<ProductName>.NET Framework 3.5</ProductName>
<Install>false</Install>
</BootstrapperPackage>
- <BootstrapperPackage Include="Microsoft.Visual.C++.8.0.x86">
+ <BootstrapperPackage Include="Microsoft.Net.Framework.3.5.SP1">
+ <Visible>False</Visible>
+ <ProductName>.NET Framework 3.5 SP1</ProductName>
+ <Install>false</Install>
+ </BootstrapperPackage>
+ <BootstrapperPackage Include="Microsoft.Visual.C++.10.0.x86">
+ <Visible>False</Visible>
+ <ProductName>Visual C++ 2010 Runtime Libraries %28x86%29</ProductName>
+ <Install>true</Install>
+ </BootstrapperPackage>
+ <BootstrapperPackage Include="Microsoft.Windows.Installer.4.5">
<Visible>False</Visible>
- <ProductName>Visual C++ Runtime Libraries %28x86%29</ProductName>
+ <ProductName>Windows Installer 4.5</ProductName>
<Install>true</Install>
</BootstrapperPackage>
</ItemGroup>
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj.user (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.csproj.user 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,8 @@
-<Project xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+<?xml version="1.0" encoding="utf-8"?>
+<Project xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
<PropertyGroup>
<ProjectView>ProjectFiles</ProjectView>
- <PublishUrlHistory>\\hetp7\H%24\Distex\|\\hetp7\H%24\|I:\boost-sandbox\libs\math_functions\dot_net_example\Distex\|publish\</PublishUrlHistory>
+ <PublishUrlHistory>\\hetpA\H%24\Distex\|\\hetp7\H%24\Distex\|\\hetp7\H%24\|I:\boost-sandbox\libs\math_functions\dot_net_example\Distex\|publish\</PublishUrlHistory>
<InstallUrlHistory>\\hetp7\H%24\</InstallUrlHistory>
<SupportUrlHistory>
</SupportUrlHistory>
@@ -12,5 +13,9 @@
<FallbackCulture>en-US</FallbackCulture>
<VerifyUploadedFiles>false</VerifyUploadedFiles>
<EnableSecurityDebugging>false</EnableSecurityDebugging>
+ <ErrorReportUrlHistory />
+ </PropertyGroup>
+ <PropertyGroup>
+ <ReferencePath>I:\boost-trunk\libs\math\dot_net_example\boost_math\</ReferencePath>
</PropertyGroup>
</Project>
\ No newline at end of file
==============================================================================
--- branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.sln (original)
+++ branches/release/libs/math/dot_net_example/distribution_explorer/distribution_explorer.sln 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,6 +1,6 @@

-Microsoft Visual Studio Solution File, Format Version 10.00
-# Visual Studio 2008
+Microsoft Visual Studio Solution File, Format Version 11.00
+# Visual Studio 2010
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "distribution_explorer", "distribution_explorer.csproj", "{77742493-4236-4975-9BD9-AA3611F0DC0E}"
EndProject
Project("{54435603-DBB4-11D2-8724-00A0C9A8B90C}") = "SetupDistex", "..\Setupdistex\Setupdistex.vdproj", "{663C898C-A698-4579-BA69-C7EC5D08D0EE}"
@@ -19,6 +19,7 @@
{663C898C-A698-4579-BA69-C7EC5D08D0EE}.Debug|Any CPU.ActiveCfg = Debug
{663C898C-A698-4579-BA69-C7EC5D08D0EE}.Debug|Any CPU.Build.0 = Debug
{663C898C-A698-4579-BA69-C7EC5D08D0EE}.Release|Any CPU.ActiveCfg = Release
+ {663C898C-A698-4579-BA69-C7EC5D08D0EE}.Release|Any CPU.Build.0 = Release
EndGlobalSection
GlobalSection(SolutionProperties) = preSolution
HideSolutionNode = FALSE
==============================================================================
Binary files. No diff available.
==============================================================================
--- branches/release/libs/math/example/Jamfile.v2 (original)
+++ branches/release/libs/math/example/Jamfile.v2 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -43,6 +43,11 @@
run find_mean_and_sd_normal.cpp ;
run find_root_example.cpp ;
run find_scale_example.cpp ;
+run geometric_examples.cpp ;
+run inverse_chi_squared_example.cpp ;
+# run inverse_chi_squared_find_df_example.cpp ;
+run inverse_gamma_example.cpp ;
+run inverse_gamma_distribution_example.cpp ;
run laplace_example.cpp ;
run nc_chi_sq_example.cpp ;
run neg_binom_confidence_limits.cpp ;
==============================================================================
--- branches/release/libs/math/example/c_error_policy_example.cpp (original)
+++ branches/release/libs/math/example/c_error_policy_example.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -26,7 +26,7 @@
using boost::math::policies::evaluation_error;
using boost::math::policies::errno_on_error;
-//using boost::math::policies::ignore_error;
+using boost::math::policies::ignore_error;
//using namespace boost::math::policies;
//using namespace boost::math; // avoid potential ambiuity with std:: <random>
@@ -36,7 +36,9 @@
domain_error<errno_on_error>, // 'bad' arguments.
pole_error<errno_on_error>, // argument is pole value.
overflow_error<errno_on_error>, // argument value causes overflow.
- evaluation_error<errno_on_error> // evaluation does not converge and may be inaccurate, or worse.
+ evaluation_error<errno_on_error> // evaluation does not converge and may be inaccurate, or worse,
+ // or there is no way known (yet) to implement this evaluation,
+ // for example, kurtosis of non-central beta distribution.
> C_error_policy;
// std
==============================================================================
--- branches/release/libs/math/example/error_handling_example.cpp (original)
+++ branches/release/libs/math/example/error_handling_example.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -63,6 +63,9 @@
#include <stdexcept>
using std::exception;
+#include <cstddef>
+ // using ::errno
+
/*`
Next we'll define the program's main() to call the student's t
distribution with an invalid degrees of freedom parameter,
==============================================================================
--- branches/release/libs/math/example/neg_binom_confidence_limits.cpp (original)
+++ branches/release/libs/math/example/neg_binom_confidence_limits.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -37,7 +37,6 @@
double alpha[] = { 0.5, 0.25, 0.1, 0.05, 0.01, 0.001, 0.0001, 0.00001 };
/*`
-
Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95% confidence
that the true occurence frequency lies *inside* the calculated interval.
@@ -81,7 +80,6 @@
single-sided interval, for example: ['"Calculate a lower bound so that we are P%
sure that the true occurrence frequency is greater than some value"]
then we would *not* have divided by two.
-
*/
// Now print out the upper and lower limits for the alpha table values.
==============================================================================
--- branches/release/libs/math/example/neg_binomial_sample_sizes.cpp (original)
+++ branches/release/libs/math/example/neg_binomial_sample_sizes.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -29,8 +29,8 @@
//[neg_binomial_sample_sizes
/*`
-It centres around a routine that prints out
-a table of minimum sample sizes for various probability thresholds:
+It centres around a routine that prints out a table of
+minimum sample sizes (number of trials) for various probability thresholds:
*/
void find_number_of_trials(double failures, double p);
/*`
@@ -41,6 +41,8 @@
/*`
Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95% confidence
that the desired number of failures will be observed.
+The values range from a very low 0.5 or 50% confidence up to an extremely high
+confidence of 99.999.
Much of the rest of the program is pretty-printing, the important part
is in the calculation of minimum number of trials required for each
@@ -48,13 +50,8 @@
(int)ceil(negative_binomial::find_minimum_number_of_trials(failures, p, alpha[i]);
-*/
-
-/*`
-
find_minimum_number_of_trials returns a double,
-so ceil rounds this up to ensure we have an integral minimum number of trials.
-
+so `ceil` rounds this up to ensure we have an integral minimum number of trials.
*/
void find_number_of_trials(double failures, double p)
@@ -66,11 +63,10 @@
// Calculate how many trials we need to ensure the
// required number of failures DOES exceed "failures".
- cout << "\n""Target number of failures = " << failures;
- cout << ", Success fraction = " << 100 * p << "%" << endl;
+ cout << "\n""Target number of failures = " << (int)failures;
+ cout << ", Success fraction = " << fixed << setprecision(1) << 100 * p << "%" << endl;
// Print table header:
- cout << "\n\n"
- "____________________________\n"
+ cout << "____________________________\n"
"Confidence Min Number\n"
" Value (%) Of Trials \n"
"____________________________\n";
@@ -106,98 +102,108 @@
/*
Output is:
-
-Autorun "i:\boost-06-05-03-1300\libs\math\test\Math_test\debug\neg_binomial_sample_sizes.exe"
-Target number of failures = 5, Success fraction = 50%
-____________________________
-Confidence Min Number
- Value (%) Of Trials
-____________________________
- 50.000 11
- 75.000 14
- 90.000 17
- 95.000 18
- 99.000 22
- 99.900 27
- 99.990 31
- 99.999 36
-Target number of failures = 50.000, Success fraction = 50.000%
-____________________________
-Confidence Min Number
- Value (%) Of Trials
-____________________________
- 50.000 101
- 75.000 109
- 90.000 115
- 95.000 119
- 99.000 128
- 99.900 137
- 99.990 146
- 99.999 154
-Target number of failures = 500.000, Success fraction = 50.000%
-____________________________
-Confidence Min Number
- Value (%) Of Trials
-____________________________
- 50.000 1001
- 75.000 1023
- 90.000 1043
- 95.000 1055
- 99.000 1078
- 99.900 1104
- 99.990 1126
- 99.999 1146
-Target number of failures = 50.000, Success fraction = 10.000%
-____________________________
-Confidence Min Number
- Value (%) Of Trials
-____________________________
- 50.000 56
- 75.000 58
- 90.000 60
- 95.000 61
- 99.000 63
- 99.900 66
- 99.990 68
- 99.999 71
-Target number of failures = 500.000, Success fraction = 10.000%
-____________________________
-Confidence Min Number
- Value (%) Of Trials
-____________________________
- 50.000 556
- 75.000 562
- 90.000 567
- 95.000 570
- 99.000 576
- 99.900 583
- 99.990 588
- 99.999 594
-Target number of failures = 5.000, Success fraction = 90.000%
-____________________________
-Confidence Min Number
- Value (%) Of Trials
-____________________________
- 50.000 57
- 75.000 73
- 90.000 91
- 95.000 103
- 99.000 127
- 99.900 159
- 99.990 189
- 99.999 217
-Target number of failures = 5.000, Success fraction = 40.000%
-____________________________
-Confidence Min Number
- Value (%) Of Trials
-____________________________
- 50.000 10
- 75.000 11
- 90.000 13
- 95.000 15
- 99.000 18
- 99.900 21
- 99.990 25
- 99.999 28
+Target number of failures = 5, Success fraction = 50.0%
+ ____________________________
+ Confidence Min Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 11
+ 75.000 14
+ 90.000 17
+ 95.000 18
+ 99.000 22
+ 99.900 27
+ 99.990 31
+ 99.999 36
+
+
+ Target number of failures = 50, Success fraction = 50.0%
+ ____________________________
+ Confidence Min Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 101
+ 75.000 109
+ 90.000 115
+ 95.000 119
+ 99.000 128
+ 99.900 137
+ 99.990 146
+ 99.999 154
+
+
+ Target number of failures = 500, Success fraction = 50.0%
+ ____________________________
+ Confidence Min Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 1001
+ 75.000 1023
+ 90.000 1043
+ 95.000 1055
+ 99.000 1078
+ 99.900 1104
+ 99.990 1126
+ 99.999 1146
+
+
+ Target number of failures = 50, Success fraction = 10.0%
+ ____________________________
+ Confidence Min Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 56
+ 75.000 58
+ 90.000 60
+ 95.000 61
+ 99.000 63
+ 99.900 66
+ 99.990 68
+ 99.999 71
+
+
+ Target number of failures = 500, Success fraction = 10.0%
+ ____________________________
+ Confidence Min Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 556
+ 75.000 562
+ 90.000 567
+ 95.000 570
+ 99.000 576
+ 99.900 583
+ 99.990 588
+ 99.999 594
+
+
+ Target number of failures = 5, Success fraction = 90.0%
+ ____________________________
+ Confidence Min Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 57
+ 75.000 73
+ 90.000 91
+ 95.000 103
+ 99.000 127
+ 99.900 159
+ 99.990 189
+ 99.999 217
+
+
+ Target number of failures = 5, Success fraction = 95.0%
+ ____________________________
+ Confidence Min Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 114
+ 75.000 148
+ 90.000 184
+ 95.000 208
+ 99.000 259
+ 99.900 324
+ 99.990 384
+ 99.999 442
*/
==============================================================================
--- branches/release/libs/math/example/normal_misc_examples.cpp (original)
+++ branches/release/libs/math/example/normal_misc_examples.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -40,6 +40,10 @@
double step = 1.; // in z
double range = 4; // min and max z = -range to +range.
int precision = 17; // traditional tables are only computed to much lower precision.
+ // but std::numeric_limits<double>::max_digits10; on new Standard Libraries gives
+ // 17, the maximum number of digits that can possibly be significant.
+ // std::numeric_limits<double>::digits10; == 15 is number of guaranteed digits,
+ // the other two digits being 'noisy'.
// Construct a standard normal distribution s
normal s; // (default mean = zero, and standard deviation = unity)
==============================================================================
--- branches/release/libs/math/example/policy_eg_1.cpp (original)
+++ branches/release/libs/math/example/policy_eg_1.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -14,7 +14,20 @@
using boost::math::tgamma;
// Define the policy to use:
-using namespace boost::math::policies;
+using namespace boost::math::policies; // may be convenient, or
+
+using boost::math::policies::policy;
+// Types of error whose action can be altered by policies:.
+using boost::math::policies::evaluation_error;
+using boost::math::policies::domain_error;
+using boost::math::policies::overflow_error;
+using boost::math::policies::domain_error;
+using boost::math::policies::pole_error;
+// Actions on error (in enum error_policy_type):
+using boost::math::policies::errno_on_error;
+using boost::math::policies::ignore_error;
+using boost::math::policies::throw_on_error;
+using boost::math::policies::user_error;
typedef policy<
domain_error<errno_on_error>,
==============================================================================
--- branches/release/libs/math/example/policy_eg_8.cpp (original)
+++ branches/release/libs/math/example/policy_eg_8.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -38,6 +38,8 @@
T user_denorm_error(const char* function, const char* message, const T& val);
template <class T>
T user_evaluation_error(const char* function, const char* message, const T& val);
+ template <class T, class TargetType>
+ T user_rounding_error(const char* function, const char* message, const T& val, const TargetType& t);
template <class T>
T user_indeterminate_result_error(const char* function, const char* message, const T& val);
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip10.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip10.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -36,4 +36,5 @@
tgamma(12, policy<digits10<5> >()) = 3.99168e+007
-*/
\ No newline at end of file
+*/
+
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip11.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip11.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -41,4 +41,5 @@
Output:
25 binary bits is approoximately equivalent to 9 decimal digits
quantile(normal_distribution<double, policy<digits2<25> > >(), 0.05 = -1.64485363
- */
\ No newline at end of file
+ */
+
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip13.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip13.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -72,4 +72,5 @@
policy_snip_13.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\policy_snip_13.exe
Error in function boost::math::mean(cauchy<double>&): The Cauchy distribution does not have a mean: the only possible return value is 1.#QNAN.
- */
\ No newline at end of file
+ */
+
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip8.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip8.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -19,9 +19,9 @@
policy<discrete_quantile<integer_round_nearest> >
> dist_type;
-// Lower quantile rounded up:
+// Lower quantile rounded (down) to nearest:
double x = quantile(dist_type(20, 0.3), 0.05); // 27
-// Upper quantile rounded down:
+// Upper quantile rounded (down) to nearest:
double y = quantile(complement(dist_type(20, 0.3), 0.05)); // 68
//] //[/policy_ref_snip8]
@@ -40,8 +40,8 @@
Output:
+ using policy<discrete_quantile<integer_round_nearest>
quantile(dist_type(20, 0.3), 0.05) = 27
quantile(complement(dist_type(20, 0.3), 0.05)) 68
-
*/
==============================================================================
--- branches/release/libs/math/test/Jamfile.v2 (original)
+++ branches/release/libs/math/test/Jamfile.v2 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -33,7 +33,8 @@
<toolset>msvc:<cxxflags>/wd4510
<toolset>msvc:<cxxflags>/wd4127
<toolset>msvc:<cxxflags>/wd4701 # needed for lexical cast - temporary.
- <toolset>msvc-7.1:<source>../vc71_fix//vc_fix
+ <toolset>msvc:<cxxflags>/wd4189 # local variable is initialized but not referenced
+ <toolset>msvc-7.1:<source>../vc71_fix//vc_fix
<toolset>msvc-7.1:<pch>off
<toolset>borland:<link>static
<toolset>borland:<runtime-link>static
@@ -51,7 +52,7 @@
<define>BOOST_UBLAS_UNSUPPORTED_COMPILER=0
<include>.
<include>$(ntl-path)/include
- <include>$(gmp_path) <include>$(gmp_path)/mpfr <include>$(gmp_path)/gmpfrxx
+ <include>$(gmp_path) <include>$(gmp_path)/mpfr <include>$(gmp_path)/gmpfrxx <include>$(gmp_path)/mpfrc++
;
cpp-pch pch : pch.hpp : <use>../../test/build//boost_test_exec_monitor ;
@@ -168,6 +169,7 @@
run test_fisher_f.cpp ../../test/build//boost_test_exec_monitor ;
run test_gamma.cpp pch ../../test/build//boost_test_exec_monitor ;
run test_gamma_dist.cpp pch ../../test/build//boost_test_exec_monitor ;
+run test_geometric.cpp ../../test/build//boost_test_exec_monitor ;
run test_hermite.cpp pch ../../test/build//boost_test_exec_monitor ;
run test_hypergeometric_dist.cpp ../../test/build//boost_test_exec_monitor
: # command line
@@ -420,9 +422,10 @@
<toolset>intel:<pch>off
: test_igamma_inva_real_concept ;
run test_instantiate1.cpp test_instantiate2.cpp ;
-
-run test_inverse_gamma_distribution.cpp ../../test/build//boost_test_exec_monitor ;
run test_inverse_chi_squared_distribution.cpp ../../test/build//boost_test_exec_monitor ;
+run test_inverse_gamma_distribution.cpp ../../test/build//boost_test_exec_monitor ;
+
+run test_inverse_gaussian.cpp ../../test/build//boost_test_exec_monitor ;
run test_laplace.cpp ../../test/build//boost_unit_test_framework/<link>static ;
run test_inv_hyp.cpp pch ../../test/build//boost_test_exec_monitor ;
@@ -488,28 +491,28 @@
<define>TEST_REAL_CONCEPT
<toolset>intel:<pch>off
: test_nc_chi_squared_real_concept ;
-run test_nc_beta.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
: # command line
: # input files
: # requirements
<define>TEST_FLOAT
<toolset>intel:<pch>off
: test_nc_beta_float ;
-run test_nc_beta.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
: # command line
: # input files
: # requirements
<define>TEST_DOUBLE
<toolset>intel:<pch>off
: test_nc_beta_double ;
-run test_nc_beta.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
: # command line
: # input files
: # requirements
<define>TEST_LDOUBLE
<toolset>intel:<pch>off
: test_nc_beta_long_double ;
-run test_nc_beta.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
: # command line
: # input files
: # requirements
@@ -765,6 +768,7 @@
compile ntl_concept_check.cpp : [ check-target-builds ../config//has_ntl_rr : : <build>no ] ;
compile mpfr_concept_check.cpp : [ check-target-builds ../config//has_mpfr_class : : <build>no ] ;
+compile mpreal_concept_check.cpp : [ check-target-builds ../config//has_mpreal : : <build>no ] ;
compile test_common_factor_gmpxx.cpp : [ check-target-builds ../config//has_gmpxx : : <build>no ] ;
build-project ../example ;
==============================================================================
--- branches/release/libs/math/test/compile_test/dist_nc_beta_incl_test.cpp (original)
+++ branches/release/libs/math/test/compile_test/dist_nc_beta_incl_test.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -6,48 +6,10 @@
// Basic sanity check that header <boost/math/distributions/non_central_beta.hpp>
// #includes all the files that it needs to.
//
-// In order to pass our conceptual tests, we need to forward declare
-// those functoins that the non-central beta (deliberately) doesn't
-// implement. These declarations have to appear *before* the
-// non central beta is defined, otherwise two-phase lookup
-// won't find them :-(
-//
-#include <boost/math/distributions/fwd.hpp>
-
-namespace boost{ namespace math{
-
-template <class T, class Policy>
-T mean(const non_central_beta_distribution<T, Policy>&)
-{
- return 0;
-}
-
-template <class T, class Policy>
-T variance(const non_central_beta_distribution<T, Policy>&)
-{
- return 0;
-}
-
-template <class T, class Policy>
-T skewness(const non_central_beta_distribution<T, Policy>&)
-{
- return 0;
-}
-
-template <class T, class Policy>
-T kurtosis(const non_central_beta_distribution<T, Policy>&)
-{
- return 0;
-}
-
-template <class T, class Policy>
-T kurtosis_excess(const non_central_beta_distribution<T, Policy>&)
-{
- return 0;
-}
-
-}}
-
+// This must appear *before* any #includes, and precludes pch usage:
+//
+#define BOOST_MATH_ASSERT_UNDEFINED_POLICY false
+//
#include <boost/math/distributions/non_central_beta.hpp>
//
// Note this header includes no other headers, this is
==============================================================================
--- branches/release/libs/math/test/compile_test/instantiate.hpp (original)
+++ branches/release/libs/math/test/compile_test/instantiate.hpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2006.
-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -33,25 +33,6 @@
}
#endif
-namespace boost{ namespace math{
-//
-// The non central beta doesn't define some properties,
-// define some stub methods here so that we can concept
-// check everything else:
-//
-template <class T, class Policy>
-inline T mean(const non_central_beta_distribution<T, Policy>&){ return 0; }
-template <class T, class Policy>
-inline T variance(const non_central_beta_distribution<T, Policy>&){ return 0; }
-template <class T, class Policy>
-inline T skewness(const non_central_beta_distribution<T, Policy>&){ return 0; }
-template <class T, class Policy>
-inline T kurtosis_excess(const non_central_beta_distribution<T, Policy>&){ return 0; }
-template <class T, class Policy>
-inline T kurtosis(const non_central_beta_distribution<T, Policy>&){ return 0; }
-
-}} // namespaces
-
template <class RealType>
void instantiate(RealType)
{
@@ -68,25 +49,27 @@
function_requires<DistributionConcept<extreme_value_distribution<RealType> > >();
function_requires<DistributionConcept<fisher_f_distribution<RealType> > >();
function_requires<DistributionConcept<gamma_distribution<RealType> > >();
- function_requires<DistributionConcept<inverse_gamma_distribution<RealType> > >();
+ function_requires<DistributionConcept<geometric_distribution<RealType> > >();
+ function_requires<DistributionConcept<hypergeometric_distribution<RealType> > >();
function_requires<DistributionConcept<inverse_chi_squared_distribution<RealType> > >();
+ function_requires<DistributionConcept<inverse_gamma_distribution<RealType> > >();
+ function_requires<DistributionConcept<inverse_gaussian_distribution<RealType> > >();
function_requires<DistributionConcept<laplace_distribution<RealType> > >();
function_requires<DistributionConcept<logistic_distribution<RealType> > >();
function_requires<DistributionConcept<lognormal_distribution<RealType> > >();
function_requires<DistributionConcept<negative_binomial_distribution<RealType> > >();
+ function_requires<DistributionConcept<non_central_chi_squared_distribution<RealType> > >();
+ function_requires<DistributionConcept<non_central_beta_distribution<RealType> > >();
+ function_requires<DistributionConcept<non_central_f_distribution<RealType> > >();
+ function_requires<DistributionConcept<non_central_t_distribution<RealType> > >();
function_requires<DistributionConcept<normal_distribution<RealType> > >();
- function_requires<DistributionConcept<rayleigh_distribution<RealType> > >();
function_requires<DistributionConcept<pareto_distribution<RealType> > >();
function_requires<DistributionConcept<poisson_distribution<RealType> > >();
+ function_requires<DistributionConcept<rayleigh_distribution<RealType> > >();
function_requires<DistributionConcept<students_t_distribution<RealType> > >();
function_requires<DistributionConcept<triangular_distribution<RealType> > >();
function_requires<DistributionConcept<uniform_distribution<RealType> > >();
function_requires<DistributionConcept<weibull_distribution<RealType> > >();
- function_requires<DistributionConcept<non_central_chi_squared_distribution<RealType> > >();
- function_requires<DistributionConcept<non_central_beta_distribution<RealType> > >();
- function_requires<DistributionConcept<non_central_f_distribution<RealType> > >();
- function_requires<DistributionConcept<non_central_t_distribution<RealType> > >();
- function_requires<DistributionConcept<hypergeometric_distribution<RealType> > >();
#ifndef BOOST_MATH_INSTANTIATE_MINIMUM
function_requires<DistributionConcept<bernoulli_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<beta_distribution<RealType, test_policy> > >();
@@ -97,25 +80,27 @@
function_requires<DistributionConcept<extreme_value_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<fisher_f_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<gamma_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<inverse_gamma_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<geometric_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<hypergeometric_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<inverse_chi_squared_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<inverse_gamma_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<inverse_gaussian_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<laplace_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<logistic_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<lognormal_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<non_central_chi_squared_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<negative_binomial_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<non_central_chi_squared_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<non_central_beta_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<non_central_f_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<non_central_t_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<normal_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<rayleigh_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<pareto_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<poisson_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<rayleigh_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<students_t_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<triangular_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<uniform_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<weibull_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<non_central_chi_squared_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<non_central_beta_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<non_central_f_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<non_central_t_distribution<RealType, test_policy> > >();
- function_requires<DistributionConcept<hypergeometric_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<dist_test::bernoulli > >();
function_requires<DistributionConcept<dist_test::beta > >();
@@ -126,21 +111,27 @@
function_requires<DistributionConcept<dist_test::extreme_value > >();
function_requires<DistributionConcept<dist_test::fisher_f > >();
function_requires<DistributionConcept<dist_test::gamma > >();
+ function_requires<DistributionConcept<dist_test::geometric > >();
+ function_requires<DistributionConcept<dist_test::hypergeometric > >();
+ function_requires<DistributionConcept<dist_test::inverse_chi_squared > >();
+ function_requires<DistributionConcept<dist_test::inverse_gamma > >();
+ function_requires<DistributionConcept<dist_test::inverse_gaussian > >();
+ function_requires<DistributionConcept<dist_test::laplace > >();
function_requires<DistributionConcept<dist_test::logistic > >();
function_requires<DistributionConcept<dist_test::lognormal > >();
function_requires<DistributionConcept<dist_test::negative_binomial > >();
+ function_requires<DistributionConcept<dist_test::non_central_chi_squared > >();
+ function_requires<DistributionConcept<dist_test::non_central_beta > >();
+ function_requires<DistributionConcept<dist_test::non_central_f > >();
+ function_requires<DistributionConcept<dist_test::non_central_t > >();
function_requires<DistributionConcept<dist_test::normal > >();
- function_requires<DistributionConcept<dist_test::rayleigh > >();
function_requires<DistributionConcept<dist_test::pareto > >();
function_requires<DistributionConcept<dist_test::poisson > >();
+ function_requires<DistributionConcept<dist_test::rayleigh > >();
function_requires<DistributionConcept<dist_test::students_t > >();
function_requires<DistributionConcept<dist_test::triangular > >();
function_requires<DistributionConcept<dist_test::uniform > >();
function_requires<DistributionConcept<dist_test::weibull > >();
- function_requires<DistributionConcept<dist_test::non_central_chi_squared > >();
- function_requires<DistributionConcept<dist_test::non_central_beta > >();
- function_requires<DistributionConcept<dist_test::non_central_f > >();
- function_requires<DistributionConcept<dist_test::non_central_t > >();
function_requires<DistributionConcept<dist_test::hypergeometric > >();
#endif
int i;
==============================================================================
--- branches/release/libs/math/test/log1p_expm1_test.cpp (original)
+++ branches/release/libs/math/test/log1p_expm1_test.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -4,7 +4,7 @@
// Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#include <pch.hpp> // include \libs\math\src\tr1\
+#include <pch.hpp>
// Requires MS extensions permitted or fails to link.
==============================================================================
--- branches/release/libs/math/test/test_bessel_j.cpp (original)
+++ branches/release/libs/math/test/test_bessel_j.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -482,7 +482,7 @@
do_test_cyl_bessel_j_int(j1_tricky, name, "Bessel J1: Mathworld Data (tricky cases) (Integer Version)");
do_test_cyl_bessel_j_int(jn_data, name, "Bessel JN: Mathworld Data (Integer Version)");
- static const boost::array<boost::array<T, 3>, 17> jv_data = {
+ static const boost::array<boost::array<T, 3>, 18> jv_data = {
//SC_(-2.4), SC_(0), std::numeric_limits<T>::infinity(),
SC_(2457)/1024, SC_(1)/1024, SC_(3.80739920118603335646474073457326714709615200130620574875292e-9),
SC_(5.5), SC_(3217)/1024, SC_(0.0281933076257506091621579544064767140470089107926550720453038),
@@ -501,6 +501,8 @@
SC_(10486074) / (1024*1024), SC_(1e+02), SC_(-0.0547064914615137807616774867984047583596945624129838091326863),
SC_(10486074) / (1024*1024), SC_(2e+04), SC_(-0.00556783614400875611650958980796060611309029233226596737701688),
SC_(-10486074) / (1024*1024), SC_(1e+02), SC_(-0.0547613660316806551338637153942604550779513947674222863858713),
+ // Bug report https://svn.boost.org/trac/boost/ticket/4812:
+ SC_(1.5), SC_(8034)/1024, SC_(0.0339477646369710610146236955872928005087352629422508823945264),
};
do_test_cyl_bessel_j(jv_data, name, "Bessel J: Mathworld Data");
==============================================================================
--- branches/release/libs/math/test/test_beta_dist.cpp (original)
+++ branches/release/libs/math/test/test_beta_dist.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -1,7 +1,7 @@
// test_beta_dist.cpp
// Copyright John Maddock 2006.
-// Copyright Paul A. Bristow 2007, 2009.
+// Copyright Paul A. Bristow 2007, 2009, 2010.
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -53,7 +53,7 @@
void test_spot(
RealType a, // alpha a
RealType b, // beta b
- RealType x, // Probability
+ RealType x, // Probability
RealType P, // CDF of beta(a, b)
RealType Q, // Complement of CDF
RealType tol) // Test tolerance.
@@ -111,7 +111,7 @@
beta_distribution<RealType>::find_beta(abeta.alpha(), x, P),
abeta.beta(), tol);
} // if((P < 0.99) && (Q < 0.99)
-
+
} // template <class RealType> void test_spot
template <class RealType> // Any floating-point type RealType.
@@ -164,7 +164,7 @@
beta_distribution<RealType>(static_cast<RealType>(-1), static_cast<RealType>(1)), // bad alpha < 0.
static_cast<RealType>(1)), std::domain_error);
- BOOST_CHECK_THROW(
+ BOOST_CHECK_THROW(
pdf(
beta_distribution<RealType>(static_cast<RealType>(0), static_cast<RealType>(1)), // bad alpha == 0.
static_cast<RealType>(1)), std::domain_error);
@@ -207,7 +207,7 @@
BOOST_CHECK_EQUAL(
beta_distribution<RealType>(static_cast<RealType>(1), static_cast<RealType>(1)).alpha(),
- static_cast<RealType>(1) ); //
+ static_cast<RealType>(1) ); //
BOOST_CHECK_EQUAL(
mean(beta_distribution<RealType>(static_cast<RealType>(1), static_cast<RealType>(1))),
@@ -247,7 +247,7 @@
static_cast<RealType>(0.0001)), // x
static_cast<RealType>(0.0005999400000000004L), // http://members.aol.com/iandjmsmith/BETAEX.HTM
// Slightly higher tolerance for real concept:
- (std::numeric_limits<RealType>::is_specialized ? 1 : 10) * tolerance);
+ (std::numeric_limits<RealType>::is_specialized ? 1 : 10) * tolerance);
BOOST_CHECK_CLOSE_FRACTION(
@@ -260,70 +260,70 @@
BOOST_CHECK_CLOSE_FRACTION(
cdf(beta_distribution<RealType>(static_cast<RealType>(0.5), static_cast<RealType>(2)),
static_cast<RealType>(0.9)), // x
- static_cast<RealType>(0.9961174629530394895796514664963063381217L),
+ static_cast<RealType>(0.9961174629530394895796514664963063381217L),
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
cdf(beta_distribution<RealType>(static_cast<RealType>(0.5), static_cast<RealType>(0.5)),
static_cast<RealType>(0.1)), // x
- static_cast<RealType>(0.2048327646991334516491978475505189480977L),
+ static_cast<RealType>(0.2048327646991334516491978475505189480977L),
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
cdf(beta_distribution<RealType>(static_cast<RealType>(0.5), static_cast<RealType>(0.5)),
static_cast<RealType>(0.9)), // x
- static_cast<RealType>(0.7951672353008665483508021524494810519023L),
+ static_cast<RealType>(0.7951672353008665483508021524494810519023L),
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
quantile(beta_distribution<RealType>(static_cast<RealType>(0.5), static_cast<RealType>(0.5)),
static_cast<RealType>(0.7951672353008665483508021524494810519023L)), // x
- static_cast<RealType>(0.9),
+ static_cast<RealType>(0.9),
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
cdf(beta_distribution<RealType>(static_cast<RealType>(0.5), static_cast<RealType>(0.5)),
static_cast<RealType>(0.6)), // x
- static_cast<RealType>(0.5640942168489749316118742861695149357858L),
+ static_cast<RealType>(0.5640942168489749316118742861695149357858L),
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
quantile(beta_distribution<RealType>(static_cast<RealType>(0.5), static_cast<RealType>(0.5)),
static_cast<RealType>(0.5640942168489749316118742861695149357858L)), // x
- static_cast<RealType>(0.6),
+ static_cast<RealType>(0.6),
// Wolfram
- tolerance);
+ tolerance);
BOOST_CHECK_CLOSE_FRACTION(
cdf(beta_distribution<RealType>(static_cast<RealType>(2), static_cast<RealType>(0.5)),
static_cast<RealType>(0.6)), // x
- static_cast<RealType>(0.1778078083562213736802876784474931812329L),
+ static_cast<RealType>(0.1778078083562213736802876784474931812329L),
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
quantile(beta_distribution<RealType>(static_cast<RealType>(2), static_cast<RealType>(0.5)),
static_cast<RealType>(0.1778078083562213736802876784474931812329L)), // x
- static_cast<RealType>(0.6),
+ static_cast<RealType>(0.6),
// Wolfram
- tolerance); // gives
+ tolerance); // gives
BOOST_CHECK_CLOSE_FRACTION(
cdf(beta_distribution<RealType>(static_cast<RealType>(1), static_cast<RealType>(1)),
- static_cast<RealType>(0.1)), // x
+ static_cast<RealType>(0.1)), // x
static_cast<RealType>(0.1), // 0.1000000000000000000000000000000000000000
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
quantile(beta_distribution<RealType>(static_cast<RealType>(1), static_cast<RealType>(1)),
- static_cast<RealType>(0.1)), // x
+ static_cast<RealType>(0.1)), // x
static_cast<RealType>(0.1), // 0.1000000000000000000000000000000000000000
// Wolfram
tolerance);
@@ -331,14 +331,14 @@
BOOST_CHECK_CLOSE_FRACTION(
cdf(complement(beta_distribution<RealType>(static_cast<RealType>(0.5), static_cast<RealType>(0.5)),
static_cast<RealType>(0.1))), // complement of x
- static_cast<RealType>(0.7951672353008665483508021524494810519023L),
+ static_cast<RealType>(0.7951672353008665483508021524494810519023L),
// Wolfram
tolerance);
BOOST_CHECK_CLOSE_FRACTION(
quantile(beta_distribution<RealType>(static_cast<RealType>(2), static_cast<RealType>(2)),
static_cast<RealType>(0.0280000000000000000000000000000000000L)), // x
- static_cast<RealType>(0.1),
+ static_cast<RealType>(0.1),
// Wolfram
tolerance);
@@ -359,7 +359,7 @@
//void test_spot(
// RealType a, // alpha a
// RealType b, // beta b
- // RealType x, // Probability
+ // RealType x, // Probability
// RealType P, // CDF of beta(a, b)
// RealType Q, // Complement of CDF
// RealType tol) // Test tolerance.
@@ -466,18 +466,18 @@
// but that
// boost::math::beta mybeta1(1., 1.); // Using typedef fails.
// error C2039: 'beta' : is not a member of 'boost::math'
-
+
// Basic sanity-check spot values.
// Some simple checks using double only.
- BOOST_CHECK_EQUAL(mybeta11.alpha(), 1); //
+ BOOST_CHECK_EQUAL(mybeta11.alpha(), 1); //
BOOST_CHECK_EQUAL(mybeta11.beta(), 1);
BOOST_CHECK_EQUAL(mean(mybeta11), 0.5); // 1 / (1 + 1) = 1/2 exactly
BOOST_CHECK_THROW(mode(mybeta11), std::domain_error);
beta_distribution<> mybeta22(2., 2.); // pdf is dome shape.
BOOST_CHECK_EQUAL(mode(mybeta22), 0.5); // 2-1 / (2+2-2) = 1/2 exactly.
- beta_distribution<> mybetaH2(0.5, 2.); //
- beta_distribution<> mybetaH3(0.5, 3.); //
+ beta_distribution<> mybetaH2(0.5, 2.); //
+ beta_distribution<> mybetaH3(0.5, 3.); //
// Check a few values using double.
BOOST_CHECK_EQUAL(pdf(mybeta11, 1), 1); // is uniform unity over 0 to 1,
@@ -516,20 +516,20 @@
BOOST_CHECK_CLOSE_FRACTION(cdf(complement(mybeta22, 0.9)), 0.028000000000000, tol);
// quantile.
- BOOST_CHECK_CLOSE_FRACTION(quantile(mybeta22, 0.028), 0.1, tol);
+ BOOST_CHECK_CLOSE_FRACTION(quantile(mybeta22, 0.028), 0.1, tol);
BOOST_CHECK_CLOSE_FRACTION(quantile(complement(mybeta22, 1 - 0.028)), 0.1, tol);
BOOST_CHECK_EQUAL(kurtosis(mybeta11), 3+ kurtosis_excess(mybeta11)); // Check kurtosis_excess = kurtosis - 3;
BOOST_CHECK_CLOSE_FRACTION(variance(mybeta22), 0.05, tol);
BOOST_CHECK_CLOSE_FRACTION(mean(mybeta22), 0.5, tol);
BOOST_CHECK_CLOSE_FRACTION(mode(mybeta22), 0.5, tol);
- BOOST_CHECK_CLOSE_FRACTION(median(mybeta22), 0.5, tol);
+ BOOST_CHECK_CLOSE_FRACTION(median(mybeta22), 0.5, sqrt(tol)); // Theoretical maximum accuracy using Brent is sqrt(epsilon).
BOOST_CHECK_CLOSE_FRACTION(skewness(mybeta22), 0.0, tol);
BOOST_CHECK_CLOSE_FRACTION(kurtosis_excess(mybeta22), -144.0 / 168, tol);
BOOST_CHECK_CLOSE_FRACTION(skewness(beta_distribution<>(3, 5)), 0.30983866769659335081434123198259, tol);
- BOOST_CHECK_CLOSE_FRACTION(beta_distribution<double>::find_alpha(mean(mybeta22), variance(mybeta22)), mybeta22.alpha(), tol); // mean, variance, probability.
- BOOST_CHECK_CLOSE_FRACTION(beta_distribution<double>::find_beta(mean(mybeta22), variance(mybeta22)), mybeta22.beta(), tol);// mean, variance, probability.
+ BOOST_CHECK_CLOSE_FRACTION(beta_distribution<double>::find_alpha(mean(mybeta22), variance(mybeta22)), mybeta22.alpha(), tol); // mean, variance, probability.
+ BOOST_CHECK_CLOSE_FRACTION(beta_distribution<double>::find_beta(mean(mybeta22), variance(mybeta22)), mybeta22.beta(), tol);// mean, variance, probability.
BOOST_CHECK_CLOSE_FRACTION(mybeta22.find_alpha(mybeta22.beta(), 0.8, cdf(mybeta22, 0.8)), mybeta22.alpha(), tol);
BOOST_CHECK_CLOSE_FRACTION(mybeta22.find_beta(mybeta22.alpha(), 0.8, cdf(mybeta22, 0.8)), mybeta22.beta(), tol);
==============================================================================
--- branches/release/libs/math/test/test_cbrt.cpp (original)
+++ branches/release/libs/math/test/test_cbrt.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -9,7 +9,7 @@
# pragma warning (disable : 4224)
#endif
-#include <pch.hpp> // include \libs\math\src\
+#include <pch.hpp> // include /libs/math/src/
#include <boost/math/concepts/real_concept.hpp>
#include <boost/test/test_exec_monitor.hpp>
==============================================================================
--- branches/release/libs/math/test/test_classify.cpp (original)
+++ branches/release/libs/math/test/test_classify.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -74,6 +74,14 @@
t = (std::numeric_limits<T>::max)();
BOOST_CHECK_EQUAL((::boost::math::fpclassify)(t), (int)FP_NORMAL);
BOOST_CHECK_EQUAL((::boost::math::fpclassify)(-t), (int)FP_NORMAL);
+ BOOST_CHECK_EQUAL((::boost::math::isfinite)(t), true);
+ BOOST_CHECK_EQUAL((::boost::math::isfinite)(-t), true);
+ BOOST_CHECK_EQUAL((::boost::math::isinf)(t), false);
+ BOOST_CHECK_EQUAL((::boost::math::isinf)(-t), false);
+ BOOST_CHECK_EQUAL((::boost::math::isnan)(t), false);
+ BOOST_CHECK_EQUAL((::boost::math::isnan)(-t), false);
+ BOOST_CHECK_EQUAL((::boost::math::isnormal)(t), true);
+ BOOST_CHECK_EQUAL((::boost::math::isnormal)(-t), true);
t = (std::numeric_limits<T>::min)();
BOOST_CHECK_EQUAL((::boost::math::fpclassify)(t), (int)FP_NORMAL);
BOOST_CHECK_EQUAL((::boost::math::fpclassify)(-t), (int)FP_NORMAL);
==============================================================================
--- branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp (original)
+++ branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -9,9 +9,7 @@
// or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifdef _MSC_VER
-# pragma warning (disable : 4224) // nonstandard extension used : formal parameter 'type' was previously defined as a type
-// in Boost.test and lexical_cast
-# pragma warning (disable : 4310) // cast truncates constant value
+# pragma warning (disable : 4310) // cast truncates constant value.
#endif
// http://www.wolframalpha.com/input/?i=inverse+chisquare+distribution
@@ -91,7 +89,7 @@
BOOST_CHECK_CLOSE_FRACTION(
quantile(dist, P), x, tol); // quantile(cdf) = x
BOOST_CHECK_CLOSE_FRACTION(
- quantile(complement(dist, Q)), x, tol); // quantile(1 - cdf) = x
+ quantile(complement(dist, Q)), x, tol); // quantile(complement(1 - cdf)) = x
}
} // test_spot
@@ -193,7 +191,7 @@
BOOST_CHECK_CLOSE_FRACTION(variance(dist10), static_cast<RealType>(0.0052083333333333333333333333333333333333333333333333L), tol_2eps);
BOOST_CHECK_CLOSE_FRACTION(mode(dist10), static_cast<RealType>(0.08333333333333333333333333333333333333333333333L), tol_2eps);
BOOST_CHECK_CLOSE_FRACTION(median(dist10), static_cast<RealType>(0.10704554778227709530244586234274024205738435512468L), tol_2eps);
- BOOST_CHECK_CLOSE_FRACTION(cdf(dist10, median(dist10)), 0.5L, tol_2eps);
+ BOOST_CHECK_CLOSE_FRACTION(cdf(dist10, median(dist10)), static_cast<RealType>(0.5L), tol_2eps);
BOOST_CHECK_CLOSE_FRACTION(skewness(dist10), static_cast<RealType>(3.4641016151377545870548926830117447338856105076208L), tol_2eps);
BOOST_CHECK_CLOSE_FRACTION(kurtosis(dist10), static_cast<RealType>(45), tol_2eps);
BOOST_CHECK_CLOSE_FRACTION(kurtosis_excess(dist10), static_cast<RealType>(45-3), tol_2eps);
@@ -229,8 +227,8 @@
cdf(inverse_chi_squared_distribution<RealType>(2), static_cast<RealType>(0))
, static_cast<RealType>(0.0f));
BOOST_CHECK_EQUAL(
- cdf(inverse_chi_squared_distribution<RealType>(3), static_cast<RealType>(0))
- , static_cast<RealType>(0.0f));
+ cdf(inverse_chi_squared_distribution<RealType>(3L), static_cast<RealType>(0L))
+ , static_cast<RealType>(0));
BOOST_CHECK_EQUAL(
cdf(complement(inverse_chi_squared_distribution<RealType>(1), static_cast<RealType>(0)))
, static_cast<RealType>(1));
@@ -321,8 +319,8 @@
BOOST_CHECK_EQUAL(ichsqdef.degrees_of_freedom(), 1.); // df == 1
BOOST_CHECK_EQUAL(ichsqdef.scale(), 1); // scale == 1./df
- BOOST_CHECK_CLOSE_FRACTION(pdf(ichsqdef, 1),0.2419707245191433L, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(pdf(ichsqdef, 9),0.013977156581221969L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(pdf(ichsqdef, 1), 0.24197072451914330, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(pdf(ichsqdef, 9), 0.013977156581221969, tol4eps);
inverse_chi_squared_distribution<double> ichisq102(10., 2); // Both parameters specified.
BOOST_CHECK_EQUAL(ichisq102.degrees_of_freedom(), 10.); // Check both parameters stored OK.
@@ -331,10 +329,10 @@
inverse_chi_squared_distribution<double> ichisq10(10.); // Only df parameter specified (unscaled).
BOOST_CHECK_EQUAL(ichisq10.degrees_of_freedom(), 10.); // Check parameter stored.
BOOST_CHECK_EQUAL(ichisq10.scale(), 0.1); // Check default scale = 1/df = 1/10 = 0.1
- BOOST_CHECK_CLOSE_FRACTION(pdf(ichisq10, 1), 0.00078975346316749169L, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(pdf(ichisq10, 10), 0.0000000012385799798186384L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(pdf(ichisq10, 1), 0.00078975346316749169, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(pdf(ichisq10, 10), 0.0000000012385799798186384, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(mode(ichisq10), 0.0833333333333333333333333333333333333333L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(mode(ichisq10), 0.0833333333333333333333333333333333333333, tol4eps);
// nu * xi / nu + 2 = 10 * 0.1 / (10 + 2) = 1/12 = 0.0833333...
// mode is not defined in Mathematica.
// See Discussion section http://en.wikipedia.org/wiki/Talk:Scaled-inverse-chi-square_distribution
@@ -343,21 +341,21 @@
inverse_chi_squared_distribution<double> ichisq5(5.); // // Only df parameter specified.
BOOST_CHECK_EQUAL(ichisq5.degrees_of_freedom(), 5.); // check parameter stored.
BOOST_CHECK_EQUAL(ichisq5.scale(), 1./5.); // check default is 1/df
- BOOST_CHECK_CLOSE_FRACTION(pdf(ichisq5, 0.2), 3.0510380337346841L, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(cdf(ichisq5, 0.5), 0.84914503608460956l, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(cdf(complement(ichisq5, 0.5)), 1 - 0.84914503608460956l, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(pdf(ichisq5, 0.2), 3.0510380337346841, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(cdf(ichisq5, 0.5), 0.84914503608460956, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(cdf(complement(ichisq5, 0.5)), 1 - 0.84914503608460956, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(quantile(ichisq5, 0.84914503608460956L), 0.5, tol4eps*100);
- BOOST_CHECK_CLOSE_FRACTION(quantile(complement(ichisq5, 1. - 0.84914503608460956L)), 0.5, tol4eps*100);
+ BOOST_CHECK_CLOSE_FRACTION(quantile(ichisq5, 0.84914503608460956), 0.5, tol4eps*100);
+ BOOST_CHECK_CLOSE_FRACTION(quantile(complement(ichisq5, 1. - 0.84914503608460956)), 0.5, tol4eps*100);
// Check mean, etc spot values.
inverse_chi_squared_distribution<double> ichisq81(8., 1.); // degrees_of_freedom = 5, scale = 1
- BOOST_CHECK_CLOSE_FRACTION(mean(ichisq81),1.33333333333333333333333333333333333333333L, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(variance(ichisq81), 0.888888888888888888888888888888888888888888888L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(mean(ichisq81),1.33333333333333333333333333333333333333333, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(variance(ichisq81), 0.888888888888888888888888888888888888888888888, tol4eps);
BOOST_CHECK_CLOSE_FRACTION(skewness(ichisq81), 2 * std::sqrt(8.), tol4eps);
inverse_chi_squared_distribution<double> ichisq21(2., 1.);
BOOST_CHECK_CLOSE_FRACTION(mode(ichisq21), 0.5, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(median(ichisq21), 1.4426950408889634L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(median(ichisq21), 1.4426950408889634, tol4eps);
inverse_chi_squared ichsq4(4.); // Using typedef and degrees_of_freedom parameter (and default scale = 1/df).
BOOST_CHECK_EQUAL(ichsq4.degrees_of_freedom(), 4.); // df == 4.
@@ -368,7 +366,7 @@
BOOST_CHECK_EQUAL(ichsq32.scale(), 2); // scale == 2
inverse_chi_squared ichsq11(1, 1); // Using explicit degrees_of_freedom parameter, and default scale = 1).
- BOOST_CHECK_CLOSE_FRACTION(mode(ichsq11), 0.33333333333333333333333333333333333333333L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(mode(ichsq11), 0.3333333333333333333333333333333333333333, tol4eps);
// (1 * 1)/ (1 + 2) = 1/3 using Wikipedia nu * xi /(nu + 2)
BOOST_CHECK_EQUAL(ichsq11.degrees_of_freedom(), 1.); // df == 1 (default).
BOOST_CHECK_EQUAL(ichsq11.scale(), 1.); // scale == 1.
@@ -397,13 +395,13 @@
}
*/
inverse_chi_squared_distribution<> ichisq14(14, 1); // Using default RealType double.
- BOOST_CHECK_CLOSE_FRACTION(mean(ichisq14), 1.166666666666666666666666666666666666666666666L, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(variance(ichisq14), 0.272222222222222222222222222222222222222222222L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(mean(ichisq14), 1.166666666666666666666666666666666666666666666, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(variance(ichisq14), 0.272222222222222222222222222222222222222222222, tol4eps);
inverse_chi_squared_distribution<> ichisq121(12); // Using default RealType double.
- BOOST_CHECK_CLOSE_FRACTION(mean(ichisq121), 0.1L, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(variance(ichisq121), 0.0025L, tol4eps);
- BOOST_CHECK_CLOSE_FRACTION(standard_deviation(ichisq121), 0.05L, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(mean(ichisq121), 0.1, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(variance(ichisq121), 0.0025, tol4eps);
+ BOOST_CHECK_CLOSE_FRACTION(standard_deviation(ichisq121), 0.05, tol4eps);
// and "using boost::math::inverse_chi_squared_distribution;".
inverse_chi_squared_distribution<> ichsq23(2., 3.); // Using default RealType double.
==============================================================================
--- branches/release/libs/math/test/test_inverse_gamma_distribution.cpp (original)
+++ branches/release/libs/math/test/test_inverse_gamma_distribution.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -364,7 +364,9 @@
inverse_gamma_distribution<double> ig102(10., 2.); //
BOOST_CHECK_EQUAL(ig102.shape(), 10.); //
BOOST_CHECK_EQUAL(ig102.scale(), 2.); //
+ // formatC(SuppDists::dinvGauss(10, 1, 0.5), digits=17)[1] "0.0011774669940754754"
BOOST_CHECK_CLOSE_FRACTION(pdf(ig102, 0.5), 0.1058495335284024, tol5eps);
+ // formatC(SuppDists::pinvGauss(10, 1, 0.5), digits=17) [1] "0.99681494462166653"
BOOST_CHECK_CLOSE_FRACTION(cdf(ig102, 0.5), 0.99186775720306608, tol5eps);
BOOST_CHECK_CLOSE_FRACTION(quantile(ig102, 0.05), 0.12734622346137681, tol5eps);
BOOST_CHECK_CLOSE_FRACTION(quantile(ig102, 0.5), 0.20685272858879727, tol5eps);
==============================================================================
--- branches/release/libs/math/test/test_laplace.cpp (original)
+++ branches/release/libs/math/test/test_laplace.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -454,9 +454,16 @@
template <class RealType>
void test_extreme_function_arguments()
{
- boost::math::laplace_distribution<RealType> L1(0, 1);
- boost::math::laplace_distribution<RealType> L2(1, 2);
+ using boost::math::policies::policy;
+ using boost::math::policies::overflow_error;
+ using boost::math::policies::ignore_error;
+
+ typedef policy<
+ overflow_error<ignore_error> // if argument value causes overflow.
+ > ignore_overflow_policy;
+ boost::math::laplace_distribution<RealType, ignore_overflow_policy> L1(0, 1);
+ boost::math::laplace_distribution<RealType, ignore_overflow_policy> L2(1, 2);
// check pdf at x = +/- infinity
BOOST_CHECK_THROW(pdf(L1, +std::numeric_limits<RealType>::infinity()), std::domain_error);
BOOST_CHECK_THROW(pdf(L1, -std::numeric_limits<RealType>::infinity()), std::domain_error);
@@ -469,11 +476,12 @@
BOOST_CHECK_THROW(cdf(L2, +std::numeric_limits<RealType>::infinity()), std::domain_error);
BOOST_CHECK_THROW(cdf(L2, -std::numeric_limits<RealType>::infinity()), std::domain_error);
- // check quantile at p = 0,1
- BOOST_CHECK_EQUAL( quantile(L1, 0), -std::numeric_limits<RealType>::infinity() );
- BOOST_CHECK_EQUAL( quantile(L1, 1), +std::numeric_limits<RealType>::infinity() );
- BOOST_CHECK_EQUAL( quantile(L2, 0), -std::numeric_limits<RealType>::infinity() );
- BOOST_CHECK_EQUAL( quantile(L2, 1), +std::numeric_limits<RealType>::infinity() );
+
+ // check quantile at p = 0, 1 which return infinity.
+ BOOST_CHECK_EQUAL(quantile(L1, 0), -std::numeric_limits<RealType>::infinity() );
+ BOOST_CHECK_EQUAL(quantile(L1, 1), +std::numeric_limits<RealType>::infinity() );
+ BOOST_CHECK_EQUAL(quantile(L2, 0), -std::numeric_limits<RealType>::infinity() );
+ BOOST_CHECK_EQUAL(quantile(L2, 1), +std::numeric_limits<RealType>::infinity() );
}
BOOST_AUTO_TEST_CASE( vs_GNU_Octave )
==============================================================================
--- branches/release/libs/math/test/test_lognormal.cpp (original)
+++ branches/release/libs/math/test/test_lognormal.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -179,7 +179,9 @@
cout << "Tolerance for type " << typeid(RealType).name() << " is " << tolerance << " %" << endl;
lognormal_distribution<RealType> dist(8, 3);
RealType x = static_cast<RealType>(0.125);
- using namespace std; // ADL of std names.
+
+ BOOST_MATH_STD_USING // ADL of std math lib names.
+
// mean:
BOOST_CHECK_CLOSE(
mean(dist)
==============================================================================
--- branches/release/libs/math/test/test_nc_beta.cpp (original)
+++ branches/release/libs/math/test/test_nc_beta.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -7,7 +7,10 @@
// (See accompanying file LICENSE_1_0.txt
// or copy at http://www.boost.org/LICENSE_1_0.txt)
-#include <pch.hpp>
+//
+// This must appear *before* any #includes, and precludes pch usage:
+//
+#define BOOST_MATH_ASSERT_UNDEFINED_POLICY false
#ifdef _MSC_VER
#pragma warning (disable:4127 4512)
@@ -22,7 +25,7 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
#include <boost/math/distributions/non_central_beta.hpp> // for chi_squared_distribution
-#include <boost/math/distributions/poisson.hpp> // for chi_squared_distribution
+#include <boost/math/distributions/poisson.hpp> // for poisson_distribution
#include <boost/test/test_exec_monitor.hpp> // for test_main
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
@@ -216,6 +219,7 @@
RealType tolerance = (std::max)(
boost::math::tools::epsilon<RealType>() * 100,
(RealType)1e-6) * 100;
+ RealType abs_tolerance = boost::math::tools::epsilon<RealType>() * 100;
cout << "Tolerance = " << tolerance << "%." << endl;
@@ -260,6 +264,18 @@
RealType(8.020935), // PDF
RealType(tolerance));
+ BOOST_MATH_STD_USING
+ boost::math::non_central_beta_distribution<RealType> dist(100, 3, 63);
+ BOOST_CHECK_CLOSE(mean(dist), RealType(4.82280451915522329944315287538684030781836554279474240490936e13L) * exp(-RealType(31.5)) * 100 / 103, tolerance);
+ // Variance only guarentees small absolute error:
+ BOOST_CHECK_SMALL(variance(dist)
+ - static_cast<RealType>(RealType(4.85592267707818899235900237275021938334418424134218087127572e13L)
+ * exp(RealType(-31.5)) * 100 * 101 / (103 * 104) -
+ RealType(4.82280451915522329944315287538684030781836554279474240490936e13L) * RealType(4.82280451915522329944315287538684030781836554279474240490936e13L)
+ * exp(RealType(-63)) * 10000 / (103 * 103)), abs_tolerance);
+ BOOST_CHECK_THROW(skewness(dist), boost::math::evaluation_error);
+ BOOST_CHECK_THROW(kurtosis(dist), boost::math::evaluation_error);
+ BOOST_CHECK_THROW(kurtosis_excess(dist), boost::math::evaluation_error);
} // template <class RealType>void test_spots(RealType)
template <class T>
@@ -414,7 +430,7 @@
{
BOOST_MATH_CONTROL_FP;
// Basic sanity-check spot values.
- expected_results();
+ expected_results();
// (Parameter value, arbitrarily zero, only communicates the floating point type).
#ifdef TEST_FLOAT
test_spots(0.0F); // Test float.
==============================================================================
--- branches/release/libs/math/test/test_normal.cpp (original)
+++ branches/release/libs/math/test/test_normal.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -15,7 +15,7 @@
// From MathWorld--A Wolfram Web Resource.
// http://mathworld.wolfram.com/NormalDistribution.html
-#include <pch.hpp> // include directory libs/math/src/tr1/ is needed.
+#include <pch.hpp> // include directory /libs/math/src/tr1/ is needed.
#ifdef _MSC_VER
#pragma warning (disable: 4127) // conditional expression is constant
@@ -214,7 +214,9 @@
RealType tol2 = boost::math::tools::epsilon<RealType>() * 5;
normal_distribution<RealType> dist(8, 3);
RealType x = static_cast<RealType>(0.125);
- using namespace std; // ADL of std names.
+
+ BOOST_MATH_STD_USING // ADL of std math lib names
+
// mean:
BOOST_CHECK_CLOSE(
mean(dist)
==============================================================================
--- branches/release/libs/math/test/test_sign.cpp (original)
+++ branches/release/libs/math/test/test_sign.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -77,6 +77,45 @@
BOOST_CHECK_EQUAL((boost::math::copysign)(c, a), RealType(-1));
}
#endif
+ //
+ // Try some extreme values:
+ //
+ a = boost::math::tools::min_value<RealType>();
+ b = -a;
+ c = -1;
+ BOOST_CHECK((boost::math::signbit)(a) == 0);
+ BOOST_CHECK_EQUAL((boost::math::sign)(a), 1);
+ BOOST_CHECK_EQUAL((boost::math::copysign)(c, a), RealType(1));
+ BOOST_CHECK((boost::math::signbit)(b) != 0);
+ BOOST_CHECK_EQUAL((boost::math::sign)(b), -1);
+ c = 1;
+ BOOST_CHECK_EQUAL((boost::math::copysign)(c, b), RealType(-1));
+ //
+ // try denormalised values:
+ //
+ a /= 4;
+ if(a != 0)
+ {
+ b = -a;
+ c = -1;
+ BOOST_CHECK((boost::math::signbit)(a) == 0);
+ BOOST_CHECK_EQUAL((boost::math::sign)(a), 1);
+ BOOST_CHECK_EQUAL((boost::math::copysign)(c, a), RealType(1));
+ BOOST_CHECK((boost::math::signbit)(b) != 0);
+ BOOST_CHECK_EQUAL((boost::math::sign)(b), -1);
+ c = 1;
+ BOOST_CHECK_EQUAL((boost::math::copysign)(c, b), RealType(-1));
+ }
+ a = boost::math::tools::max_value<RealType>() / 2;
+ b = -a;
+ c = -1;
+ BOOST_CHECK((boost::math::signbit)(a) == 0);
+ BOOST_CHECK_EQUAL((boost::math::sign)(a), 1);
+ BOOST_CHECK_EQUAL((boost::math::copysign)(c, a), RealType(1));
+ BOOST_CHECK((boost::math::signbit)(b) != 0);
+ BOOST_CHECK_EQUAL((boost::math::sign)(b), -1);
+ c = 1;
+ BOOST_CHECK_EQUAL((boost::math::copysign)(c, b), RealType(-1));
}
==============================================================================
--- branches/release/libs/math/test/test_weibull.cpp (original)
+++ branches/release/libs/math/test/test_weibull.cpp 2011-01-08 12:33:06 EST (Sat, 08 Jan 2011)
@@ -254,7 +254,9 @@
cout << "Tolerance for type " << typeid(RealType).name() << " is " << tolerance << " %" << endl;
weibull_distribution<RealType> dist(2, 3);
RealType x = static_cast<RealType>(0.125);
- using namespace std; // ADL of std names.
+
+ BOOST_MATH_STD_USING // ADL of std lib math functions
+
// mean:
BOOST_CHECK_CLOSE(
mean(dist)