From ffb025ca2c9b141fba7c61210fa37ac17025ef73 Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 22 Dec 2016 18:30:27 +0000 Subject: [PATCH 01/71] First very rough prototype of Lambert W function, example of calculating diode current versus voltage, and some tests, including multiprecision and fixed_point types. Not yet using policies and trouble near the singularity at z=-exp(-1) and large z. --- doc/graphs/dist_graphs.cpp | 31 +- doc/graphs/sf_graphs.cpp | 955 +++++++++--------- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 28 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 11 +- doc/html/indexes/s05.html | 55 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/jacobi/jacobi_sn.html | 6 +- doc/html/math_toolkit/navigation.html | 2 +- doc/html/math_toolkit/zetas.html | 6 +- doc/html/special.html | 1 + doc/html/standalone_HTML.manifest | 1 + doc/math.qbk | 10 + doc/sf/lambert_w.qbk | 111 ++ example/lambert_w_diode.cpp | 161 +++ example/lambert_w_diode_graph.cpp | 274 +++++ example/lambert_w_example.cpp | 156 +++ .../math/special_functions/lambert_w.hpp | 354 +++++++ test/test_lambert_w.cpp | 389 +++++++ 21 files changed, 2064 insertions(+), 495 deletions(-) create mode 100644 doc/sf/lambert_w.qbk create mode 100644 example/lambert_w_diode.cpp create mode 100644 example/lambert_w_diode_graph.cpp create mode 100644 example/lambert_w_example.cpp create mode 100644 include/boost/math/special_functions/lambert_w.hpp create mode 100644 test/test_lambert_w.cpp diff --git a/doc/graphs/dist_graphs.cpp b/doc/graphs/dist_graphs.cpp index 515d392ef..b54e18677 100644 --- a/doc/graphs/dist_graphs.cpp +++ b/doc/graphs/dist_graphs.cpp @@ -10,7 +10,7 @@ \author John Maddock and Paul A. Bristow */ // Copyright John Maddock 2008. -// Copyright Paul A. Bristow 2008, 2009, 2012 +// Copyright Paul A. Bristow 2008, 2009, 2012, 2016 // 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) @@ -35,8 +35,9 @@ template struct is_discrete_distribution - : public boost::mpl::false_{}; + : public boost::mpl::false_{}; // Default is continuous distribution. +// Some discrete distributions. template struct is_discrete_distribution > : public boost::mpl::true_{}; @@ -68,7 +69,7 @@ struct value_finder private: Dist m_dist; typename Dist::value_type m_value; -}; +}; // value_finder template class distribution_plotter @@ -177,7 +178,7 @@ public: if(b > m_max_x) m_max_x = b; } - } + } // add void plot(const std::string& title, const std::string& file) { @@ -198,9 +199,12 @@ public: m_max_y = 1; } + std::cout << "Plotting " << title << " to " << file << std::endl; + svg_2d_plot plot; plot.image_x_size(750); plot.image_y_size(400); + plot.copyright_holder("John Maddock").copyright_date("2008").boost_license_on(true); plot.coord_precision(4); // Avoids any visible steps. plot.title_font_size(20); plot.legend_title_font_size(15); @@ -248,19 +252,17 @@ public: if(!is_discrete_distribution::value) { - // // Continuous distribution: - // for(std::list >::const_iterator i = m_distributions.begin(); i != m_distributions.end(); ++i) { double x = m_min_x; - double interval = (m_max_x - m_min_x) / 200; + double continuous_interval = (m_max_x - m_min_x) / 200; std::map data; while(x <= m_max_x) { data[x] = m_pdf ? pdf(i->second, x) : cdf(i->second, x); - x += interval; + x += continuous_interval; } plot.plot(data, i->first) .line_on(true) @@ -275,16 +277,14 @@ public: } else { - // // Discrete distribution: - // double x_width = 0.75 / m_distributions.size(); double x_off = -0.5 * 0.75; for(std::list >::const_iterator i = m_distributions.begin(); i != m_distributions.end(); ++i) { double x = ceil(m_min_x); - double interval = 1; + double discrete_interval = 1; std::map data; while(x <= m_max_x) { @@ -300,7 +300,7 @@ public: data[x + x_off + 0.00001] = p; data[x + x_off + x_width] = p; data[x + x_off + x_width + 0.00001] = 0; - x += interval; + x += discrete_interval; } x_off += x_width; svg_2d_plot_series& s = plot.plot(data, i->first); @@ -312,9 +312,9 @@ public: ++color_index; color_index = color_index % (sizeof(colors)/sizeof(colors[0])); } - } + } // descrete plot.write(file); - } + } // void plot(const std::string& title, const std::string& file) private: bool m_pdf; @@ -326,7 +326,7 @@ int main() { try { - + std::cout << "Distribution Graphs" << std::endl; distribution_plotter > gamma_plotter; gamma_plotter.add(boost::math::gamma_distribution<>(0.75), "shape = 0.75"); @@ -718,5 +718,4 @@ int main() hyperexponential_plotter3.plot("Hyperexponential Distribution PDF (Different Number of Phases, Same Mean)", "hyperexponential_pdf_samemean.svg"); */ - } // int main() diff --git a/doc/graphs/sf_graphs.cpp b/doc/graphs/sf_graphs.cpp index 713665c60..57843cb5c 100644 --- a/doc/graphs/sf_graphs.cpp +++ b/doc/graphs/sf_graphs.cpp @@ -1,4 +1,5 @@ -// (C) Copyright John Maddock 2008. +// Copyright John Maddock 2008. +// Copyright Paul A. Bristow 2016 // 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) @@ -11,6 +12,8 @@ # pragma warning (disable : 4224) // nonstandard extension used : formal parameter 'function_ptr' was previously defined as a type #endif +// #define BOOST_SVG_DIAGNOSTICS // define to provide diagnostic output from plotting. + #include #include #include @@ -27,52 +30,63 @@ class function_arity1_plotter public: function_arity1_plotter() : m_min_x(0), m_max_x(0), m_min_y(0), m_max_y(0), m_has_legend(false) {} - void add(boost::function f, double a, double b, const std::string& name) + //! Add a function to the plotter, compute the axes using range a to b and compute & add data points to map. + + void add(boost::function f, double x_lo, double x_hi, const std::string& name) { + std::cout << "Adding function " << name << ", x range " << x_lo << " to " << x_hi << std::endl; if(name.size()) m_has_legend = true; // // Now set our x-axis limits: - // if(m_max_x == m_min_x) { - m_max_x = b; - m_min_x = a; + m_max_x = x_hi; + m_min_x = x_lo; } else { - if(a < m_min_x) - m_min_x = a; - if(b > m_max_x) - m_max_x = b; + if(x_lo < m_min_x) + m_min_x = x_lo; + if(x_hi > m_max_x) + m_max_x = x_hi; } m_points.push_back(std::pair >(name, std::map())); std::map& points = m_points.rbegin()->second; - double interval = (b - a) / 200; - for(double x = a; x <= b; x += interval) + double interval = (x_hi - x_lo) / 200; + for(double x = x_lo; x <= x_hi; x += interval) { - // - // Evaluate the function, set the Y axis limits - // if needed and then store the pair of points: - // - double y = f(x); + double y = f(x); // Evaluate the function. + // Set the Y axis limits if needed. if((m_min_y == m_max_y) && (m_min_y == 0)) m_min_y = m_max_y = y; if(m_min_y > y) m_min_y = y; if(m_max_y < y) m_max_y = y; - points[x] = y; - } - } + points[x] = y; // Store the pair of points values. + } // for x +#ifdef BOOST_SVG_DIAGNOSTICS + std::cout << "Added function " << name + << ", x range " << x_lo << " to " << x_hi + << ", x min = " << m_min_x << ", x max = " << m_max_x + << ", y min = " << m_min_y << ", y max = " << m_max_y + << ", interval = " << interval + << std::endl; +#endif + } // void add(boost::function f, double a, double b, const std::string& name) + + //! Compute x and y min and max from a map of pre-computed data points. void add(const std::map& m, const std::string& name) { - if(name.size()) - m_has_legend = true; + if (name.size() != 0) + { + m_has_legend = true; + } m_points.push_back(std::pair >(name, m)); - std::map::const_iterator i = m.begin(); + std::map::const_iterator i = m.begin(); while(i != m.end()) { if((m_min_x == m_min_y) && (m_min_y == 0)) @@ -103,16 +117,16 @@ public: ++i; } - } + } // void add(const std::map& m, const std::string& name) + //! Plot pre-computed m_points data for function. void plot(const std::string& title, const std::string& file, - const std::string& x_lable = std::string(), - const std::string& y_lable = std::string()) + const std::string& x_lable = std::string(), const std::string& y_lable = std::string()) { using namespace boost::svg; static const svg_color colors[5] = - { + { // Colors for plot curves, used in turn. darkblue, darkred, darkgreen, @@ -120,6 +134,8 @@ public: chartreuse }; + std::cout << "Plotting Special Function " << title << " to file " << file << std::endl; + svg_2d_plot plot; plot.image_x_size(600); plot.image_y_size(400); @@ -139,7 +155,6 @@ public: plot.y_num_minor_ticks(3); // // Work out axis tick intervals: - // double l = std::floor(std::log10((m_max_x - m_min_x) / 10) + 0.5); double interval = std::pow(10.0, (int)l); if(((m_max_x - m_min_x) / interval) > 10) @@ -156,7 +171,7 @@ public: .legend_border_color(lightslategray) .legend_background_color(white); - int color_index = 0; + int color_index = 0; // Cycle through the colors for each curve. for(std::list > >::const_iterator i = m_points.begin(); i != m_points.end(); ++i) @@ -171,14 +186,14 @@ public: color_index = color_index % (sizeof(colors)/sizeof(colors[0])); } plot.write(file); - } + } // void plot(const std::string& title, const std::string& file, void clear() { m_points.clear(); m_min_x = m_min_y = m_max_x = m_max_y = 0; m_has_legend = false; - } + } // clear private: std::list > > m_points; @@ -241,495 +256,511 @@ double lbeta(double a, double b) int main() { - function_arity1_plotter plot; - double (*f)(double); - double (*f2)(double, double); - double (*f2u)(unsigned, double); - double (*f2i)(int, double); - double (*f3)(double, double, double); - double (*f4)(double, double, double, double); - double max_val; + try + { + function_arity1_plotter plot; - f = boost::math::zeta; - plot.add(f, find_end_point(f, 0.1, 40.0, false, 1.0), 10, ""); - plot.add(f, -20, find_end_point(f, -0.1, -40.0, false, 1.0), ""); - plot.plot("Zeta Function Over [-20,10]", "zeta1.svg", "z", "zeta(z)"); + // Functions may have varying numbers and types of parameters. + // plot.add calls must use the appropriate function type. + // Not all function types may be used, so can ignore any warning like + // "C4101: 'f4': unreferenced local variable" + double(*f)(double); // Simplest function type, suits most functions. + double(*f2)(double, double); + double(*f2u)(unsigned, double); + double(*f2i)(int, double); + double(*f3)(double, double, double); + double(*f4)(double, double, double, double); + double max_val; // Hold evaluated value of function for use in find_end_point. - plot.clear(); - plot.add(f, -14, 0, ""); - plot.plot("Zeta Function Over [-14,0]", "zeta2.svg", "z", "zeta(z)"); + f = boost::math::zeta; + plot.add(f, find_end_point(f, 0.1, 40.0, false, 1.0), 10, ""); + plot.add(f, -20, find_end_point(f, -0.1, -40.0, false, 1.0), ""); + plot.plot("Zeta Function Over [-20,10]", "zeta1.svg", "z", "zeta(z)"); - f = boost::math::tgamma; - max_val = f(6); - plot.clear(); - plot.add(f, find_end_point(f, 0.1, max_val, false), 6, ""); - plot.add(f, find_end_point(f, 0.1, -max_val, true, -1), find_end_point(f, -0.1, -max_val, false), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -2), find_end_point(f, -0.1, max_val, true, -1), ""); - plot.add(f, find_end_point(f, 0.1, -max_val, true, -3), find_end_point(f, -0.1, -max_val, false, -2), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -4), find_end_point(f, -0.1, max_val, true, -3), ""); - plot.plot("tgamma", "tgamma.svg", "z", "tgamma(z)"); + plot.clear(); + plot.add(f, -14, 0, ""); + plot.plot("Zeta Function Over [-14,0]", "zeta2.svg", "z", "zeta(z)"); - f = boost::math::lgamma; - max_val = f(10); - plot.clear(); - plot.add(f, find_end_point(f, 0.1, max_val, false), 10, ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -1), find_end_point(f, -0.1, max_val, true), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -2), find_end_point(f, -0.1, max_val, true, -1), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -3), find_end_point(f, -0.1, max_val, true, -2), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -4), find_end_point(f, -0.1, max_val, true, -3), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -5), find_end_point(f, -0.1, max_val, true, -4), ""); - plot.plot("lgamma", "lgamma.svg", "z", "lgamma(z)"); + f = boost::math::tgamma; + max_val = f(6); + plot.clear(); + plot.add(f, find_end_point(f, 0.1, max_val, false), 6, ""); + plot.add(f, find_end_point(f, 0.1, -max_val, true, -1), find_end_point(f, -0.1, -max_val, false), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -2), find_end_point(f, -0.1, max_val, true, -1), ""); + plot.add(f, find_end_point(f, 0.1, -max_val, true, -3), find_end_point(f, -0.1, -max_val, false, -2), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -4), find_end_point(f, -0.1, max_val, true, -3), ""); + plot.plot("tgamma", "tgamma.svg", "z", "tgamma(z)"); - f = boost::math::digamma; - max_val = 10; - plot.clear(); - plot.add(f, find_end_point(f, 0.1, -max_val, true), 10, ""); - plot.add(f, find_end_point(f, 0.1, -max_val, true, -1), find_end_point(f, -0.1, max_val, true), ""); - plot.add(f, find_end_point(f, 0.1, -max_val, true, -2), find_end_point(f, -0.1, max_val, true, -1), ""); - plot.add(f, find_end_point(f, 0.1, -max_val, true, -3), find_end_point(f, -0.1, max_val, true, -2), ""); - plot.add(f, find_end_point(f, 0.1, -max_val, true, -4), find_end_point(f, -0.1, max_val, true, -3), ""); - plot.plot("digamma", "digamma.svg", "z", "digamma(z)"); + f = boost::math::lgamma; + max_val = f(10); + plot.clear(); + plot.add(f, find_end_point(f, 0.1, max_val, false), 10, ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -1), find_end_point(f, -0.1, max_val, true), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -2), find_end_point(f, -0.1, max_val, true, -1), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -3), find_end_point(f, -0.1, max_val, true, -2), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -4), find_end_point(f, -0.1, max_val, true, -3), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -5), find_end_point(f, -0.1, max_val, true, -4), ""); + plot.plot("lgamma", "lgamma.svg", "z", "lgamma(z)"); - f = boost::math::erf; - plot.clear(); - plot.add(f, -3, 3, ""); - plot.plot("erf", "erf.svg", "z", "erf(z)"); - f = boost::math::erfc; - plot.clear(); - plot.add(f, -3, 3, ""); - plot.plot("erfc", "erfc.svg", "z", "erfc(z)"); + f = boost::math::digamma; + max_val = 10; + plot.clear(); + plot.add(f, find_end_point(f, 0.1, -max_val, true), 10, ""); + plot.add(f, find_end_point(f, 0.1, -max_val, true, -1), find_end_point(f, -0.1, max_val, true), ""); + plot.add(f, find_end_point(f, 0.1, -max_val, true, -2), find_end_point(f, -0.1, max_val, true, -1), ""); + plot.add(f, find_end_point(f, 0.1, -max_val, true, -3), find_end_point(f, -0.1, max_val, true, -2), ""); + plot.add(f, find_end_point(f, 0.1, -max_val, true, -4), find_end_point(f, -0.1, max_val, true, -3), ""); + plot.plot("digamma", "digamma.svg", "z", "digamma(z)"); + - f = boost::math::erf_inv; - plot.clear(); - plot.add(f, find_end_point(f, 0.1, -3, true, -1), find_end_point(f, -0.1, 3, true, 1), ""); - plot.plot("erf_inv", "erf_inv.svg", "z", "erf_inv(z)"); - f = boost::math::erfc_inv; - plot.clear(); - plot.add(f, find_end_point(f, 0.1, 3, false), find_end_point(f, -0.1, -3, false, 2), ""); - plot.plot("erfc_inv", "erfc_inv.svg", "z", "erfc_inv(z)"); + f = boost::math::erf; + plot.clear(); + plot.add(f, -3, 3, "erf"); + plot.plot("erf", "erf.svg", "z", "erf(z)"); - f = boost::math::log1p; - plot.clear(); - plot.add(f, find_end_point(f, 0.1, -10, true, -1), 10, ""); - plot.plot("log1p", "log1p.svg", "z", "log1p(z)"); + f = boost::math::erfc; + plot.clear(); + plot.add(f, -3, 3, "erfc"); + plot.plot("erfc", "erfc.svg", "z", "erfc(z)"); - f = boost::math::expm1; - plot.clear(); - plot.add(f, -4, 2, ""); - plot.plot("expm1", "expm1.svg", "z", "expm1(z)"); + f = boost::math::erf_inv; + plot.clear(); + plot.add(f, find_end_point(f, 0.1, -3, true, -1), find_end_point(f, -0.1, 3, true, 1), ""); + plot.plot("erf_inv", "erf_inv.svg", "z", "erf_inv(z)"); + f = boost::math::erfc_inv; + plot.clear(); + plot.add(f, find_end_point(f, 0.1, 3, false), find_end_point(f, -0.1, -3, false, 2), ""); + plot.plot("erfc_inv", "erfc_inv.svg", "z", "erfc_inv(z)"); - f = boost::math::cbrt; - plot.clear(); - plot.add(f, -10, 10, ""); - plot.plot("cbrt", "cbrt.svg", "z", "cbrt(z)"); + f = boost::math::log1p; + plot.clear(); + plot.add(f, find_end_point(f, 0.1, -10, true, -1), 10, ""); + plot.plot("log1p", "log1p.svg", "z", "log1p(z)"); - f = sqrt1pm1; - plot.clear(); - plot.add(f, find_end_point(f, 0.1, -10, true, -1), 5, ""); - plot.plot("sqrt1pm1", "sqrt1pm1.svg", "z", "sqrt1pm1(z)"); + f = boost::math::expm1; + plot.clear(); + plot.add(f, -4, 2, ""); + plot.plot("expm1", "expm1.svg", "z", "expm1(z)"); - f2 = boost::math::powm1; - plot.clear(); - plot.add(boost::bind(f2, 0.0001, _1), find_end_point(boost::bind(f2, 0.0001, _1), -1, 10, false), 5, "a=0.0001"); - plot.add(boost::bind(f2, 0.001, _1), find_end_point(boost::bind(f2, 0.001, _1), -1, 10, false), 5, "a=0.001"); - plot.add(boost::bind(f2, 0.01, _1), find_end_point(boost::bind(f2, 0.01, _1), -1, 10, false), 5, "a=0.01"); - plot.add(boost::bind(f2, 0.1, _1), find_end_point(boost::bind(f2, 0.1, _1), -1, 10, false), 5, "a=0.1"); - plot.add(boost::bind(f2, 0.75, _1), -5, 5, "a=0.75"); - plot.add(boost::bind(f2, 1.25, _1), -5, 5, "a=1.25"); - plot.plot("powm1", "powm1.svg", "z", "powm1(a, z)"); + f = boost::math::cbrt; + plot.clear(); + plot.add(f, -10, 10, ""); + plot.plot("cbrt", "cbrt.svg", "z", "cbrt(z)"); - f = boost::math::sinc_pi; - plot.clear(); - plot.add(f, -10, 10, ""); - plot.plot("sinc_pi", "sinc_pi.svg", "z", "sinc_pi(z)"); + f = sqrt1pm1; + plot.clear(); + plot.add(f, find_end_point(f, 0.1, -10, true, -1), 5, ""); + plot.plot("sqrt1pm1", "sqrt1pm1.svg", "z", "sqrt1pm1(z)"); - f = boost::math::sinhc_pi; - plot.clear(); - plot.add(f, -5, 5, ""); - plot.plot("sinhc_pi", "sinhc_pi.svg", "z", "sinhc_pi(z)"); + f2 = boost::math::powm1; + plot.clear(); + plot.add(boost::bind(f2, 0.0001, _1), find_end_point(boost::bind(f2, 0.0001, _1), -1, 10, false), 5, "a=0.0001"); + plot.add(boost::bind(f2, 0.001, _1), find_end_point(boost::bind(f2, 0.001, _1), -1, 10, false), 5, "a=0.001"); + plot.add(boost::bind(f2, 0.01, _1), find_end_point(boost::bind(f2, 0.01, _1), -1, 10, false), 5, "a=0.01"); + plot.add(boost::bind(f2, 0.1, _1), find_end_point(boost::bind(f2, 0.1, _1), -1, 10, false), 5, "a=0.1"); + plot.add(boost::bind(f2, 0.75, _1), -5, 5, "a=0.75"); + plot.add(boost::bind(f2, 1.25, _1), -5, 5, "a=1.25"); + plot.plot("powm1", "powm1.svg", "z", "powm1(a, z)"); - f = boost::math::acosh; - plot.clear(); - plot.add(f, 1, 10, ""); - plot.plot("acosh", "acosh.svg", "z", "acosh(z)"); + f = boost::math::sinc_pi; + plot.clear(); + plot.add(f, -10, 10, ""); + plot.plot("sinc_pi", "sinc_pi.svg", "z", "sinc_pi(z)"); - f = boost::math::asinh; - plot.clear(); - plot.add(f, -10, 10, ""); - plot.plot("asinh", "asinh.svg", "z", "asinh(z)"); + f = boost::math::sinhc_pi; + plot.clear(); + plot.add(f, -5, 5, ""); + plot.plot("sinhc_pi", "sinhc_pi.svg", "z", "sinhc_pi(z)"); - f = boost::math::atanh; - plot.clear(); - plot.add(f, find_end_point(f, 0.1, -5, true, -1), find_end_point(f, -0.1, 5, true, 1), ""); - plot.plot("atanh", "atanh.svg", "z", "atanh(z)"); + f = boost::math::acosh; + plot.clear(); + plot.add(f, 1, 10, "acosh"); + plot.plot("acosh", "acosh.svg", "z", "acosh(z)"); - f2 = boost::math::tgamma_delta_ratio; - plot.clear(); - plot.add(boost::bind(f2, _1, -0.5), 1, 40, "delta = -0.5"); - plot.add(boost::bind(f2, _1, -0.2), 1, 40, "delta = -0.2"); - plot.add(boost::bind(f2, _1, -0.1), 1, 40, "delta = -0.1"); - plot.add(boost::bind(f2, _1, 0.1), 1, 40, "delta = 0.1"); - plot.add(boost::bind(f2, _1, 0.2), 1, 40, "delta = 0.2"); - plot.add(boost::bind(f2, _1, 0.5), 1, 40, "delta = 0.5"); - plot.add(boost::bind(f2, _1, 1.0), 1, 40, "delta = 1.0"); - plot.plot("tgamma_delta_ratio", "tgamma_delta_ratio.svg", "z", "tgamma_delta_ratio(delta, z)"); + f = boost::math::asinh; + plot.clear(); + plot.add(f, -10, 10, ""); + plot.plot("asinh", "asinh.svg", "z", "asinh(z)"); - f2 = boost::math::gamma_p; - plot.clear(); - plot.add(boost::bind(f2, 0.5, _1), 0, 20, "a = 0.5"); - plot.add(boost::bind(f2, 1.0, _1), 0, 20, "a = 1.0"); - plot.add(boost::bind(f2, 5.0, _1), 0, 20, "a = 5.0"); - plot.add(boost::bind(f2, 10.0, _1), 0, 20, "a = 10.0"); - plot.plot("gamma_p", "gamma_p.svg", "z", "gamma_p(a, z)"); + f = boost::math::atanh; + plot.clear(); + plot.add(f, find_end_point(f, 0.1, -5, true, -1), find_end_point(f, -0.1, 5, true, 1), ""); + plot.plot("atanh", "atanh.svg", "z", "atanh(z)"); - f2 = boost::math::gamma_q; - plot.clear(); - plot.add(boost::bind(f2, 0.5, _1), 0, 20, "a = 0.5"); - plot.add(boost::bind(f2, 1.0, _1), 0, 20, "a = 1.0"); - plot.add(boost::bind(f2, 5.0, _1), 0, 20, "a = 5.0"); - plot.add(boost::bind(f2, 10.0, _1), 0, 20, "a = 10.0"); - plot.plot("gamma_q", "gamma_q.svg", "z", "gamma_q(a, z)"); + f2 = boost::math::tgamma_delta_ratio; + plot.clear(); + plot.add(boost::bind(f2, _1, -0.5), 1, 40, "delta = -0.5"); + plot.add(boost::bind(f2, _1, -0.2), 1, 40, "delta = -0.2"); + plot.add(boost::bind(f2, _1, -0.1), 1, 40, "delta = -0.1"); + plot.add(boost::bind(f2, _1, 0.1), 1, 40, "delta = 0.1"); + plot.add(boost::bind(f2, _1, 0.2), 1, 40, "delta = 0.2"); + plot.add(boost::bind(f2, _1, 0.5), 1, 40, "delta = 0.5"); + plot.add(boost::bind(f2, _1, 1.0), 1, 40, "delta = 1.0"); + plot.plot("tgamma_delta_ratio", "tgamma_delta_ratio.svg", "z", "tgamma_delta_ratio(delta, z)"); - f2 = lbeta; - plot.clear(); - plot.add(boost::bind(f2, 0.5, _1), 0.00001, 5, "a = 0.5"); - plot.add(boost::bind(f2, 1.0, _1), 0.00001, 5, "a = 1.0"); - plot.add(boost::bind(f2, 5.0, _1), 0.00001, 5, "a = 5.0"); - plot.add(boost::bind(f2, 10.0, _1), 0.00001, 5, "a = 10.0"); - plot.plot("beta", "beta.svg", "z", "log(beta(a, z))"); + f2 = boost::math::gamma_p; + plot.clear(); + plot.add(boost::bind(f2, 0.5, _1), 0, 20, "a = 0.5"); + plot.add(boost::bind(f2, 1.0, _1), 0, 20, "a = 1.0"); + plot.add(boost::bind(f2, 5.0, _1), 0, 20, "a = 5.0"); + plot.add(boost::bind(f2, 10.0, _1), 0, 20, "a = 10.0"); + plot.plot("gamma_p", "gamma_p.svg", "z", "gamma_p(a, z)"); - f = boost::math::expint; - max_val = f(4); - plot.clear(); - plot.add(f, find_end_point(f, 0.1, -max_val, true), 4, ""); - plot.add(f, -3, find_end_point(f, -0.1, -max_val, false), ""); - plot.plot("Exponential Integral Ei", "expint_i.svg", "z", "expint(z)"); + f2 = boost::math::gamma_q; + plot.clear(); + plot.add(boost::bind(f2, 0.5, _1), 0, 20, "a = 0.5"); + plot.add(boost::bind(f2, 1.0, _1), 0, 20, "a = 1.0"); + plot.add(boost::bind(f2, 5.0, _1), 0, 20, "a = 5.0"); + plot.add(boost::bind(f2, 10.0, _1), 0, 20, "a = 10.0"); + plot.plot("gamma_q", "gamma_q.svg", "z", "gamma_q(a, z)"); - f2u = boost::math::expint; - max_val = 1; - plot.clear(); - plot.add(boost::bind(f2u, 1, _1), find_end_point(boost::bind(f2u, 1, _1), 0.1, max_val, false), 2, "n = 1 "); - plot.add(boost::bind(f2u, 2, _1), find_end_point(boost::bind(f2u, 2, _1), 0.1, max_val, false), 2, "n = 2 "); - plot.add(boost::bind(f2u, 3, _1), 0, 2, "n = 3 "); - plot.add(boost::bind(f2u, 4, _1), 0, 2, "n = 4 "); - plot.plot("Exponential Integral En", "expint2.svg", "z", "expint(n, z)"); + f2 = lbeta; + plot.clear(); + plot.add(boost::bind(f2, 0.5, _1), 0.00001, 5, "a = 0.5"); + plot.add(boost::bind(f2, 1.0, _1), 0.00001, 5, "a = 1.0"); + plot.add(boost::bind(f2, 5.0, _1), 0.00001, 5, "a = 5.0"); + plot.add(boost::bind(f2, 10.0, _1), 0.00001, 5, "a = 10.0"); + plot.plot("beta", "beta.svg", "z", "log(beta(a, z))"); - f3 = boost::math::ibeta; - plot.clear(); - plot.add(boost::bind(f3, 9, 1, _1), 0, 1, "a = 9, b = 1"); - plot.add(boost::bind(f3, 7, 2, _1), 0, 1, "a = 7, b = 2"); - plot.add(boost::bind(f3, 5, 5, _1), 0, 1, "a = 5, b = 5"); - plot.add(boost::bind(f3, 2, 7, _1), 0, 1, "a = 2, b = 7"); - plot.add(boost::bind(f3, 1, 9, _1), 0, 1, "a = 1, b = 9"); - plot.plot("ibeta", "ibeta.svg", "z", "ibeta(a, b, z)"); + f = boost::math::expint; + max_val = f(4); + plot.clear(); + plot.add(f, find_end_point(f, 0.1, -max_val, true), 4, ""); + plot.add(f, -3, find_end_point(f, -0.1, -max_val, false), ""); + plot.plot("Exponential Integral Ei", "expint_i.svg", "z", "expint(z)"); - f2i = boost::math::legendre_p; - plot.clear(); - plot.add(boost::bind(f2i, 1, _1), -1, 1, "l = 1"); - plot.add(boost::bind(f2i, 2, _1), -1, 1, "l = 2"); - plot.add(boost::bind(f2i, 3, _1), -1, 1, "l = 3"); - plot.add(boost::bind(f2i, 4, _1), -1, 1, "l = 4"); - plot.add(boost::bind(f2i, 5, _1), -1, 1, "l = 5"); - plot.plot("Legendre Polynomials", "legendre_p.svg", "x", "legendre_p(l, x)"); + f2u = boost::math::expint; + max_val = 1; + plot.clear(); + plot.add(boost::bind(f2u, 1, _1), find_end_point(boost::bind(f2u, 1, _1), 0.1, max_val, false), 2, "n = 1 "); + plot.add(boost::bind(f2u, 2, _1), find_end_point(boost::bind(f2u, 2, _1), 0.1, max_val, false), 2, "n = 2 "); + plot.add(boost::bind(f2u, 3, _1), 0, 2, "n = 3 "); + plot.add(boost::bind(f2u, 4, _1), 0, 2, "n = 4 "); + plot.plot("Exponential Integral En", "expint2.svg", "z", "expint(n, z)"); - f2u = boost::math::legendre_q; - plot.clear(); - plot.add(boost::bind(f2u, 1, _1), -0.95, 0.95, "l = 1"); - plot.add(boost::bind(f2u, 2, _1), -0.95, 0.95, "l = 2"); - plot.add(boost::bind(f2u, 3, _1), -0.95, 0.95, "l = 3"); - plot.add(boost::bind(f2u, 4, _1), -0.95, 0.95, "l = 4"); - plot.add(boost::bind(f2u, 5, _1), -0.95, 0.95, "l = 5"); - plot.plot("Legendre Polynomials of the Second Kind", "legendre_q.svg", "x", "legendre_q(l, x)"); + f3 = boost::math::ibeta; + plot.clear(); + plot.add(boost::bind(f3, 9, 1, _1), 0, 1, "a = 9, b = 1"); + plot.add(boost::bind(f3, 7, 2, _1), 0, 1, "a = 7, b = 2"); + plot.add(boost::bind(f3, 5, 5, _1), 0, 1, "a = 5, b = 5"); + plot.add(boost::bind(f3, 2, 7, _1), 0, 1, "a = 2, b = 7"); + plot.add(boost::bind(f3, 1, 9, _1), 0, 1, "a = 1, b = 9"); + plot.plot("ibeta", "ibeta.svg", "z", "ibeta(a, b, z)"); - f2u = boost::math::laguerre; - plot.clear(); - plot.add(boost::bind(f2u, 0, _1), -5, 10, "n = 0"); - plot.add(boost::bind(f2u, 1, _1), -5, 10, "n = 1"); - plot.add(boost::bind(f2u, 2, _1), - find_end_point(boost::bind(f2u, 2, _1), -2, 20, false), - find_end_point(boost::bind(f2u, 2, _1), 4, 20, true), - "n = 2"); - plot.add(boost::bind(f2u, 3, _1), - find_end_point(boost::bind(f2u, 3, _1), -2, 20, false), - find_end_point(boost::bind(f2u, 3, _1), 1, 20, false, 8), - "n = 3"); - plot.add(boost::bind(f2u, 4, _1), - find_end_point(boost::bind(f2u, 4, _1), -2, 20, false), - find_end_point(boost::bind(f2u, 4, _1), 1, 20, true, 8), - "n = 4"); - plot.add(boost::bind(f2u, 5, _1), - find_end_point(boost::bind(f2u, 5, _1), -2, 20, false), - find_end_point(boost::bind(f2u, 5, _1), 1, 20, true, 8), - "n = 5"); - plot.plot("Laguerre Polynomials", "laguerre.svg", "x", "laguerre(n, x)"); + f2i = boost::math::legendre_p; + plot.clear(); + plot.add(boost::bind(f2i, 1, _1), -1, 1, "l = 1"); + plot.add(boost::bind(f2i, 2, _1), -1, 1, "l = 2"); + plot.add(boost::bind(f2i, 3, _1), -1, 1, "l = 3"); + plot.add(boost::bind(f2i, 4, _1), -1, 1, "l = 4"); + plot.add(boost::bind(f2i, 5, _1), -1, 1, "l = 5"); + plot.plot("Legendre Polynomials", "legendre_p.svg", "x", "legendre_p(l, x)"); - f2u = boost::math::hermite; - plot.clear(); - plot.add(boost::bind(f2u, 0, _1), -1.8, 1.8, "n = 0"); - plot.add(boost::bind(f2u, 1, _1), -1.8, 1.8, "n = 1"); - plot.add(boost::bind(f2u, 2, _1), -1.8, 1.8, "n = 2"); - plot.add(boost::bind(f2u, 3, _1), -1.8, 1.8, "n = 3"); - plot.add(boost::bind(f2u, 4, _1), -1.8, 1.8, "n = 4"); - plot.plot("Hermite Polynomials", "hermite.svg", "x", "hermite(n, x)"); + f2u = boost::math::legendre_q; + plot.clear(); + plot.add(boost::bind(f2u, 1, _1), -0.95, 0.95, "l = 1"); + plot.add(boost::bind(f2u, 2, _1), -0.95, 0.95, "l = 2"); + plot.add(boost::bind(f2u, 3, _1), -0.95, 0.95, "l = 3"); + plot.add(boost::bind(f2u, 4, _1), -0.95, 0.95, "l = 4"); + plot.add(boost::bind(f2u, 5, _1), -0.95, 0.95, "l = 5"); + plot.plot("Legendre Polynomials of the Second Kind", "legendre_q.svg", "x", "legendre_q(l, x)"); - f2 = boost::math::cyl_bessel_j; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -20, 20, "v = 0"); - plot.add(boost::bind(f2, 1, _1), -20, 20, "v = 1"); - plot.add(boost::bind(f2, 2, _1), -20, 20, "v = 2"); - plot.add(boost::bind(f2, 3, _1), -20, 20, "v = 3"); - plot.add(boost::bind(f2, 4, _1), -20, 20, "v = 4"); - plot.plot("Bessel J", "cyl_bessel_j.svg", "x", "cyl_bessel_j(v, x)"); + f2u = boost::math::laguerre; + plot.clear(); + plot.add(boost::bind(f2u, 0, _1), -5, 10, "n = 0"); + plot.add(boost::bind(f2u, 1, _1), -5, 10, "n = 1"); + plot.add(boost::bind(f2u, 2, _1), + find_end_point(boost::bind(f2u, 2, _1), -2, 20, false), + find_end_point(boost::bind(f2u, 2, _1), 4, 20, true), + "n = 2"); + plot.add(boost::bind(f2u, 3, _1), + find_end_point(boost::bind(f2u, 3, _1), -2, 20, false), + find_end_point(boost::bind(f2u, 3, _1), 1, 20, false, 8), + "n = 3"); + plot.add(boost::bind(f2u, 4, _1), + find_end_point(boost::bind(f2u, 4, _1), -2, 20, false), + find_end_point(boost::bind(f2u, 4, _1), 1, 20, true, 8), + "n = 4"); + plot.add(boost::bind(f2u, 5, _1), + find_end_point(boost::bind(f2u, 5, _1), -2, 20, false), + find_end_point(boost::bind(f2u, 5, _1), 1, 20, true, 8), + "n = 5"); + plot.plot("Laguerre Polynomials", "laguerre.svg", "x", "laguerre(n, x)"); - f2 = boost::math::cyl_neumann; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), find_end_point(boost::bind(f2, 0, _1), 0.1, -5, true), 20, "v = 0"); - plot.add(boost::bind(f2, 1, _1), find_end_point(boost::bind(f2, 1, _1), 0.1, -5, true), 20, "v = 1"); - plot.add(boost::bind(f2, 2, _1), find_end_point(boost::bind(f2, 2, _1), 0.1, -5, true), 20, "v = 2"); - plot.add(boost::bind(f2, 3, _1), find_end_point(boost::bind(f2, 3, _1), 0.1, -5, true), 20, "v = 3"); - plot.add(boost::bind(f2, 4, _1), find_end_point(boost::bind(f2, 4, _1), 0.1, -5, true), 20, "v = 4"); - plot.plot("Bessel Y", "cyl_neumann.svg", "x", "cyl_neumann(v, x)"); + f2u = boost::math::hermite; + plot.clear(); + plot.add(boost::bind(f2u, 0, _1), -1.8, 1.8, "n = 0"); + plot.add(boost::bind(f2u, 1, _1), -1.8, 1.8, "n = 1"); + plot.add(boost::bind(f2u, 2, _1), -1.8, 1.8, "n = 2"); + plot.add(boost::bind(f2u, 3, _1), -1.8, 1.8, "n = 3"); + plot.add(boost::bind(f2u, 4, _1), -1.8, 1.8, "n = 4"); + plot.plot("Hermite Polynomials", "hermite.svg", "x", "hermite(n, x)"); - f2 = boost::math::cyl_bessel_i; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), find_end_point(boost::bind(f2, 0, _1), -0.1, 20, false), find_end_point(boost::bind(f2, 0, _1), 0.1, 20, true), "v = 0"); - plot.add(boost::bind(f2, 2, _1), find_end_point(boost::bind(f2, 2, _1), -0.1, 20, false), find_end_point(boost::bind(f2, 2, _1), 0.1, 20, true), "v = 2"); - plot.add(boost::bind(f2, 5, _1), find_end_point(boost::bind(f2, 5, _1), -0.1, -20, true), find_end_point(boost::bind(f2, 5, _1), 0.1, 20, true), "v = 5"); - plot.add(boost::bind(f2, 7, _1), find_end_point(boost::bind(f2, 7, _1), -0.1, -20, true), find_end_point(boost::bind(f2, 7, _1), 0.1, 20, true), "v = 7"); - plot.add(boost::bind(f2, 10, _1), find_end_point(boost::bind(f2, 10, _1), -0.1, 20, false), find_end_point(boost::bind(f2, 10, _1), 0.1, 20, true), "v = 10"); - plot.plot("Bessel I", "cyl_bessel_i.svg", "x", "cyl_bessel_i(v, x)"); + f2 = boost::math::cyl_bessel_j; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -20, 20, "v = 0"); + plot.add(boost::bind(f2, 1, _1), -20, 20, "v = 1"); + plot.add(boost::bind(f2, 2, _1), -20, 20, "v = 2"); + plot.add(boost::bind(f2, 3, _1), -20, 20, "v = 3"); + plot.add(boost::bind(f2, 4, _1), -20, 20, "v = 4"); + plot.plot("Bessel J", "cyl_bessel_j.svg", "x", "cyl_bessel_j(v, x)"); - f2 = boost::math::cyl_bessel_k; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), find_end_point(boost::bind(f2, 0, _1), 0.1, 10, false), 10, "v = 0"); - plot.add(boost::bind(f2, 2, _1), find_end_point(boost::bind(f2, 2, _1), 0.1, 10, false), 10, "v = 2"); - plot.add(boost::bind(f2, 5, _1), find_end_point(boost::bind(f2, 5, _1), 0.1, 10, false), 10, "v = 5"); - plot.add(boost::bind(f2, 7, _1), find_end_point(boost::bind(f2, 7, _1), 0.1, 10, false), 10, "v = 7"); - plot.add(boost::bind(f2, 10, _1), find_end_point(boost::bind(f2, 10, _1), 0.1, 10, false), 10, "v = 10"); - plot.plot("Bessel K", "cyl_bessel_k.svg", "x", "cyl_bessel_k(v, x)"); + f2 = boost::math::cyl_neumann; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), find_end_point(boost::bind(f2, 0, _1), 0.1, -5, true), 20, "v = 0"); + plot.add(boost::bind(f2, 1, _1), find_end_point(boost::bind(f2, 1, _1), 0.1, -5, true), 20, "v = 1"); + plot.add(boost::bind(f2, 2, _1), find_end_point(boost::bind(f2, 2, _1), 0.1, -5, true), 20, "v = 2"); + plot.add(boost::bind(f2, 3, _1), find_end_point(boost::bind(f2, 3, _1), 0.1, -5, true), 20, "v = 3"); + plot.add(boost::bind(f2, 4, _1), find_end_point(boost::bind(f2, 4, _1), 0.1, -5, true), 20, "v = 4"); + plot.plot("Bessel Y", "cyl_neumann.svg", "x", "cyl_neumann(v, x)"); - f2u = boost::math::sph_bessel; - plot.clear(); - plot.add(boost::bind(f2u, 0, _1), 0, 20, "v = 0"); - plot.add(boost::bind(f2u, 2, _1), 0, 20, "v = 2"); - plot.add(boost::bind(f2u, 5, _1), 0, 20, "v = 5"); - plot.add(boost::bind(f2u, 7, _1), 0, 20, "v = 7"); - plot.add(boost::bind(f2u, 10, _1), 0, 20, "v = 10"); - plot.plot("Bessel j", "sph_bessel.svg", "x", "sph_bessel(v, x)"); + f2 = boost::math::cyl_bessel_i; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), find_end_point(boost::bind(f2, 0, _1), -0.1, 20, false), find_end_point(boost::bind(f2, 0, _1), 0.1, 20, true), "v = 0"); + plot.add(boost::bind(f2, 2, _1), find_end_point(boost::bind(f2, 2, _1), -0.1, 20, false), find_end_point(boost::bind(f2, 2, _1), 0.1, 20, true), "v = 2"); + plot.add(boost::bind(f2, 5, _1), find_end_point(boost::bind(f2, 5, _1), -0.1, -20, true), find_end_point(boost::bind(f2, 5, _1), 0.1, 20, true), "v = 5"); + plot.add(boost::bind(f2, 7, _1), find_end_point(boost::bind(f2, 7, _1), -0.1, -20, true), find_end_point(boost::bind(f2, 7, _1), 0.1, 20, true), "v = 7"); + plot.add(boost::bind(f2, 10, _1), find_end_point(boost::bind(f2, 10, _1), -0.1, 20, false), find_end_point(boost::bind(f2, 10, _1), 0.1, 20, true), "v = 10"); + plot.plot("Bessel I", "cyl_bessel_i.svg", "x", "cyl_bessel_i(v, x)"); - f2u = boost::math::sph_neumann; - plot.clear(); - plot.add(boost::bind(f2u, 0, _1), find_end_point(boost::bind(f2u, 0, _1), 0.1, -5, true), 20, "v = 0"); - plot.add(boost::bind(f2u, 2, _1), find_end_point(boost::bind(f2u, 2, _1), 0.1, -5, true), 20, "v = 2"); - plot.add(boost::bind(f2u, 5, _1), find_end_point(boost::bind(f2u, 5, _1), 0.1, -5, true), 20, "v = 5"); - plot.add(boost::bind(f2u, 7, _1), find_end_point(boost::bind(f2u, 7, _1), 0.1, -5, true), 20, "v = 7"); - plot.add(boost::bind(f2u, 10, _1), find_end_point(boost::bind(f2u, 10, _1), 0.1, -5, true), 20, "v = 10"); - plot.plot("Bessel y", "sph_neumann.svg", "x", "sph_neumann(v, x)"); + f2 = boost::math::cyl_bessel_k; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), find_end_point(boost::bind(f2, 0, _1), 0.1, 10, false), 10, "v = 0"); + plot.add(boost::bind(f2, 2, _1), find_end_point(boost::bind(f2, 2, _1), 0.1, 10, false), 10, "v = 2"); + plot.add(boost::bind(f2, 5, _1), find_end_point(boost::bind(f2, 5, _1), 0.1, 10, false), 10, "v = 5"); + plot.add(boost::bind(f2, 7, _1), find_end_point(boost::bind(f2, 7, _1), 0.1, 10, false), 10, "v = 7"); + plot.add(boost::bind(f2, 10, _1), find_end_point(boost::bind(f2, 10, _1), 0.1, 10, false), 10, "v = 10"); + plot.plot("Bessel K", "cyl_bessel_k.svg", "x", "cyl_bessel_k(v, x)"); - f4 = boost::math::ellint_rj; - plot.clear(); - plot.add(boost::bind(f4, _1, _1, _1, _1), find_end_point(boost::bind(f4, _1, _1, _1, _1), 0.1, 10, false), 4, "RJ"); - f3 = boost::math::ellint_rf; - plot.add(boost::bind(f3, _1, _1, _1), find_end_point(boost::bind(f3, _1, _1, _1), 0.1, 10, false), 4, "RF"); - plot.plot("Elliptic Integrals", "ellint_carlson.svg", "x", ""); + f2u = boost::math::sph_bessel; + plot.clear(); + plot.add(boost::bind(f2u, 0, _1), 0, 20, "v = 0"); + plot.add(boost::bind(f2u, 2, _1), 0, 20, "v = 2"); + plot.add(boost::bind(f2u, 5, _1), 0, 20, "v = 5"); + plot.add(boost::bind(f2u, 7, _1), 0, 20, "v = 7"); + plot.add(boost::bind(f2u, 10, _1), 0, 20, "v = 10"); + plot.plot("Bessel j", "sph_bessel.svg", "x", "sph_bessel(v, x)"); - f2 = boost::math::ellint_1; - plot.clear(); - plot.add(boost::bind(f2, _1, 0.5), -0.9, 0.9, "φ=0.5"); - plot.add(boost::bind(f2, _1, 0.75), -0.9, 0.9, "φ=0.75"); - plot.add(boost::bind(f2, _1, 1.25), -0.9, 0.9, "φ=1.25"); - plot.add(boost::bind(f2, _1, boost::math::constants::pi() / 2), -0.9, 0.9, "φ=π/2"); - plot.plot("Elliptic Of the First Kind", "ellint_1.svg", "k", "ellint_1(k, phi)"); + f2u = boost::math::sph_neumann; + plot.clear(); + plot.add(boost::bind(f2u, 0, _1), find_end_point(boost::bind(f2u, 0, _1), 0.1, -5, true), 20, "v = 0"); + plot.add(boost::bind(f2u, 2, _1), find_end_point(boost::bind(f2u, 2, _1), 0.1, -5, true), 20, "v = 2"); + plot.add(boost::bind(f2u, 5, _1), find_end_point(boost::bind(f2u, 5, _1), 0.1, -5, true), 20, "v = 5"); + plot.add(boost::bind(f2u, 7, _1), find_end_point(boost::bind(f2u, 7, _1), 0.1, -5, true), 20, "v = 7"); + plot.add(boost::bind(f2u, 10, _1), find_end_point(boost::bind(f2u, 10, _1), 0.1, -5, true), 20, "v = 10"); + plot.plot("Bessel y", "sph_neumann.svg", "x", "sph_neumann(v, x)"); - f2 = boost::math::ellint_2; - plot.clear(); - plot.add(boost::bind(f2, _1, 0.5), -1, 1, "φ=0.5"); - plot.add(boost::bind(f2, _1, 0.75), -1, 1, "φ=0.75"); - plot.add(boost::bind(f2, _1, 1.25), -1, 1, "φ=1.25"); - plot.add(boost::bind(f2, _1, boost::math::constants::pi() / 2), -1, 1, "φ=π/2"); - plot.plot("Elliptic Of the Second Kind", "ellint_2.svg", "k", "ellint_2(k, phi)"); + f4 = boost::math::ellint_rj; + plot.clear(); + plot.add(boost::bind(f4, _1, _1, _1, _1), find_end_point(boost::bind(f4, _1, _1, _1, _1), 0.1, 10, false), 4, "RJ"); + f3 = boost::math::ellint_rf; + plot.add(boost::bind(f3, _1, _1, _1), find_end_point(boost::bind(f3, _1, _1, _1), 0.1, 10, false), 4, "RF"); + plot.plot("Elliptic Integrals", "ellint_carlson.svg", "x", ""); - f3 = boost::math::ellint_3; - plot.clear(); - plot.add(boost::bind(f3, _1, 0, 1.25), -1, 1, "n=0 φ=1.25"); - plot.add(boost::bind(f3, _1, 0.5, 1.25), -1, 1, "n=0.5 φ=1.25"); - plot.add(boost::bind(f3, _1, 0.25, boost::math::constants::pi() / 2), - find_end_point( - boost::bind(f3, _1, 0.25, boost::math::constants::pi() / 2), - 0.5, 4, false, -1), - find_end_point( - boost::bind(f3, _1, 0.25, boost::math::constants::pi() / 2), - -0.5, 4, true, 1), "n=0.25 φ=π/2"); - plot.add(boost::bind(f3, _1, 0.75, boost::math::constants::pi() / 2), - find_end_point( - boost::bind(f3, _1, 0.75, boost::math::constants::pi() / 2), - 0.5, 4, false, -1), - find_end_point( - boost::bind(f3, _1, 0.75, boost::math::constants::pi() / 2), - -0.5, 4, true, 1), "n=0.75 φ=π/2"); - plot.plot("Elliptic Of the Third Kind", "ellint_3.svg", "k", "ellint_3(k, n, phi)"); + f2 = boost::math::ellint_1; + plot.clear(); + plot.add(boost::bind(f2, _1, 0.5), -0.9, 0.9, "φ=0.5"); + plot.add(boost::bind(f2, _1, 0.75), -0.9, 0.9, "φ=0.75"); + plot.add(boost::bind(f2, _1, 1.25), -0.9, 0.9, "φ=1.25"); + plot.add(boost::bind(f2, _1, boost::math::constants::pi() / 2), -0.9, 0.9, "φ=π/2"); + plot.plot("Elliptic Of the First Kind", "ellint_1.svg", "k", "ellint_1(k, phi)"); - f2 = boost::math::jacobi_sn; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); - plot.plot("Jacobi Elliptic sn", "jacobi_sn.svg", "k", "jacobi_sn(k, u)"); + f2 = boost::math::ellint_2; + plot.clear(); + plot.add(boost::bind(f2, _1, 0.5), -1, 1, "φ=0.5"); + plot.add(boost::bind(f2, _1, 0.75), -1, 1, "φ=0.75"); + plot.add(boost::bind(f2, _1, 1.25), -1, 1, "φ=1.25"); + plot.add(boost::bind(f2, _1, boost::math::constants::pi() / 2), -1, 1, "φ=π/2"); + plot.plot("Elliptic Of the Second Kind", "ellint_2.svg", "k", "ellint_2(k, phi)"); - f2 = boost::math::jacobi_cn; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); - plot.plot("Jacobi Elliptic cn", "jacobi_cn.svg", "k", "jacobi_cn(k, u)"); + f3 = boost::math::ellint_3; + plot.clear(); + plot.add(boost::bind(f3, _1, 0, 1.25), -1, 1, "n=0 φ=1.25"); + plot.add(boost::bind(f3, _1, 0.5, 1.25), -1, 1, "n=0.5 φ=1.25"); + plot.add(boost::bind(f3, _1, 0.25, boost::math::constants::pi() / 2), + find_end_point( + boost::bind(f3, _1, 0.25, boost::math::constants::pi() / 2), + 0.5, 4, false, -1), + find_end_point( + boost::bind(f3, _1, 0.25, boost::math::constants::pi() / 2), + -0.5, 4, true, 1), "n=0.25 φ=π/2"); + plot.add(boost::bind(f3, _1, 0.75, boost::math::constants::pi() / 2), + find_end_point( + boost::bind(f3, _1, 0.75, boost::math::constants::pi() / 2), + 0.5, 4, false, -1), + find_end_point( + boost::bind(f3, _1, 0.75, boost::math::constants::pi() / 2), + -0.5, 4, true, 1), "n=0.75 φ=π/2"); + plot.plot("Elliptic Of the Third Kind", "ellint_3.svg", "k", "ellint_3(k, n, phi)"); - f2 = boost::math::jacobi_dn; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); - plot.plot("Jacobi Elliptic dn", "jacobi_dn.svg", "k", "jacobi_dn(k, u)"); + f2 = boost::math::jacobi_sn; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); + plot.plot("Jacobi Elliptic sn", "jacobi_sn.svg", "k", "jacobi_sn(k, u)"); - f2 = boost::math::jacobi_cd; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); - plot.plot("Jacobi Elliptic cd", "jacobi_cd.svg", "k", "jacobi_cd(k, u)"); + f2 = boost::math::jacobi_cn; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); + plot.plot("Jacobi Elliptic cn", "jacobi_cn.svg", "k", "jacobi_cn(k, u)"); - f2 = boost::math::jacobi_cs; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), 0.1, 3, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), 0.1, 3, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), 0.1, 3, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), 0.1, 3, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), 0.1, 3, "k=1"); - plot.plot("Jacobi Elliptic cs", "jacobi_cs.svg", "k", "jacobi_cs(k, u)"); + f2 = boost::math::jacobi_dn; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); + plot.plot("Jacobi Elliptic dn", "jacobi_dn.svg", "k", "jacobi_dn(k, u)"); - f2 = boost::math::jacobi_dc; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); - plot.plot("Jacobi Elliptic dc", "jacobi_dc.svg", "k", "jacobi_dc(k, u)"); + f2 = boost::math::jacobi_cd; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); + plot.plot("Jacobi Elliptic cd", "jacobi_cd.svg", "k", "jacobi_cd(k, u)"); - f2 = boost::math::jacobi_ds; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), 0.1, 3, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), 0.1, 3, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), 0.1, 3, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), 0.1, 3, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), 0.1, 3, "k=1"); - plot.plot("Jacobi Elliptic ds", "jacobi_ds.svg", "k", "jacobi_ds(k, u)"); + f2 = boost::math::jacobi_cs; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), 0.1, 3, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), 0.1, 3, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), 0.1, 3, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), 0.1, 3, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), 0.1, 3, "k=1"); + plot.plot("Jacobi Elliptic cs", "jacobi_cs.svg", "k", "jacobi_cs(k, u)"); - f2 = boost::math::jacobi_nc; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -5, 5, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -5, 5, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -5, 5, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -5, 5, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -5, 5, "k=1"); - plot.plot("Jacobi Elliptic nc", "jacobi_nc.svg", "k", "jacobi_nc(k, u)"); + f2 = boost::math::jacobi_dc; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -10, 10, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -10, 10, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -10, 10, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -10, 10, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -10, 10, "k=1"); + plot.plot("Jacobi Elliptic dc", "jacobi_dc.svg", "k", "jacobi_dc(k, u)"); - f2 = boost::math::jacobi_ns; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), 0.1, 4, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), 0.1, 4, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), 0.1, 4, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), 0.1, 4, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), 0.1, 4, "k=1"); - plot.plot("Jacobi Elliptic ns", "jacobi_ns.svg", "k", "jacobi_ns(k, u)"); + f2 = boost::math::jacobi_ds; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), 0.1, 3, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), 0.1, 3, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), 0.1, 3, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), 0.1, 3, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), 0.1, 3, "k=1"); + plot.plot("Jacobi Elliptic ds", "jacobi_ds.svg", "k", "jacobi_ds(k, u)"); - f2 = boost::math::jacobi_nd; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -2, 2, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -2, 2, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -2, 2, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -2, 2, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -2, 2, "k=1"); - plot.plot("Jacobi Elliptic nd", "jacobi_nd.svg", "k", "jacobi_nd(k, u)"); + f2 = boost::math::jacobi_nc; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -5, 5, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -5, 5, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -5, 5, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -5, 5, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -5, 5, "k=1"); + plot.plot("Jacobi Elliptic nc", "jacobi_nc.svg", "k", "jacobi_nc(k, u)"); - f2 = boost::math::jacobi_sc; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -5, 5, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -5, 5, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -5, 5, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -5, 5, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -5, 5, "k=1"); - plot.plot("Jacobi Elliptic sc", "jacobi_sc.svg", "k", "jacobi_sc(k, u)"); + f2 = boost::math::jacobi_ns; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), 0.1, 4, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), 0.1, 4, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), 0.1, 4, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), 0.1, 4, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), 0.1, 4, "k=1"); + plot.plot("Jacobi Elliptic ns", "jacobi_ns.svg", "k", "jacobi_ns(k, u)"); - f2 = boost::math::jacobi_sd; - plot.clear(); - plot.add(boost::bind(f2, 0, _1), -2.5, 2.5, "k=0"); - plot.add(boost::bind(f2, 0.5, _1), -2.5, 2.5, "k=0.5"); - plot.add(boost::bind(f2, 0.75, _1), -2.5, 2.5, "k=0.75"); - plot.add(boost::bind(f2, 0.95, _1), -2.5, 2.5, "k=0.95"); - plot.add(boost::bind(f2, 1, _1), -2.5, 2.5, "k=1"); - plot.plot("Jacobi Elliptic sd", "jacobi_sd.svg", "k", "jacobi_sd(k, u)"); + f2 = boost::math::jacobi_nd; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -2, 2, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -2, 2, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -2, 2, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -2, 2, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -2, 2, "k=1"); + plot.plot("Jacobi Elliptic nd", "jacobi_nd.svg", "k", "jacobi_nd(k, u)"); - f = boost::math::airy_ai; - plot.clear(); - plot.add(f, -20, 20, ""); - plot.plot("Ai", "airy_ai.svg", "z", "airy_ai(z)"); + f2 = boost::math::jacobi_sc; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -5, 5, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -5, 5, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -5, 5, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -5, 5, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -5, 5, "k=1"); + plot.plot("Jacobi Elliptic sc", "jacobi_sc.svg", "k", "jacobi_sc(k, u)"); - f = boost::math::airy_bi; - plot.clear(); - plot.add(f, -20, 3, ""); - plot.plot("Bi", "airy_bi.svg", "z", "airy_bi(z)"); + f2 = boost::math::jacobi_sd; + plot.clear(); + plot.add(boost::bind(f2, 0, _1), -2.5, 2.5, "k=0"); + plot.add(boost::bind(f2, 0.5, _1), -2.5, 2.5, "k=0.5"); + plot.add(boost::bind(f2, 0.75, _1), -2.5, 2.5, "k=0.75"); + plot.add(boost::bind(f2, 0.95, _1), -2.5, 2.5, "k=0.95"); + plot.add(boost::bind(f2, 1, _1), -2.5, 2.5, "k=1"); + plot.plot("Jacobi Elliptic sd", "jacobi_sd.svg", "k", "jacobi_sd(k, u)"); - f = boost::math::airy_ai_prime; - plot.clear(); - plot.add(f, -20, 20, ""); - plot.plot("Ai'", "airy_aip.svg", "z", "airy_ai_prime(z)"); + f = boost::math::airy_ai; + plot.clear(); + plot.add(f, -20, 20, ""); + plot.plot("Ai", "airy_ai.svg", "z", "airy_ai(z)"); - f = boost::math::airy_bi_prime; - plot.clear(); - plot.add(f, -20, 3, ""); - plot.plot("Bi'", "airy_bip.svg", "z", "airy_bi_prime(z)"); + f = boost::math::airy_bi; + plot.clear(); + plot.add(f, -20, 3, ""); + plot.plot("Bi", "airy_bi.svg", "z", "airy_bi(z)"); - f = boost::math::trigamma; - max_val = 30; - plot.clear(); - plot.add(f, find_end_point(f, 0.1, max_val, false), 5, ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -1), find_end_point(f, -0.1, max_val, true), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -2), find_end_point(f, -0.1, max_val, true, -1), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -3), find_end_point(f, -0.1, max_val, true, -2), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -4), find_end_point(f, -0.1, max_val, true, -3), ""); - plot.add(f, find_end_point(f, 0.1, max_val, false, -5), find_end_point(f, -0.1, max_val, true, -4), ""); - plot.plot("Trigamma", "trigamma.svg", "x", "trigamma(x)"); + f = boost::math::airy_ai_prime; + plot.clear(); + plot.add(f, -20, 20, ""); + plot.plot("Ai'", "airy_aip.svg", "z", "airy_ai_prime(z)"); - f2i = boost::math::polygamma; - max_val = -50; - plot.clear(); - plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true), 5, ""); - plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -1), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true), ""); - plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -2), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -1), ""); - plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -3), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -2), ""); - plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -4), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -3), ""); - plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -5), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -4), ""); - plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -6), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -5), ""); - plot.plot("Polygamma", "polygamma2.svg", "x", "polygamma(2, x)"); + f = boost::math::airy_bi_prime; + plot.clear(); + plot.add(f, -20, 3, ""); + plot.plot("Bi'", "airy_bip.svg", "z", "airy_bi_prime(z)"); - max_val = 800; - plot.clear(); - plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false), 5, ""); - plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -1), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true), ""); - plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -2), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -1), ""); - plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -3), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -2), ""); - plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -4), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -3), ""); - plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -5), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -4), ""); - plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -6), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -5), ""); - plot.plot("Polygamma", "polygamma3.svg", "x", "polygamma(3, x)"); + f = boost::math::trigamma; + max_val = 30; + plot.clear(); + plot.add(f, find_end_point(f, 0.1, max_val, false), 5, ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -1), find_end_point(f, -0.1, max_val, true), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -2), find_end_point(f, -0.1, max_val, true, -1), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -3), find_end_point(f, -0.1, max_val, true, -2), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -4), find_end_point(f, -0.1, max_val, true, -3), ""); + plot.add(f, find_end_point(f, 0.1, max_val, false, -5), find_end_point(f, -0.1, max_val, true, -4), ""); + plot.plot("Trigamma", "trigamma.svg", "x", "trigamma(x)"); + + f2i = boost::math::polygamma; + max_val = -50; + plot.clear(); + plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true), 5, ""); + plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -1), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true), ""); + plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -2), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -1), ""); + plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -3), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -2), ""); + plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -4), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -3), ""); + plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -5), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -4), ""); + plot.add(boost::bind(f2i, 2, _1), find_end_point(boost::bind(f2i, 2, _1), 0.1, max_val, true, -6), find_end_point(boost::bind(f2i, 2, _1), -0.1, -max_val, true, -5), ""); + plot.plot("Polygamma", "polygamma2.svg", "x", "polygamma(2, x)"); + + max_val = 800; + plot.clear(); + plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false), 5, ""); + plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -1), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true), ""); + plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -2), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -1), ""); + plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -3), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -2), ""); + plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -4), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -3), ""); + plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -5), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -4), ""); + plot.add(boost::bind(f2i, 3, _1), find_end_point(boost::bind(f2i, 3, _1), 0.1, max_val, false, -6), find_end_point(boost::bind(f2i, 3, _1), -0.1, max_val, true, -5), ""); + plot.plot("Polygamma", "polygamma3.svg", "x", "polygamma(3, x)"); + + + } + catch (const std::exception& ex) + { + std::cout << ex.what() << std::endl; + } return 0; } diff --git a/doc/html/index.html b/doc/html/index.html index 2c5dbd78f..14f4446f8 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -116,7 +116,7 @@ This manual is also available in -

Last revised: November 03, 2016 at 19:22:00 GMT

+

Last revised: December 06, 2016 at 18:29:35 GMT

diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 120d6928e..5de76a5f5 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,8 +24,8 @@

-Function Index

-

2 4 A B C D E F G H I J K L M N O P Q R S T U V X Y Z

+Function Index
+

2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

2 @@ -118,6 +118,14 @@
  • +

    alpha

    +
    +
    • +

  • area

    A B C D E F G H I L M N O P Q R S T U W

    diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 99010d101..ee8a36605 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

    -Typedef Index

    +Typedef Index

    A B C D E F G H I L N O P R S T U V W

    diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 49fcb0e12..3c84cd7b3 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

    -Macro Index

    +Macro Index

    B F

    @@ -175,6 +175,15 @@
  • +

    BOOST_MATH_INSTRUMENT

    +
    +
    • +

  • BOOST_MATH_INSTRUMENT_CODE

    • diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index aba1c4bbb..3bef0cf97 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

    -Index

    +Index

    2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

    @@ -140,6 +140,7 @@

  • Jacobi Zeta Function

  • Known Issues, and TODO List

  • Laguerre (and Associated) Polynomials

    • +

  • Lambert W function

  • Laplace Distribution

  • Legendre (and Associated) Polynomials

  • Locating Function Minima using Brent's algorithm

    • @@ -295,6 +296,14 @@
  • +

    alpha

    +
    +
    • +

  • arcsine

    • @@ -519,6 +528,7 @@
  • +

    F Distribution Examples

    +
    +
    • +

  • Facets for Floating-Point Infinities and NaNs

    • +

      W

      +
      +
      • +

    • weibull

      • diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index 644118503..b173038d7 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

    - +

    This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/jacobi/jacobi_sn.html b/doc/html/math_toolkit/jacobi/jacobi_sn.html index 973873a25..c5adebe54 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_sn.html +++ b/doc/html/math_toolkit/jacobi/jacobi_sn.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@

    -PrevUpHomeNext +PrevUpHomeNext

    @@ -76,7 +76,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 3dd2ea2cd..1d05e79b0 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

    - +

    Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/zetas.html b/doc/html/math_toolkit/zetas.html index 461025c64..1fb9ad997 100644 --- a/doc/html/math_toolkit/zetas.html +++ b/doc/html/math_toolkit/zetas.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@

    -PrevUpHomeNext +PrevUpHomeNext

    @@ -41,7 +41,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/special.html b/doc/html/special.html index fdd3842c5..12107a00b 100644 --- a/doc/html/special.html +++ b/doc/html/special.html @@ -156,6 +156,7 @@
    Jacobi Elliptic Function sn
    +
    Lambert W function
    Zeta Functions
    Riemann Zeta Function
    Exponential Integrals
    diff --git a/doc/html/standalone_HTML.manifest b/doc/html/standalone_HTML.manifest index 319e71a2f..2126dbac8 100644 --- a/doc/html/standalone_HTML.manifest +++ b/doc/html/standalone_HTML.manifest @@ -221,6 +221,7 @@ math_toolkit/jacobi/jacobi_ns.html math_toolkit/jacobi/jacobi_sc.html math_toolkit/jacobi/jacobi_sd.html math_toolkit/jacobi/jacobi_sn.html +math_toolkit/lambert_w.html math_toolkit/zetas.html math_toolkit/zetas/zeta.html math_toolkit/expint.html diff --git a/doc/math.qbk b/doc/math.qbk index 2f4ceab3b..4ed25a536 100644 --- a/doc/math.qbk +++ b/doc/math.qbk @@ -216,6 +216,9 @@ and use the function's name as the link text.] [def __sph_hankel_1 [link math_toolkit.hankel.sph_hankel sph_hankel_1]] [def __sph_hankel_2 [link math_toolkit.hankel.sph_hankel sph_hankel_2]] +[/Lambert W function] +[def __lambert_w [link math_toolkit.sf_lambert_w.lambert_w_function lambert_w]] + [/Airy Functions] [def __airy_ai [link math_toolkit.airy.ai airy_ai]] [def __airy_bi [link math_toolkit.airy.bi airy_bi]] @@ -429,6 +432,10 @@ and use the function's name as the link text.] [def __random_variable [@http://en.wikipedia.org/wiki/Random_variable random variable]] [def __probability_distribution [@http://en.wikipedia.org/wiki/Probability_distribution probability_distribution]] [def __C_math [@http://www.cplusplus.com/reference/cmath/ C math functions]] +[def __Lambert_W [@http://en.wikipedia.org/wiki/Lambert_W_function Lambert W function]] +[def __CUDA [@https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html#c-cplusplus-language-support CUDA NVidia GPU C/C++ language support]] +[def __Luu_thesis [@http://discovery.ucl.ac.uk/1482128/1/Luu_thesis.pdf Thomas Luu, Thesis, University College London (2015)]] + [/ Some composite templates] [template super[x]''''''[x]''''''] @@ -592,6 +599,9 @@ and as a CD ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22. [include sf/jacobi_elliptic.qbk] +[/ Lambert W function] +[include sf/lambert_w.qbk] + [section:zetas Zeta Functions] [include sf/zeta.qbk] [endsect] diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk new file mode 100644 index 000000000..a96138696 --- /dev/null +++ b/doc/sf/lambert_w.qbk @@ -0,0 +1,111 @@ +[section:lambert_w Lambert W function] + +[h4:synopsis Synopsis] + +`` +#include +`` + namespace boost { namespace math { + + template + ``__sf_result`` lambert_w(T x); + + template + ``__sf_result`` lambert_w(T x, const ``__Policy``&); + + } // namespace boost + } // namespace math + +[h4:description Description] + +The __Lambert_W is the solution of the equation `W e[super W] = x`. + +On the x-interval \[0, [inf]\] there is just one real solution. +On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W-1, Wp, Wm, +only one, the so-called principal branch w0, Wp, is provided by this implementation. + +The function is described in Wolfram Mathworld [@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function] ], +and the principal value of the Lambert W-function is implemented in the Wolfram Language as ProductLog[z]. + +__WolframAlpha has provided some reference values for testing. +For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651. + +Also using the [@https://www.wolframalpha.com Wolfram language], [^N\[ProductLog\[-1\], 50] produces the same output. + +The final __Policy 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 __policy_section for more details. + +[h4:examples Examples] + +[import ../../example/lambert_w_example.cpp] + +[lambert_w_example_1] + +[lambert_w_output_1] + +The source of this example is at [@../../example/lambert_w_example.cpp lambert_w_example.cpp] + +[h4:accuracy Accuracy] + +All the functions usually return values within one ULP (unit in the last place) for the floating-point type. +Values of x close to the boundary of real values at `x ~= -exp(-1))`, +about -0.367879 may be less accurate as they near the boundary. + +[h4:implemention Implementation] + +This real-only implementation is based on an algorithm by__Luu_thesis, +(see routine 11 on page 98 for his Lambert W algorithm). + +This implementation is based on Thomas Luu's code posted at +[@https://svn.boost.org/trac/boost/ticket/11027 Boost Trac \#11027]. + +It has been implemented from Luu's algorithm but templated on RealType parameter and result +and handles both __fundamental (float, double, long double), __multiprecision, +and also has been tested with the proposed fixed_point type. + +The Lambert W has also been discussed in a [@http://lists.boost.org/Archives/boost/2016/09/230819.php Boost thread]. +This also gives link to a prototype version by which also handles complex results [^(x < -exp(-1)], about -0.367879). + +[@https://github.com/CzB404/lambert_w/ Balazs Cziraki 2016] +Physicist, PhD student at Eotvos Lorand University, ELTE TTK Institute of Physics, Budapest. +has also produces a prototype C++ library that can compute the Lambert W function for floating point +[*and complex number types]. +This is not implemented here but might be completed in the future. + +The implementation details are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] + +[h4:references References] + +# NIST Digital Library of Mathematical Functions. [@http://dlmf.nist.gov/4.13.F1]. + +# [@http://www.orcca.on.ca/LambertW/ Lambert W Poster], +R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffery and D. E. Knuth, +On the Lambert W function Advances in Computational Mathematics, Vol 5, (1996) pp 329-359. + +Initial guesses based on: + +# D.A. Barry, J.-Y. Parlange, L. Li, H. Prommer, C.J. Cunningham, and +F. Stagnitti. Analytical approximations for real values of the Lambert +W-function. Mathematics and Computers in Simulation, 53(1):95-103, 2000. + +# D.A. Barry, J.-Y. Parlange, L. Li, H. Prommer, C.J. Cunningham, and +F. Stagnitti. Erratum to analytical approximations for real values of the +Lambert W-function. Mathematics and Computers in Simulation, 59(6):543-543, 2002. + +# C++ __CUDA version of Luu algorithm, [@https://github.com/thomasluu/plog/blob/master/plog.cu plog]. + +# __Luu_thesis, see routine 11, page 98 for Lambert W algorithm. + +# Having Fun with Lambert W(x) Function, Darko Veberic +University of Nova Gorica, Slovenia IK, Forschungszentrum Karlsruhe, Germany, J. Stefan Institute, Ljubljana, Slovenia. + +[endsect] [/section:lambert_w Lambert W function] + +[/ + Copyright 2016 John Maddock, Paul A. Bristow, Thomas Luu. + 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). +] diff --git a/example/lambert_w_diode.cpp b/example/lambert_w_diode.cpp new file mode 100644 index 000000000..6a06663ba --- /dev/null +++ b/example/lambert_w_diode.cpp @@ -0,0 +1,161 @@ +// Copyright Paul A. Bristow 2016 +// Copyright John Z. Maddock 2016 + +// 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). + +/*! brief Example of using Lambert W function to compute current through a diode connected transistor with preset series resistance. + \details T. C. Banwell and A. Jayakumar, + Exact analytical solution of current flow through diode with series resistance, + Electron Letters, 36(4):291-2 (2000) + DOI: dx.doi.org/10.1049/el:20000301 + + The current through a diode connected NPN bipolar junction transistor (BJT) + type 2N2222 (See https://en.wikipedia.org/wiki/2N2222 and + https://www.fairchildsemi.com/datasheets/PN/PN2222.pdf Datasheet) + was measured, for a voltage between 0.3 to 1 volt, see Fig 2 for a log plot, showing a knee visible at about 0.6 V. + + The transistor parameter isat was estimated to be 25 fA and the ideality factor = 1.0. + The intrinsic emitter resistance re was estimated from the rsat = 0 data to be 0.3 ohm. + + The solid curves in Figure 2 are calculated using equation 5 with rsat included with re. + + http://www3.imperial.ac.uk/pls/portallive/docs/1/7292572.PDF + + +*/ + +#include +using boost::math::productlog; + +#include +// using std::cout; +// using std::endl; +#include +#include +#include +#include +#include + + +/*! +Compute thermal voltage as a function of temperature, +about 25 mV at room temperature. +https://en.wikipedia.org/wiki/Boltzmann_constant#Role_in_semiconductor_physics:_the_thermal_voltage + +\param temperature Temperature (degrees centigrade). +*/ +const double v_thermal(double temperature) +{ + constexpr const double boltzmann_k = 1.38e-23; // joules/kelvin. + const double charge_q = 1.6021766208e-19; // Charge of an electron (columb). + double temp =+ 273; // Degrees C to K. + return boltzmann_k * temp / charge_q; +} // v_thermal + +/*! +Banwell & Jayakumar, equation 2 +*/ +double i(double isat, double vd, double vt, double nu) +{ + double i = isat * (exp(vd / (nu * vt)) - 1); + return i; +} // + +/*! + +Banwell & Jayakumar, Equation 4. +i current flow = isat +v voltage source. +isat reverse saturation current in equation 4. +(might implement equation 4 instead of simpler equation 5?). +vd voltage drop = v - i* rs (equation 1). +vt thermal voltage, 0.0257025 = 25 mV. +nu junction ideality factor (default = unity), also known as the emission coefficient. +re intrinsic emitter resistance, estimated to be 0.3 ohm from low current. +rsat reverse saturation current + +\param v Voltage V to compute current I(V). +\param vt Thermal voltage, for example 0.0257025 = 25 mV, computed from boltzmann_k * temp / charge_q; +\param rsat Resistance in series with the diode. +\param re Instrinsic emitter resistance (estimated to be 0.3 ohm from the Rs = 0 data) +\param isat Reverse saturation current (See equation 2). +\param nu Ideality factor (default = unity). + +\returns I amp as function of V volt. + +*/ +double iv(double v, double vt, double rsat, double re, double isat, double nu = 1.) +{ + // V thermal 0.0257025 = 25 mV + // was double i = (nu * vt/r) * productlog((i0 * r) / (nu * vt)); equ 5. + + rsat = rsat + re; + double i = nu * vt / rsat; + std::cout << "nu * vt / rsat = " << i << std::endl; // 0.000103223 + + double x = isat * rsat / (nu * vt); + std::cout << "isat * rsat / (nu * vt) = " << x << std::endl; + + double eterm = (v + isat * rsat) / (nu * vt); + std::cout << "(v + isat * rsat) / (nu * vt) = " << eterm << std::endl; + + double e = exp(eterm); + std::cout << "exp(eterm) = " << e << std::endl; + + double w0 = productlog(x * e); + std::cout << "w0 = " << w0 << std::endl; + return i * w0 - isat; + +} // double iv + +std::array rss = {0., 2.18, 10., 51., 249}; // series resistance (ohm). +std::array vds = { 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9 }; // Diode voltage. + +int main() +{ + try + { + std::cout << "Lambert W diode current example." << std::endl; + + //[lambert_w_diode_example_1 + double x = 0.01; + //std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.00990147 + + double nu = 1.0; // Assumed ideal. + double vt = v_thermal(25); // v thermal, Shockley equation, expect about 25 mV at room temperature. + double boltzmann_k = 1.38e-23; // joules/kelvin + double temp = 273 + 25; + double charge_q = 1.6e-19; // column + vt = boltzmann_k * temp / charge_q; + std::cout << "V thermal " << vt << std::endl; // V thermal 0.0257025 = 25 mV + double rsat = 0.; + double isat = 25.e-15; // 25 fA; + std::cout << "Isat = " << isat << std::endl; + + double re = 0.3; // Estimated from slope of straight section of graph (equation 6). + + double v = 0.9; + double icalc = iv(v, vt, 249., re, isat); + + std::cout << "voltage = " << v << ", current = " << icalc << ", " << log(icalc) << std::endl; // voltage = 0.9, current = 0.00108485, -6.82631 + + //] [/lambert_w_diode_example_1] + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } + + +} // int main() + + /* + + //[lambert_w_output_1 + Output: + + + //] [/lambert_w_output_1] + */ diff --git a/example/lambert_w_diode_graph.cpp b/example/lambert_w_diode_graph.cpp new file mode 100644 index 000000000..e75ab70cb --- /dev/null +++ b/example/lambert_w_diode_graph.cpp @@ -0,0 +1,274 @@ +// Copyright Paul A. Bristow 2016 +// Copyright John Z. Maddock 2016 + +// 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). + +/*! \brief Graph of using Lambert W function to compute current +through a diode-connected transistor with preset series resistance. +\details T. C. Banwell and A. Jayakumar, +Exact analytical solution of current flow through diode with series resistance, +Electron Letters, 36(4):291-2 (2000) +DOI: dx.doi.org/10.1049/el:20000301 + +The current through a diode connected NPN bipolar junction transistor (BJT) +type 2N2222 (See https://en.wikipedia.org/wiki/2N2222 and +https://www.fairchildsemi.com/datasheets/PN/PN2222.pdf Datasheet) +was measured, for a voltage between 0.3 to 1 volt, see Fig 2 for a log plot, showing a knee visible at about 0.6 V. + +The transistor parameter I sat was estimated to be 25 fA and the ideality factor = 1.0. +The intrinsic emitter resistance re was estimated from the rsat = 0 data to be 0.3 ohm. + +The solid curves in Figure 2 are calculated using equation 5 with rsat included with re. + +http://www3.imperial.ac.uk/pls/portallive/docs/1/7292572.PDF + + +*/ + +#include +using boost::math::productlog; +#include +using boost::math::isfinite; + +#include +using namespace boost::svg; + + +#include +// using std::cout; +// using std::endl; +#include +#include +#include +#include +#include +#include +using std::pair; +#include +using std::map; +#include +using std::multiset; +#include +using std::numeric_limits; + +#include + using boost::math::isfinite; + + +/*! +Compute thermal voltage as a function of temperature, +about 25 mV at room temperature. +https://en.wikipedia.org/wiki/Boltzmann_constant#Role_in_semiconductor_physics:_the_thermal_voltage + +\param temperature Temperature (degrees centigrade). +*/ +const double v_thermal(double temperature) +{ + constexpr const double boltzmann_k = 1.38e-23; // joules/kelvin. + const double charge_q = 1.6021766208e-19; // Charge of an electron (columb). + double temp = +273; // Degrees C to K. + return boltzmann_k * temp / charge_q; +} // v_thermal + + /*! + Banwell & Jayakumar, equation 2 + */ +double i(double isat, double vd, double vt, double nu) +{ + double i = isat * (exp(vd / (nu * vt)) - 1); + return i; +} // + + /*! + + Banwell & Jayakumar, Equation 4. + i current flow = isat + v voltage source. + isat reverse saturation current in equation 4. + (might implement equation 4 instead of simpler equation 5?). + vd voltage drop = v - i* rs (equation 1). + vt thermal voltage, 0.0257025 = 25 mV. + nu junction ideality factor (default = unity), also known as the emission coefficient. + re intrinsic emitter resistance, estimated to be 0.3 ohm from low current. + rsat reverse saturation current + + \param v Voltage V to compute current I(V). + \param vt Thermal voltage, for example 0.0257025 = 25 mV, computed from boltzmann_k * temp / charge_q; + \param rsat Resistance in series with the diode. + \param re Instrinsic emitter resistance (estimated to be 0.3 ohm from the Rs = 0 data) + \param isat Reverse saturation current (See equation 2). + \param nu Ideality factor (default = unity). + + \returns I amp as function of V volt. + + */ +double iv(double v, double vt, double rsat, double re, double isat, double nu = 1.) +{ + // V thermal 0.0257025 = 25 mV + // was double i = (nu * vt/r) * productlog((i0 * r) / (nu * vt)); equ 5. + + rsat = rsat + re; + double i = nu * vt / rsat; + // std::cout << "nu * vt / rsat = " << i << std::endl; // 0.000103223 + + double x = isat * rsat / (nu * vt); +// std::cout << "isat * rsat / (nu * vt) = " << x << std::endl; + + double eterm = (v + isat * rsat) / (nu * vt); + // std::cout << "(v + isat * rsat) / (nu * vt) = " << eterm << std::endl; + + double e = exp(eterm); +// std::cout << "exp(eterm) = " << e << std::endl; + + double w0 = productlog(x * e); +// std::cout << "w0 = " << w0 << std::endl; + return i * w0 - isat; + +} // double iv + +std::array rss = { 0., 2.18, 10., 51., 249 }; // series resistance (ohm). +std::array vds = { 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9 }; // Diode voltage. +std::array lni = { -19.65, -15.75, -11.86, -7.97, -4.08, -0.0195, 3.6 }; // ln(current). + +int main() +{ + try + { + std::cout << "Lambert W diode current example." << std::endl; + + //[lambert_w_diode_graph_1 + + double nu = 1.0; // Assumed ideal. + double vt = v_thermal(25); // v thermal, Shockley equation, expect about 25 mV at room temperature. + double boltzmann_k = 1.38e-23; // joules/kelvin + double temp = 273 + 25; + double charge_q = 1.6e-19; // column + vt = boltzmann_k * temp / charge_q; + std::cout << "V thermal " << vt << std::endl; // V thermal 0.0257025 = 25 mV + double rsat = 0.; + double isat = 25.e-15; // 25 fA; + std::cout << "Isat = " << isat << std::endl; + + double re = 0.3; // Estimated from slope of straight section of graph (equation 6). + + double v = 0.9; + double icalc = iv(v, vt, 249., re, isat); + + std::cout << "voltage = " << v << ", current = " << icalc << ", " << log(icalc) << std::endl; // voltage = 0.9, current = 0.00108485, -6.82631 + + //] [/lambert_w_diode_graph_1] + + + // plot a few measured data points. + std::map zero_data; // rss[0] // Zero series resistor. + + //zero_data[0.3] = -19.65; + //zero_data[0.4] = -15.75; + //zero_data[0.5] = -11.86; + //zero_data[0.6] = -7.97; + //zero_data[0.7] = -4.08; + //zero_data[0.8] = -0.0195; + //zero_data[0.9] = 3.9; + + double step = 0.1; + + for (int i = 0; i < vds.size(); i++) + { + zero_data[vds[i]] = lni[i]; + std::cout << lni[i] << " " << vds[i] << std::endl; + } + + /* + */ + step = 0.01; + + std::map data_2; + + for (double v = 0.3; v < 1.; v += step) + { + double current = iv(v, vt, 2., re, isat); + data_2[v] = log(current); + + // std::cout << "v " << v << ", current = " << current << " log current = " << log(current) << std::endl; + } + + std::map data_10; + for (double v = 0.3; v < 1.; v += step) + { + double current = iv(v, vt, 10., re, isat); + data_10[v] = log(current); + // std::cout << "v " << v << ", current = " << current << " log current = " << log(current) << std::endl; + } + std::map data_51; + for (double v = 0.3; v < 1.; v += step) + { + double current = iv(v, vt, 51., re, isat); + data_51[v] = log(current); + // std::cout << "v " << v << ", current = " << current << " log current = " << log(current) << std::endl; + } + + + std::map data_249; + for (double v = 0.3; v < 1.; v += step) + { + double current = iv(v, vt, 249., re, isat); + data_249[v] = log(current); + // std::cout << "v " << v << ", current = " << current << " log current = " << log(current) << std::endl; + } + + svg_2d_plot data_plot; + + data_plot.title("Diode current versus voltage") + .x_size(400) + .y_size(300) + //.legend_on(false) + .x_label("voltage (V)") + .y_label("log(current)") + //.x_label_on(true) + //.y_label_on(true) + //.xy_values_on(false) + .x_range(0.25, 1.) + .y_range(-20., +4.) + .x_major_interval(0.1) + .y_major_interval(4) + .x_major_grid_on(true) + .y_major_grid_on(true) + //.x_values_on(true) + //.y_values_on(true) + .y_values_rotation(horizontal) + //.plot_window_on(true) + .x_values_precision(4) + .y_values_precision(5) + .copyright_holder("Paul A. Bristow") + .copyright_date("2016") + //.background_border_color(black); + ; + + data_plot.plot(zero_data, "Rs=0").fill_color(black).shape(square).size(3).line_on(true).line_width(1); + data_plot.plot(data_2, "Rs=2").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.plot(data_10, "Rs=10").line_color(purple).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.plot(data_51, "Rs=51").line_color(green).shape(none).line_on(true).line_width(1); + data_plot.plot(data_249, "Rs=249").line_color(red).shape(none).line_on(true).line_width(0.5); + data_plot.write("./diode_IV_plot"); + + // bezier_on(true); + + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } + + +} // int main() + + /* + + //[lambert_w_output_1 + Output: + + + //] [/lambert_w_output_1] + */ diff --git a/example/lambert_w_example.cpp b/example/lambert_w_example.cpp new file mode 100644 index 000000000..a41ee9ae0 --- /dev/null +++ b/example/lambert_w_example.cpp @@ -0,0 +1,156 @@ +// Copyright Paul A. Bristow 2016. + +// 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). + +// Test that can build and run a simple example of Lambert W function, +// using algorithm of Thomas Luu. +// https://svn.boost.org/trac/boost/ticket/11027 + +#include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ... +#include // for BOOST_MSVC versions. +#include +#include // boost::exception + +#include + +#include +// using std::cout; +// using std::endl; +#include +#include +#include + +int main() +{ + try + { + std::cout << "Lambert W example basic!" << std::endl; + + std::cout << "Platform: " << BOOST_PLATFORM << '\n' // Win32 + << "Compiler: " << BOOST_COMPILER << '\n' + << "STL : " << BOOST_STDLIB << '\n' + << "Boost : " << BOOST_VERSION / 100000 << "." + << BOOST_VERSION / 100 % 1000 << "." + << BOOST_VERSION % 100 + << std::endl; + +#ifdef _MSC_VER // Microsoft specific tests. + std::cout << "_MSC_FULL_VER = " << _MSC_FULL_VER << std::endl; // VS 2015 190023026 +#ifdef _WIN32 + std::cout << "Win32" << std::endl; +#endif + +#ifdef _WIN64 + std::cout << "x64" << std::endl; +#endif + +#endif // _MSC_VER + +// Not sure if these are Microsoft Specific? +#if defined _M_IX86 + std::cout << "(x86)" << std::endl; +#endif +#if defined _M_X64 + std::cout << " (x64)" << std::endl; +#endif +#if defined _M_IA64 + std::cout << " (Itanium)" << std::endl; +#endif + // Something very wrong if more than one is defined (so show them in all just in case)! + + //std::cout << exp(1) << std::endl; // 2.71828 + //std::cout << exp(-1) << std::endl; // 0.367879 + //std::cout << std::numeric_limits::epsilon() / 2 << std::endl; // 1.11022e-16 + + using namespace boost::math; + double x = 1.; + + double W1 = productlog(1.); + // Note, NOT integer X, for example: productlog(1); or will get message like + // error C2338: Must be floating-point, not integer type, for example W(1.), not W(1)! + // + + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.567143 + // This 'golden ratio' for exponentials is http://mathworld.wolfram.com/OmegaConstant.html + // since exp[-W(1)] = W(1) + // A030178 Decimal expansion of LambertW(1): the solution to x*exp(x) + // = 0.5671432904097838729999686622103555497538157871865125081351310792230457930866 + // http://oeis.org/A030178 + + double expplogone = exp(-productlog(1.)); + if (expplogone != W1) + { + std::cout << expplogone << " " << W1 << std::endl; // + } + +//[lambert_w_example_1 + x = 0.01; + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.00990147 +//] [/lambert_w_example_1] + x = -0.01; + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -0.0101015 + x = -0.1; + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // + x = -0.367879; // Near -exp(1) = -0.367879 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -0.998452 + // N[productlog(-0.367879), 50] = -0.99845210378072725931829498030640227316856835774851 + //x = -0.36788; // < -exp(1) = -0.367879 + //std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -nan(ind) + + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } + + +} // int main() + + /* + +//[lambert_w_output_1 + Output: + + 1> example_basic.cpp +1> Generating code +1> All 237 functions were compiled because no usable IPDB/IOBJ from previous compilation was found. +1> Finished generating code +1> LambertW.vcxproj -> J:\Cpp\Misc\x64\Release\LambertW.exe +1> LambertW.vcxproj -> J:\Cpp\Misc\x64\Release\LambertW.pdb (Full PDB) +1> Lambert W example basic! +1> Platform: Win32 +1> Compiler: Microsoft Visual C++ version 14.0 +1> STL : Dinkumware standard library version 650 +1> Boost : 1.63.0 +1> _MSC_FULL_VER = 190024123 +1> Win32 +1> x64 +1> (x64) +1> Iteration #0, w0 0.577547206058041, w1 = 0.567143616915443, difference = 0.0289944962755619, relative 0.018343835374856 +1> Iteration #1, w0 0.567143616915443, w1 = 0.567143290409784, difference = 9.02208135089566e-07, relative 5.75702234328901e-07 +1> Final 0.567143290409784 after 2 iterations, difference = 0 +1> Iteration #0, w0 0.577547206058041, w1 = 0.567143616915443, difference = 0.0289944962755619, relative 0.018343835374856 +1> Iteration #1, w0 0.567143616915443, w1 = 0.567143290409784, difference = 9.02208135089566e-07, relative 5.75702234328901e-07 +1> Final 0.567143290409784 after 2 iterations, difference = 0 +1> Lambert W (1) = 0.567143290409784 +1> Iteration #0, w0 0.577547206058041, w1 = 0.567143616915443, difference = 0.0289944962755619, relative 0.018343835374856 +1> Iteration #1, w0 0.567143616915443, w1 = 0.567143290409784, difference = 9.02208135089566e-07, relative 5.75702234328901e-07 +1> Final 0.567143290409784 after 2 iterations, difference = 0 +1> Iteration #0, w0 0.0099072820916067, w1 = 0.00990147384359511, difference = 5.92416060777624e-06, relative 0.000586604388734591 +1> Final 0.00990147384359511 after 1 iterations, difference = 0 +1> Lambert W (0.01) = 0.00990147384359511 +1> Iteration #0, w0 -0.0101016472705154, w1 = -0.0101015271985388, difference = -1.17664437923951e-07, relative 1.18865171889748e-05 +1> Final -0.0101015271985388 after 1 iterations, difference = 0 +1> Lambert W (-0.01) = -0.0101015271985388 +1> Iteration #0, w0 -0.111843322610692, w1 = -0.111832559158964, difference = -8.54817065376601e-06, relative 9.62461362694622e-05 +1> Iteration #1, w0 -0.111832559158964, w1 = -0.111832559158963, difference = -5.68989300120393e-16, relative 6.43929354282591e-15 +1> Final -0.111832559158963 after 2 iterations, difference = 0 +1> Lambert W (-0.1) = -0.111832559158963 +1> Iteration #0, w0 -0.998452103785573, w1 = -0.998452103780803, difference = -2.72004641033163e-15, relative 4.77662354114727e-12 +1> Final -0.998452103780803 after 1 iterations, difference = 0 +1> Lambert W (-0.367879) = -0.998452103780803 + +//] [/lambert_w_output_1] + */ diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp new file mode 100644 index 000000000..cda6b4374 --- /dev/null +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -0,0 +1,354 @@ +// Copyright Thomas Luu, 2014 +// Copyright Paul A. Bristow 2016 + +// 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). + +// Computation of the Lambert W function using the algorithm from +// Thomas Luu, UCL Department of Mathematics, PhD Thesis, (2016) +// Fast and Accurate Parallel Computation of Quantile Functions for Random Number Generation, +// page 96 - 98, text and Routine 11. + +// This implementation of the algorithm computes W(x) when x is any C++ real type, +// including Boost.Multiprecision types, and also the prototype Boost.Fixed_point types. + +// This version only handles real values of W(x) when x > -1/e (x > -0.367879...), +// and just returns NaN for x < -1/e. + +// Initial guesses based on : +// D.A.Barry, J., Y.Parlange, L.Li, H.Prommer, C.J.Cunningham, and F.Stagnitti. +// Analytical approximations for real values of the Lambert W function. +// Mathematics and Computers in Simulation, 53(1) : 95 - 103, 2000. + +// D.A.Barry, J., Y.Parlange, L.Li, H.Prommer, C.J.Cunningham, and F.Stagnitti. +// Erratum to analytical approximations for real values of the Lambert W function. +// Mathematics and computers in simulation, 59(6) : 543 - 543, 2002. + +// See also https://svn.boost.org/trac/boost/ticket/11027 +// and discussions at http://lists.boost.org/Archives/boost/2016/09/230832.php +// This code gives identical values as https://github.com/thomasluu/plog +// https://github.com/thomasluu/plog/blob/master/plog.cu +// for type double. + +//#define BOOST_MATH_INSTRUMENT // #define for diagnostic output. + +#include +#include +#include +#include +#include + +#include // fixed_point + +#define NEWTON + +#ifdef BOOST_MATH_INSTRUMENT +# include // Only for testing. +#endif +#include // numeric_limits Inf Nan ... +#include // exp +#include // is_integral + + +// Define a temporary constant for exp(-1) for use in checks at the singularity. +namespace boost +{ namespace math + { + namespace constants + { // constant exp(-1) = 0.367879441 is where x = -exp(-1) is a singularity. + BOOST_DEFINE_MATH_CONSTANT(expminusone, 3.67879441171442321595523770161460867e-01, "0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527"); + } + } +} + + +namespace boost { + namespace fixed_point { + + //! \brief Specialization for log1p for fixed_point. + + /*! \details This simple (and fast) approximation gives a result within a few epsilon/ULP of the nearest representable value. + This makes it suitable for use as a first approximation by the Lambert W function below. + It only uses (and thus relies on for accuracy of) the standard log function. + Refinement of the Lambert W estimate using Halley's method + seems to get quickly to high accuracy in a very few iterations, + so that small inaccuracy in the 1st appproximation are unimportant. + It avoid any Taylor series refinements that involve high powers of x + that would easily go outside the often limited range of fixed_point types. + */ + + template + negatable + log1p(negatable x) + { + // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c + // HP - 15C Advanced Functions Handbook, p.193. + + typedef negatable local_negatable_type; + + local_negatable_type unity(1); + // A fixed_point type night not include unity. Does something sensible happen? + local_negatable_type u = unity + x; + if (u == unity) + { // + return x; + } + else + { + local_negatable_type result = log(u) * (x / (u - unity)); +#ifdef BOOST_MATH_INSTRUMENT + std::cout << "log1p fp approx " << result << std::endl; +#endif + // For example: x = 0.5, HP 0.78843689, diff -1.52587891e-05 + return result; + } // if else + } // log1p_fp + + } //namespace fixed_point +} // namespace boost + + +namespace local +{ + // log1p_dodgy version seems to work OK, but... + /* J M cautions that "The formula relies on: + + 1) That the operations are not re-ordered. + + 2) That each operation is correctly rounded. + Is true only for floating-point arithmetic unless you compile with + special flags to force full-IEEE compatible mode, + but that slows the whole program down... + Not a concern for fixed-point? + + 3) That compiler optimisations don't perform symbolic math on the expressions and simplify them." + */ + +template +T log1p_dodgy(T x) +{ + // log(1+x) == (log(1+x) * x) / ((1-x) - 1) + T result = -(log(1 + x) * x) / ((1 - x) - 1); // From note in Boost.Math log1p + + // \boost\libs\math\include\boost\math\special_functions\log1p.hpp + // Algorithm log1p is part of C99, but is not yet provided by many compilers. + // + // The Boost.Math version uses a Taylor series expansion for 0.5 > x > epsilon, which may + // require up to std::numeric_limits::digits+1 terms to be calculated. + // It would be much more efficient to use the equivalence: + // log(1+x) == (log(1+x) * x) / ((1-x) - 1) + // Unfortunately many optimizing compilers make such a mess of this, that + // it performs no better than log(1+x): which is to say not very well at all. + + return result; +} // template T log1p(T x) + +template +T log1p(T x) +{ + //! \brief log1p function. + //! This is probably faster than using boost::math::log1p (if a little less accurate) + //! and should be good enough for computing initial estimate. + //! \details Formula from a Note in + // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c + // HP - 15C Advanced Functions Handbook, p.193. + // Assuming log() returns an accurate answer, + // the following algorithm can be used to compute log1p(x) to within a few ULP : + // u = 1 + x; + // if (u == 1) return x + // else return log(u)*(x/(u-1.)); + // This implementation is template of type T + + // log(u) * (x / (u - unity)); + + // http://thepeg.hepforge.org/svn/tags/RELEASE_1_0/ThePEG/Utilities/Math.icc + // double log1m(double x) { return log1p(-x);} + // + + // It might be possible to use Newton or Halley's method to refine this approximation? + // But improvement may not be useful for estimating the Lambert W value because it is close enough + // for the Halley's method to converge just as well as with a better initial estimate. + + T unity; + unity = static_cast(1); + T u = unity + x; + if (u == unity) + { + return x; + } + else + { + T result = log(u) * (x / (u - unity)); + //T dodgy = log1p_dodgy(x); + double dx = static_cast(x); + double lp1x = log1p(dx); +#ifdef BOOST_MATH_INSTRUMENT + std::cout << "true " << lp1x + << ", log1p_fp " << log1p(x) + //<< ", dodgy " << dodgy << ", HP " << result + //<< ", diff " << dodgy - result << "epsilons = " << (dodgy - result)/std::numeric_limits::epsilon() + << std::endl; + // For example: x = 0.5, dodgy 0.788421631, HP 0.78843689, diff -1.52587891e-05 +#endif + + return result; + } +} // template T log1p(T x) + +} // namespace local + +namespace boost +{ + namespace math + { + //! \brief Lambert W function. + //! \details Based on Thomas Luu, Thesis (2016). + //! Notes refer to equations, page 96-98 and C++ code from algorithm Routine 11. + + template > + RealType productlog(RealType x) + { + BOOST_MATH_STD_USING // for ADL of std functions. + + using boost::math::log1p; + using boost::math::constants::root_two; // 1.414 ... + using boost::math::constants::e; // e(1) = 2.71828... + using boost::math::constants::one_div_root_two; // 0.707106 + using boost::math::constants::expminusone; // 0.36787944 + + std::cout.precision(std::numeric_limits ::max_digits10); + std::cout << std::showpoint << std::endl; // Show all trailing zeros. + + // Catch the very common mistake of providing an integer value as parameter to productlog. + // need to ensure it is a floating-point type (of the desired type, float 1.f, double 1., or long double 1.L), + // or static_cast, for example: static_cast(1) or static_cast(1). + // Want to allow fixed_point types too. + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point, not integer type, for example W(1.), not W(1)!"); + +#ifdef BOOST_MATH_INSTRUMENT + std::cout << std::showpoint << std::endl; // Show all trailing zeros. + //std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits. + std::cout.precision(std::numeric_limits::digits10); // Show all significant digits. +#endif + // Check on range of x. + + //std::cout << "-exp(-1) = " << -expminusone() << std::endl; + + // Special case of -exp(-1)) // -0.3678794411714423215955237701614608674458111310 + // Can't use if (x < -exp(-1)) because 1-bit difference in accuracy of exp means is inconsistent. + // if (x < static_cast(-0.3678794411714423215955237701614608674458111310L) ) + if (x < -expminusone()) + { // If x < -0.367879 then W(x) would be complex (not handled with this implementation). + // Or might throw an exception? Use domain error for policy here. + + //std::cout << "Would be Complex " << x << ' ' << static_cast(-0.3678794411714423215955237701614608674458111310L) << " return NaN!" << std::endl; + return std::numeric_limits::quiet_NaN(); + } + //else if (x == static_cast(-0.3678794411714423215955237701614608674458111310)) + else if (x == -expminusone() ) + { + //std::cout << "At Singularity " << x << ' ' << static_cast(-0.3678794411714423215955237701614608674458111310L) << " returned " << static_cast(-1) << std::endl; + + return static_cast(-1); + } + + if (x == 0) + { // Special case of zero (for speed and to avoid log(0)and /0 etc). + // TODO check that values very close to zero do not fail? + return static_cast(0); + } + + RealType w0; + // Upper branch W0 is divided in two regions: -1 <= w0_minus <=0 and 0 <= w0_plus. + if (x > 0) + { // Luu Routine 11, line 8, and equation 6.44, from Barry et al. + // (1.2 and 2.4 are 'exact' from integer fractions 6/5 and 12/5). + w0 = log(static_cast(1.2L) * x / log(static_cast(2.4L) * x / log1p(static_cast(2.4L) * x))); + //w0 = log(static_cast(1.2L) * x / log(static_cast(2.4L) * x / local::log1p(static_cast(2.4L) * x))); + // local::log1p does seem to refine OK with multiprecision. + } + else + { // > -exp(-1) or > -0.367879 + // so for real result need x > -0.367879 >= 0 + // Might treat near -exp(-1) == -0.367879 values differently as approximations may not quite converge? + + RealType sqrt_v = root_two() * sqrt(static_cast(1) + e() * x); // nu = sqrt(2 + 2e * z) Line 10. + + RealType n2 = static_cast(3) * root_two() + static_cast(6); // 3 * sqrt(2) + 6, Line 11. + // == 10.242640687119285146 + + RealType n2num = (static_cast(2237) + (static_cast(1457) * root_two())) * e() + - (static_cast(4108) * root_two()) - static_cast(5764); // Numerator Line 11. + + RealType n2denom = (static_cast(215) + (static_cast(199) * root_two())) * e() + - (430 * root_two()) - static_cast(796); // Denominator Line 11. + RealType nn2 = n2num / n2denom; // Line 11 full fraction. + nn2 *= sqrt_v; // Line 11 last part. + n2 -= nn2; // Line 11 complete, equation 6.44, from Barry et al (erratum). + RealType n1 = (static_cast(1) - one_div_root_two()) * (n2 + root_two()); // Line 12. + + w0 = -1 + sqrt_v * (n2 + sqrt_v) / (n2 + sqrt_v + n1 * sqrt_v); // W0 1st approximation, Line 13, equation 6.40. + } + + #ifdef BOOST_MATH_INSTRUMENT + // std::cout << "\n1st approximation = " << w0 << std::endl; + #endif + + int iterations = 0; + RealType tolerance = 3 * std::numeric_limits::epsilon(); + RealType w1; + + while (iterations <= 5) + { // Iterate a few times to refine value using Halley's method. + RealType expw0 = exp(w0); // Compute from best W estimate so far. + // Hope that w0 * expw0 == x; + RealType diff = w0 * expw0 - x; // Difference from x. + if (abs(diff) <= tolerance/4) + { // Too close for Halley iteration to improve? + break; // Avoid oscillating forever around value. + } + + // Newton/Raphson's method https://en.wikipedia.org/wiki/Newton%27s_method + // f(w) = w e^w -z = 0 Luu equation 6.37 + // f'(w) = e^w (1 + w), Wolfram alpha (d)/(dw)(f(w) = w exp(w) - z) = e^w (w + 1) + // f(w) / f'(w) + // w1 = w0 - (expw0 * (w0 + 1)); // Refine new Newton/Raphson estimate. + // Takes typically 6 iterations to converge within tolerance, + // whereas Halley usually takes 1 to 3 iterations, + // so Newton unlikely to be quicker than additional computation cost of 2nd derivative. + // Might use Newton if near to x ~= -exp(-1) == -0.367879 + + + // Halley's method from Luu equation 6.39, line 17. + // https://en.wikipedia.org/wiki/Halley%27s_method + // f''(w) = e^w (2 + w) , Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) + // f''(w) / f'(w) = (2+w) / (1+w), Luu equation 6.38. + + w1 = w0 // Refine new Halley estimate. + - diff / + ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); // Luu equation 6.39. + + if (fabs((w0 / w1) - 1) < tolerance) + { // Reached estimate of Lambert W within tolerance (usually an epsilon or few). + break; + } + +#ifdef BOOST_MATH_INSTRUMENT + std::cout.precision(std::numeric_limits::digits10); + std::cout <<"Iteration #" << iterations << ", w0 " << w0 << ", w1 = " << w1 << ", difference = " << diff << ", relative " << (w0 / w1 - static_cast(1)) << std::endl; + std::cout << "f'(x) = " << diff / (expw0 * (w0 + 1)) << ", f''(x) = " << - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))) << std::endl; + //std::cout << "Newton new = " << wn << std::endl; +#endif + w0 = w1; + iterations++; + } // while + +#ifdef BOOST_MATH_INSTRUMENT + std::cout << "Final " << w1 << " after " << iterations << " iterations" << ", difference = " << (w0 / w1 - static_cast(1)) << std::endl; +#endif + return w1; + } + + } // namespace math +} // namespace boost diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp new file mode 100644 index 000000000..07d2563bb --- /dev/null +++ b/test/test_lambert_w.cpp @@ -0,0 +1,389 @@ +// Copyright Paul A. Bristow 2016. +// Copyright John Maddock 2016. + +// 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) + +// test_lambertw.cpp +//! \brief Basic sanity tests for Lambert W function plog or productlog using algorithm from Thomas Luu. + +// #include +#include // for real_concept +#define BOOST_TEST_MAIN +#define BOOST_LIB_DIAGNOSTIC + +//#define BOOST_MATH_INSTRUMENT // #define for diagnostic output. + +#include // Boost.Test +#include + +#include // boost::multiprecision::cpp_dec_float_50 +using boost::multiprecision::cpp_dec_float_50; + +#include + +#include // for productlog function. +#include +#include +#include + +#include +#include +#include +#include +#include + +// BOOST_MATH_TEST_VALUE is used to create a test value of suitable type from a decimal digit string. +// Note there are two gotchas to this approach: +// * You need all values to be real floating-point values +// * and *MUST* include a decimal point. +// * It's slow to compile compared to a simple literal - not an issue for a +// few test values, but it's not generally usable in large tables +// where you really need everything to be statically initialized. + + +template +inline T create_test_value(long double val, const char*, const T1&, const T2&) +{ // Construct from long double parameter val (ignoring string/const char*) + return static_cast(val); +} + +template +inline T create_test_value(long double, const char* str, const boost::mpl::false_&, const boost::mpl::true_&) +{ // Construct from string (ignoring long double parameter). + return T(str); +} + +template +inline T create_test_value(long double, const char* str, const boost::mpl::false_&, const boost::mpl::false_&) +{ // Create test value using from lexical cast of string. + return boost::lexical_cast(str); +} + +// T real type, x a decimal digits representation of a floating-point, for example: 12.34. + +// x is converted to a long double by appending the letter L (to suit long double fundamental type) +// x is also passed as a const char* or string representation +// (to suit most other types that cannot be constructed from long double without loss) + +// x##L is a long double version, suffix a letter L to suit long double fundamental type. +// #x is a string version to suit multiprecision constructors +// (constructing from double or long double would loose precision). +#define BOOST_MATH_TEST_VALUE(T, x) create_test_value(\ + x##L,\ + #x,\ + boost::mpl::bool_<\ + std::numeric_limits::is_specialized &&\ + (std::numeric_limits::radix == 2) && (std::numeric_limits::digits\ + <= std::numeric_limits::digits) && boost::is_convertible::value>(),\ + boost::mpl::bool_<\ + boost::is_constructible::value>()\ +) + +template +void show() +{ + std::cout << std::boolalpha << typeid(T).name() << std::endl + << " is specialized " << std::numeric_limits::is_specialized + << " digits " << std::numeric_limits::digits // binary digits 24 + << ", is_convertible " << boost::is_convertible::value << std::endl // convertible to string + << " is_constructible " << boost::is_constructible::value // constructible from string + << std::endl; +} // show + + +long double test_value = BOOST_MATH_TEST_VALUE(long double, 1.); + +static const unsigned int noof_tests = 2; + +static const boost::array test_data = +{{ + "1", + "6" +}}; // array test_data + +//static const boost::array test_expected = +//{ { +// BOOST_MATH_TEST_VALUE("0.56714329040978387299996866221035554975381578718651"), // Output from https://www.wolframalpha.com/input/?i=productlog(1) +// BOOST_MATH_TEST_VALUE("1.432404775898300311234078007212058694786434608804302025655") // Output from https://www.wolframalpha.com/input/?i=productlog(6) + +// } }; // array test_data + + + +//BOOST_MATH_TEST_VALUE("-0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527") +// w(-0.367879441171442321595523770161460867445811131031767834) + +// +// ProductLog[-0.367879441171442321595523770161460867445811131031767834] + +template +void test_spots(RealType) +{ + // (Unused Parameter value, arbitrarily zero, only communicates the floating point type). + // test_spots(0.F); test_spots(0.); test_spots(0.L); + +// // Check some bad parameters to the function, +//#ifndef BOOST_NO_EXCEPTIONS +// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution nbad1(0, 0), std::domain_error); // zero sd +// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution nbad1(0, -1), std::domain_error); // negative sd +//#else +// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution(0, 0), std::domain_error); // zero sd +// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution(0, -1), std::domain_error); // negative sd +//#endif + + using boost::math::constants::expminusone; + RealType tolerance = boost::math::tools::epsilon() * 5; // 5 eps as a fraction. + std::cout << "Testing type " << typeid(RealType).name() << std::endl; + std::cout << "Tolerance " << tolerance << std::endl; + std::cout << "Precision " << std::numeric_limits::digits10 << " decimal digits." << std::endl; + std::cout.precision(std::numeric_limits::digits10); + std::cout << std::showpoint << std::endl; // show trailing significant zeros. + std::cout << "-exp(-1) = " << -expminusone() << std::endl; + + show(); + + using boost::math::productlog; + + RealType test_value = BOOST_MATH_TEST_VALUE(RealType, 1.); + RealType expected_value = BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651); + + test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176); + expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.); + std::cout.precision(std::numeric_limits ::max_digits10); + test_value = -boost::math::constants::expminusone(); + std::cout << "test " << test_value << ", expected " << expected_value << std::endl; + + BOOST_CHECK_CLOSE_FRACTION( + productlog(test_value), + expected_value, + tolerance); // OK + + // This fails for reasons unclear (apparently identical test above passes)??? + //BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 + // productlog(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176)), + // BOOST_MATH_TEST_VALUE(RealType, -1.), + // tolerance); + + BOOST_CHECK_CLOSE_FRACTION( + productlog(BOOST_MATH_TEST_VALUE(RealType, 1.)), + BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651), + // Output from https://www.wolframalpha.com/input/?i=productlog(1) + tolerance); + + //Tests with some spot values computed using + //https://www.wolframalpha.com + //For example: N[ProductLog[-1], 50] outputs: + //1.3267246652422002236350992977580796601287935546380 + + BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 2.)), + BOOST_MATH_TEST_VALUE(RealType, 0.852605502013725491346472414695317466898453300151403508772), + // Output from https://www.wolframalpha.com/input/?i=productlog(2.) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 3.)), + BOOST_MATH_TEST_VALUE(RealType, 1.049908894964039959988697070552897904589466943706341452932), + // Output from https://www.wolframalpha.com/input/?i=productlog(3.) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 5.)), + BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789), + // Output from https://www.wolframalpha.com/input/?i=productlog(0.5) + tolerance); + + + BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 0.5)), + BOOST_MATH_TEST_VALUE(RealType, 0.351733711249195826024909300929951065171464215517111804046), + // Output from https://www.wolframalpha.com/input/?i=productlog(0.5) + tolerance); + + + BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 6.)), + BOOST_MATH_TEST_VALUE(RealType, 1.432404775898300311234078007212058694786434608804302025655), + // Output from https://www.wolframalpha.com/input/?i=productlog(6) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 100.)), + BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578), + // Output from https://www.wolframalpha.com/input/?i=productlog(100) + tolerance); + + // Fails here with really big x. + /* BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), + BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), + // Output from https://www.wolframalpha.com/input/?i=productlog(1e6) + // tolerance * 1000); // fails exceeds 0.00015258789063 + tolerance * 1000); + + 1>i:/modular-boost/libs/math/test/test_lambert_w.cpp(195): + error : in "test_main": + difference{2877.54} between + productlog(create_test_value( 1.0e6L, "1.0e6", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>())) +{ + 32767.399857 +} +and + +create_test_value( 11.383358086140052622000156781585004289033774706019L, "11.383358086140052622000156781585004289033774706019", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) +{ + 11.383346558 +} +exceeds 0.00015258789063 + + + */ + + + BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 0.0)), + BOOST_MATH_TEST_VALUE(RealType, 0.), + tolerance); + + // This is very close to the limit of -exp(1) * x + // (where the result has a non-zero imaginary part). + test_value = -expminusone(); + test_value += (std::numeric_limits::epsilon() * 100); + expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.0); + + // std::cout << test_value << std::endl; // -0.367879 + + // Fatal error here with float. + //BOOST_CHECK_CLOSE_FRACTION(productlog(test_value), + // expected_value, + // tolerance); + + /* + i:/modular-boost/libs/math/test/test_lambert_w.cpp(224): + error : in "test_main": + + difference{1e+67108864} between productlog(test_value) + { + 0 + } and create_test_value( + -0.99845210378072725931829498030640227316856835774851L, + "-0.99845210378072725931829498030640227316856835774851", + boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) + { + -0.99845210378072725931829498030640227316856835774851 + } + + exceeds 5e-47 + */ + + + /* Goes realy haywire here close to singularity. + + test_value = BOOST_MATH_TEST_VALUE(RealType, -0.367879); + BOOST_CHECK_CLOSE_FRACTION(productlog(test_value), + BOOST_MATH_TEST_VALUE(RealType, -0.99845210378072725931829498030640227316856835774851), + // Output from https://www.wolframalpha.com/input/?i=productlog(2.) + // N[productlog(-0.367879), 50] = -0.99845210378072725931829498030640227316856835774851 + tolerance * 100); + + I:/modular-boost/libs/math/test/test_lambert_w.cpp(267): error : in "test_main": + difference + { + 2.87298e+26 + } + between productlog(test_value) + { + -2.86853068e+26 + } + and create_test_value( -0.99845210378072725931829498030640227316856835774851L, "-0.99845210378072725931829498030640227316856835774851", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) + { + -0.998452127 + } + exceeds 5.96046448e-05 + + */ + + + // Checks on input that should throw. + + /* This should throw when implemented. + BOOST_CHECK_CLOSE_FRACTION(productlog(-0.5), + BOOST_MATH_TEST_VALUE(RealType, ), + // Output from https://www.wolframalpha.com/input/?i=productlog(-0.5) + tolerance); + */ +} //template void test_spots(RealType) + +BOOST_AUTO_TEST_CASE(test_main) +{ + BOOST_MATH_CONTROL_FP; + + std::cout << "Tests run with " << BOOST_COMPILER << ", " + << BOOST_STDLIB << ", Boost Platform " << BOOST_PLATFORM << ", MSVC compiler " + << BOOST_MSVC_FULL_VER << std::endl; + + // Fundamental built-in types: + test_spots(0.0F); // float + test_spots(0.0); // double + if (sizeof(long double) > sizeof (double)) + { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). + test_spots(0.0L); // long double + } + // Multiprecision types: + test_spots(static_cast(0)); + test_spots(static_cast(0)); + + // Fixed-point types: + test_spots(static_cast >(0)); + + //test_spots(boost::math::concepts::real_concept(0.1)); // "real_concept" - was OK. + // link fails - need to add as a permanent constant. + /* + test_lambert_w.obj : error LNK2001 : unresolved external symbol "private: static class boost::math::concepts::real_concept __cdecl boost::math::constants::detail::constant_expminusone::compute<0>(void)" (? ? $compute@$0A@@?$constant_expminusone@Vreal_concept@concepts@math@boost@@@detail@constants@math@boost@@CA?AVreal_concept@concepts@34@XZ) + */ + + + +} // BOOST_AUTO_TEST_CASE( test_main ) + + /* + + Output: + + tolerance just one epsilon fails for Lambert W (-0.367879) = -0.998452 + + 1>------ Rebuild All started: Project: test_lambertW, Configuration: Release x64 ------ +1> test_lambertW.cpp +1> Linking to lib file: libboost_unit_test_framework-vc140-mt-1_63.lib +1> Generating code +1> All 1827 functions were compiled because no usable IPDB/IOBJ from previous compilation was found. +1> Finished generating code +1> test_lambertW.vcxproj -> J:\Cpp\Misc\x64\Release\test_lambertW.exe +1> test_lambertW.vcxproj -> J:\Cpp\Misc\x64\Release\test_lambertW.pdb (Full PDB) +1> Running 1 test case... +1> Platform: Win32 +1> Compiler: Microsoft Visual C++ version 14.0 +1> STL : Dinkumware standard library version 650 +1> Boost : 1.63.0 +1> Tests run with Microsoft Visual C++ version 14.0, Dinkumware standard library version 650, Boost PlatformWin32, MSVC compiler 190024123 +1> Tolerance 5.96046e-07 +1> Precision 6 decimal digits. +1> Iteration #0, w0 0.577547, w1 = 0.567144, difference = 0.0289948, relative 0.018344 +1> Iteration #1, w0 0.567144, w1 = 0.567143, difference = 9.53674e-07, relative 5.96046e-07 +1> Final 0.567143 after 2 iterations, difference = 0 +1> Tolerance 1.11022e-15 +1> Precision 15 decimal digits. +1> Iteration #0, w0 0.577547206058041, w1 = 0.567143616915443, difference = 0.0289944962755619, relative 0.018343835374856 +1> Iteration #1, w0 0.567143616915443, w1 = 0.567143290409784, difference = 9.02208135089566e-07, relative 5.75702234328901e-07 +1> Final 0.567143290409784 after 2 iterations, difference = 0 +1> Tolerance 5e-49 +1> Precision 50 decimal digits. +1> Iteration #0, w0 0.57754720605804066335708515521786300470367806666917, w1 = 0.5671436169154433808085244686233766561058069997742, difference = 0.028994496275562314267349048621807448516020440172019, relative 0.018343835374855986875831315372982269135605651729877 +1> Iteration #1, w0 0.5671436169154433808085244686233766561058069997742, w1 = 0.56714329040978387301011426674463910433535588015473, difference = 9.0220813517014912275046839365249789421357156514914e-07, relative 5.7570223438927562537725655919526667550991229663452e-07 +1> Iteration #2, w0 0.56714329040978387301011426674463910433535588015473, w1 = 0.56714329040978387299996866221035554975381578718651, difference = 2.8034566117436458709490133985425058248551576808341e-20, relative 1.7888961583152904127717080041769389899099419098831e-20 +1> Final 0.56714329040978387299996866221035554975381578718651 after 3 iterations, difference = 0 +1> +1> *** No errors detected +========== Rebuild All: 1 succeeded, 0 failed, 0 skipped ========== + + + */ + + + + From eb2707e8b0989a6ebcdbd58f77aed6c37db911c2 Mon Sep 17 00:00:00 2001 From: pabristow Date: Mon, 2 Jan 2017 18:31:16 +0000 Subject: [PATCH 02/71] Failed attempts to get create_test_value to work. --- example/lambert_w_diode_graph.cpp | 11 +-- test/test_lambert_w.cpp | 110 +++++++++++++++++++----------- 2 files changed, 77 insertions(+), 44 deletions(-) diff --git a/example/lambert_w_diode_graph.cpp b/example/lambert_w_diode_graph.cpp index e75ab70cb..df6c5a8e2 100644 --- a/example/lambert_w_diode_graph.cpp +++ b/example/lambert_w_diode_graph.cpp @@ -5,8 +5,9 @@ // (See accompanying file LICENSE_1_0.txt or // copy at http ://www.boost.org/LICENSE_1_0.txt). -/*! \brief Graph of using Lambert W function to compute current +/*! \brief Graph showing use of Lambert W function to compute current through a diode-connected transistor with preset series resistance. + \details T. C. Banwell and A. Jayakumar, Exact analytical solution of current flow through diode with series resistance, Electron Letters, 36(4):291-2 (2000) @@ -24,7 +25,6 @@ The solid curves in Figure 2 are calculated using equation 5 with rsat included http://www3.imperial.ac.uk/pls/portallive/docs/1/7292572.PDF - */ #include @@ -223,7 +223,7 @@ int main() data_plot.title("Diode current versus voltage") .x_size(400) .y_size(300) - //.legend_on(false) + .legend_on(true) .x_label("voltage (V)") .y_label("log(current)") //.x_label_on(true) @@ -239,8 +239,9 @@ int main() //.y_values_on(true) .y_values_rotation(horizontal) //.plot_window_on(true) - .x_values_precision(4) - .y_values_precision(5) + .x_values_precision(3) + .y_values_precision(3) + .coord_precision(4) // Needed to avoid stepping on curves. .copyright_holder("Paul A. Bristow") .copyright_date("2016") //.background_border_color(black); diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 07d2563bb..fec9f993a 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -36,29 +36,43 @@ using boost::multiprecision::cpp_dec_float_50; #include // BOOST_MATH_TEST_VALUE is used to create a test value of suitable type from a decimal digit string. +// Two parameters, both a literal like 1.23 and a decimal digit string const char* like "1.23" must be provided. +// The decimal value represented must be the same of course, with at least enough precision for long double. // Note there are two gotchas to this approach: // * You need all values to be real floating-point values // * and *MUST* include a decimal point. -// * It's slow to compile compared to a simple literal - not an issue for a -// few test values, but it's not generally usable in large tables +// * It's slow to compile compared to a simple literal. +// This is not an issue for a few test values, +// but it's not generally usable in large tables // where you really need everything to be statically initialized. +int create_type(0); template inline T create_test_value(long double val, const char*, const T1&, const T2&) -{ // Construct from long double parameter val (ignoring string/const char*) +{ // Construct from long double parameter val (ignoring string/const char* str) + create_type = 1; + return static_cast(val); +} + +template +inline T create_test_value(long double val, const char*, const boost::mpl::true_&, const boost::mpl::false_&) +{ // Construct from long double parameter val (ignoring string/const char* str) + create_type = 1; return static_cast(val); } template inline T create_test_value(long double, const char* str, const boost::mpl::false_&, const boost::mpl::true_&) -{ // Construct from string (ignoring long double parameter). +{ // Construct from decimal digit string const char* @c str (ignoring long double parameter). + create_type = 2; return T(str); } template inline T create_test_value(long double, const char* str, const boost::mpl::false_&, const boost::mpl::false_&) -{ // Create test value using from lexical cast of string. +{ // Create test value using from lexical cast of decimal digit string const char* str. + create_type = 3; return boost::lexical_cast(str); } @@ -66,18 +80,25 @@ inline T create_test_value(long double, const char* str, const boost::mpl::false // x is converted to a long double by appending the letter L (to suit long double fundamental type) // x is also passed as a const char* or string representation -// (to suit most other types that cannot be constructed from long double without loss) +// (to suit most other types that cannot be constructed from long double without possible loss). + +// x##L makes a long double version, suffix a letter L to suit long double fundamental type. +// #x makes a decimal digit string version to suit multiprecision and fixed_point constructors. +// (Constructing from double or long double could lose precision for multiprecision or fixed-point). + +// The matching create_test_value function above is chosen depending on the T1 and T2 mpl bool truths. +// The string version from #x is used if the precision of T is greater than long double. + +// Example: long double test_value = BOOST_MATH_TEST_VALUE(long double, 9.); -// x##L is a long double version, suffix a letter L to suit long double fundamental type. -// #x is a string version to suit multiprecision constructors -// (constructing from double or long double would loose precision). #define BOOST_MATH_TEST_VALUE(T, x) create_test_value(\ x##L,\ #x,\ boost::mpl::bool_<\ std::numeric_limits::is_specialized &&\ - (std::numeric_limits::radix == 2) && (std::numeric_limits::digits\ - <= std::numeric_limits::digits) && boost::is_convertible::value>(),\ + (std::numeric_limits::radix == 2)\ + && (std::numeric_limits::digits <= std::numeric_limits::digits)\ + && boost::is_convertible::value>(),\ boost::mpl::bool_<\ boost::is_constructible::value>()\ ) @@ -85,17 +106,27 @@ inline T create_test_value(long double, const char* str, const boost::mpl::false template void show() { - std::cout << std::boolalpha << typeid(T).name() << std::endl + std::cout << std::boolalpha << "Test with type:\n" + << typeid(T).name() << std::endl << " is specialized " << std::numeric_limits::is_specialized - << " digits " << std::numeric_limits::digits // binary digits 24 - << ", is_convertible " << boost::is_convertible::value << std::endl // convertible to string - << " is_constructible " << boost::is_constructible::value // constructible from string - << std::endl; + << ", radix = " << std::numeric_limits::radix + << ", digits = " << std::numeric_limits::digits // binary digits, 24 for float, 53 for double ... + << ", is_convertible " << boost::is_convertible::value // is convertible long double *to* T. + << ", is_constructible " << boost::is_constructible::value // is constructible *from* string. + << std::endl; + + std::cout << " T1 = " + << ( + (std::numeric_limits::is_specialized) + && (std::numeric_limits::radix == 2) + && (std::numeric_limits::digits <= std::numeric_limits::digits) + && (boost::is_convertible::value) + ) + << ", T2 = " << (boost::is_constructible::value) + << std::endl; } // show -long double test_value = BOOST_MATH_TEST_VALUE(long double, 1.); - static const unsigned int noof_tests = 2; static const boost::array test_data = @@ -106,16 +137,12 @@ static const boost::array test_data = //static const boost::array test_expected = //{ { -// BOOST_MATH_TEST_VALUE("0.56714329040978387299996866221035554975381578718651"), // Output from https://www.wolframalpha.com/input/?i=productlog(1) -// BOOST_MATH_TEST_VALUE("1.432404775898300311234078007212058694786434608804302025655") // Output from https://www.wolframalpha.com/input/?i=productlog(6) +// BOOST_MATH_TEST_VALUE(T, 0.56714329040978387299996866221035554975381578718651), // Output from https://www.wolframalpha.com/input/?i=productlog(1) +// BOOST_MATH_TEST_VALUE(T, 1.432404775898300311234078007212058694786434608804302025655) // Output from https://www.wolframalpha.com/input/?i=productlog(6) // } }; // array test_data - -//BOOST_MATH_TEST_VALUE("-0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527") -// w(-0.367879441171442321595523770161460867445811131031767834) - // // ProductLog[-0.367879441171442321595523770161460867445811131031767834] @@ -134,6 +161,8 @@ void test_spots(RealType) // BOOST_MATH_CHECK_THROW(boost::math::normal_distribution(0, -1), std::domain_error); // negative sd //#endif + using boost::math::productlog; + using boost::math::constants::expminusone; RealType tolerance = boost::math::tools::epsilon() * 5; // 5 eps as a fraction. std::cout << "Testing type " << typeid(RealType).name() << std::endl; @@ -145,27 +174,30 @@ void test_spots(RealType) show(); - using boost::math::productlog; + std::cout << " Create type: " + << ((create_type ==1) ? "create from static_cast(val) " : + (create_type == 2) ? "construct from T(str)" : + (create_type == 3) ? "boost::lexical_cast(str)" : + "???") // ??? create_type == 0 should never happen? + << std::endl; - RealType test_value = BOOST_MATH_TEST_VALUE(RealType, 1.); - RealType expected_value = BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651); - - test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176); - expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.); std::cout.precision(std::numeric_limits ::max_digits10); - test_value = -boost::math::constants::expminusone(); - std::cout << "test " << test_value << ", expected " << expected_value << std::endl; - BOOST_CHECK_CLOSE_FRACTION( + RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176); + RealType expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.); + + test_value = -boost::math::constants::expminusone(); // -exp(-1) = -0.367879450 + std::cout << "test " << test_value << ", expected productlog = " << expected_value << std::endl; + + BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 productlog(test_value), expected_value, tolerance); // OK - // This fails for reasons unclear (apparently identical test above passes)??? - //BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 - // productlog(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176)), - // BOOST_MATH_TEST_VALUE(RealType, -1.), - // tolerance); + BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 + productlog(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176)), + BOOST_MATH_TEST_VALUE(RealType, -1.), + tolerance); BOOST_CHECK_CLOSE_FRACTION( productlog(BOOST_MATH_TEST_VALUE(RealType, 1.)), @@ -210,7 +242,7 @@ void test_spots(RealType) // Output from https://www.wolframalpha.com/input/?i=productlog(100) tolerance); - // Fails here with really big x. + // TODO Fails here with really big x. /* BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), // Output from https://www.wolframalpha.com/input/?i=productlog(1e6) From 8507da5a599844a989139540ed47faa2c0599e89 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Tue, 3 Jan 2017 18:56:42 +0000 Subject: [PATCH 03/71] Fix construct from floating point create_test_value overload. --- test/test_lambert_w.cpp | 11 ++--------- 1 file changed, 2 insertions(+), 9 deletions(-) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index fec9f993a..0c12d5367 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -48,15 +48,8 @@ using boost::multiprecision::cpp_dec_float_50; int create_type(0); -template -inline T create_test_value(long double val, const char*, const T1&, const T2&) -{ // Construct from long double parameter val (ignoring string/const char* str) - create_type = 1; - return static_cast(val); -} - -template -inline T create_test_value(long double val, const char*, const boost::mpl::true_&, const boost::mpl::false_&) +template +inline T create_test_value(long double val, const char*, const boost::mpl::true_&, const T2&) { // Construct from long double parameter val (ignoring string/const char* str) create_type = 1; return static_cast(val); From 94d3cf4043bf2458f8b93201717fee60631cd75c Mon Sep 17 00:00:00 2001 From: pabristow Date: Mon, 6 Mar 2017 18:10:52 +0000 Subject: [PATCH 04/71] refactored to use local test_value.hpp --- .../math/special_functions/lambert_w.hpp | 17 +- test/Jamfile.v2 | 1 + test/test_lambert_w.cpp | 199 +++++++----------- 3 files changed, 90 insertions(+), 127 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index cda6b4374..c58aaf9b1 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -50,8 +50,8 @@ #include // exp #include // is_integral - // Define a temporary constant for exp(-1) for use in checks at the singularity. +// TODO make this a permanent constant (and also 1/6) namespace boost { namespace math { @@ -62,7 +62,6 @@ namespace boost } } - namespace boost { namespace fixed_point { @@ -183,7 +182,7 @@ T log1p(T x) //T dodgy = log1p_dodgy(x); double dx = static_cast(x); double lp1x = log1p(dx); -#ifdef BOOST_MATH_INSTRUMENT +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout << "true " << lp1x << ", log1p_fp " << log1p(x) //<< ", dodgy " << dodgy << ", HP " << result @@ -226,7 +225,7 @@ namespace boost // Want to allow fixed_point types too. BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point, not integer type, for example W(1.), not W(1)!"); -#ifdef BOOST_MATH_INSTRUMENT +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout << std::showpoint << std::endl; // Show all trailing zeros. //std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits. std::cout.precision(std::numeric_limits::digits10); // Show all significant digits. @@ -291,13 +290,13 @@ namespace boost w0 = -1 + sqrt_v * (n2 + sqrt_v) / (n2 + sqrt_v + n1 * sqrt_v); // W0 1st approximation, Line 13, equation 6.40. } - #ifdef BOOST_MATH_INSTRUMENT + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W // std::cout << "\n1st approximation = " << w0 << std::endl; #endif int iterations = 0; RealType tolerance = 3 * std::numeric_limits::epsilon(); - RealType w1; + RealType w1(0); while (iterations <= 5) { // Iterate a few times to refine value using Halley's method. @@ -334,7 +333,7 @@ namespace boost break; } -#ifdef BOOST_MATH_INSTRUMENT +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout.precision(std::numeric_limits::digits10); std::cout <<"Iteration #" << iterations << ", w0 " << w0 << ", w1 = " << w1 << ", difference = " << diff << ", relative " << (w0 / w1 - static_cast(1)) << std::endl; std::cout << "f'(x) = " << diff / (expw0 * (w0 + 1)) << ", f''(x) = " << - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))) << std::endl; @@ -344,11 +343,11 @@ namespace boost iterations++; } // while -#ifdef BOOST_MATH_INSTRUMENT +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout << "Final " << w1 << " after " << iterations << " iterations" << ", difference = " << (w0 / w1 - static_cast(1)) << std::endl; #endif return w1; - } + } // } // namespace math } // namespace boost diff --git a/test/Jamfile.v2 b/test/Jamfile.v2 index 29c694143..1529a167b 100644 --- a/test/Jamfile.v2 +++ b/test/Jamfile.v2 @@ -560,6 +560,7 @@ run test_jacobi.cpp pch_light ../../test/build//boost_unit_test_framework ; run test_laplace.cpp ../../test/build//boost_unit_test_framework ; run test_inv_hyp.cpp pch ../../test/build//boost_unit_test_framework ; run test_laguerre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ; +run test_lambert_w.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ; run test_legendre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ; run test_ldouble_simple.cpp ../../test/build//boost_unit_test_framework ; run test_logistic_dist.cpp ../../test/build//boost_unit_test_framework ; diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 0c12d5367..d3ed467ad 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -1,4 +1,4 @@ -// Copyright Paul A. Bristow 2016. +// Copyright Paul A. Bristow 2016, 2017. // Copyright John Maddock 2016. // Use, modification and distribution are subject to the @@ -9,18 +9,19 @@ // test_lambertw.cpp //! \brief Basic sanity tests for Lambert W function plog or productlog using algorithm from Thomas Luu. -// #include #include // for real_concept #define BOOST_TEST_MAIN #define BOOST_LIB_DIAGNOSTIC -//#define BOOST_MATH_INSTRUMENT // #define for diagnostic output. - #include // Boost.Test #include +#include "test_value.hpp" // for create_test_value #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; +#ifdef BOOST_HAS_FLOAT128 +#include +#endif #include @@ -35,91 +36,6 @@ using boost::multiprecision::cpp_dec_float_50; #include #include -// BOOST_MATH_TEST_VALUE is used to create a test value of suitable type from a decimal digit string. -// Two parameters, both a literal like 1.23 and a decimal digit string const char* like "1.23" must be provided. -// The decimal value represented must be the same of course, with at least enough precision for long double. -// Note there are two gotchas to this approach: -// * You need all values to be real floating-point values -// * and *MUST* include a decimal point. -// * It's slow to compile compared to a simple literal. -// This is not an issue for a few test values, -// but it's not generally usable in large tables -// where you really need everything to be statically initialized. - -int create_type(0); - -template -inline T create_test_value(long double val, const char*, const boost::mpl::true_&, const T2&) -{ // Construct from long double parameter val (ignoring string/const char* str) - create_type = 1; - return static_cast(val); -} - -template -inline T create_test_value(long double, const char* str, const boost::mpl::false_&, const boost::mpl::true_&) -{ // Construct from decimal digit string const char* @c str (ignoring long double parameter). - create_type = 2; - return T(str); -} - -template -inline T create_test_value(long double, const char* str, const boost::mpl::false_&, const boost::mpl::false_&) -{ // Create test value using from lexical cast of decimal digit string const char* str. - create_type = 3; - return boost::lexical_cast(str); -} - -// T real type, x a decimal digits representation of a floating-point, for example: 12.34. - -// x is converted to a long double by appending the letter L (to suit long double fundamental type) -// x is also passed as a const char* or string representation -// (to suit most other types that cannot be constructed from long double without possible loss). - -// x##L makes a long double version, suffix a letter L to suit long double fundamental type. -// #x makes a decimal digit string version to suit multiprecision and fixed_point constructors. -// (Constructing from double or long double could lose precision for multiprecision or fixed-point). - -// The matching create_test_value function above is chosen depending on the T1 and T2 mpl bool truths. -// The string version from #x is used if the precision of T is greater than long double. - -// Example: long double test_value = BOOST_MATH_TEST_VALUE(long double, 9.); - -#define BOOST_MATH_TEST_VALUE(T, x) create_test_value(\ - x##L,\ - #x,\ - boost::mpl::bool_<\ - std::numeric_limits::is_specialized &&\ - (std::numeric_limits::radix == 2)\ - && (std::numeric_limits::digits <= std::numeric_limits::digits)\ - && boost::is_convertible::value>(),\ - boost::mpl::bool_<\ - boost::is_constructible::value>()\ -) - -template -void show() -{ - std::cout << std::boolalpha << "Test with type:\n" - << typeid(T).name() << std::endl - << " is specialized " << std::numeric_limits::is_specialized - << ", radix = " << std::numeric_limits::radix - << ", digits = " << std::numeric_limits::digits // binary digits, 24 for float, 53 for double ... - << ", is_convertible " << boost::is_convertible::value // is convertible long double *to* T. - << ", is_constructible " << boost::is_constructible::value // is constructible *from* string. - << std::endl; - - std::cout << " T1 = " - << ( - (std::numeric_limits::is_specialized) - && (std::numeric_limits::radix == 2) - && (std::numeric_limits::digits <= std::numeric_limits::digits) - && (boost::is_convertible::value) - ) - << ", T2 = " << (boost::is_constructible::value) - << std::endl; -} // show - - static const unsigned int noof_tests = 2; static const boost::array test_data = @@ -136,7 +52,57 @@ static const boost::array test_data = // } }; // array test_data -// +//! Show information about build, architecture, address model, platform, ... +std::string show_versions() +{ + std::ostringstream message; + + message << "Program: " << __FILE__ << "\n"; +#ifdef __TIMESTAMP__ + message << __TIMESTAMP__; +#endif + message << "\nBuildInfo:\n" " Platform " << BOOST_PLATFORM; + // http://stackoverflow.com/questions/1505582/determining-32-vs-64-bit-in-c +#if defined(__LP64__) || defined(_WIN64) || (defined(__x86_64__) && !defined(__ILP32__) ) || defined(_M_X64) || defined(__ia64) || defined (_M_IA64) || defined(__aarch64__) || defined(__powerpc64__) +#define IS64BIT 1 + message << ", 64-bit."; +#else +#define IS32BIT 1 + message << ", 32-bit."; +#endif + + message << "\n Compiler " BOOST_COMPILER; +#ifdef BOOST_MSC_VER +#ifdef _MSC_FULL_VER + message << "\n MSVC version " << BOOST_STRINGIZE(_MSC_FULL_VER) << "."; +#endif +#ifdef __WIN64 + mess age << "\n WIN64" << std::endl; +#endif // __WIN64 +#ifdef _WIN32 + message << "\n WIN32" << std::endl; +#endif // __WIN32 +#endif +#ifdef __GNUC__ + //PRINT_MACRO(__GNUC__); + //PRINT_MACRO(__GNUC_MINOR__); + //PRINT_MACRO(__GNUC_PATCH__); + std::cout << "GCC " << __VERSION__ << std::endl; + //PRINT_MACRO(LONG_MAX); +#endif // __GNUC__ + + message << "\n STL " << BOOST_STDLIB; + + message << "\n Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100; + +#ifdef BOOST_HAS_FLOAT128 + message << ", BOOST_HAS_FLOAT128" << std::endl; +#endif + message << std::endl; + return message.str(); +} // std::string versions() + + // ProductLog[-0.367879441171442321595523770161460867445811131031767834] template @@ -156,7 +122,7 @@ void test_spots(RealType) using boost::math::productlog; - using boost::math::constants::expminusone; + using boost::math::constants::expminusone; RealType tolerance = boost::math::tools::epsilon() * 5; // 5 eps as a fraction. std::cout << "Testing type " << typeid(RealType).name() << std::endl; std::cout << "Tolerance " << tolerance << std::endl; @@ -165,15 +131,6 @@ void test_spots(RealType) std::cout << std::showpoint << std::endl; // show trailing significant zeros. std::cout << "-exp(-1) = " << -expminusone() << std::endl; - show(); - - std::cout << " Create type: " - << ((create_type ==1) ? "create from static_cast(val) " : - (create_type == 2) ? "construct from T(str)" : - (create_type == 3) ? "boost::lexical_cast(str)" : - "???") // ??? create_type == 0 should never happen? - << std::endl; - std::cout.precision(std::numeric_limits ::max_digits10); RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176); @@ -234,30 +191,29 @@ void test_spots(RealType) BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578), // Output from https://www.wolframalpha.com/input/?i=productlog(100) tolerance); - + // TODO Fails here with really big x. /* BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), // Output from https://www.wolframalpha.com/input/?i=productlog(1e6) // tolerance * 1000); // fails exceeds 0.00015258789063 tolerance * 1000); - - 1>i:/modular-boost/libs/math/test/test_lambert_w.cpp(195): - error : in "test_main": - difference{2877.54} between + + 1>i:/modular-boost/libs/math/test/test_lambert_w.cpp(195): + error : in "test_main": + difference{2877.54} between productlog(create_test_value( 1.0e6L, "1.0e6", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>())) { 32767.399857 } -and +and create_test_value( 11.383358086140052622000156781585004289033774706019L, "11.383358086140052622000156781585004289033774706019", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) { 11.383346558 -} +} exceeds 0.00015258789063 - */ @@ -292,12 +248,12 @@ exceeds 0.00015258789063 { -0.99845210378072725931829498030640227316856835774851 } - + exceeds 5e-47 */ - /* Goes realy haywire here close to singularity. + /* Goes really haywire here close to singularity. test_value = BOOST_MATH_TEST_VALUE(RealType, -0.367879); BOOST_CHECK_CLOSE_FRACTION(productlog(test_value), @@ -306,15 +262,15 @@ exceeds 0.00015258789063 // N[productlog(-0.367879), 50] = -0.99845210378072725931829498030640227316856835774851 tolerance * 100); - I:/modular-boost/libs/math/test/test_lambert_w.cpp(267): error : in "test_main": + I:/modular-boost/libs/math/test/test_lambert_w.cpp(267): error : in "test_main": difference { 2.87298e+26 - } + } between productlog(test_value) { -2.86853068e+26 - } + } and create_test_value( -0.99845210378072725931829498030640227316856835774851L, "-0.99845210378072725931829498030640227316856835774851", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) { -0.998452127 @@ -337,10 +293,11 @@ exceeds 0.00015258789063 BOOST_AUTO_TEST_CASE(test_main) { BOOST_MATH_CONTROL_FP; - - std::cout << "Tests run with " << BOOST_COMPILER << ", " - << BOOST_STDLIB << ", Boost Platform " << BOOST_PLATFORM << ", MSVC compiler " - << BOOST_MSVC_FULL_VER << std::endl; + // BOOST_TEST_MESSAGE( output only appears if command line has --log_level="message" + // or call set_threshold_level function: + boost::unit_test_framework::unit_test_log.set_threshold_level(boost::unit_test_framework::log_messages); + BOOST_TEST_MESSAGE("Test Lambert W function."); + BOOST_TEST_MESSAGE(show_versions()); // Full version of Boost, STL and compiler info. // Fundamental built-in types: test_spots(0.0F); // float @@ -349,9 +306,15 @@ BOOST_AUTO_TEST_CASE(test_main) { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). test_spots(0.0L); // long double } + // Built-in/fundamental Quad 128-bit type. + #ifdef BOOST_HAS_FLOAT128 + test_spots(static_cast(0)); +#endif + // Multiprecision types: test_spots(static_cast(0)); - test_spots(static_cast(0)); + test_spots(static_cast(0)); // Fails GCC gnu++11 and ++14 + test_spots(static_cast(0)); // Fails GCC. // Fixed-point types: test_spots(static_cast >(0)); From cea2465e3e05a80280b1d8ce6f369e6923d74303 Mon Sep 17 00:00:00 2001 From: pabristow Date: Mon, 6 Mar 2017 18:23:54 +0000 Subject: [PATCH 05/71] Need expminusone constant --- include/boost/math/special_functions/lambert_w.hpp | 5 +++++ test/test_lambert_w.cpp | 6 +++--- 2 files changed, 8 insertions(+), 3 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index c58aaf9b1..2170814e1 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -233,6 +233,11 @@ namespace boost // Check on range of x. //std::cout << "-exp(-1) = " << -expminusone() << std::endl; + // https://www.wolframalpha.com/input/?i=-exp(-1)&wal=header N[-Exp[-1], 143] + // -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 + // Add to constants as expminusone + + // onesixth 0.1666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666... // Special case of -exp(-1)) // -0.3678794411714423215955237701614608674458111310 // Can't use if (x < -exp(-1)) because 1-bit difference in accuracy of exp means is inconsistent. diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index d3ed467ad..db642d480 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -306,15 +306,15 @@ BOOST_AUTO_TEST_CASE(test_main) { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). test_spots(0.0L); // long double } - // Built-in/fundamental Quad 128-bit type. + // Built-in/fundamental Quad 128-bit type, if available. #ifdef BOOST_HAS_FLOAT128 test_spots(static_cast(0)); #endif // Multiprecision types: test_spots(static_cast(0)); - test_spots(static_cast(0)); // Fails GCC gnu++11 and ++14 - test_spots(static_cast(0)); // Fails GCC. + test_spots(static_cast(0)); // Fails GCC gnu++11 and gnu ++14but OK -std=c++11 and 14. + test_spots(static_cast(0)); // Fails GCC gnu++11 and ++14 but OK -std=c++11 and 14. // Fixed-point types: test_spots(static_cast >(0)); From 0048d41dd62ed78cd9e031abcb5ac1d9161ca000 Mon Sep 17 00:00:00 2001 From: pabristow Date: Fri, 10 Mar 2017 13:06:44 +0000 Subject: [PATCH 06/71] Added new constants expminusone and sixth --- .../math/constants/calculate_constants.hpp | 19 +++++++++++++++++-- include/boost/math/constants/constants.hpp | 5 +++-- test/test_constant_generate.cpp | 5 ++++- test/test_constants.cpp | 4 +++- 4 files changed, 27 insertions(+), 6 deletions(-) diff --git a/include/boost/math/constants/calculate_constants.hpp b/include/boost/math/constants/calculate_constants.hpp index 2dcdb9a02..71487885b 100644 --- a/include/boost/math/constants/calculate_constants.hpp +++ b/include/boost/math/constants/calculate_constants.hpp @@ -296,6 +296,15 @@ inline T constant_three_quarters::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_S return static_cast(3) / static_cast(4); } +template +template +inline T constant_sixth::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_)) +{ + BOOST_MATH_STD_USING + return static_cast(1) / static_cast(6); +} + +// Pi and related constants. template template inline T constant_pi_minus_three::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_)) @@ -326,7 +335,14 @@ inline T constant_exp_minus_half::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_S return exp(static_cast(-0.5)); } -// Pi +template +template +inline T constant_exp_minus_one::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_)) +{ + BOOST_MATH_STD_USING + return exp(static_cast(-1.)); +} + template template inline T constant_one_div_root_two::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_)) @@ -356,7 +372,6 @@ inline T constant_root_one_div_pi::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_ return sqrt(static_cast(1) / pi > >()); } - template template inline T constant_four_thirds_pi::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_)) diff --git a/include/boost/math/constants/constants.hpp b/include/boost/math/constants/constants.hpp index b5db9cedf..d35aa0271 100644 --- a/include/boost/math/constants/constants.hpp +++ b/include/boost/math/constants/constants.hpp @@ -65,8 +65,7 @@ namespace boost{ namespace math struct dummy_size{}; // - // Max number of binary digits in the string representations - // of our constants: + // Max number of binary digits in the string representations of our constants: // BOOST_STATIC_CONSTANT(int, max_string_digits = (101 * 1000L) / 301L); @@ -266,6 +265,7 @@ namespace boost{ namespace math BOOST_DEFINE_MATH_CONSTANT(third, 3.333333333333333333333333333333333333e-01, "3.33333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333e-01") BOOST_DEFINE_MATH_CONSTANT(twothirds, 6.666666666666666666666666666666666666e-01, "6.66666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667e-01") BOOST_DEFINE_MATH_CONSTANT(two_thirds, 6.666666666666666666666666666666666666e-01, "6.66666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667e-01") + BOOST_DEFINE_MATH_CONSTANT(sixth, 1.666666666666666666666666666666666666e-01, "1.66666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667e-01"); BOOST_DEFINE_MATH_CONSTANT(three_quarters, 7.500000000000000000000000000000000000e-01, "7.50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e-01") BOOST_DEFINE_MATH_CONSTANT(root_two, 1.414213562373095048801688724209698078e+00, "1.41421356237309504880168872420969807856967187537694807317667973799073247846210703885038753432764157273501384623e+00") BOOST_DEFINE_MATH_CONSTANT(root_three, 1.732050807568877293527446341505872366e+00, "1.73205080756887729352744634150587236694280525381038062805580697945193301690880003708114618675724857567562614142e+00") @@ -301,6 +301,7 @@ namespace boost{ namespace math BOOST_DEFINE_MATH_CONSTANT(one_div_cbrt_pi, 6.827840632552956814670208331581645981e-01, "6.82784063255295681467020833158164598108367515632448804042681583118899226433403918237673501922595519865685577274e-01") BOOST_DEFINE_MATH_CONSTANT(e, 2.718281828459045235360287471352662497e+00, "2.71828182845904523536028747135266249775724709369995957496696762772407663035354759457138217852516642742746639193e+00") BOOST_DEFINE_MATH_CONSTANT(exp_minus_half, 6.065306597126334236037995349911804534e-01, "6.06530659712633423603799534991180453441918135487186955682892158735056519413748423998647611507989456026423789794e-01") + BOOST_DEFINE_MATH_CONSTANT(exp_minus_one, 3.678794411714423215955237701614608674e-01, "3.67879441171442321595523770161460867445811131031767834507836801697461495744899803357147274345919643746627325277e-01"); BOOST_DEFINE_MATH_CONSTANT(e_pow_pi, 2.314069263277926900572908636794854738e+01, "2.31406926327792690057290863679485473802661062426002119934450464095243423506904527835169719970675492196759527048e+01") BOOST_DEFINE_MATH_CONSTANT(root_e, 1.648721270700128146848650787814163571e+00, "1.64872127070012814684865078781416357165377610071014801157507931164066102119421560863277652005636664300286663776e+00") BOOST_DEFINE_MATH_CONSTANT(log10_e, 4.342944819032518276511289189166050822e-01, "4.34294481903251827651128918916605082294397005803666566114453783165864649208870774729224949338431748318706106745e-01") diff --git a/test/test_constant_generate.cpp b/test/test_constant_generate.cpp index 937f26750..53f1c6a73 100644 --- a/test/test_constant_generate.cpp +++ b/test/test_constant_generate.cpp @@ -14,8 +14,9 @@ // To add new constants, add a function that calculates the value of the constant to // boost/math/constants/calculate_constants.hpp +// See http://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/new_const.html -#include +#include // Requires /modular-boost/libs/math/include_private in search path. #include int main() @@ -26,6 +27,7 @@ int main() BOOST_CONSTANTS_GENERATE(twothirds); BOOST_CONSTANTS_GENERATE(two_thirds); BOOST_CONSTANTS_GENERATE(three_quarters); + BOOST_CONSTANTS_GENERATE(sixth); // two and related. BOOST_CONSTANTS_GENERATE(root_two); BOOST_CONSTANTS_GENERATE(root_three); @@ -69,6 +71,7 @@ int main() // Euler's e and related. BOOST_CONSTANTS_GENERATE(e); BOOST_CONSTANTS_GENERATE(exp_minus_half); + BOOST_CONSTANTS_GENERATE(exp_minus_one); BOOST_CONSTANTS_GENERATE(e_pow_pi); BOOST_CONSTANTS_GENERATE(root_e); diff --git a/test/test_constants.cpp b/test/test_constants.cpp index 85e5a893f..3eb2fc1fc 100644 --- a/test/test_constants.cpp +++ b/test/test_constants.cpp @@ -157,6 +157,8 @@ void test_spots(RealType) BOOST_CHECK_CLOSE_FRACTION(0.333333333333333333333333333333333333333L, third(), tolerance); BOOST_CHECK_CLOSE_FRACTION(0.666666666666666666666666666666666666667L, two_thirds(), tolerance); BOOST_CHECK_CLOSE_FRACTION(0.75L, three_quarters(), tolerance); + BOOST_CHECK_CLOSE_FRACTION(0.1666666666666666666666666666666666666667L, sixth(), tolerance); + // Two and related. BOOST_CHECK_CLOSE_FRACTION(sqrt(2.L), root_two(), tolerance); BOOST_CHECK_CLOSE_FRACTION(sqrt(3.L), root_three(), tolerance); @@ -195,8 +197,8 @@ void test_spots(RealType) // Euler BOOST_CHECK_CLOSE_FRACTION(2.71828182845904523536028747135266249775724709369995L, e(), tolerance); - //BOOST_CHECK_CLOSE_FRACTION(exp(-0.5L), exp_minus_half(), tolerance); // See above. + BOOST_CHECK_CLOSE_FRACTION(exp(-1.L), exp_minus_one(), tolerance); BOOST_CHECK_CLOSE_FRACTION(pow(e(), pi()), e_pow_pi(), tolerance); // See also above. BOOST_CHECK_CLOSE_FRACTION(sqrt(e()), root_e(), tolerance); BOOST_CHECK_CLOSE_FRACTION(log10(e()), log10_e(), tolerance); From bdee37743d26e9cca62cc05bd391f19692677d8a Mon Sep 17 00:00:00 2001 From: pabristow Date: Mon, 13 Mar 2017 10:03:33 +0000 Subject: [PATCH 07/71] Bug in values near to -exp(-1) corrected. --- example/lambert_w_example.cpp | 137 +++++++++++++----- .../math/special_functions/lambert_w.hpp | 133 ++++++++--------- test/test_lambert_w.cpp | 9 +- 3 files changed, 163 insertions(+), 116 deletions(-) diff --git a/example/lambert_w_example.cpp b/example/lambert_w_example.cpp index a41ee9ae0..9083a6a08 100644 --- a/example/lambert_w_example.cpp +++ b/example/lambert_w_example.cpp @@ -12,7 +12,12 @@ #include // for BOOST_MSVC versions. #include #include // boost::exception +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. + +// #define BOOST_MATH_INSTRUMENT_LAMBERT_W + +// For lambert_w function. #include #include @@ -21,50 +26,72 @@ #include #include #include +#include // For std::numeric_limits. + +//! Show information about build, architecture, address model, platform, ... +std::string show_versions() +{ + std::ostringstream message; + + message << "Program: " << __FILE__ << "\n"; +#ifdef __TIMESTAMP__ + message << __TIMESTAMP__; +#endif + message << "\nBuildInfo:\n" " Platform " << BOOST_PLATFORM; + // http://stackoverflow.com/questions/1505582/determining-32-vs-64-bit-in-c +#if defined(__LP64__) || defined(_WIN64) || (defined(__x86_64__) && !defined(__ILP32__) ) || defined(_M_X64) || defined(__ia64) || defined (_M_IA64) || defined(__aarch64__) || defined(__powerpc64__) +#define IS64BIT 1 + message << ", 64-bit."; +#else +#define IS32BIT 1 + message << ", 32-bit."; +#endif + + message << "\n Compiler " BOOST_COMPILER; +#ifdef BOOST_MSC_VER +#ifdef _MSC_FULL_VER + message << "\n MSVC version " << BOOST_STRINGIZE(_MSC_FULL_VER) << "."; +#endif +#ifdef __WIN64 + mess age << "\n WIN64" << std::endl; +#endif // __WIN64 +#ifdef _WIN32 + message << "\n WIN32" << std::endl; +#endif // __WIN32 +#endif +#ifdef __GNUC__ + //PRINT_MACRO(__GNUC__); + //PRINT_MACRO(__GNUC_MINOR__); + //PRINT_MACRO(__GNUC_PATCH__); + std::cout << "GCC " << __VERSION__ << std::endl; + //PRINT_MACRO(LONG_MAX); +#endif // __GNUC__ + + message << "\n STL " << BOOST_STDLIB; + + message << "\n Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100; + +#ifdef BOOST_HAS_FLOAT128 + message << ", BOOST_HAS_FLOAT128" << std::endl; +#endif + message << std::endl; + return message.str(); +} // std::string versions() + int main() { try { - std::cout << "Lambert W example basic!" << std::endl; - - std::cout << "Platform: " << BOOST_PLATFORM << '\n' // Win32 - << "Compiler: " << BOOST_COMPILER << '\n' - << "STL : " << BOOST_STDLIB << '\n' - << "Boost : " << BOOST_VERSION / 100000 << "." - << BOOST_VERSION / 100 % 1000 << "." - << BOOST_VERSION % 100 - << std::endl; - -#ifdef _MSC_VER // Microsoft specific tests. - std::cout << "_MSC_FULL_VER = " << _MSC_FULL_VER << std::endl; // VS 2015 190023026 -#ifdef _WIN32 - std::cout << "Win32" << std::endl; -#endif - -#ifdef _WIN64 - std::cout << "x64" << std::endl; -#endif - -#endif // _MSC_VER - -// Not sure if these are Microsoft Specific? -#if defined _M_IX86 - std::cout << "(x86)" << std::endl; -#endif -#if defined _M_X64 - std::cout << " (x64)" << std::endl; -#endif -#if defined _M_IA64 - std::cout << " (Itanium)" << std::endl; -#endif - // Something very wrong if more than one is defined (so show them in all just in case)! - + //std::cout << "Lambert W example basic!" << std::endl; + //std::cout << show_versions() << std::endl; + //std::cout << exp(1) << std::endl; // 2.71828 //std::cout << exp(-1) << std::endl; // 0.367879 //std::cout << std::numeric_limits::epsilon() / 2 << std::endl; // 1.11022e-16 using namespace boost::math; + using boost::math::constants::exp_minus_one; double x = 1.; double W1 = productlog(1.); @@ -85,7 +112,9 @@ int main() std::cout << expplogone << " " << W1 << std::endl; // } + //[lambert_w_example_1 + /* x = 0.01; std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.00990147 //] [/lambert_w_example_1] @@ -93,12 +122,42 @@ int main() std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -0.0101015 x = -0.1; std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // - x = -0.367879; // Near -exp(1) = -0.367879 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -0.998452 - // N[productlog(-0.367879), 50] = -0.99845210378072725931829498030640227316856835774851 - //x = -0.36788; // < -exp(1) = -0.367879 - //std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -nan(ind) +*/ + /* + // Near singularity -exp(1) == -0.367879441171442321595523770161460867445811131031767834 + x = -0.367879; // Near -exp(1) = -0.367879 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -0.99845210378080340 + // N[productlog(-0.367879), 50] = -0.99845210378072725931829498030640227316856835774851 + x = -exp_minus_one(); // At exactly -exp(1). + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -1.0000000000000 + + x += std::numeric_limits::epsilon() ; // At nearly -exp(1). + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0000000000000 + + x = -exp_minus_one() + 100 * std::numeric_limits::epsilon() ; // At nearly -exp(1). + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0000000000000 + */ + // http://www.wolframalpha.com/input/?i=N%5Bproductlog%5B-0.367879%5D,17%5D test value N[productlog[-0.367879],17] + // -0.367879441171442321595523770161460867445811131031767834 + x = -0.367879; // < -exp(1) = -0.367879 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // Lambert W (-0.36787900000000001) = -0.99845210378080340 + // -0.99845210378080340 + // -0.99845210378072726 N[productlog[-0.367879],17] wolfram so very close. + + x = -0.3678794; // expect -0.99952696660756813 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + x = -0.36787944; // expect -0.99992019848408340 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + x = -0.367879441; // -0.99996947070054883 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + x = -0.36787944117; // -0.99999719977527159 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + x = -0.367879441171; // -0.99999844928821992 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + x = -0.3678794411714; // N[productlog[-0.3678794411714],17] == -0.99999952032930614 + std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + /* */ } catch (std::exception& ex) { diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 2170814e1..282072615 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -1,5 +1,5 @@ // Copyright Thomas Luu, 2014 -// Copyright Paul A. Bristow 2016 +// Copyright Paul A. Bristow 2016, 2017 // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or @@ -31,50 +31,41 @@ // https://github.com/thomasluu/plog/blob/master/plog.cu // for type double. -//#define BOOST_MATH_INSTRUMENT // #define for diagnostic output. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define for diagnostic output. #include #include #include #include -#include +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. -#include // fixed_point +#include // fixed_point, if required. +// Define the refinement algorithm NEWTON, #define NEWTON -#ifdef BOOST_MATH_INSTRUMENT -# include // Only for testing. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W +# include // Only needed for testing. #endif #include // numeric_limits Inf Nan ... -#include // exp -#include // is_integral - -// Define a temporary constant for exp(-1) for use in checks at the singularity. -// TODO make this a permanent constant (and also 1/6) -namespace boost -{ namespace math - { - namespace constants - { // constant exp(-1) = 0.367879441 is where x = -exp(-1) is a singularity. - BOOST_DEFINE_MATH_CONSTANT(expminusone, 3.67879441171442321595523770161460867e-01, "0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527"); - } - } -} +#include // exp function. +#include // is_integral trait namespace boost { namespace fixed_point { - //! \brief Specialization for log1p for fixed_point. + //! \brief Specialization for log1p for fixed_point types (in their own fixed_point namespace). - /*! \details This simple (and fast) approximation gives a result within a few epsilon/ULP of the nearest representable value. - This makes it suitable for use as a first approximation by the Lambert W function below. - It only uses (and thus relies on for accuracy of) the standard log function. - Refinement of the Lambert W estimate using Halley's method - seems to get quickly to high accuracy in a very few iterations, - so that small inaccuracy in the 1st appproximation are unimportant. - It avoid any Taylor series refinements that involve high powers of x - that would easily go outside the often limited range of fixed_point types. + /*! + \details This simple (and fast) approximation gives a result + within a few epsilon/ULP of the nearest representable value. + This makes it suitable for use as a first approximation by the Lambert W function below. + It only uses (and thus relies on for accuracy of) the standard log function. + Refinement of the Lambert W estimate using Halley's method + seems to get quickly to high accuracy in a very few iterations, + so that any small inaccuracy in the 1st appproximation is fairly unimportant. + It avoids any Taylor series refinements that involve high powers of x + that could easily go outside the often limited range of fixed-point types. */ template @@ -87,7 +78,7 @@ namespace boost { typedef negatable local_negatable_type; local_negatable_type unity(1); - // A fixed_point type night not include unity. Does something sensible happen? + // A fixed_point type might not include unity. Does something sensible happen? local_negatable_type u = unity + x; if (u == unity) { // @@ -96,7 +87,7 @@ namespace boost { else { local_negatable_type result = log(u) * (x / (u - unity)); -#ifdef BOOST_MATH_INSTRUMENT +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout << "log1p fp approx " << result << std::endl; #endif // For example: x = 0.5, HP 0.78843689, diff -1.52587891e-05 @@ -107,11 +98,13 @@ namespace boost { } //namespace fixed_point } // namespace boost - namespace local { + // Special versions of log1p that may be useful. + // log1p_dodgy version seems to work OK, but... - /* J M cautions that "The formula relies on: + /* John Maddock cautions that + "The formula relies on: 1) That the operations are not re-ordered. @@ -128,7 +121,7 @@ template T log1p_dodgy(T x) { // log(1+x) == (log(1+x) * x) / ((1-x) - 1) - T result = -(log(1 + x) * x) / ((1 - x) - 1); // From note in Boost.Math log1p + T result = -(log(1 + x) * x) / ((1 - x) - 1); // From note in Boost.Math log1p. // \boost\libs\math\include\boost\math\special_functions\log1p.hpp // Algorithm log1p is part of C99, but is not yet provided by many compilers. @@ -147,9 +140,10 @@ template T log1p(T x) { //! \brief log1p function. - //! This is probably faster than using boost::math::log1p (if a little less accurate) - //! and should be good enough for computing initial estimate. - //! \details Formula from a Note in + //! This is probably faster than using boost::math::log1p + // (if a little less accurate) and should be good enough for computing initial estimate. + + //! \details Formula for function log1p from a Note in // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c // HP - 15C Advanced Functions Handbook, p.193. // Assuming log() returns an accurate answer, @@ -163,8 +157,7 @@ T log1p(T x) // http://thepeg.hepforge.org/svn/tags/RELEASE_1_0/ThePEG/Utilities/Math.icc // double log1m(double x) { return log1p(-x);} - // - + // It might be possible to use Newton or Halley's method to refine this approximation? // But improvement may not be useful for estimating the Lambert W value because it is close enough // for the Halley's method to converge just as well as with a better initial estimate. @@ -190,11 +183,9 @@ T log1p(T x) << std::endl; // For example: x = 0.5, dodgy 0.788421631, HP 0.78843689, diff -1.52587891e-05 #endif - return result; } } // template T log1p(T x) - } // namespace local namespace boost @@ -210,16 +201,16 @@ namespace boost { BOOST_MATH_STD_USING // for ADL of std functions. - using boost::math::log1p; + using boost::math::log1p; // Other approximate implementations may also be used. using boost::math::constants::root_two; // 1.414 ... using boost::math::constants::e; // e(1) = 2.71828... using boost::math::constants::one_div_root_two; // 0.707106 - using boost::math::constants::expminusone; // 0.36787944 + using boost::math::constants::exp_minus_one; // 0.36787944 - std::cout.precision(std::numeric_limits ::max_digits10); + std::cout.precision(std::numeric_limits ::max_digits10); // Show all possibly significant digits. std::cout << std::showpoint << std::endl; // Show all trailing zeros. - // Catch the very common mistake of providing an integer value as parameter to productlog. + // Catch the very common mistake of providing an integer value as parameter x to productlog. // need to ensure it is a floating-point type (of the desired type, float 1.f, double 1., or long double 1.L), // or static_cast, for example: static_cast(1) or static_cast(1). // Want to allow fixed_point types too. @@ -232,37 +223,35 @@ namespace boost #endif // Check on range of x. - //std::cout << "-exp(-1) = " << -expminusone() << std::endl; - // https://www.wolframalpha.com/input/?i=-exp(-1)&wal=header N[-Exp[-1], 143] - // -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 - // Add to constants as expminusone - - // onesixth 0.1666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666... - - // Special case of -exp(-1)) // -0.3678794411714423215955237701614608674458111310 - // Can't use if (x < -exp(-1)) because 1-bit difference in accuracy of exp means is inconsistent. - // if (x < static_cast(-0.3678794411714423215955237701614608674458111310L) ) - if (x < -expminusone()) - { // If x < -0.367879 then W(x) would be complex (not handled with this implementation). - // Or might throw an exception? Use domain error for policy here. - - //std::cout << "Would be Complex " << x << ' ' << static_cast(-0.3678794411714423215955237701614608674458111310L) << " return NaN!" << std::endl; - return std::numeric_limits::quiet_NaN(); - } - //else if (x == static_cast(-0.3678794411714423215955237701614608674458111310)) - else if (x == -expminusone() ) - { - //std::cout << "At Singularity " << x << ' ' << static_cast(-0.3678794411714423215955237701614608674458111310L) << " returned " << static_cast(-1) << std::endl; - - return static_cast(-1); - } - if (x == 0) { // Special case of zero (for speed and to avoid log(0)and /0 etc). // TODO check that values very close to zero do not fail? return static_cast(0); } + //std::cout << "-exp(-1) = " << -expminusone() << std::endl; + // https://www.wolframalpha.com/input/?i=-exp(-1)&wal=header N[-Exp[-1], 143] + // -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 + // Added to Boost math constants as exp_minus_one + // Special case of -exp(-1)) // -0.3678794411714423215955237701614608674458111310 + // Can't use if (x < -exp(-1)) because 1-bit difference in accuracy of exp means is inconsistent. + // if (x < static_cast(-0.3678794411714423215955237701614608674458111310L) ) + if (x < -exp_minus_one()) + { // If x < -exp(-1)) then W(x) would be complex (not handled with this implementation). + // Or might throw an exception? Use domain error for policy here. + + // std::cout << "Would be Complex " << x << " so " << static_cast(-0.3678794411714423215955237701614608674458111310L) << " return NaN!" << std::endl; + // Would be Complex - 0.36787999999999998 so - 0.36787944117144233 return NaN! + // + return std::numeric_limits::quiet_NaN(); + } + else if (x == -exp_minus_one()) + { + std::cout << "At Singularity " << x << " == " << -exp_minus_one() << " returned " << static_cast(-1.) << std::endl; + // At Singularity -0.36787944117144233 == -0.36787944117144233 returned -1.0000000000000000 + return static_cast(-1); + } + RealType w0; // Upper branch W0 is divided in two regions: -1 <= w0_minus <=0 and 0 <= w0_plus. if (x > 0) @@ -310,6 +299,7 @@ namespace boost RealType diff = w0 * expw0 - x; // Difference from x. if (abs(diff) <= tolerance/4) { // Too close for Halley iteration to improve? + return w0; break; // Avoid oscillating forever around value. } @@ -323,7 +313,6 @@ namespace boost // so Newton unlikely to be quicker than additional computation cost of 2nd derivative. // Might use Newton if near to x ~= -exp(-1) == -0.367879 - // Halley's method from Luu equation 6.39, line 17. // https://en.wikipedia.org/wiki/Halley%27s_method // f''(w) = e^w (2 + w) , Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) @@ -333,7 +322,7 @@ namespace boost - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); // Luu equation 6.39. - if (fabs((w0 / w1) - 1) < tolerance) + if (fabs((w0 / w1) - static_cast(1)) < tolerance) { // Reached estimate of Lambert W within tolerance (usually an epsilon or few). break; } diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index db642d480..10b1ab70b 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -51,7 +51,6 @@ static const boost::array test_data = // } }; // array test_data - //! Show information about build, architecture, address model, platform, ... std::string show_versions() { @@ -122,21 +121,21 @@ void test_spots(RealType) using boost::math::productlog; - using boost::math::constants::expminusone; + using boost::math::constants::exp_minus_one; RealType tolerance = boost::math::tools::epsilon() * 5; // 5 eps as a fraction. std::cout << "Testing type " << typeid(RealType).name() << std::endl; std::cout << "Tolerance " << tolerance << std::endl; std::cout << "Precision " << std::numeric_limits::digits10 << " decimal digits." << std::endl; std::cout.precision(std::numeric_limits::digits10); std::cout << std::showpoint << std::endl; // show trailing significant zeros. - std::cout << "-exp(-1) = " << -expminusone() << std::endl; + std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl; std::cout.precision(std::numeric_limits ::max_digits10); RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176); RealType expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.); - test_value = -boost::math::constants::expminusone(); // -exp(-1) = -0.367879450 + test_value = -boost::math::constants::exp_minus_one(); // -exp(-1) = -0.367879450 std::cout << "test " << test_value << ", expected productlog = " << expected_value << std::endl; BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 @@ -223,7 +222,7 @@ exceeds 0.00015258789063 // This is very close to the limit of -exp(1) * x // (where the result has a non-zero imaginary part). - test_value = -expminusone(); + test_value = -exp_minus_one(); test_value += (std::numeric_limits::epsilon() * 100); expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.0); From c5ee664a51f298873502dc4a03440c1f52b5d249 Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 23 Mar 2017 14:15:37 +0000 Subject: [PATCH 08/71] Refactored with policies and passes tests and timing. --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 20 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 11 +- doc/html/indexes/s05.html | 35 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 53 +- example/lambert_w_diode.cpp | 8 +- example/lambert_w_diode_graph.cpp | 6 +- example/lambert_w_example.cpp | 96 ++-- .../math/special_functions/lambert_w.hpp | 419 ++++++++++------ include/boost/math/special_functions/next.hpp | 12 +- test/test_lambert_w.cpp | 451 ++++++++++-------- 15 files changed, 683 insertions(+), 438 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index 14f4446f8..e14350cbe 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -116,7 +116,7 @@ This manual is also available in -

    Last revised: December 06, 2016 at 18:29:35 GMT

    +

    Last revised: March 14, 2017 at 17:25:55 GMT

    diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 5de76a5f5..f6f20e0a8 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,8 +24,8 @@

    -Function Index

    -

    2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

    +Function Index
    +

    2 4 A B C D E F G H I J K L M N O P Q R S T U V X Y Z

    2 @@ -2833,6 +2833,15 @@

    typeid

    +
  • +

    types

    +
    +
    • U @@ -2966,13 +2975,6 @@
    -W -
    -
    -
    X
    • diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index a39ee1d15..84ef06d77 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

    -Class Index

    +Class Index

    A B C D E F G H I L M N O P Q R S T U W

    diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index ee8a36605..ef545751e 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

    -Typedef Index

    +Typedef Index

    A B C D E F G H I L N O P R S T U V W

    diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 3c84cd7b3..1a39469b4 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

    -Macro Index

    +Macro Index

    B F

    @@ -175,15 +175,6 @@
  • -

    BOOST_MATH_INSTRUMENT

    -
    -
    • -

  • BOOST_MATH_INSTRUMENT_CODE

    • diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 3bef0cf97..bdbda607d 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

    -Index

    +Index

    2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

    @@ -639,7 +639,6 @@

  • BOOST_MATH_BUGGY_LARGE_FLOAT_CONSTANTS

  • BOOST_MATH_CONTROL_FP

  • BOOST_MATH_DISABLE_FLOAT128

    • -

  • BOOST_MATH_INSTRUMENT

  • BOOST_MATH_INSTRUMENT_CODE

  • BOOST_MATH_INSTRUMENT_FPU

  • BOOST_MATH_INSTRUMENT_VARIABLE

    • @@ -809,15 +808,6 @@
  • -

    BOOST_MATH_INSTRUMENT

    -
    -
    • -

  • BOOST_MATH_INSTRUMENT_CODE

    • @@ -1761,6 +1751,10 @@
  • +

    Conceptual Archetypes for Reals and Distributions

    +
    +
    • +

  • Conceptual Requirements for Distribution Types

  • @@ -4729,7 +4724,6 @@
  • @@ -4926,7 +4920,6 @@

    Locating Function Minima using Brent's algorithm

    @@ -7375,10 +7374,6 @@
    • -

      W

      -
      -
      • -

    • weibull

      • diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index b173038d7..c41952c2b 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

    - +

    This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 1d05e79b0..0752ffb0d 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

    - +

    Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index a96138696..72cb346b7 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -18,14 +18,15 @@ [h4:description Description] -The __Lambert_W is the solution of the equation `W e[super W] = x`. +The __Lambert_W is the solution of the equation W[dot]e[super W] = x. +It is also called the Omega function, the inverse function of f(W) = W e[super W]. On the x-interval \[0, [inf]\] there is just one real solution. -On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W-1, Wp, Wm, -only one, the so-called principal branch w0, Wp, is provided by this implementation. +On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W-1, Wp, Wm. +Only one, the so-called principal branch W0 or Wp, is provided by this implementation. -The function is described in Wolfram Mathworld [@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function] ], -and the principal value of the Lambert W-function is implemented in the Wolfram Language as ProductLog[z]. +The function is described in Wolfram Mathworld [@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function] ]. +The principal value of the Lambert W-function is implemented in the Wolfram Language as ProductLog[z]. __WolframAlpha has provided some reference values for testing. For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651. @@ -49,9 +50,10 @@ The source of this example is at [@../../example/lambert_w_example.cpp lambert_w [h4:accuracy Accuracy] -All the functions usually return values within one ULP (unit in the last place) for the floating-point type. -Values of x close to the boundary of real values at `x ~= -exp(-1))`, -about -0.367879 may be less accurate as they near the boundary. +All the functions usually return values within two ULP (unit in the last place) for the floating-point type. +Values of x close to the boundary of real values at `x ~= -exp(-1))`, about -0.367879, +approach the singularity result of -1, +but never more accurate than `1 - sqrt(epsilon)`, for `double`, about 0.99999999. [h4:implemention Implementation] @@ -62,8 +64,27 @@ This implementation is based on Thomas Luu's code posted at [@https://svn.boost.org/trac/boost/ticket/11027 Boost Trac \#11027]. It has been implemented from Luu's algorithm but templated on RealType parameter and result -and handles both __fundamental (float, double, long double), __multiprecision, -and also has been tested with the proposed fixed_point type. +and handles both __fundamental_types (float, double, long double), __multiprecision, +and also has been tested with a proposed fixed_point type. + +A first approximation is computed using the method of Barry et al (see references 5 & 6 below). +(For users only requiring an accuracy of relative accuracy of 0.02%, this function might suffice). + +We considered using [@https://en.wikipedia.org/wiki/Newton%27s_method Newton/Raphson's method] +`` + f(w) = w e^w -z = 0 // Luu equation 6.37 + f'(w) = e^w (1 + w), Wolfram alpha (d)/(dw)(f(w) = w exp(w) - z) = e^w (w + 1) + if (f(w) / f'(w) -1 < tolerance + w1 = w0 - (expw0 * (w0 + 1)); // Refine new Newton/Raphson estimate. +`` +but concluded that since Newton/Raphson's method takes typically 6 iterations to converge within tolerance, +whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ULP, +so Newton/Raphson's method unlikely to be quicker +than the additional cost of computating the 2nd derivative for Halley's method. + +The implementation details are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] + +[h5 Other implmentations] The Lambert W has also been discussed in a [@http://lists.boost.org/Archives/boost/2016/09/230819.php Boost thread]. This also gives link to a prototype version by which also handles complex results [^(x < -exp(-1)], about -0.367879). @@ -74,7 +95,6 @@ has also produces a prototype C++ library that can compute the Lambert W functio [*and complex number types]. This is not implemented here but might be completed in the future. -The implementation details are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] [h4:references References] @@ -84,6 +104,15 @@ The implementation details are in [@../../include/boost/math/special_functions/l R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffery and D. E. Knuth, On the Lambert W function Advances in Computational Mathematics, Vol 5, (1996) pp 329-359. +# [@https://people.sc.fsu.edu/~jburkardt/f_src/toms443/toms443.html TOMS443], +Andrew Barry, S. J. Barry, Patricia Culligan-Hensley, +Algorithm 743: WAPR - A Fortran routine for calculating real values of the W-function,[br] +ACM Transactions on Mathematical Software, Volume 21, Number 2, June 1995, pages 172-181.[br] +BISECT approximates the W function using bisection (GNU licence). +Original FORTRAN77 version by Andrew Barry, S. J. Barry, Patricia Culligan-Hensley, +this version by C++ version by John Burkardt. +# [@https://people.sc.fsu.edu/~jburkardt/f_src/toms743/toms743.html TOMS743] Fortran 90 (updated 2014). + Initial guesses based on: # D.A. Barry, J.-Y. Parlange, L. Li, H. Prommer, C.J. Cunningham, and @@ -94,6 +123,8 @@ W-function. Mathematics and Computers in Simulation, 53(1):95-103, 2000. F. Stagnitti. Erratum to analytical approximations for real values of the Lambert W-function. Mathematics and Computers in Simulation, 59(6):543-543, 2002. +A PDF of the full [@http://www.paper.edu.cn/scholar/downpaper/liling116674-201210-19 paper] is available. + # C++ __CUDA version of Luu algorithm, [@https://github.com/thomasluu/plog/blob/master/plog.cu plog]. # __Luu_thesis, see routine 11, page 98 for Lambert W algorithm. diff --git a/example/lambert_w_diode.cpp b/example/lambert_w_diode.cpp index 6a06663ba..9686c9c7a 100644 --- a/example/lambert_w_diode.cpp +++ b/example/lambert_w_diode.cpp @@ -27,7 +27,7 @@ */ #include -using boost::math::productlog; +using boost::math::lambert_w; #include // using std::cout; @@ -89,7 +89,7 @@ rsat reverse saturation current double iv(double v, double vt, double rsat, double re, double isat, double nu = 1.) { // V thermal 0.0257025 = 25 mV - // was double i = (nu * vt/r) * productlog((i0 * r) / (nu * vt)); equ 5. + // was double i = (nu * vt/r) * lambert_w((i0 * r) / (nu * vt)); equ 5. rsat = rsat + re; double i = nu * vt / rsat; @@ -104,7 +104,7 @@ double iv(double v, double vt, double rsat, double re, double isat, double nu = double e = exp(eterm); std::cout << "exp(eterm) = " << e << std::endl; - double w0 = productlog(x * e); + double w0 = lambert_w(x * e); std::cout << "w0 = " << w0 << std::endl; return i * w0 - isat; @@ -121,7 +121,7 @@ int main() //[lambert_w_diode_example_1 double x = 0.01; - //std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.00990147 + //std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.00990147 double nu = 1.0; // Assumed ideal. double vt = v_thermal(25); // v thermal, Shockley equation, expect about 25 mV at room temperature. diff --git a/example/lambert_w_diode_graph.cpp b/example/lambert_w_diode_graph.cpp index df6c5a8e2..84ba6f6b8 100644 --- a/example/lambert_w_diode_graph.cpp +++ b/example/lambert_w_diode_graph.cpp @@ -28,7 +28,7 @@ http://www3.imperial.ac.uk/pls/portallive/docs/1/7292572.PDF */ #include -using boost::math::productlog; +using boost::math::lambert_w; #include using boost::math::isfinite; @@ -107,7 +107,7 @@ double i(double isat, double vd, double vt, double nu) double iv(double v, double vt, double rsat, double re, double isat, double nu = 1.) { // V thermal 0.0257025 = 25 mV - // was double i = (nu * vt/r) * productlog((i0 * r) / (nu * vt)); equ 5. + // was double i = (nu * vt/r) * lambert_w((i0 * r) / (nu * vt)); equ 5. rsat = rsat + re; double i = nu * vt / rsat; @@ -122,7 +122,7 @@ double iv(double v, double vt, double rsat, double re, double isat, double nu = double e = exp(eterm); // std::cout << "exp(eterm) = " << e << std::endl; - double w0 = productlog(x * e); + double w0 = lambert_w(x * e); // std::cout << "w0 = " << w0 << std::endl; return i * w0 - isat; diff --git a/example/lambert_w_example.cpp b/example/lambert_w_example.cpp index 9083a6a08..88a1fb13a 100644 --- a/example/lambert_w_example.cpp +++ b/example/lambert_w_example.cpp @@ -14,8 +14,7 @@ #include // boost::exception #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. - -// #define BOOST_MATH_INSTRUMENT_LAMBERT_W +#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for diagnostic output. // For lambert_w function. #include @@ -78,14 +77,13 @@ std::string show_versions() return message.str(); } // std::string versions() - int main() { try { //std::cout << "Lambert W example basic!" << std::endl; //std::cout << show_versions() << std::endl; - + //std::cout << exp(1) << std::endl; // 2.71828 //std::cout << exp(-1) << std::endl; // 0.367879 //std::cout << std::numeric_limits::epsilon() / 2 << std::endl; // 1.11022e-16 @@ -94,19 +92,19 @@ int main() using boost::math::constants::exp_minus_one; double x = 1.; - double W1 = productlog(1.); - // Note, NOT integer X, for example: productlog(1); or will get message like + double W1 = lambert_w(1.); + // Note, NOT integer X, for example: lambert_w(1); or will get message like // error C2338: Must be floating-point, not integer type, for example W(1.), not W(1)! // - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.567143 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.567143 // This 'golden ratio' for exponentials is http://mathworld.wolfram.com/OmegaConstant.html // since exp[-W(1)] = W(1) // A030178 Decimal expansion of LambertW(1): the solution to x*exp(x) // = 0.5671432904097838729999686622103555497538157871865125081351310792230457930866 // http://oeis.org/A030178 - double expplogone = exp(-productlog(1.)); + double expplogone = exp(-lambert_w(1.)); if (expplogone != W1) { std::cout << expplogone << " " << W1 << std::endl; // @@ -114,50 +112,76 @@ int main() //[lambert_w_example_1 - /* + x = 0.01; - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.00990147 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.00990147 //] [/lambert_w_example_1] x = -0.01; - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -0.0101015 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // -0.0101015 x = -0.1; - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -*/ + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // + /**/ - /* - // Near singularity -exp(1) == -0.367879441171442321595523770161460867445811131031767834 - x = -0.367879; // Near -exp(1) = -0.367879 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -0.99845210378080340 - // N[productlog(-0.367879), 50] = -0.99845210378072725931829498030640227316856835774851 - x = -exp_minus_one(); // At exactly -exp(1). - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // -1.0000000000000 + for (double xd = 1.; xd < 1e20; xd *= 10) + { - x += std::numeric_limits::epsilon() ; // At nearly -exp(1). - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0000000000000 - - x = -exp_minus_one() + 100 * std::numeric_limits::epsilon() ; // At nearly -exp(1). - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0000000000000 - */ - // http://www.wolframalpha.com/input/?i=N%5Bproductlog%5B-0.367879%5D,17%5D test value N[productlog[-0.367879],17] + // 1. 0.56714329040978387 + // 0.56714329040978384 + + // 10 1.7455280027406994 + // 1.7455280027406994 + + // 100 3.3856301402900502 + // 3.3856301402900502 + // 1000 5.2496028524015959 + // 5.249602852401596227126056319697306282521472386059592844451465483991362228320942832739693150854347718 + + // 1e19 40.058769161984308 + // 40.05876916198431163898797971203180915622644925765346546858291325452428038208071849105889199253335063 + std::cout << "Lambert W (" << xd << ") = " << lambert_w(xd) << std::endl; // + } + // + // Test near singularity. + + // http://www.wolframalpha.com/input/?i=N%5Blambert_w%5B-0.367879%5D,17%5D test value N[lambert_w[-0.367879],17] // -0.367879441171442321595523770161460867445811131031767834 x = -0.367879; // < -exp(1) = -0.367879 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // Lambert W (-0.36787900000000001) = -0.99845210378080340 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // Lambert W (-0.36787900000000001) = -0.99845210378080340 // -0.99845210378080340 - // -0.99845210378072726 N[productlog[-0.367879],17] wolfram so very close. + // -0.99845210378072726 N[lambert_w[-0.367879],17] wolfram so very close. x = -0.3678794; // expect -0.99952696660756813 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.0 x = -0.36787944; // expect -0.99992019848408340 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.0 x = -0.367879441; // -0.99996947070054883 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.0 x = -0.36787944117; // -0.99999719977527159 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.0 x = -0.367879441171; // -0.99999844928821992 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 - x = -0.3678794411714; // N[productlog[-0.3678794411714],17] == -0.99999952032930614 - std::cout << "Lambert W (" << x << ") = " << productlog(x) << std::endl; // 0.0 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.0 + + x = -exp_minus_one() + std::numeric_limits::epsilon(); + // Lambert W (-0.36787944117144211) = -0.99999996349975895 + // N[lambert_w[-0.36787944117144211],17] == -0.99999996608315303 + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.0 + std::cout << " 1 - sqrt(eps) = " << static_cast(1) - sqrt(std::numeric_limits::epsilon()) << std::endl; + x = -exp_minus_one(); + // N[lambert_w[-0.36787944117144233],17] == -1.000000000000000 + 6.7595465843924897×10^-9 i + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.0 + // At Singularity - 0.36787944117144233 == -0.36787944117144233 returned - 1.0000000000000000 + // Lambert W(-0.36787944117144233) = -1.0000000000000000 + + + x = (std::numeric_limits::max)()/4; + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // OK 702.023799146706 + x = (std::numeric_limits::max)()/2; + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // + x = (std::numeric_limits::max)(); + std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // + // Error in function boost::math::log1p(double): numeric overflow /* */ + } catch (std::exception& ex) { diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 282072615..f711b57aa 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -31,30 +31,40 @@ // https://github.com/thomasluu/plog/blob/master/plog.cu // for type double. -//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define for diagnostic output. + +#ifndef BOOST_MATH_SF_LAMBERT_W_HPP +#define BOOST_MATH_SF_LAMBERT_W_HPP + +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // Only #define for Lambert W diagnostic output. + +int total_iterations = 0; +int total_calls = 0; +int max_iterations = 0; #include #include #include -#include +#include // for log (1 + x) #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. +#include // for float_distance +#include #include // fixed_point, if required. - -// Define the refinement algorithm NEWTON, -#define NEWTON +#if defined (BOOST_MSVC) +# pragma warning(push) +# pragma warning(disable: 4127) // conditional expression is constant +#endif #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W # include // Only needed for testing. #endif -#include // numeric_limits Inf Nan ... +#include // numeric_limits infinity & NaN, for diagnostic max_digits10 and digits10 ... #include // exp function. -#include // is_integral trait +#include // is_integral trait. namespace boost { namespace fixed_point { - - //! \brief Specialization for log1p for fixed_point types (in their own fixed_point namespace). + //! \brief Specialization for log1p for fixed_point types (in its own fixed_point namespace). /*! \details This simple (and fast) approximation gives a result @@ -63,7 +73,7 @@ namespace boost { It only uses (and thus relies on for accuracy of) the standard log function. Refinement of the Lambert W estimate using Halley's method seems to get quickly to high accuracy in a very few iterations, - so that any small inaccuracy in the 1st appproximation is fairly unimportant. + so that any small inaccuracy in the 1st approximation is fairly unimportant. It avoids any Taylor series refinements that involve high powers of x that could easily go outside the often limited range of fixed-point types. */ @@ -78,7 +88,7 @@ namespace boost { typedef negatable local_negatable_type; local_negatable_type unity(1); - // A fixed_point type might not include unity. Does something sensible happen? + // A fixed_point type might not include unity. Does something sensible happen? local_negatable_type u = unity + x; if (u == unity) { // @@ -101,7 +111,7 @@ namespace boost { namespace local { // Special versions of log1p that may be useful. - + // log1p_dodgy version seems to work OK, but... /* John Maddock cautions that "The formula relies on: @@ -137,11 +147,12 @@ T log1p_dodgy(T x) } // template T log1p(T x) template +inline T log1p(T x) { //! \brief log1p function. - //! This is probably faster than using boost::math::log1p - // (if a little less accurate) and should be good enough for computing initial estimate. + //! This is probably faster than using boost::math::log1p (if a little less accurate) + // but should be good enough for computing Lambert_w initial estimate. //! \details Formula for function log1p from a Note in // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c @@ -157,9 +168,9 @@ T log1p(T x) // http://thepeg.hepforge.org/svn/tags/RELEASE_1_0/ThePEG/Utilities/Math.icc // double log1m(double x) { return log1p(-x);} - - // It might be possible to use Newton or Halley's method to refine this approximation? - // But improvement may not be useful for estimating the Lambert W value because it is close enough + + // It is probably possible to use Newton or Halley's method to refine this approximation, + // but improvement is probably not useful for estimating the Lambert W value because it is close enough // for the Halley's method to converge just as well as with a better initial estimate. T unity; @@ -173,8 +184,8 @@ T log1p(T x) { T result = log(u) * (x / (u - unity)); //T dodgy = log1p_dodgy(x); - double dx = static_cast(x); - double lp1x = log1p(dx); + //double dx = static_cast(x); + //double lp1x = log1p(dx); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout << "true " << lp1x << ", log1p_fp " << log1p(x) @@ -192,156 +203,260 @@ namespace boost { namespace math { - //! \brief Lambert W function. + + namespace detail + { + //! First approximation of Lambert W function. + //! \details Based on Thomas Luu, Thesis (2016) and Barry et al. + //! Notes refer to equations, page 96-98 and C++ code from algorithm Routine 11. + // Assumes parameter x has been checked before call. + // This function might be useful if the user only requires an approximate result quickly. + template + inline + RealType lambert_w_approx(RealType x) + { + BOOST_MATH_STD_USING // for ADL of std functions. + using boost::math::constants::e; // e(1) = 2.71828... + using boost::math::constants::root_two; // 1.414 ... + using boost::math::constants::one_div_root_two; // 0.707106 + + RealType w0; + // Upper branch W0 is divided in two regions: -1 <= w0_minus <=0 and 0 <= w0_plus. + if (x > 0) + { // Luu Routine 11, line 8, and equation 6.44, from Barry et al. + // (1.2 and 2.4 are 'exact' from integer fractions 6/5 and 12/5). + w0 = log(static_cast(1.2L) * x / log(static_cast(2.4L) * x / log1p(static_cast(2.4L) * x))); + // local::log1p does seem to refine OK with multiprecision. + } + else + { // > -exp(-1) or > -0.367879 + // so for real result need x > -0.367879 >= 0 + RealType sqrt_v = root_two() * sqrt(static_cast(1) + e() * x); // nu = sqrt(2 + 2e * z) Line 10. + RealType n2 = static_cast(3) * root_two() + static_cast(6); // 3 * sqrt(2) + 6, Line 11. + // == 10.242640687119285146 + RealType n2num = (static_cast(2237) + (static_cast(1457) * root_two())) * e() + - (static_cast(4108) * root_two()) - static_cast(5764); // Numerator Line 11. + + RealType n2denom = (static_cast(215) + (static_cast(199) * root_two())) * e() + - (430 * root_two()) - static_cast(796); // Denominator Line 11. + RealType nn2 = n2num / n2denom; // Line 11 full fraction. + nn2 *= sqrt_v; // Line 11 last part. + n2 -= nn2; // Line 11 complete, equation 6.44, from Barry et al (erratum). + RealType n1 = (static_cast(1) - one_div_root_two()) * (n2 + root_two()); // Line 12. + + w0 = -1 + sqrt_v * (n2 + sqrt_v) / (n2 + sqrt_v + n1 * sqrt_v); // W0 1st approximation, Line 13, equation 6.40. + } + return w0; + } // template RealType lambert_w_approx(RealType x) + + //! \brief Lambert W function implementation. //! \details Based on Thomas Luu, Thesis (2016). //! Notes refer to equations, page 96-98 and C++ code from algorithm Routine 11. + template > + RealType lambert_w_imp(RealType x, const Policy& /* pol */) + { + BOOST_MATH_STD_USING // for ADL of std functions. - template > - RealType productlog(RealType x) - { - BOOST_MATH_STD_USING // for ADL of std functions. + //using boost::math::log1p; // Other approximate implementations may also be used. + using local::log1p; + //using boost::math::constants::root_two; // 1.414 ... + //using boost::math::constants::e; // e(1) = 2.71828... + //using boost::math::constants::one_div_root_two; // 0.707106 + using boost::math::constants::exp_minus_one; // 0.36787944 + using boost::math::tools::max_value; - using boost::math::log1p; // Other approximate implementations may also be used. - using boost::math::constants::root_two; // 1.414 ... - using boost::math::constants::e; // e(1) = 2.71828... - using boost::math::constants::one_div_root_two; // 0.707106 - using boost::math::constants::exp_minus_one; // 0.36787944 - - std::cout.precision(std::numeric_limits ::max_digits10); // Show all possibly significant digits. - std::cout << std::showpoint << std::endl; // Show all trailing zeros. - - // Catch the very common mistake of providing an integer value as parameter x to productlog. - // need to ensure it is a floating-point type (of the desired type, float 1.f, double 1., or long double 1.L), - // or static_cast, for example: static_cast(1) or static_cast(1). - // Want to allow fixed_point types too. - BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point, not integer type, for example W(1.), not W(1)!"); + // Catch the very common mistake of providing an integer value as parameter x to lambert_w. + // need to ensure it is a floating-point type (of the desired type, float 1.f, double 1., or long double 1.L), + // or static_cast, for example: static_cast(1) or static_cast(1). + // Want to allow fixed_point types too. + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point type (not integer type), for example: W(1.), not W(1)!"); + total_calls++; // Temporary for testing. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << std::showpoint << std::endl; // Show all trailing zeros. - //std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits. - std::cout.precision(std::numeric_limits::digits10); // Show all significant digits. + std::cout << std::showpoint << std::endl; // Show all trailing zeros. + std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits (17 for double). + //std::cout.precision(std::numeric_limits::digits10); // Show all significant digits (15 for double). #endif - // Check on range of x. - - if (x == 0) - { // Special case of zero (for speed and to avoid log(0)and /0 etc). - // TODO check that values very close to zero do not fail? - return static_cast(0); - } - //std::cout << "-exp(-1) = " << -expminusone() << std::endl; - // https://www.wolframalpha.com/input/?i=-exp(-1)&wal=header N[-Exp[-1], 143] - // -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 - // Added to Boost math constants as exp_minus_one - - // Special case of -exp(-1)) // -0.3678794411714423215955237701614608674458111310 - // Can't use if (x < -exp(-1)) because 1-bit difference in accuracy of exp means is inconsistent. - // if (x < static_cast(-0.3678794411714423215955237701614608674458111310L) ) - if (x < -exp_minus_one()) - { // If x < -exp(-1)) then W(x) would be complex (not handled with this implementation). - // Or might throw an exception? Use domain error for policy here. - - // std::cout << "Would be Complex " << x << " so " << static_cast(-0.3678794411714423215955237701614608674458111310L) << " return NaN!" << std::endl; - // Would be Complex - 0.36787999999999998 so - 0.36787944117144233 return NaN! - // - return std::numeric_limits::quiet_NaN(); - } - else if (x == -exp_minus_one()) - { - std::cout << "At Singularity " << x << " == " << -exp_minus_one() << " returned " << static_cast(-1.) << std::endl; - // At Singularity -0.36787944117144233 == -0.36787944117144233 returned -1.0000000000000000 - return static_cast(-1); - } - - RealType w0; - // Upper branch W0 is divided in two regions: -1 <= w0_minus <=0 and 0 <= w0_plus. - if (x > 0) - { // Luu Routine 11, line 8, and equation 6.44, from Barry et al. - // (1.2 and 2.4 are 'exact' from integer fractions 6/5 and 12/5). - w0 = log(static_cast(1.2L) * x / log(static_cast(2.4L) * x / log1p(static_cast(2.4L) * x))); - //w0 = log(static_cast(1.2L) * x / log(static_cast(2.4L) * x / local::log1p(static_cast(2.4L) * x))); - // local::log1p does seem to refine OK with multiprecision. - } - else - { // > -exp(-1) or > -0.367879 - // so for real result need x > -0.367879 >= 0 - // Might treat near -exp(-1) == -0.367879 values differently as approximations may not quite converge? - - RealType sqrt_v = root_two() * sqrt(static_cast(1) + e() * x); // nu = sqrt(2 + 2e * z) Line 10. - - RealType n2 = static_cast(3) * root_two() + static_cast(6); // 3 * sqrt(2) + 6, Line 11. - // == 10.242640687119285146 - - RealType n2num = (static_cast(2237) + (static_cast(1457) * root_two())) * e() - - (static_cast(4108) * root_two()) - static_cast(5764); // Numerator Line 11. - - RealType n2denom = (static_cast(215) + (static_cast(199) * root_two())) * e() - - (430 * root_two()) - static_cast(796); // Denominator Line 11. - RealType nn2 = n2num / n2denom; // Line 11 full fraction. - nn2 *= sqrt_v; // Line 11 last part. - n2 -= nn2; // Line 11 complete, equation 6.44, from Barry et al (erratum). - RealType n1 = (static_cast(1) - one_div_root_two()) * (n2 + root_two()); // Line 12. - - w0 = -1 + sqrt_v * (n2 + sqrt_v) / (n2 + sqrt_v + n1 * sqrt_v); // W0 1st approximation, Line 13, equation 6.40. - } - - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - // std::cout << "\n1st approximation = " << w0 << std::endl; - #endif - - int iterations = 0; - RealType tolerance = 3 * std::numeric_limits::epsilon(); - RealType w1(0); - - while (iterations <= 5) - { // Iterate a few times to refine value using Halley's method. - RealType expw0 = exp(w0); // Compute from best W estimate so far. - // Hope that w0 * expw0 == x; - RealType diff = w0 * expw0 - x; // Difference from x. - if (abs(diff) <= tolerance/4) - { // Too close for Halley iteration to improve? - return w0; - break; // Avoid oscillating forever around value. + // Check on range of x. + if (x == 0) + { // Special case of zero (for speed and to avoid log(0)and /0 etc). + return static_cast(0); } + if (!boost::math::isfinite(x)) + { // Check x is finite. + return policies::raise_domain_error( + "boost::math::lambert_w<%1%>", + "The parameter %1% is not finite, so the return value is NaN.", + x, + Policy()); + } // (!boost::math::isfinite(x)) - // Newton/Raphson's method https://en.wikipedia.org/wiki/Newton%27s_method - // f(w) = w e^w -z = 0 Luu equation 6.37 - // f'(w) = e^w (1 + w), Wolfram alpha (d)/(dw)(f(w) = w exp(w) - z) = e^w (w + 1) - // f(w) / f'(w) - // w1 = w0 - (expw0 * (w0 + 1)); // Refine new Newton/Raphson estimate. - // Takes typically 6 iterations to converge within tolerance, - // whereas Halley usually takes 1 to 3 iterations, - // so Newton unlikely to be quicker than additional computation cost of 2nd derivative. - // Might use Newton if near to x ~= -exp(-1) == -0.367879 - // Halley's method from Luu equation 6.39, line 17. - // https://en.wikipedia.org/wiki/Halley%27s_method - // f''(w) = e^w (2 + w) , Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) - // f''(w) / f'(w) = (2+w) / (1+w), Luu equation 6.38. + if (x > boost::math::tools::max_value() / 4) + { // Would throw exception "Error in function boost::math::log1p(double): numeric overflow" + return policies::raise_overflow_error( + "boost::math::lambert_w<%1%>", + "The parameter %1% is too large, so the return value is NaN.", + x, Policy() ); + // Exception Error in function boost::math::lambert_w: The parameter 4.6180304784183997e+307 is too large, so the return value is NaN. + } + //std::cout << "-exp(-1) = " << -expminusone() << std::endl; + // https://www.wolframalpha.com/input/?i=-exp(-1)&wal=header N[-Exp[-1], 143] + // -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 + // Added to Boost math constants as exp_minus_one - w1 = w0 // Refine new Halley estimate. + // Special case of -exp(-1)) // -0.3678794411714423215955237701614608674458111310 + // Can't use if (x < -exp(-1)) because 1-bit difference in accuracy of exp means is inconsistent. + // if (x < static_cast(-0.3678794411714423215955237701614608674458111310L) ) + + if (x == -exp_minus_one()) + { // At Singularity -0.36787944117144233 == -0.36787944117144233 returned -1.0000000000000000 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + std::cout << "At Singularity " << x << " == " << -exp_minus_one() << " returned " << static_cast(-1.) << std::endl; +#endif + return static_cast(-1); + } + else if (x < -exp_minus_one()) // -0.3678794411714423215955237701614608674458111310L + { // If x < -exp(-1)) then W(x) would be complex (not handled with this implementation). + return policies::raise_domain_error( + "boost::math::lambert_w<%1%>", + "The parameter %1% would give a complex result, so the return value is NaN.", + x, + // "Function boost::math::lambert_w: The parameter -0.36787945032119751 would give a complex result, so the return value is NaN." + Policy()); + } + + using boost::math::detail::lambert_w_approx; + RealType w0 = lambert_w_approx(x); + if (!boost::math::isfinite(w0)) + { // 1st Approximation is not finite, so quit. + return std::numeric_limits::quiet_NaN(); + } + int iterations = 1; + RealType tolerance = 2 * std::numeric_limits::epsilon(); + RealType w1; // Refined estimate. + RealType previous_diff = boost::math::tools::max_value(); + do + { // Iterate a few times to refine value using Halley's method. + // Now inline Halley iteration. + // We do this here rather than calling tools::halley_iterate since we can + // simplify the expressions algebraically, and don't need most of the error + // checking of the boilerplate version as we know in advance that the function + // is well behaved... + + RealType expw0 = exp(w0); // Compute from best Lambert W estimate so far. + // Hope that w0 * expw0 == x; + RealType diff = (w0 * expw0) - x; // Absolute difference from x. + /* + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + if(iterations == 0) + { + std::cout << "Argument x = " << x << ", 1st approximation = " << w0 << ", " ; + } + else + { + std::cout << "Estimate " << w1 << " refined after " << iterations << " iterations, " ; + } + if (diff != 0) + { + std::cout << "(w0 * expw0) - x = " << diff << ", relative " << ((w0 / w1) - static_cast(1)) << std::endl; // improvement. + } + else + { + std::cout << "Exact." << std::endl; + } + #endif + */ // Halley's method from Luu equation 6.39, line 17. + // https://en.wikipedia.org/wiki/Halley%27s_method + // f''(w) = e^w (2 + w) , Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) + // f''(w) / f'(w) = (2+w) / (1+w), Luu equation 6.38. + + w1 = w0 // Refine a new estimate using Halleys' method. - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); // Luu equation 6.39. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Iteration #" << iterations << ", w0 " << w0 << ", w1 = " << w1; + + if (diff != static_cast(0)) + { + std::cout << ", difference = " << w1 - w0 + << ", relative " << ((w0 / w1) - static_cast(1)) + << ", float distance = " << abs(float_distance((w0 * expw0), x)) << std::endl; + } + else + { + std::cout << ", exact." << std::endl; + } + std::cout << "f'(x) = " << diff / (expw0 * (w0 + 1)) << ", f''(x) = " << -diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))) << std::endl; +#endif + + iterations++; + if (iterations > max_iterations) + { + max_iterations = iterations; + + } + total_iterations++; + if ( // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few). + (fabs((w0 / w1) - static_cast(1)) < tolerance) + || // Latest estimate is not better, or worse, so avoid oscillating result (common when near singularity). + (abs(diff) >= abs(previous_diff)) + ) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + std::cout << "\nReturn refined " << w1 << " after " << iterations << " iterations"; + if (diff != static_cast(0)) + { + std::cout << ", difference = " << ((w0 / w1) - static_cast(1)); + std::cout << ", Float distance = " << boost::math::float_distance(w0, w1) << std::endl; + } + else + { + std::cout << ", exact." << std::endl; + } +#endif + return w1; // OK + } + + w0 = w1; + previous_diff = diff; // Remember so that can check if new estimate is better. + } while (iterations <= 10); + +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + std::cout << "Not within tolerance " << w1 << " after " << iterations << " iterations" << ", difference = " << previous_diff << std::endl; +#endif + if (iterations > max_iterations) + { + max_iterations = iterations; - if (fabs((w0 / w1) - static_cast(1)) < tolerance) - { // Reached estimate of Lambert W within tolerance (usually an epsilon or few). - break; } + return w1; + } // lambert_w_imp + } // namespace detail -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout.precision(std::numeric_limits::digits10); - std::cout <<"Iteration #" << iterations << ", w0 " << w0 << ", w1 = " << w1 << ", difference = " << diff << ", relative " << (w0 / w1 - static_cast(1)) << std::endl; - std::cout << "f'(x) = " << diff / (expw0 * (w0 + 1)) << ", f''(x) = " << - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))) << std::endl; - //std::cout << "Newton new = " << wn << std::endl; -#endif - w0 = w1; - iterations++; - } // while + // User functions. + + // User defined policy. + template + inline typename tools::promote_args::type lambert_w(T z, const Policy& pol) + { + // Don't think we want/need to promote arguments? Produces very odd results at singularity. + // typedef typename tools::promote_args::type result_type; + //typedef typename policies::evaluation::type value_type; + // return static_cast(detail::lambert_w_imp(value_type(z), pol)); + return detail::lambert_w_imp(z, pol); + } + + // Default policy. + template + inline typename tools::promote_args::type lambert_w(T z) + { + return lambert_w(z, policies::policy<>()); + } -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "Final " << w1 << " after " << iterations << " iterations" << ", difference = " << (w0 / w1 - static_cast(1)) << std::endl; -#endif - return w1; - } // } // namespace math } // namespace boost + +#endif // BOOST_MATH_SF_LAMBERT_W_HPP diff --git a/include/boost/math/special_functions/next.hpp b/include/boost/math/special_functions/next.hpp index 3921b70ce..20941fe48 100644 --- a/include/boost/math/special_functions/next.hpp +++ b/include/boost/math/special_functions/next.hpp @@ -339,6 +339,7 @@ T float_distance_imp(const T& a, const T& b, const Policy& pol) if(b > upper) { result = float_distance(upper, b); + // std::cout << "float_distance(upper, b); result " << result << ", floor(result) = " << floor(result) << std::endl; } // // Use compensated double-double addition to avoid rounding @@ -373,11 +374,18 @@ T float_distance_imp(const T& a, const T& b, const Policy& pol) x = -x; y = -y; } + + //std::cout << "ldexp(x, expon) " << ldexp(x, expon) << ", ldexp(y, expon) = " << ldexp(y, expon) << std::endl; result += ldexp(x, expon) + ldexp(y, expon); // // Result must be an integer: - // - BOOST_ASSERT(result == floor(result)); + //if (result != floor(result)) + //{ See https://svn.boost.org/trac/boost/ticket/12908 + // std::cout << "result " << result << ", floor(result) = " << floor(result) << std::endl; + // std::cout << "Float_distance parameter a " << a << ", b = " << b << std::endl; + //} + //BOOST_ASSERT(result == floor(result)); + // Reported Trac return result; } // float_distance_imp diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 10b1ab70b..4f48811e3 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -7,7 +7,7 @@ // or copy at http://www.boost.org/LICENSE_1_0.txt) // test_lambertw.cpp -//! \brief Basic sanity tests for Lambert W function plog or productlog using algorithm from Thomas Luu. +//! \brief Basic sanity tests for Lambert W function plog or lambert_w using algorithm from Thomas Luu. #include // for real_concept #define BOOST_TEST_MAIN @@ -19,13 +19,18 @@ #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; + #ifdef BOOST_HAS_FLOAT128 -#include +#include // Not available for MSVC. #endif #include -#include // for productlog function. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for Lambert_w diagnostic output. +#include // For Lambert W lambert_w function. +using boost::math::lambert_w; +#include // isnan, ifinite. + #include #include #include @@ -35,6 +40,7 @@ using boost::multiprecision::cpp_dec_float_50; #include #include #include +#include static const unsigned int noof_tests = 2; @@ -46,14 +52,18 @@ static const boost::array test_data = //static const boost::array test_expected = //{ { -// BOOST_MATH_TEST_VALUE(T, 0.56714329040978387299996866221035554975381578718651), // Output from https://www.wolframalpha.com/input/?i=productlog(1) -// BOOST_MATH_TEST_VALUE(T, 1.432404775898300311234078007212058694786434608804302025655) // Output from https://www.wolframalpha.com/input/?i=productlog(6) +// BOOST_MATH_TEST_VALUE(T, 0.56714329040978387299996866221035554975381578718651), // Output from https://www.wolframalpha.com/input/?i=lambert_w(1) +// BOOST_MATH_TEST_VALUE(T, 1.432404775898300311234078007212058694786434608804302025655) // Output from https://www.wolframalpha.com/input/?i=lambert_w(6) // } }; // array test_data -//! Show information about build, architecture, address model, platform, ... +//! Build a message of information about build, architecture, address model, platform, ... std::string show_versions() { + // Some of this information can also be obtained from running with a Custom Post-build step + // adding the option --build_info=yes + // "$(TargetDir)$(TargetName).exe" --build_info=yes + std::ostringstream message; message << "Program: " << __FILE__ << "\n"; @@ -101,210 +111,200 @@ std::string show_versions() return message.str(); } // std::string versions() - -// ProductLog[-0.367879441171442321595523770161460867445811131031767834] - template void test_spots(RealType) { // (Unused Parameter value, arbitrarily zero, only communicates the floating point type). // test_spots(0.F); test_spots(0.); test_spots(0.L); -// // Check some bad parameters to the function, -//#ifndef BOOST_NO_EXCEPTIONS -// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution nbad1(0, 0), std::domain_error); // zero sd -// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution nbad1(0, -1), std::domain_error); // negative sd -//#else -// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution(0, 0), std::domain_error); // zero sd -// BOOST_MATH_CHECK_THROW(boost::math::normal_distribution(0, -1), std::domain_error); // negative sd -//#endif - - using boost::math::productlog; - + using boost::math::lambert_w; using boost::math::constants::exp_minus_one; - RealType tolerance = boost::math::tools::epsilon() * 5; // 5 eps as a fraction. + using boost::math::policies::policy; + + typedef policy < + boost::math::policies::domain_error, + boost::math::policies::overflow_error, + boost::math::policies::underflow_error, + boost::math::policies::denorm_error, + boost::math::policies::pole_error, + boost::math::policies::evaluation_error + > ignore_all_policy; + +// // Test some bad parameters to the function, with default policy and with ignore_all policy. +#ifndef BOOST_NO_EXCEPTIONS + BOOST_CHECK_THROW(boost::math::lambert_w(-1.), std::domain_error); + BOOST_CHECK_THROW(lambert_w(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. + BOOST_CHECK_THROW(lambert_w(std::numeric_limits::infinity()), std::domain_error); // Would be infinite. + BOOST_CHECK_THROW(lambert_w(-static_cast(0.4)), std::domain_error); // Would be complex. + +#else + BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits() * epsilons; // 2 eps as a fraction. + std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; std::cout << "Precision " << std::numeric_limits::digits10 << " decimal digits." << std::endl; - std::cout.precision(std::numeric_limits::digits10); - std::cout << std::showpoint << std::endl; // show trailing significant zeros. + // std::cout.precision(std::numeric_limits::digits10); + std::cout.precision(std::numeric_limits ::max_digits10); + std::cout.setf(std::ios_base::showpoint); // show trailing significant zeros. std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl; - std::cout.precision(std::numeric_limits ::max_digits10); - - RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176); - RealType expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.); - - test_value = -boost::math::constants::exp_minus_one(); // -exp(-1) = -0.367879450 - std::cout << "test " << test_value << ", expected productlog = " << expected_value << std::endl; + // Test at singularity. Three tests because some failed previously - bug now gone? + //RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527); + RealType singular_value = -exp_minus_one(); + // -exp(-1) = -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 + // lambert_w[-0.367879441171442321595523770161460867445811131031767834] == -1 + // -0.36787945032119751 + RealType minus_one_value = BOOST_MATH_TEST_VALUE(RealType, -1.); + //std::cout << "singular_value " << singular_value << ", expected Lambert W = " << minus_one_value << std::endl; BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 - productlog(test_value), - expected_value, + lambert_w(singular_value), + minus_one_value, tolerance); // OK - BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 - productlog(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176)), + BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 + lambert_w(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), BOOST_MATH_TEST_VALUE(RealType, -1.), tolerance); + BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 + lambert_w(-exp_minus_one()), + BOOST_MATH_TEST_VALUE(RealType, -1.), + tolerance); + + // Tests with some spot values computed using + // https://www.wolframalpha.com/input + // For example: N[lambert_w[1], 50] outputs: + // 0.56714329040978387299996866221035554975381578718651 + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.1)), + BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.2) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.2)), + BOOST_MATH_TEST_VALUE(RealType, 0.16891597349910956511647490370581839872844691351073), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.2) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.5)), + BOOST_MATH_TEST_VALUE(RealType, 0.351733711249195826024909300929951065171464215517111804046), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.5) + tolerance); + BOOST_CHECK_CLOSE_FRACTION( - productlog(BOOST_MATH_TEST_VALUE(RealType, 1.)), + lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.)), BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651), - // Output from https://www.wolframalpha.com/input/?i=productlog(1) + // Output from https://www.wolframalpha.com/input/?i=lambert_w(1) tolerance); - //Tests with some spot values computed using - //https://www.wolframalpha.com - //For example: N[ProductLog[-1], 50] outputs: - //1.3267246652422002236350992977580796601287935546380 - - BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 2.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 2.)), BOOST_MATH_TEST_VALUE(RealType, 0.852605502013725491346472414695317466898453300151403508772), - // Output from https://www.wolframalpha.com/input/?i=productlog(2.) + // Output from https://www.wolframalpha.com/input/?i=lambert_w(2.) tolerance); - BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 3.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 3.)), BOOST_MATH_TEST_VALUE(RealType, 1.049908894964039959988697070552897904589466943706341452932), - // Output from https://www.wolframalpha.com/input/?i=productlog(3.) + // Output from https://www.wolframalpha.com/input/?i=lambert_w(3.) tolerance); - BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 5.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 5.)), BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789), - // Output from https://www.wolframalpha.com/input/?i=productlog(0.5) + // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.5) tolerance); - - BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 0.5)), - BOOST_MATH_TEST_VALUE(RealType, 0.351733711249195826024909300929951065171464215517111804046), - // Output from https://www.wolframalpha.com/input/?i=productlog(0.5) - tolerance); - - - BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 6.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 6.)), BOOST_MATH_TEST_VALUE(RealType, 1.432404775898300311234078007212058694786434608804302025655), - // Output from https://www.wolframalpha.com/input/?i=productlog(6) + // Output from https://www.wolframalpha.com/input/?i=lambert_w(6) tolerance); - BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 100.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 100.)), BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578), - // Output from https://www.wolframalpha.com/input/?i=productlog(100) + // Output from https://www.wolframalpha.com/input/?i=lambert_w(100) tolerance); - // TODO Fails here with really big x. - /* BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), - BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), - // Output from https://www.wolframalpha.com/input/?i=productlog(1e6) - // tolerance * 1000); // fails exceeds 0.00015258789063 - tolerance * 1000); + // This fails for fixed_point type used for other tests because out of range? + //BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), + //BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), + //// Output from https://www.wolframalpha.com/input/?i=lambert_w(1e6) + //// tolerance * 1000); // fails for fixed_point type exceeds 0.00015258789063 + // // 15.258789063 + // // 11.383346558 + // tolerance * 100000); - 1>i:/modular-boost/libs/math/test/test_lambert_w.cpp(195): - error : in "test_main": - difference{2877.54} between - productlog(create_test_value( 1.0e6L, "1.0e6", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>())) -{ - 32767.399857 -} -and + // So need to use some spot tests for specific types, or use a bigger fixed_point type. -create_test_value( 11.383358086140052622000156781585004289033774706019L, "11.383358086140052622000156781585004289033774706019", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) -{ - 11.383346558 -} -exceeds 0.00015258789063 - - */ - - - BOOST_CHECK_CLOSE_FRACTION(productlog(BOOST_MATH_TEST_VALUE(RealType, 0.0)), - BOOST_MATH_TEST_VALUE(RealType, 0.), + // Check zero. + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.0)), + BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); - // This is very close to the limit of -exp(1) * x - // (where the result has a non-zero imaginary part). - test_value = -exp_minus_one(); - test_value += (std::numeric_limits::epsilon() * 100); - expected_value = BOOST_MATH_TEST_VALUE(RealType, -1.0); - - // std::cout << test_value << std::endl; // -0.367879 - - // Fatal error here with float. - //BOOST_CHECK_CLOSE_FRACTION(productlog(test_value), - // expected_value, - // tolerance); - /* - i:/modular-boost/libs/math/test/test_lambert_w.cpp(224): - error : in "test_main": + // Check +/- values near to zero. + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, std::numeric_limits::epsilon())), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); - difference{1e+67108864} between productlog(test_value) + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::epsilon())), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); + + // Check not finite if possible. + if (std::numeric_limits::has_infinity) { - 0 - } and create_test_value( - -0.99845210378072725931829498030640227316856835774851L, - "-0.99845210378072725931829498030640227316856835774851", - boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::infinity())), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::infinity())), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); + } + std::numeric_limits::has_quiet_NaN { - -0.99845210378072725931829498030640227316856835774851 + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::quiet_NaN())), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::quiet_NaN())), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); } - exceeds 5e-47 - */ + */ - /* Goes really haywire here close to singularity. - test_value = BOOST_MATH_TEST_VALUE(RealType, -0.367879); - BOOST_CHECK_CLOSE_FRACTION(productlog(test_value), - BOOST_MATH_TEST_VALUE(RealType, -0.99845210378072725931829498030640227316856835774851), - // Output from https://www.wolframalpha.com/input/?i=productlog(2.) - // N[productlog(-0.367879), 50] = -0.99845210378072725931829498030640227316856835774851 - tolerance * 100); - - I:/modular-boost/libs/math/test/test_lambert_w.cpp(267): error : in "test_main": - difference - { - 2.87298e+26 - } - between productlog(test_value) - { - -2.86853068e+26 - } - and create_test_value( -0.99845210378072725931829498030640227316856835774851L, "-0.99845210378072725931829498030640227316856835774851", boost::mpl::bool_< std::numeric_limits::is_specialized && (std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= std::numeric_limits::digits) && boost::is_convertible::value>(), boost::mpl::bool_< boost::is_constructible::value>()) - { - -0.998452127 - } - exceeds 5.96046448e-05 - - */ - - - // Checks on input that should throw. + // Checks on input that should throw. /* This should throw when implemented. - BOOST_CHECK_CLOSE_FRACTION(productlog(-0.5), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(-0.5), BOOST_MATH_TEST_VALUE(RealType, ), - // Output from https://www.wolframalpha.com/input/?i=productlog(-0.5) + // Output from https://www.wolframalpha.com/input/?i=lambert_w(-0.5) tolerance); */ } //template void test_spots(RealType) -BOOST_AUTO_TEST_CASE(test_main) +BOOST_AUTO_TEST_CASE(test_types) { BOOST_MATH_CONTROL_FP; // BOOST_TEST_MESSAGE( output only appears if command line has --log_level="message" // or call set_threshold_level function: boost::unit_test_framework::unit_test_log.set_threshold_level(boost::unit_test_framework::log_messages); - BOOST_TEST_MESSAGE("Test Lambert W function."); + BOOST_TEST_MESSAGE("Test Lambert W function for several types."); BOOST_TEST_MESSAGE(show_versions()); // Full version of Boost, STL and compiler info. // Fundamental built-in types: test_spots(0.0F); // float test_spots(0.0); // double - if (sizeof(long double) > sizeof (double)) - { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). - test_spots(0.0L); // long double - } + //if (sizeof(long double) > sizeof (double)) + //{ // Avoid pointless re-testing if double and long double are identical (for example, MSVC). + // test_spots(0.0L); // long double + //} // Built-in/fundamental Quad 128-bit type, if available. #ifdef BOOST_HAS_FLOAT128 test_spots(static_cast(0)); @@ -312,62 +312,141 @@ BOOST_AUTO_TEST_CASE(test_main) // Multiprecision types: test_spots(static_cast(0)); - test_spots(static_cast(0)); // Fails GCC gnu++11 and gnu ++14but OK -std=c++11 and 14. - test_spots(static_cast(0)); // Fails GCC gnu++11 and ++14 but OK -std=c++11 and 14. + test_spots(static_cast(0)); + test_spots(static_cast(0)); // Fixed-point types: - test_spots(static_cast >(0)); + //test_spots(static_cast >(0)); //test_spots(boost::math::concepts::real_concept(0.1)); // "real_concept" - was OK. - // link fails - need to add as a permanent constant. - /* - test_lambert_w.obj : error LNK2001 : unresolved external symbol "private: static class boost::math::concepts::real_concept __cdecl boost::math::constants::detail::constant_expminusone::compute<0>(void)" (? ? $compute@$0A@@?$constant_expminusone@Vreal_concept@concepts@math@boost@@@detail@constants@math@boost@@CA?AVreal_concept@concepts@34@XZ) - */ +} // BOOST_AUTO_TEST_CASE( test_types ) +BOOST_AUTO_TEST_CASE(test_range_of_values) +{ + using boost::math::lambert_w; + using boost::math::constants::exp_minus_one; + BOOST_TEST_MESSAGE("Test Lambert W function type double for range of values."); + // Want to test almost largest value. + // test_value = (std::numeric_limits::max)() / 4; + // std::cout << std::setprecision(std::numeric_limits::max_digits10) << "Max value = " << test_value << std::endl; + // Can't use a test like this for all types because max_value depends on RealType and thus the expected result of lambert_w does too. + //BOOST_CHECK_CLOSE_FRACTION(lambert_w(test_value), + // BOOST_MATH_TEST_VALUE(RealType, ???), + // tolerance); + // So this section just tests a single type, say IEEE 64-bit double, for a range of spot values. + + typedef double RealType; + + int epsilons = 2; + RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. + std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)), + BOOST_MATH_TEST_VALUE(RealType, 9.9999900000149999733333854165586669000967020964243e-7), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[1e-6],50]) + tolerance); + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.0001)), + BOOST_MATH_TEST_VALUE(RealType, 0.000099990001499733385405869000452213835767629477903460), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50]) + tolerance); + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.001)), + BOOST_MATH_TEST_VALUE(RealType, 0.00099900149733853088995782787410778559957065467928884), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50]) + tolerance); + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.01)), + BOOST_MATH_TEST_VALUE(RealType, 0.0099014738435950118853363268165701079536277464949174), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50]) + tolerance * 25); // <<< Needs a much bigger tolerance??? + // 0.0099014738435951096 this test max_digits10 + // 0.00990147384359511 digits10 + // 0.0099014738435950118 wolfram + // 0.00990147384359501 wolfram digits10 + // 0.0099014738435950119 N[lambert_w[0.01],17] + // 0.00990147384359501 N[lambert_w[0.01],15] which really is more different than expected. + + // 0.00990728209160670 approx + // 0.00990147384359511 previous + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.05)), + BOOST_MATH_TEST_VALUE(RealType, 0.047672308600129374726388900514160870747062965933891), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50]) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.1)), + BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50]) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.)), + BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50]) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 2.)), + BOOST_MATH_TEST_VALUE(RealType, 0.852605502013725491346472414695317466898453300151403508772), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(2.) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 3.)), + BOOST_MATH_TEST_VALUE(RealType, 1.049908894964039959988697070552897904589466943706341452932), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(3.) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 5.)), + BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.5) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 6.)), + BOOST_MATH_TEST_VALUE(RealType, 1.432404775898300311234078007212058694786434608804302025655), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(6) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 10.)), + BOOST_MATH_TEST_VALUE(RealType, 1.7455280027406993830743012648753899115352881290809), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[10],50]) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 100.)), + BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(100) + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1000.)), + BOOST_MATH_TEST_VALUE(RealType, 5.2496028524015962271260563196973062825214723860596), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(1000) + tolerance); + + // This fails for fixed_point type used for other tests because out of range? + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), + BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), + // Output from https://www.wolframalpha.com/input/?i=lambert_w(1e6) + tolerance); // + + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307), // max_value for IEEE 64-bit double. + static_cast(702.02379914670587), + // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 + std::numeric_limits::epsilon() * 4); + + // This is as close as possible to the singularity at -exp(1) * x + // (where the result has a non-zero imaginary part). + RealType test_value = -exp_minus_one(); + test_value += (std::numeric_limits::epsilon() * 1); + BOOST_CHECK_CLOSE_FRACTION(lambert_w(test_value), + BOOST_MATH_TEST_VALUE(RealType, -0.99999996349975895), + tolerance * 10000000); + // -0.99999996788201051 + // -0.99999996349975895 + // Would not expect to get a result closer than sqrt(epsilon)? + } // BOOST_AUTO_TEST_CASE( test_main ) /* Output: - tolerance just one epsilon fails for Lambert W (-0.367879) = -0.998452 - - 1>------ Rebuild All started: Project: test_lambertW, Configuration: Release x64 ------ -1> test_lambertW.cpp -1> Linking to lib file: libboost_unit_test_framework-vc140-mt-1_63.lib -1> Generating code -1> All 1827 functions were compiled because no usable IPDB/IOBJ from previous compilation was found. -1> Finished generating code -1> test_lambertW.vcxproj -> J:\Cpp\Misc\x64\Release\test_lambertW.exe -1> test_lambertW.vcxproj -> J:\Cpp\Misc\x64\Release\test_lambertW.pdb (Full PDB) -1> Running 1 test case... -1> Platform: Win32 -1> Compiler: Microsoft Visual C++ version 14.0 -1> STL : Dinkumware standard library version 650 -1> Boost : 1.63.0 -1> Tests run with Microsoft Visual C++ version 14.0, Dinkumware standard library version 650, Boost PlatformWin32, MSVC compiler 190024123 -1> Tolerance 5.96046e-07 -1> Precision 6 decimal digits. -1> Iteration #0, w0 0.577547, w1 = 0.567144, difference = 0.0289948, relative 0.018344 -1> Iteration #1, w0 0.567144, w1 = 0.567143, difference = 9.53674e-07, relative 5.96046e-07 -1> Final 0.567143 after 2 iterations, difference = 0 -1> Tolerance 1.11022e-15 -1> Precision 15 decimal digits. -1> Iteration #0, w0 0.577547206058041, w1 = 0.567143616915443, difference = 0.0289944962755619, relative 0.018343835374856 -1> Iteration #1, w0 0.567143616915443, w1 = 0.567143290409784, difference = 9.02208135089566e-07, relative 5.75702234328901e-07 -1> Final 0.567143290409784 after 2 iterations, difference = 0 -1> Tolerance 5e-49 -1> Precision 50 decimal digits. -1> Iteration #0, w0 0.57754720605804066335708515521786300470367806666917, w1 = 0.5671436169154433808085244686233766561058069997742, difference = 0.028994496275562314267349048621807448516020440172019, relative 0.018343835374855986875831315372982269135605651729877 -1> Iteration #1, w0 0.5671436169154433808085244686233766561058069997742, w1 = 0.56714329040978387301011426674463910433535588015473, difference = 9.0220813517014912275046839365249789421357156514914e-07, relative 5.7570223438927562537725655919526667550991229663452e-07 -1> Iteration #2, w0 0.56714329040978387301011426674463910433535588015473, w1 = 0.56714329040978387299996866221035554975381578718651, difference = 2.8034566117436458709490133985425058248551576808341e-20, relative 1.7888961583152904127717080041769389899099419098831e-20 -1> Final 0.56714329040978387299996866221035554975381578718651 after 3 iterations, difference = 0 -1> -1> *** No errors detected -========== Rebuild All: 1 succeeded, 0 failed, 0 skipped ========== - */ From 369ce4312bb1d36aeeb6c942f6bdb36c1d270629 Mon Sep 17 00:00:00 2001 From: pabristow Date: Wed, 10 May 2017 18:21:35 +0100 Subject: [PATCH 09/71] Halley/Luu version working for 50 decimal digits 'reference' test values. --- .../math/special_functions/lambert_w.hpp | 509 +++++++++++------- .../boost/math/special_functions/trunc.hpp | 2 +- test/test_lambert_w.cpp | 109 ++-- 3 files changed, 377 insertions(+), 243 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index f711b57aa..7dfedccee 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -37,10 +37,6 @@ //#define BOOST_MATH_INSTRUMENT_LAMBERT_W // Only #define for Lambert W diagnostic output. -int total_iterations = 0; -int total_calls = 0; -int max_iterations = 0; - #include #include #include @@ -52,9 +48,18 @@ int max_iterations = 0; #include // fixed_point, if required. #if defined (BOOST_MSVC) # pragma warning(push) -# pragma warning(disable: 4127) // conditional expression is constant +# pragma warning(disable: 4127) // Conditional expression is constant. #endif + +int total_iterations = 0; +int total_calls = 0; +int max_iterations = 0; + +double worst_diff = 0; +// boost::math::tools::max_value(); +double total_diffs = 0.; + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W # include // Only needed for testing. #endif @@ -68,14 +73,14 @@ namespace boost { /*! \details This simple (and fast) approximation gives a result - within a few epsilon/ULP of the nearest representable value. - This makes it suitable for use as a first approximation by the Lambert W function below. - It only uses (and thus relies on for accuracy of) the standard log function. - Refinement of the Lambert W estimate using Halley's method - seems to get quickly to high accuracy in a very few iterations, - so that any small inaccuracy in the 1st approximation is fairly unimportant. - It avoids any Taylor series refinements that involve high powers of x - that could easily go outside the often limited range of fixed-point types. + within a few epsilon/ULP of the nearest representable value. + This makes it suitable for use as a first approximation by the Lambert W function below. + It only uses (and thus relies on for accuracy of) the standard log function. + Refinement of the Lambert W estimate using Halley's method + seems to get quickly to high accuracy in a very few iterations, + so that any small inaccuracy in the 1st approximation is fairly unimportant. + It also avoids any Taylor series refinements that involve high powers of x + that could easily go outside the often limited range of fixed-point types. */ template @@ -88,7 +93,7 @@ namespace boost { typedef negatable local_negatable_type; local_negatable_type unity(1); - // A fixed_point type might not include unity. Does something sensible happen? + // A fixed_point type might not include unity: hope something sensible happens. local_negatable_type u = unity + x; if (u == unity) { // @@ -98,9 +103,8 @@ namespace boost { { local_negatable_type result = log(u) * (x / (u - unity)); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "log1p fp approx " << result << std::endl; + std::cout << "log1p fixed-point approx " << result << std::endl; #endif - // For example: x = 0.5, HP 0.78843689, diff -1.52587891e-05 return result; } // if else } // log1p_fp @@ -119,163 +123,190 @@ namespace local 1) That the operations are not re-ordered. 2) That each operation is correctly rounded. - Is true only for floating-point arithmetic unless you compile with - special flags to force full-IEEE compatible mode, - but that slows the whole program down... - Not a concern for fixed-point? + Is true only for floating-point arithmetic unless you compile with + special flags to force full-IEEE compatible mode, + but that slows the whole program down... 3) That compiler optimisations don't perform symbolic math on the expressions and simplify them." */ -template -T log1p_dodgy(T x) -{ - // log(1+x) == (log(1+x) * x) / ((1-x) - 1) - T result = -(log(1 + x) * x) / ((1 - x) - 1); // From note in Boost.Math log1p. + template + T log1p_dodgy(T x) + { + // log(1+x) == (log(1+x) * x) / ((1-x) - 1) + T result = -(log(1 + x) * x) / ((1 - x) - 1); // From note in Boost.Math log1p. - // \boost\libs\math\include\boost\math\special_functions\log1p.hpp - // Algorithm log1p is part of C99, but is not yet provided by many compilers. - // - // The Boost.Math version uses a Taylor series expansion for 0.5 > x > epsilon, which may - // require up to std::numeric_limits::digits+1 terms to be calculated. - // It would be much more efficient to use the equivalence: - // log(1+x) == (log(1+x) * x) / ((1-x) - 1) - // Unfortunately many optimizing compilers make such a mess of this, that - // it performs no better than log(1+x): which is to say not very well at all. + // \boost\libs\math\include\boost\math\special_functions\log1p.hpp + // Algorithm log1p is part of C99, but is not yet provided by all compilers. + // + // The Boost.Math version uses a Taylor series expansion for 0.5 > x > epsilon, which may + // require up to std::numeric_limits::digits+1 terms to be calculated. + // It would be much more efficient to use the equivalence: + // log(1+x) == (log(1+x) * x) / ((1-x) - 1) + // Unfortunately many optimizing compilers make such a mess of this, that + // it performs no better than log(1+x): which is to say not very well at all. - return result; -} // template T log1p(T x) + return result; + } // template T log1p_dodgy(T x) -template -inline -T log1p(T x) -{ - //! \brief log1p function. - //! This is probably faster than using boost::math::log1p (if a little less accurate) - // but should be good enough for computing Lambert_w initial estimate. + template + inline + T log1p(T x) + { + //! \brief log1p function. + //! This is probably faster than using boost::math::log1p (if a little less accurate) + // but should be good enough for computing Lambert_w initial estimate. - //! \details Formula for function log1p from a Note in - // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c - // HP - 15C Advanced Functions Handbook, p.193. - // Assuming log() returns an accurate answer, - // the following algorithm can be used to compute log1p(x) to within a few ULP : - // u = 1 + x; - // if (u == 1) return x - // else return log(u)*(x/(u-1.)); - // This implementation is template of type T + //! \details Formula for function log1p from a Note in + // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c + // HP - 15C Advanced Functions Handbook, p.193. + // Assuming log() returns an accurate answer, + // the following algorithm can be used to compute log1p(x) to within a few ULP : + // u = 1 + x; + // if (u == 1) return x + // else return log(u)*(x/(u-1.)); + // This implementation is template of type T - // log(u) * (x / (u - unity)); + // log(u) * (x / (u - unity)); - // http://thepeg.hepforge.org/svn/tags/RELEASE_1_0/ThePEG/Utilities/Math.icc - // double log1m(double x) { return log1p(-x);} + // http://thepeg.hepforge.org/svn/tags/RELEASE_1_0/ThePEG/Utilities/Math.icc + // double log1m(double x) { return log1p(-x);} - // It is probably possible to use Newton or Halley's method to refine this approximation, - // but improvement is probably not useful for estimating the Lambert W value because it is close enough - // for the Halley's method to converge just as well as with a better initial estimate. + // It is probably possible to use Newton's or Halley's method to refine this approximation, + // but improvement is probably not useful for estimating the Lambert W value because it is + // close enough for the Halley's method to converge just as fast as with a better initial estimate. - T unity; + T unity; unity = static_cast(1); - T u = unity + x; - if (u == unity) - { - return x; - } - else - { - T result = log(u) * (x / (u - unity)); - //T dodgy = log1p_dodgy(x); - //double dx = static_cast(x); - //double lp1x = log1p(dx); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "true " << lp1x + T u = unity + x; + if (u == unity) + { + return x; + } + else + { + T result = log(u) * (x / (u - unity)); + //T dodgy = log1p_dodgy(x); + //double dx = static_cast(x); + //double lp1x = log1p(dx); + /* + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + std::cout << "true " << lp1x << ", log1p_fp " << log1p(x) - //<< ", dodgy " << dodgy << ", HP " << result + //<< ", dodgy " << dodgy << ", HP approximation " << result //<< ", diff " << dodgy - result << "epsilons = " << (dodgy - result)/std::numeric_limits::epsilon() << std::endl; - // For example: x = 0.5, dodgy 0.788421631, HP 0.78843689, diff -1.52587891e-05 -#endif - return result; - } -} // template T log1p(T x) + // For example: x = 0.5, dodgy 0.788421631, HP 0.78843689, diff -1.52587891e-05 + #endif + */ + return result; + } + } // template T log1p(T x) } // namespace local namespace boost { namespace math { - namespace detail { - //! First approximation of Lambert W function. - //! \details Based on Thomas Luu, Thesis (2016) and Barry et al. - //! Notes refer to equations, page 96-98 and C++ code from algorithm Routine 11. + //! \brief Approximation of real-branched values of the Lambert W function. + //! \details Based on Barry et al, and Thomas Luu, Thesis (2016). + //! Notes refer to Luu equations, page 96-98 and C++ code from algorithm Routine 11. // Assumes parameter x has been checked before call. - // This function might be useful if the user only requires an approximate result quickly. - template - inline + // This function might be useful if the user only requires an approximate result quickly, + // as relative errors of 0.02% or less are claimed by Barry et al. + + template + inline BOOST_CONSTEXPR_OR_CONST RealType lambert_w_approx(RealType x) { BOOST_MATH_STD_USING // for ADL of std functions. + using boost::math::constants::e; // e(1) = 2.71828... using boost::math::constants::root_two; // 1.414 ... using boost::math::constants::one_div_root_two; // 0.707106 - RealType w0; - // Upper branch W0 is divided in two regions: -1 <= w0_minus <=0 and 0 <= w0_plus. + //using local::log1p; // Simplified approximation for speed. (mean 0.222 us) + using boost::math::log1p; // Other approximate implementations may also be used. + + RealType w0 = 0; // TODO avoid this assignment to avoid GCC unitialized variable 'w0' in constexpr function. + // Upper branch W0 is divided in two regions, W0+ and W0-: -1 <= w0_minus <= 0 and 0 <= w0_plus. if (x > 0) - { // Luu Routine 11, line 8, and equation 6.44, from Barry et al. - // (1.2 and 2.4 are 'exact' from integer fractions 6/5 and 12/5). + { // W0+ branch, Luu Routine 11, line 8, and equation 6.44, from Barry et al. + // (Factors 1.2 and 2.4 are 'exact' from integral fractions 6/5 and 12/5). + // A maximum relative error of 0.196% is claimed by Barry for equation 15, page 7. + // Luu claims a maximum relative error of 2.39% for this slightly simplified version. w0 = log(static_cast(1.2L) * x / log(static_cast(2.4L) * x / log1p(static_cast(2.4L) * x))); // local::log1p does seem to refine OK with multiprecision. } else - { // > -exp(-1) or > -0.367879 - // so for real result need x > -0.367879 >= 0 + { // Lower branch W0-> -exp(-1) or > -0.367879, so for a Real result need x > -0.367879 >= 0. + // Luu, equation 6.44, page 97 claims a maximum relative error of 0.013%. + // from Barry et al (Erratum Mathematics and Computers in Simulation, 53 (2000) 95–103) + // Section 3.2 Approximation for W0-, equation 9 (but corrected in the erratum). + // Barry et al claim a maximum relative error of 0.013%. RealType sqrt_v = root_two() * sqrt(static_cast(1) + e() * x); // nu = sqrt(2 + 2e * z) Line 10. RealType n2 = static_cast(3) * root_two() + static_cast(6); // 3 * sqrt(2) + 6, Line 11. // == 10.242640687119285146 RealType n2num = (static_cast(2237) + (static_cast(1457) * root_two())) * e() - (static_cast(4108) * root_two()) - static_cast(5764); // Numerator Line 11. - RealType n2denom = (static_cast(215) + (static_cast(199) * root_two())) * e() - (430 * root_two()) - static_cast(796); // Denominator Line 11. RealType nn2 = n2num / n2denom; // Line 11 full fraction. nn2 *= sqrt_v; // Line 11 last part. - n2 -= nn2; // Line 11 complete, equation 6.44, from Barry et al (erratum). + n2 -= nn2; // Line 11 complete, equation 6.44, RealType n1 = (static_cast(1) - one_div_root_two()) * (n2 + root_two()); // Line 12. - w0 = -1 + sqrt_v * (n2 + sqrt_v) / (n2 + sqrt_v + n1 * sqrt_v); // W0 1st approximation, Line 13, equation 6.40. } return w0; } // template RealType lambert_w_approx(RealType x) - //! \brief Lambert W function implementation. - //! \details Based on Thomas Luu, Thesis (2016). - //! Notes refer to equations, page 96-98 and C++ code from algorithm Routine 11. + //! \brief Lambert W approximation that can be used when x is large. + //! This approximation from Darko Veberic, 2.1 Recursion, page 4, equation 14, (2009), https://arxiv.org/pdf/1003.1628.pdf. + //! x > std::numeric_limits::max(); FLOAT_MAX + //! and so using the lambert_w_approx version for speed is no longer possible. + //! x must be < 1/epsilon + //! For multiprecision types, RealType epsilon is so small (< 1e38) that + //! FLOAT_MAX < 1/epsilon float: 3.4e+38 or 0x1.fffffep+127 + //! This is never true for fundamental types, including binary128 quad precision, + //! epsilon = 2^-112 ~=1.93E-34, 1/epsilon = 5.19e33 + //! which is < 3.4e+38 and so using float is OK. + + template + inline BOOST_CONSTEXPR_OR_CONST + T lambert_w_ln_approx(T z) + { + T l = log(z); + return l - log(l); // 1st two terms of continued logarithm. + } // template T lambert_W_ln_approx(T z) + + + //! \brief Lambert W function implementation. + //! \details Based on Thomas Luu, Thesis (2016). + //! Notes refer to equations, page 96-98 and C++ code from algorithm Routine 11. template > RealType lambert_w_imp(RealType x, const Policy& /* pol */) { BOOST_MATH_STD_USING // for ADL of std functions. - //using boost::math::log1p; // Other approximate implementations may also be used. - using local::log1p; //using boost::math::constants::root_two; // 1.414 ... //using boost::math::constants::e; // e(1) = 2.71828... //using boost::math::constants::one_div_root_two; // 0.707106 using boost::math::constants::exp_minus_one; // 0.36787944 using boost::math::tools::max_value; - // Catch the very common mistake of providing an integer value as parameter x to lambert_w. - // need to ensure it is a floating-point type (of the desired type, float 1.f, double 1., or long double 1.L), - // or static_cast, for example: static_cast(1) or static_cast(1). - // Want to allow fixed_point types too. + // Catch the very common mistake of providing an integer value as parameter x to lambert_w, for example, lambert_w(1). + // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L), + // or static_casted integer, for example: static_cast(1) or static_cast(1). + // Want to allow fixed_point types too, so do not just test for floating-point. BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point type (not integer type), for example: W(1.), not W(1)!"); total_calls++; // Temporary for testing. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout << std::showpoint << std::endl; // Show all trailing zeros. std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits (17 for double). - //std::cout.precision(std::numeric_limits::digits10); // Show all significant digits (15 for double). + //std::cout.precision(std::numeric_limits::digits10); // Show all significant digits (15 for double). #endif // Check on range of x. if (x == 0) @@ -291,24 +322,23 @@ namespace boost Policy()); } // (!boost::math::isfinite(x)) - - if (x > boost::math::tools::max_value() / 4) - { // Would throw exception "Error in function boost::math::log1p(double): numeric overflow" + // Check x is not so large that it would cause overflow, + // and would throw exception "Error in function boost::math::log1p(double): numeric overflow" + if (x > boost::math::tools::max_value() / 4) // Close to max == 4.4942328371557893e+307 + { return policies::raise_overflow_error( "boost::math::lambert_w<%1%>", "The parameter %1% is too large, so the return value is NaN.", - x, Policy() ); + x, Policy()); // Exception Error in function boost::math::lambert_w: The parameter 4.6180304784183997e+307 is too large, so the return value is NaN. } - //std::cout << "-exp(-1) = " << -expminusone() << std::endl; + + // Special case of singularity at -exp(-1)) // -0.3678794411714423215955237701614608674458111310 + // std::cout << "-exp(-1) = " << -expminusone() << std::endl; // https://www.wolframalpha.com/input/?i=-exp(-1)&wal=header N[-Exp[-1], 143] // -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 // Added to Boost math constants as exp_minus_one - - // Special case of -exp(-1)) // -0.3678794411714423215955237701614608674458111310 - // Can't use if (x < -exp(-1)) because 1-bit difference in accuracy of exp means is inconsistent. - // if (x < static_cast(-0.3678794411714423215955237701614608674458111310L) ) - + // Can't use if (x < -exp(-1)) because possible 1-bit inaccuracy of exp means is inconsistent. if (x == -exp_minus_one()) { // At Singularity -0.36787944117144233 == -0.36787944117144233 returned -1.0000000000000000 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W @@ -317,7 +347,7 @@ namespace boost return static_cast(-1); } else if (x < -exp_minus_one()) // -0.3678794411714423215955237701614608674458111310L - { // If x < -exp(-1)) then W(x) would be complex (not handled with this implementation). + { // If x < -exp(-1)) then lambert_W(x) would be complex (not handled with this implementation). return policies::raise_domain_error( "boost::math::lambert_w<%1%>", "The parameter %1% would give a complex result, so the return value is NaN.", @@ -325,137 +355,200 @@ namespace boost // "Function boost::math::lambert_w: The parameter -0.36787945032119751 would give a complex result, so the return value is NaN." Policy()); } - + + // Get a suitable starting approximation of lambert_w. + // For speed, use float because the error of the approximation is more than float precision, + // and the iteration will probably get to the result just as quickly. + // For multiprecision types, this can almost half the execution time. + // Some very precise multiprecision types (using more than about 150 bits) + // will not be representable using float types, + // so a continued log approximation will be used instead. + using boost::math::detail::lambert_w_approx; - RealType w0 = lambert_w_approx(x); + using boost::math::policies::digits2; + using boost::math::policies::digits10; + using boost::math::policies::digits_base10; + using boost::math::policies::get_epsilon; + + RealType epsilon = get_epsilon(); + // default epsilon double 2.2204460492503131e-16 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + int d10 = policies::digits_base10(); // policy template parameter digits10 in lambert_w(x, policy >() + int d2 = policies::digits(); + std::cout << "digits10 " << d10 <<", digits_2 " << d2 << ", epsilon " << epsilon << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W + + //int d2 = policies::digits(); // + //std::cout << "digits2 " << d2 << std::endl; // default 53 , for policy policy > 13 + //int d10 = policies::digits_base10(); + //std::cout << "digits10 " << d10 << std::endl; // 15 = 53 * 0.301 + //int d = policies::digits < RealType, policies::policy<> >(); + //std::cout << "digits () " << d << std::endl; // default = 53, for policy policy > = 3 + + int iterations_required = 0; + if (policies::digits() != policies::digits >()) + { // User template parameter digits10 has specified digits != default (a reduced precision), + // so just guestimate how many iterations should give us this precision: + int initial_precision_bits = 6; // Should be how many bits correct in the the initial approximation w0. + // If relative precision is about 2%, then about 2 decimal places, so very about 6 bits. + // So should not do any iterations if < policies::digits() + // Can't be more than the binary precision of the RealType, say 53 for double. + + while (initial_precision_bits < policies::digits()) + { + initial_precision_bits *= 3; // Assume each iteration doubles or triples the precision? + // With Halley's method, tripling precision with each iteration might be more realistic? + ++iterations_required; + } // while + // std::cout << "initial precision bits = " << initial_precision_bits << ", iterations required = " << iterations_required << std::endl; + // initial precision bits = 9, iterations required = 0 + } // if + else + { + iterations_required = 4; // Worst cases should not need more than 4 Halley iterations. + } + + RealType w0; + if ( (x > (std::numeric_limits::max)()) + // If x > FLOAT_MAX, then too big to fit into a float, so can't use lambert_w_approx. + || (x > 1 / epsilon) + // Multiprecision type where FLOAT_MAX ~=1e38 is too small to hold 1/epsilon. + ) + { // then can't use lambert_w_approx, so use alternative approximation log(x) - log(log(x). + w0 = lambert_w_ln_approx(x); + } + else + { +#ifndef BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS + // RealType argument type can be converted to float. + w0 = lambert_w_approx(static_cast(x)); +#else + // Not convertible so must use lambert_w_approx(x) + w0 = lambert_w_approx(x); +#endif + } // + if (!boost::math::isfinite(w0)) - { // 1st Approximation is not finite, so quit. + { // 1st approximation is not finite (unexpected), so quit. + return policies::raise_domain_error( + "boost::math::lambert_w<%1%>", + "The parameter %1% approximation is NaN.", + x, + Policy()); return std::numeric_limits::quiet_NaN(); } - int iterations = 1; - RealType tolerance = 2 * std::numeric_limits::epsilon(); - RealType w1; // Refined estimate. - RealType previous_diff = boost::math::tools::max_value(); - do - { // Iterate a few times to refine value using Halley's method. - // Now inline Halley iteration. - // We do this here rather than calling tools::halley_iterate since we can - // simplify the expressions algebraically, and don't need most of the error - // checking of the boilerplate version as we know in advance that the function - // is well behaved... + if (iterations_required == 0) + { // Just return approximation without any refinement. + return w0; + } + RealType w1 = 0; // Refined estimate. + // TODO only = 0 to avoid warning C4701: potentially uninitialized local variable 'w1' used. + RealType previous_diff = boost::math::tools::max_value(); // Record the previous diff so can confirm improvement. + int iterations = 0; + RealType tolerance = 1 * std::numeric_limits::epsilon(); // Or computed get_epsilon?? - RealType expw0 = exp(w0); // Compute from best Lambert W estimate so far. - // Hope that w0 * expw0 == x; - RealType diff = (w0 * expw0) - x; // Absolute difference from x. - /* - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - if(iterations == 0) - { - std::cout << "Argument x = " << x << ", 1st approximation = " << w0 << ", " ; - } - else - { - std::cout << "Estimate " << w1 << " refined after " << iterations << " iterations, " ; - } - if (diff != 0) - { - std::cout << "(w0 * expw0) - x = " << diff << ", relative " << ((w0 / w1) - static_cast(1)) << std::endl; // improvement. - } - else - { - std::cout << "Exact." << std::endl; - } - #endif - */ // Halley's method from Luu equation 6.39, line 17. - // https://en.wikipedia.org/wiki/Halley%27s_method - // f''(w) = e^w (2 + w) , Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) - // f''(w) / f'(w) = (2+w) / (1+w), Luu equation 6.38. + while ((iterations < iterations_required) && (iterations <= 10)) // Absolute limit 10 during testing - looping if need this. + { // Iterate a few times to refine value using Halley's method. + // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate + // since we can simplify the expressions algebraically, + // and don't need most of the error checking of the boilerplate version + // as we know in advance that the function is reasonably well-behaved, + // and in any case the derivatives require evaluation of Lambert W! - w1 = w0 // Refine a new estimate using Halleys' method. - - diff / - ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); // Luu equation 6.39. -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Iteration #" << iterations << ", w0 " << w0 << ", w1 = " << w1; + RealType expw0 = exp(w0); // Compute from best Lambert W estimate so far. + // Hope that w0 * expw0 == x; + RealType diff = (w0 * expw0) - x; // Difference from x. + iterations++; + if (iterations > max_iterations) + { // Record the maximum iterations used by all calls of Lambert_w - only used during performance testing. + max_iterations = iterations; + } + total_iterations++; // Record the total iterations used by all calls of Lambert_w - only used during performance testing. + // Halley's method from Luu equation 6.39, line 17. + // https://en.wikipedia.org/wiki/Halley%27s_method + // http://www.wolframalpha.com/input/?i=differentiate+productlog(x) + // differentiate productlog(x) d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w) + // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) + // f'(w) = e^w (1 + w) + // f''(w) = e^w (2 + w) , + // f''(w)/f'(w) = (2+w) / (1+w), Luu equation 6.38. + w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39. + - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Iteration #" << iterations << ", w0 " << w0 << ", w1 = " << w1; + + if (diff != static_cast(0)) + { + std::cout << ", difference = " << w1 - w0 + << ", relative " << ((w0 / w1) - static_cast(1)) + << ", float distance = " << abs(float_distance((w0 * expw0), x)) << std::endl; + } + else + { + std::cout << ", exact." << std::endl; + } + std::cout << "f'(x) = " << diff / (expw0 * (w0 + 1)) << ", f''(x) = " << -diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))) << std::endl; + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W + + if ( // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few). + (fabs((w0 / w1) - static_cast(1)) < tolerance) + || // Or latest estimate is not better, or worse, so avoid oscillating result (common when near singularity). + (abs(diff) >= abs(previous_diff)) + ) + { + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W + std::cout << "Return refined within tolerance " << w1 << " after " << iterations << " iterations"; if (diff != static_cast(0)) { - std::cout << ", difference = " << w1 - w0 - << ", relative " << ((w0 / w1) - static_cast(1)) - << ", float distance = " << abs(float_distance((w0 * expw0), x)) << std::endl; + std::cout << ", difference = " << ((w0 / w1) - static_cast(1)); + std::cout << ", Float distance = " << boost::math::float_distance(w0, w1) << std::endl; } else { std::cout << ", exact." << std::endl; } - std::cout << "f'(x) = " << diff / (expw0 * (w0 + 1)) << ", f''(x) = " << -diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))) << std::endl; -#endif + #endif - iterations++; - if (iterations > max_iterations) + if (diff > worst_diff) { - max_iterations = iterations; - - } - total_iterations++; - if ( // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few). - (fabs((w0 / w1) - static_cast(1)) < tolerance) - || // Latest estimate is not better, or worse, so avoid oscillating result (common when near singularity). - (abs(diff) >= abs(previous_diff)) - ) - { -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "\nReturn refined " << w1 << " after " << iterations << " iterations"; - if (diff != static_cast(0)) - { - std::cout << ", difference = " << ((w0 / w1) - static_cast(1)); - std::cout << ", Float distance = " << boost::math::float_distance(w0, w1) << std::endl; - } - else - { - std::cout << ", exact." << std::endl; - } -#endif - return w1; // OK + worst_diff = static_cast(diff); } + total_diffs += static_cast(diff); - w0 = w1; - previous_diff = diff; // Remember so that can check if new estimate is better. - } while (iterations <= 10); + return w1; // As good as it can be. + } // if reached tolerance. + + w0 = w1; + previous_diff = diff; // Remember so that can check if any new estimate is better. + } // while #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W std::cout << "Not within tolerance " << w1 << " after " << iterations << " iterations" << ", difference = " << previous_diff << std::endl; #endif - if (iterations > max_iterations) - { - max_iterations = iterations; - - } return w1; } // lambert_w_imp } // namespace detail - // User functions. + // User functions. - // User defined policy. + // User-defined policy. template - inline typename tools::promote_args::type lambert_w(T z, const Policy& pol) + inline typename tools::promote_args::type + lambert_w(T z, const Policy& pol) { - // Don't think we want/need to promote arguments? Produces very odd results at singularity. - // typedef typename tools::promote_args::type result_type; - //typedef typename policies::evaluation::type value_type; - // return static_cast(detail::lambert_w_imp(value_type(z), pol)); return detail::lambert_w_imp(z, pol); } // Default policy. template - inline typename tools::promote_args::type lambert_w(T z) + inline typename + tools::promote_args::type lambert_w(T z) { return lambert_w(z, policies::policy<>()); } - } // namespace math } // namespace boost diff --git a/include/boost/math/special_functions/trunc.hpp b/include/boost/math/special_functions/trunc.hpp index 3f80c96fe..8a7b04244 100644 --- a/include/boost/math/special_functions/trunc.hpp +++ b/include/boost/math/special_functions/trunc.hpp @@ -50,7 +50,7 @@ inline typename tools::promote_args::type trunc(const T& v) // implicit convertion to the integer types. For user-defined // number types this will likely not be the case. In that case // these functions should either be specialized for the UDT in -// question, or else overloads should be placed in the same +// question, or else overloads should be placed in the same // namespace as the UDT: these will then be found via argument // dependent lookup. See our concept archetypes for examples. // diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 4f48811e3..d13774604 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -20,6 +20,8 @@ #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; +#include + #ifdef BOOST_HAS_FLOAT128 #include // Not available for MSVC. #endif @@ -142,7 +144,7 @@ void test_spots(RealType) BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits() * epsilons; // 2 eps as a fraction. std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; @@ -242,40 +244,47 @@ void test_spots(RealType) BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.0)), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); + // these fail for cpp_dec_float_50 + // 'boost::multiprecision::detail::expression,boost::multiprecision::et_on>,void,void,void>' + // : no appropriate default constructor available + // TODO ??????????? +/* + if (std::numeric_limits::is_specialized) + { // Check +/- values near to zero. + BOOST_CHECK_CLOSE_FRACTION(lambert_w(std::numeric_limits::epsilon()), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); - /* - // Check +/- values near to zero. - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, std::numeric_limits::epsilon())), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::epsilon())), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - - // Check not finite if possible. + BOOST_CHECK_CLOSE_FRACTION(lambert_w(-std::numeric_limits::epsilon()), + BOOST_MATH_TEST_VALUE(RealType, 0.0), + tolerance); + } // is_specialized + + // Check infinite if possible. if (std::numeric_limits::has_infinity) { - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::infinity())), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(+std::numeric_limits::infinity()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::infinity())), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(-std::numeric_limits::infinity()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); } - std::numeric_limits::has_quiet_NaN + + // Check NaN if possible. + if (std::numeric_limits::has_quiet_NaN) { - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::quiet_NaN())), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(+std::numeric_limits::quiet_NaN()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, -std::numeric_limits::quiet_NaN())), + BOOST_CHECK_CLOSE_FRACTION(lambert_w(-std::numeric_limits::quiet_NaN()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); } - */ + */ @@ -316,7 +325,10 @@ BOOST_AUTO_TEST_CASE(test_types) test_spots(static_cast(0)); // Fixed-point types: + + // Some fail 0.1 to 1.0 ??? //test_spots(static_cast >(0)); + // fixed_point::negatable<15,-16> has range 1.52587891e-05 to 32768, epsilon 3.05175781e-05 //test_spots(boost::math::concepts::real_concept(0.1)); // "real_concept" - was OK. @@ -419,28 +431,57 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // Output from https://www.wolframalpha.com/input/?i=lambert_w(1000) tolerance); - // This fails for fixed_point type used for other tests because out of range? + // This fails for fixed_point type used for other tests because out of range of the type? BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), // Output from https://www.wolframalpha.com/input/?i=lambert_w(1e6) tolerance); // - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307), // max_value for IEEE 64-bit double. - static_cast(702.02379914670587), - // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 - std::numeric_limits::epsilon() * 4); + // Tests for double only near the max and the singularity where Lambert_w estimates are less precise. + // + if (std::numeric_limits::is_specialized) + { + // Check near std::numeric_limits<>::max() for type. + + //std::cout << std::setprecision(std::numeric_limits::max_digits10) + // << (std::numeric_limits::max)() // == 1.7976931348623157e+308 + // << " " << (std::numeric_limits::max)() / 4 // == 4.4942328371557893e+307 + // << std::endl; + + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double. + static_cast(702.02379914670587), + // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 + // as a double == 701.83341468208209 + // Lambert computed 702.02379914670587 + // std::numeric_limits::epsilon() * 256); + 0.0003); // Much less precise near the max edge. + + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307/2), // near max_value for IEEE 64-bit double. + static_cast(701.15054872492476914094824907722937), + // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 + // as a double == 701.83341468208209 + // Lambert computed 702.02379914670587 + std::numeric_limits::epsilon()); + + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307/4), // near max_value for IEEE 64-bit double. + static_cast(700.45838920868939857588606393559517), + // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 + // as a double == 701.83341468208209 + // Lambert computed 702.02379914670587 + std::numeric_limits::epsilon()); + + // This test value is one epsilon close to the singularity at -exp(1) * x + // (below which the result has a non-zero imaginary part). + RealType test_value = -exp_minus_one(); + test_value += (std::numeric_limits::epsilon() * 1); + BOOST_CHECK_CLOSE_FRACTION(lambert_w(test_value), + BOOST_MATH_TEST_VALUE(RealType, -0.99999996349975895), + tolerance * 1000000000); + // -0.99999996788201051 + // -0.99999996349975895 + // Would not expect to get a result closer than sqrt(epsilon)? + } // if (std::numeric_limits::is_specialized) - // This is as close as possible to the singularity at -exp(1) * x - // (where the result has a non-zero imaginary part). - RealType test_value = -exp_minus_one(); - test_value += (std::numeric_limits::epsilon() * 1); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(test_value), - BOOST_MATH_TEST_VALUE(RealType, -0.99999996349975895), - tolerance * 10000000); - // -0.99999996788201051 - // -0.99999996349975895 - // Would not expect to get a result closer than sqrt(epsilon)? - } // BOOST_AUTO_TEST_CASE( test_main ) /* From bf1b8e8e10169c55d2d684aadd0e705f959ba97c Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 22 Jun 2017 18:15:18 +0100 Subject: [PATCH 10/71] Corrected mismerge to use my new version of constants include exp_minus_one constant. --- include/boost/math/constants/constants.hpp | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/include/boost/math/constants/constants.hpp b/include/boost/math/constants/constants.hpp index 8c5c4105d..d35aa0271 100644 --- a/include/boost/math/constants/constants.hpp +++ b/include/boost/math/constants/constants.hpp @@ -65,8 +65,7 @@ namespace boost{ namespace math struct dummy_size{}; // - // Max number of binary digits in the string representations - // of our constants: + // Max number of binary digits in the string representations of our constants: // BOOST_STATIC_CONSTANT(int, max_string_digits = (101 * 1000L) / 301L); @@ -266,7 +265,7 @@ namespace boost{ namespace math BOOST_DEFINE_MATH_CONSTANT(third, 3.333333333333333333333333333333333333e-01, "3.33333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333e-01") BOOST_DEFINE_MATH_CONSTANT(twothirds, 6.666666666666666666666666666666666666e-01, "6.66666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667e-01") BOOST_DEFINE_MATH_CONSTANT(two_thirds, 6.666666666666666666666666666666666666e-01, "6.66666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667e-01") - BOOST_DEFINE_MATH_CONSTANT(sixth, 1.66666666666666666666666666666666666666666e-01, "1.66666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667e-01") + BOOST_DEFINE_MATH_CONSTANT(sixth, 1.666666666666666666666666666666666666e-01, "1.66666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667e-01"); BOOST_DEFINE_MATH_CONSTANT(three_quarters, 7.500000000000000000000000000000000000e-01, "7.50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e-01") BOOST_DEFINE_MATH_CONSTANT(root_two, 1.414213562373095048801688724209698078e+00, "1.41421356237309504880168872420969807856967187537694807317667973799073247846210703885038753432764157273501384623e+00") BOOST_DEFINE_MATH_CONSTANT(root_three, 1.732050807568877293527446341505872366e+00, "1.73205080756887729352744634150587236694280525381038062805580697945193301690880003708114618675724857567562614142e+00") @@ -302,6 +301,7 @@ namespace boost{ namespace math BOOST_DEFINE_MATH_CONSTANT(one_div_cbrt_pi, 6.827840632552956814670208331581645981e-01, "6.82784063255295681467020833158164598108367515632448804042681583118899226433403918237673501922595519865685577274e-01") BOOST_DEFINE_MATH_CONSTANT(e, 2.718281828459045235360287471352662497e+00, "2.71828182845904523536028747135266249775724709369995957496696762772407663035354759457138217852516642742746639193e+00") BOOST_DEFINE_MATH_CONSTANT(exp_minus_half, 6.065306597126334236037995349911804534e-01, "6.06530659712633423603799534991180453441918135487186955682892158735056519413748423998647611507989456026423789794e-01") + BOOST_DEFINE_MATH_CONSTANT(exp_minus_one, 3.678794411714423215955237701614608674e-01, "3.67879441171442321595523770161460867445811131031767834507836801697461495744899803357147274345919643746627325277e-01"); BOOST_DEFINE_MATH_CONSTANT(e_pow_pi, 2.314069263277926900572908636794854738e+01, "2.31406926327792690057290863679485473802661062426002119934450464095243423506904527835169719970675492196759527048e+01") BOOST_DEFINE_MATH_CONSTANT(root_e, 1.648721270700128146848650787814163571e+00, "1.64872127070012814684865078781416357165377610071014801157507931164066102119421560863277652005636664300286663776e+00") BOOST_DEFINE_MATH_CONSTANT(log10_e, 4.342944819032518276511289189166050822e-01, "4.34294481903251827651128918916605082294397005803666566114453783165864649208870774729224949338431748318706106745e-01") @@ -344,3 +344,5 @@ namespace boost{ namespace math #include #endif // BOOST_MATH_CONSTANTS_CONSTANTS_INCLUDED + + From 26aea4e7dfd82a9a7c1d102fb73449b397f63e28 Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 10 Aug 2017 17:49:17 +0100 Subject: [PATCH 11/71] Big refactor JM small_z and tag_type select code --- doc/html/backgrounders.html | 9 +- doc/html/constants.html | 9 +- doc/html/cstdfloat.html | 9 +- doc/html/dist.html | 9 +- doc/html/extern_c.html | 9 +- doc/html/gcd_lcm.html | 11 +- doc/html/index.html | 16 +- doc/html/indexes.html | 9 +- doc/html/indexes/s01.html | 121 +- doc/html/indexes/s02.html | 23 +- doc/html/indexes/s03.html | 13 +- doc/html/indexes/s04.html | 11 +- doc/html/indexes/s05.html | 239 ++- doc/html/internals.html | 15 +- doc/html/inverse_complex.html | 9 +- doc/html/math_toolkit/acknowledgement.html | 9 +- doc/html/math_toolkit/acknowledgements.html | 9 +- doc/html/math_toolkit/acos.html | 9 +- doc/html/math_toolkit/acosh.html | 9 +- doc/html/math_toolkit/airy.html | 9 +- doc/html/math_toolkit/airy/ai.html | 9 +- doc/html/math_toolkit/airy/aip.html | 9 +- doc/html/math_toolkit/airy/airy_root.html | 9 +- doc/html/math_toolkit/airy/bi.html | 9 +- doc/html/math_toolkit/airy/bip.html | 9 +- doc/html/math_toolkit/archetypes.html | 9 +- doc/html/math_toolkit/asin.html | 9 +- doc/html/math_toolkit/asinh.html | 9 +- doc/html/math_toolkit/atan.html | 9 +- doc/html/math_toolkit/atanh.html | 9 +- doc/html/math_toolkit/bessel.html | 9 +- .../bessel/bessel_derivatives.html | 9 +- .../math_toolkit/bessel/bessel_first.html | 9 +- doc/html/math_toolkit/bessel/bessel_over.html | 9 +- doc/html/math_toolkit/bessel/bessel_root.html | 9 +- doc/html/math_toolkit/bessel/mbessel.html | 9 +- doc/html/math_toolkit/bessel/sph_bessel.html | 9 +- doc/html/math_toolkit/building.html | 9 +- doc/html/math_toolkit/c99.html | 9 +- doc/html/math_toolkit/comp_compilers.html | 9 +- doc/html/math_toolkit/comparisons.html | 9 +- doc/html/math_toolkit/compilers_overview.html | 9 +- doc/html/math_toolkit/complex_history.html | 9 +- .../math_toolkit/complex_implementation.html | 9 +- doc/html/math_toolkit/config_macros.html | 9 +- doc/html/math_toolkit/constants.html | 9 +- doc/html/math_toolkit/constants_faq.html | 9 +- doc/html/math_toolkit/constants_intro.html | 9 +- doc/html/math_toolkit/contact.html | 9 +- doc/html/math_toolkit/conventions.html | 11 +- doc/html/math_toolkit/create.html | 9 +- doc/html/math_toolkit/credits.html | 9 +- doc/html/math_toolkit/directories.html | 9 +- doc/html/math_toolkit/dist_concept.html | 9 +- doc/html/math_toolkit/dist_ref.html | 9 +- .../dist_ref/dist_algorithms.html | 9 +- doc/html/math_toolkit/dist_ref/dists.html | 9 +- .../dist_ref/dists/arcine_dist.html | 9 +- .../dist_ref/dists/bernoulli_dist.html | 9 +- .../dist_ref/dists/beta_dist.html | 9 +- .../dist_ref/dists/binomial_dist.html | 9 +- .../dist_ref/dists/cauchy_dist.html | 9 +- .../dist_ref/dists/chi_squared_dist.html | 9 +- .../math_toolkit/dist_ref/dists/exp_dist.html | 9 +- .../dist_ref/dists/extreme_dist.html | 9 +- .../math_toolkit/dist_ref/dists/f_dist.html | 9 +- .../dist_ref/dists/gamma_dist.html | 9 +- .../dist_ref/dists/geometric_dist.html | 9 +- .../dist_ref/dists/hyperexponential_dist.html | 9 +- .../dist_ref/dists/hypergeometric_dist.html | 9 +- .../dists/inverse_chi_squared_dist.html | 9 +- .../dist_ref/dists/inverse_gamma_dist.html | 9 +- .../dist_ref/dists/inverse_gaussian_dist.html | 9 +- .../dist_ref/dists/laplace_dist.html | 9 +- .../dist_ref/dists/logistic_dist.html | 9 +- .../dist_ref/dists/lognormal_dist.html | 9 +- .../dist_ref/dists/nc_beta_dist.html | 9 +- .../dist_ref/dists/nc_chi_squared_dist.html | 9 +- .../dist_ref/dists/nc_f_dist.html | 9 +- .../dist_ref/dists/nc_t_dist.html | 9 +- .../dists/negative_binomial_dist.html | 9 +- .../dist_ref/dists/normal_dist.html | 9 +- .../math_toolkit/dist_ref/dists/pareto.html | 9 +- .../dist_ref/dists/poisson_dist.html | 9 +- .../math_toolkit/dist_ref/dists/rayleigh.html | 9 +- .../dist_ref/dists/skew_normal_dist.html | 9 +- .../dist_ref/dists/students_t_dist.html | 9 +- .../dist_ref/dists/triangular_dist.html | 9 +- .../dist_ref/dists/uniform_dist.html | 9 +- .../dist_ref/dists/weibull_dist.html | 9 +- doc/html/math_toolkit/dist_ref/nmp.html | 9 +- doc/html/math_toolkit/ellint.html | 9 +- doc/html/math_toolkit/ellint/ellint_1.html | 9 +- doc/html/math_toolkit/ellint/ellint_2.html | 9 +- doc/html/math_toolkit/ellint/ellint_3.html | 9 +- .../math_toolkit/ellint/ellint_carlson.html | 9 +- doc/html/math_toolkit/ellint/ellint_d.html | 9 +- .../math_toolkit/ellint/ellint_intro.html | 9 +- .../math_toolkit/ellint/heuman_lambda.html | 9 +- doc/html/math_toolkit/ellint/jacobi_zeta.html | 9 +- doc/html/math_toolkit/error_handling.html | 9 +- doc/html/math_toolkit/exact_typdefs.html | 9 +- doc/html/math_toolkit/examples.html | 9 +- doc/html/math_toolkit/exp.html | 9 +- doc/html/math_toolkit/expint.html | 9 +- doc/html/math_toolkit/expint/expint_i.html | 9 +- doc/html/math_toolkit/expint/expint_n.html | 9 +- doc/html/math_toolkit/factorials.html | 9 +- .../math_toolkit/factorials/sf_binomial.html | 9 +- .../factorials/sf_double_factorial.html | 9 +- .../math_toolkit/factorials/sf_factorial.html | 9 +- .../factorials/sf_falling_factorial.html | 9 +- .../factorials/sf_rising_factorial.html | 9 +- doc/html/math_toolkit/fastest_typdefs.html | 9 +- doc/html/math_toolkit/float128.html | 9 +- .../math_toolkit/float128/exp_function.html | 9 +- .../math_toolkit/float128/overloading.html | 9 +- doc/html/math_toolkit/float128/typeinfo.html | 9 +- doc/html/math_toolkit/float128_hints.html | 9 +- doc/html/math_toolkit/float_comparison.html | 9 +- doc/html/math_toolkit/fp_facets.html | 9 +- doc/html/math_toolkit/fp_facets/examples.html | 9 +- .../math_toolkit/fp_facets/facets_intro.html | 9 +- .../math_toolkit/fp_facets/portability.html | 9 +- .../math_toolkit/fp_facets/rationale.html | 9 +- .../math_toolkit/fp_facets/reference.html | 9 +- doc/html/math_toolkit/fpclass.html | 9 +- doc/html/math_toolkit/future.html | 9 +- doc/html/math_toolkit/getting_best.html | 9 +- doc/html/math_toolkit/greatest_typdefs.html | 9 +- doc/html/math_toolkit/hankel.html | 9 +- doc/html/math_toolkit/hankel/cyl_hankel.html | 9 +- doc/html/math_toolkit/hankel/sph_hankel.html | 9 +- doc/html/math_toolkit/high_precision.html | 9 +- .../math_toolkit/high_precision/e_float.html | 9 +- .../math_toolkit/high_precision/float128.html | 9 +- .../math_toolkit/high_precision/use_mpfr.html | 9 +- .../high_precision/use_multiprecision.html | 9 +- .../math_toolkit/high_precision/use_ntl.html | 9 +- .../high_precision/using_test.html | 9 +- .../high_precision/why_high_precision.html | 9 +- doc/html/math_toolkit/hints.html | 9 +- doc/html/math_toolkit/history1.html | 9 +- doc/html/math_toolkit/history2.html | 9 +- doc/html/math_toolkit/internals.html | 9 +- doc/html/math_toolkit/internals/cf.html | 9 +- .../math_toolkit/internals/error_test.html | 9 +- doc/html/math_toolkit/internals/minimax.html | 9 +- .../internals/series_evaluation.html | 9 +- .../math_toolkit/internals/test_data.html | 9 +- doc/html/math_toolkit/internals/tuples.html | 9 +- doc/html/math_toolkit/internals_overview.html | 9 +- doc/html/math_toolkit/interp.html | 9 +- doc/html/math_toolkit/intro_pol_overview.html | 9 +- doc/html/math_toolkit/inv_hyper.html | 9 +- doc/html/math_toolkit/inv_hyper/acosh.html | 9 +- doc/html/math_toolkit/inv_hyper/asinh.html | 9 +- doc/html/math_toolkit/inv_hyper/atanh.html | 9 +- .../inv_hyper/inv_hyper_over.html | 9 +- doc/html/math_toolkit/issues.html | 9 +- doc/html/math_toolkit/jacobi.html | 9 +- doc/html/math_toolkit/jacobi/jac_over.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_cd.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_cn.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_cs.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_dc.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_dn.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_ds.html | 9 +- .../math_toolkit/jacobi/jacobi_elliptic.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_nc.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_nd.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_ns.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_sc.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_sd.html | 9 +- doc/html/math_toolkit/jacobi/jacobi_sn.html | 9 +- doc/html/math_toolkit/lanczos.html | 9 +- doc/html/math_toolkit/logs_and_tables.html | 9 +- .../logs_and_tables/all_table.html | 9 +- .../math_toolkit/logs_and_tables/logs.html | 9 +- doc/html/math_toolkit/macros.html | 9 +- doc/html/math_toolkit/main_faq.html | 9 +- doc/html/math_toolkit/main_intro.html | 13 +- doc/html/math_toolkit/main_tr1.html | 9 +- doc/html/math_toolkit/mem_typedef.html | 9 +- doc/html/math_toolkit/minimum_typdefs.html | 9 +- doc/html/math_toolkit/multiprecision.html | 9 +- doc/html/math_toolkit/namespaces.html | 9 +- doc/html/math_toolkit/navigation.html | 11 +- doc/html/math_toolkit/new_const.html | 9 +- doc/html/math_toolkit/next_float.html | 9 +- .../next_float/float_advance.html | 9 +- .../next_float/float_distance.html | 9 +- .../math_toolkit/next_float/float_next.html | 9 +- .../math_toolkit/next_float/float_prior.html | 9 +- .../math_toolkit/next_float/nextafter.html | 9 +- doc/html/math_toolkit/next_float/ulp.html | 9 +- doc/html/math_toolkit/number_series.html | 9 +- .../number_series/bernoulli_numbers.html | 9 +- .../math_toolkit/number_series/primes.html | 9 +- .../number_series/tangent_numbers.html | 9 +- doc/html/math_toolkit/oct_create.html | 9 +- doc/html/math_toolkit/oct_header.html | 9 +- doc/html/math_toolkit/oct_history.html | 9 +- doc/html/math_toolkit/oct_mem_fun.html | 9 +- doc/html/math_toolkit/oct_non_mem.html | 9 +- doc/html/math_toolkit/oct_overview.html | 9 +- doc/html/math_toolkit/oct_specialization.html | 9 +- doc/html/math_toolkit/oct_synopsis.html | 9 +- doc/html/math_toolkit/oct_tests.html | 9 +- doc/html/math_toolkit/oct_todo.html | 9 +- doc/html/math_toolkit/oct_trans.html | 9 +- doc/html/math_toolkit/oct_typedefs.html | 9 +- doc/html/math_toolkit/oct_value_ops.html | 9 +- doc/html/math_toolkit/octonion.html | 9 +- doc/html/math_toolkit/overview_tr1.html | 9 +- doc/html/math_toolkit/owens_t.html | 9 +- doc/html/math_toolkit/perf_over1.html | 9 +- doc/html/math_toolkit/perf_over2.html | 9 +- doc/html/math_toolkit/perf_test_app.html | 9 +- doc/html/math_toolkit/pol_overview.html | 9 +- doc/html/math_toolkit/pol_ref.html | 9 +- .../pol_ref/assert_undefined.html | 9 +- .../pol_ref/discrete_quant_ref.html | 9 +- .../pol_ref/error_handling_policies.html | 9 +- .../pol_ref/internal_promotion.html | 9 +- .../math_toolkit/pol_ref/iteration_pol.html | 9 +- .../math_toolkit/pol_ref/namespace_pol.html | 9 +- .../math_toolkit/pol_ref/pol_ref_ref.html | 9 +- .../math_toolkit/pol_ref/policy_defaults.html | 9 +- .../math_toolkit/pol_ref/precision_pol.html | 9 +- doc/html/math_toolkit/pol_tutorial.html | 9 +- .../pol_tutorial/ad_hoc_dist_policies.html | 9 +- .../pol_tutorial/ad_hoc_sf_policies.html | 9 +- .../changing_policy_defaults.html | 9 +- .../pol_tutorial/namespace_policies.html | 9 +- .../pol_tutorial/policy_tut_defaults.html | 9 +- .../pol_tutorial/policy_usage.html | 9 +- .../pol_tutorial/understand_dis_quant.html | 9 +- .../pol_tutorial/user_def_err_pol.html | 9 +- .../pol_tutorial/what_is_a_policy.html | 9 +- doc/html/math_toolkit/powers.html | 9 +- doc/html/math_toolkit/powers/cbrt.html | 9 +- doc/html/math_toolkit/powers/cos_pi.html | 9 +- doc/html/math_toolkit/powers/ct_pow.html | 9 +- doc/html/math_toolkit/powers/expm1.html | 9 +- doc/html/math_toolkit/powers/hypot.html | 9 +- doc/html/math_toolkit/powers/log1p.html | 9 +- doc/html/math_toolkit/powers/powm1.html | 9 +- doc/html/math_toolkit/powers/sin_pi.html | 9 +- doc/html/math_toolkit/powers/sqrt1pm1.html | 9 +- doc/html/math_toolkit/quat.html | 9 +- doc/html/math_toolkit/quat_header.html | 9 +- doc/html/math_toolkit/quat_history.html | 9 +- doc/html/math_toolkit/quat_mem_fun.html | 9 +- doc/html/math_toolkit/quat_non_mem.html | 9 +- doc/html/math_toolkit/quat_overview.html | 9 +- doc/html/math_toolkit/quat_synopsis.html | 9 +- doc/html/math_toolkit/quat_tests.html | 9 +- doc/html/math_toolkit/quat_todo.html | 9 +- doc/html/math_toolkit/rationale.html | 9 +- doc/html/math_toolkit/real_concepts.html | 9 +- doc/html/math_toolkit/refs.html | 9 +- doc/html/math_toolkit/relative_error.html | 9 +- doc/html/math_toolkit/remez.html | 9 +- doc/html/math_toolkit/result_type.html | 9 +- doc/html/math_toolkit/roots.html | 16 +- doc/html/math_toolkit/roots/bad_guess.html | 9 +- doc/html/math_toolkit/roots/bad_roots.html | 9 +- doc/html/math_toolkit/roots/brent_minima.html | 9 +- .../math_toolkit/roots/root_comparison.html | 9 +- .../root_comparison/cbrt_comparison.html | 9 +- .../root_comparison/elliptic_comparison.html | 15 +- .../root_comparison/root_n_comparison.html | 9 +- .../roots/root_finding_examples.html | 9 +- .../root_finding_examples/5th_root_eg.html | 9 +- .../roots/root_finding_examples/cbrt_eg.html | 9 +- .../root_finding_examples/elliptic_eg.html | 9 +- .../roots/root_finding_examples/lambda.html | 9 +- .../multiprecision_root.html | 9 +- .../roots/root_finding_examples/nth_root.html | 9 +- doc/html/math_toolkit/roots/roots_deriv.html | 9 +- .../math_toolkit/roots/roots_noderiv.html | 9 +- .../roots/roots_noderiv/TOMS748.html | 9 +- .../roots/roots_noderiv/bisect.html | 9 +- .../roots/roots_noderiv/bracket_solve.html | 9 +- .../roots/roots_noderiv/brent.html | 9 +- .../roots/roots_noderiv/implementation.html | 9 +- .../roots/roots_noderiv/root_termination.html | 9 +- doc/html/math_toolkit/rounding.html | 9 +- doc/html/math_toolkit/rounding/modf.html | 9 +- doc/html/math_toolkit/rounding/round.html | 9 +- doc/html/math_toolkit/rounding/trunc.html | 9 +- doc/html/math_toolkit/sf_beta.html | 9 +- .../math_toolkit/sf_beta/beta_derivative.html | 9 +- .../math_toolkit/sf_beta/beta_function.html | 9 +- .../math_toolkit/sf_beta/ibeta_function.html | 9 +- .../sf_beta/ibeta_inv_function.html | 9 +- doc/html/math_toolkit/sf_erf.html | 9 +- .../math_toolkit/sf_erf/error_function.html | 9 +- doc/html/math_toolkit/sf_erf/error_inv.html | 9 +- doc/html/math_toolkit/sf_gamma.html | 9 +- doc/html/math_toolkit/sf_gamma/digamma.html | 9 +- .../sf_gamma/gamma_derivatives.html | 9 +- .../math_toolkit/sf_gamma/gamma_ratios.html | 9 +- doc/html/math_toolkit/sf_gamma/igamma.html | 9 +- .../math_toolkit/sf_gamma/igamma_inv.html | 9 +- doc/html/math_toolkit/sf_gamma/lgamma.html | 9 +- doc/html/math_toolkit/sf_gamma/polygamma.html | 9 +- doc/html/math_toolkit/sf_gamma/tgamma.html | 9 +- doc/html/math_toolkit/sf_gamma/trigamma.html | 9 +- doc/html/math_toolkit/sf_implementation.html | 9 +- doc/html/math_toolkit/sf_poly.html | 11 +- doc/html/math_toolkit/sf_poly/hermite.html | 9 +- doc/html/math_toolkit/sf_poly/laguerre.html | 15 +- doc/html/math_toolkit/sf_poly/legendre.html | 62 +- doc/html/math_toolkit/sf_poly/sph_harm.html | 9 +- doc/html/math_toolkit/sign_functions.html | 9 +- doc/html/math_toolkit/sinc.html | 9 +- doc/html/math_toolkit/sinc/sinc_overview.html | 9 +- doc/html/math_toolkit/sinc/sinc_pi.html | 9 +- doc/html/math_toolkit/sinc/sinhc_pi.html | 9 +- doc/html/math_toolkit/spec.html | 9 +- doc/html/math_toolkit/special_tut.html | 9 +- .../special_tut/special_tut_impl.html | 9 +- .../special_tut/special_tut_test.html | 9 +- doc/html/math_toolkit/specified_typedefs.html | 9 +- doc/html/math_toolkit/stat_tut.html | 9 +- .../math_toolkit/stat_tut/dist_params.html | 9 +- doc/html/math_toolkit/stat_tut/overview.html | 9 +- .../stat_tut/overview/complements.html | 9 +- .../stat_tut/overview/generic.html | 9 +- .../stat_tut/overview/headers.html | 9 +- .../stat_tut/overview/objects.html | 9 +- .../stat_tut/overview/parameters.html | 9 +- .../stat_tut/overview/summary.html | 9 +- doc/html/math_toolkit/stat_tut/variates.html | 9 +- doc/html/math_toolkit/stat_tut/weg.html | 9 +- .../math_toolkit/stat_tut/weg/binom_eg.html | 9 +- .../stat_tut/weg/binom_eg/binom_conf.html | 9 +- .../stat_tut/weg/binom_eg/binom_size_eg.html | 9 +- .../binom_eg/binomial_coinflip_example.html | 9 +- .../weg/binom_eg/binomial_quiz_example.html | 9 +- .../math_toolkit/stat_tut/weg/c_sharp.html | 9 +- doc/html/math_toolkit/stat_tut/weg/cs_eg.html | 9 +- .../stat_tut/weg/cs_eg/chi_sq_intervals.html | 9 +- .../stat_tut/weg/cs_eg/chi_sq_size.html | 9 +- .../stat_tut/weg/cs_eg/chi_sq_test.html | 9 +- .../stat_tut/weg/dist_construct_eg.html | 9 +- .../math_toolkit/stat_tut/weg/error_eg.html | 9 +- doc/html/math_toolkit/stat_tut/weg/f_eg.html | 9 +- .../math_toolkit/stat_tut/weg/find_eg.html | 9 +- .../weg/find_eg/find_location_eg.html | 9 +- .../weg/find_eg/find_mean_and_sd_eg.html | 9 +- .../stat_tut/weg/find_eg/find_scale_eg.html | 9 +- .../stat_tut/weg/geometric_eg.html | 9 +- .../stat_tut/weg/inverse_chi_squared_eg.html | 9 +- .../stat_tut/weg/nag_library.html | 9 +- .../math_toolkit/stat_tut/weg/nccs_eg.html | 9 +- .../stat_tut/weg/nccs_eg/nccs_power_eg.html | 9 +- .../stat_tut/weg/neg_binom_eg.html | 9 +- .../weg/neg_binom_eg/neg_binom_conf.html | 9 +- .../weg/neg_binom_eg/neg_binom_size_eg.html | 9 +- .../negative_binomial_example1.html | 49 +- .../negative_binomial_example2.html | 9 +- .../stat_tut/weg/normal_example.html | 9 +- .../weg/normal_example/normal_misc.html | 9 +- doc/html/math_toolkit/stat_tut/weg/st_eg.html | 9 +- .../stat_tut/weg/st_eg/paired_st.html | 9 +- .../weg/st_eg/tut_mean_intervals.html | 9 +- .../stat_tut/weg/st_eg/tut_mean_size.html | 9 +- .../stat_tut/weg/st_eg/tut_mean_test.html | 9 +- .../weg/st_eg/two_sample_students_t.html | 9 +- doc/html/math_toolkit/threads.html | 9 +- doc/html/math_toolkit/tr1_ref.html | 9 +- doc/html/math_toolkit/tradoffs.html | 9 +- doc/html/math_toolkit/trans.html | 9 +- doc/html/math_toolkit/tuning.html | 9 +- doc/html/math_toolkit/tutorial.html | 9 +- doc/html/math_toolkit/tutorial/non_templ.html | 9 +- doc/html/math_toolkit/tutorial/templ.html | 9 +- doc/html/math_toolkit/tutorial/user_def.html | 9 +- doc/html/math_toolkit/value_op.html | 9 +- doc/html/math_toolkit/zetas.html | 9 +- doc/html/math_toolkit/zetas/zeta.html | 9 +- doc/html/octonions.html | 9 +- doc/html/overview.html | 9 +- doc/html/perf.html | 9 +- doc/html/policy.html | 9 +- doc/html/quaternions.html | 9 +- doc/html/rooting.html | 28 +- doc/html/special.html | 11 +- doc/html/standalone_HTML.manifest | 10 +- doc/html/status.html | 9 +- doc/html/using_udt.html | 9 +- doc/html/utils.html | 9 +- doc/html4_symbols.qbk | 3 + doc/sf/lambert_w.qbk | 56 +- .../boost/math/cstdfloat/cstdfloat_cmath.hpp | 4 +- .../math/special_functions/lambert_w.hpp | 1810 ++++++++++++----- test/test_lambert_w.cpp | 24 +- 400 files changed, 3778 insertions(+), 2195 deletions(-) diff --git a/doc/html/backgrounders.html b/doc/html/backgrounders.html index c525226ee..2b063f24c 100644 --- a/doc/html/backgrounders.html +++ b/doc/html/backgrounders.html @@ -52,10 +52,11 @@ -
    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    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)

    diff --git a/doc/html/constants.html b/doc/html/constants.html index c1167aa83..2ae5b6a15 100644 --- a/doc/html/constants.html +++ b/doc/html/constants.html @@ -45,10 +45,11 @@
    -
    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    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)

    diff --git a/doc/html/cstdfloat.html b/doc/html/cstdfloat.html index 19b93219c..9375ce472 100644 --- a/doc/html/cstdfloat.html +++ b/doc/html/cstdfloat.html @@ -53,10 +53,11 @@
    -
    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    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)

    diff --git a/doc/html/dist.html b/doc/html/dist.html index ac216738f..f7682dbcd 100644 --- a/doc/html/dist.html +++ b/doc/html/dist.html @@ -203,10 +203,11 @@
    -
    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    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)

    diff --git a/doc/html/extern_c.html b/doc/html/extern_c.html index d841e23f7..9d4ee34d9 100644 --- a/doc/html/extern_c.html +++ b/doc/html/extern_c.html @@ -36,10 +36,11 @@
    -
    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    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)

    diff --git a/doc/html/gcd_lcm.html b/doc/html/gcd_lcm.html index 937b9ec70..025dbaa31 100644 --- a/doc/html/gcd_lcm.html +++ b/doc/html/gcd_lcm.html @@ -7,7 +7,7 @@ - + @@ -37,10 +37,11 @@
    - - +
    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    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)

    diff --git a/doc/html/index.html b/doc/html/index.html index 08732a864..1b28f0e56 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -61,6 +61,9 @@ Gautam Sewani

    +Nicholas Thompson +

    +

    Thijs van den Berg

    @@ -74,10 +77,11 @@ This manual is also available in printer friendly PDF format, and as a CD ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22.

    -

    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    Last revised: April 24, 2017 at 18:38:47 GMT

    Last revised: July 17, 2017 at 12:24:57 GMT
    diff --git a/doc/html/indexes.html b/doc/html/indexes.html index e6a12d313..a6b9d8844 100644 --- a/doc/html/indexes.html +++ b/doc/html/indexes.html @@ -38,10 +38,11 @@
    -
    Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

    +

    Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

    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)

    diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 8261fe840..51508602d 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,8 +24,8 @@

    -Function Index

    -

    2 4 A B C D E F G H I J K L M N O P Q R S T U V X Y Z

    +Function Index
    +

    2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

    2 @@ -40,6 +40,7 @@

  • Elliptic Integrals of the Third Kind - Legendre Form

  • Finding Zeros of Bessel Functions of the First and Second Kinds

  • History and What's New

    • +

  • Legendre-Stieltjes Polynomials

  • Noncentral Beta Distribution

  • Polynomial Method Comparison with Microsoft Visual C++ version 14.0 on Windows x64

  • Rational Method Comparison with Microsoft Visual C++ version 14.0 on Windows x64

    • @@ -118,6 +119,19 @@
  • +

    al

    +
    +
    • +
  • +

    alpha

    +
    +
    • +

  • area

  • +

    legendre_p_prime

    +
    +
    • +
  • +

    legendre_p_zeros

    +
    +
    • +

  • legendre_q

    • @@ -2027,10 +2068,12 @@

  • n

    • @@ -2174,11 +2217,14 @@

    operator

  • +

    small

    +
    +
    • +

  • spherical

    • @@ -2800,6 +2862,16 @@

    typeid

    +
  • +

    types

    +
    +
    • U @@ -2818,6 +2890,10 @@
  • +

    unity

    +
    +
    • +

  • unreal

    • Octonion Member Functions

      • @@ -2897,6 +2973,7 @@

      v

      +W +
      +
      +
      X
      • @@ -2979,10 +3063,11 @@
      -
      Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

      +

      Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

      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)

      diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index fc9612788..0ce777c7c 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

      -Class Index

      +Class Index

      A B C D E F G H I L M N O P Q R S T U W

      @@ -35,6 +35,10 @@ B
      D @@ -124,6 +132,10 @@
      -
      Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

      +

      Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

      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)

      diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 1b45ecfca..0bad43edb 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

      -Typedef Index

      +Typedef Index

      A B C D E F G H I L N O P R S T U V W

      @@ -400,7 +400,7 @@

    • Octonion Specializations

    • Pareto Distribution

    • Poisson Distribution

      • -

    • Polynomials

      • +

    • Polynomials

    • Quaternion Member Typedefs

    • Quaternion Specializations

    • Rayleigh Distribution

      • @@ -425,10 +425,11 @@
      -
      Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

      +

      Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

      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)

      diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index cf01c41b7..48c75f038 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

      -Macro Index

      +Macro Index

      B F

      @@ -335,10 +335,11 @@
      -
      Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

      +

      Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

      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)

      diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 963477183..80474a850 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

      -Index

      +Index

      2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

      @@ -39,6 +39,7 @@

    • Elliptic Integrals of the Third Kind - Legendre Form

    • Finding Zeros of Bessel Functions of the First and Second Kinds

    • History and What's New

      • +

    • Legendre-Stieltjes Polynomials

    • Noncentral Beta Distribution

    • Polynomial Method Comparison with Microsoft Visual C++ version 14.0 on Windows x64

    • Rational Method Comparison with Microsoft Visual C++ version 14.0 on Windows x64

      • @@ -66,6 +67,7 @@
    • +

      Adaptive Trapezoidal Quadrature

      +
      +
      • +

    • Advancing a floating-point Value by a Specific Representation Distance (ULP) float_advance

    • +

      al

      +
      +
      • +

    • Algorithm TOMS 748: Alefeld, Potra and Shi: Enclosing zeros of continuous functions

    • +

      alpha

      +
      +
      • +

    • arcsine

      • @@ -441,6 +468,21 @@
      @@ -519,6 +562,7 @@
    • +

      Conceptual Archetypes for Reals and Distributions

      +
      +
      • +

    • Conceptual Requirements for Distribution Types

    • @@ -3197,6 +3268,7 @@

      expression

    • +

      F Distribution Examples

      +
      +
      • +

    • Facets for Floating-Point Infinities and NaNs

      • +
    • +

      guess

      +
      +
      • H @@ -4248,6 +4328,7 @@

    • ibeta_inva

    • ibeta_invb

    • p

      • +

    • small

    • x

      • @@ -4311,7 +4392,10 @@

    • interval

      -
      +

    • Introduction

      @@ -4351,6 +4435,7 @@

    • expression

    • performance

    • scale

      • +

    • small

    • variance

      • @@ -4666,6 +4751,22 @@
    • +

      Lambert W function

      +
      +
      • +
    • +

      lambert_w

      +
      +
      • +

    • Lanczos approximation

    • +

      Legendre-Stieltjes Polynomials

      +
      +
      • +

    • legendref

    • +

      legendre_p_prime

      +
      +
      • +
    • +

      legendre_p_zeros

      +
      +
      • +

    • legendre_q

    • +

      legendre_stieltjes

      +
      +
      • +

    • lgamma

      • @@ -5148,10 +5274,12 @@

    • n

      • @@ -5326,6 +5454,7 @@

      • 2

      • accuracy

        • +

      • alpha

      • beta

      • expression

      • non_central_beta

        • @@ -5526,11 +5655,14 @@

        operator

        U @@ -7025,6 +7188,10 @@

      • uniform_distribution

      • +

        unity

        +
        +
        • +

      • unreal

        • -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/internals.html b/doc/html/internals.html index 469d9f988..956ac37ee 100644 --- a/doc/html/internals.html +++ b/doc/html/internals.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
        -PrevUpHomeNext +PrevUpHomeNext

        @@ -47,10 +47,11 @@

        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        @@ -58,7 +59,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/inverse_complex.html b/doc/html/inverse_complex.html index 672028829..42b426fb6 100644 --- a/doc/html/inverse_complex.html +++ b/doc/html/inverse_complex.html @@ -48,10 +48,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/acknowledgement.html b/doc/html/math_toolkit/acknowledgement.html index 02bf874c8..5b633500a 100644 --- a/doc/html/math_toolkit/acknowledgement.html +++ b/doc/html/math_toolkit/acknowledgement.html @@ -35,10 +35,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/acknowledgements.html b/doc/html/math_toolkit/acknowledgements.html index 111213705..8dd5a9cc1 100644 --- a/doc/html/math_toolkit/acknowledgements.html +++ b/doc/html/math_toolkit/acknowledgements.html @@ -35,10 +35,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/acos.html b/doc/html/math_toolkit/acos.html index ab1f53983..46990b238 100644 --- a/doc/html/math_toolkit/acos.html +++ b/doc/html/math_toolkit/acos.html @@ -49,10 +49,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/acosh.html b/doc/html/math_toolkit/acosh.html index 7ad597431..9aeba41d1 100644 --- a/doc/html/math_toolkit/acosh.html +++ b/doc/html/math_toolkit/acosh.html @@ -49,10 +49,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/airy.html b/doc/html/math_toolkit/airy.html index caaa6c728..0aac77384 100644 --- a/doc/html/math_toolkit/airy.html +++ b/doc/html/math_toolkit/airy.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/airy/ai.html b/doc/html/math_toolkit/airy/ai.html index 5bbf83a92..c0889c847 100644 --- a/doc/html/math_toolkit/airy/ai.html +++ b/doc/html/math_toolkit/airy/ai.html @@ -106,10 +106,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/airy/aip.html b/doc/html/math_toolkit/airy/aip.html index 318c2c392..2789a51b7 100644 --- a/doc/html/math_toolkit/airy/aip.html +++ b/doc/html/math_toolkit/airy/aip.html @@ -102,10 +102,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/airy/airy_root.html b/doc/html/math_toolkit/airy/airy_root.html index e57617749..dc4263d74 100644 --- a/doc/html/math_toolkit/airy/airy_root.html +++ b/doc/html/math_toolkit/airy/airy_root.html @@ -458,10 +458,11 @@ airy_ai_zeros:
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/airy/bi.html b/doc/html/math_toolkit/airy/bi.html index 7abb0b6fe..d307e8411 100644 --- a/doc/html/math_toolkit/airy/bi.html +++ b/doc/html/math_toolkit/airy/bi.html @@ -101,10 +101,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/airy/bip.html b/doc/html/math_toolkit/airy/bip.html index b951a4099..8095283de 100644 --- a/doc/html/math_toolkit/airy/bip.html +++ b/doc/html/math_toolkit/airy/bip.html @@ -102,10 +102,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/archetypes.html b/doc/html/math_toolkit/archetypes.html index 3dd7edb34..03d0a558e 100644 --- a/doc/html/math_toolkit/archetypes.html +++ b/doc/html/math_toolkit/archetypes.html @@ -180,10 +180,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/asin.html b/doc/html/math_toolkit/asin.html index f577b9d3b..16a7e2679 100644 --- a/doc/html/math_toolkit/asin.html +++ b/doc/html/math_toolkit/asin.html @@ -49,10 +49,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/asinh.html b/doc/html/math_toolkit/asinh.html index 8ea252e41..c6eb75dce 100644 --- a/doc/html/math_toolkit/asinh.html +++ b/doc/html/math_toolkit/asinh.html @@ -49,10 +49,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/atan.html b/doc/html/math_toolkit/atan.html index cd3478af1..60ae26005 100644 --- a/doc/html/math_toolkit/atan.html +++ b/doc/html/math_toolkit/atan.html @@ -49,10 +49,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/atanh.html b/doc/html/math_toolkit/atanh.html index 7a44de2ed..83bd263fa 100644 --- a/doc/html/math_toolkit/atanh.html +++ b/doc/html/math_toolkit/atanh.html @@ -49,10 +49,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/bessel.html b/doc/html/math_toolkit/bessel.html index 878b82c76..12f530c42 100644 --- a/doc/html/math_toolkit/bessel.html +++ b/doc/html/math_toolkit/bessel.html @@ -42,10 +42,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/bessel/bessel_derivatives.html b/doc/html/math_toolkit/bessel/bessel_derivatives.html index 98a175f6f..af227263c 100644 --- a/doc/html/math_toolkit/bessel/bessel_derivatives.html +++ b/doc/html/math_toolkit/bessel/bessel_derivatives.html @@ -1435,10 +1435,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/bessel/bessel_first.html b/doc/html/math_toolkit/bessel/bessel_first.html index b805810db..974a73a53 100644 --- a/doc/html/math_toolkit/bessel/bessel_first.html +++ b/doc/html/math_toolkit/bessel/bessel_first.html @@ -1370,10 +1370,11 @@ are also computed by recursions (involving gamma functions), but
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/bessel/bessel_over.html b/doc/html/math_toolkit/bessel/bessel_over.html index 50305d8f1..66a9c7edc 100644 --- a/doc/html/math_toolkit/bessel/bessel_over.html +++ b/doc/html/math_toolkit/bessel/bessel_over.html @@ -195,10 +195,11 @@ is also known as the spherical
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/bessel/bessel_root.html b/doc/html/math_toolkit/bessel/bessel_root.html index 073a062a9..306f3e7ba 100644 --- a/doc/html/math_toolkit/bessel/bessel_root.html +++ b/doc/html/math_toolkit/bessel/bessel_root.html @@ -747,10 +747,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/bessel/mbessel.html b/doc/html/math_toolkit/bessel/mbessel.html index 4053bbdcd..97153cbec 100644 --- a/doc/html/math_toolkit/bessel/mbessel.html +++ b/doc/html/math_toolkit/bessel/mbessel.html @@ -1125,10 +1125,11 @@ are also computed by recursions (involving gamma functions), but
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/bessel/sph_bessel.html b/doc/html/math_toolkit/bessel/sph_bessel.html index 5ef05e6fd..86938dddf 100644 --- a/doc/html/math_toolkit/bessel/sph_bessel.html +++ b/doc/html/math_toolkit/bessel/sph_bessel.html @@ -270,10 +270,11 @@ for small x:
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/building.html b/doc/html/math_toolkit/building.html index d22e9f332..f8d1e5868 100644 --- a/doc/html/math_toolkit/building.html +++ b/doc/html/math_toolkit/building.html @@ -147,10 +147,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/c99.html b/doc/html/math_toolkit/c99.html index b1669737d..39001e918 100644 --- a/doc/html/math_toolkit/c99.html +++ b/doc/html/math_toolkit/c99.html @@ -460,10 +460,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/comp_compilers.html b/doc/html/math_toolkit/comp_compilers.html index 8b3c8ecb5..e3b57b5f9 100644 --- a/doc/html/math_toolkit/comp_compilers.html +++ b/doc/html/math_toolkit/comp_compilers.html @@ -2395,10 +2395,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/comparisons.html b/doc/html/math_toolkit/comparisons.html index 35c52e81d..b277a54d3 100644 --- a/doc/html/math_toolkit/comparisons.html +++ b/doc/html/math_toolkit/comparisons.html @@ -253,10 +253,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/compilers_overview.html b/doc/html/math_toolkit/compilers_overview.html index 52b855c0c..3dd60e707 100644 --- a/doc/html/math_toolkit/compilers_overview.html +++ b/doc/html/math_toolkit/compilers_overview.html @@ -666,10 +666,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/complex_history.html b/doc/html/math_toolkit/complex_history.html index 3a4cc4df5..f765126ba 100644 --- a/doc/html/math_toolkit/complex_history.html +++ b/doc/html/math_toolkit/complex_history.html @@ -37,10 +37,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/complex_implementation.html b/doc/html/math_toolkit/complex_implementation.html index be35ce8d5..aaeddcc7e 100644 --- a/doc/html/math_toolkit/complex_implementation.html +++ b/doc/html/math_toolkit/complex_implementation.html @@ -46,10 +46,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/config_macros.html b/doc/html/math_toolkit/config_macros.html index bf52804f6..8cac04395 100644 --- a/doc/html/math_toolkit/config_macros.html +++ b/doc/html/math_toolkit/config_macros.html @@ -366,10 +366,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/constants.html b/doc/html/math_toolkit/constants.html index fac07c063..c5516c340 100644 --- a/doc/html/math_toolkit/constants.html +++ b/doc/html/math_toolkit/constants.html @@ -1473,10 +1473,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/constants_faq.html b/doc/html/math_toolkit/constants_faq.html index 8667e08be..2d4c6b08e 100644 --- a/doc/html/math_toolkit/constants_faq.html +++ b/doc/html/math_toolkit/constants_faq.html @@ -466,10 +466,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/constants_intro.html b/doc/html/math_toolkit/constants_intro.html index d5e1445a1..0d4650a43 100644 --- a/doc/html/math_toolkit/constants_intro.html +++ b/doc/html/math_toolkit/constants_intro.html @@ -114,10 +114,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/contact.html b/doc/html/math_toolkit/contact.html index 52a851e73..734ece9f8 100644 --- a/doc/html/math_toolkit/contact.html +++ b/doc/html/math_toolkit/contact.html @@ -46,10 +46,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index 7be7293ff..faf17879e 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. @@ -70,10 +70,11 @@ -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/create.html b/doc/html/math_toolkit/create.html index ef1de029a..961ec1768 100644 --- a/doc/html/math_toolkit/create.html +++ b/doc/html/math_toolkit/create.html @@ -104,10 +104,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/credits.html b/doc/html/math_toolkit/credits.html index 83c9071bf..73be0c96f 100644 --- a/doc/html/math_toolkit/credits.html +++ b/doc/html/math_toolkit/credits.html @@ -173,10 +173,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/directories.html b/doc/html/math_toolkit/directories.html index df0193865..0af9a12c2 100644 --- a/doc/html/math_toolkit/directories.html +++ b/doc/html/math_toolkit/directories.html @@ -110,10 +110,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_concept.html b/doc/html/math_toolkit/dist_concept.html index 26cfbc1b7..0373b932b 100644 --- a/doc/html/math_toolkit/dist_concept.html +++ b/doc/html/math_toolkit/dist_concept.html @@ -380,10 +380,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref.html b/doc/html/math_toolkit/dist_ref.html index 5290ef378..ece2ed477 100644 --- a/doc/html/math_toolkit/dist_ref.html +++ b/doc/html/math_toolkit/dist_ref.html @@ -92,10 +92,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dist_algorithms.html b/doc/html/math_toolkit/dist_ref/dist_algorithms.html index 392a9cd0f..deccd354e 100644 --- a/doc/html/math_toolkit/dist_ref/dist_algorithms.html +++ b/doc/html/math_toolkit/dist_ref/dist_algorithms.html @@ -119,10 +119,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists.html b/doc/html/math_toolkit/dist_ref/dists.html index a9e752f6b..2ecfc8f12 100644 --- a/doc/html/math_toolkit/dist_ref/dists.html +++ b/doc/html/math_toolkit/dist_ref/dists.html @@ -87,10 +87,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/arcine_dist.html b/doc/html/math_toolkit/dist_ref/dists/arcine_dist.html index a8a38589d..bcdb4d487 100644 --- a/doc/html/math_toolkit/dist_ref/dists/arcine_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/arcine_dist.html @@ -625,10 +625,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/bernoulli_dist.html b/doc/html/math_toolkit/dist_ref/dists/bernoulli_dist.html index c2ca386c5..6f2086296 100644 --- a/doc/html/math_toolkit/dist_ref/dists/bernoulli_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/bernoulli_dist.html @@ -339,10 +339,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/beta_dist.html b/doc/html/math_toolkit/dist_ref/dists/beta_dist.html index 63fb03fb4..d9d76f922 100644 --- a/doc/html/math_toolkit/dist_ref/dists/beta_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/beta_dist.html @@ -605,10 +605,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/binomial_dist.html b/doc/html/math_toolkit/dist_ref/dists/binomial_dist.html index 9b604dfa6..9c3da3ee5 100644 --- a/doc/html/math_toolkit/dist_ref/dists/binomial_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/binomial_dist.html @@ -891,10 +891,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/cauchy_dist.html b/doc/html/math_toolkit/dist_ref/dists/cauchy_dist.html index 2a86c3d29..66d5d1d33 100644 --- a/doc/html/math_toolkit/dist_ref/dists/cauchy_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/cauchy_dist.html @@ -288,10 +288,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/chi_squared_dist.html b/doc/html/math_toolkit/dist_ref/dists/chi_squared_dist.html index c5cebe26e..46cb5e9cb 100644 --- a/doc/html/math_toolkit/dist_ref/dists/chi_squared_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/chi_squared_dist.html @@ -394,10 +394,11 @@ independent, normally distributed random
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/exp_dist.html b/doc/html/math_toolkit/dist_ref/dists/exp_dist.html index 7c8b44941..c319a9fbf 100644 --- a/doc/html/math_toolkit/dist_ref/dists/exp_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/exp_dist.html @@ -311,10 +311,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/extreme_dist.html b/doc/html/math_toolkit/dist_ref/dists/extreme_dist.html index a0b6b66d8..c15a02074 100644 --- a/doc/html/math_toolkit/dist_ref/dists/extreme_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/extreme_dist.html @@ -314,10 +314,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/f_dist.html b/doc/html/math_toolkit/dist_ref/dists/f_dist.html index 882fb5aa9..700de4dff 100644 --- a/doc/html/math_toolkit/dist_ref/dists/f_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/f_dist.html @@ -417,10 +417,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/gamma_dist.html b/doc/html/math_toolkit/dist_ref/dists/gamma_dist.html index c46631d7e..354e98308 100644 --- a/doc/html/math_toolkit/dist_ref/dists/gamma_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/gamma_dist.html @@ -347,10 +347,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/geometric_dist.html b/doc/html/math_toolkit/dist_ref/dists/geometric_dist.html index de3ed38a9..8e2b999e8 100644 --- a/doc/html/math_toolkit/dist_ref/dists/geometric_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/geometric_dist.html @@ -824,10 +824,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/hyperexponential_dist.html b/doc/html/math_toolkit/dist_ref/dists/hyperexponential_dist.html index 1de645f08..145dac917 100644 --- a/doc/html/math_toolkit/dist_ref/dists/hyperexponential_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/hyperexponential_dist.html @@ -1443,10 +1443,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/hypergeometric_dist.html b/doc/html/math_toolkit/dist_ref/dists/hypergeometric_dist.html index ec4b9922a..4fe736c88 100644 --- a/doc/html/math_toolkit/dist_ref/dists/hypergeometric_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/hypergeometric_dist.html @@ -322,10 +322,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/inverse_chi_squared_dist.html b/doc/html/math_toolkit/dist_ref/dists/inverse_chi_squared_dist.html index 3dfa3532b..f011d25c0 100644 --- a/doc/html/math_toolkit/dist_ref/dists/inverse_chi_squared_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/inverse_chi_squared_dist.html @@ -454,10 +454,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/inverse_gamma_dist.html b/doc/html/math_toolkit/dist_ref/dists/inverse_gamma_dist.html index fb44e664e..d56045a06 100644 --- a/doc/html/math_toolkit/dist_ref/dists/inverse_gamma_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/inverse_gamma_dist.html @@ -350,10 +350,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/inverse_gaussian_dist.html b/doc/html/math_toolkit/dist_ref/dists/inverse_gaussian_dist.html index cebf3f9ad..b0d9aebee 100644 --- a/doc/html/math_toolkit/dist_ref/dists/inverse_gaussian_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/inverse_gaussian_dist.html @@ -428,10 +428,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/laplace_dist.html b/doc/html/math_toolkit/dist_ref/dists/laplace_dist.html index 2dc8955cd..0ff660eef 100644 --- a/doc/html/math_toolkit/dist_ref/dists/laplace_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/laplace_dist.html @@ -343,10 +343,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html b/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html index 24210b02b..cd072ea4d 100644 --- a/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/logistic_dist.html @@ -281,10 +281,11 @@ as special cases if RealType permits.
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/lognormal_dist.html b/doc/html/math_toolkit/dist_ref/dists/lognormal_dist.html index 8f5cd67c5..7abaebcea 100644 --- a/doc/html/math_toolkit/dist_ref/dists/lognormal_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/lognormal_dist.html @@ -313,10 +313,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/nc_beta_dist.html b/doc/html/math_toolkit/dist_ref/dists/nc_beta_dist.html index 5ecb6dcf5..19a61f9eb 100644 --- a/doc/html/math_toolkit/dist_ref/dists/nc_beta_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/nc_beta_dist.html @@ -467,10 +467,11 @@ is
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/nc_chi_squared_dist.html b/doc/html/math_toolkit/dist_ref/dists/nc_chi_squared_dist.html index 141fba4c1..96d5ad6c3 100644 --- a/doc/html/math_toolkit/dist_ref/dists/nc_chi_squared_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/nc_chi_squared_dist.html @@ -555,10 +555,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/nc_f_dist.html b/doc/html/math_toolkit/dist_ref/dists/nc_f_dist.html index 76465062f..d5a4f1ab8 100644 --- a/doc/html/math_toolkit/dist_ref/dists/nc_f_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/nc_f_dist.html @@ -393,10 +393,11 @@ is the non-centrality parameter, x is the
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html b/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html index 8c0cbc2d2..ffb159cac 100644 --- a/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/nc_t_dist.html @@ -549,10 +549,11 @@ when the normal distribution
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/negative_binomial_dist.html b/doc/html/math_toolkit/dist_ref/dists/negative_binomial_dist.html index ae207c214..4c50fe6dd 100644 --- a/doc/html/math_toolkit/dist_ref/dists/negative_binomial_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/negative_binomial_dist.html @@ -866,10 +866,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/normal_dist.html b/doc/html/math_toolkit/dist_ref/dists/normal_dist.html index 46a9e4fb5..117e0ceae 100644 --- a/doc/html/math_toolkit/dist_ref/dists/normal_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/normal_dist.html @@ -308,10 +308,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/pareto.html b/doc/html/math_toolkit/dist_ref/dists/pareto.html index 668034e04..1ab443e01 100644 --- a/doc/html/math_toolkit/dist_ref/dists/pareto.html +++ b/doc/html/math_toolkit/dist_ref/dists/pareto.html @@ -333,10 +333,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/poisson_dist.html b/doc/html/math_toolkit/dist_ref/dists/poisson_dist.html index 588806b53..474354419 100644 --- a/doc/html/math_toolkit/dist_ref/dists/poisson_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/poisson_dist.html @@ -313,10 +313,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/rayleigh.html b/doc/html/math_toolkit/dist_ref/dists/rayleigh.html index 83840f145..bbe947c2c 100644 --- a/doc/html/math_toolkit/dist_ref/dists/rayleigh.html +++ b/doc/html/math_toolkit/dist_ref/dists/rayleigh.html @@ -330,10 +330,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/skew_normal_dist.html b/doc/html/math_toolkit/dist_ref/dists/skew_normal_dist.html index c1a6f81aa..fd5cc6ee4 100644 --- a/doc/html/math_toolkit/dist_ref/dists/skew_normal_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/skew_normal_dist.html @@ -481,10 +481,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/students_t_dist.html b/doc/html/math_toolkit/dist_ref/dists/students_t_dist.html index 7e3e69838..13800dbf6 100644 --- a/doc/html/math_toolkit/dist_ref/dists/students_t_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/students_t_dist.html @@ -413,10 +413,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/triangular_dist.html b/doc/html/math_toolkit/dist_ref/dists/triangular_dist.html index c39eb1eeb..958651177 100644 --- a/doc/html/math_toolkit/dist_ref/dists/triangular_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/triangular_dist.html @@ -429,10 +429,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/uniform_dist.html b/doc/html/math_toolkit/dist_ref/dists/uniform_dist.html index b2a6026a7..66352e282 100644 --- a/doc/html/math_toolkit/dist_ref/dists/uniform_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/uniform_dist.html @@ -350,10 +350,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/dists/weibull_dist.html b/doc/html/math_toolkit/dist_ref/dists/weibull_dist.html index 0c7a80ebe..db36901ee 100644 --- a/doc/html/math_toolkit/dist_ref/dists/weibull_dist.html +++ b/doc/html/math_toolkit/dist_ref/dists/weibull_dist.html @@ -352,10 +352,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/dist_ref/nmp.html b/doc/html/math_toolkit/dist_ref/nmp.html index ffd5d62f8..f3f2b6ac7 100644 --- a/doc/html/math_toolkit/dist_ref/nmp.html +++ b/doc/html/math_toolkit/dist_ref/nmp.html @@ -689,10 +689,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint.html b/doc/html/math_toolkit/ellint.html index 2316c7441..e331834ab 100644 --- a/doc/html/math_toolkit/ellint.html +++ b/doc/html/math_toolkit/ellint.html @@ -44,10 +44,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/ellint_1.html b/doc/html/math_toolkit/ellint/ellint_1.html index e86edf3e8..4dd32fb1a 100644 --- a/doc/html/math_toolkit/ellint/ellint_1.html +++ b/doc/html/math_toolkit/ellint/ellint_1.html @@ -251,10 +251,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/ellint_2.html b/doc/html/math_toolkit/ellint/ellint_2.html index d45284ef2..6cce4167c 100644 --- a/doc/html/math_toolkit/ellint/ellint_2.html +++ b/doc/html/math_toolkit/ellint/ellint_2.html @@ -252,10 +252,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/ellint_3.html b/doc/html/math_toolkit/ellint/ellint_3.html index cb1f59776..3efac0d41 100644 --- a/doc/html/math_toolkit/ellint/ellint_3.html +++ b/doc/html/math_toolkit/ellint/ellint_3.html @@ -335,10 +335,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/ellint_carlson.html b/doc/html/math_toolkit/ellint/ellint_carlson.html index fd432d425..bfee5dc4b 100644 --- a/doc/html/math_toolkit/ellint/ellint_carlson.html +++ b/doc/html/math_toolkit/ellint/ellint_carlson.html @@ -1111,10 +1111,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/ellint_d.html b/doc/html/math_toolkit/ellint/ellint_d.html index dec5303aa..30de23c77 100644 --- a/doc/html/math_toolkit/ellint/ellint_d.html +++ b/doc/html/math_toolkit/ellint/ellint_d.html @@ -343,10 +343,11 @@ using
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/ellint_intro.html b/doc/html/math_toolkit/ellint/ellint_intro.html index bcc6c3539..77b565bb9 100644 --- a/doc/html/math_toolkit/ellint/ellint_intro.html +++ b/doc/html/math_toolkit/ellint/ellint_intro.html @@ -434,10 +434,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/heuman_lambda.html b/doc/html/math_toolkit/ellint/heuman_lambda.html index f277481b9..770f56535 100644 --- a/doc/html/math_toolkit/ellint/heuman_lambda.html +++ b/doc/html/math_toolkit/ellint/heuman_lambda.html @@ -204,10 +204,11 @@ using
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/ellint/jacobi_zeta.html b/doc/html/math_toolkit/ellint/jacobi_zeta.html index def9ab596..1df7f4247 100644 --- a/doc/html/math_toolkit/ellint/jacobi_zeta.html +++ b/doc/html/math_toolkit/ellint/jacobi_zeta.html @@ -240,10 +240,11 @@ using the
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/error_handling.html b/doc/html/math_toolkit/error_handling.html index 8d7de16d1..3a8469a13 100644 --- a/doc/html/math_toolkit/error_handling.html +++ b/doc/html/math_toolkit/error_handling.html @@ -1111,10 +1111,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/exact_typdefs.html b/doc/html/math_toolkit/exact_typdefs.html index 096be4a99..e6143a839 100644 --- a/doc/html/math_toolkit/exact_typdefs.html +++ b/doc/html/math_toolkit/exact_typdefs.html @@ -158,10 +158,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/examples.html b/doc/html/math_toolkit/examples.html index c0359c3c3..9f35c2914 100644 --- a/doc/html/math_toolkit/examples.html +++ b/doc/html/math_toolkit/examples.html @@ -123,10 +123,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/exp.html b/doc/html/math_toolkit/exp.html index 56b2707ef..e2628b4fa 100644 --- a/doc/html/math_toolkit/exp.html +++ b/doc/html/math_toolkit/exp.html @@ -41,10 +41,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/expint.html b/doc/html/math_toolkit/expint.html index bdf8a021f..bcc004604 100644 --- a/doc/html/math_toolkit/expint.html +++ b/doc/html/math_toolkit/expint.html @@ -33,10 +33,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/expint/expint_i.html b/doc/html/math_toolkit/expint/expint_i.html index 713a9ce76..562f2e35a 100644 --- a/doc/html/math_toolkit/expint/expint_i.html +++ b/doc/html/math_toolkit/expint/expint_i.html @@ -300,10 +300,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/expint/expint_n.html b/doc/html/math_toolkit/expint/expint_n.html index 05c88a253..5c33f28f8 100644 --- a/doc/html/math_toolkit/expint/expint_n.html +++ b/doc/html/math_toolkit/expint/expint_n.html @@ -267,10 +267,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/factorials.html b/doc/html/math_toolkit/factorials.html index 67253bf0d..9060c9bfe 100644 --- a/doc/html/math_toolkit/factorials.html +++ b/doc/html/math_toolkit/factorials.html @@ -37,10 +37,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/factorials/sf_binomial.html b/doc/html/math_toolkit/factorials/sf_binomial.html index 4c8a73eef..ab0d735b0 100644 --- a/doc/html/math_toolkit/factorials/sf_binomial.html +++ b/doc/html/math_toolkit/factorials/sf_binomial.html @@ -128,10 +128,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/factorials/sf_double_factorial.html b/doc/html/math_toolkit/factorials/sf_double_factorial.html index 7a0052e72..02fd600e0 100644 --- a/doc/html/math_toolkit/factorials/sf_double_factorial.html +++ b/doc/html/math_toolkit/factorials/sf_double_factorial.html @@ -144,10 +144,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/factorials/sf_factorial.html b/doc/html/math_toolkit/factorials/sf_factorial.html index a06fff203..6047c7b7c 100644 --- a/doc/html/math_toolkit/factorials/sf_factorial.html +++ b/doc/html/math_toolkit/factorials/sf_factorial.html @@ -176,10 +176,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/factorials/sf_falling_factorial.html b/doc/html/math_toolkit/factorials/sf_falling_factorial.html index d0cc9d15f..2e1fd34a8 100644 --- a/doc/html/math_toolkit/factorials/sf_falling_factorial.html +++ b/doc/html/math_toolkit/factorials/sf_falling_factorial.html @@ -93,10 +93,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/factorials/sf_rising_factorial.html b/doc/html/math_toolkit/factorials/sf_rising_factorial.html index b6db6cb99..8b53a08bc 100644 --- a/doc/html/math_toolkit/factorials/sf_rising_factorial.html +++ b/doc/html/math_toolkit/factorials/sf_rising_factorial.html @@ -97,10 +97,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fastest_typdefs.html b/doc/html/math_toolkit/fastest_typdefs.html index 3b5947a1b..04f5f648c 100644 --- a/doc/html/math_toolkit/fastest_typdefs.html +++ b/doc/html/math_toolkit/fastest_typdefs.html @@ -47,10 +47,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/float128.html b/doc/html/math_toolkit/float128.html index 6ed5e6786..995ccd0fe 100644 --- a/doc/html/math_toolkit/float128.html +++ b/doc/html/math_toolkit/float128.html @@ -158,10 +158,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/float128/exp_function.html b/doc/html/math_toolkit/float128/exp_function.html index e21b3a396..21594077a 100644 --- a/doc/html/math_toolkit/float128/exp_function.html +++ b/doc/html/math_toolkit/float128/exp_function.html @@ -54,10 +54,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/float128/overloading.html b/doc/html/math_toolkit/float128/overloading.html index 7786e506b..4b43c13b8 100644 --- a/doc/html/math_toolkit/float128/overloading.html +++ b/doc/html/math_toolkit/float128/overloading.html @@ -80,10 +80,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/float128/typeinfo.html b/doc/html/math_toolkit/float128/typeinfo.html index 32925f5f6..dd8b0c874 100644 --- a/doc/html/math_toolkit/float128/typeinfo.html +++ b/doc/html/math_toolkit/float128/typeinfo.html @@ -61,10 +61,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/float128_hints.html b/doc/html/math_toolkit/float128_hints.html index 75b99e555..77d01cf28 100644 --- a/doc/html/math_toolkit/float128_hints.html +++ b/doc/html/math_toolkit/float128_hints.html @@ -90,10 +90,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/float_comparison.html b/doc/html/math_toolkit/float_comparison.html index 83b954664..55ddf055f 100644 --- a/doc/html/math_toolkit/float_comparison.html +++ b/doc/html/math_toolkit/float_comparison.html @@ -396,10 +396,11 @@ epsilon_difference = 0.000000000
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fp_facets.html b/doc/html/math_toolkit/fp_facets.html index db86e0a03..b23ea77b6 100644 --- a/doc/html/math_toolkit/fp_facets.html +++ b/doc/html/math_toolkit/fp_facets.html @@ -75,10 +75,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fp_facets/examples.html b/doc/html/math_toolkit/fp_facets/examples.html index e801464c9..8e9068399 100644 --- a/doc/html/math_toolkit/fp_facets/examples.html +++ b/doc/html/math_toolkit/fp_facets/examples.html @@ -241,10 +241,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fp_facets/facets_intro.html b/doc/html/math_toolkit/fp_facets/facets_intro.html index 87f4246ce..25575438a 100644 --- a/doc/html/math_toolkit/fp_facets/facets_intro.html +++ b/doc/html/math_toolkit/fp_facets/facets_intro.html @@ -363,10 +363,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fp_facets/portability.html b/doc/html/math_toolkit/fp_facets/portability.html index c747a729c..a555d5e85 100644 --- a/doc/html/math_toolkit/fp_facets/portability.html +++ b/doc/html/math_toolkit/fp_facets/portability.html @@ -34,10 +34,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fp_facets/rationale.html b/doc/html/math_toolkit/fp_facets/rationale.html index aa11ca240..f33443b6e 100644 --- a/doc/html/math_toolkit/fp_facets/rationale.html +++ b/doc/html/math_toolkit/fp_facets/rationale.html @@ -51,10 +51,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fp_facets/reference.html b/doc/html/math_toolkit/fp_facets/reference.html index 732c111f9..786aac163 100644 --- a/doc/html/math_toolkit/fp_facets/reference.html +++ b/doc/html/math_toolkit/fp_facets/reference.html @@ -474,10 +474,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/fpclass.html b/doc/html/math_toolkit/fpclass.html index 95f8125bb..50fda67e7 100644 --- a/doc/html/math_toolkit/fpclass.html +++ b/doc/html/math_toolkit/fpclass.html @@ -235,10 +235,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/future.html b/doc/html/math_toolkit/future.html index c0345995b..dd238cbb9 100644 --- a/doc/html/math_toolkit/future.html +++ b/doc/html/math_toolkit/future.html @@ -131,10 +131,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/getting_best.html b/doc/html/math_toolkit/getting_best.html index c9bb3fbcc..ed5e9b2c9 100644 --- a/doc/html/math_toolkit/getting_best.html +++ b/doc/html/math_toolkit/getting_best.html @@ -160,10 +160,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/greatest_typdefs.html b/doc/html/math_toolkit/greatest_typdefs.html index 8e4994c12..eefaa7ceb 100644 --- a/doc/html/math_toolkit/greatest_typdefs.html +++ b/doc/html/math_toolkit/greatest_typdefs.html @@ -79,10 +79,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/hankel.html b/doc/html/math_toolkit/hankel.html index d3b0b7e66..a7301b494 100644 --- a/doc/html/math_toolkit/hankel.html +++ b/doc/html/math_toolkit/hankel.html @@ -33,10 +33,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/hankel/cyl_hankel.html b/doc/html/math_toolkit/hankel/cyl_hankel.html index 005c34ce7..ea443c70a 100644 --- a/doc/html/math_toolkit/hankel/cyl_hankel.html +++ b/doc/html/math_toolkit/hankel/cyl_hankel.html @@ -145,10 +145,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/hankel/sph_hankel.html b/doc/html/math_toolkit/hankel/sph_hankel.html index f5e533d39..359df984c 100644 --- a/doc/html/math_toolkit/hankel/sph_hankel.html +++ b/doc/html/math_toolkit/hankel/sph_hankel.html @@ -107,10 +107,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision.html b/doc/html/math_toolkit/high_precision.html index 61475e4a1..89b862ac7 100644 --- a/doc/html/math_toolkit/high_precision.html +++ b/doc/html/math_toolkit/high_precision.html @@ -94,10 +94,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision/e_float.html b/doc/html/math_toolkit/high_precision/e_float.html index 80c454371..a10e4b016 100644 --- a/doc/html/math_toolkit/high_precision/e_float.html +++ b/doc/html/math_toolkit/high_precision/e_float.html @@ -51,10 +51,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision/float128.html b/doc/html/math_toolkit/high_precision/float128.html index ca75b7a4f..60635a853 100644 --- a/doc/html/math_toolkit/high_precision/float128.html +++ b/doc/html/math_toolkit/high_precision/float128.html @@ -48,10 +48,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision/use_mpfr.html b/doc/html/math_toolkit/high_precision/use_mpfr.html index 16bba15e1..4d5376d48 100644 --- a/doc/html/math_toolkit/high_precision/use_mpfr.html +++ b/doc/html/math_toolkit/high_precision/use_mpfr.html @@ -100,10 +100,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision/use_multiprecision.html b/doc/html/math_toolkit/high_precision/use_multiprecision.html index 8db407543..a44a6b128 100644 --- a/doc/html/math_toolkit/high_precision/use_multiprecision.html +++ b/doc/html/math_toolkit/high_precision/use_multiprecision.html @@ -347,10 +347,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision/use_ntl.html b/doc/html/math_toolkit/high_precision/use_ntl.html index 25f5674e8..5eb370dbd 100644 --- a/doc/html/math_toolkit/high_precision/use_ntl.html +++ b/doc/html/math_toolkit/high_precision/use_ntl.html @@ -57,10 +57,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision/using_test.html b/doc/html/math_toolkit/high_precision/using_test.html index 48b01085e..df63ebad5 100644 --- a/doc/html/math_toolkit/high_precision/using_test.html +++ b/doc/html/math_toolkit/high_precision/using_test.html @@ -127,10 +127,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/high_precision/why_high_precision.html b/doc/html/math_toolkit/high_precision/why_high_precision.html index 7e4efb065..cb4456f6d 100644 --- a/doc/html/math_toolkit/high_precision/why_high_precision.html +++ b/doc/html/math_toolkit/high_precision/why_high_precision.html @@ -122,10 +122,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/hints.html b/doc/html/math_toolkit/hints.html index c3e2f2d30..af8396f48 100644 --- a/doc/html/math_toolkit/hints.html +++ b/doc/html/math_toolkit/hints.html @@ -93,10 +93,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/history1.html b/doc/html/math_toolkit/history1.html index 3da12bbc2..ee2eb6ecf 100644 --- a/doc/html/math_toolkit/history1.html +++ b/doc/html/math_toolkit/history1.html @@ -1047,10 +1047,11 @@ by switching to use the Students t distribution (or Normal distribution
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/history2.html b/doc/html/math_toolkit/history2.html index a69fffd9a..ca4222d20 100644 --- a/doc/html/math_toolkit/history2.html +++ b/doc/html/math_toolkit/history2.html @@ -1047,10 +1047,11 @@ by switching to use the Students t distribution (or Normal distribution
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals.html b/doc/html/math_toolkit/internals.html index 694e09de8..b8428f766 100644 --- a/doc/html/math_toolkit/internals.html +++ b/doc/html/math_toolkit/internals.html @@ -40,10 +40,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals/cf.html b/doc/html/math_toolkit/internals/cf.html index 05754e83a..65a577987 100644 --- a/doc/html/math_toolkit/internals/cf.html +++ b/doc/html/math_toolkit/internals/cf.html @@ -264,10 +264,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals/error_test.html b/doc/html/math_toolkit/internals/error_test.html index 1f3438eb1..d20a89387 100644 --- a/doc/html/math_toolkit/internals/error_test.html +++ b/doc/html/math_toolkit/internals/error_test.html @@ -220,10 +220,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals/minimax.html b/doc/html/math_toolkit/internals/minimax.html index 0c0e00cd4..e3f367b25 100644 --- a/doc/html/math_toolkit/internals/minimax.html +++ b/doc/html/math_toolkit/internals/minimax.html @@ -266,10 +266,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals/series_evaluation.html b/doc/html/math_toolkit/internals/series_evaluation.html index 8dbd535da..10a7b3734 100644 --- a/doc/html/math_toolkit/internals/series_evaluation.html +++ b/doc/html/math_toolkit/internals/series_evaluation.html @@ -180,10 +180,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals/test_data.html b/doc/html/math_toolkit/internals/test_data.html index b903292f9..ce0424429 100644 --- a/doc/html/math_toolkit/internals/test_data.html +++ b/doc/html/math_toolkit/internals/test_data.html @@ -546,10 +546,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals/tuples.html b/doc/html/math_toolkit/internals/tuples.html index 7917be523..a7cd05429 100644 --- a/doc/html/math_toolkit/internals/tuples.html +++ b/doc/html/math_toolkit/internals/tuples.html @@ -68,10 +68,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/internals_overview.html b/doc/html/math_toolkit/internals_overview.html index 4fad75a07..fc311bed4 100644 --- a/doc/html/math_toolkit/internals_overview.html +++ b/doc/html/math_toolkit/internals_overview.html @@ -44,10 +44,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/interp.html b/doc/html/math_toolkit/interp.html index a57d55133..f8df58f45 100644 --- a/doc/html/math_toolkit/interp.html +++ b/doc/html/math_toolkit/interp.html @@ -57,10 +57,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/intro_pol_overview.html b/doc/html/math_toolkit/intro_pol_overview.html index 8592c15b3..81d080644 100644 --- a/doc/html/math_toolkit/intro_pol_overview.html +++ b/doc/html/math_toolkit/intro_pol_overview.html @@ -101,10 +101,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/inv_hyper.html b/doc/html/math_toolkit/inv_hyper.html index aaad192ca..dbef762d2 100644 --- a/doc/html/math_toolkit/inv_hyper.html +++ b/doc/html/math_toolkit/inv_hyper.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/inv_hyper/acosh.html b/doc/html/math_toolkit/inv_hyper/acosh.html index 3f47a10af..30191ed46 100644 --- a/doc/html/math_toolkit/inv_hyper/acosh.html +++ b/doc/html/math_toolkit/inv_hyper/acosh.html @@ -112,10 +112,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/inv_hyper/asinh.html b/doc/html/math_toolkit/inv_hyper/asinh.html index 1d02dbb9b..83dbf57a5 100644 --- a/doc/html/math_toolkit/inv_hyper/asinh.html +++ b/doc/html/math_toolkit/inv_hyper/asinh.html @@ -107,10 +107,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/inv_hyper/atanh.html b/doc/html/math_toolkit/inv_hyper/atanh.html index db187339f..9e0bb3e7e 100644 --- a/doc/html/math_toolkit/inv_hyper/atanh.html +++ b/doc/html/math_toolkit/inv_hyper/atanh.html @@ -117,10 +117,11 @@ denoting numeric_limits<T>::epsilon().
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html b/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html index cfab0bf8b..4c30cb9c9 100644 --- a/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html +++ b/doc/html/math_toolkit/inv_hyper/inv_hyper_over.html @@ -99,10 +99,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/issues.html b/doc/html/math_toolkit/issues.html index 16f105de6..a3d938c38 100644 --- a/doc/html/math_toolkit/issues.html +++ b/doc/html/math_toolkit/issues.html @@ -1193,10 +1193,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi.html b/doc/html/math_toolkit/jacobi.html index b7229414d..868849415 100644 --- a/doc/html/math_toolkit/jacobi.html +++ b/doc/html/math_toolkit/jacobi.html @@ -59,10 +59,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jac_over.html b/doc/html/math_toolkit/jacobi/jac_over.html index b22f25c62..81c045792 100644 --- a/doc/html/math_toolkit/jacobi/jac_over.html +++ b/doc/html/math_toolkit/jacobi/jac_over.html @@ -106,10 +106,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_cd.html b/doc/html/math_toolkit/jacobi/jacobi_cd.html index 316714ad8..180c0b0ce 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_cd.html +++ b/doc/html/math_toolkit/jacobi/jacobi_cd.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_cn.html b/doc/html/math_toolkit/jacobi/jacobi_cn.html index 20d0627de..04a9f0189 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_cn.html +++ b/doc/html/math_toolkit/jacobi/jacobi_cn.html @@ -65,10 +65,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_cs.html b/doc/html/math_toolkit/jacobi/jacobi_cs.html index 45c0aeadd..1b874ff34 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_cs.html +++ b/doc/html/math_toolkit/jacobi/jacobi_cs.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_dc.html b/doc/html/math_toolkit/jacobi/jacobi_dc.html index 055ec6a8f..a05672c05 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_dc.html +++ b/doc/html/math_toolkit/jacobi/jacobi_dc.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_dn.html b/doc/html/math_toolkit/jacobi/jacobi_dn.html index 5c09fb234..729372591 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_dn.html +++ b/doc/html/math_toolkit/jacobi/jacobi_dn.html @@ -65,10 +65,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_ds.html b/doc/html/math_toolkit/jacobi/jacobi_ds.html index 400d1da66..3e2272e79 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_ds.html +++ b/doc/html/math_toolkit/jacobi/jacobi_ds.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_elliptic.html b/doc/html/math_toolkit/jacobi/jacobi_elliptic.html index bf40c8308..72d944503 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_elliptic.html +++ b/doc/html/math_toolkit/jacobi/jacobi_elliptic.html @@ -764,10 +764,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_nc.html b/doc/html/math_toolkit/jacobi/jacobi_nc.html index 3fee4e0ce..fc616e55b 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_nc.html +++ b/doc/html/math_toolkit/jacobi/jacobi_nc.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_nd.html b/doc/html/math_toolkit/jacobi/jacobi_nd.html index 9024369cc..55259590c 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_nd.html +++ b/doc/html/math_toolkit/jacobi/jacobi_nd.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_ns.html b/doc/html/math_toolkit/jacobi/jacobi_ns.html index 85a5a6750..4210f4fba 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_ns.html +++ b/doc/html/math_toolkit/jacobi/jacobi_ns.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_sc.html b/doc/html/math_toolkit/jacobi/jacobi_sc.html index 49c2c31d3..d0f827107 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_sc.html +++ b/doc/html/math_toolkit/jacobi/jacobi_sc.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_sd.html b/doc/html/math_toolkit/jacobi/jacobi_sd.html index f2ce7e6a9..c3b59c956 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_sd.html +++ b/doc/html/math_toolkit/jacobi/jacobi_sd.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/jacobi/jacobi_sn.html b/doc/html/math_toolkit/jacobi/jacobi_sn.html index f4063e5d1..ce2d70d22 100644 --- a/doc/html/math_toolkit/jacobi/jacobi_sn.html +++ b/doc/html/math_toolkit/jacobi/jacobi_sn.html @@ -65,10 +65,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/lanczos.html b/doc/html/math_toolkit/lanczos.html index 3be143419..8119013f9 100644 --- a/doc/html/math_toolkit/lanczos.html +++ b/doc/html/math_toolkit/lanczos.html @@ -560,10 +560,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/logs_and_tables.html b/doc/html/math_toolkit/logs_and_tables.html index b47f290e2..a489d118a 100644 --- a/doc/html/math_toolkit/logs_and_tables.html +++ b/doc/html/math_toolkit/logs_and_tables.html @@ -35,10 +35,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/logs_and_tables/all_table.html b/doc/html/math_toolkit/logs_and_tables/all_table.html index efb553781..1f546abd2 100644 --- a/doc/html/math_toolkit/logs_and_tables/all_table.html +++ b/doc/html/math_toolkit/logs_and_tables/all_table.html @@ -12253,10 +12253,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/logs_and_tables/logs.html b/doc/html/math_toolkit/logs_and_tables/logs.html index 40c7f4a88..7f182fa80 100644 --- a/doc/html/math_toolkit/logs_and_tables/logs.html +++ b/doc/html/math_toolkit/logs_and_tables/logs.html @@ -4436,10 +4436,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/macros.html b/doc/html/math_toolkit/macros.html index a6a9ef0d5..6ae8d4e90 100644 --- a/doc/html/math_toolkit/macros.html +++ b/doc/html/math_toolkit/macros.html @@ -71,10 +71,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/main_faq.html b/doc/html/math_toolkit/main_faq.html index b7794a484..4c5d0750a 100644 --- a/doc/html/math_toolkit/main_faq.html +++ b/doc/html/math_toolkit/main_faq.html @@ -209,10 +209,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/main_intro.html b/doc/html/math_toolkit/main_intro.html index db945b61d..f8cb775ae 100644 --- a/doc/html/math_toolkit/main_intro.html +++ b/doc/html/math_toolkit/main_intro.html @@ -110,12 +110,12 @@

        There are helpers for the evaluation of infinite series, continued - fractions and rational approximations. + fractions and rational approximations. A Remez algorithm implementation allows for the locating of minimax rational approximations.

        - There are also (experimental) classes for the manipulation + There are also (experimental) classes for the manipulation of polynomials, for testing a special function against tabulated test data, and for the rapid generation of test data and/or data for output to an external graphing @@ -124,10 +124,11 @@

        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/main_tr1.html b/doc/html/math_toolkit/main_tr1.html index b7c4a98d6..c2ac36a36 100644 --- a/doc/html/math_toolkit/main_tr1.html +++ b/doc/html/math_toolkit/main_tr1.html @@ -600,10 +600,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/mem_typedef.html b/doc/html/math_toolkit/mem_typedef.html index 632d82841..41b9f259a 100644 --- a/doc/html/math_toolkit/mem_typedef.html +++ b/doc/html/math_toolkit/mem_typedef.html @@ -55,10 +55,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/minimum_typdefs.html b/doc/html/math_toolkit/minimum_typdefs.html index 3f4af79e7..559eab7cf 100644 --- a/doc/html/math_toolkit/minimum_typdefs.html +++ b/doc/html/math_toolkit/minimum_typdefs.html @@ -45,10 +45,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/multiprecision.html b/doc/html/math_toolkit/multiprecision.html index 1e78a4596..231f1a0ab 100644 --- a/doc/html/math_toolkit/multiprecision.html +++ b/doc/html/math_toolkit/multiprecision.html @@ -109,10 +109,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/namespaces.html b/doc/html/math_toolkit/namespaces.html index 077c77d04..30d5d5c98 100644 --- a/doc/html/math_toolkit/namespaces.html +++ b/doc/html/math_toolkit/namespaces.html @@ -80,10 +80,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index c2f1647bc..c505b6d21 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. @@ -87,10 +87,11 @@ -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/new_const.html b/doc/html/math_toolkit/new_const.html index 0e3545fa8..3cc1d1049 100644 --- a/doc/html/math_toolkit/new_const.html +++ b/doc/html/math_toolkit/new_const.html @@ -249,10 +249,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/next_float.html b/doc/html/math_toolkit/next_float.html index 91456d2b6..fcfc1de2c 100644 --- a/doc/html/math_toolkit/next_float.html +++ b/doc/html/math_toolkit/next_float.html @@ -71,10 +71,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/next_float/float_advance.html b/doc/html/math_toolkit/next_float/float_advance.html index 008f140e4..281729b0a 100644 --- a/doc/html/math_toolkit/next_float/float_advance.html +++ b/doc/html/math_toolkit/next_float/float_advance.html @@ -55,10 +55,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/next_float/float_distance.html b/doc/html/math_toolkit/next_float/float_distance.html index 56e46d025..ddff77c1d 100644 --- a/doc/html/math_toolkit/next_float/float_distance.html +++ b/doc/html/math_toolkit/next_float/float_distance.html @@ -89,10 +89,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/next_float/float_next.html b/doc/html/math_toolkit/next_float/float_next.html index d306fae37..6fed227d7 100644 --- a/doc/html/math_toolkit/next_float/float_next.html +++ b/doc/html/math_toolkit/next_float/float_next.html @@ -59,10 +59,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/next_float/float_prior.html b/doc/html/math_toolkit/next_float/float_prior.html index db4969cf2..2c2de4512 100644 --- a/doc/html/math_toolkit/next_float/float_prior.html +++ b/doc/html/math_toolkit/next_float/float_prior.html @@ -59,10 +59,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/next_float/nextafter.html b/doc/html/math_toolkit/next_float/nextafter.html index 282117fd0..b143d17eb 100644 --- a/doc/html/math_toolkit/next_float/nextafter.html +++ b/doc/html/math_toolkit/next_float/nextafter.html @@ -113,10 +113,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/next_float/ulp.html b/doc/html/math_toolkit/next_float/ulp.html index 2c7927355..71a0c1d65 100644 --- a/doc/html/math_toolkit/next_float/ulp.html +++ b/doc/html/math_toolkit/next_float/ulp.html @@ -147,10 +147,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/number_series.html b/doc/html/math_toolkit/number_series.html index 6103acdc5..cc3e207b3 100644 --- a/doc/html/math_toolkit/number_series.html +++ b/doc/html/math_toolkit/number_series.html @@ -35,10 +35,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/number_series/bernoulli_numbers.html b/doc/html/math_toolkit/number_series/bernoulli_numbers.html index f30729517..960e3a6dd 100644 --- a/doc/html/math_toolkit/number_series/bernoulli_numbers.html +++ b/doc/html/math_toolkit/number_series/bernoulli_numbers.html @@ -356,10 +356,11 @@ and also obtain much
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/number_series/primes.html b/doc/html/math_toolkit/number_series/primes.html index 25bf58dc3..78d1c36e9 100644 --- a/doc/html/math_toolkit/number_series/primes.html +++ b/doc/html/math_toolkit/number_series/primes.html @@ -67,10 +67,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/number_series/tangent_numbers.html b/doc/html/math_toolkit/number_series/tangent_numbers.html index b555a0930..fc9dde6f8 100644 --- a/doc/html/math_toolkit/number_series/tangent_numbers.html +++ b/doc/html/math_toolkit/number_series/tangent_numbers.html @@ -121,10 +121,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_create.html b/doc/html/math_toolkit/oct_create.html index 95307b3df..d613d9468 100644 --- a/doc/html/math_toolkit/oct_create.html +++ b/doc/html/math_toolkit/oct_create.html @@ -67,10 +67,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_header.html b/doc/html/math_toolkit/oct_header.html index b5877d62a..9f9e3238e 100644 --- a/doc/html/math_toolkit/oct_header.html +++ b/doc/html/math_toolkit/oct_header.html @@ -32,10 +32,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_history.html b/doc/html/math_toolkit/oct_history.html index 428999100..1603e4b3b 100644 --- a/doc/html/math_toolkit/oct_history.html +++ b/doc/html/math_toolkit/oct_history.html @@ -94,10 +94,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_mem_fun.html b/doc/html/math_toolkit/oct_mem_fun.html index 1742178ff..298b63610 100644 --- a/doc/html/math_toolkit/oct_mem_fun.html +++ b/doc/html/math_toolkit/oct_mem_fun.html @@ -242,10 +242,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_non_mem.html b/doc/html/math_toolkit/oct_non_mem.html index 091736137..8dd6a49fc 100644 --- a/doc/html/math_toolkit/oct_non_mem.html +++ b/doc/html/math_toolkit/oct_non_mem.html @@ -206,10 +206,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_overview.html b/doc/html/math_toolkit/oct_overview.html index 094bf9929..cb7020056 100644 --- a/doc/html/math_toolkit/oct_overview.html +++ b/doc/html/math_toolkit/oct_overview.html @@ -69,10 +69,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_specialization.html b/doc/html/math_toolkit/oct_specialization.html index 78d7d8689..ad29266de 100644 --- a/doc/html/math_toolkit/oct_specialization.html +++ b/doc/html/math_toolkit/oct_specialization.html @@ -225,10 +225,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_synopsis.html b/doc/html/math_toolkit/oct_synopsis.html index 9999c8c20..a67b8da74 100644 --- a/doc/html/math_toolkit/oct_synopsis.html +++ b/doc/html/math_toolkit/oct_synopsis.html @@ -124,10 +124,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_tests.html b/doc/html/math_toolkit/oct_tests.html index 9ab8fcb2d..8a2bedd20 100644 --- a/doc/html/math_toolkit/oct_tests.html +++ b/doc/html/math_toolkit/oct_tests.html @@ -43,10 +43,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_todo.html b/doc/html/math_toolkit/oct_todo.html index 1e389a44a..0f1f68b4d 100644 --- a/doc/html/math_toolkit/oct_todo.html +++ b/doc/html/math_toolkit/oct_todo.html @@ -40,10 +40,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_trans.html b/doc/html/math_toolkit/oct_trans.html index eefff8c1d..380c9aa9c 100644 --- a/doc/html/math_toolkit/oct_trans.html +++ b/doc/html/math_toolkit/oct_trans.html @@ -131,10 +131,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_typedefs.html b/doc/html/math_toolkit/oct_typedefs.html index 1736aaf50..d47482245 100644 --- a/doc/html/math_toolkit/oct_typedefs.html +++ b/doc/html/math_toolkit/oct_typedefs.html @@ -55,10 +55,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/oct_value_ops.html b/doc/html/math_toolkit/oct_value_ops.html index 86ed602b2..70b1f0f1d 100644 --- a/doc/html/math_toolkit/oct_value_ops.html +++ b/doc/html/math_toolkit/oct_value_ops.html @@ -91,10 +91,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/octonion.html b/doc/html/math_toolkit/octonion.html index c4f5002eb..dcadfee1f 100644 --- a/doc/html/math_toolkit/octonion.html +++ b/doc/html/math_toolkit/octonion.html @@ -97,10 +97,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/overview_tr1.html b/doc/html/math_toolkit/overview_tr1.html index 99b5bedd8..184098796 100644 --- a/doc/html/math_toolkit/overview_tr1.html +++ b/doc/html/math_toolkit/overview_tr1.html @@ -600,10 +600,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/owens_t.html b/doc/html/math_toolkit/owens_t.html index 44b7b6b51..ed7036c35 100644 --- a/doc/html/math_toolkit/owens_t.html +++ b/doc/html/math_toolkit/owens_t.html @@ -301,10 +301,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/perf_over1.html b/doc/html/math_toolkit/perf_over1.html index 3db886d53..5df8341a0 100644 --- a/doc/html/math_toolkit/perf_over1.html +++ b/doc/html/math_toolkit/perf_over1.html @@ -71,10 +71,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/perf_over2.html b/doc/html/math_toolkit/perf_over2.html index df3217e2e..a3e157b8b 100644 --- a/doc/html/math_toolkit/perf_over2.html +++ b/doc/html/math_toolkit/perf_over2.html @@ -71,10 +71,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/perf_test_app.html b/doc/html/math_toolkit/perf_test_app.html index 0f28a156c..f04957231 100644 --- a/doc/html/math_toolkit/perf_test_app.html +++ b/doc/html/math_toolkit/perf_test_app.html @@ -101,10 +101,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_overview.html b/doc/html/math_toolkit/pol_overview.html index 5a70f4a43..6e51d3924 100644 --- a/doc/html/math_toolkit/pol_overview.html +++ b/doc/html/math_toolkit/pol_overview.html @@ -101,10 +101,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref.html b/doc/html/math_toolkit/pol_ref.html index 9fe86b632..bdcd21941 100644 --- a/doc/html/math_toolkit/pol_ref.html +++ b/doc/html/math_toolkit/pol_ref.html @@ -47,10 +47,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/assert_undefined.html b/doc/html/math_toolkit/pol_ref/assert_undefined.html index 6639fa824..e2fbdf97c 100644 --- a/doc/html/math_toolkit/pol_ref/assert_undefined.html +++ b/doc/html/math_toolkit/pol_ref/assert_undefined.html @@ -85,10 +85,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/discrete_quant_ref.html b/doc/html/math_toolkit/pol_ref/discrete_quant_ref.html index 5fb3f2cfd..0d34da877 100644 --- a/doc/html/math_toolkit/pol_ref/discrete_quant_ref.html +++ b/doc/html/math_toolkit/pol_ref/discrete_quant_ref.html @@ -235,10 +235,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/error_handling_policies.html b/doc/html/math_toolkit/pol_ref/error_handling_policies.html index d7b2513c4..6464c978f 100644 --- a/doc/html/math_toolkit/pol_ref/error_handling_policies.html +++ b/doc/html/math_toolkit/pol_ref/error_handling_policies.html @@ -756,10 +756,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/internal_promotion.html b/doc/html/math_toolkit/pol_ref/internal_promotion.html index decaaf31f..49721e447 100644 --- a/doc/html/math_toolkit/pol_ref/internal_promotion.html +++ b/doc/html/math_toolkit/pol_ref/internal_promotion.html @@ -133,10 +133,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/iteration_pol.html b/doc/html/math_toolkit/pol_ref/iteration_pol.html index 875161422..8a8d7bbba 100644 --- a/doc/html/math_toolkit/pol_ref/iteration_pol.html +++ b/doc/html/math_toolkit/pol_ref/iteration_pol.html @@ -50,10 +50,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/namespace_pol.html b/doc/html/math_toolkit/pol_ref/namespace_pol.html index 43181b7d8..801850c97 100644 --- a/doc/html/math_toolkit/pol_ref/namespace_pol.html +++ b/doc/html/math_toolkit/pol_ref/namespace_pol.html @@ -140,10 +140,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/pol_ref_ref.html b/doc/html/math_toolkit/pol_ref/pol_ref_ref.html index 7dc388baa..940d077f9 100644 --- a/doc/html/math_toolkit/pol_ref/pol_ref_ref.html +++ b/doc/html/math_toolkit/pol_ref/pol_ref_ref.html @@ -241,10 +241,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/policy_defaults.html b/doc/html/math_toolkit/pol_ref/policy_defaults.html index 7a16c74a4..9e5e34426 100644 --- a/doc/html/math_toolkit/pol_ref/policy_defaults.html +++ b/doc/html/math_toolkit/pol_ref/policy_defaults.html @@ -241,10 +241,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_ref/precision_pol.html b/doc/html/math_toolkit/pol_ref/precision_pol.html index 5f9ecdd4c..de9dc32f5 100644 --- a/doc/html/math_toolkit/pol_ref/precision_pol.html +++ b/doc/html/math_toolkit/pol_ref/precision_pol.html @@ -93,10 +93,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial.html b/doc/html/math_toolkit/pol_tutorial.html index 2e7bb1a94..3a4d7b846 100644 --- a/doc/html/math_toolkit/pol_tutorial.html +++ b/doc/html/math_toolkit/pol_tutorial.html @@ -49,10 +49,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/ad_hoc_dist_policies.html b/doc/html/math_toolkit/pol_tutorial/ad_hoc_dist_policies.html index 395837d4f..e5eec3e92 100644 --- a/doc/html/math_toolkit/pol_tutorial/ad_hoc_dist_policies.html +++ b/doc/html/math_toolkit/pol_tutorial/ad_hoc_dist_policies.html @@ -88,10 +88,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/ad_hoc_sf_policies.html b/doc/html/math_toolkit/pol_tutorial/ad_hoc_sf_policies.html index 091409a05..8ec7b7396 100644 --- a/doc/html/math_toolkit/pol_tutorial/ad_hoc_sf_policies.html +++ b/doc/html/math_toolkit/pol_tutorial/ad_hoc_sf_policies.html @@ -157,10 +157,11 @@ errno = 33
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html b/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html index 443b7ca5c..b21ecfff6 100644 --- a/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html +++ b/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html @@ -241,10 +241,11 @@ errno is set to: 33
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/namespace_policies.html b/doc/html/math_toolkit/pol_tutorial/namespace_policies.html index 15f701917..e539e7ef9 100644 --- a/doc/html/math_toolkit/pol_tutorial/namespace_policies.html +++ b/doc/html/math_toolkit/pol_tutorial/namespace_policies.html @@ -349,10 +349,11 @@ Result of quantile(complement(binom, 0.05)) is: 8
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html b/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html index e95c1c91a..230adb4d4 100644 --- a/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html +++ b/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html @@ -124,10 +124,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/policy_usage.html b/doc/html/math_toolkit/pol_tutorial/policy_usage.html index e1980d502..d04308ec1 100644 --- a/doc/html/math_toolkit/pol_tutorial/policy_usage.html +++ b/doc/html/math_toolkit/pol_tutorial/policy_usage.html @@ -56,10 +56,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/understand_dis_quant.html b/doc/html/math_toolkit/pol_tutorial/understand_dis_quant.html index b59719661..2d868aca1 100644 --- a/doc/html/math_toolkit/pol_tutorial/understand_dis_quant.html +++ b/doc/html/math_toolkit/pol_tutorial/understand_dis_quant.html @@ -400,10 +400,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/user_def_err_pol.html b/doc/html/math_toolkit/pol_tutorial/user_def_err_pol.html index 2b7babb31..117382b63 100644 --- a/doc/html/math_toolkit/pol_tutorial/user_def_err_pol.html +++ b/doc/html/math_toolkit/pol_tutorial/user_def_err_pol.html @@ -437,10 +437,11 @@ Result of tgamma(-190.5) is: 0
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html b/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html index a3220b385..ba24cb0ae 100644 --- a/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html +++ b/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html @@ -71,10 +71,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers.html b/doc/html/math_toolkit/powers.html index 69fc4519e..734f30f54 100644 --- a/doc/html/math_toolkit/powers.html +++ b/doc/html/math_toolkit/powers.html @@ -41,10 +41,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/cbrt.html b/doc/html/math_toolkit/powers/cbrt.html index 8ea73dd7b..9a5acff8d 100644 --- a/doc/html/math_toolkit/powers/cbrt.html +++ b/doc/html/math_toolkit/powers/cbrt.html @@ -148,10 +148,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/cos_pi.html b/doc/html/math_toolkit/powers/cos_pi.html index 893fb7c07..e014985e2 100644 --- a/doc/html/math_toolkit/powers/cos_pi.html +++ b/doc/html/math_toolkit/powers/cos_pi.html @@ -152,10 +152,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/ct_pow.html b/doc/html/math_toolkit/powers/ct_pow.html index 75e1da62e..10c661c96 100644 --- a/doc/html/math_toolkit/powers/ct_pow.html +++ b/doc/html/math_toolkit/powers/ct_pow.html @@ -248,10 +248,11 @@ improving the implementation.
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/expm1.html b/doc/html/math_toolkit/powers/expm1.html index d7bfe542e..7e207ea88 100644 --- a/doc/html/math_toolkit/powers/expm1.html +++ b/doc/html/math_toolkit/powers/expm1.html @@ -160,10 +160,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/hypot.html b/doc/html/math_toolkit/powers/hypot.html index b6e159bf6..d6815bca7 100644 --- a/doc/html/math_toolkit/powers/hypot.html +++ b/doc/html/math_toolkit/powers/hypot.html @@ -74,10 +74,11 @@ in such a way
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/log1p.html b/doc/html/math_toolkit/powers/log1p.html index a8edd32b5..f452deaf4 100644 --- a/doc/html/math_toolkit/powers/log1p.html +++ b/doc/html/math_toolkit/powers/log1p.html @@ -172,10 +172,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/powm1.html b/doc/html/math_toolkit/powers/powm1.html index 794fc754b..01e3be7d5 100644 --- a/doc/html/math_toolkit/powers/powm1.html +++ b/doc/html/math_toolkit/powers/powm1.html @@ -145,10 +145,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/sin_pi.html b/doc/html/math_toolkit/powers/sin_pi.html index 4a50fe1ff..9f6412fd5 100644 --- a/doc/html/math_toolkit/powers/sin_pi.html +++ b/doc/html/math_toolkit/powers/sin_pi.html @@ -152,10 +152,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/powers/sqrt1pm1.html b/doc/html/math_toolkit/powers/sqrt1pm1.html index d6c5131a4..3e0382b07 100644 --- a/doc/html/math_toolkit/powers/sqrt1pm1.html +++ b/doc/html/math_toolkit/powers/sqrt1pm1.html @@ -148,10 +148,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat.html b/doc/html/math_toolkit/quat.html index 81ce888eb..c3d48c778 100644 --- a/doc/html/math_toolkit/quat.html +++ b/doc/html/math_toolkit/quat.html @@ -82,10 +82,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_header.html b/doc/html/math_toolkit/quat_header.html index b20a38c37..eacdb6a47 100644 --- a/doc/html/math_toolkit/quat_header.html +++ b/doc/html/math_toolkit/quat_header.html @@ -32,10 +32,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_history.html b/doc/html/math_toolkit/quat_history.html index 8c4313627..f384f2e6a 100644 --- a/doc/html/math_toolkit/quat_history.html +++ b/doc/html/math_toolkit/quat_history.html @@ -96,10 +96,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_mem_fun.html b/doc/html/math_toolkit/quat_mem_fun.html index a95549314..938d529da 100644 --- a/doc/html/math_toolkit/quat_mem_fun.html +++ b/doc/html/math_toolkit/quat_mem_fun.html @@ -219,10 +219,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_non_mem.html b/doc/html/math_toolkit/quat_non_mem.html index 0438b0c46..4fab7c6ab 100644 --- a/doc/html/math_toolkit/quat_non_mem.html +++ b/doc/html/math_toolkit/quat_non_mem.html @@ -207,10 +207,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_overview.html b/doc/html/math_toolkit/quat_overview.html index 7ac9890cd..840cf3e6b 100644 --- a/doc/html/math_toolkit/quat_overview.html +++ b/doc/html/math_toolkit/quat_overview.html @@ -79,10 +79,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_synopsis.html b/doc/html/math_toolkit/quat_synopsis.html index e4ffcca22..ffb5131a8 100644 --- a/doc/html/math_toolkit/quat_synopsis.html +++ b/doc/html/math_toolkit/quat_synopsis.html @@ -111,10 +111,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_tests.html b/doc/html/math_toolkit/quat_tests.html index 8c012d482..88c69f27f 100644 --- a/doc/html/math_toolkit/quat_tests.html +++ b/doc/html/math_toolkit/quat_tests.html @@ -44,10 +44,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/quat_todo.html b/doc/html/math_toolkit/quat_todo.html index 96b011f30..e6d08e498 100644 --- a/doc/html/math_toolkit/quat_todo.html +++ b/doc/html/math_toolkit/quat_todo.html @@ -44,10 +44,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/rationale.html b/doc/html/math_toolkit/rationale.html index ce3919536..d8d705fa2 100644 --- a/doc/html/math_toolkit/rationale.html +++ b/doc/html/math_toolkit/rationale.html @@ -138,10 +138,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/real_concepts.html b/doc/html/math_toolkit/real_concepts.html index bb5c38f9b..30dfe1ee6 100644 --- a/doc/html/math_toolkit/real_concepts.html +++ b/doc/html/math_toolkit/real_concepts.html @@ -1359,10 +1359,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/refs.html b/doc/html/math_toolkit/refs.html index 8f71197ac..ae4f8395e 100644 --- a/doc/html/math_toolkit/refs.html +++ b/doc/html/math_toolkit/refs.html @@ -198,10 +198,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/relative_error.html b/doc/html/math_toolkit/relative_error.html index efb5bd0dd..7a9f7ed8d 100644 --- a/doc/html/math_toolkit/relative_error.html +++ b/doc/html/math_toolkit/relative_error.html @@ -106,10 +106,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/remez.html b/doc/html/math_toolkit/remez.html index d907f754d..788f0a4c4 100644 --- a/doc/html/math_toolkit/remez.html +++ b/doc/html/math_toolkit/remez.html @@ -521,10 +521,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/result_type.html b/doc/html/math_toolkit/result_type.html index adf4ba9db..082019172 100644 --- a/doc/html/math_toolkit/result_type.html +++ b/doc/html/math_toolkit/result_type.html @@ -136,10 +136,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots.html b/doc/html/math_toolkit/roots.html index 0f197f872..8e55bb808 100644 --- a/doc/html/math_toolkit/roots.html +++ b/doc/html/math_toolkit/roots.html @@ -5,8 +5,8 @@ - - + + @@ -75,9 +75,6 @@
        Comparison of Elliptic Integral Root Finding Algoritghms
        -
        Polynomials
        -
        Polynomial and Rational - Function Evaluation

        Several tools are provided to aid finding minima and roots of functions. @@ -121,10 +118,11 @@ -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/bad_guess.html b/doc/html/math_toolkit/roots/bad_guess.html index a4474334f..16e8e635f 100644 --- a/doc/html/math_toolkit/roots/bad_guess.html +++ b/doc/html/math_toolkit/roots/bad_guess.html @@ -761,10 +761,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/bad_roots.html b/doc/html/math_toolkit/roots/bad_roots.html index 61c8823e8..3155fc140 100644 --- a/doc/html/math_toolkit/roots/bad_roots.html +++ b/doc/html/math_toolkit/roots/bad_roots.html @@ -110,10 +110,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/brent_minima.html b/doc/html/math_toolkit/roots/brent_minima.html index efc452b45..62aceb08c 100644 --- a/doc/html/math_toolkit/roots/brent_minima.html +++ b/doc/html/math_toolkit/roots/brent_minima.html @@ -595,10 +595,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_comparison.html b/doc/html/math_toolkit/roots/root_comparison.html index 16bf97ecf..2ff31850b 100644 --- a/doc/html/math_toolkit/roots/root_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison.html @@ -38,10 +38,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html index af50ca030..0918b5460 100644 --- a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html @@ -1571,10 +1571,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html b/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html index 15ec2e4cf..a5e91aa21 100644 --- a/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@
        -PrevUpHomeNext +PrevUpHomeNext

        @@ -1853,10 +1853,11 @@

        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        @@ -1864,7 +1865,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html index f991430a1..3a929d749 100644 --- a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html @@ -5269,10 +5269,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_finding_examples.html b/doc/html/math_toolkit/roots/root_finding_examples.html index dc2799514..20dae45f5 100644 --- a/doc/html/math_toolkit/roots/root_finding_examples.html +++ b/doc/html/math_toolkit/roots/root_finding_examples.html @@ -73,10 +73,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_finding_examples/5th_root_eg.html b/doc/html/math_toolkit/roots/root_finding_examples/5th_root_eg.html index fa35c3ac6..83a4a38cc 100644 --- a/doc/html/math_toolkit/roots/root_finding_examples/5th_root_eg.html +++ b/doc/html/math_toolkit/roots/root_finding_examples/5th_root_eg.html @@ -152,10 +152,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_finding_examples/cbrt_eg.html b/doc/html/math_toolkit/roots/root_finding_examples/cbrt_eg.html index cd62febc9..d46d162e6 100644 --- a/doc/html/math_toolkit/roots/root_finding_examples/cbrt_eg.html +++ b/doc/html/math_toolkit/roots/root_finding_examples/cbrt_eg.html @@ -469,10 +469,11 @@ and reusing it, omits error handling, and does not handle negative values
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_finding_examples/elliptic_eg.html b/doc/html/math_toolkit/roots/root_finding_examples/elliptic_eg.html index 66d2ee781..36d580f7c 100644 --- a/doc/html/math_toolkit/roots/root_finding_examples/elliptic_eg.html +++ b/doc/html/math_toolkit/roots/root_finding_examples/elliptic_eg.html @@ -255,10 +255,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_finding_examples/lambda.html b/doc/html/math_toolkit/roots/root_finding_examples/lambda.html index 7fe8c48e1..2dc4c15bc 100644 --- a/doc/html/math_toolkit/roots/root_finding_examples/lambda.html +++ b/doc/html/math_toolkit/roots/root_finding_examples/lambda.html @@ -61,10 +61,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_finding_examples/multiprecision_root.html b/doc/html/math_toolkit/roots/root_finding_examples/multiprecision_root.html index 185f804a7..6afab4f70 100644 --- a/doc/html/math_toolkit/roots/root_finding_examples/multiprecision_root.html +++ b/doc/html/math_toolkit/roots/root_finding_examples/multiprecision_root.html @@ -274,10 +274,11 @@ value = 2, cube root =1.2599210498948731647672106072782283505702514647015
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/root_finding_examples/nth_root.html b/doc/html/math_toolkit/roots/root_finding_examples/nth_root.html index e5ac2898b..954a974ab 100644 --- a/doc/html/math_toolkit/roots/root_finding_examples/nth_root.html +++ b/doc/html/math_toolkit/roots/root_finding_examples/nth_root.html @@ -167,10 +167,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_deriv.html b/doc/html/math_toolkit/roots/roots_deriv.html index 527c77bc9..97c494771 100644 --- a/doc/html/math_toolkit/roots/roots_deriv.html +++ b/doc/html/math_toolkit/roots/roots_deriv.html @@ -298,10 +298,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_noderiv.html b/doc/html/math_toolkit/roots/roots_noderiv.html index 43ef649e7..993bfd16c 100644 --- a/doc/html/math_toolkit/roots/roots_noderiv.html +++ b/doc/html/math_toolkit/roots/roots_noderiv.html @@ -205,10 +205,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_noderiv/TOMS748.html b/doc/html/math_toolkit/roots/roots_noderiv/TOMS748.html index 5977ebfd7..a8975520a 100644 --- a/doc/html/math_toolkit/roots/roots_noderiv/TOMS748.html +++ b/doc/html/math_toolkit/roots/roots_noderiv/TOMS748.html @@ -176,10 +176,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_noderiv/bisect.html b/doc/html/math_toolkit/roots/roots_noderiv/bisect.html index ec961bf98..e27820800 100644 --- a/doc/html/math_toolkit/roots/roots_noderiv/bisect.html +++ b/doc/html/math_toolkit/roots/roots_noderiv/bisect.html @@ -135,10 +135,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_noderiv/bracket_solve.html b/doc/html/math_toolkit/roots/roots_noderiv/bracket_solve.html index 5a6cb91e6..25914a70e 100644 --- a/doc/html/math_toolkit/roots/roots_noderiv/bracket_solve.html +++ b/doc/html/math_toolkit/roots/roots_noderiv/bracket_solve.html @@ -169,10 +169,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_noderiv/brent.html b/doc/html/math_toolkit/roots/roots_noderiv/brent.html index 36a3cd11f..417bd012e 100644 --- a/doc/html/math_toolkit/roots/roots_noderiv/brent.html +++ b/doc/html/math_toolkit/roots/roots_noderiv/brent.html @@ -37,10 +37,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_noderiv/implementation.html b/doc/html/math_toolkit/roots/roots_noderiv/implementation.html index 67b6836a3..9cdeb94a7 100644 --- a/doc/html/math_toolkit/roots/roots_noderiv/implementation.html +++ b/doc/html/math_toolkit/roots/roots_noderiv/implementation.html @@ -46,10 +46,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/roots/roots_noderiv/root_termination.html b/doc/html/math_toolkit/roots/roots_noderiv/root_termination.html index e11a52f70..17f04e229 100644 --- a/doc/html/math_toolkit/roots/roots_noderiv/root_termination.html +++ b/doc/html/math_toolkit/roots/roots_noderiv/root_termination.html @@ -85,10 +85,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/rounding.html b/doc/html/math_toolkit/rounding.html index b2cd4e99a..61a29c30c 100644 --- a/doc/html/math_toolkit/rounding.html +++ b/doc/html/math_toolkit/rounding.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/rounding/modf.html b/doc/html/math_toolkit/rounding/modf.html index b9268ca61..6ae3c3f93 100644 --- a/doc/html/math_toolkit/rounding/modf.html +++ b/doc/html/math_toolkit/rounding/modf.html @@ -66,10 +66,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/rounding/round.html b/doc/html/math_toolkit/rounding/round.html index fd69da631..94bb9a6b0 100644 --- a/doc/html/math_toolkit/rounding/round.html +++ b/doc/html/math_toolkit/rounding/round.html @@ -66,10 +66,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/rounding/trunc.html b/doc/html/math_toolkit/rounding/trunc.html index 0e833b8c8..7006aa7eb 100644 --- a/doc/html/math_toolkit/rounding/trunc.html +++ b/doc/html/math_toolkit/rounding/trunc.html @@ -68,10 +68,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_beta.html b/doc/html/math_toolkit/sf_beta.html index d14c89a26..ba7b50414 100644 --- a/doc/html/math_toolkit/sf_beta.html +++ b/doc/html/math_toolkit/sf_beta.html @@ -38,10 +38,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_beta/beta_derivative.html b/doc/html/math_toolkit/sf_beta/beta_derivative.html index 28f2c8e5b..b23822ad2 100644 --- a/doc/html/math_toolkit/sf_beta/beta_derivative.html +++ b/doc/html/math_toolkit/sf_beta/beta_derivative.html @@ -85,10 +85,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_beta/beta_function.html b/doc/html/math_toolkit/sf_beta/beta_function.html index 7974e6dcf..e849450aa 100644 --- a/doc/html/math_toolkit/sf_beta/beta_function.html +++ b/doc/html/math_toolkit/sf_beta/beta_function.html @@ -301,10 +301,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_beta/ibeta_function.html b/doc/html/math_toolkit/sf_beta/ibeta_function.html index 299db0190..10552a8d5 100644 --- a/doc/html/math_toolkit/sf_beta/ibeta_function.html +++ b/doc/html/math_toolkit/sf_beta/ibeta_function.html @@ -876,10 +876,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_beta/ibeta_inv_function.html b/doc/html/math_toolkit/sf_beta/ibeta_inv_function.html index 0e8e0c1df..e1b9de4a8 100644 --- a/doc/html/math_toolkit/sf_beta/ibeta_inv_function.html +++ b/doc/html/math_toolkit/sf_beta/ibeta_inv_function.html @@ -895,10 +895,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_erf.html b/doc/html/math_toolkit/sf_erf.html index 51cd7f6e0..95860ef22 100644 --- a/doc/html/math_toolkit/sf_erf.html +++ b/doc/html/math_toolkit/sf_erf.html @@ -33,10 +33,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_erf/error_function.html b/doc/html/math_toolkit/sf_erf/error_function.html index 41202d815..58d15b04c 100644 --- a/doc/html/math_toolkit/sf_erf/error_function.html +++ b/doc/html/math_toolkit/sf_erf/error_function.html @@ -475,10 +475,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_erf/error_inv.html b/doc/html/math_toolkit/sf_erf/error_inv.html index 72f2eb6c4..5a75c8175 100644 --- a/doc/html/math_toolkit/sf_erf/error_inv.html +++ b/doc/html/math_toolkit/sf_erf/error_inv.html @@ -334,10 +334,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma.html b/doc/html/math_toolkit/sf_gamma.html index faae8723d..562210c0d 100644 --- a/doc/html/math_toolkit/sf_gamma.html +++ b/doc/html/math_toolkit/sf_gamma.html @@ -42,10 +42,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/digamma.html b/doc/html/math_toolkit/sf_gamma/digamma.html index be568f79d..56ad08e82 100644 --- a/doc/html/math_toolkit/sf_gamma/digamma.html +++ b/doc/html/math_toolkit/sf_gamma/digamma.html @@ -450,10 +450,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/gamma_derivatives.html b/doc/html/math_toolkit/sf_gamma/gamma_derivatives.html index 0c2483e44..d1f032dc9 100644 --- a/doc/html/math_toolkit/sf_gamma/gamma_derivatives.html +++ b/doc/html/math_toolkit/sf_gamma/gamma_derivatives.html @@ -90,10 +90,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/gamma_ratios.html b/doc/html/math_toolkit/sf_gamma/gamma_ratios.html index 3d06f2621..6de3b8f35 100644 --- a/doc/html/math_toolkit/sf_gamma/gamma_ratios.html +++ b/doc/html/math_toolkit/sf_gamma/gamma_ratios.html @@ -401,10 +401,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/igamma.html b/doc/html/math_toolkit/sf_gamma/igamma.html index ffaeaac09..8334e0449 100644 --- a/doc/html/math_toolkit/sf_gamma/igamma.html +++ b/doc/html/math_toolkit/sf_gamma/igamma.html @@ -946,10 +946,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/igamma_inv.html b/doc/html/math_toolkit/sf_gamma/igamma_inv.html index fa16ab686..b720c5b93 100644 --- a/doc/html/math_toolkit/sf_gamma/igamma_inv.html +++ b/doc/html/math_toolkit/sf_gamma/igamma_inv.html @@ -605,10 +605,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/lgamma.html b/doc/html/math_toolkit/sf_gamma/lgamma.html index 0bf5dd7f9..0f634c04f 100644 --- a/doc/html/math_toolkit/sf_gamma/lgamma.html +++ b/doc/html/math_toolkit/sf_gamma/lgamma.html @@ -470,10 +470,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/polygamma.html b/doc/html/math_toolkit/sf_gamma/polygamma.html index 122bbc715..cee503ff1 100644 --- a/doc/html/math_toolkit/sf_gamma/polygamma.html +++ b/doc/html/math_toolkit/sf_gamma/polygamma.html @@ -392,10 +392,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/tgamma.html b/doc/html/math_toolkit/sf_gamma/tgamma.html index 2aad379d5..7df811d7b 100644 --- a/doc/html/math_toolkit/sf_gamma/tgamma.html +++ b/doc/html/math_toolkit/sf_gamma/tgamma.html @@ -514,10 +514,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_gamma/trigamma.html b/doc/html/math_toolkit/sf_gamma/trigamma.html index 73919ff12..fdf715580 100644 --- a/doc/html/math_toolkit/sf_gamma/trigamma.html +++ b/doc/html/math_toolkit/sf_gamma/trigamma.html @@ -188,10 +188,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_implementation.html b/doc/html/math_toolkit/sf_implementation.html index 443a8f210..dff8356e1 100644 --- a/doc/html/math_toolkit/sf_implementation.html +++ b/doc/html/math_toolkit/sf_implementation.html @@ -845,10 +845,11 @@ done
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_poly.html b/doc/html/math_toolkit/sf_poly.html index b0b3ebc09..3b0282b91 100644 --- a/doc/html/math_toolkit/sf_poly.html +++ b/doc/html/math_toolkit/sf_poly.html @@ -29,6 +29,8 @@
        Legendre (and Associated) Polynomials
        +
        Legendre-Stieltjes + Polynomials
        Laguerre (and Associated) Polynomials
        Hermite Polynomials
        @@ -37,10 +39,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_poly/hermite.html b/doc/html/math_toolkit/sf_poly/hermite.html index 40792eddc..3c2cfa86d 100644 --- a/doc/html/math_toolkit/sf_poly/hermite.html +++ b/doc/html/math_toolkit/sf_poly/hermite.html @@ -226,10 +226,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sf_poly/laguerre.html b/doc/html/math_toolkit/sf_poly/laguerre.html index d70a7ba5e..53bc4f4ce 100644 --- a/doc/html/math_toolkit/sf_poly/laguerre.html +++ b/doc/html/math_toolkit/sf_poly/laguerre.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
        -PrevUpHomeNext +PrevUpHomeNext

        @@ -367,10 +367,11 @@

        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        @@ -378,7 +379,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/math_toolkit/sf_poly/legendre.html b/doc/html/math_toolkit/sf_poly/legendre.html index 833de766a..db7610344 100644 --- a/doc/html/math_toolkit/sf_poly/legendre.html +++ b/doc/html/math_toolkit/sf_poly/legendre.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@
        -PrevUpHomeNext +PrevUpHomeNext

        @@ -41,6 +41,18 @@ template <class T, class Policy> calculated-result-type legendre_p(int n, T x, const Policy&); +template <class T> +calculated-result-type legendre_p_prime(int n, T x); + +template <class T, class Policy> +calculated-result-type legendre_p_prime(int n, T x, const Policy&); + +template <class T, class Policy> +std::vector<T> legendre_p_zeros(int l, const Policy&); + +template <class T> +std::vector<T> legendre_p_zeros(int l); + template <class T> calculated-result-type legendre_p(int n, int m, T x); @@ -106,6 +118,41 @@ 

        template <class T>
+calculated-result-type legendre_p_prime(int n, T x);
+
+template <class T, class Policy>
+calculated-result-type legendre_p_prime(int n, T x, const Policy&);
+
        +

        + Returns the derivatives of the Legendre polynomials. +

        +
        template <class T, class Policy>
+std::vector<T> legendre_p_zeros(int l, const Policy&);
+
+template <class T>
+std::vector<T> legendre_p_zeros(int l);
+
        +

        + The zeros of the Legendre polynomials are calculated by Newton's method using + an initial guess given by Tricomi with root bracketing provided by Szego. +

        +

        + Since the Legendre polynomials are alternatively even and odd, only the non-negative + zeros are returned. For the odd Legendre polynomials, the first zero is always + zero. The rest of the zeros are returned in increasing order. +

        +

        + Note that the argument to the routine is an integer, and the output is a + floating-point type. Hence the template argument is mandatory. The time to + extract a single root is linear in l + (this is scaling to evaluate the Legendre polynomials), so recovering all + roots is 𝑶(l2). Algorithms + with linear scaling exist + for recovering all roots, but requires tooling not currently built into boost.math. + This implementation proceeds under the assumption that calculating zeros + of these functions will not be a bottleneck for any workflow. +

        +
        template <class T>
 calculated-result-type legendre_p(int l, int m, T x);
 
 template <class T, class Policy>
@@ -585,10 +632,11 @@

        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        @@ -596,7 +644,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/math_toolkit/sf_poly/sph_harm.html b/doc/html/math_toolkit/sf_poly/sph_harm.html index 42e8777d5..f5150070d 100644 --- a/doc/html/math_toolkit/sf_poly/sph_harm.html +++ b/doc/html/math_toolkit/sf_poly/sph_harm.html @@ -317,10 +317,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sign_functions.html b/doc/html/math_toolkit/sign_functions.html index dd3be3bf8..64cb6ac62 100644 --- a/doc/html/math_toolkit/sign_functions.html +++ b/doc/html/math_toolkit/sign_functions.html @@ -234,10 +234,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sinc.html b/doc/html/math_toolkit/sinc.html index 12b1a04f0..54c4bb18b 100644 --- a/doc/html/math_toolkit/sinc.html +++ b/doc/html/math_toolkit/sinc.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sinc/sinc_overview.html b/doc/html/math_toolkit/sinc/sinc_overview.html index eb107c85b..598c7dca7 100644 --- a/doc/html/math_toolkit/sinc/sinc_overview.html +++ b/doc/html/math_toolkit/sinc/sinc_overview.html @@ -66,10 +66,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sinc/sinc_pi.html b/doc/html/math_toolkit/sinc/sinc_pi.html index 5ea316cd0..792439370 100644 --- a/doc/html/math_toolkit/sinc/sinc_pi.html +++ b/doc/html/math_toolkit/sinc/sinc_pi.html @@ -62,10 +62,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/sinc/sinhc_pi.html b/doc/html/math_toolkit/sinc/sinhc_pi.html index a4a40dac4..2e1f3451e 100644 --- a/doc/html/math_toolkit/sinc/sinhc_pi.html +++ b/doc/html/math_toolkit/sinc/sinhc_pi.html @@ -66,10 +66,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/spec.html b/doc/html/math_toolkit/spec.html index 25f95f2d7..9491080b7 100644 --- a/doc/html/math_toolkit/spec.html +++ b/doc/html/math_toolkit/spec.html @@ -175,10 +175,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/special_tut.html b/doc/html/math_toolkit/special_tut.html index 012252b94..08f20e021 100644 --- a/doc/html/math_toolkit/special_tut.html +++ b/doc/html/math_toolkit/special_tut.html @@ -34,10 +34,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/special_tut/special_tut_impl.html b/doc/html/math_toolkit/special_tut/special_tut_impl.html index df2db20fe..6ff491875 100644 --- a/doc/html/math_toolkit/special_tut/special_tut_impl.html +++ b/doc/html/math_toolkit/special_tut/special_tut_impl.html @@ -373,10 +373,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/special_tut/special_tut_test.html b/doc/html/math_toolkit/special_tut/special_tut_test.html index af47cb7cc..3ac3788a6 100644 --- a/doc/html/math_toolkit/special_tut/special_tut_test.html +++ b/doc/html/math_toolkit/special_tut/special_tut_test.html @@ -508,10 +508,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/specified_typedefs.html b/doc/html/math_toolkit/specified_typedefs.html index e0d15fd15..cf336b7eb 100644 --- a/doc/html/math_toolkit/specified_typedefs.html +++ b/doc/html/math_toolkit/specified_typedefs.html @@ -91,10 +91,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut.html b/doc/html/math_toolkit/stat_tut.html index f6f4a5178..1adbc05dc 100644 --- a/doc/html/math_toolkit/stat_tut.html +++ b/doc/html/math_toolkit/stat_tut.html @@ -138,10 +138,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/dist_params.html b/doc/html/math_toolkit/stat_tut/dist_params.html index b477cfabc..76cbcb4e1 100644 --- a/doc/html/math_toolkit/stat_tut/dist_params.html +++ b/doc/html/math_toolkit/stat_tut/dist_params.html @@ -83,10 +83,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/overview.html b/doc/html/math_toolkit/stat_tut/overview.html index 19145c9a4..f9c84301f 100644 --- a/doc/html/math_toolkit/stat_tut/overview.html +++ b/doc/html/math_toolkit/stat_tut/overview.html @@ -42,10 +42,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/overview/complements.html b/doc/html/math_toolkit/stat_tut/overview/complements.html index 01d91c6dd..c014776ad 100644 --- a/doc/html/math_toolkit/stat_tut/overview/complements.html +++ b/doc/html/math_toolkit/stat_tut/overview/complements.html @@ -183,10 +183,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/overview/generic.html b/doc/html/math_toolkit/stat_tut/overview/generic.html index 104fb1dbc..0b92836cb 100644 --- a/doc/html/math_toolkit/stat_tut/overview/generic.html +++ b/doc/html/math_toolkit/stat_tut/overview/generic.html @@ -237,10 +237,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/overview/headers.html b/doc/html/math_toolkit/stat_tut/overview/headers.html index 1876a9dd6..01fb52a73 100644 --- a/doc/html/math_toolkit/stat_tut/overview/headers.html +++ b/doc/html/math_toolkit/stat_tut/overview/headers.html @@ -61,10 +61,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/overview/objects.html b/doc/html/math_toolkit/stat_tut/overview/objects.html index 604232375..dc89c18a8 100644 --- a/doc/html/math_toolkit/stat_tut/overview/objects.html +++ b/doc/html/math_toolkit/stat_tut/overview/objects.html @@ -117,10 +117,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/overview/parameters.html b/doc/html/math_toolkit/stat_tut/overview/parameters.html index eb18fa2a1..053b39ff2 100644 --- a/doc/html/math_toolkit/stat_tut/overview/parameters.html +++ b/doc/html/math_toolkit/stat_tut/overview/parameters.html @@ -56,10 +56,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/overview/summary.html b/doc/html/math_toolkit/stat_tut/overview/summary.html index 186b65107..a45bd58d0 100644 --- a/doc/html/math_toolkit/stat_tut/overview/summary.html +++ b/doc/html/math_toolkit/stat_tut/overview/summary.html @@ -58,10 +58,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/variates.html b/doc/html/math_toolkit/stat_tut/variates.html index 69547963e..af0292381 100644 --- a/doc/html/math_toolkit/stat_tut/variates.html +++ b/doc/html/math_toolkit/stat_tut/variates.html @@ -59,10 +59,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg.html b/doc/html/math_toolkit/stat_tut/weg.html index 6286f06e9..5586084e1 100644 --- a/doc/html/math_toolkit/stat_tut/weg.html +++ b/doc/html/math_toolkit/stat_tut/weg.html @@ -112,10 +112,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/binom_eg.html b/doc/html/math_toolkit/stat_tut/weg/binom_eg.html index 1c07a3cbb..8c7862ff7 100644 --- a/doc/html/math_toolkit/stat_tut/weg/binom_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/binom_eg.html @@ -44,10 +44,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_conf.html b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_conf.html index 16c30c118..576fc60be 100644 --- a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_conf.html +++ b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_conf.html @@ -224,10 +224,11 @@ _______________________________________________________________________
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_size_eg.html b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_size_eg.html index e8f852910..a378fe041 100644 --- a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_size_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binom_size_eg.html @@ -143,10 +143,11 @@ ____________________________
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_coinflip_example.html b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_coinflip_example.html index 7857bf34f..49a347b23 100644 --- a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_coinflip_example.html +++ b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_coinflip_example.html @@ -257,10 +257,11 @@ Probability of getting upto (<=) heads
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_quiz_example.html b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_quiz_example.html index b7e1275b8..3481db41c 100644 --- a/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_quiz_example.html +++ b/doc/html/math_toolkit/stat_tut/weg/binom_eg/binomial_quiz_example.html @@ -441,10 +441,11 @@ If guessing then percentiles 1 to 99% will get 0 to 7.788 right.
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/c_sharp.html b/doc/html/math_toolkit/stat_tut/weg/c_sharp.html index 317259dd8..197ae8bdc 100644 --- a/doc/html/math_toolkit/stat_tut/weg/c_sharp.html +++ b/doc/html/math_toolkit/stat_tut/weg/c_sharp.html @@ -41,10 +41,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/cs_eg.html b/doc/html/math_toolkit/stat_tut/weg/cs_eg.html index baf587020..9313b9485 100644 --- a/doc/html/math_toolkit/stat_tut/weg/cs_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/cs_eg.html @@ -38,10 +38,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_intervals.html b/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_intervals.html index 66f8458aa..966447ffc 100644 --- a/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_intervals.html +++ b/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_intervals.html @@ -219,10 +219,11 @@ ________________________________________
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_size.html b/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_size.html index 4dac8e079..0542df7c9 100644 --- a/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_size.html +++ b/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_size.html @@ -165,10 +165,11 @@ _______________________________________________________________
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_test.html b/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_test.html index 8f7521ab9..1d5a32c67 100644 --- a/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_test.html +++ b/doc/html/math_toolkit/stat_tut/weg/cs_eg/chi_sq_test.html @@ -280,10 +280,11 @@ Standard Deviation > 10.000 ACCEPTED
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/dist_construct_eg.html b/doc/html/math_toolkit/stat_tut/weg/dist_construct_eg.html index fc6d72d55..5ab9cd0fe 100644 --- a/doc/html/math_toolkit/stat_tut/weg/dist_construct_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/dist_construct_eg.html @@ -316,10 +316,11 @@ error C3861: 'mybetad0': identifier not found
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/error_eg.html b/doc/html/math_toolkit/stat_tut/weg/error_eg.html index 5cba0a15d..0d27ed877 100644 --- a/doc/html/math_toolkit/stat_tut/weg/error_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/error_eg.html @@ -189,10 +189,11 @@ errno is set to: 33
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/f_eg.html b/doc/html/math_toolkit/stat_tut/weg/f_eg.html index d4934d9b5..f7e55b444 100644 --- a/doc/html/math_toolkit/stat_tut/weg/f_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/f_eg.html @@ -312,10 +312,11 @@ Standard deviation 1 is greater than standard deviation 2 ACCEPTED
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/find_eg.html b/doc/html/math_toolkit/stat_tut/weg/find_eg.html index c38dcab36..417da583f 100644 --- a/doc/html/math_toolkit/stat_tut/weg/find_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/find_eg.html @@ -38,10 +38,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/find_eg/find_location_eg.html b/doc/html/math_toolkit/stat_tut/weg/find_eg/find_location_eg.html index ba49f4ea1..c3de576c7 100644 --- a/doc/html/math_toolkit/stat_tut/weg/find_eg/find_location_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/find_eg/find_location_eg.html @@ -173,10 +173,11 @@ Normal distribution with mean = 0.355146 has fraction > 2 = 0.05
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/find_eg/find_mean_and_sd_eg.html b/doc/html/math_toolkit/stat_tut/weg/find_eg/find_mean_and_sd_eg.html index de453e3b6..1c92555bf 100644 --- a/doc/html/math_toolkit/stat_tut/weg/find_eg/find_mean_and_sd_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/find_eg/find_mean_and_sd_eg.html @@ -438,10 +438,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/find_eg/find_scale_eg.html b/doc/html/math_toolkit/stat_tut/weg/find_eg/find_scale_eg.html index 7f5a1e8af..8c67971af 100644 --- a/doc/html/math_toolkit/stat_tut/weg/find_eg/find_scale_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/find_eg/find_scale_eg.html @@ -192,10 +192,11 @@ Normal distribution with mean = 0.946339 has fraction > -2 = 0.999
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html b/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html index d620ff7c3..6495ab13b 100644 --- a/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/geometric_eg.html @@ -405,10 +405,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/inverse_chi_squared_eg.html b/doc/html/math_toolkit/stat_tut/weg/inverse_chi_squared_eg.html index c27cce943..070da4223 100644 --- a/doc/html/math_toolkit/stat_tut/weg/inverse_chi_squared_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/inverse_chi_squared_eg.html @@ -343,10 +343,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/nag_library.html b/doc/html/math_toolkit/stat_tut/weg/nag_library.html index c27a348d5..352ec0c3f 100644 --- a/doc/html/math_toolkit/stat_tut/weg/nag_library.html +++ b/doc/html/math_toolkit/stat_tut/weg/nag_library.html @@ -99,10 +99,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/nccs_eg.html b/doc/html/math_toolkit/stat_tut/weg/nccs_eg.html index c7a548747..85e255b3f 100644 --- a/doc/html/math_toolkit/stat_tut/weg/nccs_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/nccs_eg.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/nccs_eg/nccs_power_eg.html b/doc/html/math_toolkit/stat_tut/weg/nccs_eg/nccs_power_eg.html index 75e07fd63..3a80d6c3c 100644 --- a/doc/html/math_toolkit/stat_tut/weg/nccs_eg/nccs_power_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/nccs_eg/nccs_power_eg.html @@ -1270,10 +1270,11 @@ test at the 5% significance
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg.html b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg.html index 796873fd2..07f30ce65 100644 --- a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg.html @@ -45,10 +45,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_conf.html b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_conf.html index bdd04b7db..20f07abe1 100644 --- a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_conf.html +++ b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_conf.html @@ -204,10 +204,11 @@ ___________________________________________
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html index ba980e188..1e9e798aa 100644 --- a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html @@ -190,10 +190,11 @@ ____________________________
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html index c47e1592b..a5a73691e 100644 --- a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html +++ b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html @@ -283,32 +283,20 @@ on or before the 12th house is 0.56182 on or before the 30th house is 0.99849

        - /*So the - risk of - failing even - after visiting - all the - houses is - 1 - this probability, 1 - - cdf(nb, all_houses - - sales_quota - But using - this expression - may cause - serious inaccuracy, so it would - be much - better to - use the - complement of - the cdf: So the risk - of failing - even at, or after, the 31th (non-existent) - houses is - 1 - this probability, 1 - - cdf(nb, all_houses - - sales_quota)` But using this expression may cause - serious inaccuracy. So it would be much better to use the __complement - of the cdf (see why complements?). + So the risk of failing even after visiting all the houses is 1 - this + probability, +

        +
        1 - cdf(nb, all_houses - sales_quota
        +

        + But using this expression may cause serious inaccuracy, so it would be + much better to use the complement of the cdf: So the risk of failing + even at, or after, the 31th (non-existent) houses is 1 - this probability, +

        +
        1 - cdf(nb, all_houses - sales_quota)
        +

        + But using this expression may cause serious inaccuracy. So it would be + much better to use the __complement of the cdf (see why + complements?). 

        cout << "\nProbability of failing to sell his quota of " << sales_quota
   << " bars\neven after visiting all " << all_houses << " houses is "
@@ -490,10 +478,11 @@ If confidence of meeting quota is 0.95, then finishing house is 21
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html index 90f6e70d5..da79ed8d6 100644 --- a/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html +++ b/doc/html/math_toolkit/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html @@ -119,10 +119,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/normal_example.html b/doc/html/math_toolkit/stat_tut/weg/normal_example.html index bfc704160..9fd960889 100644 --- a/doc/html/math_toolkit/stat_tut/weg/normal_example.html +++ b/doc/html/math_toolkit/stat_tut/weg/normal_example.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/normal_example/normal_misc.html b/doc/html/math_toolkit/stat_tut/weg/normal_example/normal_misc.html index 20054fb20..5cd9c68cc 100644 --- a/doc/html/math_toolkit/stat_tut/weg/normal_example/normal_misc.html +++ b/doc/html/math_toolkit/stat_tut/weg/normal_example/normal_misc.html @@ -501,10 +501,11 @@ Fraction 3 standard deviations within either side of mean is 0.997300203936740
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/st_eg.html b/doc/html/math_toolkit/stat_tut/weg/st_eg.html index 7976608ad..e86fda1e7 100644 --- a/doc/html/math_toolkit/stat_tut/weg/st_eg.html +++ b/doc/html/math_toolkit/stat_tut/weg/st_eg.html @@ -43,10 +43,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/st_eg/paired_st.html b/doc/html/math_toolkit/stat_tut/weg/st_eg/paired_st.html index fa0c43a1b..79e50196f 100644 --- a/doc/html/math_toolkit/stat_tut/weg/st_eg/paired_st.html +++ b/doc/html/math_toolkit/stat_tut/weg/st_eg/paired_st.html @@ -64,10 +64,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_intervals.html b/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_intervals.html index 6548cf459..76b202db0 100644 --- a/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_intervals.html +++ b/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_intervals.html @@ -250,10 +250,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_size.html b/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_size.html index fc1dda72d..888f246fb 100644 --- a/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_size.html +++ b/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_size.html @@ -162,10 +162,11 @@ _______________________________________________________________
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_test.html b/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_test.html index 9501babdc..da2aa99ca 100644 --- a/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_test.html +++ b/doc/html/math_toolkit/stat_tut/weg/st_eg/tut_mean_test.html @@ -317,10 +317,11 @@ Mean > 38.900 REJECTED
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/stat_tut/weg/st_eg/two_sample_students_t.html b/doc/html/math_toolkit/stat_tut/weg/st_eg/two_sample_students_t.html index 58e3d0424..6582c03fa 100644 --- a/doc/html/math_toolkit/stat_tut/weg/st_eg/two_sample_students_t.html +++ b/doc/html/math_toolkit/stat_tut/weg/st_eg/two_sample_students_t.html @@ -342,10 +342,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/threads.html b/doc/html/math_toolkit/threads.html index c6b63d736..c2e0bc385 100644 --- a/doc/html/math_toolkit/threads.html +++ b/doc/html/math_toolkit/threads.html @@ -35,10 +35,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/tr1_ref.html b/doc/html/math_toolkit/tr1_ref.html index 99ce266bd..419d5e0b7 100644 --- a/doc/html/math_toolkit/tr1_ref.html +++ b/doc/html/math_toolkit/tr1_ref.html @@ -521,10 +521,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/tradoffs.html b/doc/html/math_toolkit/tradoffs.html index b27f159df..74e12df69 100644 --- a/doc/html/math_toolkit/tradoffs.html +++ b/doc/html/math_toolkit/tradoffs.html @@ -161,10 +161,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/trans.html b/doc/html/math_toolkit/trans.html index 3010d7122..120e7aba7 100644 --- a/doc/html/math_toolkit/trans.html +++ b/doc/html/math_toolkit/trans.html @@ -127,10 +127,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/tuning.html b/doc/html/math_toolkit/tuning.html index 8e9d26465..f6abb65ec 100644 --- a/doc/html/math_toolkit/tuning.html +++ b/doc/html/math_toolkit/tuning.html @@ -2158,10 +2158,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/tutorial.html b/doc/html/math_toolkit/tutorial.html index c07b9afc4..0e5c3ef20 100644 --- a/doc/html/math_toolkit/tutorial.html +++ b/doc/html/math_toolkit/tutorial.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/tutorial/non_templ.html b/doc/html/math_toolkit/tutorial/non_templ.html index 70797f688..3af121560 100644 --- a/doc/html/math_toolkit/tutorial/non_templ.html +++ b/doc/html/math_toolkit/tutorial/non_templ.html @@ -69,10 +69,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/tutorial/templ.html b/doc/html/math_toolkit/tutorial/templ.html index 9f7876f12..3cbfb259e 100644 --- a/doc/html/math_toolkit/tutorial/templ.html +++ b/doc/html/math_toolkit/tutorial/templ.html @@ -140,10 +140,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/tutorial/user_def.html b/doc/html/math_toolkit/tutorial/user_def.html index bf09b64a0..8b7f796ec 100644 --- a/doc/html/math_toolkit/tutorial/user_def.html +++ b/doc/html/math_toolkit/tutorial/user_def.html @@ -319,10 +319,11 @@ the constant will be constructed from a string on each call.
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/value_op.html b/doc/html/math_toolkit/value_op.html index 2e7f39f06..4e949d6b6 100644 --- a/doc/html/math_toolkit/value_op.html +++ b/doc/html/math_toolkit/value_op.html @@ -92,10 +92,11 @@
        - - - - - - + + + + + + + + + + - - - - - + + + + + - - - - - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/zetas.html b/doc/html/math_toolkit/zetas.html index 0f2b81b84..cc3d4eeb5 100644 --- a/doc/html/math_toolkit/zetas.html +++ b/doc/html/math_toolkit/zetas.html @@ -30,10 +30,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/math_toolkit/zetas/zeta.html b/doc/html/math_toolkit/zetas/zeta.html index 0c46373be..c36c405c4 100644 --- a/doc/html/math_toolkit/zetas/zeta.html +++ b/doc/html/math_toolkit/zetas/zeta.html @@ -370,10 +370,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/octonions.html b/doc/html/octonions.html index 8e9cd08a0..7fd7611f7 100644 --- a/doc/html/octonions.html +++ b/doc/html/octonions.html @@ -48,10 +48,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/overview.html b/doc/html/overview.html index c7b6945c9..15ed31daa 100644 --- a/doc/html/overview.html +++ b/doc/html/overview.html @@ -53,10 +53,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/perf.html b/doc/html/perf.html index b2030b022..f3770e380 100644 --- a/doc/html/perf.html +++ b/doc/html/perf.html @@ -45,10 +45,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/policy.html b/doc/html/policy.html index c0367a618..396196e75 100644 --- a/doc/html/policy.html +++ b/doc/html/policy.html @@ -74,10 +74,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/quaternions.html b/doc/html/quaternions.html index 617f9be33..a2258da2e 100644 --- a/doc/html/quaternions.html +++ b/doc/html/quaternions.html @@ -49,10 +49,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/rooting.html b/doc/html/rooting.html index 9117cff6e..88707588f 100644 --- a/doc/html/rooting.html +++ b/doc/html/rooting.html @@ -1,7 +1,7 @@ -Chapter 12. Tools: Root Finding & Minimization Algorithms, Polynomial Arithmetic & Evaluation +Chapter 12. Tools: Root Finding & Minimization Algorithms, Polynomial Arithmetic & Evaluation, Interpolation & Quadrature @@ -25,7 +25,7 @@

        Chapter 12. Tools: Root Finding & Minimization Algorithms, Polynomial Arithmetic - & Evaluation

        + & Evaluation, Interpolation & Quadrature

        Table of Contents

        @@ -79,19 +79,29 @@
        Comparison of Elliptic Integral Root Finding Algoritghms
        -
        Polynomials
        -
        Polynomial and Rational - Function Evaluation
        +
        Polynomials
        +
        Polynomial and Rational Function + Evaluation
        +
        Interpolation Functions
        +
        +
        Cubic B-spline interpolation
        +
        Barycentric Rational + Interpolation
        +
        +
        Quadrature
        +
        Adaptive Trapezoidal + Quadrature
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/special.html b/doc/html/special.html index 376443a6e..b4e61f004 100644 --- a/doc/html/special.html +++ b/doc/html/special.html @@ -77,6 +77,8 @@
        Legendre (and Associated) Polynomials
        +
        Legendre-Stieltjes + Polynomials
        Laguerre (and Associated) Polynomials
        Hermite Polynomials
        @@ -199,10 +201,11 @@
        - - +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/standalone_HTML.manifest b/doc/html/standalone_HTML.manifest index 53e858e07..dd61a278c 100644 --- a/doc/html/standalone_HTML.manifest +++ b/doc/html/standalone_HTML.manifest @@ -178,6 +178,7 @@ math_toolkit/sf_erf/error_function.html math_toolkit/sf_erf/error_inv.html math_toolkit/sf_poly.html math_toolkit/sf_poly/legendre.html +math_toolkit/sf_poly/legendre_stieltjes.html math_toolkit/sf_poly/laguerre.html math_toolkit/sf_poly/hermite.html math_toolkit/sf_poly/sph_harm.html @@ -318,8 +319,13 @@ math_toolkit/roots/root_comparison.html math_toolkit/roots/root_comparison/cbrt_comparison.html math_toolkit/roots/root_comparison/root_n_comparison.html math_toolkit/roots/root_comparison/elliptic_comparison.html -math_toolkit/roots/polynomials.html -math_toolkit/roots/rational.html +math_toolkit/polynomials.html +math_toolkit/rational.html +math_toolkit/interpolate.html +math_toolkit/interpolate/cubic_b.html +math_toolkit/interpolate/barycentric.html +math_toolkit/quadrature.html +math_toolkit/quadrature/trapezoidal.html internals.html math_toolkit/internals_overview.html math_toolkit/internals.html diff --git a/doc/html/status.html b/doc/html/status.html index 4994a9973..4030d124b 100644 --- a/doc/html/status.html +++ b/doc/html/status.html @@ -36,10 +36,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/using_udt.html b/doc/html/using_udt.html index 4570e95d3..a68f5bbbc 100644 --- a/doc/html/using_udt.html +++ b/doc/html/using_udt.html @@ -56,10 +56,11 @@
        -
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html/utils.html b/doc/html/utils.html index 807d3c3ef..75f43d706 100644 --- a/doc/html/utils.html +++ b/doc/html/utils.html @@ -70,10 +70,11 @@
        - -<<<<<<< HEAD - -======= - ->>>>>>> origin/develop +
        Copyright © 2006-2010, 2012-2014 Nikhar Agrawal, - Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert - Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani, - Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang

        +

        Copyright © 2006-2010, 2012-2014, 2017 Nikhar + Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, + Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam + Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker + and Xiaogang Zhang

        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)

        diff --git a/doc/html4_symbols.qbk b/doc/html4_symbols.qbk index 1b329410d..ce69fecc2 100644 --- a/doc/html4_symbols.qbk +++ b/doc/html4_symbols.qbk @@ -212,6 +212,9 @@ [template plusmn[]'''±'''] [/ plus-minus sign = plus-or-minus sign ] [template micro[]'''µ'''] [/ micro sign ] [template cedil[]'''¸'''] [/ cedilla = spacing cedilla ] +[template ccedil[]'''ç'''] [/ small c with cedilla ] +[template Ccedil[]'''ç'''] [/ capial C with cedilla ] + [template ordm[]'''º'''] [/ masculine ordinal indicator ] [template ordf[]'''ª'''] [/ feminine ordinal indicator ] [template laquo[]'''«'''] [/ left-pointing double angle quotation mark = left pointing guillemet ] diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 72cb346b7..c8d7769ea 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -57,7 +57,22 @@ but never more accurate than `1 - sqrt(epsilon)`, for `double`, about 0.99999999 [h4:implemention Implementation] -This real-only implementation is based on an algorithm by__Luu_thesis, +There are many previous implementations with increasing accuracy and speed. + +For most of the range of arguments, some initial approximation is followed by a single refinement, +often using Halley or similar method, gives a useful precision. +For the most precise results possible, for C++ the nearest representation, +iterative refinements using Halley's method are needed, +perhaps using a higher precision type for intermediate computation, +finally casting back to the smaller desired result type. +This scheme is used, for example, using arbitrary precision arithmetic by Maple and Wolfram. + +For argument values near the singularity and near zero, other approximations are often used, +possibly followed by refinement. + + + +One real-only implementation is based on an algorithm by__Luu_thesis, (see routine 11 on page 98 for his Lambert W algorithm). This implementation is based on Thomas Luu's code posted at @@ -82,6 +97,37 @@ whereas Halley usually takes only 1 to 3 iterations to achieve an result within so Newton/Raphson's method unlikely to be quicker than the additional cost of computating the 2nd derivative for Halley's method. +[h4:faster_implementation Implementing Faster Algorithms] + +Many applications of the Lambert W function make repeated evaluations for Monte Carlo methods, +for which applications, speed is important. +Luu and Chapeau-Blondeau and Monir provide typical usage examples. + +A more recent paper by Fukushima makes important observation that much of the execution time of all +previous iterative algorithms was spent evaluating transcendental functions, mainly exp. +He has put a lot of work into avoiding any slow transcendental functions using lookup tables, +bisection followed by a single Schroeder refinement. +Theoretical and practical tests confirm that this gives results with a known error bound. + +For types more precise than double, he shows that it is best to use the double estimate +as a starting point for refinement using Halley or other methods. + +For the less well-behaved regions for arguments near zero and near the singularity at -1/e, +some series functions are provided. + +However, though these give results within several epsilon of the nearest representable result, +they do not get as close as is possible further refinement, usually within one or two epsilon. + +So, as usual, there is a compromise between execution speed and accuracy. + +To allow users more control, this implementation provides the best possible accuracy by default, +(Boost.Math generally prefers accuracy over speed) +but will stop at intermediate stages if the precision specifies in the policy has been met, +perhaps halving the execution time. + + + + The implementation details are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] [h5 Other implmentations] @@ -117,7 +163,7 @@ Initial guesses based on: # D.A. Barry, J.-Y. Parlange, L. Li, H. Prommer, C.J. Cunningham, and F. Stagnitti. Analytical approximations for real values of the Lambert -W-function. Mathematics and Computers in Simulation, 53(1):95-103, 2000. +W-function. Mathematics and Computers in Simulation, 53(1), 95-103 (2000). # D.A. Barry, J.-Y. Parlange, L. Li, H. Prommer, C.J. Cunningham, and F. Stagnitti. Erratum to analytical approximations for real values of the @@ -132,6 +178,12 @@ A PDF of the full [@http://www.paper.edu.cn/scholar/downpaper/liling116674-20121 # Having Fun with Lambert W(x) Function, Darko Veberic University of Nova Gorica, Slovenia IK, Forschungszentrum Karlsruhe, Germany, J. Stefan Institute, Ljubljana, Slovenia. +# Fran[ccedil]ois Chapeau-Blondeau and Abdelilah Monir, Numerical Evaluation of the Lambert W Function and Application to Generation of Generalized +Gaussian Noise With Exponent 1/2, IEEE Transactions on Signal Processing, 50(9) (2002) 2160 - 2165. + +# Toshio Fukushima, Precise and fast computation of Lambert W-functions without transcendental function evaluations, Journal of Computational and Applied +Mathematics, 244 (2013) 77-89. + [endsect] [/section:lambert_w Lambert W function] [/ diff --git a/include/boost/math/cstdfloat/cstdfloat_cmath.hpp b/include/boost/math/cstdfloat/cstdfloat_cmath.hpp index 3043d9056..1b7617391 100644 --- a/include/boost/math/cstdfloat/cstdfloat_cmath.hpp +++ b/include/boost/math/cstdfloat/cstdfloat_cmath.hpp @@ -182,7 +182,7 @@ #define BOOST_CSTDFLOAT_FLOAT128_ATANH atanhq_patch #define BOOST_CSTDFLOAT_FLOAT128_TGAMMA tgammaq_patch #endif // BOOST_CSTDFLOAT_BROKEN_FLOAT128_MATH_FUNCTIONS - #endif + #endif // Implement quadruple-precision functions in the namespace // boost::math::cstdfloat::detail. Subsequently inject these into the @@ -536,7 +536,7 @@ using boost::math::cstdfloat::detail::ldexp; using boost::math::cstdfloat::detail::frexp; using boost::math::cstdfloat::detail::fabs; - using boost::math::cstdfloat::detail::abs; + // using boost::math::cstdfloat::detail::abs; using boost::math::cstdfloat::detail::floor; using boost::math::cstdfloat::detail::ceil; using boost::math::cstdfloat::detail::sqrt; diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 7dfedccee..6fd8bdab8 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -1,555 +1,1367 @@ -// Copyright Thomas Luu, 2014 -// Copyright Paul A. Bristow 2016, 2017 +// Copyright Paul A. Bristow 2016. // 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). -// Computation of the Lambert W function using the algorithm from -// Thomas Luu, UCL Department of Mathematics, PhD Thesis, (2016) -// Fast and Accurate Parallel Computation of Quantile Functions for Random Number Generation, -// page 96 - 98, text and Routine 11. +/* +Implementation of the Fukushima algorithm for the Lambert W real-only function. -// This implementation of the algorithm computes W(x) when x is any C++ real type, -// including Boost.Multiprecision types, and also the prototype Boost.Fixed_point types. +This code is based on the algorithm by +Toshio Fukushima, "Precise and fast computation of Lambert W-functions without +transcendental function evaluations", J. Comp. Appl. Math. 244 (2013) 77-89, +and its author's FORTRAN code, +and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si +based on the algorithm and a FORTRAN version of Toshio Fukushima. -// This version only handles real values of W(x) when x > -1/e (x > -0.367879...), -// and just returns NaN for x < -1/e. +Some macros that will show some (or much) diagnostic values if #defined. -// Initial guesses based on : -// D.A.Barry, J., Y.Parlange, L.Li, H.Prommer, C.J.Cunningham, and F.Stagnitti. -// Analytical approximations for real values of the Lambert W function. -// Mathematics and Computers in Simulation, 53(1) : 95 - 103, 2000. +#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES +BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // lambert_w_singularity_series +BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. -// D.A.Barry, J., Y.Parlange, L.Li, H.Prommer, C.J.Cunningham, and F.Stagnitti. -// Erratum to analytical approximations for real values of the Lambert W function. -// Mathematics and computers in simulation, 59(6) : 543 - 543, 2002. +*/ -// See also https://svn.boost.org/trac/boost/ticket/11027 -// and discussions at http://lists.boost.org/Archives/boost/2016/09/230832.php -// This code gives identical values as https://github.com/thomasluu/plog -// https://github.com/thomasluu/plog/blob/master/plog.cu -// for type double. +//#ifndef BOOST_MATH_SF_LAMBERT_W_HPP +//#define BOOST_MATH_SF_LAMBERT_W_HPP - -#ifndef BOOST_MATH_SF_LAMBERT_W_HPP -#define BOOST_MATH_SF_LAMBERT_W_HPP - -//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // Only #define for Lambert W diagnostic output. +#ifdef _MSC_VER +# pragma warning (disable: 4127) // warning C4127: conditional expression is constant +#endif // _MSC_VER #include -#include +#include +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. +#include +//#include #include #include // for log (1 + x) #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include // for float_distance -#include +#include // Link fails for pow without this, even though uses std::pow. +#include // series functor. +#include // polynomial. +#include // evaluate_polynomial. +// http://www.boost.org/doc/libs/1_64_0/libs/math/doc/html/math_toolkit/roots/rational.html +#include -#include // fixed_point, if required. -#if defined (BOOST_MSVC) -# pragma warning(push) -# pragma warning(disable: 4127) // Conditional expression is constant. -#endif +//// i:\modular-boost\libs\math\test\test_value.hpp +#include +#include +#include +#include -int total_iterations = 0; -int total_calls = 0; -int max_iterations = 0; - -double worst_diff = 0; -// boost::math::tools::max_value(); -double total_diffs = 0.; - -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W -# include // Only needed for testing. -#endif -#include // numeric_limits infinity & NaN, for diagnostic max_digits10 and digits10 ... -#include // exp function. -#include // is_integral trait. - -namespace boost { - namespace fixed_point { - //! \brief Specialization for log1p for fixed_point types (in its own fixed_point namespace). - - /*! - \details This simple (and fast) approximation gives a result - within a few epsilon/ULP of the nearest representable value. - This makes it suitable for use as a first approximation by the Lambert W function below. - It only uses (and thus relies on for accuracy of) the standard log function. - Refinement of the Lambert W estimate using Halley's method - seems to get quickly to high accuracy in a very few iterations, - so that any small inaccuracy in the 1st approximation is fairly unimportant. - It also avoids any Taylor series refinements that involve high powers of x - that could easily go outside the often limited range of fixed-point types. - */ - - template - negatable - log1p(negatable x) - { - // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c - // HP - 15C Advanced Functions Handbook, p.193. - - typedef negatable local_negatable_type; - - local_negatable_type unity(1); - // A fixed_point type might not include unity: hope something sensible happens. - local_negatable_type u = unity + x; - if (u == unity) - { // - return x; - } - else - { - local_negatable_type result = log(u) * (x / (u - unity)); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "log1p fixed-point approx " << result << std::endl; -#endif - return result; - } // if else - } // log1p_fp - - } //namespace fixed_point -} // namespace boost - -namespace local -{ - // Special versions of log1p that may be useful. - - // log1p_dodgy version seems to work OK, but... - /* John Maddock cautions that - "The formula relies on: - - 1) That the operations are not re-ordered. - - 2) That each operation is correctly rounded. - Is true only for floating-point arithmetic unless you compile with - special flags to force full-IEEE compatible mode, - but that slows the whole program down... - - 3) That compiler optimisations don't perform symbolic math on the expressions and simplify them." - */ - - template - T log1p_dodgy(T x) - { - // log(1+x) == (log(1+x) * x) / ((1-x) - 1) - T result = -(log(1 + x) * x) / ((1 - x) - 1); // From note in Boost.Math log1p. - - // \boost\libs\math\include\boost\math\special_functions\log1p.hpp - // Algorithm log1p is part of C99, but is not yet provided by all compilers. - // - // The Boost.Math version uses a Taylor series expansion for 0.5 > x > epsilon, which may - // require up to std::numeric_limits::digits+1 terms to be calculated. - // It would be much more efficient to use the equivalence: - // log(1+x) == (log(1+x) * x) / ((1-x) - 1) - // Unfortunately many optimizing compilers make such a mess of this, that - // it performs no better than log(1+x): which is to say not very well at all. - - return result; - } // template T log1p_dodgy(T x) - - template - inline - T log1p(T x) - { - //! \brief log1p function. - //! This is probably faster than using boost::math::log1p (if a little less accurate) - // but should be good enough for computing Lambert_w initial estimate. - - //! \details Formula for function log1p from a Note in - // https://github.com/f32c/arduino/blob/master/hardware/fpga/f32c/system/src/math/log1p.c - // HP - 15C Advanced Functions Handbook, p.193. - // Assuming log() returns an accurate answer, - // the following algorithm can be used to compute log1p(x) to within a few ULP : - // u = 1 + x; - // if (u == 1) return x - // else return log(u)*(x/(u-1.)); - // This implementation is template of type T - - // log(u) * (x / (u - unity)); - - // http://thepeg.hepforge.org/svn/tags/RELEASE_1_0/ThePEG/Utilities/Math.icc - // double log1m(double x) { return log1p(-x);} - - // It is probably possible to use Newton's or Halley's method to refine this approximation, - // but improvement is probably not useful for estimating the Lambert W value because it is - // close enough for the Halley's method to converge just as fast as with a better initial estimate. - - T unity; - unity = static_cast(1); - T u = unity + x; - if (u == unity) - { - return x; - } - else - { - T result = log(u) * (x / (u - unity)); - //T dodgy = log1p_dodgy(x); - //double dx = static_cast(x); - //double lp1x = log1p(dx); - /* - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "true " << lp1x - << ", log1p_fp " << log1p(x) - //<< ", dodgy " << dodgy << ", HP approximation " << result - //<< ", diff " << dodgy - result << "epsilons = " << (dodgy - result)/std::numeric_limits::epsilon() - << std::endl; - // For example: x = 0.5, dodgy 0.788421631, HP 0.78843689, diff -1.52587891e-05 - #endif - */ - return result; - } - } // template T log1p(T x) -} // namespace local +//for testing +#include +#include +#include // for float_distance namespace boost { - namespace math +namespace math +{ +namespace detail +{ + //! Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944. + // Some integer constants overflow so use largest size available. + // Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]] + // T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3. + // Wolfram command used to obtain 40 series terms at 50 decimal digit precision was + // N[InverseSeries[Series[Sqrt[2(p Exp[1 + p] + 1)], { p,-1,40 }]], 50] + // -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ... + // Made these constants full precision for any T using original fractions from Table 3. + // Decimal values of specifications for built-in floating-point types below + // are at least 21 digits precision == max_digits10 for long double. + // Longer decimal digits strings are rationals evaluated using Wolfram. + + template + T lambert_w_singularity_series(const T p) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES + std::size_t saved_precision = std::cout.precision(3); + std::cout << "Singularity_series Lambert_w p argument = " << p << std::endl; + std::cout + //<< "Argument Type = " << typeid(T).name() + //<< ", max_digits10 = " << std::numeric_limits::max_digits10 + //<< ", epsilon = " << std::numeric_limits::epsilon() + << std::endl; + std::cout.precision(saved_precision); +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES + + static const T q[] = + { + -T(1), // j0 + +T(1), // j1 + -T(1) / 3, // 1/3 j2 + +T(11) / 72, // 0.152777777777777778, // 11/72 j3 + -T(43) / 540, // 0.0796296296296296296, // 43/540 j4 + +T(769) / 17280, // 0.0445023148148148148, j5 + -T(221) / 8505, // 0.0259847148736037625, j6 + //+T(0.0156356325323339212L), // j7 + //+T(0.015635632532333921222810111699000587889476778365667L), // j7 from Wolfram N[680863/43545600, 50] + +T(680863uLL) / 43545600uLL, // +0.0156356325323339212, j7 + //-T(0.00961689202429943171L), // j8 + -T(1963uLL) / 204120uLL, // 0.00961689202429943171, j8 + //-T(0.0096168920242994317068391142465216539290613364687439L), // j8 from Wolfram N[1963/204120, 50] + +T(226287557uLL) / 37623398400uLL, // 0.00601454325295611786, j9 + -T(5776369uLL) / 1515591000uLL, // 0.00381129803489199923, j10 + //+T(0.00244087799114398267L), j11 0.0024408779911439826658968585286437530215699919795550 + +T(169709463197uLL) / 69528040243200uLL, // j11 + // -T(0.00157693034468678425L), // j12 -0.0015769303446867842539234095399314115973161850314723 + -T(1118511313uLL) / 709296588000uLL, // j12 + +T(667874164916771uLL) / 650782456676352000uLL, // j13 + //+T(0.00102626332050760715L), // j13 0.0010262633205076071544375481533906861056468041465973 + -T(500525573uLL) / 744761417400uLL, // j14 + // -T(0.000672061631156136204L), j14 + //+T(1003663334225097487uLL) / 234281684403486720000uLL, // j15 0.00044247306181462090993020760858473726479232802068800 error C2177: constant too big + //+T(0.000442473061814620910L, // j15 + BOOST_MATH_TEST_VALUE(T, +0.000442473061814620910), // j15 + // -T(0.000292677224729627445L), // j16 + BOOST_MATH_TEST_VALUE(T, -0.000292677224729627445), // j16 + //+T(0.000194387276054539318L), // j17 + BOOST_MATH_TEST_VALUE(T, 0.000194387276054539318), // j17 + //-T(0.000129574266852748819L), // j18 + BOOST_MATH_TEST_VALUE(T, -0.000129574266852748819), // j18 + //+T(0.0000866503580520812717L), // j19 N[+1150497127780071399782389/13277465363600276402995200000, 50] 0.000086650358052081271660451590462390293190597827783288 + BOOST_MATH_TEST_VALUE(T, +0.0000866503580520812717), // j19 + //-T(0.0000581136075044138168L) // j20 N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913 + // -T(2853534237182741069uLL) / 49102686267859224000000uLL // j20 // error C2177: constant too big, + // so must use BOOST_MATH_TEST_VALUE(T, ) format in hope of using suffix Q for quad or decimal digits string for others. + //-T(0.000058113607504413816772205464778828177256611844221913L), // j20 N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913 + BOOST_MATH_TEST_VALUE(T, -0.000058113607504413816772205464778828177256611844221913) // j20 - last used by Fukushima + // more terms don't seem to give any improvement (worse in fact) and are not use for many z values. + //BOOST_MATH_TEST_VALUE(T, +0.000039076684867439051635395583044527492132109160553593), // j21 + //BOOST_MATH_TEST_VALUE(T, -0.000026338064747231098738584082718649443078703982217219), // j22 + //BOOST_MATH_TEST_VALUE(T, +0.000017790345805079585400736282075184540383274460464169), // j23 + //BOOST_MATH_TEST_VALUE(T, -0.000012040352739559976942274116578992585158113153190354), // j24 + //BOOST_MATH_TEST_VALUE(T, +8.1635319824966121713827512573558687050675701559448E-6), // j25 + //BOOST_MATH_TEST_VALUE(T, -5.5442032085673591366657251660804575198155559225316E-6) // j26 + // -T(5.5442032085673591366657251660804575198155559225316E-6L) // j26 + // 21 to 26 Added for long double. + }; // static const T q[] + + /* + // Temporary copy of original double values for comparison and these are reproduced well. + static const T q[] = + { + -1L, // j0 + +1L, // j1 + -0.333333333333333333L, // 1/3 j2 + +0.152777777777777778L, // 11/72 j3 + -0.0796296296296296296L, // 43/540 + +0.0445023148148148148L, + -0.0259847148736037625L, + +0.0156356325323339212L, + -0.00961689202429943171L, + +0.00601454325295611786L, + -0.00381129803489199923L, + +0.00244087799114398267L, + -0.00157693034468678425L, + +0.00102626332050760715L, + -0.000672061631156136204L, + +0.000442473061814620910L, + -0.000292677224729627445L, + +0.000194387276054539318L, + -0.000129574266852748819L, + +0.0000866503580520812717L, + -0.0000581136075044138168L // j20 + }; + */ + + // Decide how many series terms to use, increasing as z approaches the singularity, + // balancing run time and computational noise from round-off. + // In practice, we truncate the series expansion at a certain order. + // If the order is too large, not only does the amount of computation increase, + // but also the round-off errors accumulate. + // See Fukushima equation 35, page 85 for logic of choice of number of series terms. + + // TODO remove temporary check on different between double and quad values. worst 1e-17 + //std::cout << "q[21]" << std::endl; + //for (int i = 0; i != 21; i++) + //{ + // std::cout << i << " " << q[i] << " " << q[i] - double_q[i] << std::endl; + //} + + BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. + + const T ap = abs(p); + +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS + { + int terms = 20; // Default to using all terms. + if (ap < 0.001150) + { // Very near singularity. + terms = 6; + } + else if (ap < 0.0766) + { // Near singularity. + terms = 10; + } + std::streamsize saved_precision = std::cout.precision(3); + std::cout << "abs(p) = " << ap << ", terms = " << terms << std::endl; + std::cout.precision(saved_precision); + } +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS + + if (ap < 0.01159) + { // Only 6 near-singularity series terms are useful. + return + -1 + + p*(1 + + p*(q[2] + + p*(q[3] + + p*(q[4] + + p*(q[5] + + p*q[6] + ))))); + } + else if (ap < 0.0766) // Use 10 near-singularity series terms. + { // Use 10 near-singularity series terms. + return + -1 + + p*(1 + + p*(q[2] + + p*(q[3] + + p*(q[4] + + p*(q[5] + + p*(q[6] + + p*(q[7] + + p*(q[8] + + p*(q[9] + + p*q[10] + ))))))))); + } + else + { // Use all 20 near-singularity series terms. + return + -1 + + p*(1 + + p*(q[2] + + p*(q[3] + + p*(q[4] + + p*(q[5] + + p*(q[6] + + p*(q[7] + + p*(q[8] + + p*(q[9] + + p*(q[10] + + p*(q[11] + + p*(q[12] + + p*(q[13] + + p*(q[14] + + p*(q[15] + + p*(q[16] + + p*(q[17] + + p*(q[18] + + p*(q[19] + + p*q[20] // Last Fukushima term. + ))))))))))))))))))); + // + // more terms for more precise T: long double ... + //// but makes almost no difference, so don't use more terms? + // p*q[21] + + // p*q[22] + + // p*q[23] + + // p*q[24] + + // p*q[25] + // ))))))))))))))))))); + } + } // template T lambert_w_singularity_series(const T p) + + ///////////////////////////////////////////////////////////////////////////////////////////// + + //! Series expansion used near zero (abs(z) < 0.05). + // Coefficients of the inverted series expansion of the Lambert W function around z = 0. + // Tosio Fukushima always uses all 17 terms of a Taylor series computed using Wolfram with + // InverseSeries[Series[z Exp[z],{z,0,17}]] + // Tosio Fukushima / Journal of Computational and Applied Mathematics 244 (2013) page 86. + + // InverseSeries[Series[z Exp[z],{z,0,34}]] also computed. + + // Decimal values of specifications for built-in floating-point types below + // are 21 digits precision == max_digits10 for long double. + // TODO Might these overflow some fixed_point? + + // This version is intended to allow use by user-defined types like Boost.Multiprecision quad and cpp_dec_float types. + // The three specializations below for built-in float, double (and perhaps long double) will be chosen in preference for these types. + + // This version uses rationals computed by Wolfram as far as possible, + // limited by maximum size of uLL integers. + // For higher term, uses decimal digit strings computed by Wolfram up to the maximum possible using uLL rationals, + // and then higher coefficients are computed as necessary using function lambert_w0_small_z_series_term + // until the precision required by the policy is achieved. + + // Series evaluation for LambertW(z) as z -> 0. + // See http://functions.wolfram.com/ElementaryFunctions/ProductLog/06/01/01/0003/ + // http://functions.wolfram.com/ElementaryFunctions/ProductLog/06/01/01/0003/MainEq1.L.gif + + //! \brief lambert_w0_small_z uses a tag_type to select a variant depending on the size of the type. + //! The Lambert W is computed by lambert_w0_small_z for small z. + //! The cutoff for z smallness determined by Tosio Fukushima by trial and error is (abs(z) < 0.05), + //! but the optimum might be a function of the size of the type of z. + + //! \details + //! The tag_type selection is based on the value std::numeric_limits::max_digits10. + //! This allows distinguishing between long double types that common vary between 64 and 80-bits, + //! and also compilers that have a float type using 64 bits and/or long double using 128-bits. + //! It assumes that max_digits10 is defined correctly or this might fail to make the correct selection. + //! causing very small differences in computing lambert_w that would be very difficult to detect and diagnose. + //! Cannot switch on std::numeric_limits<>::max() because comparison values may overflow the compiler limit. + //! Cannot switch on std::numeric_limits::max_exponent10() because both 80 and 128 bit float use 11 bits for exponent. + //! So must rely on std::numeric_limits::max_digits10. + + //! Specialization of float zero series expansion used for small z (abs(z) < 0.05). + //! Specializations of lambert_w0_zero_series for built-in types. + //! These specializations should be chosen in preference to T version. + //! For example: lambert_w0_zero_series(0.001F) should use the float version. + // Policy is not used by built-in types when all terms are used during an inline computation, + // but for the ta_type selection to work, they all must include Policy the their signature. + + // Forward declaration of variants of lambert_w0_small_z. + template + T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<0> const&); // for float (32-bit) type. + + template + T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<1> const&); // for double (64-bit) type. + + template + T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<2> const&); // for long double (double extended 80-bit) type. + + template + T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&); // for float128 + + template + T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&); // Generic multiprecision. + + // Set tag_type depending on max_digits10. + template + T lambert_w0_small_z(T x, const Policy& pol) { - namespace detail + typedef boost::mpl::int_ + < + std::numeric_limits::max_digits10 <= 9 ? 0 : // for float + std::numeric_limits::max_digits10 <= 17 ? 1 : // for double 64-bit + std::numeric_limits::max_digits10 <= 22 ? 2 : // for 80-bit double extended + std::numeric_limits::max_digits10 < 37 ? 3 : // for float128 128-bit quad + 4 // Generic multiprecision types. + > tag_type; + // std::cout << "tag type = " << tag_type << std::endl; // error C2275: 'tag_type': illegal use of this type as an expression + return lambert_w0_small_z(x, pol, tag_type()); + } // template T lambert_w0_small_z(T x) + + //! Specialization of float (32-bit) series expansion used for small z (abs(z) < 0.05). + // Only 9 Coefficients are computed to 21 decimal digits precision, ample for 32-bit float used by most platforms. + // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction + // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], + // as proposed by Tosio Fukushima and implemented by Darko Veberic. + + template + T lambert_w0_small_z(T z, const Policy&, boost::mpl::int_<0> const&) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + std::cout << "float lambert_w0_small_z called with z = " << z << " using " << 9 << " terms of precision " + << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + return + z*(1 - // j1 z^1 term = 1 + z*(1 - // j2 z^2 term = -1 + z*(static_cast(3uLL) / 2uLL - // 3/2 // j3 z^3 term = 1.5. + z*(2.6666666666666666667F - // 8/3 // j4 + z*(5.2083333333333333333F - // -125/24 // j5 + z*(10.8F - // j6 + z*(23.343055555555555556F - // j7 + z*(52.012698412698412698F - // j8 + z*118.62522321428571429F)))))))); // j9 + } // template T lambert_w0_small_z(T x, mpl::int_<0> const&) + + //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05). + // 17 Coefficients are computed to 21 decimal digits precision suitable for 64-bit double used by most platforms. + // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction + // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], as proposed by Tosio Fukushima and implemented by Veberic. + + template + T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<1> const&) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + std::cout << "double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision " + << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + T result = + z*(1.L - // j1 z^1 + z*(1.L - // j2 z^2 + z*(1.5L - // 3/2 // j3 z^3 + z*(2.6666666666666666667 - // 8/3 // j4 + z*(5.2083333333333333333 - // -125/24 // j5 + z*(10.8 - // j6 + z*(23.343055555555555556 - // j7 + z*(52.012698412698412698 - // j8 + z*(118.62522321428571429 - // j9 + z*(275.57319223985890653 - // j10 + z*(649.78717234347442681 - // j11 + z*(1551.1605194805194805 - // j12 + z*(3741.4497029592385495 - // j13 + z*(9104.5002411580189358 - // j14 + z*(22324.308512706601434 - // j15 + z*(55103.621972903835338 - // j16 + z*136808.86090394293563)))))))))))))))); // j17 z^17 + return result; + } // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&) + + //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05). + // 21 Coefficients are computed to 21 decimal digits precision suitable for 80-bit long double used by some + // platforms including GCC and Clang when generating for Intel X86 floating-point processors with 80-bit operations enabled (the default). + // (This is NOT used by Microsoft Visual Studio where double and long always both use only 64-bit type.) + template + T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<2> const&) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + std::cout << "long double (80-bit double extended) lambert_w0_small_z called with z = " << z << " using " << 21 << " terms of precision " + << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + T result = + z*(1.L - // j1 z^1 + z*(1.L - // j2 z^2 + z*(1.5L - // 3/2 // j3 + z*(2.6666666666666666667L - // 8/3 // j4 + z*(5.2083333333333333333L - // -125/24 // j5 + z*(10.800000000000000000L - // j6 + z*(23.343055555555555556L - // j7 + z*(52.012698412698412698L - // j8 + z*(118.62522321428571429L - // j9 + z*(275.57319223985890653L - // j10 + z*(649.78717234347442681L - // j11 + z*(1551.1605194805194805L - // j12 + z*(3741.4497029592385495L - // j13 + z*(9104.5002411580189358L - // j14 + z*(22324.308512706601434L - // j15 + z*(55103.621972903835338L - // j16 + z*(136808.86090394293563L - // j17 z^17 last term used by Fukushima double. + z*(341422.050665838363317L - // z^18 + z*(855992.9659966075514633L - // z^19 + z*(2.154990206091088289321e6L - // z^20 + z*5.4455529223144624316423e6L // z^21 + )))))))))))))))))))); + + return result; + } // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&) + + //! Specialization of long double (128-bit quad) series expansion used for small z (abs(z) < 0.05). + // 34 Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction + // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], + // and are suffixed by L as they are assumed of type long double. + // (This is NOT used for 128-bit quad which required a suffix Q + // nor multiprecision type cpp_bin_float_quad that can only be initialised at full precision of the type + // using a decimal digit string like "2.6666666666666666666666666666666666666666666666667".) + + template + T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + std::cout << "long double (128-bit quad) lambert_w0_small_z called with z = " << z << " using " << 34 << " terms of precision " + << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + T result = + z*(1.L - // j1 + z*(1.L - // j2 + z*(1.5L - // 3/2 // j3 + z*(2.6666666666666666666666666666666666L - // 8/3 // j4 + z*(5.2052083333333333333333333333333333L - // -125/24 // j5 + z*(-10.800000000000000000000000000000000L - // j6 + z*(23.343055555555555555555555555555555L - // j7 + z*(52.0126984126984126984126984126984126L - // j8 + z*(118.625223214285714285714285714285714L - // j9 + z*(275.57319223985890652557319223985890L - // * z ^ 10 - // j10 + z*(649.78717234347442680776014109347442680776014109347L - // j11 + z*(1551.1605194805194805194805194805194805194805194805L - // j12 + z*(3741.4497029592385495163272941050718828496606274384L - // j13 + z*(9104.5002411580189357967135744913522691300469078247L - // j14 + z*(22324.308512706601434280005708577137148565719994291L - // j15 + z*(55103.621972903835337697771560205422639285073147507L - // j16 + z*136808.86090394293563342215789305736395683485630576)))))))))))))))); // j17 + return result; + } // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&) + + //! Series functor to compute series term using pow and factorial. + //! \details Functor is called after evaluating polynomial with the coefficients as rationals below. + template + struct lambert_w0_small_z_series_term + { + typedef T result_type; + //! \param _z Lambert W argument z. + //! \param -term -pow<18>(z) / 6402373705728000uLL + //! \param _k number of terms == initially 18 + + // Note *after* evaluating N terms, its internal state has k = N and term = (-1)^N z^N. + + lambert_w0_small_z_series_term(T _z, T _term, int _k) + : k(_k), z(_z), term(_term) { } + + T operator()() + { // Called by sum_series until needs precision set by factor (policy::get_epsilon). + using std::pow; + ++k; + term *= -z / k; + //T t = pow(z, k) * pow(T(k), -1 + k) / factorial(k); // (z^k * k(k-1)^k) / k! + T result = term * pow(T(k), -1 + k); // term * k^(k-1) + // std::cout << " k = " << k << ", term = " << term << ", result = " << result << std::endl; + return result; // + } + private: + int k; + T z; + T term; + }; // template struct lambert_w0_small_z_series_term + + //! Generic variant for User-defined types like Boost.Multiprecision. + template + inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + std::cout << "Generic lambert_w0_small_z called with z = " << z << " using as many terms needed for precision." << std::endl; + std::cout << "Argument z is of type " << typeid(T).name() << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + + // First several terms of the series are tabulated and evaluated as a polynomial: + // this will save us a bunch of expensive calls to pow. + // Then our series functor is initialized "as if" it had already reached term 18, + // enough evaluation of built-in 64-bit double and float (and 80-bit long double?) types. + + // Coefficients should be stored such that the coefficients for the x^i terms are in poly[i]. + static const T coeff[] = { - //! \brief Approximation of real-branched values of the Lambert W function. - //! \details Based on Barry et al, and Thomas Luu, Thesis (2016). - //! Notes refer to Luu equations, page 96-98 and C++ code from algorithm Routine 11. - // Assumes parameter x has been checked before call. - // This function might be useful if the user only requires an approximate result quickly, - // as relative errors of 0.02% or less are claimed by Barry et al. + 0, // z^0 Care: zeroth term needed by tools::evaluate_polynomial, but not in the Wolfram equation, so indexes are one different! + 1, // z^1 term. + -1, // z^2 term + static_cast(3uLL) / 2uLL, // z^3 term. + -static_cast(8uLL) / 3uLL, // z^4 + static_cast(125uLL) / 24uLL, // z^5 + -static_cast(54uLL) / 5uLL, // z^6 + static_cast(16807uLL) / 720uLL, // z^7 + -static_cast(16384uLL) / 315uLL, // z^8 + static_cast(531441uLL) / 4480uLL, // z^9 + -static_cast(156250uLL) / 567uLL, // z^10 + static_cast(2357947691uLL) / 3628800uLL, // z^11 + -static_cast(2985984uLL) / 1925uLL, // z^12 + static_cast(1792160394037uLL) / 479001600uLL, // z^13 + -static_cast(7909306972uLL) / 868725uLL, // z^14 + static_cast(320361328125uLL) / 14350336uLL, // z^15 + -static_cast(35184372088832uLL) / 638512875uLL, // z^16 + static_cast(2862423051509815793uLL) / 20922789888000uLL, // z^17 term + -static_cast(5083731656658uLL) / 14889875uLL, + // z^18 term. = 136808.86090394293563342215789305735851647769682393 - template - inline BOOST_CONSTEXPR_OR_CONST - RealType lambert_w_approx(RealType x) + // z^18 is biggest that can be computed as rational using the largest possible uLL integers, + // so higher terms cannot be potentially compiler-computed as uLL rationals. + // Wolfram (5083731656658 z ^ 18) / 14889875 or + // -341422.05066583836331735491399356945575432970390954 z^18 + + // See note below calling the functor to compute another term, + // sufficient for 80-bit long double precision. + // Wolfram -341422.05066583836331735491399356945575432970390954 z^19 term. + // (5480386857784802185939 z^19)/6402373705728000 + // But now this variant is not used to compute long double + // as specializations are provided above. + }; // static const T coeff[] + + /* + Table of 19 computed coefficients: + + #0 0 + #1 1 + #2 -1 + #3 1.5 + #4 -2.6666666666666666666666666666666665382713370408509 + #5 5.2083333333333333333333333333333330765426740817019 + #6 -10.800000000000000000000000000000000616297582203915 + #7 23.343055555555555555555555555555555076212991619177 + #8 -52.012698412698412698412698412698412659282693193402 + #9 118.62522321428571428571428571428571146835390992496 + #10 -275.57319223985890652557319223985891400375196748314 + #11 649.7871723434744268077601410934743969785223845882 + #12 -1551.1605194805194805194805194805194947599566007429 + #13 3741.4497029592385495163272941050719510009019331763 + #14 -9104.5002411580189357967135744913524243896052869184 + #15 22324.308512706601434280005708577137322392070452582 + #16 -55103.621972903835337697771560205423203318720697224 + #17 136808.86090394293563342215789305735851647769682393 + 136808.86090394293563342215789305735851647769682393 == Exactly same as Wolfram computed value. + #18 -341422.05066583836331735491399356947486381600607416 + 341422.05066583836331735491399356945575432970390954 z^19 Wolfram value differs at 36 decimal digit, as expected. + */ + + using boost::math::policies::get_epsilon; + using boost::math::tools::sum_series; + using boost::math::tools::evaluate_polynomial; + // http://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/roots/rational.html + + // std::streamsize prec = std::cout.precision(std::numeric_limits ::max_digits10); + + T result = evaluate_polynomial(coeff, z); + // template + // V evaluate_polynomial(const T(&poly)[N], const V& val); + // Size of coeff found from N + //std::cout << "evaluate_polynomial(coeff, z); == " << result << std::endl; + //std::cout << "result = " << result << std::endl; + // It's an artefact of the way I wrote the functor: *after* evaluating N + // terms, its internal state has k = N and term = (-1)^N z^N. So after + // evaluating 18 terms, we initialize the functor to the term we've just + // evaluated, and then when it's called, it increments itself to the next term. + // So 18!is 6402373705728000, which is where that comes from. + + // The 19th coefficient of the polynomial is actually, 19 ^ 18 / 19!= + // 104127350297911241532841 / 121645100408832000 which after removing GCDs + // reduces down to Wolfram rational 5480386857784802185939 / 6402373705728000. + // Wolfram z^19 term +(5480386857784802185939 z^19) /6402373705728000 + // +855992.96599660755146336302506332246623424823099755 z^19 + + //! Evaluate Functor. + lambert_w0_small_z_series_term s(z, -pow<18>(z) / 6402373705728000uLL, 18); + + // Temporary to list the coefficients. + //std::cout << " Table of coefficients" << std::endl; + //std::streamsize saved_precision = std::cout.precision(50); + //for (size_t i = 0; i != 19; i++) + //{ + // std::cout << "#" << i << " " << coeff[i] << std::endl; + //} + //std::cout.precision(saved_precision); + + boost::uintmax_t max_iter = policies::get_max_series_iterations(); // Max iterations from policy. + + //std::cout << "max iter from policy = " << max_iter << std::endl; // max iter from policy = 1000000 + // max_iter = 0; + result = sum_series(s, get_epsilon(), max_iter, result); + // result == evaluate_polynomial. + //sum_series(Functor& func, int bits, boost::uintmax_t& max_terms, const U& init_value) + // std::cout << "sum_series(s, get_epsilon(), max_iter, result); = " << result << std::endl; + + //T epsilon = get_epsilon(); + //std::cout << "epilson from policy = " << epsilon << std::endl; + // epilson from policy = 1.93e-34 for T == quad + // 5.35e-51 for t = cpp_bin_float_50 + + // std::cout << " get eps = " << get_epsilon() << std::endl; // quad eps = 1.93e-34, bin_float_50 eps = 5.35e-51 + policies::check_series_iterations("boost::math::lambert_w0_small_z<%1%>(%1%)", max_iter, pol); + //std::cout << "z = " << z << " needed " << max_iter << " iterations." << std::endl; + //std::cout.precision(prec); // Restore. + return result; + } // template inline T lambert_w0_small_z_series(T z, const Policy& pol) + + ///////////////////////////////////////////////////////////////////////////// + + // Halley refinement, if required, for precision in policy. + // Only perform this if the most precise value possible (usually within one epsilon) is desired. + // The previous Fukushima Schroeder refinement usually gives within several epsilon. + // Halley refinement need to perform some evaluations of the exp function, and + // may nearly double the execution time. + // However Boost.Math prioritizes accuracy over speed, so this extra step is done by the default policy. + + // Two version, do_while always makes one interation before testing, + // whereas while_do does a test first, + // perhaps avoiding an iteration if already within tolerance. + + template + inline + T halley_update(T w0, const T z) + { + // Iterate a few times to refine value using Halley's method. + // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate + // since we can simplify the expressions algebraically, + // and don't need most of the error checking of the boilerplate version + // as we know in advance that the function is reasonably well-behaved, + // and in any case the derivatives require evaluation of Lambert W! + + BOOST_MATH_STD_USING // Aid argument dependent (ADL) lookup of abs. + + using boost::math::constants::exp_minus_one; // 0.36787944 + using boost::math::tools::max_value; + + T tolerance = std::numeric_limits::epsilon(); + int iterations = 0; + int iterations_required = 6; + + T w1 = w0; // Refined estimate. + T previous_diff = boost::math::tools::max_value(); + + T expw0 = exp(w0); // Compute z == W * exp(W); from best Lambert W estimate so far. + // Hope that w0 * expw0 == z; + T diff = (w0 * expw0) - z; // Difference from argument z. + // std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl; + +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY +if (diff == 0) // Exact result - common. + { + return w0; + } + // Refine. + do + { + iterations++; +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + std::cout << iterations << " Halley iterations." << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + previous_diff = diff; // Remember so that can check if any new estimate is better. + + // Halley's method from Luu equation 6.39, line 17. + // https://en.wikipedia.org/wiki/Halley%27s_method + // http://www.wolframalpha.com/input/?i=differentiate+productlog(x) + // differentiate productlog(x) d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w) + // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) + // f'(w) = e^w (1 + w) + // f''(w) = e^w (2 + w) , + // f''(w)/f'(w) = (2+w) / (1+w), Luu equation 6.38. + + w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39. + - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); + + diff = (w1 * exp(w1)) - z; + + T dis = boost::math::float_distance(w0, w1); + int d = static_cast(dis); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + std::cout << "float Distance = " << d << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + + if (diff == 0) // Exact. { - BOOST_MATH_STD_USING // for ADL of std functions. - - using boost::math::constants::e; // e(1) = 2.71828... - using boost::math::constants::root_two; // 1.414 ... - using boost::math::constants::one_div_root_two; // 0.707106 - - //using local::log1p; // Simplified approximation for speed. (mean 0.222 us) - using boost::math::log1p; // Other approximate implementations may also be used. - - RealType w0 = 0; // TODO avoid this assignment to avoid GCC unitialized variable 'w0' in constexpr function. - // Upper branch W0 is divided in two regions, W0+ and W0-: -1 <= w0_minus <= 0 and 0 <= w0_plus. - if (x > 0) - { // W0+ branch, Luu Routine 11, line 8, and equation 6.44, from Barry et al. - // (Factors 1.2 and 2.4 are 'exact' from integral fractions 6/5 and 12/5). - // A maximum relative error of 0.196% is claimed by Barry for equation 15, page 7. - // Luu claims a maximum relative error of 2.39% for this slightly simplified version. - w0 = log(static_cast(1.2L) * x / log(static_cast(2.4L) * x / log1p(static_cast(2.4L) * x))); - // local::log1p does seem to refine OK with multiprecision. - } - else - { // Lower branch W0-> -exp(-1) or > -0.367879, so for a Real result need x > -0.367879 >= 0. - // Luu, equation 6.44, page 97 claims a maximum relative error of 0.013%. - // from Barry et al (Erratum Mathematics and Computers in Simulation, 53 (2000) 95–103) - // Section 3.2 Approximation for W0-, equation 9 (but corrected in the erratum). - // Barry et al claim a maximum relative error of 0.013%. - RealType sqrt_v = root_two() * sqrt(static_cast(1) + e() * x); // nu = sqrt(2 + 2e * z) Line 10. - RealType n2 = static_cast(3) * root_two() + static_cast(6); // 3 * sqrt(2) + 6, Line 11. - // == 10.242640687119285146 - RealType n2num = (static_cast(2237) + (static_cast(1457) * root_two())) * e() - - (static_cast(4108) * root_two()) - static_cast(5764); // Numerator Line 11. - RealType n2denom = (static_cast(215) + (static_cast(199) * root_two())) * e() - - (430 * root_two()) - static_cast(796); // Denominator Line 11. - RealType nn2 = n2num / n2denom; // Line 11 full fraction. - nn2 *= sqrt_v; // Line 11 last part. - n2 -= nn2; // Line 11 complete, equation 6.44, - RealType n1 = (static_cast(1) - one_div_root_two()) * (n2 + root_two()); // Line 12. - w0 = -1 + sqrt_v * (n2 + sqrt_v) / (n2 + sqrt_v + n1 * sqrt_v); // W0 1st approximation, Line 13, equation 6.40. - } - return w0; - } // template RealType lambert_w_approx(RealType x) - - //! \brief Lambert W approximation that can be used when x is large. - //! This approximation from Darko Veberic, 2.1 Recursion, page 4, equation 14, (2009), https://arxiv.org/pdf/1003.1628.pdf. - //! x > std::numeric_limits::max(); FLOAT_MAX - //! and so using the lambert_w_approx version for speed is no longer possible. - //! x must be < 1/epsilon - //! For multiprecision types, RealType epsilon is so small (< 1e38) that - //! FLOAT_MAX < 1/epsilon float: 3.4e+38 or 0x1.fffffep+127 - //! This is never true for fundamental types, including binary128 quad precision, - //! epsilon = 2^-112 ~=1.93E-34, 1/epsilon = 5.19e33 - //! which is < 3.4e+38 and so using float is OK. - - template - inline BOOST_CONSTEXPR_OR_CONST - T lambert_w_ln_approx(T z) + return w1; // Exact, or no improvement, so as good as it can be. + } + if (abs(diff) >= abs(previous_diff)) // Latest estimate is not better, or worse, so avoid oscillating result (common when near singularity). { - T l = log(z); - return l - log(l); // 1st two terms of continued logarithm. - } // template T lambert_W_ln_approx(T z) + return w1; // Or mean (w0 + w1)/2 ?? + } + if (fabs((w0 / w1) - static_cast(1)) < tolerance) + { // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few). + return w1; // Or mean (w0 + w1)/2 ?? + } + w0 = w1; + expw0 = exp(w0); + } + while ((iterations < iterations_required) || (iterations <= 10)); // Absolute limit during testing - looping if need this. + return w1; + } // T halley_update(T w0, const T z) - //! \brief Lambert W function implementation. - //! \details Based on Thomas Luu, Thesis (2016). - //! Notes refer to equations, page 96-98 and C++ code from algorithm Routine 11. - template > - RealType lambert_w_imp(RealType x, const Policy& /* pol */) + template + inline + T halley_update_do_while(T w0, const T z) + { + BOOST_MATH_STD_USING // Aid argument dependent lookup of abs. + + using boost::math::constants::exp_minus_one; // 0.36787944 + using boost::math::tools::max_value; + T tolerance = std::numeric_limits::epsilon(); + int iterations = 0; + int min_iterations = 1; // Specify a minimum number of iterations to perform. + int max_iterations = 6; // Should not be needed, but include to avoid risk of looping forever. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + std::cout << "At least = " << min_iterations << " Halley iterations." << std::endl; + std::cout << "(But not more than " << max_iterations << " Halley iterations.)" << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + + T w1; // Refined estimate. + T previous_diff = boost::math::tools::max_value(); + + // TODO perform check first with while( diff small) do {refinement} + do + { // Iterate a few times to refine value using Halley's method. + // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate + // since we can simplify the expressions algebraically, + // and don't need most of the error checking of the boilerplate version + // as we know in advance that the function is reasonably well-behaved, + // and in any case the derivatives require evaluation of Lambert W! + + // z == W * exp(W); + T expw0 = exp(w0); // Compute z from best Lambert W estimate so far. + // Hope that w0 * expw0 == z; + T diff = (w0 * expw0) - z; // Difference from argument z. + +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + + iterations++; + // Halley's method from Luu equation 6.39, line 17. + // https://en.wikipedia.org/wiki/Halley%27s_method + // http://www.wolframalpha.com/input/?i=differentiate+productlog(x) + // differentiate productlog(x) d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w) + // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) + // f'(w) = e^w (1 + w) + // f''(w) = e^w (2 + w) , + // f''(w)/f'(w) = (2+w) / (1+w), Luu equation 6.38. + + w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39. + - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); + if ( // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few). + (fabs((w0 / w1) - static_cast(1)) < tolerance) + || // Or latest estimate is not better, or worse, so avoid oscillating result (common when near singularity). + (abs(diff) >= abs(previous_diff)) + ) { - BOOST_MATH_STD_USING // for ADL of std functions. + return w1; // No improvement, so as good as it can be. + } - //using boost::math::constants::root_two; // 1.414 ... - //using boost::math::constants::e; // e(1) = 2.71828... - //using boost::math::constants::one_div_root_two; // 0.707106 - using boost::math::constants::exp_minus_one; // 0.36787944 - using boost::math::tools::max_value; + w0 = w1; + previous_diff = diff; // Remember so that can check if any new estimate is better. + } + while ( + (iterations < min_iterations) || // do minimum iterations. + (iterations >= max_iterations) // Absolute max limit during testing - looping if need this. + ); - // Catch the very common mistake of providing an integer value as parameter x to lambert_w, for example, lambert_w(1). - // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L), - // or static_casted integer, for example: static_cast(1) or static_cast(1). - // Want to allow fixed_point types too, so do not just test for floating-point. - BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point type (not integer type), for example: W(1.), not W(1)!"); - total_calls++; // Temporary for testing. + return w1; // + } // Halley do while -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << std::showpoint << std::endl; // Show all trailing zeros. - std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits (17 for double). - //std::cout.precision(std::numeric_limits::digits10); // Show all significant digits (15 for double). -#endif - // Check on range of x. - if (x == 0) - { // Special case of zero (for speed and to avoid log(0)and /0 etc). - return static_cast(0); - } - if (!boost::math::isfinite(x)) - { // Check x is finite. - return policies::raise_domain_error( - "boost::math::lambert_w<%1%>", - "The parameter %1% is not finite, so the return value is NaN.", - x, - Policy()); - } // (!boost::math::isfinite(x)) + //! Schroeder method, fifth-order update formula, see T. Fukushima page 80-81, and + // A. Householder, The Numerical Treatment of a Single Nonlinear Equation, + // McGraw-Hill, New York, 1970, section 4.4. + // Switch to schroeder_update after a pre-computed jb/jmax bisections, + // chosen to ensure that the result will be achieve the +/- 10 epsilon target. + //! \param w Lambert w estimate from bisection. + //! \param y bracketing value from bisection. + //! \returns Refined estimate of Lambert w. - // Check x is not so large that it would cause overflow, - // and would throw exception "Error in function boost::math::log1p(double): numeric overflow" - if (x > boost::math::tools::max_value() / 4) // Close to max == 4.4942328371557893e+307 + // Schroeder refinement, called if required by precision policy. + template + inline + T schroeder_update(const T w, const T y) + { + // Compute derivatives using Schroeder refinement, Fukushima equations 18, page 6. + // Since this is the final step, it will always use the highest precision type T. + // Called: result = schroeder_update(w, y); + // w is estimate of Lambert W (from bisection or series). + // y is z * e^-w + +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + using boost::math::float_distance; + T fd = float_distance(w, y); + std::cout << "Distance = " << fd << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER + + const T f0 = w - y; // f0 = w - y. + const T f1 = 1 + y; // f1 = df/dW + const T f00 = f0 * f0; + const T f11 = f1 * f1; + const T f0y = f0 * y; + const T result = + w - 4 * f0 * (6 * f1 * (f11 + f0y) + f00 * y) / + (f11 * (24 * f11 + 36 * f0y) + + f00 * (6 * y * y + 8 * f1 * y + f0y)); // Fukushima Page 81, equation 21 from equation 20. + +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER + std::cout << "Schroeder refining " << w << " " << y << " to " << result << ", difference " << w - result << std::endl; + std::cout.precision(saved_precision); +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER + + return result; + } // template T schroeder_update(const T w, const T y) + + // Temporary to list out the static arrays. + template + inline void print_collection(const T& coll, std::string name, std::string sep) + { + std::cout << name << ": "; + + for (auto it = std::begin(coll); it != std::end(coll); ++it) + { + std::cout << *(it) << sep; + } + + std::cout << std::endl; + } // print_collection + + ///////////// namespace detail implementations of Lambert W for W0 and W-1 branches. + + //! Compute Lambert W for W0 branch. + template + T lambert_w0_imp(const T z, const Policy& pol) + { +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + { + std::size_t saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Lambert_w argument = " << z << std::endl; + std::cout << "Argument Type = " << typeid(T).name() + << ", max_digits10 = " << std::numeric_limits::max_digits10 + << std::setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() << std::endl; + std::cout.precision(saved_precision); + } +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + + // Test for edge and corner cases first, + + BOOST_MATH_STD_USING // Aid argument dependent lookup of abs. + if (abs(z) <= static_cast(0.05)) + { // z is near zero, so use near-zero series expansion. + // Change to use this series approximation made by Fukushima at 0.05, + // found by trial and error, and may not be best for higher precision. + // Chose float, double, or long double, or multiprecision specializations. + // Higher precision types either need more terms, or change in range of abs(z), + // or use as an approximation? + return detail::lambert_w0_small_z(z, pol); + } + else if (z == -boost::math::constants::exp_minus_one()) + { // At singularity, so return exactly minus one. + std::cout << "At singularity. " << std::endl; // within epsilon/0.36 + return static_cast(-1); + } + else if (z < static_cast(-0.35)) + { // Near singularity/branch point at z = -0.36787944... + const T p2 = 2 * (boost::math::constants::e() * z + 1); + if (p2 > 0) + { // Use near-singularity series expansion. + // http://www.boost.org/doc/libs/release/libs/multiprecision/doc/html/boost_multiprecision/intro.html + // Taking care to avoid trouble from expression templates. + T w_series = lambert_w_singularity_series(T(sqrt(p2))); + //Schroeder does not improve result - differences about 5e-15, so do NOT use refinement step below. + //int d2 = policies::digits(); // Precision as digits base 2 from policy. + //if (d2 > (std::numeric_limits::digits - 6)) + //{ // If more (fullest) accuracy required, then use refinement. + // T y = z * exp(-w_series); + // T s_result = schroeder_update(w_series, y); + //} + return w_series; + } + } // z < -0.35 + else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch. + { + // TODO use error policy here. + std::cerr << "(lambert_w0) Argument out of range, z = " << z << std::endl; + return std::numeric_limits::quiet_NaN(); + } // z < -1/e + else // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Schroeder (and Halley). + { + + /////////////////////////////////////////////////////////// + // TODO take this table out as a templated function, + // so that can see effect of choice of T. + // (Would like to avoid initializing table of static data? + // but cannot avoid - always computed at load time). + // See Fukushima section 2.2, page 81. + // Defining Lambert W function values of integral arguments used for bisection. + // e and g have space for 64 bit reals. + static T e[66]; // lambert_w[k] for W-1 branch. 2.718 1 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 + static T g[65]; // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29 + // Defining lookup table sqrts of 1/e. + static T a[12]; // 0.6065 0.7788 ... 0.9997 sqrt of previous elements. + static T b[12]; // 0.5 0.25 0.125 ... 0.0002441, Half of previous element. + + if (!e[0]) + { // Fill static data on first use. (But may never be used?) + // Fukushima calls array f[k] = ke^k (0 <= k <= 64 + // and g[k] -ke^-k (1 <= k <= 64 for g) + + T ej = 1; // F[k] for W-1 branch. + e[0] = boost::math::constants::e(); + e[1] = 1; + + g[0] = 0;// F[k] for W0 branch. + for (int j = 1, jj = 2; jj < 66; ++jj) { - return policies::raise_overflow_error( - "boost::math::lambert_w<%1%>", - "The parameter %1% is too large, so the return value is NaN.", - x, Policy()); - // Exception Error in function boost::math::lambert_w: The parameter 4.6180304784183997e+307 is too large, so the return value is NaN. + ej *= boost::math::constants::e(); + e[jj] = e[j] * boost::math::constants::exp_minus_one(); // exp(-1) - 1/e exp_minus_one 0.36787944. + g[j] = j * ej; + j = jj; } + // a[0] = sqrt(e1); + // TODO compile time constant sqrt(1/e) - add to math constants, and add to documentation too. + a[0] = static_cast(0.606530659712633423603799534991180453441918135487186955682L); + b[0] = static_cast(0.5); + for (int j = 0, jj = 1; jj < 12; ++jj) + { + a[jj] = sqrt(a[j]); // Sqrt of previous element. sqrt(1/e),sqrt(sqrt(1/e)) ... + // b[jj] = b[j] * static_cast(0.5); // Half previous element. + b[jj] = b[j] / 2; // Half previous element (/2 will be optimised better?). - // Special case of singularity at -exp(-1)) // -0.3678794411714423215955237701614608674458111310 - // std::cout << "-exp(-1) = " << -expminusone() << std::endl; - // https://www.wolframalpha.com/input/?i=-exp(-1)&wal=header N[-Exp[-1], 143] - // -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 - // Added to Boost math constants as exp_minus_one - // Can't use if (x < -exp(-1)) because possible 1-bit inaccuracy of exp means is inconsistent. - if (x == -exp_minus_one()) - { // At Singularity -0.36787944117144233 == -0.36787944117144233 returned -1.0000000000000000 -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "At Singularity " << x << " == " << -exp_minus_one() << " returned " << static_cast(-1.) << std::endl; -#endif - return static_cast(-1); - } - else if (x < -exp_minus_one()) // -0.3678794411714423215955237701614608674458111310L - { // If x < -exp(-1)) then lambert_W(x) would be complex (not handled with this implementation). - return policies::raise_domain_error( - "boost::math::lambert_w<%1%>", - "The parameter %1% would give a complex result, so the return value is NaN.", - x, - // "Function boost::math::lambert_w: The parameter -0.36787945032119751 would give a complex result, so the return value is NaN." - Policy()); + j = jj; } + //print_collection(e, "e", " "); + // 2.71828175 1 0.36787945 0.135335296 0.0497870743 0.0183156412 0.00673794793 ... 1.60381359e-28 + //print_collection(g, "g", " "); + //print_collection(a, "a", " "); + //print_collection(b, "b", " "); + // Values saved as Fukushima bisection static arrays.txt + // These might be stored as constants in data? - // Get a suitable starting approximation of lambert_w. - // For speed, use float because the error of the approximation is more than float precision, - // and the iteration will probably get to the result just as quickly. - // For multiprecision types, this can almost half the execution time. - // Some very precise multiprecision types (using more than about 150 bits) - // will not be representable using float types, - // so a continued log approximation will be used instead. + } // if (!e[0]) end of static data fill. + /////////////////////////////////////////////////////////////////////////// - using boost::math::detail::lambert_w_approx; - using boost::math::policies::digits2; + if (std::numeric_limits::digits > 53) + { // T is more precise than 64-bit double (or long double, or ?), + // so compute an approximate value using only Schroeder refinement, + // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50 + // because are next going to use Halley refinement at full/high precision using this as an approximation). + using boost::math::policies::precision; using boost::math::policies::digits10; - using boost::math::policies::digits_base10; - using boost::math::policies::get_epsilon; + using boost::math::policies::digits2; + using boost::math::policies::policy; - RealType epsilon = get_epsilon(); - // default epsilon double 2.2204460492503131e-16 -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - int d10 = policies::digits_base10(); // policy template parameter digits10 in lambert_w(x, policy >() - int d2 = policies::digits(); - std::cout << "digits10 " << d10 <<", digits_2 " << d2 << ", epsilon " << epsilon << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W - - //int d2 = policies::digits(); // - //std::cout << "digits2 " << d2 << std::endl; // default 53 , for policy policy > 13 - //int d10 = policies::digits_base10(); - //std::cout << "digits10 " << d10 << std::endl; // 15 = 53 * 0.301 - //int d = policies::digits < RealType, policies::policy<> >(); - //std::cout << "digits () " << d << std::endl; // default = 53, for policy policy > = 3 - - int iterations_required = 0; - if (policies::digits() != policies::digits >()) - { // User template parameter digits10 has specified digits != default (a reduced precision), - // so just guestimate how many iterations should give us this precision: - int initial_precision_bits = 6; // Should be how many bits correct in the the initial approximation w0. - // If relative precision is about 2%, then about 2 decimal places, so very about 6 bits. - // So should not do any iterations if < policies::digits() - // Can't be more than the binary precision of the RealType, say 53 for double. - - while (initial_precision_bits < policies::digits()) - { - initial_precision_bits *= 3; // Assume each iteration doubles or triples the precision? - // With Halley's method, tripling precision with each iteration might be more realistic? - ++iterations_required; - } // while - // std::cout << "initial precision bits = " << initial_precision_bits << ", iterations required = " << iterations_required << std::endl; - // initial precision bits = 9, iterations required = 0 - } // if - else - { - iterations_required = 4; // Worst cases should not need more than 4 Halley iterations. - } - - RealType w0; - if ( (x > (std::numeric_limits::max)()) - // If x > FLOAT_MAX, then too big to fit into a float, so can't use lambert_w_approx. - || (x > 1 / epsilon) - // Multiprecision type where FLOAT_MAX ~=1e38 is too small to hold 1/epsilon. - ) - { // then can't use lambert_w_approx, so use alternative approximation log(x) - log(log(x). - w0 = lambert_w_ln_approx(x); - } - else - { -#ifndef BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS - // RealType argument type can be converted to float. - w0 = lambert_w_approx(static_cast(x)); -#else - // Not convertible so must use lambert_w_approx(x) - w0 = lambert_w_approx(x); +#if defined(_MSC_VER) +#pragma warning(push) // Save warning settings. +#pragma warning(disable : 4244) // warning C4244: 'initializing': conversion from 'double' to 'result_type', #endif - } // - - if (!boost::math::isfinite(w0)) - { // 1st approximation is not finite (unexpected), so quit. - return policies::raise_domain_error( - "boost::math::lambert_w<%1%>", - "The parameter %1% approximation is NaN.", - x, - Policy()); - return std::numeric_limits::quiet_NaN(); - } - if (iterations_required == 0) - { // Just return approximation without any refinement. - return w0; - } - RealType w1 = 0; // Refined estimate. - // TODO only = 0 to avoid warning C4701: potentially uninitialized local variable 'w1' used. - RealType previous_diff = boost::math::tools::max_value(); // Record the previous diff so can confirm improvement. - int iterations = 0; - RealType tolerance = 1 * std::numeric_limits::epsilon(); // Or computed get_epsilon?? - - while ((iterations < iterations_required) && (iterations <= 10)) // Absolute limit 10 during testing - looping if need this. - { // Iterate a few times to refine value using Halley's method. - // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate - // since we can simplify the expressions algebraically, - // and don't need most of the error checking of the boilerplate version - // as we know in advance that the function is reasonably well-behaved, - // and in any case the derivatives require evaluation of Lambert W! - - RealType expw0 = exp(w0); // Compute from best Lambert W estimate so far. - // Hope that w0 * expw0 == x; - RealType diff = (w0 * expw0) - x; // Difference from x. - iterations++; - if (iterations > max_iterations) - { // Record the maximum iterations used by all calls of Lambert_w - only used during performance testing. - max_iterations = iterations; - } - total_iterations++; // Record the total iterations used by all calls of Lambert_w - only used during performance testing. - // Halley's method from Luu equation 6.39, line 17. - // https://en.wikipedia.org/wiki/Halley%27s_method - // http://www.wolframalpha.com/input/?i=differentiate+productlog(x) - // differentiate productlog(x) d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w) - // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2) - // f'(w) = e^w (1 + w) - // f''(w) = e^w (2 + w) , - // f''(w)/f'(w) = (2+w) / (1+w), Luu equation 6.38. - - w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39. - - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Iteration #" << iterations << ", w0 " << w0 << ", w1 = " << w1; - - if (diff != static_cast(0)) - { - std::cout << ", difference = " << w1 - w0 - << ", relative " << ((w0 / w1) - static_cast(1)) - << ", float distance = " << abs(float_distance((w0 * expw0), x)) << std::endl; - } - else - { - std::cout << ", exact." << std::endl; - } - std::cout << "f'(x) = " << diff / (expw0 * (w0 + 1)) << ", f''(x) = " << -diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))) << std::endl; - #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W - - if ( // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few). - (fabs((w0 / w1) - static_cast(1)) < tolerance) - || // Or latest estimate is not better, or worse, so avoid oscillating result (common when near singularity). - (abs(diff) >= abs(previous_diff)) - ) - { - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "Return refined within tolerance " << w1 << " after " << iterations << " iterations"; - if (diff != static_cast(0)) - { - std::cout << ", difference = " << ((w0 / w1) - static_cast(1)); - std::cout << ", Float distance = " << boost::math::float_distance(w0, w1) << std::endl; - } - else - { - std::cout << ", exact." << std::endl; - } - #endif - - if (diff > worst_diff) - { - worst_diff = static_cast(diff); - } - total_diffs += static_cast(diff); - - return w1; // As good as it can be. - } // if reached tolerance. - - w0 = w1; - previous_diff = diff; // Remember so that can check if any new estimate is better. - } // while - -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W - std::cout << "Not within tolerance " << w1 << " after " << iterations << " iterations" << ", difference = " << previous_diff << std::endl; + // Compute a 50 bit approximate W0. + T result = lambert_w0_imp(static_cast(z), policy >()); +#if defined(_MSC_VER) +#pragma warning(pop) // Restore warnings to previous state. #endif - return w1; - } // lambert_w_imp - } // namespace detail +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + std::cout << "Approximation double = " << result << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + // Perform additional Halley refinement(s) to ensure that + // get a near as possible to correct result (usually +/- one epsilon). + result = halley_update(result, z); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Result T-precision Halley refinement = " << result << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + return result; + } // digits > 53 + else // T is double or less precision. + { + // Use a lookup table to find the nearest integral values as starting point for Bisection. - // User functions. + // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch. + // Since z is probably quite small, start with lowest (n = 0). + int n; // indexing W0 lookup table g of z + for (n = 0; n <= 2; ++n) + { // Try 1st few. + if (g[n] > z) + { // + goto bisect; + } + } + n = 2; + for (int j = 1; j <= 5; ++j) + { + n *= 2; // Try big steps. + if (g[n] > z) + { + goto overshot; // + } + } // for + // else z too large :-( + // TODO use policy here. + std::cerr << "lambert_w0 argument too large, z = " << z << std::endl; + return std::numeric_limits::quiet_NaN(); - // User-defined policy. - template - inline typename tools::promote_args::type - lambert_w(T z, const Policy& pol) + overshot: + { + int nh = n / 2; + for (int j = 1; j <= 5; ++j) + { + nh /= 2; + if (nh <= 0) + { + break; + } + if (g[n - nh] > z) + { + n -= nh; + } + } // for + } + + bisect: + --n; // g[n] is nearest below, so n is integer value of W, and + // g[n+1] is upper integral value. These are used for bisection. + + // typedef typename policies::precision::type prec; + //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. + // Check precision specified by policy. + //int digits2 = policies::digits(); + //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. + + int d10 = policies::digits_base10(); // policy template parameter digits10 + // for example = 1 from lambert_w(x, policy >() + int d2 = policies::digits(); // digits base 2 from policy. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + + std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // digits10 = 1, digits2 = 5 + //<< ", epsilon " << epsilon + << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + + if (d10 <= 2) + { // Only two decimal digits precision required, (biggest lambert_w is unlikely to be < 100) + // so just return the mean of nearby integral values. + // This is a *very* approximate result and perhaps not very useful! +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + + std::cout << "Result Integer W bisection between g[" << n - 1 << "] = " << g[n - 1] << " < " << z << " < " << g[n] << " = g[" << n << "], " + << "\nbisect mean = " << (g[n - 1] + g[n]) / 2 << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + return static_cast((g[n - 1] + g[n]) / 2); + } + // Compute the number of bisections (jmax) that ensure that result is close enough that + // a single 5th order Schroeder update is sufficient to achieve near double (53-bit) accuracy. + int jmax = 8; // Assume minimum number of bisections will be needed (most common case). + if (z <= -0.36) + { // Very near singularity, so need several more bisections. + jmax = 12; + } + else if (z <= -0.3) + { // Near singularity, so need few more bisections. + jmax = 11; + } + else if (n <= 0) + { // Very small z so need 3 more bisections. + jmax = 10; + } + else if (n <= 1) + { // Small z so need just 1 extra bisection. + jmax = 9; + } + // Perform the jmax fractional bisections for necessary precision. + T y = z * e[n + 1]; // + T w = static_cast(n); // Integral Lambert W estimate. + for (int j = 0; j < jmax; ++j) + { + const T wj = w + b[j]; // Add 1/2, 1/4, 1/8 ... + const T yj = y * a[j]; // sqrt(1/e), ... + if (wj < yj) + { + w = wj; + y = yj; + } + } // for jmax + + if (d2 <= 10) + { // Only 10 digits2 required (== digits10 = 3 decimal digits precision), + // so just return the nearest bisection. + // (Might make this test depend on size of T?) +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + std::cout << "Bisection estimate = " << w << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + return w; // Bisection only. + } + else // More than 10 digits2 wanted so continue with Fukushima's Schroeder refinement. + { + T result = schroeder_update(w, y); + if (d2 <= (std::numeric_limits::digits - 3)) + { // Only enough digits2 required, so just return the Schroeder refined value. + // For example, for float, if (d2 <= 22) then + // digits-3 returns Schroeder result if up to 3 bits might be wrong. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + std::cout << "Schroeder refinement estimate = " << result << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + return result; // Schroeder only. + } + else // Perform additional Halley refinement(s) to ensure that + // get a near as possible to correct result (usually +/- epsilon). + { + result = halley_update(result, z); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Halley refinement estimate = " << result << std::endl; + std::cout.precision(saved_precision); +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + return result; // Halley + } // schroeder or Schroeder and Halley. + } // more than 10 digits2 + } + } // normal range and precision. + throw std::logic_error("No result from lambert_w0_imp"); // Should never get here. + } // T lambert_w0_imp(const T z, const Policy& /* pol */) + + //! Lambert W for W-1 branch, -max(z) < z <= -1/e. + // TODO check changes to W0 branch have also been made here. + template + T lambert_wm1_imp(const T z, const Policy& /* pol */) + { + BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. + + // else z is too large for the w-1 branch. + // TODO should this be the singularity value? And others are wrong too. + if (z >= 0) { - return detail::lambert_w_imp(z, pol); + std::cerr << "lambert_wm1 argument out of range, z = " << z << std::endl; + return std::numeric_limits::quiet_NaN(); + } + if (z < -0.35) + { // Close to singularity/branch point. + const T p2 = 2 * (boost::math::constants::e() * z + 1); + if (p2 > 0) + { + return lambert_w_singularity_series(-sqrt(p2)); + // TODO Halley options here. + } + if (p2 == 0) + { + return -1; + } + std::cerr << "(lambert_wm1) Argument out of range, z = " << z << std::endl; + return std::numeric_limits::quiet_NaN(); } - // Default policy. - template - inline typename - tools::promote_args::type lambert_w(T z) + // Create static arrays of Lambert W function for Wm1 + // with lambert_w values of integers. + // Used for bisection of W-1 branch. + + static T e[64]; + static T g[64]; + static T a[12]; + static T b[12]; + + if (!e[0]) { - return lambert_w(z, policies::policy<>()); + const T e1 = 1 / boost::math::constants::e(); + T ej = e1; + e[0] = boost::math::constants::e(); + g[0] = -e1; + for (int j = 0, jj = 1; jj < 64; ++jj) + { + ej *= e1; + e[jj] = e[j] * boost::math::constants::e(); + g[jj] = -(jj + 1) * ej; + j = jj; + } + a[0] = sqrt(boost::math::constants::e()); + b[0] = static_cast(0.5); + for (int j = 0, jj = 1; jj < 12; ++jj) + { + a[jj] = sqrt(a[j]); + b[jj] = b[j] * static_cast(0.5); + j = jj; + } + } // static arrays filled. + + // Bracketing sequence n = (2, 4, 8, 16, 32, 64) for W-1 branch. + // Since z is probably quite small, start with lowest n (=2). + int n = 2; + if (g[n - 1] > z) + { + goto bisect; } + for (int j = 1; j <= 5; ++j) + { + n *= 2; + if (g[n - 1] > z) + { + goto overshot; + } + } + //else + // TODO use policy here. + std::cerr << "(lambert_wm1) Argument too small, z = " << z << std::endl; + return std::numeric_limits::quiet_NaN(); + + overshot: + { + int nh = n / 2; + for (int j = 1; j <= 5; ++j) + { + nh /= 2; + if (nh <= 0) + break; + if (g[n - nh - 1] > z) + n -= nh; + } + } + bisect: + --n; // g[n] now holds lambert W of floor integer n. + + // Check precision specified by policy. + int d2 = policies::digits(); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W1 + std::cout << "digits2 = " << d2 << std::endl; // digits = 24 for float. +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1 + if (d2 < 5) + { // Only a very few digits2 required, so just return the floor integral value. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W1 + std::cout << "between g[" << n << "] = " << g[n] << " < " << z << " < " << g[n + 1] << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1 + return static_cast(n); + } + + // jmax is the number of bisections such that a single application of the fifth-order update formula + // after the bisections is enough to evaluate W-1 with 53-bit accuracy. + int jmax = 11; // + if (n >= 8) + { + jmax = 8; + } + else if (n >= 3) + { + jmax = 9; + } + else if (n >= 2) + { + jmax = 10; + } + T w = - static_cast(n); + T y = z * e[n - 1]; + for (int j = 0; j < jmax; ++j) + { + const T wj = w - b[j]; + const T yj = y * a[j]; + if (wj < yj) + { + w = wj; + y = yj; + } + } + T result = schroeder_update(w, y); // Schroeder 5th order method refinement. + result = halley_update(result, z); + return result; + } // template T lambert_wm1_imp(const T z) + +} // namespace detail + + //User Lambert W functions. + // W0 branch, -1/e < z < max(z) + +using boost::math::tools::promote_arg; + + //! Lambert W0 using User-defined policy. + template + inline + typename tools::promote_args::type + lambert_w0(T z, const Policy& pol) + { + // Promote integer or expression template arguments to double, + // without doing any other internal promotion like float to double. + typedef typename tools::promote_args::type result_type; + return detail::lambert_w0_imp(result_type(z), pol); // + } + + //! Lambert W0 using default policy. + template + inline + typename tools::promote_args::type + lambert_w0(T z) + { + return detail::lambert_w0_imp(z, policies::policy<>()); + } + + ////! W-1 branch (-max(z) < z <= -1/e). + + ////! Lambert W1 using User-defined policy. + //template + //inline typename tools::promote_args::type + //lambert_wm1(T z, const Policy& pol) + //{ + // // Promote integer or expression template arguments to double, + // // without doing any other internal promotion like float to double. + // typedef typename tools::promote_args::type result_type; + // return detail::lambert_wm1_imp(result_type(z), pol); // + //} + + //// Lambert W1 using default policy. + //template + //inline typename + //tools::promote_args::type lambert_wm1(T z) + //{ + // return lambert_wm1(z, policies::policy<>()); + //} } // namespace math } // namespace boost -#endif // BOOST_MATH_SF_LAMBERT_W_HPP +//#endif // #ifndef BOOST_MATH_SF_LAMBERT_W_HPP diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index d13774604..899589956 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -20,7 +20,7 @@ #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; -#include +#include #ifdef BOOST_HAS_FLOAT128 #include // Not available for MSVC. @@ -28,7 +28,7 @@ using boost::multiprecision::cpp_dec_float_50; #include -//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for Lambert_w diagnostic output. + fine BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for Lambert_w diagnostic output. #include // For Lambert W lambert_w function. using boost::math::lambert_w; #include // isnan, ifinite. @@ -159,7 +159,7 @@ void test_spots(RealType) RealType singular_value = -exp_minus_one(); // -exp(-1) = -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 // lambert_w[-0.367879441171442321595523770161460867445811131031767834] == -1 - // -0.36787945032119751 + // -0.36787945032119751 RealType minus_one_value = BOOST_MATH_TEST_VALUE(RealType, -1.); //std::cout << "singular_value " << singular_value << ", expected Lambert W = " << minus_one_value << std::endl; @@ -248,7 +248,7 @@ void test_spots(RealType) // 'boost::multiprecision::detail::expression,boost::multiprecision::et_on>,void,void,void>' // : no appropriate default constructor available // TODO ??????????? -/* +/* if (std::numeric_limits::is_specialized) { // Check +/- values near to zero. BOOST_CHECK_CLOSE_FRACTION(lambert_w(std::numeric_limits::epsilon()), @@ -259,7 +259,7 @@ void test_spots(RealType) BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); } // is_specialized - + // Check infinite if possible. if (std::numeric_limits::has_infinity) { @@ -315,7 +315,7 @@ BOOST_AUTO_TEST_CASE(test_types) // test_spots(0.0L); // long double //} // Built-in/fundamental Quad 128-bit type, if available. - #ifdef BOOST_HAS_FLOAT128 +#ifdef BOOST_HAS_FLOAT128 test_spots(static_cast(0)); #endif @@ -326,7 +326,7 @@ BOOST_AUTO_TEST_CASE(test_types) // Fixed-point types: - // Some fail 0.1 to 1.0 ??? + // Some fail 0.1 to 1.0 ??? //test_spots(static_cast >(0)); // fixed_point::negatable<15,-16> has range 1.52587891e-05 to 32768, epsilon 3.05175781e-05 @@ -350,7 +350,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // So this section just tests a single type, say IEEE 64-bit double, for a range of spot values. typedef double RealType; - + int epsilons = 2; RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; @@ -358,7 +358,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)), BOOST_MATH_TEST_VALUE(RealType, 9.9999900000149999733333854165586669000967020964243e-7), // Output from https://www.wolframalpha.com/input/ N[lambert_w[1e-6],50]) - tolerance); + tolerance); BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.0001)), BOOST_MATH_TEST_VALUE(RealType, 0.000099990001499733385405869000452213835767629477903460), // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50]) @@ -436,14 +436,14 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), // Output from https://www.wolframalpha.com/input/?i=lambert_w(1e6) tolerance); // - + // Tests for double only near the max and the singularity where Lambert_w estimates are less precise. - // + // if (std::numeric_limits::is_specialized) { // Check near std::numeric_limits<>::max() for type. - //std::cout << std::setprecision(std::numeric_limits::max_digits10) + //std::cout << std::setprecision(std::numeric_limits::max_digits10) // << (std::numeric_limits::max)() // == 1.7976931348623157e+308 // << " " << (std::numeric_limits::max)() / 4 // == 4.4942328371557893e+307 // << std::endl; From 0f070dd259ebd912163cbee850df55afca6f43b7 Mon Sep 17 00:00:00 2001 From: pabristow Date: Tue, 29 Aug 2017 08:21:59 +0100 Subject: [PATCH 12/71] Commit work-in-progress before fixing students t on develop --- .../math/special_functions/lambert_w.hpp | 163 +++++++++++------- 1 file changed, 99 insertions(+), 64 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 6fd8bdab8..2661d0929 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -1,4 +1,4 @@ -// Copyright Paul A. Bristow 2016. +// Copyright Paul A. Bristow 2016, 2017. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or @@ -23,6 +23,7 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. +BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. */ @@ -48,8 +49,11 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singulari #include // evaluate_polynomial. // http://www.boost.org/doc/libs/1_64_0/libs/math/doc/html/math_toolkit/roots/rational.html #include +#include + +//#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include "J:\Cpp\Misc\lambert_w_pb_spot_tests\test_value.hpp" // Temporary kludge. -//// i:\modular-boost\libs\math\test\test_value.hpp #include #include @@ -387,13 +391,13 @@ namespace detail T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<1> const&) { #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES - std::cout << "double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision " + std::cout << "double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision, " << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES T result = - z*(1.L - // j1 z^1 - z*(1.L - // j2 z^2 - z*(1.5L - // 3/2 // j3 z^3 + z*(1. - // j1 z^1 + z*(1. - // j2 z^2 + z*(1.5 - // 3/2 // j3 z^3 z*(2.6666666666666666667 - // 8/3 // j4 z*(5.2083333333333333333 - // -125/24 // j5 z*(10.8 - // j6 @@ -443,7 +447,7 @@ namespace detail z*(341422.050665838363317L - // z^18 z*(855992.9659966075514633L - // z^19 z*(2.154990206091088289321e6L - // z^20 - z*5.4455529223144624316423e6L // z^21 + z*5.4455529223144624316423e6L // z^21 )))))))))))))))))))); return result; @@ -664,9 +668,9 @@ namespace detail // whereas while_do does a test first, // perhaps avoiding an iteration if already within tolerance. - template + template inline - T halley_update(T w0, const T z) + T halley_update(T w0, const T z, const Policy&) { // Iterate a few times to refine value using Halley's method. // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate @@ -680,9 +684,13 @@ namespace detail using boost::math::constants::exp_minus_one; // 0.36787944 using boost::math::tools::max_value; - T tolerance = std::numeric_limits::epsilon(); + // T tolerance = std::numeric_limits::epsilon(); + T tolerance = boost::math::policies::get_epsilon(); + +// TODO should get_precision here. int iterations = 0; int iterations_required = 6; + int max_iterations = 10; T w1 = w0; // Refined estimate. T previous_diff = boost::math::tools::max_value(); @@ -693,7 +701,13 @@ namespace detail // std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl; #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY + std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10); // Save. + std::cout.precision(std::numeric_limits::max_digits10); // Show all posssibly significant digits. + std::ios::fmtflags flags(std::cout.flags()); // Save. + std::cout.setf(std::ios_base::showpoint); // Include any trailing zeros. std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl; + std::cout.precision(precision); // Restore. + std::cout.flags(flags); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY if (diff == 0) // Exact result - common. { @@ -722,10 +736,10 @@ if (diff == 0) // Exact result - common. diff = (w1 * exp(w1)) - z; +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY T dis = boost::math::float_distance(w0, w1); int d = static_cast(dis); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY - std::cout << "float Distance = " << d << std::endl; + std::cout << "float_distance = " << d << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY if (diff == 0) // Exact. @@ -743,7 +757,7 @@ if (diff == 0) // Exact result - common. w0 = w1; expw0 = exp(w0); } - while ((iterations < iterations_required) || (iterations <= 10)); // Absolute limit during testing - looping if need this. + while ((iterations < iterations_required) || (iterations <= max_iterations)); // Absolute limit during testing - looping if need this. return w1; } // T halley_update(T w0, const T z) @@ -842,7 +856,7 @@ if (diff == 0) // Exact result - common. std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); using boost::math::float_distance; T fd = float_distance(w, y); - std::cout << "Distance = " << fd << std::endl; + std::cout << "Pre-Schroder Distance = " << static_cast(fd) << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER const T f0 = w - y; // f0 = w - y. @@ -856,8 +870,8 @@ if (diff == 0) // Exact result - common. f00 * (6 * y * y + 8 * f1 * y + f0y)); // Fukushima Page 81, equation 21 from equation 20. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER - std::cout << "Schroeder refining " << w << " " << y << " to " << result << ", difference " << w - result << std::endl; - std::cout.precision(saved_precision); + std::cout << "Schroeder refined " << w << " " << y << " to " << result << ", difference " << w - result << std::endl; + std::cout.precision(saved_precision); // Restore. #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER return result; @@ -883,6 +897,16 @@ if (diff == 0) // Exact result - common. template T lambert_w0_imp(const T z, const Policy& pol) { + // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1). + // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L), + // or static_casted integer, for example: static_cast(1) or static_cast(1). + // Want to allow fixed_point types too, so do not just test for floating-point. + // Integral types should be promoted to double by user Lambert w functions. + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: W(1.), not W(1)!"); + + // If integral type provided to user functionlambert_w0 or _wm1, + // then should already have been promoted to double. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 { std::size_t saved_precision = std::cout.precision(std::numeric_limits::max_digits10); @@ -911,6 +935,14 @@ if (diff == 0) // Exact result - common. std::cout << "At singularity. " << std::endl; // within epsilon/0.36 return static_cast(-1); } + else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch (should using W1 branch. + { + const char* function = "boost::math::lambert_w0()"; + return policies::raise_domain_error(function, + "Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).", + z, pol); + // TODO doesn't show value of z?? have error handling.hpp + } else if (z < static_cast(-0.35)) { // Near singularity/branch point at z = -0.36787944... const T p2 = 2 * (boost::math::constants::e() * z + 1); @@ -926,15 +958,13 @@ if (diff == 0) // Exact result - common. // T y = z * exp(-w_series); // T s_result = schroeder_update(w_series, y); //} + // neither does Halley + //T y = z * exp(-w_series); + //return halley_update(w_series, y); return w_series; } } // z < -0.35 - else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch. - { - // TODO use error policy here. - std::cerr << "(lambert_w0) Argument out of range, z = " << z << std::endl; - return std::numeric_limits::quiet_NaN(); - } // z < -1/e + // z < -1/e else // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Schroeder (and Halley). { @@ -1001,25 +1031,17 @@ if (diff == 0) // Exact result - common. using boost::math::policies::digits10; using boost::math::policies::digits2; using boost::math::policies::policy; - -#if defined(_MSC_VER) -#pragma warning(push) // Save warning settings. -#pragma warning(disable : 4244) // warning C4244: 'initializing': conversion from 'double' to 'result_type', -#endif - // Compute a 50 bit approximate W0. - T result = lambert_w0_imp(static_cast(z), policy >()); -#if defined(_MSC_VER) -#pragma warning(pop) // Restore warnings to previous state. -#endif -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 - std::cout << "Approximation double = " << result << std::endl; + // Compute a 50-bit precision approximate W0 in a double (no Halley refinement). + T double_approx = static_cast(lambert_w0_imp(static_cast(z), policy >())); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN + std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << result << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 // Perform additional Halley refinement(s) to ensure that // get a near as possible to correct result (usually +/- one epsilon). - result = halley_update(result, z); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + T result = halley_update(double_approx, z, pol); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Result T-precision Halley refinement = " << result << std::endl; + std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 return result; } // digits > 53 @@ -1156,7 +1178,7 @@ if (diff == 0) // Exact result - common. else // Perform additional Halley refinement(s) to ensure that // get a near as possible to correct result (usually +/- epsilon). { - result = halley_update(result, z); + result = halley_update(result, z, pol); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Halley refinement estimate = " << result << std::endl; @@ -1175,6 +1197,16 @@ if (diff == 0) // Exact result - common. template T lambert_wm1_imp(const T z, const Policy& /* pol */) { + // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1). + // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L), + // or static_casted integer, for example: static_cast(1) or static_cast(1). + // Want to allow fixed_point types too, so do not just test for floating-point. + // Integral types should be promoted to double by user Lambert w functions. + // If integral type provided to user function lambert_w0 or _wm1, + // then should already have been promoted to double. + + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: W(1.), not W(1)!"); + BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. // else z is too large for the w-1 branch. @@ -1312,12 +1344,11 @@ if (diff == 0) // Exact result - common. return result; } // template T lambert_wm1_imp(const T z) -} // namespace detail +} // namespace detail //////////////////////////////////////////////////////////// - //User Lambert W functions. - // W0 branch, -1/e < z < max(z) + // User Lambert W functions. -using boost::math::tools::promote_arg; + //! W0 branch, -1/e < z < max(z) //! Lambert W0 using User-defined policy. template @@ -1329,7 +1360,7 @@ using boost::math::tools::promote_arg; // without doing any other internal promotion like float to double. typedef typename tools::promote_args::type result_type; return detail::lambert_w0_imp(result_type(z), pol); // - } + } // lambert_w0(T z, const Policy& pol) //! Lambert W0 using default policy. template @@ -1337,29 +1368,33 @@ using boost::math::tools::promote_arg; typename tools::promote_args::type lambert_w0(T z) { - return detail::lambert_w0_imp(z, policies::policy<>()); + typedef typename tools::promote_args::type result_type; + return detail::lambert_w0_imp(result_type(z), policies::policy<>()); + } // lambert_w0(T z) + + + //! W-1 branch (-max(z) < z <= -1/e). + + //! Lambert W1 using User-defined policy. + template + inline typename tools::promote_args::type + lambert_wm1(T z, const Policy& pol) + { + // Promote integer or expression template arguments to double, + // without doing any other internal promotion like float to double. + typedef typename tools::promote_args::type result_type; + return detail::lambert_wm1_imp(result_type(z), pol); // } - ////! W-1 branch (-max(z) < z <= -1/e). - - ////! Lambert W1 using User-defined policy. - //template - //inline typename tools::promote_args::type - //lambert_wm1(T z, const Policy& pol) - //{ - // // Promote integer or expression template arguments to double, - // // without doing any other internal promotion like float to double. - // typedef typename tools::promote_args::type result_type; - // return detail::lambert_wm1_imp(result_type(z), pol); // - //} - - //// Lambert W1 using default policy. - //template - //inline typename - //tools::promote_args::type lambert_wm1(T z) - //{ - // return lambert_wm1(z, policies::policy<>()); - //} + // Lambert W1 using default policy. + template + inline + typename tools::promote_args::type + lambert_wm1(T z) + { + typedef typename tools::promote_args::type result_type; + return detail::lambert_wm1(result_type(z), policies::policy<>()); + } // lambert_wm1(T z) } // namespace math } // namespace boost From 48435ed99659223b6bd55c9c0e16603f5ad204e4 Mon Sep 17 00:00:00 2001 From: pabristow Date: Wed, 30 Aug 2017 17:05:34 +0100 Subject: [PATCH 13/71] Commit before merge develop to get new config file --- .../math/special_functions/lambert_w.hpp | 48 +++++++++---------- 1 file changed, 24 insertions(+), 24 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 2661d0929..a73c9fd25 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -54,7 +54,6 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision t //#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. #include "J:\Cpp\Misc\lambert_w_pb_spot_tests\test_value.hpp" // Temporary kludge. - #include #include #include @@ -77,7 +76,7 @@ namespace detail // T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3. // Wolfram command used to obtain 40 series terms at 50 decimal digit precision was // N[InverseSeries[Series[Sqrt[2(p Exp[1 + p] + 1)], { p,-1,40 }]], 50] - // -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ... + // -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ... // Made these constants full precision for any T using original fractions from Table 3. // Decimal values of specifications for built-in floating-point types below // are at least 21 digits precision == max_digits10 for long double. @@ -89,7 +88,7 @@ namespace detail #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES std::size_t saved_precision = std::cout.precision(3); std::cout << "Singularity_series Lambert_w p argument = " << p << std::endl; - std::cout + std::cout //<< "Argument Type = " << typeid(T).name() //<< ", max_digits10 = " << std::numeric_limits::max_digits10 //<< ", epsilon = " << std::numeric_limits::epsilon() @@ -148,7 +147,7 @@ namespace detail // -T(5.5442032085673591366657251660804575198155559225316E-6L) // j26 // 21 to 26 Added for long double. }; // static const T q[] - + /* // Temporary copy of original double values for comparison and these are reproduced well. static const T q[] = @@ -205,14 +204,14 @@ namespace detail else if (ap < 0.0766) { // Near singularity. terms = 10; - } + } std::streamsize saved_precision = std::cout.precision(3); std::cout << "abs(p) = " << ap << ", terms = " << terms << std::endl; std::cout.precision(saved_precision); } #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS - if (ap < 0.01159) + if (ap < 0.01159) { // Only 6 near-singularity series terms are useful. return -1 + @@ -240,7 +239,7 @@ namespace detail p*q[10] ))))))))); } - else + else { // Use all 20 near-singularity series terms. return -1 + @@ -360,7 +359,7 @@ namespace detail //! Specialization of float (32-bit) series expansion used for small z (abs(z) < 0.05). // Only 9 Coefficients are computed to 21 decimal digits precision, ample for 32-bit float used by most platforms. // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction - // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], + // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], // as proposed by Tosio Fukushima and implemented by Darko Veberic. template @@ -380,7 +379,7 @@ namespace detail z*(23.343055555555555556F - // j7 z*(52.012698412698412698F - // j8 z*118.62522321428571429F)))))))); // j9 - } // template T lambert_w0_small_z(T x, mpl::int_<0> const&) + } // template T lambert_w0_small_z(T x, mpl::int_<0> const&) //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05). // 17 Coefficients are computed to 21 decimal digits precision suitable for 64-bit double used by most platforms. @@ -512,7 +511,7 @@ namespace detail //T t = pow(z, k) * pow(T(k), -1 + k) / factorial(k); // (z^k * k(k-1)^k) / k! T result = term * pow(T(k), -1 + k); // term * k^(k-1) // std::cout << " k = " << k << ", term = " << term << ", result = " << result << std::endl; - return result; // + return result; // } private: int k; @@ -554,7 +553,7 @@ namespace detail -static_cast(7909306972uLL) / 868725uLL, // z^14 static_cast(320361328125uLL) / 14350336uLL, // z^15 -static_cast(35184372088832uLL) / 638512875uLL, // z^16 - static_cast(2862423051509815793uLL) / 20922789888000uLL, // z^17 term + static_cast(2862423051509815793uLL) / 20922789888000uLL, // z^17 term -static_cast(5083731656658uLL) / 14889875uLL, // z^18 term. = 136808.86090394293563342215789305735851647769682393 @@ -566,7 +565,7 @@ namespace detail // See note below calling the functor to compute another term, // sufficient for 80-bit long double precision. // Wolfram -341422.05066583836331735491399356945575432970390954 z^19 term. - // (5480386857784802185939 z^19)/6402373705728000 + // (5480386857784802185939 z^19)/6402373705728000 // But now this variant is not used to compute long double // as specializations are provided above. }; // static const T coeff[] @@ -610,14 +609,14 @@ namespace detail // Size of coeff found from N //std::cout << "evaluate_polynomial(coeff, z); == " << result << std::endl; //std::cout << "result = " << result << std::endl; - // It's an artefact of the way I wrote the functor: *after* evaluating N - // terms, its internal state has k = N and term = (-1)^N z^N. So after - // evaluating 18 terms, we initialize the functor to the term we've just + // It's an artefact of the way I wrote the functor: *after* evaluating N + // terms, its internal state has k = N and term = (-1)^N z^N. So after + // evaluating 18 terms, we initialize the functor to the term we've just // evaluated, and then when it's called, it increments itself to the next term. // So 18!is 6402373705728000, which is where that comes from. // The 19th coefficient of the polynomial is actually, 19 ^ 18 / 19!= - // 104127350297911241532841 / 121645100408832000 which after removing GCDs + // 104127350297911241532841 / 121645100408832000 which after removing GCDs // reduces down to Wolfram rational 5480386857784802185939 / 6402373705728000. // Wolfram z^19 term +(5480386857784802185939 z^19) /6402373705728000 // +855992.96599660755146336302506332246623424823099755 z^19 @@ -640,11 +639,11 @@ namespace detail // max_iter = 0; result = sum_series(s, get_epsilon(), max_iter, result); // result == evaluate_polynomial. - //sum_series(Functor& func, int bits, boost::uintmax_t& max_terms, const U& init_value) + //sum_series(Functor& func, int bits, boost::uintmax_t& max_terms, const U& init_value) // std::cout << "sum_series(s, get_epsilon(), max_iter, result); = " << result << std::endl; //T epsilon = get_epsilon(); - //std::cout << "epilson from policy = " << epsilon << std::endl; + //std::cout << "epilson from policy = " << epsilon << std::endl; // epilson from policy = 1.93e-34 for T == quad // 5.35e-51 for t = cpp_bin_float_50 @@ -938,8 +937,8 @@ if (diff == 0) // Exact result - common. else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch (should using W1 branch. { const char* function = "boost::math::lambert_w0()"; - return policies::raise_domain_error(function, - "Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).", + return policies::raise_domain_error(function, + "Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).", z, pol); // TODO doesn't show value of z?? have error handling.hpp } @@ -1026,7 +1025,7 @@ if (diff == 0) // Exact result - common. { // T is more precise than 64-bit double (or long double, or ?), // so compute an approximate value using only Schroeder refinement, // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50 - // because are next going to use Halley refinement at full/high precision using this as an approximation). + // because are next going to use Halley refinement at full/high precision using this as an approximation). using boost::math::policies::precision; using boost::math::policies::digits10; using boost::math::policies::digits2; @@ -1047,7 +1046,7 @@ if (diff == 0) // Exact result - common. } // digits > 53 else // T is double or less precision. { - // Use a lookup table to find the nearest integral values as starting point for Bisection. + // Use a lookup table to find the nearest integral values as starting point for Bisection. // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch. // Since z is probably quite small, start with lowest (n = 0). @@ -1377,7 +1376,8 @@ if (diff == 0) // Exact result - common. //! Lambert W1 using User-defined policy. template - inline typename tools::promote_args::type + inline + typename tools::promote_args::type lambert_wm1(T z, const Policy& pol) { // Promote integer or expression template arguments to double, @@ -1393,7 +1393,7 @@ if (diff == 0) // Exact result - common. lambert_wm1(T z) { typedef typename tools::promote_args::type result_type; - return detail::lambert_wm1(result_type(z), policies::policy<>()); + return detail::lambert_wm1_imp(result_type(z), policies::policy<>()); } // lambert_wm1(T z) } // namespace math From 15568b8d62f8b36d93bea21dffecd5ace1406fe5 Mon Sep 17 00:00:00 2001 From: pabristow Date: Sat, 2 Sep 2017 12:12:10 +0100 Subject: [PATCH 14/71] Work on precision demo before holiday. OK on VS14.1 and GCC 7.1.0 but docs need much more work. --- doc/html/index.html | 6 +- doc/html/indexes/s01.html | 44 ++-- doc/html/indexes/s02.html | 6 +- doc/html/indexes/s03.html | 6 +- doc/html/indexes/s04.html | 6 +- doc/html/indexes/s05.html | 61 ++++-- doc/html/internals.html | 14 -- doc/html/math_toolkit/conventions.html | 6 +- doc/html/math_toolkit/navigation.html | 6 +- doc/html/math_toolkit/roots.html | 4 - doc/html/rooting.html | 15 -- doc/html/standalone_HTML.manifest | 3 - doc/sf/lambert_w.qbk | 203 +++++++++++++++--- .../boost/math/cstdfloat/cstdfloat_cmath.hpp | 6 +- .../math/special_functions/lambert_w.hpp | 76 ++++--- 15 files changed, 296 insertions(+), 166 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index e88aea966..3ca13023d 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,11 +120,7 @@ This manual is also available in

        Last revised: July 17, 2017 at 12:24:57 GMT

        Last revised: August 30, 2017 at 10:57:01 GMT

        Last revised: September 01, 2017 at 16:49:40 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index a355455e4..f83d73e80 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,13 +24,8 @@

        -<<<<<<< HEAD -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        -======= -Function Index -

        2 4 A B C D E F G H I J K L M N O P Q R S T U V X Y Z

        ->>>>>>> origin/develop
        2 @@ -124,21 +119,15 @@
      • -<<<<<<< HEAD

        al

      • -======= ->>>>>>> origin/develop

        alpha

        • @@ -1157,6 +1146,10 @@
      • +

        float

        +
        +
        • +

      • float_advance

        • @@ -1681,10 +1674,13 @@
      • +

        lookup

        +
        +
        • +

      • lrint

      • +

        more

        +
        +
        • +

      • msg

        • @@ -2354,6 +2363,10 @@
      • +

        refinement

        +
        +
        • +

      • relative_difference

        • @@ -2890,15 +2903,10 @@
        diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index c70e98710..927333562 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,11 +24,7 @@

        -<<<<<<< HEAD -Class Index

        -======= -Class Index
        ->>>>>>> origin/develop +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 5994b0172..b4b8b6984 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,11 +24,7 @@

        -<<<<<<< HEAD -Typedef Index

        -======= -Typedef Index
        ->>>>>>> origin/develop +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index a82cdafce..54a0af61c 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,11 +24,7 @@

        -<<<<<<< HEAD -Macro Index

        -======= -Macro Index
        ->>>>>>> origin/develop +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 5bbeac516..d9e7938db 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,11 +23,7 @@

        -<<<<<<< HEAD -Index

        -======= -Index
        ->>>>>>> origin/develop +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -241,10 +237,7 @@

      • constants

      • n

      • performance

        • -<<<<<<< HEAD -=======

      • trapezoidal

        • ->>>>>>> origin/develop
      • @@ -329,10 +322,7 @@
        • @@ -519,6 +509,7 @@
        @@ -3322,6 +3315,7 @@

      • Introduction

      • Inverse Chi-Squared Distribution Bayes Example

      • Jacobi Elliptic SN, CN and DN

        • +

      • Lambert W function

      • Locating Function Minima using Brent's algorithm

      • Mathematically Undefined Function Policies

      • Negative Binomial Sales Quota Example.

        • @@ -3585,6 +3579,10 @@
      • +

        float

        +
        +
        • +

      • Floating-Point Classification: Infinities and NaNs

        @@ -3937,6 +3936,7 @@

      • BOOST_MATH_DISCRETE_QUANTILE_POLICY

      • BOOST_MATH_OVERFLOW_ERROR_POLICY

      • expression

        • +

      • more

      • normal

        • @@ -4176,6 +4176,7 @@

      • expression

      • hypergeometric

      • hypergeometric_distribution

        • +

      • k

      • Lanczos approximation

      • policy_type

      • value_type

        • @@ -4481,6 +4482,7 @@
      • @@ -4708,10 +4711,13 @@
        @@ -5165,6 +5175,10 @@
      • +

        lookup

        +
        +
        • +

      • lrint

      • +

        more

        +
        +
        • +

      • More complex example - Inverting the Elliptic Integrals

      • +

        refinement

        +
        +
        • +

      • Relative Error

        • @@ -7237,15 +7264,10 @@
        @@ -7395,7 +7417,10 @@

      • Using Boost.Multiprecision

        -
        +

      • Using C++11 Lambda's

        diff --git a/doc/html/internals.html b/doc/html/internals.html index 77a032ea5..df0e53276 100644 --- a/doc/html/internals.html +++ b/doc/html/internals.html @@ -4,15 +4,9 @@ Chapter 13. Internal Details: Series, Rationals and Continued Fractions, Testing, and Development Tools -<<<<<<< HEAD - - - -======= ->>>>>>> origin/develop @@ -26,11 +20,7 @@
        • -<<<<<<< HEAD -PrevUpHomeNext -======= PrevUpHomeNext ->>>>>>> origin/develop

        @@ -69,11 +59,7 @@

        -<<<<<<< HEAD -PrevUpHomeNext -======= PrevUpHomeNext ->>>>>>> origin/develop
        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index 8884ff744..687a78104 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,11 +27,7 @@ Document Conventions

        -<<<<<<< HEAD - -======= - ->>>>>>> origin/develop +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 71769604c..21c997ba2 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,11 +27,7 @@ Navigation

        -<<<<<<< HEAD - -======= - ->>>>>>> origin/develop +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/roots.html b/doc/html/math_toolkit/roots.html index 29fd489c7..e06786d6a 100644 --- a/doc/html/math_toolkit/roots.html +++ b/doc/html/math_toolkit/roots.html @@ -4,11 +4,7 @@ Root finding -<<<<<<< HEAD - -======= ->>>>>>> origin/develop diff --git a/doc/html/rooting.html b/doc/html/rooting.html index d719cbeb1..99a3ea231 100644 --- a/doc/html/rooting.html +++ b/doc/html/rooting.html @@ -79,8 +79,6 @@

        Comparison of Elliptic Integral Root Finding Algoritghms
        -<<<<<<< HEAD -=======
        Polynomials
        Polynomial and Rational Function @@ -113,20 +111,7 @@
        Caveats
        References
        ->>>>>>> origin/develop -
        Polynomials
        -
        Polynomial and Rational Function - Evaluation
        -
        Interpolation Functions
        -
        -
        Cubic B-spline interpolation
        -
        Barycentric Rational - Interpolation
        -
        -
        Quadrature
        -
        Adaptive Trapezoidal - Quadrature
        diff --git a/doc/html/standalone_HTML.manifest b/doc/html/standalone_HTML.manifest index 6ea4cf670..dd61ada7e 100644 --- a/doc/html/standalone_HTML.manifest +++ b/doc/html/standalone_HTML.manifest @@ -326,8 +326,6 @@ math_toolkit/interpolate/cubic_b.html math_toolkit/interpolate/barycentric.html math_toolkit/quadrature.html math_toolkit/quadrature/trapezoidal.html -<<<<<<< HEAD -======= math_toolkit/quadrature/double_exponential.html math_toolkit/quadrature/double_exponential/de_overview.html math_toolkit/quadrature/double_exponential/de_tanh_sinh.html @@ -339,7 +337,6 @@ math_toolkit/quadrature/double_exponential/de_levels.html math_toolkit/quadrature/double_exponential/de_thread.html math_toolkit/quadrature/double_exponential/de_caveats.html math_toolkit/quadrature/double_exponential/de_refes.html ->>>>>>> origin/develop internals.html math_toolkit/internals_overview.html math_toolkit/internals.html diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index c8d7769ea..e6a3af90e 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -22,16 +22,21 @@ The __Lambert_W is the solution of the equation W[dot]e[super W] = x. It is also called the Omega function, the inverse function of f(W) = W e[super W]. On the x-interval \[0, [inf]\] there is just one real solution. -On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W-1, Wp, Wm. -Only one, the so-called principal branch W0 or Wp, is provided by this implementation. +On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-. +The so-called principal branches W0 and Wm1 are provided by this implementation. -The function is described in Wolfram Mathworld [@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function] ]. +The function is described in Wolfram Mathworld as +[@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function] ]. The principal value of the Lambert W-function is implemented in the Wolfram Language as ProductLog[z]. __WolframAlpha has provided some reference values for testing. For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651. -Also using the [@https://www.wolframalpha.com Wolfram language], [^N\[ProductLog\[-1\], 50] produces the same output. +Also using the [@https://www.wolframalpha.com Wolfram language] + + [^N\[ProductLog\[-1\], \]50\]] + +produces the same output to 50 decimal digit precision. The final __Policy 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. @@ -50,7 +55,7 @@ The source of this example is at [@../../example/lambert_w_example.cpp lambert_w [h4:accuracy Accuracy] -All the functions usually return values within two ULP (unit in the last place) for the floating-point type. +All the functions usually return values within two __ulp (unit in the last place) for the floating-point type. Values of x close to the boundary of real values at `x ~= -exp(-1))`, about -0.367879, approach the singularity result of -1, but never more accurate than `1 - sqrt(epsilon)`, for `double`, about 0.99999999. @@ -70,10 +75,9 @@ This scheme is used, for example, using arbitrary precision arithmetic by Maple For argument values near the singularity and near zero, other approximations are often used, possibly followed by refinement. - - -One real-only implementation is based on an algorithm by__Luu_thesis, -(see routine 11 on page 98 for his Lambert W algorithm). +One real-only implementation was based on an algorithm by__Luu_thesis, +(see routine 11 on page 98 for his Lambert W algorithm) +and his Halley refinement is used in this implementation when required. This implementation is based on Thomas Luu's code posted at [@https://svn.boost.org/trac/boost/ticket/11027 Boost Trac \#11027]. @@ -82,10 +86,12 @@ It has been implemented from Luu's algorithm but templated on RealType parameter and handles both __fundamental_types (float, double, long double), __multiprecision, and also has been tested with a proposed fixed_point type. -A first approximation is computed using the method of Barry et al (see references 5 & 6 below). +A first approximation was computed using the method of Barry et al (see references 5 & 6 below). (For users only requiring an accuracy of relative accuracy of 0.02%, this function might suffice). +This was extended to the widely used [@https://people.sc.fsu.edu/~jburkardt/f_src/toms443/toms443.html TOMS443] +FORTRAN and C++ versions by John Burkardt using Schroeder refinement(s). -We considered using [@https://en.wikipedia.org/wiki/Newton%27s_method Newton/Raphson's method] +We also considered using [@https://en.wikipedia.org/wiki/Newton%27s_method Newton/Raphson's method] `` f(w) = w e^w -z = 0 // Luu equation 6.37 f'(w) = e^w (1 + w), Wolfram alpha (d)/(dw)(f(w) = w exp(w) - z) = e^w (w + 1) @@ -93,44 +99,185 @@ We considered using [@https://en.wikipedia.org/wiki/Newton%27s_method Newton/Ra w1 = w0 - (expw0 * (w0 + 1)); // Refine new Newton/Raphson estimate. `` but concluded that since Newton/Raphson's method takes typically 6 iterations to converge within tolerance, -whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ULP, +whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ulp, so Newton/Raphson's method unlikely to be quicker than the additional cost of computating the 2nd derivative for Halley's method. + [h4:faster_implementation Implementing Faster Algorithms] +More recently, the work of Fukushima has developed faster algorithms, +avoiding any transcendental function calls as these are necessarily expensive. +The current implementation is based on his algorithm. + Many applications of the Lambert W function make repeated evaluations for Monte Carlo methods, -for which applications, speed is important. +for which applications speed is important. Luu and Chapeau-Blondeau and Monir provide typical usage examples. -A more recent paper by Fukushima makes important observation that much of the execution time of all +A recent paper by Fukushima makes the important observation that much of the execution time of all previous iterative algorithms was spent evaluating transcendental functions, mainly exp. -He has put a lot of work into avoiding any slow transcendental functions using lookup tables, -bisection followed by a single Schroeder refinement. -Theoretical and practical tests confirm that this gives results with a known error bound. +He has put a lot of work into avoiding any slow transcendental functions by using lookup tables and +bisection, and finally by a single Schroeder refinement, +without any expensive check on the result necessarily evaluating an exponential. -For types more precise than double, he shows that it is best to use the double estimate -as a starting point for refinement using Halley or other methods. +Theoretical and practical tests confirm that this gives Lambert W estimates with a known small error bound. + +However, though these give results within several epsilon of the nearest representable result, +they do not get as close as is often possible with further refinement, usually within one or two epsilon. + +For types more precise than double, Fukushima shows that it is best to use the [^double] estimate +as a starting point followed by refinement using Halley iterations or other methods. + +So, as usual, there are compromises to consider between execution speed and accuracy. For the less well-behaved regions for arguments near zero and near the singularity at -1/e, some series functions are provided. -However, though these give results within several epsilon of the nearest representable result, -they do not get as close as is possible further refinement, usually within one or two epsilon. +[h4:small_z Small values of argument z near zero] -So, as usual, there is a compromise between execution speed and accuracy. +When argument z is small and near zero, cancellation errors mean that accuracy is lost, +so other series function variants of `lambert_w0_small_z`. +(There is no equivalent for the W-1 branch as this only covers argument z < -1/e). +The cutoff used is as found by trial and error by Fukushima abs(z) < 0.05. + +Coefficients of the inverted series expansion of the Lambert W function around z = 0 +are computed following Fukushima using 17 terms of a Taylor series +computed using Wolfram with + + InverseSeries[Series[z Exp[z],{z,0,17}]] + +See Tosio Fukushima / Journal of Computational and Applied Mathematics 244 (2013) page 86. + +To provide higher precision constants (34 decimal digits) for types larger than `long double`, + + InverseSeries[Series[z Exp[z],{z,0,34}]] + +were also computed. + +Decimal values of specifications for built-in floating-point types below +are 21 digits precision == max_digits10 for long double. + +Specializations for `lambert_w0_small_z` are provided for +`float`, `double`, `long double`, `float128` and multiprecision types. + +The tag_type selection is based on the value `std::numeric_limits::max_digits10`. +This allows distinguishing between `long double` types that commonly vary between 64 and 80-bits, +and also compilers that have a `float` type using 64 bits and/or `long double` using 128-bits. + +(Note that one cannot switch tag_type on `std::numeric_limits<>::max()` +because comparison values may overflow the compiler limit. +Nor can we switch on `std::numeric_limits::max_exponent10()` +because both 80-bit and 128-bit floating-point types use 11 bits for exponent. +So must rely on `std::numeric_limits::max_digits10`.) + +[warning It is assumes that `max_digits10` is defined correctly or this might fail to make the correct selection. +causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.] + +[warning The use of `doubledouble` types is untested and may give unexpected precision.] + +For multiprecision types, first several terms of the series are tabulated and evaluated as a polynomial: +(this will save us a bunch of expensive calls to `pow`). +Then our series functor is initialized "as if" it had already reached term 18, +enough evaluation of built-in 64-bit double and float (and 80-bit long double?) types. +Finally the functor is called repeatedly to compute as many additional series terms +as necessary to achive the desired precision, set from `get_epsilon`. +Or terminated by `evlation_error` on reaching the set iteration limit `max_series_iterations`. + +A little more than one decimal digit of precision is gained by each additional series term. +This allows computation of Lambrt W near zero to at least 1000 decimal digit precision, +given sufficient compute time. + +[h4:near_singularity Argument z near the singularity at -1/e between branches W0 and W-1] + +Variants of Function `lambert_w_singularity_series` are used to handle z arguments +which are near to the singularity at z = -exp(-1) = -3.6787944 between the branches W0 and W-1. + +T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3 +described using Wolfram + +InverseSeries\[Series\[sqrt\[2(p Exp\[1 + p\] + 1)\], {p,-1, 20}\]\] + +to provide Table 3. + +This implementation used Wolfram to obtain 40 series terms at 50 decimal digit precision + + N\[InverseSeries\[Series\[Sqrt\[2(p Exp\[1 + p\] + 1)\], { p,-1,40 }\]\], 50\] + + -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ... + +These constants are computed at compile time for the full precision for any RealType T +using original rationals from Table 3. + +Longer decimal digits strings are rationals pre-evaluated using Wolfram. +Some integer constants overflow, so use largest size available, suffixed by uLL. + +Above the 14th term, the rationals exceed the range of `unsigned long long` and are replaced +by pre-computed decimal values at least 21 digits precision == `max_digits10` for long double. + +A macro `BOOST_MATH_TEST_VALUE` taking a decimal floating-point literal was used +to allow use of both built-in floating-point types like `double` +which have contructors taking literal decimal values like 3.14, +and also multiprecision and other User-defined Types that only provide full-precision construction +from decimal digit strings like `"3.14"`. +(Construction of multiprecision types from built-in floating-point types +only provides the precision of the built-in type, like `double`). + +Fukushima used 20 series terms and it was confirmed that using more terms does not usefully increase accuracy. + + +[h4:precision Controlling the compromise between Precision and Speed] To allow users more control, this implementation provides the best possible accuracy by default, (Boost.Math generally prefers accuracy over speed) -but will stop at intermediate stages if the precision specifies in the policy has been met, -perhaps halving the execution time. +but will return at intermediate stages if the precision specified in the policy has been met, +usually at least halving the execution time. +It is convenient to define some `using` statements when using __policy_section to control precision. + using boost::math::policies::policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; // Precision as bits. + using boost::math::policies::digits10; // Precision as decimal digits. +[tip Because some macros and metaprogramming are used by the implementation of policies, +some ways of expressing these items may confuse the compiler and Visual Studio Intellisense.] + +Precision targets can be specified in bits using `digits2` or decimal using `digits10`. +These are related by digits10 = log10(2) * digits2 where log10(2) = 0.30103. +Specifying `digits10` is a coarser measure and is roughly a third of `digits2`, +but may be slightly more intuitive than specifying precision in bits. + +[import ../../example/lambert_w_precision_example.cpp] + +[lambert_w_precision_1] +[lambert_w_precision_output_1] + +For examples of controlling precision, see [@../../include/boost/math/example/lambert_w_precision.cpp lambert_w_precision.cpp]. The implementation details are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] -[h5 Other implmentations] +[h5:diagnostics Diagnostics Macros] + +Several macros are provided to output diagnostic information (potentially [*much] output). +These can be statements like `#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` [*before] a statement +`#include `, +or on the project compile command line `/DBOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` , +or in a jamfile.v2 `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` + +BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES +BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // lambert_w_singularity_series +BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. +BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. +BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show result of estimates where z is near singularity where branchs meet. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show result of estimates where small z is near zero. + + +[h5 Other implementations] The Lambert W has also been discussed in a [@http://lists.boost.org/Archives/boost/2016/09/230819.php Boost thread]. This also gives link to a prototype version by which also handles complex results [^(x < -exp(-1)], about -0.367879). @@ -142,6 +289,12 @@ has also produces a prototype C++ library that can compute the Lambert W functio This is not implemented here but might be completed in the future. +[h4:acknowledgements Acknowledgements] + +* Thanks to Wolfram for use of their invaluable online Wolfram Alpha service. +* Thanks for Mark Chapman for performing offline Wolfram computations. + + [h4:references References] # NIST Digital Library of Mathematical Functions. [@http://dlmf.nist.gov/4.13.F1]. diff --git a/include/boost/math/cstdfloat/cstdfloat_cmath.hpp b/include/boost/math/cstdfloat/cstdfloat_cmath.hpp index 7274b65cb..83fb480dc 100644 --- a/include/boost/math/cstdfloat/cstdfloat_cmath.hpp +++ b/include/boost/math/cstdfloat/cstdfloat_cmath.hpp @@ -536,13 +536,11 @@ using boost::math::cstdfloat::detail::ldexp; using boost::math::cstdfloat::detail::frexp; using boost::math::cstdfloat::detail::fabs; -<<<<<<< HEAD - // using boost::math::cstdfloat::detail::abs; -======= + #if !(defined(_GLIBCXX_USE_FLOAT128) && defined(__GNUC__) && (__GNUC__ >= 7)) using boost::math::cstdfloat::detail::abs; #endif ->>>>>>> origin/develop + using boost::math::cstdfloat::detail::floor; using boost::math::cstdfloat::detail::ceil; using boost::math::cstdfloat::detail::sqrt; diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index a73c9fd25..e84c8c9e2 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -15,8 +15,10 @@ and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si based on the algorithm and a FORTRAN version of Toshio Fukushima. Some macros that will show some (or much) diagnostic values if #defined. +#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_INTEGRAL -#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES +#define -able macros +BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // lambert_w_singularity_series BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. @@ -24,7 +26,9 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. - +BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES +BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS */ //#ifndef BOOST_MATH_SF_LAMBERT_W_HPP @@ -309,7 +313,7 @@ namespace detail //! \details //! The tag_type selection is based on the value std::numeric_limits::max_digits10. - //! This allows distinguishing between long double types that common vary between 64 and 80-bits, + //! This allows distinguishing between long double types that commonly vary between 64 and 80-bits, //! and also compilers that have a float type using 64 bits and/or long double using 128-bits. //! It assumes that max_digits10 is defined correctly or this might fail to make the correct selection. //! causing very small differences in computing lambert_w that would be very difficult to detect and diagnose. @@ -318,9 +322,9 @@ namespace detail //! So must rely on std::numeric_limits::max_digits10. //! Specialization of float zero series expansion used for small z (abs(z) < 0.05). - //! Specializations of lambert_w0_zero_series for built-in types. + //! Specializations of lambert_w0_small_z for built-in types. //! These specializations should be chosen in preference to T version. - //! For example: lambert_w0_zero_series(0.001F) should use the float version. + //! For example: lambert_w0_small_z(0.001F) should use the float version. // Policy is not used by built-in types when all terms are used during an inline computation, // but for the ta_type selection to work, they all must include Policy the their signature. @@ -484,7 +488,7 @@ namespace detail z*(9104.5002411580189357967135744913522691300469078247L - // j14 z*(22324.308512706601434280005708577137148565719994291L - // j15 z*(55103.621972903835337697771560205422639285073147507L - // j16 - z*136808.86090394293563342215789305736395683485630576)))))))))))))))); // j17 + z*136808.86090394293563342215789305736395683485630576L)))))))))))))))); // j17 return result; } // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&) @@ -649,7 +653,9 @@ namespace detail // std::cout << " get eps = " << get_epsilon() << std::endl; // quad eps = 1.93e-34, bin_float_50 eps = 5.35e-51 policies::check_series_iterations("boost::math::lambert_w0_small_z<%1%>(%1%)", max_iter, pol); - //std::cout << "z = " << z << " needed " << max_iter << " iterations." << std::endl; +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS + std::cout << "z = " << z << " needed " << max_iter << " iterations." << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS //std::cout.precision(prec); // Restore. return result; } // template inline T lambert_w0_small_z_series(T z, const Policy& pol) @@ -684,6 +690,7 @@ namespace detail using boost::math::tools::max_value; // T tolerance = std::numeric_limits::epsilon(); + // T tolerance = boost::math::policies::get_epsilon(); // TODO should get_precision here. @@ -892,7 +899,7 @@ if (diff == 0) // Exact result - common. ///////////// namespace detail implementations of Lambert W for W0 and W-1 branches. - //! Compute Lambert W for W0 branch. + //! Compute Lambert W for W0 (or W+) branch. template T lambert_w0_imp(const T z, const Policy& pol) { @@ -900,12 +907,9 @@ if (diff == 0) // Exact result - common. // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L), // or static_casted integer, for example: static_cast(1) or static_cast(1). // Want to allow fixed_point types too, so do not just test for floating-point. - // Integral types should be promoted to double by user Lambert w functions. + // Integral types should been promoted to double by user Lambert w functions. BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: W(1.), not W(1)!"); - // If integral type provided to user functionlambert_w0 or _wm1, - // then should already have been promoted to double. - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 { std::size_t saved_precision = std::cout.precision(std::numeric_limits::max_digits10); @@ -914,7 +918,7 @@ if (diff == 0) // Exact result - common. << ", max_digits10 = " << std::numeric_limits::max_digits10 << std::setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() << std::endl; std::cout.precision(saved_precision); - } + } #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 // Test for edge and corner cases first, @@ -1023,7 +1027,7 @@ if (diff == 0) // Exact result - common. if (std::numeric_limits::digits > 53) { // T is more precise than 64-bit double (or long double, or ?), - // so compute an approximate value using only Schroeder refinement, + // so compute an approximate value using only one Schroeder refinement, // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50 // because are next going to use Halley refinement at full/high precision using this as an approximation). using boost::math::policies::precision; @@ -1068,9 +1072,13 @@ if (diff == 0) // Exact result - common. } } // for // else z too large :-( - // TODO use policy here. - std::cerr << "lambert_w0 argument too large, z = " << z << std::endl; - return std::numeric_limits::quiet_NaN(); + const char* function = "boost::math::lambert_w0()"; + return policies::raise_domain_error(function, + "Argument z = %1 too large.", + z, pol); + + // std::cerr << "lambert_w0 argument too large, z = " << z << std::endl; + //return std::numeric_limits::quiet_NaN(); overshot: { @@ -1091,33 +1099,31 @@ if (diff == 0) // Exact result - common. bisect: --n; // g[n] is nearest below, so n is integer value of W, and - // g[n+1] is upper integral value. These are used for bisection. + // g[n+1] is upper integral value. These are used to start bisection. // typedef typename policies::precision::type prec; //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. - // Check precision specified by policy. + // Check precision specified by policy. //int digits2 = policies::digits(); //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. - int d10 = policies::digits_base10(); // policy template parameter digits10 // for example = 1 from lambert_w(x, policy >() int d2 = policies::digits(); // digits base 2 from policy. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 - - std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // digits10 = 1, digits2 = 5 + int d10 = policies::digits_base10(); // policy template parameter digits10 + std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 //<< ", epsilon " << epsilon << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 - if (d10 <= 2) - { // Only two decimal digits precision required, (biggest lambert_w is unlikely to be < 100) - // so just return the mean of nearby integral values. - // This is a *very* approximate result and perhaps not very useful! -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 - - std::cout << "Result Integer W bisection between g[" << n - 1 << "] = " << g[n - 1] << " < " << z << " < " << g[n] << " = g[" << n << "], " - << "\nbisect mean = " << (g[n - 1] + g[n]) / 2 << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + if (d2 <= 7) + { // Only 7 binary digits precision required to hold integer size of g[65], + // so just return the mean of two nearby integral values. + // This is a *very* approximate estimate, and perhaps not very useful? +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_INTEGRALS + std::cout << "Result Integer W(" << z << ") bisection between g[" << n - 1 << "] = " << g[n - 1] << " and g[" << n << "] = " << g[n] + << ", bisect mean = " << (g[n - 1] + g[n]) / 2 << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_INTEGRALS return static_cast((g[n - 1] + g[n]) / 2); } // Compute the number of bisections (jmax) that ensure that result is close enough that @@ -1157,9 +1163,9 @@ if (diff == 0) // Exact result - common. { // Only 10 digits2 required (== digits10 = 3 decimal digits precision), // so just return the nearest bisection. // (Might make this test depend on size of T?) -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION std::cout << "Bisection estimate = " << w << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION return w; // Bisection only. } else // More than 10 digits2 wanted so continue with Fukushima's Schroeder refinement. @@ -1178,11 +1184,11 @@ if (diff == 0) // Exact result - common. // get a near as possible to correct result (usually +/- epsilon). { result = halley_update(result, z, pol); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Halley refinement estimate = " << result << std::endl; std::cout.precision(saved_precision); -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY return result; // Halley } // schroeder or Schroeder and Halley. } // more than 10 digits2 From 39846818e123ec32ddd130b3ac424ab6c71452cb Mon Sep 17 00:00:00 2001 From: pabristow Date: Tue, 3 Oct 2017 15:11:25 +0100 Subject: [PATCH 15/71] Expanded docs using snippets. --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 14 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 20 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/html/math_toolkit/real_concepts.html | 2 +- .../root_comparison/cbrt_comparison.html | 6 +- .../root_comparison/root_n_comparison.html | 9 +- doc/math.qbk | 9 +- doc/sf/lambert_w.qbk | 353 +++++++++++------- .../math/special_functions/lambert_w.hpp | 31 +- 14 files changed, 289 insertions(+), 167 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index 3ca13023d..213ebbef0 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: September 01, 2017 at 16:49:40 GMT

        Last revised: October 03, 2017 at 12:08:08 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index f83d73e80..21c7d2b8a 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -323,6 +323,10 @@
      • +

        branch

        +
        +
        • +

      • brent_find_minima

        • @@ -1748,7 +1752,11 @@
      • -

        lambert_w

        +

        lambert_w0

        +
        +
        • +
      • +

        lambert_wm1

      • @@ -2359,6 +2367,7 @@
        • @@ -2903,7 +2912,6 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index b4b8b6984..d0b4075cd 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 54a0af61c..e9ab43d03 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index d9e7938db..1518a165d 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -992,6 +992,10 @@
      • +

        branch

        +
        +
        • +

      • brent_find_minima

        • @@ -4810,18 +4814,24 @@

      • accuracy

      • al

      • alpha

        • +

      • branch

      • constants

      • expression

      • float

      • interval

        • -

      • lambert_w

        • +

      • lambert_w0

        • +

      • lambert_wm1

        • +

      • range

      • refinement

        • -

      • types

      • W

      • -

        lambert_w

        +

        lambert_w0

        +
        +
        • +
      • +

        lambert_wm1

      • @@ -6165,6 +6175,7 @@
        • @@ -7264,7 +7275,6 @@

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 21c997ba2..7821e5f82 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/real_concepts.html b/doc/html/math_toolkit/real_concepts.html index 00fdbc355..0d29a6f6f 100644 --- a/doc/html/math_toolkit/real_concepts.html +++ b/doc/html/math_toolkit/real_concepts.html @@ -32,7 +32,7 @@ any type RealType that meets the conceptual requirements given below. All the built-in floating-point types like double will meet these requirements. (Built-in types are also called fundamental - types). + (built-in) types).

        User-defined types that meet the conceptual requirements can also be used. diff --git a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html index f6e95fd28..57c050c83 100644 --- a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html @@ -29,7 +29,7 @@

        In the table below, the cube root of 28 was computed for three fundamental - types floating-point types, and one Boost.Multiprecision + (built-in) types floating-point types, and one Boost.Multiprecision type cpp_bin_float using 50 decimal digit precision, using four algorithms.

        @@ -202,8 +202,8 @@
      • For fundamental - types, there was little to choose between the three derivative - methods, but for cpp_bin_float, + (built-in) types, there was little to choose between the three + derivative methods, but for cpp_bin_float, Newton-Raphson iteration was twice as fast. Note that the cube-root is an extreme test case as the cost of calling the functor is so cheap that the runtimes diff --git a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html index 4d54deb82..8ad71dd21 100644 --- a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html @@ -5203,10 +5203,11 @@
      • Perhaps surprisingly, there is little difference between the various algorithms for fundamental - types floating-point types. Using the first derivatives (Newton-Raphson iteration) - is usually the best, but while the improvement over the no-derivative - TOMS Algorithm - 748: enclosing zeros of continuous functions is considerable + (built-in) types floating-point types. Using the first derivatives + (Newton-Raphson + iteration) is usually the best, but while the improvement over + the no-derivative TOMS + Algorithm 748: enclosing zeros of continuous functions is considerable in number of iterations, but little in execution time. This reflects the fact that the function we are finding the root for is trivial to evaluate, so runtimetimes are dominated by the time taken by the boilerplate diff --git a/doc/math.qbk b/doc/math.qbk index 34118dbe3..4db9e2c34 100644 --- a/doc/math.qbk +++ b/doc/math.qbk @@ -111,7 +111,7 @@ and use the function's name as the link text.] [def __root_finding_examples [link math_toolkit.roots.root_finding_examples root-finding examples]] [def __brent_minima [link math_toolkit.roots.brent_minima Brent's method]] [def __brent_minima_example [link math_toolkit.roots.brent_minima.example Brent's method example]] -[def __newton[link math_toolkit.roots.roots_deriv.newton Newton-Raphson iteration]] +[def __newton [link math_toolkit.roots.roots_deriv.newton Newton-Raphson iteration]] [def __halley [link math_toolkit.roots.roots_deriv.halley Halley]] [def __schroder [link math_toolkit.roots.roots_deriv.schroder Schr'''ö'''der]] [def __brent_minima_example [link math_toolkit.roots.brent_minima.example Brent minima finding example]] @@ -218,6 +218,9 @@ and use the function's name as the link text.] [/Lambert W function] [def __lambert_w [link math_toolkit.sf_lambert_w.lambert_w_function lambert_w]] +[def __lambert_w_implementation [link math_toolkit.lambert_w.implementation implementation]] +[def __lambert_w_implementation [link math_toolkit.lambert_w.precision precision]] +[def __lambert_w_implementation [link math_toolkit.lambert_w.examples examples]] [/Airy Functions] [def __airy_ai [link math_toolkit.airy.ai airy_ai]] @@ -409,6 +412,8 @@ and use the function's name as the link text.] [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 __Maple [@https://www.maplesoft.com Maple]] + [def __WolframAlpha [@http://www.wolframalpha.com/ Wolfram Alpha]] [def __TOMS748 [@http://portal.acm.org/citation.cfm?id=210111 TOMS Algorithm 748: enclosing zeros of continuous functions]] [def __TOMS910 [@http://portal.acm.org/citation.cfm?id=1916469 TOMS Algorithm 910: A Portable C++ Multiple-Precision System for Special-Function Calculations]] @@ -423,7 +428,7 @@ and use the function's name as the link text.] [def __epsilon [@http://en.wikipedia.org/wiki/Machine_epsilon machine epsilon]] [def __ADL [@http://en.cppreference.com/w/cpp/language/adl Argument Dependent Lookup (ADL)]] [def __function_template_instantiation [@http://en.cppreference.com/w/cpp/language/function_template Function template instantiation]] -[def __fundamental_types [@http://en.cppreference.com/w/cpp/language/types fundamental types]] +[def __fundamental_types [@http://en.cppreference.com/w/cpp/language/types fundamental (built-in) types]] [def __guard_digits [@http://en.wikipedia.org/wiki/Guard_digit guard digits]] [def __SSE2 [@http://en.wikipedia.org/wiki/SSE2 SSE2 instructions]] [def __representable [@http://en.wikipedia.org/wiki/Floating_point#Representable_numbers.2C_conversion_and_rounding representable]] diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index e6a3af90e..e208840c9 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -4,76 +4,219 @@ `` #include + `` + namespace boost { namespace math { template - ``__sf_result`` lambert_w(T x); + ``__sf_result`` lambert_w0(T z); // W0 branch, default precision. template - ``__sf_result`` lambert_w(T x, const ``__Policy``&); + ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 policy controlled precision. - } // namespace boost - } // namespace math + template + ``__sf_result`` lambert_wm1(T z); // W-1 branch. + + template + ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 policy controlled precision. + + } // namespace boost + } // namespace math [h4:description Description] -The __Lambert_W is the solution of the equation W[dot]e[super W] = x. +The __Lambert_W is the solution of the equation W[dot]e[super W] = z. It is also called the Omega function, the inverse function of f(W) = W e[super W]. -On the x-interval \[0, [inf]\] there is just one real solution. +On the z-interval \[0, [infin]\] there is just one real solution. On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-. -The so-called principal branches W0 and Wm1 are provided by this implementation. +The principal branches called `lambert_W0` and `lambert_Wm1` are provided by this real-only implementation. The function is described in Wolfram Mathworld as -[@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function] ]. -The principal value of the Lambert W-function is implemented in the Wolfram Language as ProductLog[z]. +[@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function]]. +The principal value of the Lambert W-function is implemented in the Wolfram Language as ['ProductLog\[z\]]. __WolframAlpha has provided some reference values for testing. -For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651. -Also using the [@https://www.wolframalpha.com Wolfram language] +For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651... - [^N\[ProductLog\[-1\], \]50\]] +Also the [@https://www.wolframalpha.com Wolfram language] command: [^N\[ProductLog\[-1\], 50\]] produces the same output to 50 decimal digit precision. The final __Policy 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. +how it handles errors, what level of precision is wanted, etc. -Refer to __policy_section for more details. +Refer to __policy_section for more details and see examples below. [h4:examples Examples] -[import ../../example/lambert_w_example.cpp] +[import ../../example/lambert_w_simple_examples.cpp] -[lambert_w_example_1] +You will need the following include and `using` statements: +[lambert_w_simple_examples_includes] -[lambert_w_output_1] +Some examples follow: -The source of this example is at [@../../example/lambert_w_example.cpp lambert_w_example.cpp] +[lambert_w_simple_examples_0] -[h4:accuracy Accuracy] +[lambert_w_simple_examples_1] -All the functions usually return values within two __ulp (unit in the last place) for the floating-point type. -Values of x close to the boundary of real values at `x ~= -exp(-1))`, about -0.367879, -approach the singularity result of -1, -but never more accurate than `1 - sqrt(epsilon)`, for `double`, about 0.99999999. +[lambert_w_simple_examples_2] + +[lambert_w_simple_examples_3] + +[warning When using multiprecision, take great care not to +construct or assign non-integers from `double` silently losing precision.] + +[lambert_w_simple_examples_4] +Note the spurious non-zero decimal digits appearing after digit 17 in the argument 0.9000000000000000...! + +See the correct result constructing from a decimal digit string: +[lambert_w_simple_examples_4a] +Note the expected zeros for all places up to 50, and the correct result. + +Policies can be used to control precision (a little less precision gives a significant speedup): +[lambert_w_simple_examples_precision_policies] + +and to control what action to take on errors: +[lambert_w_simple_examples_error_policies] + +[tip Always use [^try'n'catch] blocks to ensure you get an error message like this:] + + +[lambert_w_simple_examples_error_message_1] + +[lambert_w_simple_examples_out_of_range] + +The full source of these examples is at [@../../example/lambert_w_example.cpp lambert_w_example.cpp] + +[h4:precision Controlling the compromise between Precision and Speed] + +The compromise between precision and speed can be controlled using __precision_policy. + +Using the default policy, all the functions usually return values within two __ulp +for the floating-point type, except for very small arguments very near zero, +and for arguments very close to the singularity at the branch point. + +By default, this implementation provides the best possible precision +(adding a __halley refinement, but without using __multiprecision higher precision types) +making it nearly twice as slow as Fukushima's algorithm, +(Boost.Math generally prefers accuracy over speed). +However, it will return at intermediate stages if the precision specified in the policy has been met, +usually at least halving the execution time. + +It is convenient to define some `using` statements when using __policy_section to control precision. + + using boost::math::policies::policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; // Precision as bits. + using boost::math::policies::digits10; // Precision as decimal digits. + +[tip Because some macros and metaprogramming are used by the implementation of policies, +some ways of expressing these items may confuse the compiler and Visual Studio Intellisense.] + +Precision targets can be specified in bits using `digits2` or decimal using `digits10`. +These are related by `digits10 = log10(2) * digits2 where log10(2) = 0.30103`. +Specifying `digits10` is a coarser measure and is roughly a third of `digits2`, +but may be slightly more intuitive than specifying precision in bits. + +[import ../../example/lambert_w_precision_example.cpp] + +To show the various stages the example below shows evaluation of Lambert W at varying precisions +specified using a policy with `digits10` increasing from 1 to 9. + +For float this covers the full precision range as `max_digits10 = 9`. + +[lambert_w_precision_1] +[lambert_w_precision_output_1] + +If the policy precision is specified using `digits2`, one can see the small improvement from Halley at 22 bits: + + std::cout << lambert_w0(z, policy >()) ... + + Lambert W (10.0000000, digits2<21>) = 1.74552798 << Schroeder. + Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley. + +For `double`, `max_digits10 == 17` and `digits == 53`, so the table is too long to here. + +The final Schroeder refinement is skipped if `(digits2 <= (std::numeric_limits::digits - 3))` +3 less than the maximum for the type `std::numeric_limits::digits`. + +For type `double`, the switch is at `policy `, so this is recommended for general use when speed is important. + +[tip Use `lambert_w0(z, policy >())` if speed is more important than the ultimate precision.] + +If speed is very important then `digits2<10>` only using Schroeder might suffice: + + Lambert W (10.0000000, digits2<10>) = 1.74414063 << Schroeder only. + +For floating-point types with precision greater than __fundamental_types, a `double` evaluation is used +as a first approximation followed by Halley refinement, +so that there is is little point trying to control precision. +Higher precisions are always going to be [*very much slower]. + +For more examples of controlling precision, see [@../../include/boost/math/example/lambert_w_precision.cpp lambert_w_precision.cpp]. + +The implementation details of algorithm switch points are in +[@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] + +[h5:diagnostics Diagnostics Macros] + +Several macros are provided to output diagnostic information (potentially [*much] output). +These can be statements like + +`#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` + +placed [*before] the include statement + +`#include `, + +or defined on the project compile command-line: `/DBOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS`, + +or defined in a jamfile.v2: `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` + +`` + BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. + BOOST_MATH_INSTRUMENT_LAMBERT_W1 // W1 branch diagnostics. + BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. + BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. + BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. + BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // Higher than built-in precision types approximation and refinement. + BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. + BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show result of estimates where z is near singularity where branches meet. + BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show result of estimates where small z is near zero. +`` [h4:implemention Implementation] -There are many previous implementations with increasing accuracy and speed. +There are many previous implementations with increasing accuracy and speed. See references below. -For most of the range of arguments, some initial approximation is followed by a single refinement, -often using Halley or similar method, gives a useful precision. -For the most precise results possible, for C++ the nearest representation, -iterative refinements using Halley's method are needed, -perhaps using a higher precision type for intermediate computation, +For most of the range of ['z] arguments, some initial approximation is followed by a single refinement, +often using Halley or similar method, and gives a useful precision. +To get a better precision, additional iterative refinements, +for example, using __halley or __schroder method, may be needed. + +For the most precise results possible, for C++, close to the nearest representation for the type, +it is usually necessary to use a higher precision type for intermediate computation, finally casting back to the smaller desired result type. -This scheme is used, for example, using arbitrary precision arithmetic by Maple and Wolfram. +This strategy is used by Maple and Wolfram, for example, using arbitrary precision arithmetic, +and some of these high-precision values are used for testing this library. +This method is also used to provide __boost_test values using __multiprecision, +typically, a 50 decimal digit type like `cpp_dec_float_50` cast to a `float`, `double` or `long double` type. -For argument values near the singularity and near zero, other approximations are often used, -possibly followed by refinement. +For ['z] argument values near the singularity and near zero, other approximations may be used, +possibly followed by refinement or increasing series terms until a desired precision is achieved. +At extreme arguments near to zero or the singularity at the branch point, +even this fails and the only method to achieve a really close result is to cast from a higher precision type. + +In practical applications, the increased computation required +(often towards a thousand fold slower and requiring the additional code for multiprecision) +is not justified and the algorithms here do not implement this. +But because the Boost.Lambert_W algorithm has been tested using __multiprecision, +users who require this can always easily achieve the nearest representation for the __fundamental_types +if the application justifies the very large extra computation cost. One real-only implementation was based on an algorithm by__Luu_thesis, (see routine 11 on page 98 for his Lambert W algorithm) @@ -82,8 +225,8 @@ and his Halley refinement is used in this implementation when required. This implementation is based on Thomas Luu's code posted at [@https://svn.boost.org/trac/boost/ticket/11027 Boost Trac \#11027]. -It has been implemented from Luu's algorithm but templated on RealType parameter and result -and handles both __fundamental_types (float, double, long double), __multiprecision, +It has been implemented from Luu's algorithm but templated on `RealType` parameter and result +and handles both __fundamental_types (`float, double, long double`), __multiprecision, and also has been tested with a proposed fixed_point type. A first approximation was computed using the method of Barry et al (see references 5 & 6 below). @@ -91,7 +234,7 @@ A first approximation was computed using the method of Barry et al (see referenc This was extended to the widely used [@https://people.sc.fsu.edu/~jburkardt/f_src/toms443/toms443.html TOMS443] FORTRAN and C++ versions by John Burkardt using Schroeder refinement(s). -We also considered using [@https://en.wikipedia.org/wiki/Newton%27s_method Newton/Raphson's method] +We also considered using __newton method. `` f(w) = w e^w -z = 0 // Luu equation 6.37 f'(w) = e^w (1 + w), Wolfram alpha (d)/(dw)(f(w) = w exp(w) - z) = e^w (w + 1) @@ -103,50 +246,54 @@ whereas Halley usually takes only 1 to 3 iterations to achieve an result within so Newton/Raphson's method unlikely to be quicker than the additional cost of computating the 2nd derivative for Halley's method. - [h4:faster_implementation Implementing Faster Algorithms] -More recently, the work of Fukushima has developed faster algorithms, +More recently, the Tosio Fukushima has developed faster algorithms, avoiding any transcendental function calls as these are necessarily expensive. -The current implementation is based on his algorithm. +The current implementation is based on his algorithm +starting with a translation from FORTRAN into C++ by Darko Veberic. -Many applications of the Lambert W function make repeated evaluations for Monte Carlo methods, +Many applications of the Lambert W function make many repeated evaluations for Monte Carlo methods, for which applications speed is important. Luu and Chapeau-Blondeau and Monir provide typical usage examples. -A recent paper by Fukushima makes the important observation that much of the execution time of all -previous iterative algorithms was spent evaluating transcendental functions, mainly exp. +Fukushima makes the important observation that much of the execution time of all +previous iterative algorithms was spent evaluating transcendental functions, mainly `exp`. He has put a lot of work into avoiding any slow transcendental functions by using lookup tables and bisection, and finally by a single Schroeder refinement, -without any expensive check on the result necessarily evaluating an exponential. +without any check on the precision of the result (necessarily evaluating an expensive exponential). -Theoretical and practical tests confirm that this gives Lambert W estimates with a known small error bound. +Theoretical and practical tests confirm that this gives Lambert W estimates +with a known small error bound over nearly all the range of ['z] argument. However, though these give results within several epsilon of the nearest representable result, -they do not get as close as is often possible with further refinement, usually within one or two epsilon. +they do not get as close as is often possible with further refinement, usually to within one or two epsilon. -For types more precise than double, Fukushima shows that it is best to use the [^double] estimate -as a starting point followed by refinement using Halley iterations or other methods. +For types more precise than `double`, Fukushima shows that it is best to use the `double` estimate +as a starting point followed by refinement using __halley iterations or other methods. + +For the less well-behaved regions for ['z] arguments near zero and near the branch singularity at -1/e, +some series functions are provided. So, as usual, there are compromises to consider between execution speed and accuracy. - -For the less well-behaved regions for arguments near zero and near the singularity at -1/e, -some series functions are provided. +This implementation allows users to get closer than Fukushima, at some small loss of speed +(but does not guarantee the nearest representable result) +or to get faster but less precise evalations controlled by __policies. [h4:small_z Small values of argument z near zero] -When argument z is small and near zero, cancellation errors mean that accuracy is lost, +When argument ['z] is small and near zero, cancellation errors mean that accuracy is lost, so other series function variants of `lambert_w0_small_z`. -(There is no equivalent for the W-1 branch as this only covers argument z < -1/e). -The cutoff used is as found by trial and error by Fukushima abs(z) < 0.05. +(There is no equivalent for the W-1 branch as this only covers argument `z < -1/e`). +The cutoff used is as found by trial and error by Fukushima `abs(z) < 0.05`. -Coefficients of the inverted series expansion of the Lambert W function around z = 0 +Coefficients of the inverted series expansion of the Lambert W function around `z = 0` are computed following Fukushima using 17 terms of a Taylor series computed using Wolfram with InverseSeries[Series[z Exp[z],{z,0,17}]] -See Tosio Fukushima / Journal of Computational and Applied Mathematics 244 (2013) page 86. +See Tosio Fukushima, Journal of Computational and Applied Mathematics 244 (2013) page 86. To provide higher precision constants (34 decimal digits) for types larger than `long double`, @@ -155,42 +302,46 @@ To provide higher precision constants (34 decimal digits) for types larger than were also computed. Decimal values of specifications for built-in floating-point types below -are 21 digits precision == max_digits10 for long double. +are 21 digits precision == `std::numeric_limits::max_digits10` for `long double`. Specializations for `lambert_w0_small_z` are provided for -`float`, `double`, `long double`, `float128` and multiprecision types. +`float`, `double`, `long double`, `float128` and for __multiprecision types like . The tag_type selection is based on the value `std::numeric_limits::max_digits10`. -This allows distinguishing between `long double` types that commonly vary between 64 and 80-bits, +This distinguishes between `long double` types that commonly vary between 64 and 80-bits, and also compilers that have a `float` type using 64 bits and/or `long double` using 128-bits. -(Note that one cannot switch tag_type on `std::numeric_limits<>::max()` +[note One cannot switch tag_type on `std::numeric_limits<>::max()` because comparison values may overflow the compiler limit. Nor can we switch on `std::numeric_limits::max_exponent10()` because both 80-bit and 128-bit floating-point types use 11 bits for exponent. -So must rely on `std::numeric_limits::max_digits10`.) +So must rely on `std::numeric_limits::max_digits10`.] [warning It is assumes that `max_digits10` is defined correctly or this might fail to make the correct selection. causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.] [warning The use of `doubledouble` types is untested and may give unexpected precision.] +As noted in the __lambert_w_implementation section above, +it is only possible ensure the nearest representable value by casting from a higher precision type, +computed at very, very much greater cost. + For multiprecision types, first several terms of the series are tabulated and evaluated as a polynomial: (this will save us a bunch of expensive calls to `pow`). Then our series functor is initialized "as if" it had already reached term 18, -enough evaluation of built-in 64-bit double and float (and 80-bit long double?) types. +enough evaluation of built-in 64-bit double and float (and 80-bit `long double`) types. Finally the functor is called repeatedly to compute as many additional series terms as necessary to achive the desired precision, set from `get_epsilon`. -Or terminated by `evlation_error` on reaching the set iteration limit `max_series_iterations`. +Or terminated by `evaluation_error` on reaching the set iteration limit `max_series_iterations`. A little more than one decimal digit of precision is gained by each additional series term. -This allows computation of Lambrt W near zero to at least 1000 decimal digit precision, +This allows computation of Lambert W near zero to at least 1000 decimal digit precision, given sufficient compute time. [h4:near_singularity Argument z near the singularity at -1/e between branches W0 and W-1] -Variants of Function `lambert_w_singularity_series` are used to handle z arguments -which are near to the singularity at z = -exp(-1) = -3.6787944 between the branches W0 and W-1. +Variants of Function `lambert_w_singularity_series` are used to handle ['z] arguments +which are near to the singularity at `z = -exp(-1) = -3.6787944` where the branches W0 and W-1 join. T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3 described using Wolfram @@ -209,92 +360,39 @@ These constants are computed at compile time for the full precision for any Real using original rationals from Table 3. Longer decimal digits strings are rationals pre-evaluated using Wolfram. -Some integer constants overflow, so use largest size available, suffixed by uLL. +Some integer constants overflow, so use largest size available, suffixed by `uLL`. Above the 14th term, the rationals exceed the range of `unsigned long long` and are replaced -by pre-computed decimal values at least 21 digits precision == `max_digits10` for long double. +by pre-computed decimal values at least 21 digits precision == `max_digits10` for `long double`. A macro `BOOST_MATH_TEST_VALUE` taking a decimal floating-point literal was used to allow use of both built-in floating-point types like `double` -which have contructors taking literal decimal values like 3.14, -and also multiprecision and other User-defined Types that only provide full-precision construction +which have contructors taking literal decimal values like `3.14`, +[*and] also multiprecision and other User-defined Types that only provide full-precision construction from decimal digit strings like `"3.14"`. (Construction of multiprecision types from built-in floating-point types -only provides the precision of the built-in type, like `double`). +only provides the precision of the built-in type, like `double`, only 17 decimal digits). + +[tip Be exceeding careful not to silently lose precision by constructing multiprecision types from literal decimal types, usually [^double].] Fukushima used 20 series terms and it was confirmed that using more terms does not usefully increase accuracy. - -[h4:precision Controlling the compromise between Precision and Speed] - -To allow users more control, this implementation provides the best possible accuracy by default, -(Boost.Math generally prefers accuracy over speed) -but will return at intermediate stages if the precision specified in the policy has been met, -usually at least halving the execution time. - -It is convenient to define some `using` statements when using __policy_section to control precision. - - using boost::math::policies::policy; - using boost::math::policies::precision; - using boost::math::policies::digits2; // Precision as bits. - using boost::math::policies::digits10; // Precision as decimal digits. - -[tip Because some macros and metaprogramming are used by the implementation of policies, -some ways of expressing these items may confuse the compiler and Visual Studio Intellisense.] - -Precision targets can be specified in bits using `digits2` or decimal using `digits10`. -These are related by digits10 = log10(2) * digits2 where log10(2) = 0.30103. -Specifying `digits10` is a coarser measure and is roughly a third of `digits2`, -but may be slightly more intuitive than specifying precision in bits. - -[import ../../example/lambert_w_precision_example.cpp] - -[lambert_w_precision_1] -[lambert_w_precision_output_1] - -For examples of controlling precision, see [@../../include/boost/math/example/lambert_w_precision.cpp lambert_w_precision.cpp]. - -The implementation details are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] - -[h5:diagnostics Diagnostics Macros] - -Several macros are provided to output diagnostic information (potentially [*much] output). -These can be statements like `#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` [*before] a statement -`#include `, -or on the project compile command line `/DBOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` , -or in a jamfile.v2 `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` - -BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES -BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // lambert_w_singularity_series -BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. -BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. -BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. -BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show result of estimates where z is near singularity where branchs meet. -BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show result of estimates where small z is near zero. - - [h5 Other implementations] The Lambert W has also been discussed in a [@http://lists.boost.org/Archives/boost/2016/09/230819.php Boost thread]. -This also gives link to a prototype version by which also handles complex results [^(x < -exp(-1)], about -0.367879). +This also gives link to a prototype version by which also gives complex results [^(x < -exp(-1)], about -0.367879). [@https://github.com/CzB404/lambert_w/ Balazs Cziraki 2016] Physicist, PhD student at Eotvos Lorand University, ELTE TTK Institute of Physics, Budapest. -has also produces a prototype C++ library that can compute the Lambert W function for floating point +has also produced a prototype C++ library that can compute the Lambert W function for floating point [*and complex number types]. This is not implemented here but might be completed in the future. - [h4:acknowledgements Acknowledgements] * Thanks to Wolfram for use of their invaluable online Wolfram Alpha service. * Thanks for Mark Chapman for performing offline Wolfram computations. - [h4:references References] # NIST Digital Library of Mathematical Functions. [@http://dlmf.nist.gov/4.13.F1]. @@ -310,6 +408,7 @@ ACM Transactions on Mathematical Software, Volume 21, Number 2, June 1995, pages BISECT approximates the W function using bisection (GNU licence). Original FORTRAN77 version by Andrew Barry, S. J. Barry, Patricia Culligan-Hensley, this version by C++ version by John Burkardt. + # [@https://people.sc.fsu.edu/~jburkardt/f_src/toms743/toms743.html TOMS743] Fortran 90 (updated 2014). Initial guesses based on: @@ -322,8 +421,6 @@ W-function. Mathematics and Computers in Simulation, 53(1), 95-103 (2000). F. Stagnitti. Erratum to analytical approximations for real values of the Lambert W-function. Mathematics and Computers in Simulation, 59(6):543-543, 2002. -A PDF of the full [@http://www.paper.edu.cn/scholar/downpaper/liling116674-201210-19 paper] is available. - # C++ __CUDA version of Luu algorithm, [@https://github.com/thomasluu/plog/blob/master/plog.cu plog]. # __Luu_thesis, see routine 11, page 98 for Lambert W algorithm. diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index e84c8c9e2..178e35c45 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -15,9 +15,8 @@ and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si based on the algorithm and a FORTRAN version of Toshio Fukushima. Some macros that will show some (or much) diagnostic values if #defined. -#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_INTEGRAL -#define -able macros +#define-able macros BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // lambert_w_singularity_series BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. @@ -27,8 +26,9 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. -BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES -BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS +BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of series for small z. +#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from lookup table. */ //#ifndef BOOST_MATH_SF_LAMBERT_W_HPP @@ -968,12 +968,11 @@ if (diff == 0) // Exact result - common. } } // z < -0.35 // z < -1/e - else // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Schroeder (and Halley). + else // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Bisection and Schroeder (and Halley). { /////////////////////////////////////////////////////////// - // TODO take this table out as a templated function, - // so that can see effect of choice of T. + // TODO take this table out as a templated function, to avoid multithread init problems. // (Would like to avoid initializing table of static data? // but cannot avoid - always computed at load time). // See Fukushima section 2.2, page 81. @@ -982,7 +981,7 @@ if (diff == 0) // Exact result - common. static T e[66]; // lambert_w[k] for W-1 branch. 2.718 1 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 static T g[65]; // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29 // Defining lookup table sqrts of 1/e. - static T a[12]; // 0.6065 0.7788 ... 0.9997 sqrt of previous elements. + static T a[12]; // 0.6065 0.7788 ... 0.9997, sqrt of previous elements. static T b[12]; // 0.5 0.25 0.125 ... 0.0002441, Half of previous element. if (!e[0]) @@ -1054,7 +1053,7 @@ if (diff == 0) // Exact result - common. // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch. // Since z is probably quite small, start with lowest (n = 0). - int n; // indexing W0 lookup table g of z + int n; // Indexing W0 lookup table g of z. for (n = 0; n <= 2; ++n) { // Try 1st few. if (g[n] > z) @@ -1099,7 +1098,9 @@ if (diff == 0) // Exact result - common. bisect: --n; // g[n] is nearest below, so n is integer value of W, and - // g[n+1] is upper integral value. These are used to start bisection. + // g[n+1] is upper integral value. These are used as initial values for bisection. + + // typedef typename policies::precision::type prec; //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. @@ -1112,18 +1113,18 @@ if (diff == 0) // Exact result - common. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 int d10 = policies::digits_base10(); // policy template parameter digits10 std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 - //<< ", epsilon " << epsilon << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP + std::cout << "Result lookup W(" << z << ") bisection between g[" << n - 1 << "] = " << g[n - 1] << " and g[" << n << "] = " << g[n] + << ", bisect mean = " << (g[n - 1] + g[n]) / 2 << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP + if (d2 <= 7) { // Only 7 binary digits precision required to hold integer size of g[65], // so just return the mean of two nearby integral values. // This is a *very* approximate estimate, and perhaps not very useful? -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_INTEGRALS - std::cout << "Result Integer W(" << z << ") bisection between g[" << n - 1 << "] = " << g[n - 1] << " and g[" << n << "] = " << g[n] - << ", bisect mean = " << (g[n - 1] + g[n]) / 2 << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_INTEGRALS return static_cast((g[n - 1] + g[n]) / 2); } // Compute the number of bisections (jmax) that ensure that result is close enough that From dd06d2beae5ca4f37d48828737ff23e69a55bff4 Mon Sep 17 00:00:00 2001 From: pabristow Date: Tue, 10 Oct 2017 15:13:49 +0100 Subject: [PATCH 16/71] 100 decimal digit precision values and tests OK. --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 2 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 2 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 30 + example/lambert_w_precision_example.cpp | 1009 +++++++++++++++++ example/lambert_w_simple_examples.cpp | 232 ++++ .../math/special_functions/lambert_w.hpp | 6 +- test/lambert_w_high_reference_values.cpp | 182 +++ test/lambert_w_high_reference_values.ipp | 933 +++++++++++++++ test/lambert_w_low_reference_values.cpp | 237 ++++ test/lambert_w_low_reference_values.ipp | 236 ++++ test/test_lambert_w.cpp | 171 ++- test/test_lambert_w0_precision_high.cpp | 358 ++++++ test/test_lambert_w0_precision_low.cpp | 387 +++++++ test/test_value.hpp | 120 ++ 20 files changed, 3819 insertions(+), 98 deletions(-) create mode 100644 example/lambert_w_precision_example.cpp create mode 100644 example/lambert_w_simple_examples.cpp create mode 100644 test/lambert_w_high_reference_values.cpp create mode 100644 test/lambert_w_high_reference_values.ipp create mode 100644 test/lambert_w_low_reference_values.cpp create mode 100644 test/lambert_w_low_reference_values.ipp create mode 100644 test/test_lambert_w0_precision_high.cpp create mode 100644 test/test_lambert_w0_precision_low.cpp create mode 100644 test/test_value.hpp diff --git a/doc/html/index.html b/doc/html/index.html index 213ebbef0..ab4cb0b7d 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        • Last revised: October 03, 2017 at 12:08:08 GMT

        Last revised: October 10, 2017 at 14:01:12 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 21c7d2b8a..bb0d7a41a 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 223aba7a5..d3fa7c973 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index d0b4075cd..90073b6f9 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index e9ab43d03..1b76863d8 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 1518a165d..b84430d40 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index 67528cb82..b63b41239 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 7821e5f82..fa6234915 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index e208840c9..bf4824bf1 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -377,6 +377,36 @@ only provides the precision of the built-in type, like `double`, only 17 decimal Fukushima used 20 series terms and it was confirmed that using more terms does not usefully increase accuracy. +[h4:testing Testing] + +Initial testing of the algorithm was done using a small number of spot tests. + +After it was established that the underlying algorithm (including unlimited Halley refinements with a tight terminating criterion) was correct, +some tables of Lambert W values were computed using a 100 decimal digit precision __multiprecision `cpp_dec_float_100` type and saved as +a C++ program that will initialise arrays of values of z arguments and lambert_W0 (`lambert_w_mp_high_values.ipp` and `lambert_w_mp_low_values.ipp` ). + +(A few of these pairs were checked against values computed by Wolfram Alpha to try to guard against mistakes; +all those tested agreed to the penultimate decimal place, so they can be considered reliable to at least 98 decimal digits precision). + +A macro `BOOST_MATH_TEST_VALUE` was used to allow tests with any real type, both __fundamental_types and __multiprecision. +(This is necessary because __fundamental_types have a constructor from floating-point literals like 3.1459F, 3.1459 or 3.1459L +whereas __multiprecision types may lose precision unless constructed from decimal digits strings like "3.1459"). + +The 100-decimal digits precision pairs were then used to assess the precision of less-precise types, including +__multiprecision `cpp_bin_float_quad` and `cpp_bin_float_50`. `static_cast`ing from the high precision types should +give the closest representable value of the less-precise type; this is then be used to assess the precision of +the Lambert W algorithm. For __fundamental_types, the precision requirement set by the __Policy mean that the algorithm +may stop refinement after bisection, or Schroeder or Halley refinements. + +With the default __Policy, that includes iterative Halley refinement, tests confirm that over nearly all the range of z arguments, +nearly all estimates are the nearest __representable value, a minority are within 1 __ulp and only a very few 2 ULP. + +For the range of z arguments over the range -0.35 to 0.5, a different algorithm is used, but the same +technique of evaluating reference values using a __multiprecision `cpp_dec_float_100` was used. +For extremely small z arguments, near zero, and those extremely near the singularity at the branch point, +precision can be much lower, as might be expected. + + [h5 Other implementations] The Lambert W has also been discussed in a [@http://lists.boost.org/Archives/boost/2016/09/230819.php Boost thread]. diff --git a/example/lambert_w_precision_example.cpp b/example/lambert_w_precision_example.cpp new file mode 100644 index 000000000..58a0ddf37 --- /dev/null +++ b/example/lambert_w_precision_example.cpp @@ -0,0 +1,1009 @@ +// Copyright Paul A. Bristow 2016. + +// 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). + +//! Lambert W examples of controlling precision using Boost.Math policies +//! (and thus also trading less precision for shorter run time). + +// #define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for (much) diagnostic output. + +#include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ... +#include // for BOOST_MSVC versions. +#include +#include // boost::exception +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. +#include + +// Built-in/fundamental GCC float128 or Intel Quad 128-bit type, if available. +#ifdef __GNUC__ +#include // Not available for MSVC. +// sets BOOST_MP_USE_FLOAT128 for GCC +using boost::multiprecision::float128; +#endif //# NOT _MSC_VER + +#include // boost::multiprecision::cpp_dec_float_50 +using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. +using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. + +#include +using boost::multiprecision::cpp_bin_float_double_extended; +using boost::multiprecision::cpp_bin_float_double; +using boost::multiprecision::cpp_bin_float_quad; + + +// For lambert_w function. +#include + +#include +// using std::cout; +// using std::endl; +#include +#include +#include +#include // For std::numeric_limits. + +int main() +{ + try + { + std::cout << "Lambert W examples of precision control." << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << std::showpoint << std::endl; // Show any trailing zeros. + + using boost::math::constants::exp_minus_one; + + using boost::math::lambert_w0; + using boost::math::lambert_wm1; + + // Error handling policy examples. + using namespace boost::math::policies; + + using boost::math::policies::make_policy; + using boost::math::policies::policy; + 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::throw_on_error; + + // Define an error handling policy: + // typedef policy< + // domain_error, + // overflow_error + // > throw_policy; + + //float x = 0.3F; + // std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.00990147 + // std::cout << "\nLambert W (" << x << ") = " << lambert_w0(x, throw_policy()) << std::endl; + // std::cout << "Lambert W (" << x << ") = " << lambert_w(x, throw_policy()) << std::endl; + + // Examples of controlling precision using policies. + using boost::math::policies::policy; + using boost::math::policies::precision; + using boost::math::policies::digits10; + using boost::math::policies::digits2; + + // Creating a policy using an integer literal. + // typedef policy > my_pol_3_dec; // Define a new, non-default, policy to calculate to accuracy of approximately 3 decimal digits. + + // Creating a policy using an integer variable (must be const integral, usually const int !). + // "a variable with non-static storage duration cannot be used as a non-type argument" + + // typedef policy > my_pol_3_dec; + // Define a new, non-default, policy to calculate to accuracy of approximately 3 decimal digits. + const int decimal_digits = 3; + typedef policy > my_pol_3_dec; // Define a custom, non-default, policy to calculate to accuracy of approximately 3 decimal digits. + + std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; + + std::cout.precision(std::numeric_limits::max_digits10); + double x = 1.; + std::cout << "lambert_w0(x, my_pol_3_dec()) = " << lambert_w0(x, my_pol_3_dec()) <<"\n" << std::endl; // = 0.56714329040978395 + + // Can also specify precision using bits, for example: + typedef policy > my_prec_11_bits; // Policy to require only approximately 11 bits of precision. + + std::cout << "lambert_w0(x, my_prec_11_bits()) = " << lambert_w0(x, my_prec_11_bits()) <<"\n" << std::endl; // 0.56714329040978395 + + { // Show various precisions that show varying improvements. + // Specify precision as n bits, base-2, policy >() + + std::cout << std::setprecision(3) + << "\nstd::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() + << "\nstd::numeric_limits::digits = " << std::numeric_limits::digits + << "\nstd::numeric_limits::digits10 = " << std::numeric_limits::digits10 + << "\nstd::numeric_limits::max_digits10 = " << std::numeric_limits::max_digits10 + << std::endl; + +////[lambert_w_precision_0 +// float z(10.F); +// float r = 0; +// std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant decimal digits. +// std::cout << std::showpoint << std::endl; // Show any trailing zeros. +// +// r = lambert_w0(z, policy >()); // +// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.000000000 (nearest using lookup). +// +// r = lambert_w0(z, policy >()); // // Just using bisection. +// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.566406250 (nearest using bisection). +// +// r = lambert_w0(z, policy >()); // digits10 = 6, digits2 = 22 - so just using Schroeder refinement. +// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.567143261 +// +// // Can also specify precision as decimal base-10 digits using policy >(). +// r = lambert_w0(z, policy >()); // digits10 = 5, digits2 = 22 Using Schroeder. +// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.567143261 +// +// r = lambert_w0(z, policy >()); // digits10 = 7, digits2 = 23 - so using Halley as well (but no improvement). +// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.567143261 +// +// r = lambert_w0(z, policy<>()); // Default policy (using lookup, bisection, Schroeder, and Halley). +// std::cout << "lambert_w0(z, policy<>()) = " << r << std::endl; // 0.567143261 +// +////] [/lambert_w_precision_0] + +/* +//[lambert_w_precision_output_0 + lambert_w0(z, policy >()) = 0.000000000 // Nearby integer is zero from lookup table. + lambert_w0(z, policy >()) = 0.566406250 // Just using bisection from lookup integral values. + lambert_w0(z, policy >()) = 0.567143261 // digits10 = 6, digits2 = 22 - so using Schroeder refinement. + lambert_w0(z, policy >()) = 0.567143261 // digits10 = 5, digits2 = 19 Using Schroeder. + lambert_w0(z, policy >()) = 0.567143261 // digits10 = 7, digits2 = 23 - so using Halley as well (but no improvement). + lambert_w0(z, policy<>()) = 0.567143261 +//] [/lambert_w_precision_output_0] +*/ + + } + + { +//[lambert_w_precision_1 + // Test evaluation of Lambert W at varying precisions specified using a policy with digits10 increasing from 1 to 9. + // For float this covers the full precision range as max_digits10 = 9. + float z = 10.F; + std::cout << "\nTest evaluation of float Lambert W (" << z << ") at varying precisions" + "\nspecified using a policy with digits10 increasing from 1 to 9. " + << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + + std::cout << "Lambert W (" << z << ", digits10<0>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<1>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<2>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<3>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<4>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<5>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<6>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<7>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<8>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits10<9>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; +//] [/lambert_w_precision_1] + + /* +//[lambert_w_precision_output_1 + Test evaluation of float Lambert W at varying precisions + specified using a policy with digits10 increasing from 1 to 9. + std::numeric_limits::epsilon() = 1.19e-07 + z = 1.F - note that gets to 'exact' result immediately using Schroeder refinement, + so no advantage using Halley. + + Lambert W (1.00000000, digits10<1>) = 0.000000000 << using lookup. + Lambert W (1.00000000, digits10<2>) = 0.000000000 << using lookup and bisection. + Lambert W (1.00000000, digits10<3>) = 0.567143261 << Schroeder refinement, and is sufficient. + Lambert W (1.00000000, digits10<4>) = 0.567143261 + Lambert W (1.00000000, digits10<5>) = 0.567143261 << Halley refinement, but no improvement. + Lambert W (1.00000000, digits10<6>) = 0.567143261 + Lambert W (1.00000000, digits10<7>) = 0.567143261 + Lambert W (1.00000000, digits10<8>) = 0.567143261 + Lambert W (1.00000000, digits10<9>) = 0.567143261 + Lambert W (1.00000000) = 0.567143261 + + z = 10.F needs Halley to get the last bit or two correct. + Lambert W (10.0000000, digits10<1>) = 1.35914087 << bisection. + Lambert W (10.0000000, digits10<2>) = 1.35914087 + Lambert W (10.0000000, digits10<3>) = 1.74552798 << Schroeder refinement. + Lambert W (10.0000000, digits10<4>) = 1.74552798 + Lambert W (10.0000000, digits10<5>) = 1.74552798 + Lambert W (10.0000000, digits10<6>) = 1.74552810 << Halley refinement. + Lambert W (10.0000000, digits10<7>) = 1.74552810 + Lambert W (10.0000000, digits10<8>) = 1.74552810 + Lambert W (10.0000000, digits10<9>) = 1.74552810 + Lambert W (10.0000000) = 1.74552810 +//] [/lambert_w_precision_output_1] + */ + } + { // similar example using float but specifying with digits2 + + float z = 10.; + std::cout << "\nTest evaluation of float Lambert W (" << z << ") at varying precisions" + "\nspecified using a policy with (base_2) digits increasing from 1 to 24. " + << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::digits = " << std::numeric_limits::digits << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Lambert W (" << z << ", digits2<0> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<1> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<2> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<3> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<4> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<5> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<6> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<7> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<8> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<9> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<10>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<11>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<12>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<13>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<14>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<15>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<16>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<17>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<18>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<19>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<20>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<21>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<22>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<23>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<24>) = " << lambert_w0(z, policy >()) << std::endl; + + std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; // Default policy. + + /* This example shows a tiny improvement using Halley after Schroeder. + Lambert W (10.0000000, digits2<1>) = 1.35914087 + Lambert W (10.0000000, digits2<2>) = 1.35914087 + Lambert W (10.0000000, digits2<3>) = 1.35914087 + Lambert W (10.0000000, digits2<4>) = 1.35914087 + Lambert W (10.0000000, digits2<5>) = 1.35914087 + Lambert W (10.0000000, digits2<6>) = 1.35914087 + Lambert W (10.0000000, digits2<7>) = 1.35914087 + Lambert W (10.0000000, digits2<8>) = 1.35914087 + Lambert W (10.0000000, digits2<9>) = 1.35914087 + Lambert W (10.0000000, digits2<10>) = 1.74414063 << Schroeder + Lambert W (10.0000000, digits2<11>) = 1.74552798 + Lambert W (10.0000000, digits2<12>) = 1.74552798 + Lambert W (10.0000000, digits2<13>) = 1.74552798 + Lambert W (10.0000000, digits2<14>) = 1.74552798 + Lambert W (10.0000000, digits2<15>) = 1.74552798 + Lambert W (10.0000000, digits2<16>) = 1.74552798 + Lambert W (10.0000000, digits2<17>) = 1.74552798 + Lambert W (10.0000000, digits2<18>) = 1.74552798 + Lambert W (10.0000000, digits2<19>) = 1.74552798 + Lambert W (10.0000000, digits2<20>) = 1.74552798 + Lambert W (10.0000000, digits2<21>) = 1.74552798 + Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley + Lambert W (10.0000000, digits2<23>) = 1.74552810 + Lambert W (10.0000000, digits2<24>) = 1.74552810 + Lambert W (10.0000000) = 1.74552810 << default policy precision. + */ + } + + { // Similar example using double but specifying with digits2. + double z = 10.; + std::cout << "\nTest evaluation of double Lambert W (" << z << ") at varying precisions" + "\nspecified using a policy with (base_2) digits increasing from 1 to 54. " + << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::digits = " << std::numeric_limits::digits << std::endl; + + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Lambert W (" << z << ", digits2<1> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<2> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<3> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<4> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<5> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<6> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<7> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<8> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<9> ) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<10>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<11>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<12>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<13>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<14>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<15>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<16>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<17>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<18>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<19>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<20>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<21>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<22>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<23>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<24>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<25>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<26>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<27>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<28>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<29>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<30>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<31>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<32>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<33>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<34>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<35>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<36>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<37>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<38>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<39>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<40>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<41>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<42>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<43>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<44>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<45>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<46>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<47>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<48>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<49>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<50>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<51>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<52>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<53>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<54>) = " << lambert_w0(z, policy >()) << std::endl; + + std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; // Default policy. + + /* + Test evaluation of double Lambert W at varying precisions + specified using a policy with (base_2) digits increasing from 1 to 54. + std::numeric_limits::epsilon() = 2.22e-16 + Lambert W (10.000000000000000, digits2<1>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<2>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<3>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<4>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<5>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<6>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<7>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<8>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<9>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<10>) = 1.7441406250000000 + Lambert W (10.000000000000000, digits2<11>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<12>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<13>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<14>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<15>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<16>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<17>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<18>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<19>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<20>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<21>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<22>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<23>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<24>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<25>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<26>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<27>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<28>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<29>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<30>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<31>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<32>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<33>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<34>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<35>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<36>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<37>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<38>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<39>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<40>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<41>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<42>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<43>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<44>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<45>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<46>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<47>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<48>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<49>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<50>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<51>) = 1.7455280027406992 + Lambert W (10.000000000000000, digits2<52>) = 1.7455280027406992 + Lambert W (10.000000000000000, digits2<53>) = 1.7455280027406992 + Lambert W (10.000000000000000, digits2<54>) = 1.7455280027406992 + Lambert W (10.000000000000000) default = 1.7455280027406992 + + // cpp_dec_float_50 reference value: + lambert_w0(10.000000000000000) = 1.7455280027406993830743012648753899115352881290809 + + */ + } + { // Similar example using cpp_bin_float_quad (128-bit floating-point types). + // multiprecision type to show use of Schroeder double approximation before Halley refinement. + // Specifying precision with digits2 not digits10. + + cpp_bin_float_quad z = 10.; + std::cout << "\nTest evaluation of cpp_bin_float_quad Lambert W(" << z << ") at varying precisions" + "\nspecified using a policy with (base_2) digits increasing from 1 to 54. " + << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::digits = " << std::numeric_limits::digits << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::max_digits10 = " << std::numeric_limits::max_digits10 << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::digits10 = " << std::numeric_limits::digits10 << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Lambert W (" << z << ", digits2<1>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<2>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "..." << std::endl; + std::cout << "Lambert W (" << z << ", digits2<52>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<53>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ", digits2<54>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "..." << std::endl; + std::cout << "Lambert W (" << z << ", digits2<113>) = " << lambert_w0(z, policy >()) << std::endl; + std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; // Default policy. + // All are same precision because double precision first approximation used before Halley. + + /* + + Test evaluation of cpp_bin_float_quad Lambert W at varying precisions + specified using a policy with (base_2) digits increasing from 1 to 113. + std::numeric_limits::epsilon() = 1.93e-34 + Lambert W (10.00000000000000000000000000000000000, digits2<1>) = 1.745528002740699383074301264875390030 + Lambert W (10.00000000000000000000000000000000000, digits2<2>) = 1.745528002740699383074301264875390030 + ... + Lambert W (10.00000000000000000000000000000000000) default = 1.745528002740699383074301264875390030 + lambert_w0(z) cpp_dec_float_50 = 1.7455280027406993830743012648753899115352881290809 // For comparison. + + */ + } + + { // Reference value for lambert_w(1) + cpp_dec_float_50 z("10"); + cpp_dec_float_50 r; + std::cout.precision(std::numeric_limits::digits10); + r = lambert_w0(z); // Default policy. + std::cout << "lambert_w0(z) cpp_dec_float_50 = " << r << std::endl; // 0.56714329040978387299996866221035554975381578718651 + std::cout.precision(std::numeric_limits::max_digits10); + + std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (max_digits10(" << std::numeric_limits::max_digits10 << + " ) = " << static_cast(r) << std::endl; // 1.7455280027406993830743012648753899115352881290809 + std::cout.precision(std::numeric_limits::digits10); // 1.745528002740699383074301264875389837 + std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (digits10(" << std::numeric_limits::digits10 << + " ) = " << static_cast(r) << std::endl; // 1.74552800274069938307430126487539 + std::cout.precision(std::numeric_limits::digits10 +1); // + + std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (digits10(" << std::numeric_limits::digits10 << + " ) = " << static_cast(r) << std::endl; // 1.74552800274069938307430126487539 + + // [N[productlog[10], 50]] == 1.7455280027406993830743012648753899115352881290809 + + // [N[productlog[10], 37]] == 1.745528002740699383074301264875389912 + // [N[productlog[10], 34]] == 1.745528002740699383074301264875390 + // [N[productlog[10], 33]] == 1.74552800274069938307430126487539 + + // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.745528002740699383074301264875389837 + + // lambert_w0(z) cpp_dec_float_50 = 1.7455280027406993830743012648753899115352881290809 + // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.745528002740699383074301264875389837 + // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.74552800274069938307430126487539 + + + } + + + // Examples of values near singularity when only a final Halley refinement is available. + + //using boost::math::detail::lambert_w_singularity_series; + //std::cout << series(z) << std::endl; + + //std::cout << lambert_w_singularity_series(z) << std::endl; + + /* + 1> Lambert W example single spot tests! + 1> epsilon 2.2204460492503131e-16 + 1> digits2 53 + 1> digits10 15 + 1> digits () 53 + 1> Lambert W (0.29999999999999999) = 0.23675531078855933 + 1> epsilon 3.814697265625e-06 + 1> digits2 19 + 1> digits10 5 + 1> digits () 53 + 1> Lambert W (0.29999999999999999) = 0.2367553107885593 + + + for (double xd = 0.001; xd < 1e20; xd *= 10) + { + + // 1. 0.56714329040978387 + // 0.56714329040978384 + + // 10 1.7455280027406994 + // 1.7455280027406994 + + // 100 3.3856301402900502 + // 3.3856301402900502 + // 1000 5.2496028524015959 + // 5.249602852401596227126056319697306282521472386059592844451465483991362228320942832739693150854347718 + + // 1e19 40.058769161984308 + // 40.05876916198431163898797971203180915622644925765346546858291325452428038208071849105889199253335063 + std::cout << "Lambert W (" << xd << ") = " << lambert_w(xd) << std::endl; // + + + 1> Iteration #0, w0 0.0099072820916067030, w1 = 0.0099014738435951096, difference = -5.8082480115934088e-06, relative 0.00058660438873459064, float distance = 3415046080725.0000 + 1> f'(x) = 5.8082144415180436e-06, f''(x) = -5.8082480115936214e-06 + 1> Iteration #1, w0 0.0099014738435951096, w1 = 0.0099014738435950107, difference = -9.8879238130678004e-17, relative 9.9920072216264089e-15, float distance = 58.000000000000000 + 1> f'(x) = 9.8645911007260505e-17, f''(x) = -9.8645911007260505e-17 + 1> Iteration #2, w0 0.0099014738435950107, w1 = 0.0099014738435950125, difference = 1.7347234759768071e-18, relative -2.2204460492503131e-16, float distance = 1.0000000000000000 + 1> f'(x) = -1.7007915690906991e-18, f''(x) = 1.7007915690906991e-18 + 1> + 1> Return refined 0.0099014738435950125 after 3 iterations, difference = -2.2204460492503131e-16, Float distance = 1.0000000000000000 + 1> Lambert W (0.010000000000000000) = 0.0099014738435950125 + + + 1> Iteration #0, w0 0.091722597168998055, w1 = 0.091276527200431806, difference = -0.00044606996856624836, relative 0.0048870173115453941, float distance = 38445375960087.000 + 1> f'(x) = 0.00044587943029702348, f''(x) = -0.00044606996856624685 + 1> Iteration #1, w0 0.091276527200431806, w1 = 0.091276527160862264, difference = -3.9569542087392051e-11, relative 4.3351278122827352e-10, float distance = 3408918.0000000000 + 1> f'(x) = 3.9569548190331561e-11, f''(x) = -3.9569548191831827e-11 + 1> Iteration #2, w0 0.091276527160862264, w1 = 0.091276527160862264, exact. + 1> f'(x) = 0.00000000000000000, f''(x) = -0.00000000000000000 + 1> + + + 1> Iteration #0, w0 0.87095897919507137, w1 = 0.85260701286390628, difference = -0.018351966331165093, relative 0.021524531295515459, float distance = 182161642476426.00 + 1> f'(x) = 0.018097151008287501, f''(x) = -0.018351966331165141 + 1> Iteration #1, w0 0.85260701286390628, w1 = 0.85260550201372554, difference = -1.5108501807414854e-06, relative 1.7720389760000899e-06, float distance = 14784835581.000000 + 1> f'(x) = 1.5108484233744529e-06, f''(x) = -1.5108501807757508e-06 + 1> Iteration #2, w0 0.85260550201372554, w1 = 0.85260550201372554, exact. + 1> f'(x) = 0.00000000000000000, f''(x) = -0.00000000000000000 + 1> + 1> Return refined 0.85260550201372554 after 3 iterations, exact. + 1> Lambert W (2.0000000000000000) = 0.85260550201372554 + + 1> Iteration #0, w0 0.87095897919507137, w1 = 0.85260701286390628, difference = -0.018351966331165093, relative 0.021524531295515459, float distance = 182161642476426.00 + 1> f'(x) = 0.018097151008287501, f''(x) = -0.018351966331165141 + 1> Iteration #1, w0 0.85260701286390628, w1 = 0.85260550201372554, difference = -1.5108501807414854e-06, relative 1.7720389760000899e-06, float distance = 14784835581.000000 + 1> f'(x) = 1.5108484233744529e-06, f''(x) = -1.5108501807757508e-06 + 1> Iteration #2, w0 0.85260550201372554, w1 = 0.85260550201372554, exact. + 1> f'(x) = 0.00000000000000000, f''(x) = -0.00000000000000000 + 1> + 1> Return refined 0.85260550201372554 after 3 iterations, exact. + 1> Lambert W (2.0000000000000000) = 0.85260550201372554 + + } + */ + + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} // int main() + + /* + BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.01)), + BOOST_MATH_TEST_VALUE(RealType, 0.0099014738435950118853363268165701079536277464949174), + // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50]) + tolerance * 25); // <<< Needs a much bigger tolerance??? + // 0.0099014738435951096 this test max_digits10 + // 0.00990147384359511 digits10 + // 0.0099014738435950118 wolfram + // 0.00990147384359501 wolfram digits10 + // 0.0099014738435950119 N[lambert_w[0.01],17] + // 0.00990147384359501 N[lambert_w[0.01],15] which really is more different than expected. + + // 0.00990728209160670 approx + // 0.00990147384359511 previous + + after allowing iterations, get the Wolfram result + + x = 0.0100000000000000, 1st approximation = 0.00990728209160670 + 1> Iteration #0, w0 0.00990728209160670, w1 = 0.00990147384359511, difference = 0.000586604388734591, relative 0.000586604388734591 + 1> f'(x) = 5.80821444151804e-06, f''(x) = -5.80824801159362e-06 + 1> Iteration #1, w0 0.00990147384359511, w1 = 0.00990147384359501, difference = 9.99200722162641e-15, relative 9.99200722162641e-15 + 1> f'(x) = 9.86459110072605e-17, f''(x) = -9.86459110072605e-17 + 1> Iteration #2, w0 0.00990147384359501, w1 = 0.00990147384359501, difference = -2.22044604925031e-16, relative -2.22044604925031e-16 + 1> f'(x) = -1.70079156909070e-18, f''(x) = 1.70079156909070e-18 + 1> Estimate 0.00990147384359501 refined after 2 iterations. + 1> Exact. + 1> Lambert W (0.0100000000000000) = 0.00990147384359501 + + + using float_distance < 2 + + x = 0.0100000000000000, 1st approximation = 0.00990728209160670 + 1> Iteration #0, w0 0.00990728209160670, w1 = 0.00990147384359511, difference = 0.000586604388734591, relative 0.000586604388734591 + 1> f'(x) = 5.80821444151804e-06, f''(x) = -5.80824801159362e-06 + 1> Iteration #1, w0 0.00990147384359511, w1 = 0.00990147384359501, difference = 9.99200722162641e-15, relative 9.99200722162641e-15 + 1> f'(x) = 9.86459110072605e-17, f''(x) = -9.86459110072605e-17 + 1> Estimate 0.00990147384359501 refined after 1 iterations. + 1> diff = -1.73472347597681e-18, relative 0.000000000000000 + 1> Lambert W (0.0100000000000000) = 0.00990147384359501 + */ + + /* + + Output: + + 1> Lambert W example single spot tests! + 1> epsilon 0.03125 + 1> Lambert W (0.300000012, digits10<1>) = 0.239290372 + + 1> epsilon 0.00390625 + 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 + 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 + + 1> Lambert W (0.300000012, digits10<2>) = 0.236755311 + 1> epsilon 0.000244140625 + 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 + 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 + + 1> Lambert W (0.300000012, digits10<3>) = 0.236755311 + 1> epsilon 3.05175781e-05 + 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 + 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 + + 1> Lambert W (0.300000012, digits10<4>) = 0.236755311 + 1> epsilon 3.81469727e-06 + 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 + 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 + 1> Iteration #2, w0 0.236755311, w1 = 0.236755326, difference = 1.49011612e-08, relative -5.96046448e-08, float distance = 1 + 1> f'(x) = -1.90171221e-08, f''(x) = 1.90171221e-08 + 1> + 1> Return refined 0.236755326 after 2 iterations, difference = -5.96046448e-08, Float distance = 1 + + 1> Lambert W (0.300000012, digits10<5>) = 0.236755326 + 1> epsilon 2.38418579e-07 + 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 + 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 + 1> Iteration #2, w0 0.236755311, w1 = 0.236755326, difference = 1.49011612e-08, relative -5.96046448e-08, float distance = 1 + 1> f'(x) = -1.90171221e-08, f''(x) = 1.90171221e-08 + 1> + 1> Return refined 0.236755326 after 2 iterations, difference = -5.96046448e-08, Float distance = 1 + + 1> Lambert W (0.300000012, digits10<6>) = 0.236755326 + 1> epsilon 1.1920929e-07 + + 1> Lambert W (0.300000012, digits10<7>) = 0.239290372 + 1> epsilon 1.1920929e-07 + + 1> Lambert W (0.300000012, digits10<8>) = 0.239290372 + 1> epsilon 1.1920929e-07 + + 1> Lambert W (0.300000012, digits10<9>) = 0.239290372 + */ + + + /* + 1> std::numeric_limits::epsilon() = 1.19209290e-07 + 1> Lambert_w argument = 10.0000000 + 1> Argument Type = float + 1> digits10 = 1, digits2 = 5 + 1> Result Integer W between g[0] = 0.000000000 < 10.0000000 < 2.71828175 = g[1], bisect 1.35914087 + 1> + 1> Lambert_w argument = 10.0000000 + 1> Argument Type = float + 1> digits10 = 3, digits2 = 10 + 1> Result Bisection = 1.74414063 + 1> + 1> Lambert_w argument = 10.0000000 + 1> Argument Type = float + 1> digits10 = 6, digits2 = 22 + 1> Result Schroeder refinement = 1.74552798 + 1> + 1> Lambert_w argument = 10.0000000 + 1> Argument Type = float + 1> digits10 = 6, digits2 = 23 + 1> Result Halley refinement = 1.74552810 + 1> + 1> Lambert_w argument = 10.0000000 + 1> Argument Type = float + 1> digits10 = 7, digits2 = 24 + 1> Result Halley refinement = 1.74552810 + + 1> + 1> std::numeric_limits::epsilon() = 1.19209290e-07 + 1> Lambert_w argument = 10.000000000000000 + 1> Argument Type = double + 1> digits10 = 1, digits2 = 5 + 1> Result Integer W bisection between g[0] = 0.00000000000000000 < 10.000000000000000 < 2.7182818284590451 = g[1], bisect 1.3591409142295225 + 1> + 1> Lambert_w argument = 10.000000000000000 + 1> Argument Type = double + 1> digits10 = 3, digits2 = 10 + 1> Result Bisection = 1.7441406250000000 + 1> + 1> Lambert_w argument = 10.000000000000000 + 1> Argument Type = double + 1> digits10 = 6, digits2 = 22 + 1> Result Schroeder refinement = 1.7455280027406996 + 1> + 1> Lambert_w argument = 10.000000000000000 + 1> Argument Type = double + 1> digits10 = 6, digits2 = 23 + 1> Result Halley refinement = 1.7455280027406994 + 1> + 1> Lambert_w argument = 10.000000000000000 + 1> Argument Type = double + 1> digits10 = 15, digits2 = 53 + 1> Result Halley refinement = 1.7455280027406994 + + Codeblocks long double + + Lambert W example single spot tests! + + std::numeric_limits::epsilon() = 1.19209290e-007 + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 1, digits2 = 5 + Result Integer W bisection between g[0] = 0.00000000000000000000 < 10.0000000000000000000 < 2.71828182845904523543 = g[1], + bisect = 1.35914091422952261771 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 3, digits2 = 10 + Result Bisection = 1.74414062500000000000 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 6, digits2 = 22 + Result Schroeder refinement = 1.74552800274069937864 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 6, digits2 = 23 + Result Halley refinement = 1.74552800274069938309 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 19, digits2 = 64 + Result Halley refinement = 1.74552800274069938309 + + + Process returned 0 (0x0) execution time : 0.079 s + Press any key to continue. + + + After Halley reordering + + Lambert W example single spot tests! + + std::numeric_limits::epsilon() = 1.19209290e-007 + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 2, digits2 = 9 + Result Integer W bisection between g[0] = 0.00000000000000000000 < 10.0000000000000000000 < 2.71828182845904523543 = g[1], + bisect mean = 1.35914091422952261771 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 3, digits2 = 10 + Result Bisection = 1.74414062500000000000 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 6, digits2 = 21 + Result Schroeder refinement = 1.74552800274069937864 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 5, digits2 = 19 + Result Schroeder refinement = 1.74552800274069937864 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 6, digits2 = 23 + Result Schroeder refinement = 1.74552800274069937864 + + Lambert_w argument = 10.0000000000000000000 + Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 + digits10 = 19, digits2 = 64 + w = 1.74552800274069937864, z = 10.0000000000000000000, exp(w) = 5.72892556538694148333, diff = -6.93889390390722837765e-017 + 1 Halley iterations. + Distance = 41 + Result Halley refinement = 1.74552800274069938309 + + + Process returned 0 (0x0) execution time : 0.070 s + Press any key to continue. + + + 14 Aug 2017 using merged #include + + lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Release\lambert_w_pb_precision.exe + + lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Release\lambert_w_pb_precision.exe + lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Release\lambert_w_pb_precision.pdb (Full PDB) + Lambert W examples of precision control. + + std::numeric_limits::epsilon() = 2.22e-16 + lambert_w0(x, my_pol_3_dec()) = 0.567 + + lambert_w0(x, my_prec_10_bits()) = 0.566 + + lambert_w0(z, policy >()) = 0.000 + lambert_w0(z, policy >()) = 0.566 + lambert_w0(z, policy >()) = 0.567 + lambert_w0(z, policy >()) = 0.567 + lambert_w0(z, policy >()) = 0.567 + + Test evaluation of float Lambert W at varying precisions specified using a policy with digits10 increasing from 1 to 9. + std::numeric_limits::epsilon() = 1.19e-07 + Lambert W (10.0000000, digits10<1>) = 1.35914087 + Lambert W (10.0000000, digits10<2>) = 1.35914087 + Lambert W (10.0000000, digits10<3>) = 1.74552798 + Lambert W (10.0000000, digits10<4>) = 1.74552798 + Lambert W (10.0000000, digits10<5>) = 1.74552798 + Lambert W (10.0000000, digits10<6>) = 1.74552810 + Lambert W (10.0000000, digits10<7>) = 1.74552810 + Lambert W (10.0000000, digits10<8>) = 1.74552810 + Lambert W (10.0000000, digits10<9>) = 1.74552810 + Lambert W (10.0000000) = 1.74552810 + + Test evaluation of double Lambert W at varying precisions specified using a policy with digits10 increasing from 1 to 24. + std::numeric_limits::epsilon() = 2.22e-16 + Lambert W (10.000000000000000, digits2<1>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<2>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<3>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<4>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<5>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<6>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<7>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<8>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<9>) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<10>) = 1.7441406250000000 + Lambert W (10.000000000000000, digits2<11>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<12>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<13>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<14>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<15>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<16>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<17>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<18>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<19>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<20>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<21>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<22>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<23>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<24>) = 1.7455280027406996 + Lambert W (10.000000000000000) = 1.7455280027406992 + lambert_w0(z) = 1.7455280027406993830743012648753899115352881290809 + + + 30 Aug 2017 + + lambert_w_pb_precision.cpp + lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Debug\lambert_w_pb_precision.exe + lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Debug\lambert_w_pb_precision.pdb (Partial PDB) + Lambert W examples of precision control. + + std::numeric_limits::epsilon() = 2.22e-16 + lambert_w0(x, my_pol_3_dec()) = 0.56714329040978395 + + lambert_w0(x, my_prec_11_bits()) = 0.56714329040978395 + + + std::numeric_limits::epsilon() = 1.19e-07 + std::numeric_limits::digits = 24 + std::numeric_limits::digits10 = 6 + std::numeric_limits::max_digits10 = 9 + lambert_w0(z, policy >()) = 0.000000000 + lambert_w0(z, policy >()) = 0.566406250 + lambert_w0(z, policy >()) = 0.567143261 + lambert_w0(z, policy >()) = 0.567143261 + lambert_w0(z, policy >()) = 0.567143261 + lambert_w0(z, policy<>()) = 0.567143261 + + Test evaluation of float Lambert W at varying precisions + specified using a policy with digits10 increasing from 1 to 9. + std::numeric_limits::epsilon() = 1.19e-07 + Lambert W (1.00000000, digits10<1>) = 0.000000000 + Lambert W (1.00000000, digits10<2>) = 0.000000000 + Lambert W (1.00000000, digits10<3>) = 0.567143261 + Lambert W (1.00000000, digits10<4>) = 0.567143261 + Lambert W (1.00000000, digits10<5>) = 0.567143261 + Lambert W (1.00000000, digits10<6>) = 0.567143261 + Lambert W (1.00000000, digits10<7>) = 0.567143261 + Lambert W (1.00000000, digits10<8>) = 0.567143261 + Lambert W (1.00000000, digits10<9>) = 0.567143261 + Lambert W (1.00000000) default = 0.567143261 + + Test evaluation of float Lambert W at varying precisions + specified using a policy with (base_2) digits increasing from 1 to 24. + std::numeric_limits::epsilon() = 1.19e-07 + Lambert W (10.0000000, digits2<1> ) = 1.35914087 + Lambert W (10.0000000, digits2<2> ) = 1.35914087 + Lambert W (10.0000000, digits2<3> ) = 1.35914087 + Lambert W (10.0000000, digits2<4> ) = 1.35914087 + Lambert W (10.0000000, digits2<5> ) = 1.35914087 + Lambert W (10.0000000, digits2<6> ) = 1.35914087 + Lambert W (10.0000000, digits2<7> ) = 1.35914087 + Lambert W (10.0000000, digits2<8> ) = 1.35914087 + Lambert W (10.0000000, digits2<9> ) = 1.35914087 + Lambert W (10.0000000, digits2<10>) = 1.74414063 + Lambert W (10.0000000, digits2<11>) = 1.74552798 + Lambert W (10.0000000, digits2<12>) = 1.74552798 + Lambert W (10.0000000, digits2<13>) = 1.74552798 + Lambert W (10.0000000, digits2<14>) = 1.74552798 + Lambert W (10.0000000, digits2<15>) = 1.74552798 + Lambert W (10.0000000, digits2<16>) = 1.74552798 + Lambert W (10.0000000, digits2<17>) = 1.74552798 + Lambert W (10.0000000, digits2<18>) = 1.74552798 + Lambert W (10.0000000, digits2<19>) = 1.74552798 + Lambert W (10.0000000, digits2<20>) = 1.74552798 + Lambert W (10.0000000, digits2<21>) = 1.74552798 + Lambert W (10.0000000, digits2<22>) = 1.74552810 + Lambert W (10.0000000, digits2<23>) = 1.74552810 + Lambert W (10.0000000, digits2<24>) = 1.74552810 + Lambert W (10.0000000) default = 1.74552810 + + Test evaluation of double Lambert W at varying precisions + specified using a policy with (base_2) digits increasing from 1 to 54. + std::numeric_limits::epsilon() = 2.22e-16 + Lambert W (10.000000000000000, digits2<1> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<2> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<3> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<4> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<5> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<6> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<7> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<8> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<9> ) = 1.3591409142295225 + Lambert W (10.000000000000000, digits2<10>) = 1.7441406250000000 + Lambert W (10.000000000000000, digits2<11>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<12>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<13>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<14>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<15>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<16>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<17>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<18>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<19>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<20>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<21>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<22>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<23>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<24>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<25>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<26>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<27>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<28>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<29>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<30>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<31>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<32>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<33>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<34>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<35>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<36>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<37>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<38>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<39>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<40>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<41>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<42>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<43>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<44>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<45>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<46>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<47>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<48>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<49>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<50>) = 1.7455280027406996 + Lambert W (10.000000000000000, digits2<51>) = 1.7455280027406994 + Lambert W (10.000000000000000, digits2<52>) = 1.7455280027406994 + Lambert W (10.000000000000000, digits2<53>) = 1.7455280027406992 + Lambert W (10.000000000000000, digits2<54>) = 1.7455280027406992 + Lambert W (10.000000000000000) default = 1.7455280027406992 + + Test evaluation of cpp_bin_float_quad Lambert W at varying precisions + specified using a policy with (base_2) digits increasing from 1 to 54. + std::numeric_limits::epsilon() = 1.93e-34 + Lambert W (10.00000000000000000000000000000000000, digits2<1> ) = 1.745528002740699383074301264875389837 + Lambert W (10.00000000000000000000000000000000000, digits2<2> ) = 1.745528002740699383074301264875389837 + ... + Lambert W (10.00000000000000000000000000000000000, digits2<52>) = 1.745528002740699383074301264875389837 + Lambert W (10.00000000000000000000000000000000000, digits2<53>) = 1.745528002740699383074301264875389837 + Lambert W (10.00000000000000000000000000000000000, digits2<54>) = 1.745528002740699383074301264875390030 + Lambert W (10.00000000000000000000000000000000000) default = 1.745528002740699383074301264875390030 + lambert_w0(z) cpp_dec_float_50 = 1.7455280027406993830743012648753899115352881290809 + + + + + */ + + diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp new file mode 100644 index 000000000..1d4b345f0 --- /dev/null +++ b/example/lambert_w_simple_examples.cpp @@ -0,0 +1,232 @@ +// Copyright Paul A. Bristow 2016, 2017. + +// 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). + +// Build and run a simple examples of Lambert W function. + +// Some macros that will show some(or much) diagnostic values if #defined. +//#define-able macros +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_Wm1 // W1 branch diagnostics. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of series for small z. +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from lookup table. + +#include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ... +#include // for BOOST_MSVC versions. +#include + +#include // boost::exception +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. +#include + +// Built-in/fundamental GCC float128 or Intel Quad 128-bit type, if available. +#ifdef __GNUC__ +#include // Not available for MSVC. +// sets BOOST_MP_USE_FLOAT128 for GCC +using boost::multiprecision::float128; +#endif //# __GNUC__ and NOT _MSC_VER + +#include // boost::multiprecision::cpp_dec_float_50 +using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. +using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. + +#include +using boost::multiprecision::cpp_bin_float_double; // == double +using boost::multiprecision::cpp_bin_float_double_extended; // 80-bit long double emulation. +using boost::multiprecision::cpp_bin_float_quad; // 128-bit quad precision. + +//[lambert_w_simple_examples_includes +#include // For lambert_w function. + +using boost::math::lambert_w0; +using boost::math::lambert_wm1; +//] //[/lambert_w_simple_examples_includes] + +#include +// using std::cout; +// using std::endl; +#include +#include +#include +#include // For std::numeric_limits. + +//! Show value of z to the full possibly-significant max_digits10 precision of type T. +template +void show_value(T z) +{ + std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10); // Save. + std::cout.precision(std::numeric_limits::max_digits10); // Show all posssibly significant digits. + std::ios::fmtflags flags(std::cout.flags()); + std::cout.setf(std::ios_base::showpoint); // Include any trailing zeros. + std::cout << z; + // Restore: + std::cout.precision(precision); + std::cout.flags(flags); +} // template void show_value(T z) + +int main() +{ + try + { + std::cout << "Lambert W simple examples." << std::endl; + + using boost::math::constants::exp_minus_one; // The branch point, a singularity. + + // using statements needed to change precision policy. + using boost::math::policies::policy; + using boost::math::policies::make_policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; + using boost::math::policies::digits10; + + // using statements needed for changing error handling policy. + using boost::math::policies::evaluation_error; + using boost::math::policies::domain_error; + using boost::math::policies::overflow_error; + using boost::math::policies::ignore_error; + using boost::math::policies::throw_on_error; + + //[lambert_w_simple_examples_0 + std::cout.precision(std::numeric_limits::max_digits10); // Show all potentially significant decimal digits. + std::cout << std::showpoint << std::endl; // Show trailing zeros too. + { + double z = 10.; + double r; + r = lambert_w0(z); // Default policy digits10 = 17, digits2 = 53 + std::cout << "lambert_w0(z) = " << r << std::endl; // lambert_w0(z) = 1.7455280027406992 + //] [/lambert_w_simple_examples_0] + + } + { + //[lambert_w_simple_examples_1 + // Other floating-point types can be used too. + // It is convenient to use function `show_value` + // to display all potentially significant decimal digits for the type. + float z = 10.F; + float r; + r = lambert_w0(z); // Default policy digits10 = 7, digits2 = 24 + std::cout << "lambert_w0("; + show_value(z); + std::cout << ") = "; show_value(r); + std::cout << std::endl; // lambert_w0(10.0000000) = 1.74552810 + //] //[/lambert_w_simple_examples_1] + } + { +//[lambert_w_simple_examples_2 + // Example of an integer argument to lambert_w, + // showing that an integer is correctly promoted to a double. + std::cout.precision(std::numeric_limits::max_digits10); + double r = lambert_w0(10); // int argument "10" that should be promoted to double argument. + std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406992 + double rp = lambert_w0(10, policy<>()); // int argument "10" that should be promoted to double argument, + // for simplicity using (default policy. + std::cout << "lambert_w0(10, policy<>()) = " << rp << std::endl; + // lambert_w0(10) = 1.7455280027406992 +//] //[/lambert_w_simple_examples_2] + } + { + //[lambert_w_simple_examples_3 + // Using multiprecision types to get much higher precision is painless. + cpp_dec_float_50 z("10"); // Note construction using a decimal digit string, not a double literal. + cpp_dec_float_50 r; + r = lambert_w0(z); + std::cout << "lambert_w0("; + show_value(z); + std::cout << ") = "; show_value(r); + std::cout << std::endl; + // lambert_w0(10.000000000000000000000000000000000000000000000000000000000000000000000000000000) = + // 1.7455280027406993830743012648753899115352881290809413313533156788409111570000000 + //] //[/lambert_w_simple_examples_3] + } + { + //[lambert_w_simple_examples_4 + // Using multiprecision types to get multiprecision precision wrong! + cpp_dec_float_50 z(0.9); // Will convert to double, losing precision beyond decimal place 17! + cpp_dec_float_50 r; + r = lambert_w0(z); + std::cout << "lambert_w0("; + show_value(z); + std::cout << ") = "; show_value(r); + std::cout << std::endl; + // lambert_w0(0.90000000000000002220446049250313080847263336181640625000000000000000000000000000) + // = 0.52983296563343442067798493880332411646762461354815017917592839379740431483218821 + std::cout << "lambert_w0(0.9) = " << lambert_w0(static_cast(z)) // 0.52983296563343441 + << std::endl; + //] //[/lambert_w_simple_examples_4] + } + { + //[lambert_w_simple_examples_4a + // Using multiprecision types to get multiprecision precision right! + cpp_dec_float_50 z("0.9"); // Construct from decimal digit string. + cpp_dec_float_50 r; + r = lambert_w0(z); + std::cout << "lambert_w0("; + show_value(z); + std::cout << ") = "; show_value(r); + std::cout << std::endl; + // 0.90000000000000000000000000000000000000000000000000000000000000000000000000000000) + // = 0.52983296563343441213336643954546304857788132269804249284012528304239956432480864 + //] //[/lambert_w_simple_examples_4a] + } + { +//[lambert_w_simple_examples_precision_policies + double z = 5.; + // Define a new, non-default, policy to calculate to precision of approximately 3 decimal digits. + std::cout << "lambert_w0(" << z << ", policy>()) = " << lambert_w0(z, policy>()) + << std::endl; // lambert_w0(0.29999999999999999, policy>()) = 0.23675531078855935 +//] //[/lambert_w_simple_examples_precision_policies] + +//[lambert_w_simple_examples_error_policies + // Define an error handling policy: + typedef policy< + domain_error, + overflow_error + > throw_policy; + + std::cout << "Lambert W (" << z << ") = " << lambert_w0(z) << std::endl; // 0.23675531078855930 + std::cout << "\nLambert W (" << z << ", throw_policy()) = " << lambert_w0(z, throw_policy()) << std::endl; + //] //[/lambert_w_simple_example_error_policies] + } + { + //[lambert_w_simple_examples_out_of_range + // Show error reporting if pass a value to lambert_w0 that is out of range, + // and probably was meant to be passed to lambert_m1 instead. + double z = -1.; + double r = lambert_w0(z); + std::cout << "lambert_w0(-1.) = " << r << std::endl; + // Error in function boost::math::lambert_w0(): + // Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) + // for Lambert W0 branch (use W-1 branch?). +//] [/lambert_w_simple_examples_out_of_range] + } + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} // int main() + + /* + + Output: +//[lambert_w_simple_examples_error_message_1 + Error in function boost::math::lambert_w0(): + Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) + for Lambert W0 branch + (use W-1 branch?). +//] [/lambert_w_simple_examples_error_message_1] + + /* + + + */ + + diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 178e35c45..085c9ca2b 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -31,8 +31,8 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of #define BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from lookup table. */ -//#ifndef BOOST_MATH_SF_LAMBERT_W_HPP -//#define BOOST_MATH_SF_LAMBERT_W_HPP +#ifndef BOOST_MATH_SF_LAMBERT_W_HPP +#define BOOST_MATH_SF_LAMBERT_W_HPP #ifdef _MSC_VER # pragma warning (disable: 4127) // warning C4127: conditional expression is constant @@ -1406,4 +1406,4 @@ if (diff == 0) // Exact result - common. } // namespace math } // namespace boost -//#endif // #ifndef BOOST_MATH_SF_LAMBERT_W_HPP +#endif // #ifndef BOOST_MATH_SF_LAMBERT_W_HPP diff --git a/test/lambert_w_high_reference_values.cpp b/test/lambert_w_high_reference_values.cpp new file mode 100644 index 000000000..5085a2dac --- /dev/null +++ b/test/lambert_w_high_reference_values.cpp @@ -0,0 +1,182 @@ +// \modular-boost\libs\math\test\lambert_w_high_reference_values.cpp + +// Copyright Paul A. Bristow 2017. +// 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) + +// Write a C++ file \lambert_w_mp_hi_values.ipp +// containing arrays of z arguments and 100 decimal digit precision lambert_w0(z) reference values. +// These can be used in tests of precision of less-precise types like +// built-in float, double, long double and quad and cpp_dec_float_50. + +// These cover the range from 0.5 to (std::numeric_limits<>::max)(); +// The Fukushima algorithm changes from a series function for all z > 0.5. + +// Multiprecision types: +//#include +#include // boost::multiprecision::cpp_dec_float_100 +using boost::multiprecision::cpp_dec_float_100; + +#include // +using boost::math::lambert_w0; +using boost::math::lambert_wm1; + +#include +// using std::cout; using std::std::endl; using std::ios; using std::std::cerr; +#include +using std::setprecision; +using std::showpoint; +#include +using std::ofstream; +#include +#include // for DBL_EPS etc +#include // for numeric limits. +//#include +#include + +const long double eps = std::numeric_limits::epsilon(); + +// Creates if no file exists, & uses default overwrite/ ios::replace. +const char filename[] = "lambert_w_high_reference_values.ipp"; // +std::ofstream fout(filename, std::ios::out); + +typedef cpp_dec_float_100 RealType; // 100 decimal digits for the value fed to macro BOOST_MATH_TEST_VALUE. +// Could also use cpp_dec_float_50 or cpp_bin_float types. + +const int no_of_tests = 450; // 500 overflows float. + +static const float min_z = 0.5F; // for element[0] + +int main() +{ // Make C++ file containing Lambert W test values. + std::cout << filename << " "; + std::cout << std::endl; + std::cout << "Lambert W0 decimal digit precision values for high z argument values." << std::endl; + + if (!fout.is_open()) + { // File failed to open OK. + std::cerr << "Open file " << filename << " failed!" << std::endl; + std::cerr << "errno " << errno << std::endl; + return -1; + } + try + { + int output_precision = std::numeric_limits::digits10; + // cpp_dec_float_100 is ample precision and + // has several extra bits internally so max_digits10 are not needed. + fout.precision(output_precision); + fout << std::showpoint << std::endl; // Don't show trailing zeros. + + // Intro for RealType values. + std::cout << "Lambert W test values written to file " << filename << std::endl; + fout << + "\n" + "// A collection of big Lambert W test values computed using " + << output_precision << " decimal digits precision.\n" + "// C++ floating-point type is " << "RealType." "\n" + "\n" + "// Written by " << __FILE__ << " " << __TIMESTAMP__ << "\n" + + "\n" + "// Copyright Paul A. Bristow 2017." "\n" + "// Distributed under the Boost Software License, Version 1.0." "\n" + "// (See accompanying file LICENSE_1_0.txt" "\n" + "// or copy at http://www.boost.org/LICENSE_1_0.txt)" "\n" + << std::endl; + + fout << "// Size of arrays of arguments z and Lambert W" << std::endl; + fout << "static const unsigned int noof_tests = " << no_of_tests << ";" << std::endl; + + // Declare arrays of z and Lambert W. + fout << "\n// Declare arrays of arguments z and Lambert W(z)" << std::endl; + fout << + "\n" + "template ""\n" + "static RealType zs[" << no_of_tests << "];" + << std::endl; + + fout << + "\n" + "template ""\n" + "static RealType ws[" << no_of_tests << "];" + << std::endl; + + fout << "// The values are defined using the macro BOOST_MATH_TEST_VALUE to ensure\n" + "// that both built-in and multiprecision types are correctly initialiased with full precision.\n" + "// built-in types like float, double require a floating-point literal like 3.14,\n" + "// but multiprecision types require a decimal digit string like \"3.14\".\n" + "// Numerical values are chosen to avoid exactly representable values." + << std::endl; + + static const RealType min_z = 0.6; // for element[0] + + const RealType max_z = (std::numeric_limits::max)() / 10; // (std::numeric_limits::max)() to make sure is OK for all floating-point types. + // Less a bit as lambert_w0(max) may be inaccurate. + const RealType step_size = 0.5F; // Increment step size. + const RealType step_factor = 2.f; // Multiple factor, typically 2, 5 or 10. + const int step_modulo = 5; + + RealType z = min_z; + + // Output function to initialize array of arguments z and Lambert W. + fout << + "\n" + << "template \n" + "void init_zws()\n" + "{\n"; + + for (size_t index = 0; (index != no_of_tests); index++) + { + fout + << " zs[" << index << "] = BOOST_MATH_TEST_VALUE(RealType, " + << z // Since start with converting a float may get lots of usefully random digits. + << ");" + << std::endl; + + fout + << " ws[" << index << "] = BOOST_MATH_TEST_VALUE(RealType, " + << lambert_w0(z) + << ");" + << std::endl; + + if ((index % step_modulo) == 0) + { + z *= step_factor; // + } + z += step_size; + if (z >= max_z) + { // Don't go over max for float. + std::cout << "too big z" << std::endl; + break; + } + } // for index + fout << "};" << std::endl; + + fout << "// End of lambert_w_mp_high_values.ipp " << std::endl; + } + catch (std::exception& ex) + { + std::cout << "Exception " << ex.what() << std::endl; + } + + fout.close(); + + std::cout << no_of_tests << " Lambert_w0 values written to files " << __TIMESTAMP__ << std::endl; + return 0; +} // main + + +/* +A few spot checks again Wolfram: + + zs[1] = BOOST_MATH_TEST_VALUE(RealType, 1.6999999999999999555910790149937383830547332763671875); + ws[1] = BOOST_MATH_TEST_VALUE(RealType, 0.7796011225311008662356536916883580556792500749037209859530390902424444585607630246126725241921761054); + Wolfram 0.7796011225311008662356536916883580556792500749037209859530390902424444585607630246126725241921761054 + + zs[99] = BOOST_MATH_TEST_VALUE(RealType, 3250582.599999999976716935634613037109375); + ws[99] = BOOST_MATH_TEST_VALUE(RealType, 12.47094339016839065212822905567651460418204106065566910956134121802725695306834966790193342511971825); + Wolfram 12.47094339016839065212822905567651460418204106065566910956134121802725695306834966790193342511971825 + +*/ + diff --git a/test/lambert_w_high_reference_values.ipp b/test/lambert_w_high_reference_values.ipp new file mode 100644 index 000000000..bcbd824ba --- /dev/null +++ b/test/lambert_w_high_reference_values.ipp @@ -0,0 +1,933 @@ + + +// A collection of big Lambert W test values computed using 100 decimal digits precision. +// C++ floating-point type is RealType. + +// Written by I:\modular-boost\libs\math\test\lambert_w_high_reference_values.cpp Tue Oct 10 14:32:47 2017 + +// Copyright Paul A. Bristow 2017. +// 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) + +// Size of arrays of arguments z and Lambert W +static const unsigned int noof_tests = 450; + +// Declare arrays of arguments z and Lambert W(z) + +template +static RealType zs[450]; + +template +static RealType ws[450]; +// The values are defined using the macro BOOST_MATH_TEST_VALUE to ensure +// that both built-in and multiprecision types are correctly initialiased with full precision. +// built-in types like float, double require a floating-point literal like 3.14, +// but multiprecision types require a decimal digit string like "3.14". +// Numerical values are chosen to avoid exactly representable values. + +template +void init_zws() +{ + zs[0] = BOOST_MATH_TEST_VALUE(RealType, 0.5999999999999999777955395074968691915273666381835937500000000000000000000000000000000000000000000000); + ws[0] = BOOST_MATH_TEST_VALUE(RealType, 0.4015636367870725840596232119093618401250821463765781307144089819032551434525179709162089487011544152); + zs[1] = BOOST_MATH_TEST_VALUE(RealType, 1.699999999999999955591079014993738383054733276367187500000000000000000000000000000000000000000000000); + ws[1] = BOOST_MATH_TEST_VALUE(RealType, 0.7796011225311008662356536916883580556792500749037209859530390902424444585607630246126725241921761054); + zs[2] = BOOST_MATH_TEST_VALUE(RealType, 2.199999999999999955591079014993738383054733276367187500000000000000000000000000000000000000000000000); + ws[2] = BOOST_MATH_TEST_VALUE(RealType, 0.8970741340486472832529094012483877796469756302241005331449133504770916140694317158875490176641388180); + zs[3] = BOOST_MATH_TEST_VALUE(RealType, 2.699999999999999955591079014993738383054733276367187500000000000000000000000000000000000000000000000); + ws[3] = BOOST_MATH_TEST_VALUE(RealType, 0.9966287342654774578203091807272871494846015619689842252588224928604557045580020903399140826514419525); + zs[4] = BOOST_MATH_TEST_VALUE(RealType, 3.199999999999999955591079014993738383054733276367187500000000000000000000000000000000000000000000000); + ws[4] = BOOST_MATH_TEST_VALUE(RealType, 1.083216216147652072726562700563454011684986526601600660806443834509711499483389930134543612892458143); + zs[5] = BOOST_MATH_TEST_VALUE(RealType, 3.699999999999999955591079014993738383054733276367187500000000000000000000000000000000000000000000000); + ws[5] = BOOST_MATH_TEST_VALUE(RealType, 1.159953178612022143701086341067113318247085320992117266262618001908576504625710753138135645536760705); + zs[6] = BOOST_MATH_TEST_VALUE(RealType, 7.899999999999999911182158029987476766109466552734375000000000000000000000000000000000000000000000000); + ws[6] = BOOST_MATH_TEST_VALUE(RealType, 1.598067606240196984785534680781403865575242180069554020841247076138095065416648450279328891063284787); + zs[7] = BOOST_MATH_TEST_VALUE(RealType, 8.399999999999999911182158029987476766109466552734375000000000000000000000000000000000000000000000000); + ws[7] = BOOST_MATH_TEST_VALUE(RealType, 1.635986015616761306128656680352102711658504330413761752847915150776296724715125185878789170353595843); + zs[8] = BOOST_MATH_TEST_VALUE(RealType, 8.899999999999999911182158029987476766109466552734375000000000000000000000000000000000000000000000000); + ws[8] = BOOST_MATH_TEST_VALUE(RealType, 1.672019249364215143714449427934723990551745560176619694762404483433765553308432498126823728454150807); + zs[9] = BOOST_MATH_TEST_VALUE(RealType, 9.399999999999999911182158029987476766109466552734375000000000000000000000000000000000000000000000000); + ws[9] = BOOST_MATH_TEST_VALUE(RealType, 1.706351956427362203924265356724807963736463682858697517135613748929048683757986880699421428246987716); + zs[10] = BOOST_MATH_TEST_VALUE(RealType, 9.899999999999999911182158029987476766109466552734375000000000000000000000000000000000000000000000000); + ws[10] = BOOST_MATH_TEST_VALUE(RealType, 1.739142551733351601404562031720166836256093578556407891184787967858395290655747464534386031726054901); + zs[11] = BOOST_MATH_TEST_VALUE(RealType, 20.29999999999999982236431605997495353221893310546875000000000000000000000000000000000000000000000000); + ws[11] = BOOST_MATH_TEST_VALUE(RealType, 2.215253873529547121281024099654049024258898512352506053956048219674735189566735605935868519028886428); + zs[12] = BOOST_MATH_TEST_VALUE(RealType, 20.79999999999999982236431605997495353221893310546875000000000000000000000000000000000000000000000000); + ws[12] = BOOST_MATH_TEST_VALUE(RealType, 2.232037942848570707824689153745947970289311384094147352193787995777039984911477501437729555943891179); + zs[13] = BOOST_MATH_TEST_VALUE(RealType, 21.29999999999999982236431605997495353221893310546875000000000000000000000000000000000000000000000000); + ws[13] = BOOST_MATH_TEST_VALUE(RealType, 2.248461062664032810797682669829614177334474567497410976269795770382256291948680343286055598456930946); + zs[14] = BOOST_MATH_TEST_VALUE(RealType, 21.79999999999999982236431605997495353221893310546875000000000000000000000000000000000000000000000000); + ws[14] = BOOST_MATH_TEST_VALUE(RealType, 2.264538836003641674575766487227130628592151315874095763183468118573707558576164351416415105283538250); + zs[15] = BOOST_MATH_TEST_VALUE(RealType, 22.29999999999999982236431605997495353221893310546875000000000000000000000000000000000000000000000000); + ws[15] = BOOST_MATH_TEST_VALUE(RealType, 2.280285864286149926152034464925849817265625703056626970221292432804223262557041139245862876595960246); + zs[16] = BOOST_MATH_TEST_VALUE(RealType, 45.09999999999999964472863211994990706443786621093750000000000000000000000000000000000000000000000000); + ws[16] = BOOST_MATH_TEST_VALUE(RealType, 2.784730975471531592298228296023808374578957621993717936291403085791375505867336041880555203144734624); + zs[17] = BOOST_MATH_TEST_VALUE(RealType, 45.59999999999999964472863211994990706443786621093750000000000000000000000000000000000000000000000000); + ws[17] = BOOST_MATH_TEST_VALUE(RealType, 2.792846418923343663453351656549736190861671652329623509279809945695836105896108078166742811990549890); + zs[18] = BOOST_MATH_TEST_VALUE(RealType, 46.09999999999999964472863211994990706443786621093750000000000000000000000000000000000000000000000000); + ws[18] = BOOST_MATH_TEST_VALUE(RealType, 2.800879481577357402817907432620737944445117856442267934361375865486347844977822691465905776042660153); + zs[19] = BOOST_MATH_TEST_VALUE(RealType, 46.59999999999999964472863211994990706443786621093750000000000000000000000000000000000000000000000000); + ws[19] = BOOST_MATH_TEST_VALUE(RealType, 2.808831854396542967901795549912651228215931108039763441789870364477609029775521508274395566200250327); + zs[20] = BOOST_MATH_TEST_VALUE(RealType, 47.09999999999999964472863211994990706443786621093750000000000000000000000000000000000000000000000000); + ws[20] = BOOST_MATH_TEST_VALUE(RealType, 2.816705176341098453894950633365766251645928038203952811501285665902169257597881259137118085186909385); + zs[21] = BOOST_MATH_TEST_VALUE(RealType, 94.69999999999999928945726423989981412887573242187500000000000000000000000000000000000000000000000000); + ws[21] = BOOST_MATH_TEST_VALUE(RealType, 3.343650750934026694453868349588423323594970057683998463032955783031328100668795635364027627344237744); + zs[22] = BOOST_MATH_TEST_VALUE(RealType, 95.19999999999999928945726423989981412887573242187500000000000000000000000000000000000000000000000000); + ws[22] = BOOST_MATH_TEST_VALUE(RealType, 3.347704927126314354014952127881909800322435946123852141764728005964807369865451182872647651261526300); + zs[23] = BOOST_MATH_TEST_VALUE(RealType, 95.69999999999999928945726423989981412887573242187500000000000000000000000000000000000000000000000000); + ws[23] = BOOST_MATH_TEST_VALUE(RealType, 3.351738986777429550093016062864573016038852034507491269297237351947364962103400790753443005963042748); + zs[24] = BOOST_MATH_TEST_VALUE(RealType, 96.19999999999999928945726423989981412887573242187500000000000000000000000000000000000000000000000000); + ws[24] = BOOST_MATH_TEST_VALUE(RealType, 3.355753131971562146591617562968067128167583310591520027232903513337163599725129242852363808925517286); + zs[25] = BOOST_MATH_TEST_VALUE(RealType, 96.69999999999999928945726423989981412887573242187500000000000000000000000000000000000000000000000000); + ws[25] = BOOST_MATH_TEST_VALUE(RealType, 3.359747561740841558826391853676861600267695314122615815793967179881207925371616384184099572300595115); + zs[26] = BOOST_MATH_TEST_VALUE(RealType, 193.8999999999999985789145284797996282577514648437500000000000000000000000000000000000000000000000000); + ws[26] = BOOST_MATH_TEST_VALUE(RealType, 3.905067494884853812892253268046191881524005958444131697564696414502793024379297479024372424749155738); + zs[27] = BOOST_MATH_TEST_VALUE(RealType, 194.3999999999999985789145284797996282577514648437500000000000000000000000000000000000000000000000000); + ws[27] = BOOST_MATH_TEST_VALUE(RealType, 3.907117899842841728838668195110205529083454921828289550856799078486258603076095983089478749398791291); + zs[28] = BOOST_MATH_TEST_VALUE(RealType, 194.8999999999999985789145284797996282577514648437500000000000000000000000000000000000000000000000000); + ws[28] = BOOST_MATH_TEST_VALUE(RealType, 3.909163256350964853423766659493861241213806026764267552120249985812650869611378163906691630909022161); + zs[29] = BOOST_MATH_TEST_VALUE(RealType, 195.3999999999999985789145284797996282577514648437500000000000000000000000000000000000000000000000000); + ws[29] = BOOST_MATH_TEST_VALUE(RealType, 3.911203589561939804120818106435026078510094046010650488053868908640181610985462139185885264355418070); + zs[30] = BOOST_MATH_TEST_VALUE(RealType, 195.8999999999999985789145284797996282577514648437500000000000000000000000000000000000000000000000000); + ws[30] = BOOST_MATH_TEST_VALUE(RealType, 3.913238924439855435510247090467540747905833384629853846395096935851013937767959235773727554750691716); + zs[31] = BOOST_MATH_TEST_VALUE(RealType, 392.2999999999999971578290569595992565155029296875000000000000000000000000000000000000000000000000000); + ws[31] = BOOST_MATH_TEST_VALUE(RealType, 4.473790759373999449370836932900380698603499930598355812583693103082314531706325269694063530407295371); + zs[32] = BOOST_MATH_TEST_VALUE(RealType, 392.7999999999999971578290569595992565155029296875000000000000000000000000000000000000000000000000000); + ws[32] = BOOST_MATH_TEST_VALUE(RealType, 4.474831809850706594148527116907834093420614735070734923094248837531977152944616462128228522597237267); + zs[33] = BOOST_MATH_TEST_VALUE(RealType, 393.2999999999999971578290569595992565155029296875000000000000000000000000000000000000000000000000000); + ws[33] = BOOST_MATH_TEST_VALUE(RealType, 4.475871580159411118557716684955449097432917202595361508172914971791116938813457453917365177551691682); + zs[34] = BOOST_MATH_TEST_VALUE(RealType, 393.7999999999999971578290569595992565155029296875000000000000000000000000000000000000000000000000000); + ws[34] = BOOST_MATH_TEST_VALUE(RealType, 4.476910073482067128895548362807270116617425992201334451790294796151311859601136186866422234634474300); + zs[35] = BOOST_MATH_TEST_VALUE(RealType, 394.2999999999999971578290569595992565155029296875000000000000000000000000000000000000000000000000000); + ws[35] = BOOST_MATH_TEST_VALUE(RealType, 4.477947292988721649990662195165267393745885698851422229805500000725367834662498733709056508177586635); + zs[36] = BOOST_MATH_TEST_VALUE(RealType, 789.0999999999999943156581139191985130310058593750000000000000000000000000000000000000000000000000000); + ws[36] = BOOST_MATH_TEST_VALUE(RealType, 5.051256108760896701894497014701900464234767080894666089938550993707446937559086016796794249885331870); + zs[37] = BOOST_MATH_TEST_VALUE(RealType, 789.5999999999999943156581139191985130310058593750000000000000000000000000000000000000000000000000000); + ws[37] = BOOST_MATH_TEST_VALUE(RealType, 5.051784868057603576951613257575983601901987808830448747962646970040648657993520282283444052127887316); + zs[38] = BOOST_MATH_TEST_VALUE(RealType, 790.0999999999999943156581139191985130310058593750000000000000000000000000000000000000000000000000000); + ws[38] = BOOST_MATH_TEST_VALUE(RealType, 5.052313301769511279751645919401950992205691275454166720959640667514665636089541176437079485020106302); + zs[39] = BOOST_MATH_TEST_VALUE(RealType, 790.5999999999999943156581139191985130310058593750000000000000000000000000000000000000000000000000000); + ws[39] = BOOST_MATH_TEST_VALUE(RealType, 5.052841410301356078567942312344300154667895407100576839086958094315459736887113324816418833061471414); + zs[40] = BOOST_MATH_TEST_VALUE(RealType, 791.0999999999999943156581139191985130310058593750000000000000000000000000000000000000000000000000000); + ws[40] = BOOST_MATH_TEST_VALUE(RealType, 5.053369194057116916125095352093384287199494222654442252497641737159855576046108292479434106853949424); + zs[41] = BOOST_MATH_TEST_VALUE(RealType, 1582.699999999999988631316227838397026062011718750000000000000000000000000000000000000000000000000000); + ws[41] = BOOST_MATH_TEST_VALUE(RealType, 5.637454835061548840266762838608075961241621341710147974330149448636747596037634477093772466715414237); + zs[42] = BOOST_MATH_TEST_VALUE(RealType, 1583.199999999999988631316227838397026062011718750000000000000000000000000000000000000000000000000000); + ws[42] = BOOST_MATH_TEST_VALUE(RealType, 5.637723113558296965227371679987485292172631743514584329014143690566703873701821724552724491259434917); + zs[43] = BOOST_MATH_TEST_VALUE(RealType, 1583.699999999999988631316227838397026062011718750000000000000000000000000000000000000000000000000000); + ws[43] = BOOST_MATH_TEST_VALUE(RealType, 5.637991309264171414360659662528863849150184273111159470910102371892495978961903358821307687677635837); + zs[44] = BOOST_MATH_TEST_VALUE(RealType, 1584.199999999999988631316227838397026062011718750000000000000000000000000000000000000000000000000000); + ws[44] = BOOST_MATH_TEST_VALUE(RealType, 5.638259422230692585112176850810679719906543165397130936013277468573934642794738015313302920143170105); + zs[45] = BOOST_MATH_TEST_VALUE(RealType, 1584.699999999999988631316227838397026062011718750000000000000000000000000000000000000000000000000000); + ws[45] = BOOST_MATH_TEST_VALUE(RealType, 5.638527452509332631758526797455952459448323578747282813479742362912515476029842704193513987433394644); + zs[46] = BOOST_MATH_TEST_VALUE(RealType, 3169.899999999999977262632455676794052124023437500000000000000000000000000000000000000000000000000000); + ws[46] = BOOST_MATH_TEST_VALUE(RealType, 6.231791473267630119617879242959215790063493036893226016268939602113573649847295482162112707750032205); + zs[47] = BOOST_MATH_TEST_VALUE(RealType, 3170.399999999999977262632455676794052124023437500000000000000000000000000000000000000000000000000000); + ws[47] = BOOST_MATH_TEST_VALUE(RealType, 6.231927385287213295870608336780291881793156334477048126729390997875392137109426481813143445559537548); + zs[48] = BOOST_MATH_TEST_VALUE(RealType, 3170.899999999999977262632455676794052124023437500000000000000000000000000000000000000000000000000000); + ws[48] = BOOST_MATH_TEST_VALUE(RealType, 6.232063276283731898910298571907046320310117335045161587714712693774590117520030116772150624981197754); + zs[49] = BOOST_MATH_TEST_VALUE(RealType, 3171.399999999999977262632455676794052124023437500000000000000000000000000000000000000000000000000000); + ws[49] = BOOST_MATH_TEST_VALUE(RealType, 6.232199146263736642645449823754129665166787360756180379390602947566154676495717638352300033758537319); + zs[50] = BOOST_MATH_TEST_VALUE(RealType, 3171.899999999999977262632455676794052124023437500000000000000000000000000000000000000000000000000000); + ws[50] = BOOST_MATH_TEST_VALUE(RealType, 6.232334995233775170638824027293638315162522524016381054824777727129130712726670908695639061242466679); + zs[51] = BOOST_MATH_TEST_VALUE(RealType, 6344.299999999999954525264911353588104248046875000000000000000000000000000000000000000000000000000000); + ws[51] = BOOST_MATH_TEST_VALUE(RealType, 6.833478246863882246641726870717734354293613258312600642204509694006101911629409462573891987188902394); + zs[52] = BOOST_MATH_TEST_VALUE(RealType, 6344.799999999999954525264911353588104248046875000000000000000000000000000000000000000000000000000000); + ws[52] = BOOST_MATH_TEST_VALUE(RealType, 6.833546994320183648585668463184962739224514055009742694319567301283431438840148992714833003589320204); + zs[53] = BOOST_MATH_TEST_VALUE(RealType, 6345.299999999999954525264911353588104248046875000000000000000000000000000000000000000000000000000000); + ws[53] = BOOST_MATH_TEST_VALUE(RealType, 6.833615736447355580644330241871199203480309206612453771835338393474744796397760691906867357518286300); + zs[54] = BOOST_MATH_TEST_VALUE(RealType, 6345.799999999999954525264911353588104248046875000000000000000000000000000000000000000000000000000000); + ws[54] = BOOST_MATH_TEST_VALUE(RealType, 6.833684473246229472880513750644790479773339419112019177698673979527062571403548057152859520971070532); + zs[55] = BOOST_MATH_TEST_VALUE(RealType, 6346.299999999999954525264911353588104248046875000000000000000000000000000000000000000000000000000000); + ws[55] = BOOST_MATH_TEST_VALUE(RealType, 6.833753204717636560302304979968870884092145760178319785601850619423465965447586003582575169154068642); + zs[56] = BOOST_MATH_TEST_VALUE(RealType, 12693.09999999999990905052982270717620849609375000000000000000000000000000000000000000000000000000000); + ws[56] = BOOST_MATH_TEST_VALUE(RealType, 7.441712782644182656362567954733218054310136462342348107691598780010100425506115311857309428345451583); + zs[57] = BOOST_MATH_TEST_VALUE(RealType, 12693.59999999999990905052982270717620849609375000000000000000000000000000000000000000000000000000000); + ws[57] = BOOST_MATH_TEST_VALUE(RealType, 7.441747507160214264985418199644937473985616288224663570878672057496608603535012780430207292902251849); + zs[58] = BOOST_MATH_TEST_VALUE(RealType, 12694.09999999999990905052982270717620849609375000000000000000000000000000000000000000000000000000000); + ws[58] = BOOST_MATH_TEST_VALUE(RealType, 7.441782230327669457854270012077867036991216446419568353636383337201042455550854674638301527917381460); + zs[59] = BOOST_MATH_TEST_VALUE(RealType, 12694.59999999999990905052982270717620849609375000000000000000000000000000000000000000000000000000000); + ws[59] = BOOST_MATH_TEST_VALUE(RealType, 7.441816952146653566134582734750438863756337927374408689634478920961001428844890048307273438220285103); + zs[60] = BOOST_MATH_TEST_VALUE(RealType, 12695.09999999999990905052982270717620849609375000000000000000000000000000000000000000000000000000000); + ws[60] = BOOST_MATH_TEST_VALUE(RealType, 7.441851672617271908624631672809964354572668086864496527202255560220860635169893350319392062176172956); + zs[61] = BOOST_MATH_TEST_VALUE(RealType, 25390.69999999999981810105964541435241699218750000000000000000000000000000000000000000000000000000000); + ws[61] = BOOST_MATH_TEST_VALUE(RealType, 8.055751887730669404078767770906158058132806188168812278807914210510560983286915475256358360988722249); + zs[62] = BOOST_MATH_TEST_VALUE(RealType, 25391.19999999999981810105964541435241699218750000000000000000000000000000000000000000000000000000000); + ws[62] = BOOST_MATH_TEST_VALUE(RealType, 8.055769405252722224984585767512155671001638813031160420183226603705765994004819084590112882738598672); + zs[63] = BOOST_MATH_TEST_VALUE(RealType, 25391.69999999999981810105964541435241699218750000000000000000000000000000000000000000000000000000000); + ws[63] = BOOST_MATH_TEST_VALUE(RealType, 8.055786922434032119761416627590837471869427434519755833207927697913643222261584517182449368833198187); + zs[64] = BOOST_MATH_TEST_VALUE(RealType, 25392.19999999999981810105964541435241699218750000000000000000000000000000000000000000000000000000000); + ws[64] = BOOST_MATH_TEST_VALUE(RealType, 8.055804439274612409649066171031328348764224415259811919589560542548689157122598047317682477881428519); + zs[65] = BOOST_MATH_TEST_VALUE(RealType, 25392.69999999999981810105964541435241699218750000000000000000000000000000000000000000000000000000000); + ws[65] = BOOST_MATH_TEST_VALUE(RealType, 8.055821955774476415104661363464701307020928082642356236080373490396966544402792637267897239283500728); + zs[66] = BOOST_MATH_TEST_VALUE(RealType, 50785.89999999999963620211929082870483398437500000000000000000000000000000000000000000000000000000000); + ws[66] = BOOST_MATH_TEST_VALUE(RealType, 8.674936078635983017984123951954366186973716699495736629864279614242284857757227515949355498579742855); + zs[67] = BOOST_MATH_TEST_VALUE(RealType, 50786.39999999999963620211929082870483398437500000000000000000000000000000000000000000000000000000000); + ws[67] = BOOST_MATH_TEST_VALUE(RealType, 8.674944906241453706059825549964349902974004039927040359264744515026031399261972506772892769382818801); + zs[68] = BOOST_MATH_TEST_VALUE(RealType, 50786.89999999999963620211929082870483398437500000000000000000000000000000000000000000000000000000000); + ws[68] = BOOST_MATH_TEST_VALUE(RealType, 8.674953733760944136535950689333928914142360745655931032041490757092023706394578714640748394257288035); + zs[69] = BOOST_MATH_TEST_VALUE(RealType, 50787.39999999999963620211929082870483398437500000000000000000000000000000000000000000000000000000000); + ws[69] = BOOST_MATH_TEST_VALUE(RealType, 8.674962561194455991628227539852952953077017660325256919933499525371091080399080487843972214866128384); + zs[70] = BOOST_MATH_TEST_VALUE(RealType, 50787.89999999999963620211929082870483398437500000000000000000000000000000000000000000000000000000000); + ws[70] = BOOST_MATH_TEST_VALUE(RealType, 8.674971388541990953502931535257895802702731784533955912147060505216027254503478909260086842672435376); + zs[71] = BOOST_MATH_TEST_VALUE(RealType, 101576.2999999999992724042385816574096679687500000000000000000000000000000000000000000000000000000000); + ws[71] = BOOST_MATH_TEST_VALUE(RealType, 9.298691796027940703796635264110043143787629375260023629778966472817740701497549236671005785312535137); + zs[72] = BOOST_MATH_TEST_VALUE(RealType, 101576.7999999999992724042385816574096679687500000000000000000000000000000000000000000000000000000000); + ws[72] = BOOST_MATH_TEST_VALUE(RealType, 9.298696240460783074349599408079465706595862952879886273836096426172349132276424038993850275528909958); + zs[73] = BOOST_MATH_TEST_VALUE(RealType, 101577.2999999999992724042385816574096679687500000000000000000000000000000000000000000000000000000000); + ws[73] = BOOST_MATH_TEST_VALUE(RealType, 9.298700684871954559132336105768526810554925567844384854912235341295989207897852971537611849804454104); + zs[74] = BOOST_MATH_TEST_VALUE(RealType, 101577.7999999999992724042385816574096679687500000000000000000000000000000000000000000000000000000000); + ws[74] = BOOST_MATH_TEST_VALUE(RealType, 9.298705129261455370304348674457005008539407510001142864340543902043967324875967473097043636378431136); + zs[75] = BOOST_MATH_TEST_VALUE(RealType, 101578.2999999999992724042385816574096679687500000000000000000000000000000000000000000000000000000000); + ws[75] = BOOST_MATH_TEST_VALUE(RealType, 9.298709573629285720022020159137488905547397121761906103664298171650800509043504137427221381746219971); + zs[76] = BOOST_MATH_TEST_VALUE(RealType, 203157.0999999999985448084771633148193359375000000000000000000000000000000000000000000000000000000000); + ws[76] = BOOST_MATH_TEST_VALUE(RealType, 9.926524439637924502814640096432844232405010548632138451412344878257773957471037720806722776924379539); + zs[77] = BOOST_MATH_TEST_VALUE(RealType, 203157.5999999999985448084771633148193359375000000000000000000000000000000000000000000000000000000000); + ws[77] = BOOST_MATH_TEST_VALUE(RealType, 9.926526675539305999408212665862555525393765588240345090590079743764108100617622492751979808963302929); + zs[78] = BOOST_MATH_TEST_VALUE(RealType, 203158.0999999999985448084771633148193359375000000000000000000000000000000000000000000000000000000000); + ws[78] = BOOST_MATH_TEST_VALUE(RealType, 9.926528911435230720557328431324006644047736665798752128461117587165401958858923779103702189649205849); + zs[79] = BOOST_MATH_TEST_VALUE(RealType, 203158.5999999999985448084771633148193359375000000000000000000000000000000000000000000000000000000000); + ws[79] = BOOST_MATH_TEST_VALUE(RealType, 9.926531147325698692990351270769682423599587366983008197322280565618502972980495987784743296088232692); + zs[80] = BOOST_MATH_TEST_VALUE(RealType, 203159.0999999999985448084771633148193359375000000000000000000000000000000000000000000000000000000000); + ws[80] = BOOST_MATH_TEST_VALUE(RealType, 9.926533383210709943435448417027560593313394713874207050608325275972416603539435687443617960861779968); + zs[81] = BOOST_MATH_TEST_VALUE(RealType, 406318.6999999999970896169543266296386718750000000000000000000000000000000000000000000000000000000000); + ws[81] = BOOST_MATH_TEST_VALUE(RealType, 10.55800844020678300858930169345380918056498196515847559789815847210932705985905912177836375627483410); + zs[82] = BOOST_MATH_TEST_VALUE(RealType, 406319.1999999999970896169543266296386718750000000000000000000000000000000000000000000000000000000000); + ws[82] = BOOST_MATH_TEST_VALUE(RealType, 10.55800956429896255310197650482898317196991260081559124902272662470413320348092630336068243562420612); + zs[83] = BOOST_MATH_TEST_VALUE(RealType, 406319.6999999999970896169543266296386718750000000000000000000000000000000000000000000000000000000000); + ws[83] = BOOST_MATH_TEST_VALUE(RealType, 10.55801068838976919073174818917086439876248092007955187694896892558084843931726958729264479171526918); + zs[84] = BOOST_MATH_TEST_VALUE(RealType, 406320.1999999999970896169543266296386718750000000000000000000000000000000000000000000000000000000000); + ws[84] = BOOST_MATH_TEST_VALUE(RealType, 10.55801181247920292484283725870748463023358051483533901203380901404123382789184489956279108152225757); + zs[85] = BOOST_MATH_TEST_VALUE(RealType, 406320.6999999999970896169543266296386718750000000000000000000000000000000000000000000000000000000000); + ws[85] = BOOST_MATH_TEST_VALUE(RealType, 10.55801293656726375879945184504060224737500313478807503007007909767698116683614226527139047633989602); + zs[86] = BOOST_MATH_TEST_VALUE(RealType, 812641.8999999999941792339086532592773437500000000000000000000000000000000000000000000000000000000000); + ws[86] = BOOST_MATH_TEST_VALUE(RealType, 11.19277715105303335957380751089185510982783382888615163475399731608447432939046539739780186010205819); + zs[87] = BOOST_MATH_TEST_VALUE(RealType, 812642.3999999999941792339086532592773437500000000000000000000000000000000000000000000000000000000000); + ws[87] = BOOST_MATH_TEST_VALUE(RealType, 11.19277771586759068427927907791232978730718798905802091714667366555094578546313245757715733663116681); + zs[88] = BOOST_MATH_TEST_VALUE(RealType, 812642.8999999999941792339086532592773437500000000000000000000000000000000000000000000000000000000000); + ws[88] = BOOST_MATH_TEST_VALUE(RealType, 11.19277828068180282941234300813602678219028255437023366225732009891673392268727353365317316060216307); + zs[89] = BOOST_MATH_TEST_VALUE(RealType, 812643.3999999999941792339086532592773437500000000000000000000000000000000000000000000000000000000000); + ws[89] = BOOST_MATH_TEST_VALUE(RealType, 11.19277884549566979539611569279587635086022997209586259427933274111486838234969448101548392041897529); + zs[90] = BOOST_MATH_TEST_VALUE(RealType, 812643.8999999999941792339086532592773437500000000000000000000000000000000000000000000000000000000000); + ws[90] = BOOST_MATH_TEST_VALUE(RealType, 11.19277941030919158265371274430325256214137887195738215091099754333691681726015244339566835725917388); + zs[91] = BOOST_MATH_TEST_VALUE(RealType, 1625288.299999999988358467817306518554687500000000000000000000000000000000000000000000000000000000000); + ws[91] = BOOST_MATH_TEST_VALUE(RealType, 11.83051367496350653298055098412234220179378826002120373759410524883137483448021534372309124250280047); + zs[92] = BOOST_MATH_TEST_VALUE(RealType, 1625288.799999999988358467817306518554687500000000000000000000000000000000000000000000000000000000000); + ws[92] = BOOST_MATH_TEST_VALUE(RealType, 11.83051395862415209457082318977971516657969184941726425523617075901029866766828046681793457310563883); + zs[93] = BOOST_MATH_TEST_VALUE(RealType, 1625289.299999999988358467817306518554687500000000000000000000000000000000000000000000000000000000000); + ws[93] = BOOST_MATH_TEST_VALUE(RealType, 11.83051424228471092157568395260197960555928287686416745291625975894259102434581858031780382895984480); + zs[94] = BOOST_MATH_TEST_VALUE(RealType, 1625289.799999999988358467817306518554687500000000000000000000000000000000000000000000000000000000000); + ws[94] = BOOST_MATH_TEST_VALUE(RealType, 11.83051452594518301404831336917713066668156156528094910312372347647232811359765848597839160347350790); + zs[95] = BOOST_MATH_TEST_VALUE(RealType, 1625290.299999999988358467817306518554687500000000000000000000000000000000000000000000000000000000000); + ws[95] = BOOST_MATH_TEST_VALUE(RealType, 11.83051480960556837204189148713503938528677530351797077101569714537002853052165595070586086051268476); + zs[96] = BOOST_MATH_TEST_VALUE(RealType, 3250581.099999999976716935634613037109375000000000000000000000000000000000000000000000000000000000000); + ws[96] = BOOST_MATH_TEST_VALUE(RealType, 12.47094296296818886963926120402441135953658337315101944303084986533714570937576415675358344893956724); + zs[97] = BOOST_MATH_TEST_VALUE(RealType, 3250581.599999999976716935634613037109375000000000000000000000000000000000000000000000000000000000000); + ws[97] = BOOST_MATH_TEST_VALUE(RealType, 12.47094310536827791354684005276581162972597260940308218544073416384666193653508004167640448380153389); + zs[98] = BOOST_MATH_TEST_VALUE(RealType, 3250582.099999999976716935634613037109375000000000000000000000000000000000000000000000000000000000000); + ws[98] = BOOST_MATH_TEST_VALUE(RealType, 12.47094324776834517437426924689730750513918775389042001111365883776867938003401942562632403665303867); + zs[99] = BOOST_MATH_TEST_VALUE(RealType, 3250582.599999999976716935634613037109375000000000000000000000000000000000000000000000000000000000000); + ws[99] = BOOST_MATH_TEST_VALUE(RealType, 12.47094339016839065212822905567651460418204106065566910956134121802725695306834966790193342511971825); + zs[100] = BOOST_MATH_TEST_VALUE(RealType, 3250583.099999999976716935634613037109375000000000000000000000000000000000000000000000000000000000000); + ws[100] = BOOST_MATH_TEST_VALUE(RealType, 12.47094353256841434681539974528531469757660901993281429423438578866652694560046559516127568892277702); + zs[101] = BOOST_MATH_TEST_VALUE(RealType, 6501166.699999999953433871269226074218750000000000000000000000000000000000000000000000000000000000000); + ws[101] = BOOST_MATH_TEST_VALUE(RealType, 13.11382518009820116753812472043031659983277915902361747977758246698818963218870351102587174635468138); + zs[102] = BOOST_MATH_TEST_VALUE(RealType, 6501167.199999999953433871269226074218750000000000000000000000000000000000000000000000000000000000000); + ws[102] = BOOST_MATH_TEST_VALUE(RealType, 13.11382525155825542039438232302300244148043560690215658478061719482590950005701713995387903749679862); + zs[103] = BOOST_MATH_TEST_VALUE(RealType, 6501167.699999999953433871269226074218750000000000000000000000000000000000000000000000000000000000000); + ws[103] = BOOST_MATH_TEST_VALUE(RealType, 13.11382532301830420490055394669714665225378812412907655382308789130810346826183238238494205026247934); + zs[104] = BOOST_MATH_TEST_VALUE(RealType, 6501168.199999999953433871269226074218750000000000000000000000000000000000000000000000000000000000000); + ws[104] = BOOST_MATH_TEST_VALUE(RealType, 13.11382539447834752105747833428094533284492363009218919720913636223924531666313533113069940376003390); + zs[105] = BOOST_MATH_TEST_VALUE(RealType, 6501168.699999999953433871269226074218750000000000000000000000000000000000000000000000000000000000000); + ws[105] = BOOST_MATH_TEST_VALUE(RealType, 13.11382546593838536886599422840946554656689837543146085874754543863703505630372640720269904462657597); + zs[106] = BOOST_MATH_TEST_VALUE(RealType, 13002337.89999999990686774253845214843750000000000000000000000000000000000000000000000000000000000000); + ws[106] = BOOST_MATH_TEST_VALUE(RealType, 13.75895020161120780671931348674820949097896740529525960699598966308825998645623474235280989608207426); + zs[107] = BOOST_MATH_TEST_VALUE(RealType, 13002338.39999999990686774253845214843750000000000000000000000000000000000000000000000000000000000000); + ws[107] = BOOST_MATH_TEST_VALUE(RealType, 13.75895023746031789528316024226987524061812679192459530422102497447151229457148397431817422821296573); + zs[108] = BOOST_MATH_TEST_VALUE(RealType, 13002338.89999999990686774253845214843750000000000000000000000000000000000000000000000000000000000000); + ws[108] = BOOST_MATH_TEST_VALUE(RealType, 13.75895027330942661161180008030275959022186764318551714315248259172940117391346074981407903526666876); + zs[109] = BOOST_MATH_TEST_VALUE(RealType, 13002339.39999999990686774253845214843750000000000000000000000000000000000000000000000000000000000000); + ws[109] = BOOST_MATH_TEST_VALUE(RealType, 13.75895030915853395570533826541548036105186387000942779022045956615233350302797407587096919814230872); + zs[110] = BOOST_MATH_TEST_VALUE(RealType, 13002339.89999999990686774253845214843750000000000000000000000000000000000000000000000000000000000000); + ws[110] = BOOST_MATH_TEST_VALUE(RealType, 13.75895034500763992756388006216453398588380356491793568993934227427809822610433476168943506890083264); + zs[111] = BOOST_MATH_TEST_VALUE(RealType, 26004680.29999999981373548507690429687500000000000000000000000000000000000000000000000000000000000000); + ws[111] = BOOST_MATH_TEST_VALUE(RealType, 14.40613306792050284417781173963237397180782490395810703112834440216893801894568593170935318229410890); + zs[112] = BOOST_MATH_TEST_VALUE(RealType, 26004680.79999999981373548507690429687500000000000000000000000000000000000000000000000000000000000000); + ws[112] = BOOST_MATH_TEST_VALUE(RealType, 14.40613308589978129513196522846261186416164678471600282263899627087138088581441641199768735966026721); + zs[113] = BOOST_MATH_TEST_VALUE(RealType, 26004681.29999999981373548507690429687500000000000000000000000000000000000000000000000000000000000000); + ws[113] = BOOST_MATH_TEST_VALUE(RealType, 14.40613310387905940184947896220802688669394773806882218972392634458869861468933663343960564575146049); + zs[114] = BOOST_MATH_TEST_VALUE(RealType, 26004681.79999999981373548507690429687500000000000000000000000000000000000000000000000000000000000000); + ws[114] = BOOST_MATH_TEST_VALUE(RealType, 14.40613312185833716433036614707023490965167453502978925783310059180078511451175950772072935073580417); + zs[115] = BOOST_MATH_TEST_VALUE(RealType, 26004682.29999999981373548507690429687500000000000000000000000000000000000000000000000000000000000000); + ws[115] = BOOST_MATH_TEST_VALUE(RealType, 14.40613313983761458257463998925009132119130606601627537868443064669880766892972378195587657468067971); + zs[116] = BOOST_MATH_TEST_VALUE(RealType, 52009365.09999999962747097015380859375000000000000000000000000000000000000000000000000000000000000000); + ws[116] = BOOST_MATH_TEST_VALUE(RealType, 15.05521023228726997012482201156518637282193264830919527945406914876568997920242700346221079695380120); + zs[117] = BOOST_MATH_TEST_VALUE(RealType, 52009365.59999999962747097015380859375000000000000000000000000000000000000000000000000000000000000000); + ws[117] = BOOST_MATH_TEST_VALUE(RealType, 15.05521024130213601448008511719004686304317399587148372739532783438679535880037848363163034299000680); + zs[118] = BOOST_MATH_TEST_VALUE(RealType, 52009366.09999999962747097015380859375000000000000000000000000000000000000000000000000000000000000000); + ws[118] = BOOST_MATH_TEST_VALUE(RealType, 15.05521025031700197250576749203130491372164140425152090159289103953022449076855552216703380049236381); + zs[119] = BOOST_MATH_TEST_VALUE(RealType, 52009366.59999999962747097015380859375000000000000000000000000000000000000000000000000000000000000000); + ws[119] = BOOST_MATH_TEST_VALUE(RealType, 15.05521025933186784420187079237695573264884951878394949291027777307830551044730470942903907859985247); + zs[120] = BOOST_MATH_TEST_VALUE(RealType, 52009367.09999999962747097015380859375000000000000000000000000000000000000000000000000000000000000000); + ws[120] = BOOST_MATH_TEST_VALUE(RealType, 15.05521026834673362956839667451494683193779819588967935304969871800597790007309597120010839282494067); + zs[121] = BOOST_MATH_TEST_VALUE(RealType, 104018734.6999999992549419403076171875000000000000000000000000000000000000000000000000000000000000000); + ws[121] = BOOST_MATH_TEST_VALUE(RealType, 15.70603645611954384988565703849374122026373428508755081783343271665282590664826044624943527766443724); + zs[122] = BOOST_MATH_TEST_VALUE(RealType, 104018735.1999999992549419403076171875000000000000000000000000000000000000000000000000000000000000000); + ws[122] = BOOST_MATH_TEST_VALUE(RealType, 15.70603646063864032656975241668975461127107196165116494804371210729046808944447344810561150619338235); + zs[123] = BOOST_MATH_TEST_VALUE(RealType, 104018735.6999999992549419403076171875000000000000000000000000000000000000000000000000000000000000000); + ws[123] = BOOST_MATH_TEST_VALUE(RealType, 15.70603646515773678160916860265187423935628996612114399500020977395299556819648453302891654761783891); + zs[124] = BOOST_MATH_TEST_VALUE(RealType, 104018736.1999999992549419403076171875000000000000000000000000000000000000000000000000000000000000000); + ws[124] = BOOST_MATH_TEST_VALUE(RealType, 15.70603646967683321500390580404963095388245044851589624040628425347772179453119739096056755672581358); + zs[125] = BOOST_MATH_TEST_VALUE(RealType, 104018736.6999999992549419403076171875000000000000000000000000000000000000000000000000000000000000000); + ws[125] = BOOST_MATH_TEST_VALUE(RealType, 15.70603647419592962675396422855255261373445463144900248624737121930916887983366690742461452872492017); + zs[126] = BOOST_MATH_TEST_VALUE(RealType, 208037473.8999999985098838806152343750000000000000000000000000000000000000000000000000000000000000000); + ws[126] = BOOST_MATH_TEST_VALUE(RealType, 16.35848223073077299062251727505489121683259009838940921798588655999804611259258002812224135777088225); + zs[127] = BOOST_MATH_TEST_VALUE(RealType, 208037474.3999999985098838806152343750000000000000000000000000000000000000000000000000000000000000000); + ws[127] = BOOST_MATH_TEST_VALUE(RealType, 16.35848223299572857263748180340545017346327532474491820120184954137107185953921166019993001720173076); + zs[128] = BOOST_MATH_TEST_VALUE(RealType, 208037474.8999999985098838806152343750000000000000000000000000000000000000000000000000000000000000000); + ws[128] = BOOST_MATH_TEST_VALUE(RealType, 16.35848223526068414922688843525885798316030222323873469187325647317943052465221773791004107044449214); + zs[129] = BOOST_MATH_TEST_VALUE(RealType, 208037475.3999999985098838806152343750000000000000000000000000000000000000000000000000000000000000000); + ws[129] = BOOST_MATH_TEST_VALUE(RealType, 16.35848223752563972039073719664683805774368875669934675288398977599557153297961083834670781371769393); + zs[130] = BOOST_MATH_TEST_VALUE(RealType, 208037475.8999999985098838806152343750000000000000000000000000000000000000000000000000000000000000000); + ws[130] = BOOST_MATH_TEST_VALUE(RealType, 16.35848223979059528612902811360111362158185991940560941697071272367978154194499902342370856607708754); + zs[131] = BOOST_MATH_TEST_VALUE(RealType, 416074952.2999999970197677612304687500000000000000000000000000000000000000000000000000000000000000000); + ws[131] = BOOST_MATH_TEST_VALUE(RealType, 17.01243162682130034575873110256608416240774650633244657569787078893008324146198524461655542099298038); + zs[132] = BOOST_MATH_TEST_VALUE(RealType, 416074952.7999999970197677612304687500000000000000000000000000000000000000000000000000000000000000000); + ws[132] = BOOST_MATH_TEST_VALUE(RealType, 17.01243162795629150708082853641104106051019632512982699681254455598867301594442867945136512864263362); + zs[133] = BOOST_MATH_TEST_VALUE(RealType, 416074953.2999999970197677612304687500000000000000000000000000000000000000000000000000000000000000000); + ws[133] = BOOST_MATH_TEST_VALUE(RealType, 17.01243162909128266704320348800926473937585791237790855606445141461836852095077452961626092636714582); + zs[134] = BOOST_MATH_TEST_VALUE(RealType, 416074953.7999999970197677612304687500000000000000000000000000000000000000000000000000000000000000000); + ws[134] = BOOST_MATH_TEST_VALUE(RealType, 17.01243163022627382564585596062316405185836375654028401358545369509940490853717120734831332950839378); + zs[135] = BOOST_MATH_TEST_VALUE(RealType, 416074954.2999999970197677612304687500000000000000000000000000000000000000000000000000000000000000000); + ws[135] = BOOST_MATH_TEST_VALUE(RealType, 17.01243163136126498288878595751514783906405969399381198927824453551799680870112429531524827406849599); + zs[136] = BOOST_MATH_TEST_VALUE(RealType, 832149909.0999999940395355224609375000000000000000000000000000000000000000000000000000000000000000000); + ws[136] = BOOST_MATH_TEST_VALUE(RealType, 17.66778049214031531812887566464334167360339296689778348663603985291368769599603595003791335301847127); + zs[137] = BOOST_MATH_TEST_VALUE(RealType, 832149909.5999999940395355224609375000000000000000000000000000000000000000000000000000000000000000000); + ws[137] = BOOST_MATH_TEST_VALUE(RealType, 17.66778049270898194728430180770507660352501688482825963526508387721596470881802640086432444438183220); + zs[138] = BOOST_MATH_TEST_VALUE(RealType, 832149910.0999999940395355224609375000000000000000000000000000000000000000000000000000000000000000000); + ws[138] = BOOST_MATH_TEST_VALUE(RealType, 17.66778049327764857609902322798165858268194375878492382051153135096018706001421025620618302837247343); + zs[139] = BOOST_MATH_TEST_VALUE(RealType, 832149910.5999999940395355224609375000000000000000000000000000000000000000000000000000000000000000000); + ws[139] = BOOST_MATH_TEST_VALUE(RealType, 17.66778049384631520457303992588186753608991034689224716778630078855718157314806355505907287211879952); + zs[140] = BOOST_MATH_TEST_VALUE(RealType, 832149911.0999999940395355224609375000000000000000000000000000000000000000000000000000000000000000000); + ws[140] = BOOST_MATH_TEST_VALUE(RealType, 17.66778049441498183270635190181448338802862077472029294388350982070482138347224074032285443619695132); + zs[141] = BOOST_MATH_TEST_VALUE(RealType, 1664299822.699999988079071044921875000000000000000000000000000000000000000000000000000000000000000000); + ws[141] = BOOST_MATH_TEST_VALUE(RealType, 18.32443493355098619384682217293063408860906200997313752841900524481309067580120995737616551816092439); + zs[142] = BOOST_MATH_TEST_VALUE(RealType, 1664299823.199999988079071044921875000000000000000000000000000000000000000000000000000000000000000000); + ws[142] = BOOST_MATH_TEST_VALUE(RealType, 18.32443493383586636729058593564510700968056859723407482295764411091295912034128445270765389474245827); + zs[143] = BOOST_MATH_TEST_VALUE(RealType, 1664299823.699999988079071044921875000000000000000000000000000000000000000000000000000000000000000000); + ws[143] = BOOST_MATH_TEST_VALUE(RealType, 18.32443493412074654064899329117538024263559388031556198852503241876369903917896474239140595505063322); + zs[144] = BOOST_MATH_TEST_VALUE(RealType, 1664299824.199999988079071044921875000000000000000000000000000000000000000000000000000000000000000000); + ws[144] = BOOST_MATH_TEST_VALUE(RealType, 18.32443493440562671392204423957266503795757499599462266552348787036107193130165331139452279532396827); + zs[145] = BOOST_MATH_TEST_VALUE(RealType, 1664299824.699999988079071044921875000000000000000000000000000000000000000000000000000000000000000000); + ws[145] = BOOST_MATH_TEST_VALUE(RealType, 18.32443493469050688710973878088817264608384098178071957390837672366993756271957964256600743216105241); + zs[146] = BOOST_MATH_TEST_VALUE(RealType, 3328599649.899999976158142089843750000000000000000000000000000000000000000000000000000000000000000000); + ws[146] = BOOST_MATH_TEST_VALUE(RealType, 18.98231003239481891260092191504387611307556374245363459040509191182476364522292852639675828304549626); + zs[147] = BOOST_MATH_TEST_VALUE(RealType, 3328599650.399999976158142089843750000000000000000000000000000000000000000000000000000000000000000000); + ws[147] = BOOST_MATH_TEST_VALUE(RealType, 18.98231003253751491629227276099735868489913807533078209230206170806009818301507483588395812018180071); + zs[148] = BOOST_MATH_TEST_VALUE(RealType, 3328599650.899999976158142089843750000000000000000000000000000000000000000000000000000000000000000000); + ws[148] = BOOST_MATH_TEST_VALUE(RealType, 18.98231003268021091996224244869947622441697585814089764491702992369913535253679093973930949506347048); + zs[149] = BOOST_MATH_TEST_VALUE(RealType, 3328599651.399999976158142089843750000000000000000000000000000000000000000000000000000000000000000000); + ws[149] = BOOST_MATH_TEST_VALUE(RealType, 18.98231003282290692361083097815664339084466388779045270504033488281798754360146784756669433227860478); + zs[150] = BOOST_MATH_TEST_VALUE(RealType, 3328599651.899999976158142089843750000000000000000000000000000000000000000000000000000000000000000000); + ws[150] = BOOST_MATH_TEST_VALUE(RealType, 18.98231003296560292723803834937527484339490103369072191109295056853780039115858285449484374166727442); + zs[151] = BOOST_MATH_TEST_VALUE(RealType, 6657199304.299999952316284179687500000000000000000000000000000000000000000000000000000000000000000000); + ws[151] = BOOST_MATH_TEST_VALUE(RealType, 19.64132875213179003616975291758951989874401990433758371552185122694920942525627888352145273462707829); + zs[152] = BOOST_MATH_TEST_VALUE(RealType, 6657199304.799999952316284179687500000000000000000000000000000000000000000000000000000000000000000000); + ws[152] = BOOST_MATH_TEST_VALUE(RealType, 19.64132875220325804117690436378168767212426802746287406741611709213764258286377104459764498688864645); + zs[153] = BOOST_MATH_TEST_VALUE(RealType, 6657199305.299999952316284179687500000000000000000000000000000000000000000000000000000000000000000000); + ws[153] = BOOST_MATH_TEST_VALUE(RealType, 19.64132875227472604617870068525483911300930564165365547681598983747537164183343994434536282821758671); + zs[154] = BOOST_MATH_TEST_VALUE(RealType, 6657199305.799999952316284179687500000000000000000000000000000000000000000000000000000000000000000000); + ws[154] = BOOST_MATH_TEST_VALUE(RealType, 19.64132875234619405117514188200977760121223842398566254787219879319150457646967224084449244020129346); + zs[155] = BOOST_MATH_TEST_VALUE(RealType, 6657199306.299999952316284179687500000000000000000000000000000000000000000000000000000000000000000000); + ws[155] = BOOST_MATH_TEST_VALUE(RealType, 19.64132875241766205616622795404730651654599119614988454540132958996734683240549999645255105620924194); + zs[156] = BOOST_MATH_TEST_VALUE(RealType, 13314398613.09999990463256835937500000000000000000000000000000000000000000000000000000000000000000000); + ws[156] = BOOST_MATH_TEST_VALUE(RealType, 20.30142100521655914391255442878301089651369196196103134174539854119020213383927831733183603430177342); + zs[157] = BOOST_MATH_TEST_VALUE(RealType, 13314398613.59999990463256835937500000000000000000000000000000000000000000000000000000000000000000000); + ws[157] = BOOST_MATH_TEST_VALUE(RealType, 20.30142100525234952404035395706360529741527156245298468796715007831095483401537550300887615324478886); + zs[158] = BOOST_MATH_TEST_VALUE(RealType, 13314398614.09999990463256835937500000000000000000000000000000000000000000000000000000000000000000000); + ws[158] = BOOST_MATH_TEST_VALUE(RealType, 20.30142100528813990416681239948722494340433727853716710673987742922492342629617928698493424484032660); + zs[159] = BOOST_MATH_TEST_VALUE(RealType, 13314398614.59999990463256835937500000000000000000000000000000000000000000000000000000000000000000000); + ws[159] = BOOST_MATH_TEST_VALUE(RealType, 20.30142100532393028429192975605397043801464163741054316603439612006945607064743419379856370010506017); + zs[160] = BOOST_MATH_TEST_VALUE(RealType, 13314398615.09999990463256835937500000000000000000000000000000000000000000000000000000000000000000000); + ws[160] = BOOST_MATH_TEST_VALUE(RealType, 20.30142100535972066441570602676394238477992584177232532005791683216204582260476049842371709123221255); + zs[161] = BOOST_MATH_TEST_VALUE(RealType, 26628797230.69999980926513671875000000000000000000000000000000000000000000000000000000000000000000000); + ws[161] = BOOST_MATH_TEST_VALUE(RealType, 20.96252285249100030290397518601237584604981130278135272151318314970663709603528431386852754379112730); + zs[162] = BOOST_MATH_TEST_VALUE(RealType, 26628797231.19999980926513671875000000000000000000000000000000000000000000000000000000000000000000000); + ws[162] = BOOST_MATH_TEST_VALUE(RealType, 20.96252285250892202655550269280724503656839238502424605070290458403293889858635506895301235328962628); + zs[163] = BOOST_MATH_TEST_VALUE(RealType, 26628797231.69999980926513671875000000000000000000000000000000000000000000000000000000000000000000000); + ws[163] = BOOST_MATH_TEST_VALUE(RealType, 20.96252285252684375020669438704809175058008607738171622380516384350651954854873527952764745960194675); + zs[164] = BOOST_MATH_TEST_VALUE(RealType, 26628797232.19999980926513671875000000000000000000000000000000000000000000000000000000000000000000000); + ws[164] = BOOST_MATH_TEST_VALUE(RealType, 20.96252285254476547385755026873492858475358446577888309438244123935827841754860782205245677270931493); + zs[165] = BOOST_MATH_TEST_VALUE(RealType, 26628797232.69999980926513671875000000000000000000000000000000000000000000000000000000000000000000000); + ws[165] = BOOST_MATH_TEST_VALUE(RealType, 20.96252285256268719750807033786776813575757892712773332275219858225617530315647886304839621190128467); + zs[166] = BOOST_MATH_TEST_VALUE(RealType, 53257594465.89999961853027343750000000000000000000000000000000000000000000000000000000000000000000000); + ws[166] = BOOST_MATH_TEST_VALUE(RealType, 21.62457581338519341205251851678920458391270655214844894715960888032707282421057623183584027330480633); + zs[167] = BOOST_MATH_TEST_VALUE(RealType, 53257594466.39999961853027343750000000000000000000000000000000000000000000000000000000000000000000000); + ws[167] = BOOST_MATH_TEST_VALUE(RealType, 21.62457581339416678276021956345172476031736610096020431411495093672867810851785199503170153825356689); + zs[168] = BOOST_MATH_TEST_VALUE(RealType, 53257594466.89999961853027343750000000000000000000000000000000000000000000000000000000000000000000000); + ws[168] = BOOST_MATH_TEST_VALUE(RealType, 21.62457581340314015346783652970955706237153204994825959199820337645288096708677451415833137778699486); + zs[169] = BOOST_MATH_TEST_VALUE(RealType, 53257594467.39999961853027343750000000000000000000000000000000000000000000000000000000000000000000000); + ws[169] = BOOST_MATH_TEST_VALUE(RealType, 21.62457581341211352417536941556270306715209214940104899493615505349319261368609864010882236880736924); + zs[170] = BOOST_MATH_TEST_VALUE(RealType, 53257594467.89999961853027343750000000000000000000000000000000000000000000000000000000000000000000000); + ws[170] = BOOST_MATH_TEST_VALUE(RealType, 21.62457581342108689488281822101116435173593410522139124663366619300728455522058827136186640157150006); + zs[171] = BOOST_MATH_TEST_VALUE(RealType, 106515188936.2999992370605468750000000000000000000000000000000000000000000000000000000000000000000000); + ws[171] = BOOST_MATH_TEST_VALUE(RealType, 22.28752626920637793567947968920002916518604504482941952960611736969307899126632949710731838314939535); + zs[172] = BOOST_MATH_TEST_VALUE(RealType, 106515188936.7999992370605468750000000000000000000000000000000000000000000000000000000000000000000000); + ws[172] = BOOST_MATH_TEST_VALUE(RealType, 22.28752626921087052760828375602269251105477904207815836374209426134525952488796027799984818720270105); + zs[173] = BOOST_MATH_TEST_VALUE(RealType, 106515188937.2999992370605468750000000000000000000000000000000000000000000000000000000000000000000000); + ws[173] = BOOST_MATH_TEST_VALUE(RealType, 22.28752626921536311953706677275954356032288516798309826935596847224545105365234647336923162745148650); + zs[174] = BOOST_MATH_TEST_VALUE(RealType, 106515188937.7999992370605468750000000000000000000000000000000000000000000000000000000000000000000000); + ws[174] = BOOST_MATH_TEST_VALUE(RealType, 22.28752626921985571146582873941058251041835477955178166028729368533877454281235062918122417686844554); + zs[175] = BOOST_MATH_TEST_VALUE(RealType, 106515188938.2999992370605468750000000000000000000000000000000000000000000000000000000000000000000000); + ws[175] = BOOST_MATH_TEST_VALUE(RealType, 22.28752626922434830339456965597580955876917923101340004236523230885349136854795158825395309771408668); + zs[176] = BOOST_MATH_TEST_VALUE(RealType, 213030377877.0999984741210937500000000000000000000000000000000000000000000000000000000000000000000000); + ws[176] = BOOST_MATH_TEST_VALUE(RealType, 22.95132494498044370189057193061229322652798069141485425830911821689634860387911575520267236257752886); + zs[177] = BOOST_MATH_TEST_VALUE(RealType, 213030377877.5999984741210937500000000000000000000000000000000000000000000000000000000000000000000000); + ws[177] = BOOST_MATH_TEST_VALUE(RealType, 22.95132494498269279111869452328160161214112251666554529993600600683165630516488115832469896181046045); + zs[178] = BOOST_MATH_TEST_VALUE(RealType, 213030377878.0999984741210937500000000000000000000000000000000000000000000000000000000000000000000000); + ws[178] = BOOST_MATH_TEST_VALUE(RealType, 22.95132494498494188034681184635345858036581911693953330207290531058251991996389235617064799550256701); + zs[179] = BOOST_MATH_TEST_VALUE(RealType, 213030377878.5999984741210937500000000000000000000000000000000000000000000000000000000000000000000000); + ws[179] = BOOST_MATH_TEST_VALUE(RealType, 22.95132494498719096957492389982786415591514868991446226878757600605585200116652511909077437303220322); + zs[180] = BOOST_MATH_TEST_VALUE(RealType, 213030377879.0999984741210937500000000000000000000000000000000000000000000000000000000000000000000000); + ws[180] = BOOST_MATH_TEST_VALUE(RealType, 22.95132494498944005880303068370481836350218943309407900398512057690019248825245765368449728229683978); + zs[181] = BOOST_MATH_TEST_VALUE(RealType, 426060755758.6999969482421875000000000000000000000000000000000000000000000000000000000000000000000000); + ws[181] = BOOST_MATH_TEST_VALUE(RealType, 23.61592645786617198666287725520753845230512592375445890316693635014712570198963226722376898746719788); + zs[182] = BOOST_MATH_TEST_VALUE(RealType, 426060755759.1999969482421875000000000000000000000000000000000000000000000000000000000000000000000000); + ws[182] = BOOST_MATH_TEST_VALUE(RealType, 23.61592645786729785413748555882136649105347335405111452573107829620408251494572350634646372518383704); + zs[183] = BOOST_MATH_TEST_VALUE(RealType, 426060755759.6999969482421875000000000000000000000000000000000000000000000000000000000000000000000000); + ws[183] = BOOST_MATH_TEST_VALUE(RealType, 23.61592645786842372161209254336341886225886040142987940947830085760720112665756558438930745003988259); + zs[184] = BOOST_MATH_TEST_VALUE(RealType, 426060755760.1999969482421875000000000000000000000000000000000000000000000000000000000000000000000000); + ws[184] = BOOST_MATH_TEST_VALUE(RealType, 23.61592645786954958908669820883369556901450401232685427846511608592597720877347644103130699500020980); + zs[185] = BOOST_MATH_TEST_VALUE(RealType, 426060755760.6999969482421875000000000000000000000000000000000000000000000000000000000000000000000000); + ws[185] = BOOST_MATH_TEST_VALUE(RealType, 23.61592645787067545656130255523219661441362113316725652002816962722163580709685521423287347532232663); + zs[186] = BOOST_MATH_TEST_VALUE(RealType, 852121511521.8999938964843750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[186] = BOOST_MATH_TEST_VALUE(RealType, 24.28128892222268328128985001144764937331876138884560895942339750264590092000743925470556345687342935); + zs[187] = BOOST_MATH_TEST_VALUE(RealType, 852121511522.3999938964843750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[187] = BOOST_MATH_TEST_VALUE(RealType, 24.28128892222324684237927811409049669410007439237129556446372910358198486719174460302964062617263997); + zs[188] = BOOST_MATH_TEST_VALUE(RealType, 852121511522.8999938964843750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[188] = BOOST_MATH_TEST_VALUE(RealType, 24.28128892222381040346870588656954830537234790758650044870333521914480895767426200215549894604462944); + zs[189] = BOOST_MATH_TEST_VALUE(RealType, 852121511523.3999938964843750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[189] = BOOST_MATH_TEST_VALUE(RealType, 24.28128892222437396455813332888480420752271669125958665876145325130479060260809395708493929658437074); + zs[190] = BOOST_MATH_TEST_VALUE(RealType, 852121511523.8999938964843750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[190] = BOOST_MATH_TEST_VALUE(RealType, 24.28128892222493752564756044103626440093831550015823616066865071071416085939189362440560522437633662); + zs[191] = BOOST_MATH_TEST_VALUE(RealType, 1704243023048.299987792968750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[191] = BOOST_MATH_TEST_VALUE(RealType, 24.94737360307934242599198887438952878908310927656184464570761925753018240286868931047379101991192915); + zs[192] = BOOST_MATH_TEST_VALUE(RealType, 1704243023048.799987792968750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[192] = BOOST_MATH_TEST_VALUE(RealType, 24.94737360307962450443999814141844483539218897580562586948087460916859526796854661158129821949554554); + zs[193] = BOOST_MATH_TEST_VALUE(RealType, 1704243023049.299987792968750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[193] = BOOST_MATH_TEST_VALUE(RealType, 24.94737360307990658288800732581258578292473970863909517564631259029126397702972526621236324413898654); + zs[194] = BOOST_MATH_TEST_VALUE(RealType, 1704243023049.799987792968750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[194] = BOOST_MATH_TEST_VALUE(RealType, 24.94737360308018866133601642757195163172921046426642186059476077116782502974396487792107071563852968); + zs[195] = BOOST_MATH_TEST_VALUE(RealType, 1704243023050.299987792968750000000000000000000000000000000000000000000000000000000000000000000000000); + ws[195] = BOOST_MATH_TEST_VALUE(RealType, 24.94737360308047073978402544669654238185405023189173260158888945690205253434326923773189194023738864); + zs[196] = BOOST_MATH_TEST_VALUE(RealType, 3408486046101.099975585937500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[196] = BOOST_MATH_TEST_VALUE(RealType, 25.61414461111548947260493867878972043152010342814420318471604738869697286844100478961752318507519036); + zs[197] = BOOST_MATH_TEST_VALUE(RealType, 3408486046101.599975585937500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[197] = BOOST_MATH_TEST_VALUE(RealType, 25.61414461111563065346677642310736687968026218525976239525273457263820521539063299775063487387395491); + zs[198] = BOOST_MATH_TEST_VALUE(RealType, 3408486046102.099975585937500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[198] = BOOST_MATH_TEST_VALUE(RealType, 25.61414461111577183432861414674405116970646776101208949311878694889082271860331380169436692589290008); + zs[199] = BOOST_MATH_TEST_VALUE(RealType, 3408486046102.599975585937500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[199] = BOOST_MATH_TEST_VALUE(RealType, 25.61414461111591301519045184969977330160478305423319389187668123911964696321646253276250725578473047); + zs[200] = BOOST_MATH_TEST_VALUE(RealType, 3408486046103.099975585937500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[200] = BOOST_MATH_TEST_VALUE(RealType, 25.61414461111605419605228953197453327538127096375508233833690347792194785120108760652931053928666785); + zs[201] = BOOST_MATH_TEST_VALUE(RealType, 6816972092206.699951171875000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[201] = BOOST_MATH_TEST_VALUE(RealType, 26.28156863336777149103602875189240858590017172273907420428241974657782598001971183829692697893931030); + zs[202] = BOOST_MATH_TEST_VALUE(RealType, 6816972092207.199951171875000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[202] = BOOST_MATH_TEST_VALUE(RealType, 26.28156863336784214888845714766036358708919247411311945160997461946071687776487761293647943181961882); + zs[203] = BOOST_MATH_TEST_VALUE(RealType, 6816972092207.699951171875000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[203] = BOOST_MATH_TEST_VALUE(RealType, 26.28156863336791280674088553825278629338313564287800253072882363885000489322789589683564459399860775); + zs[204] = BOOST_MATH_TEST_VALUE(RealType, 6816972092208.199951171875000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[204] = BOOST_MATH_TEST_VALUE(RealType, 26.28156863336798346459331392366967670478275989571118963232699709422043712865525671390927105068828991); + zs[205] = BOOST_MATH_TEST_VALUE(RealType, 6816972092208.699951171875000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[205] = BOOST_MATH_TEST_VALUE(RealType, 26.28156863336805412244574230391103482128882389929014678023920695547828528484685657699485259769208741); + zs[206] = BOOST_MATH_TEST_VALUE(RealType, 13633944184417.89990234375000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[206] = BOOST_MATH_TEST_VALUE(RealType, 26.94961469479482406519801256975073261795345435020419867463744516732345674294492529228061805959732327); + zs[207] = BOOST_MATH_TEST_VALUE(RealType, 13633944184418.39990234375000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[207] = BOOST_MATH_TEST_VALUE(RealType, 26.94961469479485942625415366326146401152634296784764225669862897123975110273521017330868675363150448); + zs[208] = BOOST_MATH_TEST_VALUE(RealType, 13633944184418.89990234375000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[208] = BOOST_MATH_TEST_VALUE(RealType, 26.94961469479489478731029475547705331300159611152098923590641458690234001429707091782045185453438171); + zs[209] = BOOST_MATH_TEST_VALUE(RealType, 13633944184419.39990234375000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[209] = BOOST_MATH_TEST_VALUE(RealType, 26.94961469479493014836643584639750052237930871016343368359473040533580595453533790563068986805724019); + zs[210] = BOOST_MATH_TEST_VALUE(RealType, 13633944184419.89990234375000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[210] = BOOST_MATH_TEST_VALUE(RealType, 26.94961469479496550942257693602280563965957569271416966065840246264353271487273203593602827136860754); + zs[211] = BOOST_MATH_TEST_VALUE(RealType, 27267888368840.29980468750000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[211] = BOOST_MATH_TEST_VALUE(RealType, 27.61825394658132365321120256576467284757880630504909781214698429280000692432972722344046738139460516); + zs[212] = BOOST_MATH_TEST_VALUE(RealType, 27267888368840.79980468750000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[212] = BOOST_MATH_TEST_VALUE(RealType, 27.61825394658134134906748186542924183870772699960645627424489223278978300139646551878816289033156892); + zs[213] = BOOST_MATH_TEST_VALUE(RealType, 27267888368841.29980468750000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[213] = BOOST_MATH_TEST_VALUE(RealType, 27.61825394658135904492376116476972541669907157102168356799570843777496579434166012376207829201011287); + zs[214] = BOOST_MATH_TEST_VALUE(RealType, 27267888368841.79980468750000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[214] = BOOST_MATH_TEST_VALUE(RealType, 27.61825394658137674078004046378612358155285189678948212439453829367032310042341489097274555293104964); + zs[215] = BOOST_MATH_TEST_VALUE(RealType, 27267888368842.29980468750000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[215] = BOOST_MATH_TEST_VALUE(RealType, 27.61825394658139443663631976247843633326907985440455437378340280356184152787821056110486626668344188); + zs[216] = BOOST_MATH_TEST_VALUE(RealType, 54535776737685.09960937500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[216] = BOOST_MATH_TEST_VALUE(RealType, 28.28745947768658520727223095526336163825405277084208702812195528505679434221769385747727596125338626); + zs[217] = BOOST_MATH_TEST_VALUE(RealType, 54535776737685.59960937500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[217] = BOOST_MATH_TEST_VALUE(RealType, 28.28745947768659406252057469058839388454672293394318546730557386127002114050381424035876354103192624); + zs[218] = BOOST_MATH_TEST_VALUE(RealType, 54535776737686.09960937500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[218] = BOOST_MATH_TEST_VALUE(RealType, 28.28745947768660291776891842583233326734639195028174391562886488418853280961627679416432912568037643); + zs[219] = BOOST_MATH_TEST_VALUE(RealType, 54535776737686.59960937500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[219] = BOOST_MATH_TEST_VALUE(RealType, 28.28745947768661177301726216099517978665306130590007248679624798101760603565428399982488746458503134); + zs[220] = BOOST_MATH_TEST_VALUE(RealType, 54535776737687.09960937500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[220] = BOOST_MATH_TEST_VALUE(RealType, 28.28745947768662062826560589607693344246673248684048129447128687164847423418296378412381527867603611); + zs[221] = BOOST_MATH_TEST_VALUE(RealType, 109071553475374.6992187500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[221] = BOOST_MATH_TEST_VALUE(RealType, 28.95720614666117150245004622760057983418314410522200232704276775862146736266761022246497551058785007); + zs[222] = BOOST_MATH_TEST_VALUE(RealType, 109071553475375.1992187500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[222] = BOOST_MATH_TEST_VALUE(RealType, 28.95720614666117593357355743548739761689791124679984859813361369105181180764744313352061153147051630); + zs[223] = BOOST_MATH_TEST_VALUE(RealType, 109071553475375.6992187500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[223] = BOOST_MATH_TEST_VALUE(RealType, 28.95720614666118036469706864335392511390934879372874136387705864492100434790697368864211343956938842); + zs[224] = BOOST_MATH_TEST_VALUE(RealType, 109071553475376.1992187500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[224] = BOOST_MATH_TEST_VALUE(RealType, 28.95720614666118479582057985120016232521745693192563248069260165217440327859683071396461341530343065); + zs[225] = BOOST_MATH_TEST_VALUE(RealType, 109071553475376.6992187500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[225] = BOOST_MATH_TEST_VALUE(RealType, 28.95720614666118922694409105902610925082223584730747380499718597765232850574002390696473010380772407); + zs[226] = BOOST_MATH_TEST_VALUE(RealType, 218143106950753.8984375000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[226] = BOOST_MATH_TEST_VALUE(RealType, 29.62747043118774188445791042660254784305836995418567274505820949514291909017768623167600827442630858); + zs[227] = BOOST_MATH_TEST_VALUE(RealType, 218143106950754.3984375000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[227] = BOOST_MATH_TEST_VALUE(RealType, 29.62747043118774410169407734916144601996690190995667210727468326746331358762853812415838063247614151); + zs[228] = BOOST_MATH_TEST_VALUE(RealType, 218143106950754.8984375000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[228] = BOOST_MATH_TEST_VALUE(RealType, 29.62747043118774631893024427171526754670674911118564686113352807043233143508066106374847716587931185); + zs[229] = BOOST_MATH_TEST_VALUE(RealType, 218143106950755.3984375000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[229] = BOOST_MATH_TEST_VALUE(RealType, 29.62747043118774853616641119426401242327791158113151699337805013921071479703774514043229472570138003); + zs[230] = BOOST_MATH_TEST_VALUE(RealType, 218143106950755.8984375000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[230] = BOOST_MATH_TEST_VALUE(RealType, 29.62747043118775075340257811680768064968038934305320249075139583789870247295334960013555124352240919); + zs[231] = BOOST_MATH_TEST_VALUE(RealType, 436286213901512.2968750000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[231] = BOOST_MATH_TEST_VALUE(RealType, 30.29823029316507210180178060183512748657385641403633979025174401415202721913219462712200443246592017); + zs[232] = BOOST_MATH_TEST_VALUE(RealType, 436286213901512.7968750000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[232] = BOOST_MATH_TEST_VALUE(RealType, 30.29823029316507321122179075661323950744341840810124864190846957886463039301370908060223378776053761); + zs[233] = BOOST_MATH_TEST_VALUE(RealType, 436286213901513.2968750000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[233] = BOOST_MATH_TEST_VALUE(RealType, 30.29823029316507432064180091139008139023924952729670215908087118481612362461688278748768609693129214); + zs[234] = BOOST_MATH_TEST_VALUE(RealType, 436286213901513.7968750000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[234] = BOOST_MATH_TEST_VALUE(RealType, 30.29823029316507543006181106616565313496134977453237197516164536262012622641950793744512740976903471); + zs[235] = BOOST_MATH_TEST_VALUE(RealType, 436286213901514.2968750000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[235] = BOOST_MATH_TEST_VALUE(RealType, 30.29823029316507653948182122093995474160971915271792972354347864284901025700020408100899889264653839); + zs[236] = BOOST_MATH_TEST_VALUE(RealType, 872572427803029.0937500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[236] = BOOST_MATH_TEST_VALUE(RealType, 30.96946505745926454870573870105381204121080031682700579571979417608023815834802026646642551756529303); + zs[237] = BOOST_MATH_TEST_VALUE(RealType, 872572427803029.5937500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[237] = BOOST_MATH_TEST_VALUE(RealType, 30.96946505745926510380014769927740975753101903356685400661074674057071774744000291503524870439239858); + zs[238] = BOOST_MATH_TEST_VALUE(RealType, 872572427803030.0937500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[238] = BOOST_MATH_TEST_VALUE(RealType, 30.96946505745926565889455669750068970579501127050404305753044873046035266500692837850798788777465676); + zs[239] = BOOST_MATH_TEST_VALUE(RealType, 872572427803030.5937500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[239] = BOOST_MATH_TEST_VALUE(RealType, 30.96946505745926621398896569572365188600277702800255782702903047591596266870263378125202082655252570); + zs[240] = BOOST_MATH_TEST_VALUE(RealType, 872572427803031.0937500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[240] = BOOST_MATH_TEST_VALUE(RealType, 30.96946505745926676908337469394629629815431630642638319365662168161753441065238424482444892944732090); + zs[241] = BOOST_MATH_TEST_VALUE(RealType, 1745144855606062.687500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[241] = BOOST_MATH_TEST_VALUE(RealType, 31.64115530270368555045568380920065773046212688909377117164466588005747217968807471779219205518025563); + zs[242] = BOOST_MATH_TEST_VALUE(RealType, 1745144855606063.187500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[242] = BOOST_MATH_TEST_VALUE(RealType, 31.64115530270368582818730773733152774326033355552322481669720170248660524963440150598888428761058290); + zs[243] = BOOST_MATH_TEST_VALUE(RealType, 1745144855606063.687500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[243] = BOOST_MATH_TEST_VALUE(RealType, 31.64115530270368610591893166546231825808704138452046802967409474774871621840817874673003149159950917); + zs[244] = BOOST_MATH_TEST_VALUE(RealType, 1745144855606064.187500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[244] = BOOST_MATH_TEST_VALUE(RealType, 31.64115530270368638365055559359302927494225037613103195710423753246607554009944184530654853462065205); + zs[245] = BOOST_MATH_TEST_VALUE(RealType, 1745144855606064.687500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[245] = BOOST_MATH_TEST_VALUE(RealType, 31.64115530270368666138217952172366079382596053040044774551652253413904860066772832705321064573507936); + zs[246] = BOOST_MATH_TEST_VALUE(RealType, 3490289711212129.875000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[246] = BOOST_MATH_TEST_VALUE(RealType, 32.31328276274725912255296233554695621993095527834620867411002883617418802445848848920754168937963900); + zs[247] = BOOST_MATH_TEST_VALUE(RealType, 3490289711212130.375000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[247] = BOOST_MATH_TEST_VALUE(RealType, 32.31328276274725926150732198502036790376252498771483422694718006966861906633408209207371317438042436); + zs[248] = BOOST_MATH_TEST_VALUE(RealType, 3490289711212130.875000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[248] = BOOST_MATH_TEST_VALUE(RealType, 32.31328276274725940046168163449375969968196897954449339669242357827673003495386979661882340839494652); + zs[249] = BOOST_MATH_TEST_VALUE(RealType, 3490289711212131.375000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[249] = BOOST_MATH_TEST_VALUE(RealType, 32.31328276274725953941604128396713160768928725384088153564235657069057463593847925585888659769685682); + zs[250] = BOOST_MATH_TEST_VALUE(RealType, 3490289711212131.875000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[250] = BOOST_MATH_TEST_VALUE(RealType, 32.31328276274725967837040093344048362778447981060969399609357625315535190876608557675610677996463049); + zs[251] = BOOST_MATH_TEST_VALUE(RealType, 6980579422424264.250000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[251] = BOOST_MATH_TEST_VALUE(RealType, 32.98583023753604679088719826542088155377570542413337629407446260913838808164256711555296996403852860); + zs[252] = BOOST_MATH_TEST_VALUE(RealType, 6980579422424264.750000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[252] = BOOST_MATH_TEST_VALUE(RealType, 32.98583023753604686040692677719047881106035406644182281598485405113601440205771668223737335876041818); + zs[253] = BOOST_MATH_TEST_VALUE(RealType, 6980579422424265.250000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[253] = BOOST_MATH_TEST_VALUE(RealType, 32.98583023753604692992665528896007109314624214905869648472859408505262279189002691227175712262681487); + zs[254] = BOOST_MATH_TEST_VALUE(RealType, 6980579422424265.750000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[254] = BOOST_MATH_TEST_VALUE(RealType, 32.98583023753604699944638380072965840003336967198470969416928902364624408970718516308377862696183264); + zs[255] = BOOST_MATH_TEST_VALUE(RealType, 6980579422424266.250000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[255] = BOOST_MATH_TEST_VALUE(RealType, 32.98583023753604706896611231249924073172173663522057483817054517952187667696583584412183600018203736); + zs[256] = BOOST_MATH_TEST_VALUE(RealType, 13961158844848533.00000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[256] = BOOST_MATH_TEST_VALUE(RealType, 33.65878151237097095124298518143702077667858405885409410230992311053881919684167704487215990113228857); + zs[257] = BOOST_MATH_TEST_VALUE(RealType, 13961158844848533.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[257] = BOOST_MATH_TEST_VALUE(RealType, 33.65878151237097098602331016061647350048233624732159922625861798362865689925616857240391773797386011); + zs[258] = BOOST_MATH_TEST_VALUE(RealType, 13961158844848534.00000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[258] = BOOST_MATH_TEST_VALUE(RealType, 33.65878151237097102080363513979592497971278809664223503486445169932919366667254889157695575939580298); + zs[259] = BOOST_MATH_TEST_VALUE(RealType, 13961158844848534.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[259] = BOOST_MATH_TEST_VALUE(RealType, 33.65878151237097105558396011897537521436993960681609063435549611864140613496327710388308960838614952); + zs[260] = BOOST_MATH_TEST_VALUE(RealType, 13961158844848535.00000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[260] = BOOST_MATH_TEST_VALUE(RealType, 33.65878151237097109036428509815482420445379077784325513095982310255670016959177612483326392564338403); + zs[261] = BOOST_MATH_TEST_VALUE(RealType, 27922317689697070.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[261] = BOOST_MATH_TEST_VALUE(RealType, 34.33212128461954182192055400546316699688336088176596379963232567718408755304304153654131361648983188); + zs[262] = BOOST_MATH_TEST_VALUE(RealType, 27922317689697071.00000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[262] = BOOST_MATH_TEST_VALUE(RealType, 34.33212128461954183932056272117319130023138040040443817185436738411951668715588692235416442685371045); + zs[263] = BOOST_MATH_TEST_VALUE(RealType, 27922317689697071.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[263] = BOOST_MATH_TEST_VALUE(RealType, 34.33212128461954185672057143688321529225011483876409341147922608312437009263576524224673465664622416); + zs[264] = BOOST_MATH_TEST_VALUE(RealType, 27922317689697072.00000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[264] = BOOST_MATH_TEST_VALUE(RealType, 34.33212128461954187412058015259323897293956419684494066363206316215367067849034858025290827895879418); + zs[265] = BOOST_MATH_TEST_VALUE(RealType, 27922317689697072.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[265] = BOOST_MATH_TEST_VALUE(RealType, 34.33212128461954189152058886830326234229972847464699107343804000916184280580506932042040723667339789); + zs[266] = BOOST_MATH_TEST_VALUE(RealType, 55844635379394145.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[266] = BOOST_MATH_TEST_VALUE(RealType, 35.00583509707518695935331739482145723160151536139963974678105921205914075721658873691195091665811270); + zs[267] = BOOST_MATH_TEST_VALUE(RealType, 55844635379394146.00000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[267] = BOOST_MATH_TEST_VALUE(RealType, 35.00583509707518696805806331425691633367772960837479285214203859766210400707178436995199558318407295); + zs[268] = BOOST_MATH_TEST_VALUE(RealType, 55844635379394146.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[268] = BOOST_MATH_TEST_VALUE(RealType, 35.00583509707518697676280923369237535787688894919552843836080956969078417834382970920191457114876432); + zs[269] = BOOST_MATH_TEST_VALUE(RealType, 55844635379394147.00000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[269] = BOOST_MATH_TEST_VALUE(RealType, 35.00583509707518698546755515312783430419899338386184789940110157674808234768343577335618132616959765); + zs[270] = BOOST_MATH_TEST_VALUE(RealType, 55844635379394147.50000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[270] = BOOST_MATH_TEST_VALUE(RealType, 35.00583509707518699417230107256329317264404291237375262922664406743686215997702269925047177260404215); + zs[271] = BOOST_MATH_TEST_VALUE(RealType, 111689270758788295.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[271] = BOOST_MATH_TEST_VALUE(RealType, 35.67990927725728324006370419405415632798743326857723995400791753575138185111578870305633556551072352); + zs[272] = BOOST_MATH_TEST_VALUE(RealType, 111689270758788296.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[272] = BOOST_MATH_TEST_VALUE(RealType, 35.67990927725728324441836204273681992689740132873188907673425746295594512007334247458414132014763631); + zs[273] = BOOST_MATH_TEST_VALUE(RealType, 111689270758788296.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[273] = BOOST_MATH_TEST_VALUE(RealType, 35.67990927725728324877301989141948350632733717201783214881466640664746188099504650620747906266396850); + zs[274] = BOOST_MATH_TEST_VALUE(RealType, 111689270758788297.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[274] = BOOST_MATH_TEST_VALUE(RealType, 35.67990927725728325312767774010214706627724079843506934459363078248730870402916016710439865808348504); + zs[275] = BOOST_MATH_TEST_VALUE(RealType, 111689270758788297.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[275] = BOOST_MATH_TEST_VALUE(RealType, 35.67990927725728325748233558878481060674711220798360083841563700613685981848455744088126373390197417); + zs[276] = BOOST_MATH_TEST_VALUE(RealType, 223378541517576595.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[276] = BOOST_MATH_TEST_VALUE(RealType, 36.35433088203076284552001564306302504927318242547212268948185919007001226970738285875013148048139909); + zs[277] = BOOST_MATH_TEST_VALUE(RealType, 223378541517576596.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[277] = BOOST_MATH_TEST_VALUE(RealType, 36.35433088203076284769844633707581493482388002617376992599930776877134475450868721982023076025880187); + zs[278] = BOOST_MATH_TEST_VALUE(RealType, 223378541517576596.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[278] = BOOST_MATH_TEST_VALUE(RealType, 36.35433088203076284987687703108860481550197556889556172047264008790594215563414633410406449425201228); + zs[279] = BOOST_MATH_TEST_VALUE(RealType, 223378541517576597.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[279] = BOOST_MATH_TEST_VALUE(RealType, 36.35433088203076285205530772510139469130746905363749809470683776684452160660198665349883658913823376); + zs[280] = BOOST_MATH_TEST_VALUE(RealType, 223378541517576597.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[280] = BOOST_MATH_TEST_VALUE(RealType, 36.35433088203076285423373841911418456224036048039957907050688242495780009454648985107688288289511577); + zs[281] = BOOST_MATH_TEST_VALUE(RealType, 446757083035153195.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[281] = BOOST_MATH_TEST_VALUE(RealType, 37.02908764699829400134712267319905290193660562118300513507830516933879565438304668183143470276536696); + zs[282] = BOOST_MATH_TEST_VALUE(RealType, 446757083035153196.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[282] = BOOST_MATH_TEST_VALUE(RealType, 37.02908764699829400243686962505878682539242575730874103256160022984465712010716817361916571773853546); + zs[283] = BOOST_MATH_TEST_VALUE(RealType, 446757083035153196.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[283] = BOOST_MATH_TEST_VALUE(RealType, 37.02908764699829400352661657691852074762947010360082635121697561514628341391528501142658520743630365); + zs[284] = BOOST_MATH_TEST_VALUE(RealType, 446757083035153197.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[284] = BOOST_MATH_TEST_VALUE(RealType, 37.02908764699829400461636352877825466864773866005926109377149011203944059666845076630112677861392210); + zs[285] = BOOST_MATH_TEST_VALUE(RealType, 446757083035153197.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[285] = BOOST_MATH_TEST_VALUE(RealType, 37.02908764699829400570611048063798858844723142668404526295220250731989472007381590773195282652560254); + zs[286] = BOOST_MATH_TEST_VALUE(RealType, 893514166070306395.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[286] = BOOST_MATH_TEST_VALUE(RealType, 37.70416794018226555320136342385675657230684506000440195815556999407621228993843426869578896616407720); + zs[287] = BOOST_MATH_TEST_VALUE(RealType, 893514166070306396.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[287] = BOOST_MATH_TEST_VALUE(RealType, 37.70416794018226555374649355515368083078169249852645520316613216452931331516160499635557395351284563); + zs[288] = BOOST_MATH_TEST_VALUE(RealType, 893514166070306396.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[288] = BOOST_MATH_TEST_VALUE(RealType, 37.70416794018226555429162368645060508895169517366721864271816097307727758099155612982661657855356471); + zs[289] = BOOST_MATH_TEST_VALUE(RealType, 893514166070306397.0000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[289] = BOOST_MATH_TEST_VALUE(RealType, 37.70416794018226555483675381774752934681685308542669227715271188344812250649110477219885655515210238); + zs[290] = BOOST_MATH_TEST_VALUE(RealType, 893514166070306397.5000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[290] = BOOST_MATH_TEST_VALUE(RealType, 37.70416794018226555538188394904445360437716623380487610681084035936986551015065343719767859121005169); + zs[291] = BOOST_MATH_TEST_VALUE(RealType, 1787028332140612795.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[291] = BOOST_MATH_TEST_VALUE(RealType, 38.37956071956958972598482293827813436342029687218073991385854219392107138609564999755336816382782882); + zs[292] = BOOST_MATH_TEST_VALUE(RealType, 1787028332140612796.000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[292] = BOOST_MATH_TEST_VALUE(RealType, 38.37956071956958972625751198813595667063367232609526061670475810039080545891532051379509177129548620); + zs[293] = BOOST_MATH_TEST_VALUE(RealType, 1787028332140612796.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[293] = BOOST_MATH_TEST_VALUE(RealType, 38.37956071956958972653020103799377897777080019019814937016569594146159440469991463659659940941732350); + zs[294] = BOOST_MATH_TEST_VALUE(RealType, 1787028332140612797.000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[294] = BOOST_MATH_TEST_VALUE(RealType, 38.37956071956958972680289008785160128483168046448940617428400853168904877026810016036680752500851451); + zs[295] = BOOST_MATH_TEST_VALUE(RealType, 1787028332140612797.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[295] = BOOST_MATH_TEST_VALUE(RealType, 38.37956071956958972707557913770942359181631314896903102910234868562877910240275114213945213826099662); + zs[296] = BOOST_MATH_TEST_VALUE(RealType, 3574056664281225595.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[296] = BOOST_MATH_TEST_VALUE(RealType, 39.05525549414090357397288405889113661262090376242531189140228166174913957175516846453031303867939318); + zs[297] = BOOST_MATH_TEST_VALUE(RealType, 3574056664281225596.000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[297] = BOOST_MATH_TEST_VALUE(RealType, 39.05525549414090357410928851167839535330306428730324674240848562357412341096307490721136888569495897); + zs[298] = BOOST_MATH_TEST_VALUE(RealType, 3574056664281225596.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[298] = BOOST_MATH_TEST_VALUE(RealType, 39.05525549414090357424569296446565409396615412474444985847532731674289519382422208292858248536499652); + zs[299] = BOOST_MATH_TEST_VALUE(RealType, 3574056664281225597.000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[299] = BOOST_MATH_TEST_VALUE(RealType, 39.05525549414090357438209741725291283461017327474892123960814086338854298164097945903007554014878729); + zs[300] = BOOST_MATH_TEST_VALUE(RealType, 3574056664281225597.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[300] = BOOST_MATH_TEST_VALUE(RealType, 39.05525549414090357451850187004017157523512173731666088581226038564415483571347831884995089329885967); + zs[301] = BOOST_MATH_TEST_VALUE(RealType, 7148113328562451195.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[301] = BOOST_MATH_TEST_VALUE(RealType, 39.73124228804812727783498401939051909927376255844770721021129458386841998457593172268879366938255929); + zs[302] = BOOST_MATH_TEST_VALUE(RealType, 7148113328562451196.000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[302] = BOOST_MATH_TEST_VALUE(RealType, 39.73124228804812727790321522786904454299244826066833347409818515980037701571602976213801388272915974); + zs[303] = BOOST_MATH_TEST_VALUE(RealType, 7148113328562451196.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[303] = BOOST_MATH_TEST_VALUE(RealType, 39.73124228804812727797144643634756998670636416712076247668418626969651461616512047870718042117101998); + zs[304] = BOOST_MATH_TEST_VALUE(RealType, 7148113328562451197.000000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[304] = BOOST_MATH_TEST_VALUE(RealType, 39.73124228804812727803967764482609543041551027780499421796996498319224892410706675338130329932555167); + zs[305] = BOOST_MATH_TEST_VALUE(RealType, 7148113328562451197.500000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[305] = BOOST_MATH_TEST_VALUE(RealType, 39.73124228804812727810790885330462087411988659272102869795618836992299607772559151572452093096440915); + zs[306] = BOOST_MATH_TEST_VALUE(RealType, 14296226657124902395.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[306] = BOOST_MATH_TEST_VALUE(RealType, 40.40751160764139677831479038829047423830224736434558035742829431520714244678484344822558100019565300); + zs[307] = BOOST_MATH_TEST_VALUE(RealType, 14296226657124902396.00000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[307] = BOOST_MATH_TEST_VALUE(RealType, 40.40751160764139677834892001619303911408381392078589832744493031890002310138573922908458466967872121); + zs[308] = BOOST_MATH_TEST_VALUE(RealType, 14296226657124902396.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[308] = BOOST_MATH_TEST_VALUE(RealType, 40.40751160764139677838304964409560398986418751480292907711652892277321787302547236270065870054677767); + zs[309] = BOOST_MATH_TEST_VALUE(RealType, 14296226657124902397.00000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[309] = BOOST_MATH_TEST_VALUE(RealType, 40.40751160764139677841717927199816886564336814639667260644317354730947215019219733421649211897790576); + zs[310] = BOOST_MATH_TEST_VALUE(RealType, 14296226657124902397.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[310] = BOOST_MATH_TEST_VALUE(RealType, 40.40751160764139677845130889990073374142135581556712891542494761299153132137405987788970971812438268); + zs[311] = BOOST_MATH_TEST_VALUE(RealType, 28592453314249804795.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[311] = BOOST_MATH_TEST_VALUE(RealType, 41.08405441107886601512650396438190311342038447614710861375772179966198427428166270594434592188846742); + zs[312] = BOOST_MATH_TEST_VALUE(RealType, 28592453314249804796.00000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[312] = BOOST_MATH_TEST_VALUE(RealType, 41.08405441107886601514357556751058240524595848620754197445685531919168072376579651061145028382528801); + zs[313] = BOOST_MATH_TEST_VALUE(RealType, 28592453314249804796.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[313] = BOOST_MATH_TEST_VALUE(RealType, 41.08405441107886601516064717063926169707123413145503282985377893953090450589428836799851249587190162); + zs[314] = BOOST_MATH_TEST_VALUE(RealType, 28592453314249804797.00000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[314] = BOOST_MATH_TEST_VALUE(RealType, 41.08405441107886601517771877376794098889621141188958117994850309268653710559007455198782311971328872); + zs[315] = BOOST_MATH_TEST_VALUE(RealType, 28592453314249804797.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[315] = BOOST_MATH_TEST_VALUE(RealType, 41.08405441107886601519479037689662028072089032751118702474103821066546000777609078929437453810254475); + zs[316] = BOOST_MATH_TEST_VALUE(RealType, 57184906628499609595.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[316] = BOOST_MATH_TEST_VALUE(RealType, 41.76086208028139568641375217383589970289192285524027455320442791145685452599382947676049441268469929); + zs[317] = BOOST_MATH_TEST_VALUE(RealType, 57184906628499609596.00000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[317] = BOOST_MATH_TEST_VALUE(RealType, 41.76086208028139568642229126383956807166540537938630285140147251930665093550545985675206920712567685); + zs[318] = BOOST_MATH_TEST_VALUE(RealType, 57184906628499609596.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[318] = BOOST_MATH_TEST_VALUE(RealType, 41.76086208028139568643083035384323644043881328226871966400896425186789096638830671067070738275427294); + zs[319] = BOOST_MATH_TEST_VALUE(RealType, 57184906628499609597.00000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[319] = BOOST_MATH_TEST_VALUE(RealType, 41.76086208028139568643936944384690480921214656388752499102690441367931200542104387248813871592477758); + zs[320] = BOOST_MATH_TEST_VALUE(RealType, 57184906628499609597.50000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[320] = BOOST_MATH_TEST_VALUE(RealType, 41.76086208028139568644790853385057317798540522424271883245529430927965143938234514196380710928511911); + zs[321] = BOOST_MATH_TEST_VALUE(RealType, 114369813256999219195.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[321] = BOOST_MATH_TEST_VALUE(RealType, 42.43792639501924322372868984974754605356116106151045232696170539516224623515519078402644518190519926); + zs[322] = BOOST_MATH_TEST_VALUE(RealType, 114369813256999219196.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[322] = BOOST_MATH_TEST_VALUE(RealType, 42.43792639501924322373296098832611092973985577032241411056103015380922288812869321261489035558578068); + zs[323] = BOOST_MATH_TEST_VALUE(RealType, 114369813256999219196.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[323] = BOOST_MATH_TEST_VALUE(RealType, 42.43792639501924322373723212690467580591853181653964600305518073422329365062099792146842039711851587); + zs[324] = BOOST_MATH_TEST_VALUE(RealType, 114369813256999219197.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[324] = BOOST_MATH_TEST_VALUE(RealType, 42.43792639501924322374150326548324068209718920016214800444415729953689875272821439439139550720636184); + zs[325] = BOOST_MATH_TEST_VALUE(RealType, 114369813256999219197.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[325] = BOOST_MATH_TEST_VALUE(RealType, 42.43792639501924322374577440406180555827582792118992011472796001288247842454645211304904107994414835); + zs[326] = BOOST_MATH_TEST_VALUE(RealType, 228739626513998438395.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[326] = BOOST_MATH_TEST_VALUE(RealType, 43.11523950893999669327806140448370484701263856771509543516859403088443747042918192039960542776140113); + zs[327] = BOOST_MATH_TEST_VALUE(RealType, 228739626513998438396.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[327] = BOOST_MATH_TEST_VALUE(RealType, 43.11523950893999669328019774638303987145009950720434908964235203327796824314750703851313533491796197); + zs[328] = BOOST_MATH_TEST_VALUE(RealType, 228739626513998438396.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[328] = BOOST_MATH_TEST_VALUE(RealType, 43.11523950893999669328233408828237489588755577928156076930831411008263669948642260552727690669574065); + zs[329] = BOOST_MATH_TEST_VALUE(RealType, 228739626513998438397.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[329] = BOOST_MATH_TEST_VALUE(RealType, 43.11523950893999669328447043018170992032500738394673047416648028169788047545599558661614805384499252); + zs[330] = BOOST_MATH_TEST_VALUE(RealType, 228739626513998438397.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[330] = BOOST_MATH_TEST_VALUE(RealType, 43.11523950893999669328660677208104494476245432119985820421685056852313720706629294682011828585641323); + zs[331] = BOOST_MATH_TEST_VALUE(RealType, 457479253027996876795.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[331] = BOOST_MATH_TEST_VALUE(RealType, 43.79279392736654193606989766502723445979048572229231465829706451573324407857444527395822448178986007); + zs[332] = BOOST_MATH_TEST_VALUE(RealType, 457479253027996876796.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[332] = BOOST_MATH_TEST_VALUE(RealType, 43.79279392736654193607096621073065351333846093585545869129269708118665210449739974464793810457198837); + zs[333] = BOOST_MATH_TEST_VALUE(RealType, 457479253027996876796.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[333] = BOOST_MATH_TEST_VALUE(RealType, 43.79279392736654193607203475643407256688643498213820013963448351011348495071834636284671248086199837); + zs[334] = BOOST_MATH_TEST_VALUE(RealType, 457479253027996876797.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[334] = BOOST_MATH_TEST_VALUE(RealType, 43.79279392736654193607310330213749162043440786114053900332242380506462727521879656021426226958496105); + zs[335] = BOOST_MATH_TEST_VALUE(RealType, 457479253027996876797.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[335] = BOOST_MATH_TEST_VALUE(RealType, 43.79279392736654193607417184784091067398237957286247528235651796859096373598026176840193967666274999); + zs[336] = BOOST_MATH_TEST_VALUE(RealType, 914958506055993753595.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[336] = BOOST_MATH_TEST_VALUE(RealType, 44.47058248671115033941120173207718823699817102786625650029939710664855583164086060137262356501253929); + zs[337] = BOOST_MATH_TEST_VALUE(RealType, 914958506055993753596.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[337] = BOOST_MATH_TEST_VALUE(RealType, 44.47058248671115033941173618678344688398957490049536600533594487394087848036718134980749301722731352); + zs[338] = BOOST_MATH_TEST_VALUE(RealType, 914958506055993753596.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[338] = BOOST_MATH_TEST_VALUE(RealType, 44.47058248671115033941227064148970553098097848120073848954722626642651975773633390627303626978835838); + zs[339] = BOOST_MATH_TEST_VALUE(RealType, 914958506055993753597.0000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[339] = BOOST_MATH_TEST_VALUE(RealType, 44.47058248671115033941280509619596417797238176998237395293324128442445599007428498582436405251992611); + zs[340] = BOOST_MATH_TEST_VALUE(RealType, 914958506055993753597.5000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[340] = BOOST_MATH_TEST_VALUE(RealType, 44.47058248671115033941333955090222282496378476684027239549398992825366350370700130351606424938744046); + zs[341] = BOOST_MATH_TEST_VALUE(RealType, 1829917012111987507195.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[341] = BOOST_MATH_TEST_VALUE(RealType, 45.14859833536711018965056513946129162668050892446138815518047627051292293694179480812556619549313064); + zs[342] = BOOST_MATH_TEST_VALUE(RealType, 1829917012111987507196.000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[342] = BOOST_MATH_TEST_VALUE(RealType, 45.14859833536711018965083245509992947480958471611883906387208610588018636449042232643595158517689720); + zs[343] = BOOST_MATH_TEST_VALUE(RealType, 1829917012111987507196.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[343] = BOOST_MATH_TEST_VALUE(RealType, 45.14859833536711018965109977073856732293866043477021415438855308555056542965567216193304047624510243); + zs[344] = BOOST_MATH_TEST_VALUE(RealType, 1829917012111987507197.000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[344] = BOOST_MATH_TEST_VALUE(RealType, 45.14859833536711018965136708637720517106773608041551342672987720956394620826737050999033807936751171); + zs[345] = BOOST_MATH_TEST_VALUE(RealType, 1829917012111987507197.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[345] = BOOST_MATH_TEST_VALUE(RealType, 45.14859833536711018965163440201584301919681165305473688089605847796021477615534356598131691567620401); + zs[346] = BOOST_MATH_TEST_VALUE(RealType, 3659834024223975014395.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[346] = BOOST_MATH_TEST_VALUE(RealType, 45.82683491595294384485628384441561575887407603040339098125590070863967384748247436205190625734118932); + zs[347] = BOOST_MATH_TEST_VALUE(RealType, 3659834024223975014396.000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[347] = BOOST_MATH_TEST_VALUE(RealType, 45.82683491595294384485641754511313063272748535532950445484624262655288217284652009573499125927466059); + zs[348] = BOOST_MATH_TEST_VALUE(RealType, 3659834024223975014396.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[348] = BOOST_MATH_TEST_VALUE(RealType, 45.82683491595294384485655124581064550658089466199799712956218289431848176597105298416189805067325255); + zs[349] = BOOST_MATH_TEST_VALUE(RealType, 3659834024223975014397.000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[349] = BOOST_MATH_TEST_VALUE(RealType, 45.82683491595294384485668494650816038043430395040886900540372151194146008896781208120907682446939362); + zs[350] = BOOST_MATH_TEST_VALUE(RealType, 3659834024223975014397.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[350] = BOOST_MATH_TEST_VALUE(RealType, 45.82683491595294384485681864720567525428771322056212008237085847942680460394853644075297572979160046); + zs[351] = BOOST_MATH_TEST_VALUE(RealType, 7319668048447950028795.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[351] = BOOST_MATH_TEST_VALUE(RealType, 46.50528594879636847126393241245457792327323285439769210757132628000124992150426204283421914567175062); + zs[352] = BOOST_MATH_TEST_VALUE(RealType, 7319668048447950028796.000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[352] = BOOST_MATH_TEST_VALUE(RealType, 46.50528594879636847126399928363674654174459322702292762434851831465004062253014895509105956594317070); + zs[353] = BOOST_MATH_TEST_VALUE(RealType, 7319668048447950028796.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[353] = BOOST_MATH_TEST_VALUE(RealType, 46.50528594879636847126406615481891516021595359508227640114777678096555406499545632733378131414467863); + zs[354] = BOOST_MATH_TEST_VALUE(RealType, 7319668048447950028797.000000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[354] = BOOST_MATH_TEST_VALUE(RealType, 46.50528594879636847126413302600108377868731395857573843796910167894841388830471951540349934300433290); + zs[355] = BOOST_MATH_TEST_VALUE(RealType, 7319668048447950028797.500000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[355] = BOOST_MATH_TEST_VALUE(RealType, 46.50528594879636847126419989718325239715867431750331373481249300859924373186247387514132847746950458); + zs[356] = BOOST_MATH_TEST_VALUE(RealType, 14639336096895900057595.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[356] = BOOST_MATH_TEST_VALUE(RealType, 47.18394541655595353726859251633008985542795093110678176543525265373739682696782954566791223497853278); + zs[357] = BOOST_MATH_TEST_VALUE(RealType, 14639336096895900057596.00000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[357] = BOOST_MATH_TEST_VALUE(RealType, 47.18394541655595353726862596204760125343156619941158006313108818081160492017518779133670783309629777); + zs[358] = BOOST_MATH_TEST_VALUE(RealType, 14639336096895900057596.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[358] = BOOST_MATH_TEST_VALUE(RealType, 47.18394541655595353726865940776511265143518146657454680704151512746306706865464848189500564360309989); + zs[359] = BOOST_MATH_TEST_VALUE(RealType, 14639336096895900057597.00000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[359] = BOOST_MATH_TEST_VALUE(RealType, 47.18394541655595353726869285348262404943879673259568199716653349369186125242127832914687715856217447); + zs[360] = BOOST_MATH_TEST_VALUE(RealType, 14639336096895900057597.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[360] = BOOST_MATH_TEST_VALUE(RealType, 47.18394541655595353726872629920013544744241199747498563350614327949806545149014404489639386204785740); + zs[361] = BOOST_MATH_TEST_VALUE(RealType, 29278672193791800115195.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[361] = BOOST_MATH_TEST_VALUE(RealType, 47.86280754988806283869898641897124874506124538863135227082696257498669984107495807372390982964298765); + zs[362] = BOOST_MATH_TEST_VALUE(RealType, 29278672193791800115196.00000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[362] = BOOST_MATH_TEST_VALUE(RealType, 47.86280754988806283869900314675402022865409817077027470411443725892317844329022583627504362168195643); + zs[363] = BOOST_MATH_TEST_VALUE(RealType, 29278672193791800115196.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[363] = BOOST_MATH_TEST_VALUE(RealType, 47.86280754988806283869901987453679171224695095262365180124915574419262646462548365901592461409111822); + zs[364] = BOOST_MATH_TEST_VALUE(RealType, 29278672193791800115197.00000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[364] = BOOST_MATH_TEST_VALUE(RealType, 47.86280754988806283869903660231956319583980373419148356223111803079505365563012583778554165327574562); + zs[365] = BOOST_MATH_TEST_VALUE(RealType, 29278672193791800115197.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[365] = BOOST_MATH_TEST_VALUE(RealType, 47.86280754988806283869905333010233467943265651547376998706032411873046976685354666842288358514164676); + zs[366] = BOOST_MATH_TEST_VALUE(RealType, 58557344387583600230395.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[366] = BOOST_MATH_TEST_VALUE(RealType, 48.54186681407528073135559278566008113536709515501428437696966434378641333376283319594991159197529021); + zs[367] = BOOST_MATH_TEST_VALUE(RealType, 58557344387583600230396.00000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[367] = BOOST_MATH_TEST_VALUE(RealType, 48.54186681407528073135560115194668751765523308763717061100258732052320085375724211692206634017417835); + zs[368] = BOOST_MATH_TEST_VALUE(RealType, 58557344387583600230396.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[368] = BOOST_MATH_TEST_VALUE(RealType, 48.54186681407528073135560951823329389994337102018864925304218198091079593677878710603131163142362874); + zs[369] = BOOST_MATH_TEST_VALUE(RealType, 58557344387583600230397.00000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[369] = BOOST_MATH_TEST_VALUE(RealType, 48.54186681407528073135561788451990028223150895266872030308844832494919980201645683875988736222168974); + zs[370] = BOOST_MATH_TEST_VALUE(RealType, 58557344387583600230397.50000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[370] = BOOST_MATH_TEST_VALUE(RealType, 48.54186681407528073135562625080650666451964688507738376114138635263841366865923999059003342903518356); + zs[371] = BOOST_MATH_TEST_VALUE(RealType, 117114688775167200460795.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[371] = BOOST_MATH_TEST_VALUE(RealType, 49.22111789654023166917393998803300413713566990752077661423207867413014717692257524895032484088002638); + zs[372] = BOOST_MATH_TEST_VALUE(RealType, 117114688775167200460796.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[372] = BOOST_MATH_TEST_VALUE(RealType, 49.22111789654023166917394417234185551157598495411034248495095320790548697334562191650844059041476016); + zs[373] = BOOST_MATH_TEST_VALUE(RealType, 117114688775167200460796.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[373] = BOOST_MATH_TEST_VALUE(RealType, 49.22111789654023166917394835665070688601630000068205128804849669368418438086966818342794853392747975); + zs[374] = BOOST_MATH_TEST_VALUE(RealType, 117114688775167200460797.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[374] = BOOST_MATH_TEST_VALUE(RealType, 49.22111789654023166917395254095955826045661504723590302352470913146623955193835326180329431243220210); + zs[375] = BOOST_MATH_TEST_VALUE(RealType, 117114688775167200460797.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[375] = BOOST_MATH_TEST_VALUE(RealType, 49.22111789654023166917395672526840963489693009377189769137959052125165263899531636372892356694099191); + zs[376] = BOOST_MATH_TEST_VALUE(RealType, 234229377550334400921595.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[376] = BOOST_MATH_TEST_VALUE(RealType, 49.90055569517561383066060297122022964231700635525977853025814596096151371140753421576539605970700861); + zs[377] = BOOST_MATH_TEST_VALUE(RealType, 234229377550334400921596.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[377] = BOOST_MATH_TEST_VALUE(RealType, 49.90055569517561383066060506394202934831808914814125072797602761455168951650504013758145865501313880); + zs[378] = BOOST_MATH_TEST_VALUE(RealType, 234229377550334400921596.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[378] = BOOST_MATH_TEST_VALUE(RealType, 49.90055569517561383066060715666382905431917194101825740114881990816754906595137018341539085351050643); + zs[379] = BOOST_MATH_TEST_VALUE(RealType, 234229377550334400921597.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[379] = BOOST_MATH_TEST_VALUE(RealType, 49.90055569517561383066060924938562876032025473389079854977652284180909237880745343386717050876814609); + zs[380] = BOOST_MATH_TEST_VALUE(RealType, 234229377550334400921597.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[380] = BOOST_MATH_TEST_VALUE(RealType, 49.90055569517561383066061134210742846632133752675887417385913641547631947413421896953677547435497030); + zs[381] = BOOST_MATH_TEST_VALUE(RealType, 468458755100668801843195.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[381] = BOOST_MATH_TEST_VALUE(RealType, 50.58017530742747300164561317487206707303802427632079894747824628285067346330316982070607470750276538); + zs[382] = BOOST_MATH_TEST_VALUE(RealType, 468458755100668801843196.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[382] = BOOST_MATH_TEST_VALUE(RealType, 50.58017530742747300164561422150925313668179339445554345979082699726978571301972512528171705027852141); + zs[383] = BOOST_MATH_TEST_VALUE(RealType, 468458755100668801843196.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[383] = BOOST_MATH_TEST_VALUE(RealType, 50.58017530742747300164561526814643920032556251258917128490508500217173303906663500224210793499988710); + zs[384] = BOOST_MATH_TEST_VALUE(RealType, 468458755100668801843197.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[384] = BOOST_MATH_TEST_VALUE(RealType, 50.58017530742747300164561631478362526396933163072168242282102029755651544382718152403729363436471691); + zs[385] = BOOST_MATH_TEST_VALUE(RealType, 468458755100668801843197.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[385] = BOOST_MATH_TEST_VALUE(RealType, 50.58017530742747300164561736142081132761310074885307687353863288342413292968464676311732042107085768); + zs[386] = BOOST_MATH_TEST_VALUE(RealType, 936917510201337603686395.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[386] = BOOST_MATH_TEST_VALUE(RealType, 51.25997202007432193650352849612123815153250964411406464644865827787863050268704653756510450468474031); + zs[387] = BOOST_MATH_TEST_VALUE(RealType, 936917510201337603686396.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[387] = BOOST_MATH_TEST_VALUE(RealType, 51.25997202007432193650352901957441589305691661161083072884708823213628905949128284896989478240192251); + zs[388] = BOOST_MATH_TEST_VALUE(RealType, 936917510201337603686396.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[388] = BOOST_MATH_TEST_VALUE(RealType, 51.25997202007432193650352954302759363458132357910731756493593984931372662548695557807862606879386793); + zs[389] = BOOST_MATH_TEST_VALUE(RealType, 936917510201337603686397.0000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[389] = BOOST_MATH_TEST_VALUE(RealType, 51.25997202007432193650353006648077137610573054660352515471521312941094320097205602449555540058022069); + zs[390] = BOOST_MATH_TEST_VALUE(RealType, 936917510201337603686397.5000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[390] = BOOST_MATH_TEST_VALUE(RealType, 51.25997202007432193650353058993394911763013751409945349818490807242793878624457548782493981448062444); + zs[391] = BOOST_MATH_TEST_VALUE(RealType, 1873835020402675207372795.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[391] = BOOST_MATH_TEST_VALUE(RealType, 51.93994129964973319883394011661732720227488151829956542922851698538021522622862634588975916535124465); + zs[392] = BOOST_MATH_TEST_VALUE(RealType, 1873835020402675207372796.000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[392] = BOOST_MATH_TEST_VALUE(RealType, 51.93994129964973319883394037840949666263721928778536979472743471765062641780884974428552475054902084); + zs[393] = BOOST_MATH_TEST_VALUE(RealType, 1873835020402675207372796.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[393] = BOOST_MATH_TEST_VALUE(RealType, 51.93994129964973319883394064020166612299955705727110433050351349588454562078192850302725642051437996); + zs[394] = BOOST_MATH_TEST_VALUE(RealType, 1873835020402675207372797.000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[394] = BOOST_MATH_TEST_VALUE(RealType, 51.93994129964973319883394090199383558336189482675676903655675332008197283518512140013107034885992383); + zs[395] = BOOST_MATH_TEST_VALUE(RealType, 1873835020402675207372797.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[395] = BOOST_MATH_TEST_VALUE(RealType, 51.93994129964973319883394116378600504372423259624236391288715419024290806105568721361308270919825427); + zs[396] = BOOST_MATH_TEST_VALUE(RealType, 3747670040805350414745595.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[396] = BOOST_MATH_TEST_VALUE(RealType, 52.62007878346056146247780063098329226609433897361719442410811576805026853884099017649824976199940727); + zs[397] = BOOST_MATH_TEST_VALUE(RealType, 3747670040805350414745596.000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[397] = BOOST_MATH_TEST_VALUE(RealType, 52.62007878346056146247780076191134345038026463351561571010291457420668319272155773248903735412098606); + zs[398] = BOOST_MATH_TEST_VALUE(RealType, 3747670040805350414745596.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[398] = BOOST_MATH_TEST_VALUE(RealType, 52.62007878346056146247780089283939463466619029341401953424656920848830320946683691731827935418315374); + zs[399] = BOOST_MATH_TEST_VALUE(RealType, 3747670040805350414745597.000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[399] = BOOST_MATH_TEST_VALUE(RealType, 52.62007878346056146247780102376744581895211595331240589653907967089512858908148627964024886502244786); + zs[400] = BOOST_MATH_TEST_VALUE(RealType, 3747670040805350414745597.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[400] = BOOST_MATH_TEST_VALUE(RealType, 52.62007878346056146247780115469549700323804161321077479698044596142715933157016436810921898947540595); + zs[401] = BOOST_MATH_TEST_VALUE(RealType, 7495340081610700829491195.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[401] = BOOST_MATH_TEST_VALUE(RealType, 53.30038027115703847068472014163526750381732629683760414977652728398062761064036427478928134573151026); + zs[402] = BOOST_MATH_TEST_VALUE(RealType, 7495340081610700829491196.000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[402] = BOOST_MATH_TEST_VALUE(RealType, 53.30038027115703847068472020711487963758347144588443668839144673170417842073148009181357862290045625); + zs[403] = BOOST_MATH_TEST_VALUE(RealType, 7495340081610700829491196.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[403] = BOOST_MATH_TEST_VALUE(RealType, 53.30038027115703847068472027259449177134961659493126486046636359084837495933357183600363141237458038); + zs[404] = BOOST_MATH_TEST_VALUE(RealType, 7495340081610700829491197.000000000000000000000000000000000000000000000000000000000000000000000000000); + ws[404] = BOOST_MATH_TEST_VALUE(RealType, 53.30038027115703847068472033807410390511576174397808866600127786141321722644722197229302630959626241); + zs[405] = BOOST_MATH_TEST_VALUE(RealType, 7495340081610700829491197.500000000000000000000000000000000000000000000000000000000000000000000000000); + ws[405] = BOOST_MATH_TEST_VALUE(RealType, 53.30038027115703847068472040355371603888190689302490810499618954339870522207301296561534991000788215); + zs[406] = BOOST_MATH_TEST_VALUE(RealType, 14990680163221401658982395.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[406] = BOOST_MATH_TEST_VALUE(RealType, 53.98084171681467787755159106988030207256464803953686021292403364974364396941211684129467560225025844); + zs[407] = BOOST_MATH_TEST_VALUE(RealType, 14990680163221401658982396.00000000000000000000000000000000000000000000000000000000000000000000000000); + ws[407] = BOOST_MATH_TEST_VALUE(RealType, 53.98084171681467787755159110262771031569979287106207337111164630527719599256075269757642116173324604); + zs[408] = BOOST_MATH_TEST_VALUE(RealType, 14990680163221401658982396.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[408] = BOOST_MATH_TEST_VALUE(RealType, 53.98084171681467787755159113537511855883493770258728543740166820971925093788175661756375535881272212); + zs[409] = BOOST_MATH_TEST_VALUE(RealType, 14990680163221401658982397.00000000000000000000000000000000000000000000000000000000000000000000000000); + ws[409] = BOOST_MATH_TEST_VALUE(RealType, 53.98084171681467787755159116812252680197008253411249641179409936306980880537520142720731872132566761); + zs[410] = BOOST_MATH_TEST_VALUE(RealType, 14990680163221401658982397.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[410] = BOOST_MATH_TEST_VALUE(RealType, 53.98084171681467787755159120086993504510522736563770629428893976532886959504115995245775177710906343); + zs[411] = BOOST_MATH_TEST_VALUE(RealType, 29981360326442803317964795.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[411] = BOOST_MATH_TEST_VALUE(RealType, 54.66145922149126997883966829050076057809819624810698856060190684715860519885138243117049542515690575); + zs[412] = BOOST_MATH_TEST_VALUE(RealType, 29981360326442803317964796.00000000000000000000000000000000000000000000000000000000000000000000000000); + ws[412] = BOOST_MATH_TEST_VALUE(RealType, 54.66145922149126997883966830687817369095124791690640312773832665397033630245360990420711923237519040); + zs[413] = BOOST_MATH_TEST_VALUE(RealType, 29981360326442803317964796.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[413] = BOOST_MATH_TEST_VALUE(RealType, 54.66145922149126997883966832325558680380429958570581742183631816048451505614209676496718115749779207); + zs[414] = BOOST_MATH_TEST_VALUE(RealType, 29981360326442803317964797.00000000000000000000000000000000000000000000000000000000000000000000000000); + ws[414] = BOOST_MATH_TEST_VALUE(RealType, 54.66145922149126997883966833963299991665735125450523144289588136670114145991685211886837782686269634); + zs[415] = BOOST_MATH_TEST_VALUE(RealType, 29981360326442803317964797.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[415] = BOOST_MATH_TEST_VALUE(RealType, 54.66145922149126997883966835601041302951040292330464519091701627262021551377788507132840586680788883); + zs[416] = BOOST_MATH_TEST_VALUE(RealType, 59962720652885606635929595.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[416] = BOOST_MATH_TEST_VALUE(RealType, 55.34222902622527492285082008163468252474529527756164189713179328516307078639643598839828067574841328); + zs[417] = BOOST_MATH_TEST_VALUE(RealType, 59962720652885606635929596.00000000000000000000000000000000000000000000000000000000000000000000000000); + ws[417] = BOOST_MATH_TEST_VALUE(RealType, 55.34222902622527492285082008982519917191333658353569747274840211384876036940931564577326778739937441); + zs[418] = BOOST_MATH_TEST_VALUE(RealType, 59962720652885606635929596.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[418] = BOOST_MATH_TEST_VALUE(RealType, 55.34222902622527492285082009801571581908137788950975298008978578466315835299634785170757312736330548); + zs[419] = BOOST_MATH_TEST_VALUE(RealType, 59962720652885606635929597.00000000000000000000000000000000000000000000000000000000000000000000000000); + ws[419] = BOOST_MATH_TEST_VALUE(RealType, 55.34222902622527492285082010620623246624941919548380841915594429760626473715753374464347315926011244); + zs[420] = BOOST_MATH_TEST_VALUE(RealType, 59962720652885606635929597.50000000000000000000000000000000000000000000000000000000000000000000000000); + ws[420] = BOOST_MATH_TEST_VALUE(RealType, 55.34222902622527492285082011439674911341746050145786378994687765267807952189287446302324434670970122); + zs[421] = BOOST_MATH_TEST_VALUE(RealType, 119925441305771213271859195.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[421] = BOOST_MATH_TEST_VALUE(RealType, 56.02314750544467013866005744109529240544406880337828236840721418957676877238000505091488001795651201); + zs[422] = BOOST_MATH_TEST_VALUE(RealType, 119925441305771213271859196.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[422] = BOOST_MATH_TEST_VALUE(RealType, 56.02314750544467013866005744519143435523841317719330604019896557212385538515430219236320724445839119); + zs[423] = BOOST_MATH_TEST_VALUE(RealType, 119925441305771213271859196.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[423] = BOOST_MATH_TEST_VALUE(RealType, 56.02314750544467013866005744928757630503275755100832969491810004678229237746659550758636675578428967); + zs[424] = BOOST_MATH_TEST_VALUE(RealType, 119925441305771213271859197.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[424] = BOOST_MATH_TEST_VALUE(RealType, 56.02314750544467013866005745338371825482710192482335333256461761355207974931688513892197266161560978); + zs[425] = BOOST_MATH_TEST_VALUE(RealType, 119925441305771213271859197.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[425] = BOOST_MATH_TEST_VALUE(RealType, 56.02314750544467013866005745747986020462144629863837695313851827243321750070517122870763907163375388); + zs[426] = BOOST_MATH_TEST_VALUE(RealType, 239850882611542426543718395.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[426] = BOOST_MATH_TEST_VALUE(RealType, 56.70421116075780244670574964727179808543930859767697217112818536350797368921774672172293682473225055); + zs[427] = BOOST_MATH_TEST_VALUE(RealType, 239850882611542426543718396.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[427] = BOOST_MATH_TEST_VALUE(RealType, 56.70421116075780244670574964932030053738025902058853016475070045198068571647010983824313512015423280); + zs[428] = BOOST_MATH_TEST_VALUE(RealType, 239850882611542426543718396.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[428] = BOOST_MATH_TEST_VALUE(RealType, 56.70421116075780244670574965136880298932120944350008815410413130287269798806862098501994253827046627); + zs[429] = BOOST_MATH_TEST_VALUE(RealType, 239850882611542426543718397.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[429] = BOOST_MATH_TEST_VALUE(RealType, 56.70421116075780244670574965341730544126215986641164613918847791618401050401328017984950518641062487); + zs[430] = BOOST_MATH_TEST_VALUE(RealType, 239850882611542426543718397.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[430] = BOOST_MATH_TEST_VALUE(RealType, 56.70421116075780244670574965546580789320311028932320412000374029191462326430408744052796917190438247); + zs[431] = BOOST_MATH_TEST_VALUE(RealType, 479701765223084853087436795.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[431] = BOOST_MATH_TEST_VALUE(RealType, 57.38541661510006336367991531277886245290205731446363101869106286487064764410271386990754234755642855); + zs[432] = BOOST_MATH_TEST_VALUE(RealType, 479701765223084853087436796.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[432] = BOOST_MATH_TEST_VALUE(RealType, 57.38541661510006336367991531380332442757645839844021552846525681769285188952591218983091633569244771); + zs[433] = BOOST_MATH_TEST_VALUE(RealType, 479701765223084853087436796.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[433] = BOOST_MATH_TEST_VALUE(RealType, 57.38541661510006336367991531482778640225085948241680003717195267123172907693535943393631252233528007); + zs[434] = BOOST_MATH_TEST_VALUE(RealType, 479701765223084853087436797.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[434] = BOOST_MATH_TEST_VALUE(RealType, 57.38541661510006336367991531585224837692526056639338454481115042548727920633105560444873053490520850); + zs[435] = BOOST_MATH_TEST_VALUE(RealType, 479701765223084853087436797.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[435] = BOOST_MATH_TEST_VALUE(RealType, 57.38541661510006336367991531687671035159966165036996905138285008045950227771300070359317000082251587); + zs[436] = BOOST_MATH_TEST_VALUE(RealType, 959403530446169706174873595.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[436] = BOOST_MATH_TEST_VALUE(RealType, 58.06676060721227034055554057973484251633179872231742522867479304887734423959008177810507929372980502); + zs[437] = BOOST_MATH_TEST_VALUE(RealType, 959403530446169706174873596.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[437] = BOOST_MATH_TEST_VALUE(RealType, 58.06676060721227034055554058024717646818581642633527555088229229848978856650264562082058837873668151); + zs[438] = BOOST_MATH_TEST_VALUE(RealType, 959403530446169706174873596.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[438] = BOOST_MATH_TEST_VALUE(RealType, 58.06676060721227034055554058075951042003983413035312587282286158171800872330936800027595921615283052); + zs[439] = BOOST_MATH_TEST_VALUE(RealType, 959403530446169706174873597.0000000000000000000000000000000000000000000000000000000000000000000000000); + ws[439] = BOOST_MATH_TEST_VALUE(RealType, 58.06676060721227034055554058127184437189385183437097619449650089856200471001024891674937552098289649); + zs[440] = BOOST_MATH_TEST_VALUE(RealType, 959403530446169706174873597.5000000000000000000000000000000000000000000000000000000000000000000000000); + ws[440] = BOOST_MATH_TEST_VALUE(RealType, 58.06676060721227034055554058178417832374786953838882651590321024902177652660528837051902100823152388); + zs[441] = BOOST_MATH_TEST_VALUE(RealType, 1918807060892339412349747195.500000000000000000000000000000000000000000000000000000000000000000000000); + ws[441] = BOOST_MATH_TEST_VALUE(RealType, 58.74823998642851741200079363299726206609746705489474024632685397908027036826962303868666955918111538); + zs[442] = BOOST_MATH_TEST_VALUE(RealType, 1918807060892339412349747196.000000000000000000000000000000000000000000000000000000000000000000000000); + ws[442] = BOOST_MATH_TEST_VALUE(RealType, 58.74823998642851741200079363325347935999834589083288276642972035197649807101708168936227006895175343); + zs[443] = BOOST_MATH_TEST_VALUE(RealType, 1918807060892339412349747196.500000000000000000000000000000000000000000000000000000000000000000000000); + ws[443] = BOOST_MATH_TEST_VALUE(RealType, 58.74823998642851741200079363350969665389922472677102528646584069120432472031910137509227273894302196); + zs[444] = BOOST_MATH_TEST_VALUE(RealType, 1918807060892339412349747197.000000000000000000000000000000000000000000000000000000000000000000000000); + ws[444] = BOOST_MATH_TEST_VALUE(RealType, 58.74823998642851741200079363376591394780010356270916780643521499676375031617568209591145770868885078); + zs[445] = BOOST_MATH_TEST_VALUE(RealType, 1918807060892339412349747197.500000000000000000000000000000000000000000000000000000000000000000000000); + ws[445] = BOOST_MATH_TEST_VALUE(RealType, 58.74823998642851741200079363402213124170098239864731032633784326865477485858682385185460511772316968); + zs[446] = BOOST_MATH_TEST_VALUE(RealType, 3837614121784678824699494395.500000000000000000000000000000000000000000000000000000000000000000000000); + ws[446] = BOOST_MATH_TEST_VALUE(RealType, 59.42985170775297409538727174934638672334406646723725983740951105026349221807009071850919012663041550); + zs[447] = BOOST_MATH_TEST_VALUE(RealType, 3837614121784678824699494396.000000000000000000000000000000000000000000000000000000000000000000000000); + ws[447] = BOOST_MATH_TEST_VALUE(RealType, 59.42985170775297409538727174947451996655623151231730299282486521387670139214046503255303771865999613); + zs[448] = BOOST_MATH_TEST_VALUE(RealType, 3837614121784678824699494396.500000000000000000000000000000000000000000000000000000000000000000000000); + ws[448] = BOOST_MATH_TEST_VALUE(RealType, 59.42985170775297409538727174960265320976839655739734614822352956044016003363242954851814317386540390); + zs[449] = BOOST_MATH_TEST_VALUE(RealType, 3837614121784678824699494397.000000000000000000000000000000000000000000000000000000000000000000000000); + ws[449] = BOOST_MATH_TEST_VALUE(RealType, 59.42985170775297409538727174973078645298056160247738930360550408995386814254598426640885488605351946); +}; +// End of lambert_w_mp_high_values.ipp diff --git a/test/lambert_w_low_reference_values.cpp b/test/lambert_w_low_reference_values.cpp new file mode 100644 index 000000000..0c0a0f72d --- /dev/null +++ b/test/lambert_w_low_reference_values.cpp @@ -0,0 +1,237 @@ +// lambert_w_test_values.cpp + +// Copyright Paul A. Bristow 2017. +// 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) + +// Write a C++ file J:\Cpp\Misc\lambert_w_1000_test_values\lambert_w_mp_values.ipp +// containing arrays of z arguments and 100 decimal digit precision lambert_w0(z) reference values. +// These can be used in tests of precision of less-precise types like +// built-in float, double, long double and quad and cpp_dec_float_50. + +// Multiprecision types: +//#include +#include // boost::multiprecision::cpp_dec_float_100 +using boost::multiprecision::cpp_dec_float_100; + +#include // +using boost::math::lambert_w0; + +#include +// using std::cout; using std::std::endl; using std::ios; using std::std::cerr; +#include +using std::setprecision; +using std::showpoint; +#include +using std::ofstream; +#include +#include // for DBL_EPS etc +#include // for numeric limits. +//#include +#include +#include +using std::transform; + +const char* prefix = "static "; // "static const" or "static constexpr" or just "const "" or "" even? +// But problems with VS2017 and GCC not accepting same format mean only static at present. + +const long double eps = std::numeric_limits::epsilon(); + +/* + +// Sample test values from Wolfram. +template +static RealType zs[noof_tests]; + +template +void init_zs() +{ + zs[0] = BOOST_MATH_TEST_VALUE(RealType, -0.35); + zs[1] = BOOST_MATH_TEST_VALUE(RealType, -0.3); + zs[2] = BOOST_MATH_TEST_VALUE(RealType, -0.01); + zs[3] = BOOST_MATH_TEST_VALUE(RealType, +0.01); + zs[4] = BOOST_MATH_TEST_VALUE(RealType, 0.1); + zs[5] = BOOST_MATH_TEST_VALUE(RealType, 0.5); + zs[6] = BOOST_MATH_TEST_VALUE(RealType, 1.); + zs[7] = BOOST_MATH_TEST_VALUE(RealType, 2.); + zs[8] = BOOST_MATH_TEST_VALUE(RealType, 5.); + zs[9] = BOOST_MATH_TEST_VALUE(RealType, 10.); + zs[10] = BOOST_MATH_TEST_VALUE(RealType, 100.); + zs[11] = BOOST_MATH_TEST_VALUE(RealType, 1e+6); +}; + +// 'Known good' Lambert w values using N[productlog(-0.3), 50] +// evaluated to full precision of RealType (up to 50 decimal digits). +template +static RealType ws[noof_tests]; + +template +void init_ws() +{ + ws[0] = BOOST_MATH_TEST_VALUE(RealType, -0.7166388164560738505881698000038650406110575701385055261614344530078353170171071547711151137001759321); + ws[1] = BOOST_MATH_TEST_VALUE(RealType, -0.4894022271802149690362312519962933689234100060163590345114659679736814083816206187318524147462752111); + ws[2] = BOOST_MATH_TEST_VALUE(RealType, -0.01010152719853875327292018767138623973670903993475235877290726369225412969738704722202330440072213641); + ws[3] = BOOST_MATH_TEST_VALUE(RealType, 0.009901473843595011885336326816570107953627746494917415482611387085655068978243229360100010886171970918); + ws[4] = BOOST_MATH_TEST_VALUE(RealType, 0.09127652716086226429989572142317956865311922405147203264830839460717224625441755165020664592995606710); + ws[5] = BOOST_MATH_TEST_VALUE(RealType, 0.3517337112491958260249093009299510651714642155171118040466438461099606107203387108968323038321915693); + ws[6] = BOOST_MATH_TEST_VALUE(RealType, 0.5671432904097838729999686622103555497538157871865125081351310792230457930866845666932194469617522946); // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1) + ws[7] = BOOST_MATH_TEST_VALUE(RealType, 0.8526055020137254913464724146953174668984533001514035087721073946525150656742630448965773783502494847); + ws[8] = BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789290393025342679920536226774469916608426789); // https://www.wolframalpha.com/input/?i=N%5Bproductlog(5),+100%5D + ws[9] = BOOST_MATH_TEST_VALUE(RealType, 1.745528002740699383074301264875389911535288129080941331322206048555557259941551704989523510778883075); + ws[10] = BOOST_MATH_TEST_VALUE(RealType, 3.385630140290050184888244364529726867491694170157806680386174654885206544913039277686735236213650781); + ws[11] = BOOST_MATH_TEST_VALUE(RealType, 11.38335808614005262200015678158500428903377470601886512143238610626898610768018867797709315493717650); + ////W(1e35) = 76.256377207295812974093508663841808129811690961764 too big for float. +}; + +*/ + +// Global so accessible from output_value. +// Creates if no file exists, & uses default overwrite/ ios::replace. +const char filename[] = "lambert_w_low_reference values.ipp"; // +std::ofstream fout(filename, std::ios::out); ; // + +// 100 decimal digits for the value fed to macro BOOST_MATH_TEST_VALUE +typedef cpp_dec_float_100 RealType; + +void output_value(size_t index, RealType value) +{ + fout + << " zs[" << index << "] = BOOST_MATH_TEST_VALUE(RealType, " + << value + << ");" + << std::endl; + return; +} + +void output_lambert_w0(size_t index, RealType value) +{ + fout + << " ws[" << index << "] = BOOST_MATH_TEST_VALUE(RealType, " + << lambert_w0(value) + << ");" + << std::endl; + return; +} + +int main() +{ // Make C++ file containing Lambert W test values. + std::cout << filename << " "; +#ifdef __TIMESTAMP__ + std::cout << __TIMESTAMP__; +#endif + std::cout << std::endl; + std::cout << "Lambert W0 decimal digit precision values." << std::endl; + + // Note __FILE__ & __TIMESTAMP__ are ANSI standard C & thus Std C++? + + if (!fout.is_open()) + { // File failed to open OK. + std::cerr << "Open file " << filename << " failed!" << std::endl; + std::cerr << "errno " << errno << std::endl; + return -1; + } + + int output_precision = std::numeric_limits::digits10; + // cpp_dec_float_100 is ample precision and + // has several extra bits internally so max_digits10 are not needed. + fout.precision(output_precision); + + int no_of_tests = 100; + + // Intro for RealType values. + std::cout << "Lambert W test values written to file " << filename << std::endl; + fout << + "\n" + "// A collection of Lambert W test values computed using " + << output_precision << " decimal digits precision.\n" + "// C++ floating-point type is " << "RealType." "\n" + "\n" + "// Written by " << __FILE__ << " " << __TIMESTAMP__ << "\n" + + "\n" + "// Copyright Paul A. Bristow 2017." "\n" + "// Distributed under the Boost Software License, Version 1.0." "\n" + "// (See accompanying file LICENSE_1_0.txt" "\n" + "// or copy at http://www.boost.org/LICENSE_1_0.txt)" "\n" + << std::endl; + + fout << "// Size of arrays of arguments z and Lambert W" << std::endl; + fout << "static const unsigned int noof_tests = " << no_of_tests << ";" << std::endl; + + // Declare arrays of z and Lambert W. + + fout << "// Declare arrays of arguments z and Lambert W(z)" << std::endl; + fout << "// The values are defined using the macro BOOST_MATH_TEST_VALUE to ensure\n" + "// that both built-in and multiprecision types are correctly initialiased with full precision.\n" + "// built-in types like double require a floating-point literal like 3.14,\n" + "// but multiprecision types require a decimal digit string like \"3.14\".\n" + << std::endl; + fout << + "\n" + "template ""\n" + "static RealType zs[" << no_of_tests << "];" + << std::endl; + + fout << + "\n" + "template ""\n" + "static RealType ws[" << no_of_tests << "];" + << std::endl; + + RealType max_z("10"); + RealType min_z("-0.35"); + RealType step_size("0.01"); + size_t step_count = no_of_tests; + + // Output to initialize array of arguments z for Lambert W. + fout << + "\n" + << "template \n" + "void init_zs()\n" + "{\n"; + + RealType z = min_z; + for (size_t i = 0; (i < no_of_tests); i++) + { + output_value(i, z); + z += step_size; + } + fout << "};" << std::endl; + + // Output array of Lambert W values. + fout << + "\n" + << "template \n" + "void init_ws()\n" + "{\n"; + + z = min_z; + for (size_t i = 0; (i < step_count); i++) + { + output_lambert_w0(i, z); + z += step_size; + } + fout << "};" << std::endl; + + fout << "// End of lambert_w_mp_values.ipp " << std::endl; + fout.close(); + + std::cout << "Lambert_w0 values written to files " << __TIMESTAMP__ << std::endl; + return 0; +} // main + + +/* + +start and finish checks again Wolfram Alpha: +ws[0] = BOOST_MATH_TEST_VALUE(RealType, -0.7166388164560738505881698000038650406110575701385055261614344530078353170171071547711151137001759321); +Wolfram N[productlog(-0.35), 100] -0.7166388164560738505881698000038650406110575701385055261614344530078353170171071547711151137001759321 + + +ws[19] = BOOST_MATH_TEST_VALUE(RealType, 0.7397278549447991214587608743391115983469848985053641692586810406118264600667862543570373167046626221); +Wolfram N[productlog(1.55), 100] 0.7397278549447991214587608743391115983469848985053641692586810406118264600667862543570373167046626221 + + +*/ + diff --git a/test/lambert_w_low_reference_values.ipp b/test/lambert_w_low_reference_values.ipp new file mode 100644 index 000000000..f4466e4c2 --- /dev/null +++ b/test/lambert_w_low_reference_values.ipp @@ -0,0 +1,236 @@ + +// A collection of Lambert W test values computed using 100 decimal digits precision. +// C++ floating-point type is RealType. + +// Written by lambert_w_mp_test_values.cpp Tue Oct 10 14:35:08 2017 + +// Copyright Paul A. Bristow 2017. +// 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) + +// Size of arrays of arguments z and Lambert W +static const unsigned int noof_tests = 100; +// Declare arrays of arguments z and Lambert W(z) +// The values are defined using the macro BOOST_MATH_TEST_VALUE to ensure +// that both built-in and multiprecision types are correctly initialiased with full precision. +// built-in types like double require a floating-point literal like 3.14, +// but multiprecision types require a decimal digit string like "3.14". + + +template +static RealType zs[100]; + +template +static RealType ws[100]; + +template +void init_zs() +{ + zs[0] = BOOST_MATH_TEST_VALUE(RealType, -0.35); + zs[1] = BOOST_MATH_TEST_VALUE(RealType, -0.34); + zs[2] = BOOST_MATH_TEST_VALUE(RealType, -0.33); + zs[3] = BOOST_MATH_TEST_VALUE(RealType, -0.32); + zs[4] = BOOST_MATH_TEST_VALUE(RealType, -0.31); + zs[5] = BOOST_MATH_TEST_VALUE(RealType, -0.3); + zs[6] = BOOST_MATH_TEST_VALUE(RealType, -0.29); + zs[7] = BOOST_MATH_TEST_VALUE(RealType, -0.28); + zs[8] = BOOST_MATH_TEST_VALUE(RealType, -0.27); + zs[9] = BOOST_MATH_TEST_VALUE(RealType, -0.26); + zs[10] = BOOST_MATH_TEST_VALUE(RealType, -0.25); + zs[11] = BOOST_MATH_TEST_VALUE(RealType, -0.24); + zs[12] = BOOST_MATH_TEST_VALUE(RealType, -0.23); + zs[13] = BOOST_MATH_TEST_VALUE(RealType, -0.22); + zs[14] = BOOST_MATH_TEST_VALUE(RealType, -0.21); + zs[15] = BOOST_MATH_TEST_VALUE(RealType, -0.2); + zs[16] = BOOST_MATH_TEST_VALUE(RealType, -0.19); + zs[17] = BOOST_MATH_TEST_VALUE(RealType, -0.18); + zs[18] = BOOST_MATH_TEST_VALUE(RealType, -0.17); + zs[19] = BOOST_MATH_TEST_VALUE(RealType, -0.16); + zs[20] = BOOST_MATH_TEST_VALUE(RealType, -0.15); + zs[21] = BOOST_MATH_TEST_VALUE(RealType, -0.14); + zs[22] = BOOST_MATH_TEST_VALUE(RealType, -0.13); + zs[23] = BOOST_MATH_TEST_VALUE(RealType, -0.12); + zs[24] = BOOST_MATH_TEST_VALUE(RealType, -0.11); + zs[25] = BOOST_MATH_TEST_VALUE(RealType, -0.1); + zs[26] = BOOST_MATH_TEST_VALUE(RealType, -0.09); + zs[27] = BOOST_MATH_TEST_VALUE(RealType, -0.08); + zs[28] = BOOST_MATH_TEST_VALUE(RealType, -0.07); + zs[29] = BOOST_MATH_TEST_VALUE(RealType, -0.06); + zs[30] = BOOST_MATH_TEST_VALUE(RealType, -0.05); + zs[31] = BOOST_MATH_TEST_VALUE(RealType, -0.04); + zs[32] = BOOST_MATH_TEST_VALUE(RealType, -0.03); + zs[33] = BOOST_MATH_TEST_VALUE(RealType, -0.02); + zs[34] = BOOST_MATH_TEST_VALUE(RealType, -0.01); + zs[35] = BOOST_MATH_TEST_VALUE(RealType, 0); + zs[36] = BOOST_MATH_TEST_VALUE(RealType, 0.01); + zs[37] = BOOST_MATH_TEST_VALUE(RealType, 0.02); + zs[38] = BOOST_MATH_TEST_VALUE(RealType, 0.03); + zs[39] = BOOST_MATH_TEST_VALUE(RealType, 0.04); + zs[40] = BOOST_MATH_TEST_VALUE(RealType, 0.05); + zs[41] = BOOST_MATH_TEST_VALUE(RealType, 0.06); + zs[42] = BOOST_MATH_TEST_VALUE(RealType, 0.07); + zs[43] = BOOST_MATH_TEST_VALUE(RealType, 0.08); + zs[44] = BOOST_MATH_TEST_VALUE(RealType, 0.09); + zs[45] = BOOST_MATH_TEST_VALUE(RealType, 0.1); + zs[46] = BOOST_MATH_TEST_VALUE(RealType, 0.11); + zs[47] = BOOST_MATH_TEST_VALUE(RealType, 0.12); + zs[48] = BOOST_MATH_TEST_VALUE(RealType, 0.13); + zs[49] = BOOST_MATH_TEST_VALUE(RealType, 0.14); + zs[50] = BOOST_MATH_TEST_VALUE(RealType, 0.15); + zs[51] = BOOST_MATH_TEST_VALUE(RealType, 0.16); + zs[52] = BOOST_MATH_TEST_VALUE(RealType, 0.17); + zs[53] = BOOST_MATH_TEST_VALUE(RealType, 0.18); + zs[54] = BOOST_MATH_TEST_VALUE(RealType, 0.19); + zs[55] = BOOST_MATH_TEST_VALUE(RealType, 0.2); + zs[56] = BOOST_MATH_TEST_VALUE(RealType, 0.21); + zs[57] = BOOST_MATH_TEST_VALUE(RealType, 0.22); + zs[58] = BOOST_MATH_TEST_VALUE(RealType, 0.23); + zs[59] = BOOST_MATH_TEST_VALUE(RealType, 0.24); + zs[60] = BOOST_MATH_TEST_VALUE(RealType, 0.25); + zs[61] = BOOST_MATH_TEST_VALUE(RealType, 0.26); + zs[62] = BOOST_MATH_TEST_VALUE(RealType, 0.27); + zs[63] = BOOST_MATH_TEST_VALUE(RealType, 0.28); + zs[64] = BOOST_MATH_TEST_VALUE(RealType, 0.29); + zs[65] = BOOST_MATH_TEST_VALUE(RealType, 0.3); + zs[66] = BOOST_MATH_TEST_VALUE(RealType, 0.31); + zs[67] = BOOST_MATH_TEST_VALUE(RealType, 0.32); + zs[68] = BOOST_MATH_TEST_VALUE(RealType, 0.33); + zs[69] = BOOST_MATH_TEST_VALUE(RealType, 0.34); + zs[70] = BOOST_MATH_TEST_VALUE(RealType, 0.35); + zs[71] = BOOST_MATH_TEST_VALUE(RealType, 0.36); + zs[72] = BOOST_MATH_TEST_VALUE(RealType, 0.37); + zs[73] = BOOST_MATH_TEST_VALUE(RealType, 0.38); + zs[74] = BOOST_MATH_TEST_VALUE(RealType, 0.39); + zs[75] = BOOST_MATH_TEST_VALUE(RealType, 0.4); + zs[76] = BOOST_MATH_TEST_VALUE(RealType, 0.41); + zs[77] = BOOST_MATH_TEST_VALUE(RealType, 0.42); + zs[78] = BOOST_MATH_TEST_VALUE(RealType, 0.43); + zs[79] = BOOST_MATH_TEST_VALUE(RealType, 0.44); + zs[80] = BOOST_MATH_TEST_VALUE(RealType, 0.45); + zs[81] = BOOST_MATH_TEST_VALUE(RealType, 0.46); + zs[82] = BOOST_MATH_TEST_VALUE(RealType, 0.47); + zs[83] = BOOST_MATH_TEST_VALUE(RealType, 0.48); + zs[84] = BOOST_MATH_TEST_VALUE(RealType, 0.49); + zs[85] = BOOST_MATH_TEST_VALUE(RealType, 0.5); + zs[86] = BOOST_MATH_TEST_VALUE(RealType, 0.51); + zs[87] = BOOST_MATH_TEST_VALUE(RealType, 0.52); + zs[88] = BOOST_MATH_TEST_VALUE(RealType, 0.53); + zs[89] = BOOST_MATH_TEST_VALUE(RealType, 0.54); + zs[90] = BOOST_MATH_TEST_VALUE(RealType, 0.55); + zs[91] = BOOST_MATH_TEST_VALUE(RealType, 0.56); + zs[92] = BOOST_MATH_TEST_VALUE(RealType, 0.57); + zs[93] = BOOST_MATH_TEST_VALUE(RealType, 0.58); + zs[94] = BOOST_MATH_TEST_VALUE(RealType, 0.59); + zs[95] = BOOST_MATH_TEST_VALUE(RealType, 0.6); + zs[96] = BOOST_MATH_TEST_VALUE(RealType, 0.61); + zs[97] = BOOST_MATH_TEST_VALUE(RealType, 0.62); + zs[98] = BOOST_MATH_TEST_VALUE(RealType, 0.63); + zs[99] = BOOST_MATH_TEST_VALUE(RealType, 0.64); +}; + +template +void init_ws() +{ + ws[0] = BOOST_MATH_TEST_VALUE(RealType, -0.7166388164560746087024558456707254694384568520557269136746931098892793788395047380759438025387884858); + ws[1] = BOOST_MATH_TEST_VALUE(RealType, -0.6536945012690894831597997531138338843162464994103594824433758069038214520742337992347211610550053984); + ws[2] = BOOST_MATH_TEST_VALUE(RealType, -0.6032666497551330505290050177510626805198672833479939253720127109209527349195161224268802996274136747); + ws[3] = BOOST_MATH_TEST_VALUE(RealType, -0.5604894830784555743634840504116545657018790664887527536558909385182231717303278501957297352008893216); + ws[4] = BOOST_MATH_TEST_VALUE(RealType, -0.5229899496273203531021836240814670901286300106249589336522580913925382314180343142582930298688973328); + ws[5] = BOOST_MATH_TEST_VALUE(RealType, -0.4894022271802149690362312519962933689234100060163590345114659679736814083816206187318524147462752111); + ws[6] = BOOST_MATH_TEST_VALUE(RealType, -0.4588564134818020881945707413259267147702798410198651247860751590059996177594865393191440343561489497); + ws[7] = BOOST_MATH_TEST_VALUE(RealType, -0.430758874527112757916530656841372138819645982270515538512158436501726397121990576271580205308878207); + ws[8] = BOOST_MATH_TEST_VALUE(RealType, -0.4046836216050718653643250056478665857931866093242449366197023952738694255086107304901218425119878285); + ws[9] = BOOST_MATH_TEST_VALUE(RealType, -0.3803130203301711158303965355878156301369877394562403253806911002545713191362049178479001390543005669); + ws[10] = BOOST_MATH_TEST_VALUE(RealType, -0.3574029561813889030688111040559047533165905550760120436276204485896714025961457962896168513444411851); + ws[11] = BOOST_MATH_TEST_VALUE(RealType, -0.3357611647889027517286807582305262236620547459507665934563718789670705154001183482511605249232725262); + ws[12] = BOOST_MATH_TEST_VALUE(RealType, -0.3152331201461386435765969738874032981030054464637097661705367708887648429131963353376761780892891198); + ws[13] = BOOST_MATH_TEST_VALUE(RealType, -0.2956924930138396731882414803341009766267402363327831485839773479792571341845506001421908939342687003); + ws[14] = BOOST_MATH_TEST_VALUE(RealType, -0.2770344936961942277405408649408688233196542455843784252217943010706466317584602777484953020015260171); + ws[15] = BOOST_MATH_TEST_VALUE(RealType, -0.2591711018190737450566519502154067057135883397008937032218391275127128217957580326598838960236799743); + ws[16] = BOOST_MATH_TEST_VALUE(RealType, -0.2420275690015187377858338945726638068700099098394765251572836145818480355482127963663852628850474365); + ws[17] = BOOST_MATH_TEST_VALUE(RealType, -0.2255398031589208520522477564458058214947250100630471825833168970061295445194143654537283079293631882); + ws[18] = BOOST_MATH_TEST_VALUE(RealType, -0.2096523776773757526854110454922591821172341338912795099236642246474810661153254626268152915502654464); + ws[19] = BOOST_MATH_TEST_VALUE(RealType, -0.1943169925501295306267806518866699513042867279514786976609290465447683131164947042462416733465191705); + ws[20] = BOOST_MATH_TEST_VALUE(RealType, -0.1794912683479847336169956193772297997551233686606176679348345166799006378410748708389238307302596092); + ws[21] = BOOST_MATH_TEST_VALUE(RealType, -0.1651377892669526609846674769813353453533631060975171667664202096550705187268670901310309631101894252); + ws[22] = BOOST_MATH_TEST_VALUE(RealType, -0.1512233352864070831284495817823327538270829682666487244093315171463780635423561100568377622135186516); + ws[23] = BOOST_MATH_TEST_VALUE(RealType, -0.1377182597958957974485081647284122921614575977782346246206306428239556449434198032928042029722138321); + ws[24] = BOOST_MATH_TEST_VALUE(RealType, -0.1245959804557266577566667196210790531357931527107938915216224185712652948438844608688497767379885997); + ws[25] = BOOST_MATH_TEST_VALUE(RealType, -0.1118325591589629648335694568202658422726453622912658633296897727621943319600088273854870109175450158); + ws[26] = BOOST_MATH_TEST_VALUE(RealType, -0.09940635280454481474353567186786621057820625354936552021878311951478746295439312235429098520600693655); + ws[27] = BOOST_MATH_TEST_VALUE(RealType, -0.0872977208615799240409197586602731399264877335001009828544494658243661146551788411188719365040631665); + ws[28] = BOOST_MATH_TEST_VALUE(RealType, -0.07548877886579220591933915955796681153524932228333916508394604171275936228487984352484617277876166196); + ws[29] = BOOST_MATH_TEST_VALUE(RealType, -0.06396318935617251019529498180168867456392641049371161867095248726275828927462089387234209569688498636); + ws[30] = BOOST_MATH_TEST_VALUE(RealType, -0.05270598355154634795995650617915721289427674396592395159861151190218069285705994080638064249535030165); + ws[31] = BOOST_MATH_TEST_VALUE(RealType, -0.0417034084364844738987273381255397678625601003793974576012640697941798897037109744906565096871084505); + ws[32] = BOOST_MATH_TEST_VALUE(RealType, -0.03094279498284817939791038065611524917275896960162863310717850085820789123932160879579380708946724763); + ws[33] = BOOST_MATH_TEST_VALUE(RealType, -0.02041244405580766725973605390749548004158612495647388221129868845283704895545337928376001388096747673); + ws[34] = BOOST_MATH_TEST_VALUE(RealType, -0.01010152719853875327292018767138623973670903993475235877290726369225412969738704722202330440072213641); + ws[35] = BOOST_MATH_TEST_VALUE(RealType, 0); + ws[36] = BOOST_MATH_TEST_VALUE(RealType, 0.009901473843595011885336326816570107953627746494917415482611387085655068978243229360100010886171970918); + ws[37] = BOOST_MATH_TEST_VALUE(RealType, 0.01961158933740562729168248268298370977812129423409093067066057185151403434315590894008191205649296367); + ws[38] = BOOST_MATH_TEST_VALUE(RealType, 0.02913845916787001265458568152535395243296458501852019787733534716701300947181963767753439648797667795); + ws[39] = BOOST_MATH_TEST_VALUE(RealType, 0.03848966594197856933287598180923987047561124099417969473653441752849562865576161248185402614815991005); + ws[40] = BOOST_MATH_TEST_VALUE(RealType, 0.04767230860012937472638890051416087074706296593389050213640962398757901310991378849253401839554247932); + ws[41] = BOOST_MATH_TEST_VALUE(RealType, 0.05669304377414432493107872588796066666126335321712197451058496819855703149168243802045469883952188552); + ws[42] = BOOST_MATH_TEST_VALUE(RealType, 0.06555812274442272075701853672870305774479404911034476570035450491724937359575494857058381868464932454); + ws[43] = BOOST_MATH_TEST_VALUE(RealType, 0.07427342455278083997072135190143718509109109085324108067398934333182382982634706320903236612485848405); + ws[44] = BOOST_MATH_TEST_VALUE(RealType, 0.08284448574644162210327285639805993759142367414790119841318433362329213386156887296335560991622282284); + ws[45] = BOOST_MATH_TEST_VALUE(RealType, 0.0912765271608622642998957214231795686531192240514720326483083946071722462544175516502066459299560671); + ws[46] = BOOST_MATH_TEST_VALUE(RealType, 0.09957447809219979168181062315832233980460887841902355310769435168948823854831388504977465633939682845); + ws[47] = BOOST_MATH_TEST_VALUE(RealType, 0.1077429981622769541092028233904076346257727607117049788632909974125087436037688769621472372382338589); + ws[48] = BOOST_MATH_TEST_VALUE(RealType, 0.1157864971383620420455904585908175984070719832012079215609230219591260309061070611295890797209058613); + ws[49] = BOOST_MATH_TEST_VALUE(RealType, 0.123709152935653268637225082319130933018353939077412845800247462273779701933149651969922416814563643); + ws[50] = BOOST_MATH_TEST_VALUE(RealType, 0.1315149280010344580474416667366241780127651069693569916108339146599686985542850094826506230355645206); + ws[51] = BOOST_MATH_TEST_VALUE(RealType, 0.1392075842516055911219563262364716100580324132271864711438857091601938661529783118284822918918762012); + ws[52] = BOOST_MATH_TEST_VALUE(RealType, 0.1467906967200019429098356045334600022599041243103780089713630524471411698742480890410424556292186252); + ws[53] = BOOST_MATH_TEST_VALUE(RealType, 0.1542676660400332595939671017213220881360827710416946348345860549372631184130438485651715394816551156); + ws[54] = BOOST_MATH_TEST_VALUE(RealType, 0.1616417298902320361099923668622409534689583622433205732144762283241135493479959458637574220609547663); + ws[55] = BOOST_MATH_TEST_VALUE(RealType, 0.1689159734991095651164749037058183987284469135107297553319388783258832067427865597883933228919370041); + ws[56] = BOOST_MATH_TEST_VALUE(RealType, 0.176093339303957105084240207040480028792877878787501699026158171529756555902997254667356047116441788); + ws[57] = BOOST_MATH_TEST_VALUE(RealType, 0.1831766358446274967063002214815526159126266889851598585852904605011653998837614409160807673866997377); + ws[58] = BOOST_MATH_TEST_VALUE(RealType, 0.1901685459646637418459898415362480836632528245228542609994635862866965513625128722227696305198415266); + ws[59] = BOOST_MATH_TEST_VALUE(RealType, 0.1970716343842153356374997203517126469395880032764377549805749691269132085609349859323881542196582345); + ws[60] = BOOST_MATH_TEST_VALUE(RealType, 0.2038883547022401644431818313271398701493524772101596349734062600818193640670940526181645713107956088); + ws[61] = BOOST_MATH_TEST_VALUE(RealType, 0.2106210558793939073502149913441295543358575322967676769367700683562463350885767192666542957075712751); + ws[62] = BOOST_MATH_TEST_VALUE(RealType, 0.2172719882476450310112829333455034301692311490231843772189917487700633677693451679449281229277444); + ws[63] = BOOST_MATH_TEST_VALUE(RealType, 0.2238433090879237484082608989533539628744637740613473368794338628306680030796510487992807280960350863); + ws[64] = BOOST_MATH_TEST_VALUE(RealType, 0.230337087812934212569787581174413102713202565273940246146535096101718965948694383449116272546328387); + ws[65] = BOOST_MATH_TEST_VALUE(RealType, 0.2367553107885593168713669913131022529850076068942822776500825494062035956449035725319106127888967252); + ws[66] = BOOST_MATH_TEST_VALUE(RealType, 0.2430998858240055404991486201117080426760827615791233989777935602839590601547710113790997280209616842); + ws[67] = BOOST_MATH_TEST_VALUE(RealType, 0.2493726463579186824703694885450067240777490681347030220353778714445393581714407422015446216089384764); + ws[68] = BOOST_MATH_TEST_VALUE(RealType, 0.255575355365104731122377747221405406075211883935782315620283025379607560268766005462481341306785098); + ws[69] = BOOST_MATH_TEST_VALUE(RealType, 0.2617097090061743695408970492873886795528577990555646770473973759567281587373896180370074675102853899); + ws[70] = BOOST_MATH_TEST_VALUE(RealType, 0.2677773400403608426926161268075028522173112518463765933864820650709836250445193581155036917009299903); + ws[71] = BOOST_MATH_TEST_VALUE(RealType, 0.2737798210199097285877692071254930326690991310905656381739509847292712940678493744834592887738653624); + ws[72] = BOOST_MATH_TEST_VALUE(RealType, 0.279718667282780030688985330053563938014151152536888220220066424808617200267097125397004630221318648); + ws[73] = BOOST_MATH_TEST_VALUE(RealType, 0.2855953397589067078034135225526038434573251024673070045734211311120835242005964286865861813715576376); + ws[74] = BOOST_MATH_TEST_VALUE(RealType, 0.2914112476039358811079401653518892721830457004248980213382598417991951999360380881350324421536041991); + ws[75] = BOOST_MATH_TEST_VALUE(RealType, 0.2971677506731385467797269622470213419044581015501274519083671027242648030351552074110959032585686367); + ws[76] = BOOST_MATH_TEST_VALUE(RealType, 0.3028661618471218240709788492447379933660682925225029587250796959940885465093714030223793579774677182); + ws[77] = BOOST_MATH_TEST_VALUE(RealType, 0.3085077492199755507560853270193391876750205224915338763730055720866605941218639559241097041425718389); + ws[78] = BOOST_MATH_TEST_VALUE(RealType, 0.3140937381596049465307653625755662577673424859113972924301418900103932566506643308363685842713510345); + ws[79] = BOOST_MATH_TEST_VALUE(RealType, 0.3196253132491970154264844863020982117371468405067770401175599100299218378827848337045090472924417639); + ws[80] = BOOST_MATH_TEST_VALUE(RealType, 0.3251036201180404567925882149866539513803608104758008850889564944127408970111984388784259876569696298); + ws[81] = BOOST_MATH_TEST_VALUE(RealType, 0.3305297671692582446013104792754623176896333299898173620545327652833709938789531370957735854140619173); + ws[82] = BOOST_MATH_TEST_VALUE(RealType, 0.3359048272114117659741549735010360281170238179628782075568249283432891398635686044147614597227718316); + ws[83] = BOOST_MATH_TEST_VALUE(RealType, 0.3412298390003893228052121236143338755316388573531939840892239102731223392510954828680280968924289841); + ws[84] = BOOST_MATH_TEST_VALUE(RealType, 0.3465058086974944293540338951489158955895910665452626949454054191729967933634547552073491283786892473); + ws[85] = BOOST_MATH_TEST_VALUE(RealType, 0.3517337112491958260249093009299510651714642155171118040466438461099606107203387108968323038321915693); + ws[86] = BOOST_MATH_TEST_VALUE(RealType, 0.356914491693587151869424246256045038549439930737927770357941686970717473161840668532896372614750844); + ws[87] = BOOST_MATH_TEST_VALUE(RealType, 0.3620490663982259224347136211795537282192272992052648623722265772196673697387836128745005565051134501); + ws[88] = BOOST_MATH_TEST_VALUE(RealType, 0.3671383242336754065717073384163048245222026534654156361188807018443753849870522240862625069431927886); + ws[89] = BOOST_MATH_TEST_VALUE(RealType, 0.3721831276867561125667772461128588424710274544378039645877124572815833807252348818205119412993474916); + ws[90] = BOOST_MATH_TEST_VALUE(RealType, 0.3771843139172231305654429202753334704233212269643890432815783280355585518582574589199227373679397234); + ws[91] = BOOST_MATH_TEST_VALUE(RealType, 0.3821426957613190709393551341272838157890329391308789323327108090412283903082231991030667000296469447); + ws[92] = BOOST_MATH_TEST_VALUE(RealType, 0.3870590626854075768406867666899001946809584949146574272916930955076684732166306691825829034241158645); + ws[93] = BOOST_MATH_TEST_VALUE(RealType, 0.3919341816926673886247930427095007681691393368820432019135743979557612444151495005378394686508979365); + ws[94] = BOOST_MATH_TEST_VALUE(RealType, 0.3967687981856199130952904028742195107327166899059243534847812692294320278426834780185947685265825165); + ws[95] = BOOST_MATH_TEST_VALUE(RealType, 0.4015636367870725946626664537946836866230027160063511402379921560604975325206585381386527082762303647); + ws[96] = BOOST_MATH_TEST_VALUE(RealType, 0.4063194021218846501705479426913810870863608030934864938423596576756863248859417057476841165663966806); + ws[97] = BOOST_MATH_TEST_VALUE(RealType, 0.4110367795617996075205416204209832162005305795083946929235957810141140813392726029732502982435129093); + ws[98] = BOOST_MATH_TEST_VALUE(RealType, 0.4157164359354393999190647189307900734531788488207389484153095921329397217223528187979110265697876198); + ws[99] = BOOST_MATH_TEST_VALUE(RealType, 0.4203590202054164452305419772022302902943227646223432518640399730485379665439298245520857153666787776); +}; +// End of lambert_w_mp_values.ipp diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 899589956..3909c97ea 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -7,7 +7,8 @@ // or copy at http://www.boost.org/LICENSE_1_0.txt) // test_lambertw.cpp -//! \brief Basic sanity tests for Lambert W function plog or lambert_w using algorithm from Thomas Luu. +//! \brief Basic sanity tests for Lambert W function plog +//! or lambert_w using algorithm from Thomas Luu, Veberic and Fukushima. #include // for real_concept #define BOOST_TEST_MAIN @@ -15,27 +16,22 @@ #include // Boost.Test #include -#include "test_value.hpp" // for create_test_value +#include +#include +#include #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; #include - -#ifdef BOOST_HAS_FLOAT128 -#include // Not available for MSVC. -#endif - -#include - - fine BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for Lambert_w diagnostic output. -#include // For Lambert W lambert_w function. -using boost::math::lambert_w; +//#include // If available. #include // isnan, ifinite. +#include "test_value.hpp" // Macro BOOST_MATH_TEST_VALUE for create_test_value. -#include -#include -#include +//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for much Lambert_w diagnostic output. +#include // For Lambert W lambert_w function. +using boost::math::lambert_w0; +using boost::math::lambert_wm1; #include #include @@ -54,8 +50,8 @@ static const boost::array test_data = //static const boost::array test_expected = //{ { -// BOOST_MATH_TEST_VALUE(T, 0.56714329040978387299996866221035554975381578718651), // Output from https://www.wolframalpha.com/input/?i=lambert_w(1) -// BOOST_MATH_TEST_VALUE(T, 1.432404775898300311234078007212058694786434608804302025655) // Output from https://www.wolframalpha.com/input/?i=lambert_w(6) +// BOOST_MATH_TEST_VALUE(T, 0.56714329040978387299996866221035554975381578718651), // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1) +// BOOST_MATH_TEST_VALUE(T, 1.432404775898300311234078007212058694786434608804302025655) // Output from https://www.wolframalpha.com/input/?i=lambert_w0(6) // } }; // array test_data @@ -119,7 +115,8 @@ void test_spots(RealType) // (Unused Parameter value, arbitrarily zero, only communicates the floating point type). // test_spots(0.F); test_spots(0.); test_spots(0.L); - using boost::math::lambert_w; + using boost::math::lambert_w0; + using boost::math::lambert_wm1; using boost::math::constants::exp_minus_one; using boost::math::policies::policy; @@ -134,14 +131,14 @@ void test_spots(RealType) // // Test some bad parameters to the function, with default policy and with ignore_all policy. #ifndef BOOST_NO_EXCEPTIONS - BOOST_CHECK_THROW(boost::math::lambert_w(-1.), std::domain_error); - BOOST_CHECK_THROW(lambert_w(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. - BOOST_CHECK_THROW(lambert_w(std::numeric_limits::infinity()), std::domain_error); // Would be infinite. - BOOST_CHECK_THROW(lambert_w(-static_cast(0.4)), std::domain_error); // Would be complex. + BOOST_CHECK_THROW(boost::math::lambert_w0(-1.), std::domain_error); + BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. + BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Would be infinite. + BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex. #else - BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(); // -exp(-1) = -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 - // lambert_w[-0.367879441171442321595523770161460867445811131031767834] == -1 + // lambert_w0[-0.367879441171442321595523770161460867445811131031767834] == -1 // -0.36787945032119751 RealType minus_one_value = BOOST_MATH_TEST_VALUE(RealType, -1.); //std::cout << "singular_value " << singular_value << ", expected Lambert W = " << minus_one_value << std::endl; BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) = -0.367879450 = -1 - lambert_w(singular_value), + lambert_w0(singular_value), minus_one_value, tolerance); // OK BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 - lambert_w(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), + lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), BOOST_MATH_TEST_VALUE(RealType, -1.), tolerance); BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 - lambert_w(-exp_minus_one()), + lambert_w0(-exp_minus_one()), BOOST_MATH_TEST_VALUE(RealType, -1.), tolerance); // Tests with some spot values computed using // https://www.wolframalpha.com/input - // For example: N[lambert_w[1], 50] outputs: + // For example: N[lambert_w0[1], 50] outputs: // 0.56714329040978387299996866221035554975381578718651 - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.1)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)), BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.2) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.2) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.2)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.2)), BOOST_MATH_TEST_VALUE(RealType, 0.16891597349910956511647490370581839872844691351073), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.2) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.2) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.5)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.5)), BOOST_MATH_TEST_VALUE(RealType, 0.351733711249195826024909300929951065171464215517111804046), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.5) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.5) tolerance); BOOST_CHECK_CLOSE_FRACTION( - lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.)), + lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.)), BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(1) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 2.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 2.)), BOOST_MATH_TEST_VALUE(RealType, 0.852605502013725491346472414695317466898453300151403508772), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(2.) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(2.) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 3.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.)), BOOST_MATH_TEST_VALUE(RealType, 1.049908894964039959988697070552897904589466943706341452932), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(3.) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(3.) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 5.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 5.)), BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.5) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.5) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 6.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 6.)), BOOST_MATH_TEST_VALUE(RealType, 1.432404775898300311234078007212058694786434608804302025655), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(6) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(6) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 100.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 100.)), BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(100) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(100) tolerance); // This fails for fixed_point type used for other tests because out of range? - //BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), + //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), //BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), - //// Output from https://www.wolframalpha.com/input/?i=lambert_w(1e6) + //// Output from https://www.wolframalpha.com/input/?i=lambert_w0(1e6) //// tolerance * 1000); // fails for fixed_point type exceeds 0.00015258789063 // // 15.258789063 // // 11.383346558 @@ -241,7 +238,7 @@ void test_spots(RealType) // So need to use some spot tests for specific types, or use a bigger fixed_point type. // Check zero. - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.0)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0)), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); // these fail for cpp_dec_float_50 @@ -251,11 +248,11 @@ void test_spots(RealType) /* if (std::numeric_limits::is_specialized) { // Check +/- values near to zero. - BOOST_CHECK_CLOSE_FRACTION(lambert_w(std::numeric_limits::epsilon()), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(std::numeric_limits::epsilon()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(-std::numeric_limits::epsilon()), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-std::numeric_limits::epsilon()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); } // is_specialized @@ -263,11 +260,11 @@ void test_spots(RealType) // Check infinite if possible. if (std::numeric_limits::has_infinity) { - BOOST_CHECK_CLOSE_FRACTION(lambert_w(+std::numeric_limits::infinity()), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(+std::numeric_limits::infinity()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(-std::numeric_limits::infinity()), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-std::numeric_limits::infinity()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); } @@ -275,11 +272,11 @@ void test_spots(RealType) // Check NaN if possible. if (std::numeric_limits::has_quiet_NaN) { - BOOST_CHECK_CLOSE_FRACTION(lambert_w(+std::numeric_limits::quiet_NaN()), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(+std::numeric_limits::quiet_NaN()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(-std::numeric_limits::quiet_NaN()), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-std::numeric_limits::quiet_NaN()), BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); } @@ -291,9 +288,9 @@ void test_spots(RealType) // Checks on input that should throw. /* This should throw when implemented. - BOOST_CHECK_CLOSE_FRACTION(lambert_w(-0.5), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-0.5), BOOST_MATH_TEST_VALUE(RealType, ), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(-0.5) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(-0.5) tolerance); */ } //template void test_spots(RealType) @@ -336,15 +333,15 @@ BOOST_AUTO_TEST_CASE(test_types) BOOST_AUTO_TEST_CASE(test_range_of_values) { - using boost::math::lambert_w; + using boost::math::lambert_w0; using boost::math::constants::exp_minus_one; BOOST_TEST_MESSAGE("Test Lambert W function type double for range of values."); // Want to test almost largest value. // test_value = (std::numeric_limits::max)() / 4; // std::cout << std::setprecision(std::numeric_limits::max_digits10) << "Max value = " << test_value << std::endl; - // Can't use a test like this for all types because max_value depends on RealType and thus the expected result of lambert_w does too. - //BOOST_CHECK_CLOSE_FRACTION(lambert_w(test_value), + // Can't use a test like this for all types because max_value depends on RealType and thus the expected result of lambert_w0 does too. + //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(test_value), // BOOST_MATH_TEST_VALUE(RealType, ???), // tolerance); // So this section just tests a single type, say IEEE 64-bit double, for a range of spot values. @@ -355,19 +352,19 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)), BOOST_MATH_TEST_VALUE(RealType, 9.9999900000149999733333854165586669000967020964243e-7), // Output from https://www.wolframalpha.com/input/ N[lambert_w[1e-6],50]) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.0001)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0001)), BOOST_MATH_TEST_VALUE(RealType, 0.000099990001499733385405869000452213835767629477903460), // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50]) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.001)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.001)), BOOST_MATH_TEST_VALUE(RealType, 0.00099900149733853088995782787410778559957065467928884), // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50]) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.01)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.01)), BOOST_MATH_TEST_VALUE(RealType, 0.0099014738435950118853363268165701079536277464949174), // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50]) tolerance * 25); // <<< Needs a much bigger tolerance??? @@ -381,60 +378,60 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // 0.00990728209160670 approx // 0.00990147384359511 previous - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.05)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.05)), BOOST_MATH_TEST_VALUE(RealType, 0.047672308600129374726388900514160870747062965933891), // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50]) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.1)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)), BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472), // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50]) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.)), BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651), // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50]) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 2.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 2.)), BOOST_MATH_TEST_VALUE(RealType, 0.852605502013725491346472414695317466898453300151403508772), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(2.) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(2.) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 3.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.)), BOOST_MATH_TEST_VALUE(RealType, 1.049908894964039959988697070552897904589466943706341452932), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(3.) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(3.) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 5.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 5.)), BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(0.5) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.5) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 6.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 6.)), BOOST_MATH_TEST_VALUE(RealType, 1.432404775898300311234078007212058694786434608804302025655), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(6) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(6) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 10.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 10.)), BOOST_MATH_TEST_VALUE(RealType, 1.7455280027406993830743012648753899115352881290809), // Output from https://www.wolframalpha.com/input/ N[lambert_w[10],50]) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 100.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 100.)), BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(100) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(100) tolerance); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1000.)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1000.)), BOOST_MATH_TEST_VALUE(RealType, 5.2496028524015962271260563196973062825214723860596), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(1000) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1000) tolerance); // This fails for fixed_point type used for other tests because out of range of the type? - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), - // Output from https://www.wolframalpha.com/input/?i=lambert_w(1e6) + // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1e6) tolerance); // // Tests for double only near the max and the singularity where Lambert_w estimates are less precise. @@ -448,7 +445,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // << " " << (std::numeric_limits::max)() / 4 // == 4.4942328371557893e+307 // << std::endl; - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double. + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double. static_cast(702.02379914670587), // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 // as a double == 701.83341468208209 @@ -456,14 +453,14 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // std::numeric_limits::epsilon() * 256); 0.0003); // Much less precise near the max edge. - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307/2), // near max_value for IEEE 64-bit double. + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/2), // near max_value for IEEE 64-bit double. static_cast(701.15054872492476914094824907722937), // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 // as a double == 701.83341468208209 // Lambert computed 702.02379914670587 std::numeric_limits::epsilon()); - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w(4.4942328371557893e+307/4), // near max_value for IEEE 64-bit double. + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/4), // near max_value for IEEE 64-bit double. static_cast(700.45838920868939857588606393559517), // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 // as a double == 701.83341468208209 @@ -474,7 +471,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // (below which the result has a non-zero imaginary part). RealType test_value = -exp_minus_one(); test_value += (std::numeric_limits::epsilon() * 1); - BOOST_CHECK_CLOSE_FRACTION(lambert_w(test_value), + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(test_value), BOOST_MATH_TEST_VALUE(RealType, -0.99999996349975895), tolerance * 1000000000); // -0.99999996788201051 diff --git a/test/test_lambert_w0_precision_high.cpp b/test/test_lambert_w0_precision_high.cpp new file mode 100644 index 000000000..31221461d --- /dev/null +++ b/test/test_lambert_w0_precision_high.cpp @@ -0,0 +1,358 @@ +// Copyright Paul A. Bristow 2017. + +// 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). + +// Test evaluations of Lambert W function and comparison with reference values > 0.5 computed at 100 decimal digits precision. + +//#define BOOST_MATH_LAMBERT_W_TEST_OUTPUT // Define to output all values of argument z and lambert W and differences. + +#include // For float_64_t, float128_t. Must be first include! +#include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ...Fw = +#include // for BOOST_MSVC versions. +#include +#include // boost::exception +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. +#include +//#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. + +#include // boost::multiprecision::cpp_dec_float_50 +using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. +using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. + +#include +// Multiprecision types: +//test_spots(static_cast(0)); +//test_spots(static_cast(0)); +//test_spots(static_cast(0)); + +using boost::multiprecision::cpp_bin_float_double_extended; +using boost::multiprecision::cpp_bin_float_double; +using boost::multiprecision::cpp_bin_float_quad; +// #define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for (much) diagnostic output. + +#include // For lambert_w0 and _wm1 functions. + +#include +#include +#include +using boost::lexical_cast; +#include + +#include +#include +#include +#include +#include // For std::numeric_limits. +#include +#include + +// Include 'Known good' Lambert w values using N[productlog(-0.3), 100] +// evaluated to full precision of RealType (up to 100 decimal digits). +// Checked for a few z values using WolframAlpha command: N[productlog(-0.3), 100] +//#include "J:\Cpp\Misc\lambert_w_1000_test_values\lambert_w_mp_values.ipp" +#include "J:\Cpp\Misc\lambert_w_high_reference_values\lambert_w_mp_high_values.ipp" +// #include "lambert_w_mp_values.ipp" + +// Optional functions to list z arguments and reference lambert w values. +template +void list_zws() +{ + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << noof_tests << " Test values of type: " << typeid(RealType).name() << std::endl; + + init_ws(); + init_zs(); + + for (size_t i = 0; i != noof_tests; i++) + { + std::cout << i << " " << zs[i] << " " << ws[i] << std::endl; + } +} // list_zws()template + + //! Test difference between 'known good' reference values (100 decimal digit precision) + //! of Lambert W and values computed for the RealType by lambert_w0 (or lambert_wm1) function. +template +float test_zws() +{ + std::cout << "Tests with type: " << typeid(RealType).name() << std::endl; + // std::cout << noof_tests << " test values computed and compared." << std::endl; + // Better to show just once at start of all tests? + std::cout << "digits10 = " << std::numeric_limits::digits10 + << ", max_digits10 = " << std::numeric_limits::max_digits10 + << std::setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() + << std::endl; + + std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits. + //init_zs(); // Test z arguments. + //init_ws(); // Lambert W reference values. + init_zws(); // Test z arguments and Lambert W reference values. + + using boost::math::lambert_w0; + using boost::math::lambert_wm1; + using boost::math::float_distance; + + //! Biggest float distance between reference and computed Lambert W. + long long int max_distance = 0; + //! Total of all float distances for all the values tested. + long long int total_distance = 0; + // Mean distance = total_distance / noof_tests. + float mean_distance = 0.F; + + for (size_t i = 0; i != noof_tests; i++) + { + RealType z = zs[i]; + RealType w = lambert_w0(z); // Only for float or double! + RealType kw = ws[i]; // 'Known good' 100 decimal digits. + + RealType fd = float_distance(w, kw); + RealType diff = (w - kw); + + long long int distance = static_cast(fd); + long long int abs_distance = abs(distance); + total_distance += abs_distance; + if (abs_distance > max_distance) + { + max_distance = abs_distance; + } + mean_distance = (float)total_distance / noof_tests; + + #ifdef BOOST_MATH_LAMBERT_W_TEST_OUTPUT + std::cout << z << " " << w << " " << ws[i] // << ", Distance = " << distance not useful for multiprecision types? + << std::setprecision(3) + << ", diff abs " << diff + << ", diff rel " << (w - kw) / kw + << ", epsilons = " << diff / std::numeric_limits::epsilon() + << std::setprecision(std::numeric_limits::max_digits10) + << std::endl; + #endif + } // for + std::streamsize precision = std::cout.precision(3); + std::cout << "max " << max_distance << ", total distance = " << total_distance << " bits, mean " << mean_distance << std::endl; + std::cout.precision(precision); + return mean_distance; +} // void test_zws() + + //! Compare a single evaluation of lambert_w0 with reference value (100 decimal digit precision). + //! \returns distance between values in bits. + //! This falls foul of conversion using multiprecision. + //! And of loss of precision using multiprecision. + //! using macro BOOST_MATH_TEST_VALUE avoids this pitfall. +template +int test_spot(RealType z) +{ + using boost::math::lambert_w0; + using boost::math::float_distance; + + RealType lw = lambert_w0(z); + RealType rlw = static_cast(lambert_w0(z)); + + std::cout.precision(std::numeric_limits::max_digits10); // or + //std::cout.precision(std::numeric_limits::digits10); + std::cout << lw << "\n" << rlw << std::endl; + + int distance = static_cast(float_distance(rlw, lw)); + std::cout << "distance " << distance << std::endl; + return distance; +} // int test_spot(RealType z) + + //! Compare computed Lambert W(z) with 'known good' reference values. + //! Both as the same RealType. +template +int compare_spot(RealType z, RealType w) +{ + using boost::math::lambert_w0; + using boost::math::lambert_wm1; + using boost::math::nextafter; + using boost::math::float_next; + using boost::math::float_distance; + + //init_zs(); // Test z arguments. + //init_ws(); // Lambert W reference values. + init_zws(); // Initialise both Test z arguments and Lambert_w values. + + std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; + + std::cout << "digits10 = " << std::numeric_limits::digits10 + << ", max_digits10 = " << std::numeric_limits::max_digits10 + << ", epsilon = " << std::numeric_limits::epsilon() + << std::endl; + + // std::cout.precision(std::numeric_limits::max_digits10); + std::cout.precision(std::numeric_limits::digits10); + + RealType lw = lambert_w0(z); + RealType flw = w; + + std::cout << lw << "\n" << flw << std::endl; + + int distance = static_cast(float_distance(flw, lw)); + + std::cout << "distance " << distance << std::endl; + + return distance; +} // template int compare_spot(RealType z, RealType w) + + //! THis is no longer useful? + //template + //int test_spots(RealType) + //{ + // std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; + // //std::cout.precision(std::numeric_limits::max_digits10); // or digits10? + // std::cout.precision(std::numeric_limits::digits10); + // std::size_t n = noof_tests; + // std::cout << n << " test values. " << std::endl; + // int distances = 0; + // for (std::size_t i = 0; i != n; i++) + // { + // // RealType z = BOOST_MATH_TEST_VALUE(RealType, 0.5); + // //RealType w = BOOST_MATH_TEST_VALUE(RealType, "0.351733711249195826024909300929951065171464215517111804046"); + // //RealType z = lexical_cast(zs[i]); // lexical_cast doesn't do more than double precision! + // //RealType w = lexical_cast(ws[i]); + // // So can only do this safely using macro BOOST_MATH_TEST_VALUE. + // //RealType z = BOOST_MATH_TEST_VALUE(RealType, test_zs[i]); + // //RealType w = BOOST_MATH_TEST_VALUE(RealType, test_ws[i]); + // // error Missing suffix L + // + // RealType z = zs[i]; + // RealType w = ws[i]; + // std::cout << z << " " << w << std::endl; + // distances += compare_spot(z, w); + // } + // return distances; + //} // templateint test_spots(RealType) + +int main() +{ + try + { + std::cout << "Lambert W tests,\n" + << noof_tests << + " single spot tests comparing with 100 decimal digits precision reference values." << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << std::showpoint << std::endl; // Trailing zeros. + + using boost::math::constants::exp_minus_one; + + using boost::math::lambert_w0; + using boost::math::lambert_wm1; + using boost::math::nextafter; + using boost::math::float_next; + + using boost::math::policies::make_policy; + using boost::math::policies::digits10; + using boost::math::policies::policy; + + 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::throw_on_error; + + // Define a policy: + typedef policy< + domain_error, + overflow_error + > throw_policy; + + // Examples of some single tests show pitfalls using mutliprecision. + + // Single spot value test of lambert_w0(0.5). + //using boost::multiprecision::cpp_bin_float_quad; + //std::cout.precision(std::numeric_limits::max_digits10); + //cpp_bin_float_quad zq(0.5); + //std::cout << "\nLambert W (" << zq << ") = " << LambertW0(zq) << std::endl; // + // 0.351733711249195826024909300929951065171464215517111804046 expected from Wolfram (and Luu triple Halley). + // 0.3517337112491958262237012910577188474 // cpp_bin_float_quad + // 0.35173371124919584 // double + + test_spot(0.5F); // 0.351733714 + test_spot(0.5); // 0.35173371124919584 + // Multiprecision won't convert at full precision. + //test_spot(0.5); + //test_spot(0.5); + //test_spot(0.5); + + //std::cout <<"float total distances = " << test_spots(0.1f) << std::endl; + //std::cout <<"double total distances = " << test_spots(0.1) << std::endl; + //std::cout <<"cpp_bin_float_quad total distances = " << test_spots(0.1) << std::endl; + + // Compare double spot value: + compare_spot(0.5, 0.351733711249195826024909300929951065171464215517111804046); // 0.351733711249195826024909300929951 + + //cpp_bin_float_quad hq(0.5); // Care - only convert 17 decimal digits precision for double. + // but this value 0.5 is exactly representable, so exact, and so OK. + cpp_bin_float_quad hq("0.5"); // + // For multiprecision types, need to use a decimal digit string, not a floating-point literal: + cpp_bin_float_quad rhq("0.351733711249195826024909300929951065171464215517111804046"); + compare_spot(hq, rhq); // 0.351733711249195826024909300929951 and distance == 0 + // Useful to check a particular z argument. + //init_zs(); + //init_ws(); + init_zws(); + + compare_spot(zs[1], ws[1]); // -0.653694501269090 -0.653694501269089, distance = -1 + + // Simple group of test values, including near zero, and near singularity. + + // Optionally list the z arguments and reference test lambert_w values. + //list_zws(); + //list_zws(); + //list_zws(); + //list_zws(); + //list_zws(); + //list_zws<__float128>(); // OK, but fails test below. + //#ifdef BOOST_HAS_FLOAT128 + // list_zws(); + //#endif + // list_zws(); + //list_zws(); + + // Test several floating-point types: + test_zws(); + test_zws(); + + // test_zws(); expect exactly as double. + if (std::numeric_limits::digits == std::numeric_limits::digits) + { + // Emulate 80-bit long double. + test_zws(); + } + else + { // True 80-bit (or 128-bit) long double. + test_zws(); + } + test_zws(); + // test_zws(); + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} // int main() + + /* + Output: + + Lambert W tests, + 450 single spot tests comparing with 100 decimal digits precision reference values. + + Tests with type: float + digits10 = 6, max_digits10 = 9, epsilon = 1.19e-07 + max 1, total distance = 10 bits, mean 0.0222 + + Tests with type: double + digits10 = 15, max_digits10 = 17, epsilon = 2.22e-16 + max 1, total distance = 8 bits, mean 0.0178 + + Tests with type: class boost::multiprecision::number,0> + digits10 = 18, max_digits10 = 22, epsilon = 1.08e-19 + max 1, total distance = 109 bits, mean 0.242 + + Tests with type: class boost::multiprecision::number,0> + digits10 = 33, max_digits10 = 37, epsilon = 1.93e-34 + max 1, total distance = 135 bits, mean 0.300 + + + */ \ No newline at end of file diff --git a/test/test_lambert_w0_precision_low.cpp b/test/test_lambert_w0_precision_low.cpp new file mode 100644 index 000000000..9a8a39479 --- /dev/null +++ b/test/test_lambert_w0_precision_low.cpp @@ -0,0 +1,387 @@ +// Copyright Paul A. Bristow 2017. + +// 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). + +// Test evaluations of Lambert W function and comparison with reference values computed at 100 decimal digits precision. + +//#define BOOST_MATH_LAMBERT_W_TEST_OUTPUT // Define to output all values of argument z and lambert W and differences. + +#include // For float_64_t, float128_t. Must be first include! +#include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ...Fw = +#include // for BOOST_MSVC versions. +#include +#include // boost::exception +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. +#include +//#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. + +// Built-in/fundamental Quad 128-bit type, if available. +#ifdef BOOST_HAS_FLOAT128 +#include // Not available for MSVC. +//using boost::multiprecision::float128; +#endif + +#include // boost::multiprecision::cpp_dec_float_50 +using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. +using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. + +#include +using boost::multiprecision::cpp_bin_float_50; // 50 decimal digits type. + +// Multiprecision types: +//test_spots(static_cast(0)); +//test_spots(static_cast(0)); +//test_spots(static_cast(0)); + +// #define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for (much) diagnostic output. + +// For lambert_w function. +#include +using boost::multiprecision::cpp_bin_float_double_extended; +using boost::multiprecision::cpp_bin_float_double; +using boost::multiprecision::cpp_bin_float_quad; + +#include +#include +#include +using boost::lexical_cast; +#include + +#include +#include +#include +#include +#include // For std::numeric_limits. +#include +#include + +// Include 'Known good' Lambert w values using N[productlog(-0.3), 100] +// evaluated to full precision of RealType (up to 100 decimal digits). +// Checked for a few z values using WolframAlpha command: N[productlog(-0.3), 100] +#include "J:\Cpp\Misc\lambert_w_1000_test_values\lambert_w_mp_values.ipp" +// #include "lambert_w_mp_values.ipp" + +// Optional functions to list z arguments and reference lambert w values. +template +void list_zws() +{ + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << noof_tests << " Test values of type: " << typeid(RealType).name() << std::endl; + + init_ws(); + init_zs(); + + for (size_t i = 0; i != noof_tests; i++) + { + std::cout << i << " " << zs[i] << " " << ws[i] << std::endl; + } +} // list_zws()template + +//! Test difference between 'known good' reference values (100 decimal digit precision) +//! of Lambert W and values computed for the RealType by lambert_w0 (or lambert_wm1) function. +template +float test_zws() +{ + std::cout << "Tests with type: " << typeid(RealType).name() << std::endl; + // std::cout << noof_tests << " test values computed and compared." << std::endl; + // Better to show just once at start of all tests? + std::cout << "digits10 = " << std::numeric_limits::digits10 + << ", max_digits10 = " << std::numeric_limits::max_digits10 + << std:: setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() + << std::endl; + + std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits. + init_zs(); // Test z arguments. + init_ws(); // Lambert W reference values. + + using boost::math::lambert_w0; + using boost::math::lambert_wm1; + using boost::math::float_distance; + + //! Biggest float distance between reference and computed Lambert W. + long long int max_distance = 0; + //! Total of all float distances for all the values tested. + long long int total_distance = 0; + // Mean distance = total_distance / noof_tests. + float mean_distance = 0.F; + + for (size_t i = 0; i != noof_tests; i++) + { + RealType z = zs[i]; + RealType w = lambert_w0(z); // Only for float or double! + RealType kw = ws[i]; // 'Known good' 100 decimal digits. + + RealType fd = float_distance(w, kw); + RealType diff = (w - kw); + + long long int distance = static_cast(fd); + long long int abs_distance = abs(distance); + total_distance += abs_distance; + if (abs_distance > max_distance) + { + max_distance = abs_distance; + } + mean_distance = (float)total_distance / noof_tests; + + #ifdef BOOST_MATH_LAMBERT_W_TEST_OUTPUT + std::cout << z << " " << w << " " << ws[i] // << ", Distance = " << distance not useful for multiprecision types? + << std::setprecision(3) + << ", diff abs " << diff + << ", diff rel " << (w - kw) / kw + << ", epsilons = " << diff / std::numeric_limits::epsilon() + << std::setprecision(std::numeric_limits::max_digits10) + << std::endl; + #endif + } // for + std::streamsize precision = std::cout.precision(3); + std::cout << "max " << max_distance << ", total distance = " << total_distance << " bits, mean " << mean_distance << std::endl; + std::cout.precision(precision); + return mean_distance; +} // void test_zws() + +//! Compare a single evaluation of lambert_w0 with reference value (100 decimal digit precision). +//! \returns distance between values in bits. +//! This falls foul of conversion using multiprecision. +//! And of loss of precision using multiprecision. +//! using macro BOOST_MATH_TEST_VALUE avoids this pitfall. +template +int test_spot(RealType z) +{ + using boost::math::lambert_w0; + using boost::math::float_distance; + + RealType lw = lambert_w0(z); + RealType rlw = static_cast(lambert_w0(z)); + + std::cout.precision(std::numeric_limits::max_digits10); // or + //std::cout.precision(std::numeric_limits::digits10); + std::cout << lw << "\n" << rlw << std::endl; + + int distance = static_cast(float_distance(rlw, lw)); + std::cout << "distance " << distance << std::endl; + return distance; +} // int test_spot(RealType z) + +//! Compare computed Lambert W(z) with 'known good' reference values. +//! Both as the same RealType. +template +int compare_spot(RealType z, RealType w) +{ + using boost::math::lambert_w0; + using boost::math::lambert_wm1; + using boost::math::nextafter; + using boost::math::float_next; + using boost::math::float_distance; + + init_zs(); // Test z arguments. + init_ws(); // Lambert W reference values. + + std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; + + std::cout << "digits10 = " << std::numeric_limits::digits10 + << ", max_digits10 = " << std::numeric_limits::max_digits10 + << ", epsilon = " << std::numeric_limits::epsilon() + << std::endl; + + // std::cout.precision(std::numeric_limits::max_digits10); + std::cout.precision(std::numeric_limits::digits10); + + RealType lw = lambert_w0(z); + RealType flw = w; + + std::cout << lw << "\n" << flw << std::endl; + + int distance = static_cast(float_distance(flw, lw)); + + std::cout << "distance " << distance << std::endl; + + return distance; +} // template int compare_spot(RealType z, RealType w) + +//! THis is no longer useful? +//template +//int test_spots(RealType) +//{ +// std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; +// //std::cout.precision(std::numeric_limits::max_digits10); // or digits10? +// std::cout.precision(std::numeric_limits::digits10); +// std::size_t n = noof_tests; +// std::cout << n << " test values. " << std::endl; +// int distances = 0; +// for (std::size_t i = 0; i != n; i++) +// { +// // RealType z = BOOST_MATH_TEST_VALUE(RealType, 0.5); +// //RealType w = BOOST_MATH_TEST_VALUE(RealType, "0.351733711249195826024909300929951065171464215517111804046"); +// //RealType z = lexical_cast(zs[i]); // lexical_cast doesn't do more than double precision! +// //RealType w = lexical_cast(ws[i]); +// // So can only do this safely using macro BOOST_MATH_TEST_VALUE. +// //RealType z = BOOST_MATH_TEST_VALUE(RealType, test_zs[i]); +// //RealType w = BOOST_MATH_TEST_VALUE(RealType, test_ws[i]); +// // error Missing suffix L +// +// RealType z = zs[i]; +// RealType w = ws[i]; +// std::cout << z << " " << w << std::endl; +// distances += compare_spot(z, w); +// } +// return distances; +//} // templateint test_spots(RealType) + +int main() +{ + try + { + std::cout << "Lambert W tests,\n" + << noof_tests << + " single spot tests comparing with 100 decimal digits precision reference values." << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << std::showpoint << std::endl; // Trailing zeros. + + using boost::math::constants::exp_minus_one; + + using boost::math::lambert_w0; + using boost::math::lambert_wm1; + using boost::math::nextafter; + using boost::math::float_next; + + using boost::math::policies::make_policy; + using boost::math::policies::digits10; + using boost::math::policies::policy; + + 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::throw_on_error; + + // Define a policy: + typedef policy< + domain_error, + overflow_error + > throw_policy; + + // Examples of some single tests show pitfalls using mutliprecision. + + // Single spot value test of lambert_w0(0.5). + //using boost::multiprecision::cpp_bin_float_quad; + //std::cout.precision(std::numeric_limits::max_digits10); + //cpp_bin_float_quad zq(0.5); + //std::cout << "\nLambert W (" << zq << ") = " << LambertW0(zq) << std::endl; // + // 0.351733711249195826024909300929951065171464215517111804046 expected from Wolfram (and Luu triple Halley). + // 0.3517337112491958262237012910577188474 // cpp_bin_float_quad + // 0.35173371124919584 // double + + test_spot(0.5F); // 0.351733714 + test_spot(0.5); // 0.35173371124919584 + // Multiprecision won't convert at full precision. + //test_spot(0.5); + //test_spot(0.5); + //test_spot(0.5); + + //std::cout <<"float total distances = " << test_spots(0.1f) << std::endl; + //std::cout <<"double total distances = " << test_spots(0.1) << std::endl; + //std::cout <<"cpp_bin_float_quad total distances = " << test_spots(0.1) << std::endl; + + // Compare double spot value: + compare_spot(0.5, 0.351733711249195826024909300929951065171464215517111804046); // 0.351733711249195826024909300929951 + + //cpp_bin_float_quad hq(0.5); // Care - only convert 17 decimal digits precision for double. + // but this value 0.5 is exactly representable, so exact, and so OK. + cpp_bin_float_quad hq("0.5"); // + // For multiprecision types, need to use a decimal digit string, not a floating-point literal: + cpp_bin_float_quad rhq("0.351733711249195826024909300929951065171464215517111804046"); + compare_spot(hq, rhq); // 0.351733711249195826024909300929951 and distance == 0 + // Useful to check a particular z argument. + init_zs(); + init_ws(); + + compare_spot(zs[1], ws[1]); // -0.653694501269090 -0.653694501269089, distance = -1 + + // Simple group of test values, including near zero, and near singularity. + + // Optionally list the z arguments and reference test lambert_w values. + //list_zws(); + //list_zws(); + //list_zws(); + //list_zws(); + //list_zws(); + //list_zws<__float128>(); // OK, but fails test below. +//#ifdef BOOST_HAS_FLOAT128 +// list_zws(); +//#endif + // list_zws(); + //list_zws(); + + // Test several floating-point types: + test_zws(); + test_zws(); + + // test_zws(); expect exactly as double. + if (std::numeric_limits::digits == std::numeric_limits::digits) + { + // Emulate 80-bit long double. + test_zws(); + } + else + { // True 80-bit (or 128-bit) long double. + test_zws(); + } + test_zws(); + // test_zws(); + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} // int main() + +/* +test_lambert_w0_precision_low.cpp +Generating code +235 of 3718 functions ( 6.3%) were compiled, the rest were copied from previous compilation. +0 functions were new in current compilation +618 functions had inline decision re-evaluated but remain unchanged +Finished generating code +Lambert_w_pb2_tests.vcxproj -> J:\Cpp\Misc\x64\Release\Lambert_w_pb2_tests.exe +Lambert_w_pb2_tests.vcxproj -> J:\Cpp\Misc\x64\Release\Lambert_w_pb2_tests.pdb (Full PDB) +Lambert W tests, +100 single spot tests comparing with 100 decimal digits precision reference values. + +0.351733714 +0.351733714 +distance 0 +0.35173371124919584 +0.35173371124919584 +distance 0 +Test with type: double +digits10 = 15, max_digits10 = 17, epsilon = 2.2204460492503131e-16 +0.351733711249196 +0.351733711249196 +distance 0 +Test with type: class boost::multiprecision::number,0> +digits10 = 33, max_digits10 = 37, epsilon = 1.92592994438724e-34 +0.351733711249195826024909300929951 +0.351733711249195826024909300929951 +distance 0 +Test with type: double +digits10 = 15, max_digits10 = 17, epsilon = 2.22044604925031308084726333618164e-16 +-0.653694501269090 +-0.653694501269089 +distance -1 + +Tests with type: float +digits10 = 6, max_digits10 = 9, epsilon = 1.19e-07 +max 2, total distance = 37 bits, mean 0.370 +Tests with type: double +digits10 = 15, max_digits10 = 17, epsilon = 2.22e-16 +max 9, total distance = 49 bits, mean 0.490 +Tests with type: class boost::multiprecision::number,0> +digits10 = 18, max_digits10 = 22, epsilon = 1.08e-19 +max 4, total distance = 47 bits, mean 0.470 +Tests with type: class boost::multiprecision::number,0> +digits10 = 33, max_digits10 = 37, epsilon = 1.93e-34 +max 4, total distance = 54 bits, mean 0.540 + +*/ \ No newline at end of file diff --git a/test/test_value.hpp b/test/test_value.hpp new file mode 100644 index 000000000..c10596209 --- /dev/null +++ b/test/test_value.hpp @@ -0,0 +1,120 @@ +// Copyright Paul A. Bristow 2017. +// Copyright John Maddock 2017. + +// 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) + +// test_value.hpp + +#ifndef TEST_VALUE_HPP +#define TEST_VALUE_HPP + +// BOOST_MATH_TEST_VALUE is used to create a test value of suitable type from a decimal digit string. +// Two parameters, both a floating-point literal double like 1.23 (not long double so no suffix L) +// and a decimal digit string const char* like "1.23" must be provided. +// The decimal value represented must be the same of course, with at least enough precision for long double. +// Note there are two gotchas to this approach: +// * You need all values to be real floating-point values +// * and *MUST* include a decimal point (to avoid confusion with an integer literal). +// * It's slow to compile compared to a simple literal. + +// Speed is not an issue for a few test values, +// but it's not generally usable in large tables +// where you really need everything to be statically initialized. + +// Macro BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE provides a global diagnostic value for create_type. + +#include // For float_64_t, float128_t. Must be first include! +#include +#include +#include + +#ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE +// global int create_type(0); must be defined before including this file. +#endif + +#ifdef BOOST_HAS_FLOAT128 +typedef __float128 largest_float; +#define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##Q +#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS std::numeric_limits::digits +#else +typedef long double largest_float; +#define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##L +#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS std::numeric_limits::digits +#endif + +template +inline T create_test_value(largest_float val, const char*, const boost::mpl::true_&, const T2&) +{ // Construct from long double or quad parameter val (ignoring string/const char* str). + // (This is case for MPL parameters = true_ and T2 == false_, + // and MPL parameters = true_ and T2 == true_ cpp_bin_float) + // All built-in/fundamental floating-point types, + // and other User-Defined Types that can be constructed without loss of precision + // from long double suffix L (or quad suffix Q), + // + // Choose this method, even if can be constructed from a string, + // because it will be faster, and more likely to be the closest representation. + // (This is case for MPL parameters = mpl::true_ and T2 == mpl::true_). + #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE + create_type = 1; + #endif + return static_cast(val); +} + +template +inline T create_test_value(largest_float, const char* str, const boost::mpl::false_&, const boost::mpl::true_&) +{ // Construct from decimal digit string const char* @c str (ignoring long double parameter). + // For example, extended precision or other User-Defined types which ARE constructible from a string + // (but not from double, or long double without loss of precision). + // (This is case for MPL parameters = mpl::false_ and T2 == mpl::true_). + #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE + create_type = 2; + #endif + return T(str); +} + +template +inline T create_test_value(largest_float, const char* str, const boost::mpl::false_&, const boost::mpl::false_&) +{ // Create test value using from lexical cast of decimal digit string const char* str. + // For example, extended precision or other User-Defined types which are NOT constructible from a string + // (NOR constructible from a long double). + // (This is case T1 = mpl::false and T2 == mpl::false). + #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE + create_type = 3; + #endif + return boost::lexical_cast(str); +} + +// T real type, x a decimal digits representation of a floating-point, for example: 12.34. +// It must include a decimal point (or it would be interpreted as an integer). + +// x is converted to a long double by appending the letter L (to suit long double fundamental type), 12.34L. +// x is also passed as a const char* or string representation "12.34" +// (to suit most other types that cannot be constructed from long double without possible loss). + +// BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) makes a long double or quad version, with +// suffix a letter L (or Q) to suit long double (or quad) fundamental type, 12.34L or 12.34Q. +// #x makes a decimal digit string version to suit multiprecision and fixed_point constructors, "12.34". +// (Constructing from double or long double (or quad) could lose precision for multiprecision or fixed-point). + +// The matching create_test_value function above is chosen depending on the T1 and T2 mpl bool truths. +// The string version from #x is used if the precision of T is greater than long double. + +// Example: long double test_value = BOOST_MATH_TEST_VALUE(double, 1.23456789); + +#define BOOST_MATH_TEST_VALUE(T, x) create_test_value(\ + BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x),\ + #x,\ + boost::mpl::bool_<\ + std::numeric_limits::is_specialized &&\ + (std::numeric_limits::radix == 2)\ + && (std::numeric_limits::digits <= BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS)\ + && boost::is_convertible::value>(),\ + boost::mpl::bool_<\ + boost::is_constructible::value>()\ +) +#endif // TEST_VALUE_HPP + + From d01d0c4eb81437b4e6040aa155781f33edb14b86 Mon Sep 17 00:00:00 2001 From: pabristow Date: Fri, 13 Oct 2017 09:43:39 +0100 Subject: [PATCH 17/71] Working version with C array of precomputed lookup tables, but still inline inside --- doc/sf/lambert_w.qbk | 4 + .../math/special_functions/lambert_w.hpp | 261 ++++++++++++------ test/test_lambert_w.cpp | 66 ++--- 3 files changed, 210 insertions(+), 121 deletions(-) diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index bf4824bf1..4d262d04f 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -272,6 +272,10 @@ they do not get as close as is often possible with further refinement, usually t For types more precise than `double`, Fukushima shows that it is best to use the `double` estimate as a starting point followed by refinement using __halley iterations or other methods. +For this reason, the lookup tables and `bisection` are only carried out at low precision, +usually `double`, chosen by the `typedef double lookup_t`. Unlike the FORTRAN version, +the lookup tables of Lambert_W of integral values are precomputed as C++ static arrays. + For the less well-behaved regions for ['z] arguments near zero and near the branch singularity at -1/e, some series functions are provided. diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 085c9ca2b..cdfbdde70 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -18,7 +18,6 @@ Some macros that will show some (or much) diagnostic values if #defined. #define-able macros BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES -BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // lambert_w_singularity_series BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. @@ -42,7 +41,6 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of #include #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include -//#include #include #include // for log (1 + x) #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. @@ -51,29 +49,72 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of #include // series functor. #include // polynomial. #include // evaluate_polynomial. -// http://www.boost.org/doc/libs/1_64_0/libs/math/doc/html/math_toolkit/roots/rational.html #include #include -//#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. -#include "J:\Cpp\Misc\lambert_w_pb_spot_tests\test_value.hpp" // Temporary kludge. - #include #include #include #include -//for testing +// Needed for testing and diagnostics only. #include #include -#include // for float_distance +#include // For float_distance. +//#include // For create_test_value and macro BOOST_MATH_TEST_VALUE. + namespace boost { namespace math { -namespace detail -{ + namespace detail + { + namespace lambert_w_lookup + { + + typedef double lookup_t; // Type for lookup table (double or float?) + + BOOST_STATIC_CONSTEXPR std::size_t noof_wm1s = 66; + BOOST_STATIC_CONSTEXPR lookup_t e[noof_wm1s] = // lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 + { + 2.7182818284590452, 1., 0.36787944117144232, 0.13533528323661269, 0.049787068367863943, 0.01831563888873418, 0.0067379469990854671, + 0.0024787521766663584, 0.00091188196555451621, 0.00033546262790251184, 0.00012340980408667955, 4.5399929762484852e-05, 1.6701700790245659e-05, + 6.1442123533282098e-06, 2.2603294069810543e-06, 8.3152871910356788e-07, 3.0590232050182579e-07, 1.1253517471925911e-07, 4.1399377187851667e-08, + 1.5229979744712628e-08, 5.6027964375372675e-09, 2.0611536224385578e-09, 7.5825604279119067e-10, 2.7894680928689248e-10, 1.026187963170189e-10, + 3.7751345442790977e-11, 1.3887943864964021e-11, 5.1090890280633247e-12, 1.8795288165390833e-12, 6.914400106940203e-13, 2.5436656473769229e-13, + 9.3576229688401746e-14, 3.4424771084699765e-14, 1.2664165549094176e-14, 4.6588861451033974e-15, 1.713908431542013e-15, 6.3051167601469894e-16, + 2.3195228302435694e-16, 8.5330476257440658e-17, 3.1391327920480296e-17, 1.1548224173015786e-17, 4.248354255291589e-18, 1.5628821893349888e-18, + 5.7495222642935598e-19, 2.1151310375910805e-19, 7.7811322411337965e-20, 2.8625185805493936e-20, 1.0530617357553812e-20, 3.8739976286871871e-21, + 1.4251640827409351e-21, 5.2428856633634639e-22, 1.9287498479639178e-22, 7.0954741622847041e-23, 2.6102790696677048e-23, 9.602680054508676e-24, + 3.532628572200807e-24, 1.2995814250075031e-24, 4.7808928838854691e-25, 1.7587922024243116e-25, 6.4702349256454603e-26, 2.3802664086944006e-26, + 8.7565107626965203e-27, 3.2213402859925161e-27, 1.185064864233981e-27, 4.359610000063081e-28, 1.6038108905486378e-28 + }; + + BOOST_STATIC_CONSTEXPR size_t noof_w0s = 65; + BOOST_STATIC_CONSTEXPR lookup_t g[noof_w0s] = // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. + { 0., 2.7182818284590452, 14.7781121978613, 60.256610769563003, 218.39260013257696, 742.06579551288302, 2420.5727609564107, 7676.4321089992102, + 23847.663896333826, 72927.755348178456, 220264.65794806717, 658615.558867176, 1953057.4970280471, 5751374.0961159665, 16836459.978306875, 49035260.58708166, + 142177768.32812596, 410634196.81078007, 1181879444.4719492, 3391163718.300558, 9703303908.1958056, 27695130424.147509, 78868082614.895014, 224130479263.72476, + 635738931116.24334, 1800122483434.6468, 5088969845149.8079, 14365302496248.563, 40495197800161.305, 114008694617177.22, 320594237445733.86, + 900514339622670.18, 2526814725845782.2, 7083238132935230.1, 19837699245933466., 55510470830970076., 1.5520433569614703e+17, 4.3360826779369662e+17, + 1.2105254067703227e+18, 3.3771426165357561e+18, 9.4154106734807994e+18, 2.6233583234732253e+19, 7.3049547543861044e+19, 2.032970971338619e+20, + 5.6547040503180956e+20, 1.5720421975868293e+21, 4.3682149334771265e+21, 1.2132170565093317e+22, 3.3680332378068632e+22, 9.3459982052259885e+22, + 2.5923527642935362e+23, 7.1876803203773879e+23, 1.99212416037262e+24, 5.5192924995054165e+24, 1.5286067837683347e+25, 4.2321318958281094e+25, + 1.1713293177672778e+26, 3.2408603996214814e+26, 8.9641258264226028e+26, 2.4787141382364034e+27, 6.8520443388941057e+27, 1.8936217407781711e+28, + 5.2317811346197018e+28, 1.4450833904658542e+29, 3.9904954117194348e+29 + }; + + BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = 12; + BOOST_STATIC_CONSTEXPR lookup_t a[noof_sqrts] = // 0.6065 0.7788, 0.8824 ... 0.9997, sqrt of previous elements. + { + 0.60653065971263342, 0.77880078307140487, 0.8824969025845954, 0.93941306281347579, 0.96923323447634408, 0.98449643700540841, + 0.99221793826024351, 0.99610136947011749, 0.99804878110747547, 0.99902391418197566, 0.99951183793988937, 0.99975588917489722 + }; + BOOST_STATIC_CONSTEXPR lookup_t b[noof_sqrts] = // 0.5 0.25 0.125, 0.0625 ... 0.0002441, halves of previous elements. + { 0.5, 0.25, 0.125, 0.0625, 0.03125, 0.015625, 0.0078125, 0.00390625, 0.001953125, 0.0009765625, 0.00048828125, 0.000244140625 }; + } // namespace Lambert_w_lookup + //! Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944. // Some integer constants overflow so use largest size available. // Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]] @@ -665,13 +706,14 @@ namespace detail // Halley refinement, if required, for precision in policy. // Only perform this if the most precise value possible (usually within one epsilon) is desired. // The previous Fukushima Schroeder refinement usually gives within several epsilon. - // Halley refinement need to perform some evaluations of the exp function, and + // Halley refinement needs to perform some evaluations of the exp function, and // may nearly double the execution time. - // However Boost.Math prioritizes accuracy over speed, so this extra step is done by the default policy. + // However Boost.Math prioritizes accuracy over speed, + // so this extra step is taken by the default policy. - // Two version, do_while always makes one interation before testing, - // whereas while_do does a test first, - // perhaps avoiding an iteration if already within tolerance. + // Two versions: + // do_while always makes one iteration before testing against a tolerance, + // while_do does a test first, perhaps avoiding an iteration if already within tolerance. template inline @@ -689,11 +731,9 @@ namespace detail using boost::math::constants::exp_minus_one; // 0.36787944 using boost::math::tools::max_value; - // T tolerance = std::numeric_limits::epsilon(); - // - T tolerance = boost::math::policies::get_epsilon(); + T tolerance = boost::math::policies::get_epsilon(); -// TODO should get_precision here. + // TODO should get_precision here. int iterations = 0; int iterations_required = 6; int max_iterations = 10; @@ -832,7 +872,8 @@ if (diff == 0) // Exact result - common. } while ( (iterations < min_iterations) || // do minimum iterations. - (iterations >= max_iterations) // Absolute max limit during testing - looping if need this. + (iterations >= max_iterations) // Absolute max limit during testing + // (unexpected looping if need this). ); return w1; // @@ -847,7 +888,7 @@ if (diff == 0) // Exact result - common. //! \param y bracketing value from bisection. //! \returns Refined estimate of Lambert w. - // Schroeder refinement, called if required by precision policy. + // Schroeder refinement, called unless not required by precision policy. template inline T schroeder_update(const T w, const T y) @@ -887,13 +928,15 @@ if (diff == 0) // Exact result - common. template inline void print_collection(const T& coll, std::string name, std::string sep) { + std::streamsize precision = std::cout.precision(); + std::cout.precision(std::numeric_limits::max_digits10); std::cout << name << ": "; for (auto it = std::begin(coll); it != std::end(coll); ++it) { std::cout << *(it) << sep; } - + std::cout.precision(precision); // Restore. std::cout << std::endl; } // print_collection @@ -917,12 +960,35 @@ if (diff == 0) // Exact result - common. std::cout << "Argument Type = " << typeid(T).name() << ", max_digits10 = " << std::numeric_limits::max_digits10 << std::setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() << std::endl; - std::cout.precision(saved_precision); + std::cout.precision(saved_precision); // Restore precision. } #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 // Test for edge and corner cases first, + if (boost::math::isnan(z)) + { + const char* function = "boost::math::lambert_w0()"; + return policies::raise_domain_error(function, + "Argument z is NaN!", + z, pol); + } + if (boost::math::isinf(z)) + { + const char* function = "boost::math::lambert_w0()"; + return policies::raise_domain_error(function, + "Argument z is infinite!", + z, pol); + } + if (z > (std::numeric_limits::max)()/4) + { // TODO not sure this is right - what is largest possible for which can compute Lambert_w? + const char* function = "boost::math::lambert_w0()"; + return policies::raise_domain_error(function, + "Argument z %1% is too big!", + z, pol); + // Or could we return a suitable large value, computed from RealType T? + } + BOOST_MATH_STD_USING // Aid argument dependent lookup of abs. if (abs(z) <= static_cast(0.05)) { // z is near zero, so use near-zero series expansion. @@ -935,16 +1001,17 @@ if (diff == 0) // Exact result - common. } else if (z == -boost::math::constants::exp_minus_one()) { // At singularity, so return exactly minus one. - std::cout << "At singularity. " << std::endl; // within epsilon/0.36 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES + std::cout << "At singularity. " << std::endl; // within epsilon of branch singularity 0.36. +#endif return static_cast(-1); } - else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch (should using W1 branch. + else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch (should using W1 branch instead). { const char* function = "boost::math::lambert_w0()"; return policies::raise_domain_error(function, - "Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).", + "Argument z = %1% out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).", z, pol); - // TODO doesn't show value of z?? have error handling.hpp } else if (z < static_cast(-0.35)) { // Near singularity/branch point at z = -0.36787944... @@ -972,56 +1039,80 @@ if (diff == 0) // Exact result - common. { /////////////////////////////////////////////////////////// - // TODO take this table out as a templated function, to avoid multithread init problems. + // TODO take this table out as a templated function, + // to avoid potential multithreading initialization problems. // (Would like to avoid initializing table of static data? // but cannot avoid - always computed at load time). + // This data is not used if z is small or z < -0.35 near branch point, + // so this code is good at avoiding unnecessary initialisation. // See Fukushima section 2.2, page 81. - // Defining Lambert W function values of integral arguments used for bisection. - // e and g have space for 64 bit reals. - static T e[66]; // lambert_w[k] for W-1 branch. 2.718 1 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 - static T g[65]; // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29 + // Defining integral parts of Lambert W function values to be used for bisection. + // e and g have space for 64-bit reals. + + /* + static const size_t noof_wm1s = 66; + static T e[noof_wm1s]; // lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 + static const size_t noof_w0s = 65; + static T g[noof_w0s]; // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. + // lambert_w0(2.77182) == 1.; + // lambert_w0(14.7700) == 2.; + // lambert_w0(2.77182) == 3.; + // ... + // lambert_w0(3.990e+29) == 64. + // 3.990e+29 == g[64]; + // Defining lookup table sqrts of 1/e. - static T a[12]; // 0.6065 0.7788 ... 0.9997, sqrt of previous elements. - static T b[12]; // 0.5 0.25 0.125 ... 0.0002441, Half of previous element. + static const size_t noof_sqrts = 12; + static T a[noof_sqrts]; // 0.6065 0.7788, 0.8824 ... 0.9997, sqrt of previous elements. + static T b[noof_sqrts]; // 0.5 0.25 0.125, 0.0625 ... 0.0002441, halves of previous elements. if (!e[0]) - { // Fill static data on first use. (But may never be used?) - // Fukushima calls array f[k] = ke^k (0 <= k <= 64 - // and g[k] -ke^-k (1 <= k <= 64 for g) + { // Fill static data on first use. + // Fukushima calls array F[k] = ke^k (0 <= k <= 64 for f) + // and G[k] -ke^-k (1 <= k <= 64 for g) T ej = 1; // F[k] for W-1 branch. - e[0] = boost::math::constants::e(); + e[0] = boost::math::constants::e(); // e = 2.7182 e[1] = 1; - - g[0] = 0;// F[k] for W0 branch. - for (int j = 1, jj = 2; jj < 66; ++jj) + g[0] = 0; // G[k] for W0 branch. + for (int j = 1, jj = 2; jj != noof_wm1s; ++jj) { - ej *= boost::math::constants::e(); - e[jj] = e[j] * boost::math::constants::exp_minus_one(); // exp(-1) - 1/e exp_minus_one 0.36787944. - g[j] = j * ej; + e[jj] = e[j] * boost::math::constants::exp_minus_one(); // For W-1 branch. + // exp(-1) - 1/e exp_minus_one = 0.36787944. + ej *= boost::math::constants::e(); // 2.7182 + g[j] = j * ej; // For W0 branch. j = jj; - } + } // for + // a[0] = sqrt(e1); // TODO compile time constant sqrt(1/e) - add to math constants, and add to documentation too. + // This would be slightly more accurate - conversion from long double could lose precision, + // but might not matter if using Schroeder and/or Halley? + // a[0] = boost::math::constants::sqrt_one_div_e(); a[0] = static_cast(0.606530659712633423603799534991180453441918135487186955682L); - b[0] = static_cast(0.5); - for (int j = 0, jj = 1; jj < 12; ++jj) + b[0] = static_cast(0.5); // Exactly representable. + for (int j = 0, jj = 1; jj != noof_sqrts; ++jj) { a[jj] = sqrt(a[j]); // Sqrt of previous element. sqrt(1/e),sqrt(sqrt(1/e)) ... // b[jj] = b[j] * static_cast(0.5); // Half previous element. b[jj] = b[j] / 2; // Half previous element (/2 will be optimised better?). - j = jj; } - //print_collection(e, "e", " "); - // 2.71828175 1 0.36787945 0.135335296 0.0497870743 0.0183156412 0.00673794793 ... 1.60381359e-28 - //print_collection(g, "g", " "); - //print_collection(a, "a", " "); - //print_collection(b, "b", " "); + print_collection(e, "e", " "); // 2.71828175 1 0.36787945 0.135335296 0.0497870743 0.0183156412 0.00673794793 ... 1.60381359e-28 + print_collection(g, "g", " "); + print_collection(a, "a", " "); + print_collection(b, "b", " "); + // Values saved as Fukushima bisection static arrays.txt // These might be stored as constants in data? + //e: 2.71828 1 0.367879 0.135335 0.0497871 0.0183156 0.00673795 0.00247875 0.000911882 0.000335463 0.00012341 4.53999e-05 1.67017e-05 6.14421e-06 2.26033e-06 8.31529e-07 3.05902e-07 1.12535e-07 4.13994e-08 1.523e-08 5.6028e-09 2.06115e-09 7.58256e-10 2.78947e-10 1.02619e-10 3.77514e-11 1.3888e-11 5.10909e-12 1.87953e-12 6.91441e-13 2.54367e-13 9.35763e-14 3.44248e-14 1.26642e-14 4.65889e-15 1.71391e-15 6.30512e-16 2.31952e-16 8.53305e-17 3.13914e-17 1.15482e-17 4.24836e-18 1.56288e-18 5.74953e-19 2.11513e-19 7.78114e-20 2.86252e-20 1.05306e-20 3.874e-21 1.42517e-21 5.24289e-22 1.92875e-22 7.09548e-23 2.61028e-23 9.60269e-24 3.53263e-24 1.29958e-24 4.7809e-25 1.75879e-25 6.47024e-26 2.38027e-26 8.75652e-27 3.22135e-27 1.18507e-27 4.35962e-28 1.60381e-28 + //g : 0 2.71828 14.7781 60.2566 218.393 742.066 2420.57 7676.43 23847.7 72927.7 220265 658615 1.95306e+06 5.75137e+06 1.68365e+07 4.90352e+07 1.42178e+08 4.10634e+08 1.18188e+09 3.39116e+09 9.7033e+09 2.76951e+10 7.8868e+10 2.2413e+11 6.35738e+11 1.80012e+12 5.08897e+12 1.43653e+13 4.04952e+13 1.14009e+14 3.20594e+14 9.00514e+14 2.52681e+15 7.08323e+15 1.98377e+16 5.55104e+16 1.55204e+17 4.33608e+17 1.21052e+18 3.37714e+18 9.4154e+18 2.62336e+19 7.30495e+19 2.03297e+20 5.6547e+20 1.57204e+21 4.36821e+21 1.21322e+22 3.36803e+22 9.34599e+22 2.59235e+23 7.18767e+23 1.99212e+24 5.51929e+24 1.5286e+25 4.23213e+25 1.17133e+26 3.24086e+26 8.96411e+26 2.47871e+27 6.85203e+27 1.89362e+28 5.23177e+28 1.44508e+29 3.99049e+29 + //a : 0.606531 0.778801 0.882497 0.939413 0.969233 0.984496 0.992218 0.996101 0.998049 0.999024 0.999512 0.999756 + //b : 0.5 0.25 0.125 0.0625 0.03125 0.015625 0.0078125 0.00390625 0.00195313 0.000976563 0.000488281 0.000244141 + } // if (!e[0]) end of static data fill. + */ /////////////////////////////////////////////////////////////////////////// if (std::numeric_limits::digits > 53) @@ -1049,11 +1140,11 @@ if (diff == 0) // Exact result - common. } // digits > 53 else // T is double or less precision. { - // Use a lookup table to find the nearest integral values as starting point for Bisection. - + // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. + using namespace boost::math::detail::lambert_w_lookup; // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch. // Since z is probably quite small, start with lowest (n = 0). - int n; // Indexing W0 lookup table g of z. + int n; // Indexing W0 lookup table g[n] of z. for (n = 0; n <= 2; ++n) { // Try 1st few. if (g[n] > z) @@ -1064,21 +1155,20 @@ if (diff == 0) // Exact result - common. n = 2; for (int j = 1; j <= 5; ++j) { - n *= 2; // Try big steps. - if (g[n] > z) + n *= 2; // Try bigger steps. + if (g[n] > z) // z <= g[n] { goto overshot; // } } // for - // else z too large :-( - const char* function = "boost::math::lambert_w0()"; - return policies::raise_domain_error(function, - "Argument z = %1 too large.", + // get here if + std::cout << "Too big " << z << std::endl; + //// else z too large :-( + //const char* function = "boost::math::lambert_w0()"; + return policies::raise_domain_error("boost::math::lambert_w0()", + "Argument z = %1% is too large!", z, pol); - // std::cerr << "lambert_w0 argument too large, z = " << z << std::endl; - //return std::numeric_limits::quiet_NaN(); - overshot: { int nh = n / 2; @@ -1097,10 +1187,10 @@ if (diff == 0) // Exact result - common. } bisect: - --n; // g[n] is nearest below, so n is integer value of W, and - // g[n+1] is upper integral value. These are used as initial values for bisection. - + --n; // g[n] is nearest below, so n is integer part of W, + // and g[n+1] is next integral part of W. + // These are used as initial values for bisection. // typedef typename policies::precision::type prec; //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. @@ -1132,27 +1222,29 @@ if (diff == 0) // Exact result - common. int jmax = 8; // Assume minimum number of bisections will be needed (most common case). if (z <= -0.36) { // Very near singularity, so need several more bisections. - jmax = 12; + jmax = noof_sqrts; } else if (z <= -0.3) - { // Near singularity, so need few more bisections. + { // Near singularity, so need a few more bisections. jmax = 11; } else if (n <= 0) - { // Very small z so need 3 more bisections. + { // Very small z, so need 3 more bisections. jmax = 10; } else if (n <= 1) - { // Small z so need just 1 extra bisection. + { // Small z, so need just 1 extra bisection. jmax = 9; } + lookup_t dz = static_cast(z); // Only use double precision for bisection. + // Perform the jmax fractional bisections for necessary precision. - T y = z * e[n + 1]; // - T w = static_cast(n); // Integral Lambert W estimate. + lookup_t y = dz * e[n + 1]; // + lookup_t w = static_cast(n); // Integral Lambert W estimate. for (int j = 0; j < jmax; ++j) { - const T wj = w + b[j]; // Add 1/2, 1/4, 1/8 ... - const T yj = y * a[j]; // sqrt(1/e), ... + const lookup_t wj = w + b[j]; // Add 1/2, 1/4, 1/8 ... + const lookup_t yj = y * a[j]; // Multiply by sqrt(1/e), ... if (wj < yj) { w = wj; @@ -1167,11 +1259,11 @@ if (diff == 0) // Exact result - common. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION std::cout << "Bisection estimate = " << w << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION - return w; // Bisection only. + return static_cast(w); // Bisection only. } else // More than 10 digits2 wanted so continue with Fukushima's Schroeder refinement. { - T result = schroeder_update(w, y); + T result = static_cast(schroeder_update(w, y)); if (d2 <= (std::numeric_limits::digits - 3)) { // Only enough digits2 required, so just return the Schroeder refined value. // For example, for float, if (d2 <= 22) then @@ -1241,11 +1333,12 @@ if (diff == 0) // Exact result - common. // Create static arrays of Lambert W function for Wm1 // with lambert_w values of integers. // Used for bisection of W-1 branch. + static const size_t noof_sqrts = 12; static T e[64]; static T g[64]; - static T a[12]; - static T b[12]; + static T a[noof_sqrts]; + static T b[noof_sqrts]; if (!e[0]) { @@ -1262,7 +1355,7 @@ if (diff == 0) // Exact result - common. } a[0] = sqrt(boost::math::constants::e()); b[0] = static_cast(0.5); - for (int j = 0, jj = 1; jj < 12; ++jj) + for (int j = 0, jj = 1; jj < noof_sqrts; ++jj) { a[jj] = sqrt(a[j]); b[jj] = b[j] * static_cast(0.5); @@ -1311,7 +1404,7 @@ if (diff == 0) // Exact result - common. std::cout << "digits2 = " << d2 << std::endl; // digits = 24 for float. #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1 if (d2 < 5) - { // Only a very few digits2 required, so just return the floor integral value. + { // Only a very few digits2 required, so just return the floor integral part of Lambert_w. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W1 std::cout << "between g[" << n << "] = " << g[n] << " < " << z << " < " << g[n + 1] << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1 @@ -1381,7 +1474,7 @@ if (diff == 0) // Exact result - common. //! W-1 branch (-max(z) < z <= -1/e). - //! Lambert W1 using User-defined policy. + //! Lambert W-1 using User-defined policy. template inline typename tools::promote_args::type @@ -1393,7 +1486,7 @@ if (diff == 0) // Exact result - common. return detail::lambert_wm1_imp(result_type(z), pol); // } - // Lambert W1 using default policy. + //! Lambert W-1 using default policy. template inline typename tools::promote_args::type diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 3909c97ea..a2612b3d2 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -7,12 +7,12 @@ // or copy at http://www.boost.org/LICENSE_1_0.txt) // test_lambertw.cpp -//! \brief Basic sanity tests for Lambert W function plog -//! or lambert_w using algorithm from Thomas Luu, Veberic and Fukushima. +//! \brief Basic sanity tests for Lambert W function plog +//! or lambert_w using algorithm informed by Thomas Luu, Veberic and Fukushima. #include // for real_concept #define BOOST_TEST_MAIN -#define BOOST_LIB_DIAGNOSTIC +#define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. #include // Boost.Test #include @@ -29,6 +29,7 @@ using boost::multiprecision::cpp_dec_float_50; #include "test_value.hpp" // Macro BOOST_MATH_TEST_VALUE for create_test_value. //#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for much Lambert_w diagnostic output. +// See lambert_w.hpp for list of instrumentation macros. #include // For Lambert W lambert_w function. using boost::math::lambert_w0; using boost::math::lambert_wm1; @@ -40,21 +41,6 @@ using boost::math::lambert_wm1; #include #include -static const unsigned int noof_tests = 2; - -static const boost::array test_data = -{{ - "1", - "6" -}}; // array test_data - -//static const boost::array test_expected = -//{ { -// BOOST_MATH_TEST_VALUE(T, 0.56714329040978387299996866221035554975381578718651), // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1) -// BOOST_MATH_TEST_VALUE(T, 1.432404775898300311234078007212058694786434608804302025655) // Output from https://www.wolframalpha.com/input/?i=lambert_w0(6) - -// } }; // array test_data - //! Build a message of information about build, architecture, address model, platform, ... std::string show_versions() { @@ -120,6 +106,7 @@ void test_spots(RealType) using boost::math::constants::exp_minus_one; using boost::math::policies::policy; + /* Example of an exception-free 'ignore_all' policy (possibly ill-advised?). typedef policy < boost::math::policies::domain_error, boost::math::policies::overflow_error, @@ -128,6 +115,7 @@ void test_spots(RealType) boost::math::policies::pole_error, boost::math::policies::evaluation_error > ignore_all_policy; + */ // // Test some bad parameters to the function, with default policy and with ignore_all policy. #ifndef BOOST_NO_EXCEPTIONS @@ -445,27 +433,31 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // << " " << (std::numeric_limits::max)() / 4 // == 4.4942328371557893e+307 // << std::endl; - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double. - static_cast(702.02379914670587), - // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 - // as a double == 701.83341468208209 - // Lambert computed 702.02379914670587 - // std::numeric_limits::epsilon() * 256); - 0.0003); // Much less precise near the max edge. + // All these result in faulty error message + // unknown location : fatal error : in "test_range_of_values": class boost::exception_detail::clone_impl >: Error in function boost::math::lambert_w0(): Argument z = %1 too large. + // I:\modular - boost\libs\math\test\test_lambert_w.cpp(456) : last checkpoint - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/2), // near max_value for IEEE 64-bit double. - static_cast(701.15054872492476914094824907722937), - // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 - // as a double == 701.83341468208209 - // Lambert computed 702.02379914670587 - std::numeric_limits::epsilon()); + //BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/4), // near max_value/4 for IEEE 64-bit double. + // static_cast(700.45838920868939857588606393559517), + // // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 + // // as a double == 701.83341468208209 + // // Lambert computed 702.02379914670587 + // std::numeric_limits::epsilon()); - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/4), // near max_value for IEEE 64-bit double. - static_cast(700.45838920868939857588606393559517), - // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 - // as a double == 701.83341468208209 - // Lambert computed 702.02379914670587 - std::numeric_limits::epsilon()); + //BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/2), // max_value/2 for IEEE 64-bit double. + // static_cast(701.15054872492476914094824907722937), + // // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 + // // as a double == 701.83341468208209 + // // Lambert computed 702.02379914670587 + // std::numeric_limits::epsilon()); + + //BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307), // max_value for IEEE 64-bit double. + // static_cast(702.02379914670587), + // // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 + // // as a double == 701.83341468208209 + // // Lambert computed 702.02379914670587 + // // std::numeric_limits::epsilon() * 256); + // 0.0003); // Much less precise near the max edge. // This test value is one epsilon close to the singularity at -exp(1) * x // (below which the result has a non-zero imaginary part). From f51d987acd21f4635bf8d75373b6bb4c14280577 Mon Sep 17 00:00:00 2001 From: pabristow Date: Fri, 27 Oct 2017 18:18:06 +0100 Subject: [PATCH 18/71] added much on W-1 branch (handling tiny z), and more docs. --- doc/distributions/non_members.qbk | 75 ++-- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 19 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 6 +- doc/html/indexes/s05.html | 37 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- .../changing_policy_defaults.html | 6 +- doc/html/math_toolkit/tuning.html | 12 +- doc/math.qbk | 9 +- doc/sf/lambert_w.qbk | 140 ++++++- .../math/special_functions/lambert_w.hpp | 393 +++++++++++------- test/lambert_w_high_reference_values.cpp | 16 +- test/test_lambert_w.cpp | 186 ++++++++- test/test_lambert_w0_precision_high.cpp | 8 +- test/test_lambert_w0_precision_low.cpp | 5 +- 18 files changed, 677 insertions(+), 245 deletions(-) diff --git a/doc/distributions/non_members.qbk b/doc/distributions/non_members.qbk index 653d24979..8937b3141 100644 --- a/doc/distributions/non_members.qbk +++ b/doc/distributions/non_members.qbk @@ -1,11 +1,11 @@ [section:nmp Non-Member Properties] -Properties that are common to all distributions are accessed via non-member +Properties that are common to all distributions are accessed via non-member getter functions: non-membership allows more of these functions to be added over time, as the need arises. Unfortunately the literature uses many different and confusing names to refer to a rather small number of actual concepts; refer -to the [link math_toolkit.dist_ref.nmp.concept_index concept index] to find the property you -want by the name you are most familiar with. +to the [link math_toolkit.dist_ref.nmp.concept_index concept index] to find the property you +want by the name you are most familiar with. Or use the [link math_toolkit.dist_ref.nmp.function_index function index] to go straight to the function you want if you already know its name. @@ -62,8 +62,8 @@ to go straight to the function you want if you already know its name. template RealType cdf(const ``['Distribution-Type]``& dist, const RealType& x); - -The __cdf is the probability that + +The __cdf is the probability that the variable takes a value less than or equal to x. It is equivalent to the integral from -infinity to x of the __pdf. @@ -79,11 +79,11 @@ normal distribution: template RealType cdf(const ``['Unspecified-Complement-Type]``& comp); - -The complement of the __cdf -is the probability that + +The complement of the __cdf +is the probability that the variable takes a value greater than x. It is equivalent -to the integral from x to infinity of the __pdf, or 1 minus the __cdf of x. +to the integral from x to infinity of the __pdf, or 1 minus the __cdf of x. This is also known as the survival function. @@ -118,7 +118,7 @@ the defined range for the distribution. [equation hazard] [caution -Some authors refer to this as the conditional failure +Some authors refer to this as the conditional failure density function rather than the hazard function.] [h4:chf Cumulative Hazard Function] @@ -133,14 +133,14 @@ the defined range for the distribution. [equation chf] -[caution +[caution Some authors refer to this as simply the "Hazard Function".] [h4:mean mean] template RealType mean(const ``['Distribution-Type]``& dist); - + Returns the mean of the distribution /dist/. This function may return a __domain_error if the distribution does not have @@ -150,14 +150,14 @@ a defined mean (for example the Cauchy distribution). template RealType median(const ``['Distribution-Type]``& dist); - + Returns the median of the distribution /dist/. [h4:mode mode] template RealType mode(const ``['Distribution-Type]``& dist); - + Returns the mode of the distribution /dist/. This function may return a __domain_error if the distribution does not have @@ -167,14 +167,14 @@ a defined mode. template RealType pdf(const ``['Distribution-Type]``& dist, const RealType& x); - -For a continuous function, the probability density function (pdf) returns -the probability that the variate has the value x. -Since for continuous distributions the probability at a single point is actually zero, + +For a continuous function, the probability density function (pdf) returns +the probability that the variate has the value x. +Since for continuous distributions the probability at a single point is actually zero, the probability is better expressed as the integral of the pdf between two points: see the __cdf. -For a discrete distribution, the pdf is the probability that the +For a discrete distribution, the pdf is the probability that the variate takes the value x. This function may return a __domain_error if the random variable is outside @@ -188,14 +188,14 @@ For example, for a standard normal distribution the pdf looks like this: template std::pair range(const ``['Distribution-Type]``& dist); - + Returns the valid range of the random variable over distribution /dist/. [h4:quantile Quantile] template RealType quantile(const ``['Distribution-Type]``& dist, const RealType& p); - + The quantile is best viewed as the inverse of the __cdf, it returns a value /x/ such that `cdf(dist, x) == p`. @@ -217,7 +217,7 @@ See also [link math_toolkit.stat_tut.overview.complements complements]. template RealType quantile(const ``['Unspecified-Complement-Type]``& comp); - + This is the inverse of the __ccdf. It is calculated by wrapping the arguments in a call to the quantile function in a call to /complement/. For example: @@ -250,8 +250,8 @@ distribution: template RealType standard_deviation(const ``['Distribution-Type]``& dist); - -Returns the standard deviation of distribution /dist/. + +Returns the standard deviation of distribution /dist/. This function may return a __domain_error if the distribution does not have a defined standard deviation. @@ -260,7 +260,7 @@ a defined standard deviation. template std::pair support(const ``['Distribution-Type]``& dist); - + Returns the supported range of random variable over the distribution /dist/. The distribution is said to be 'supported' over a range that is @@ -274,7 +274,7 @@ Outside are uninteresting zones where the pdf is zero, and the cdf zero or unity template RealType variance(const ``['Distribution-Type]``& dist); - + Returns the variance of the distribution /dist/. This function may return a __domain_error if the distribution does not have @@ -284,7 +284,7 @@ a defined variance. template RealType skewness(const ``['Distribution-Type]``& dist); - + Returns the skewness of the distribution /dist/. This function may return a __domain_error if the distribution does not have @@ -294,7 +294,7 @@ a defined skewness. template RealType kurtosis(const ``['Distribution-Type]``& dist); - + Returns the 'proper' kurtosis (normalized fourth moment) of the distribution /dist/. kertosis = [beta][sub 2][space]= [mu][sub 4][space] / [mu][sub 2][super 2] @@ -326,7 +326,7 @@ a defined kurtosis. template RealType kurtosis_excess(const ``['Distribution-Type]``& dist); - + Returns the kurtosis excess of the distribution /dist/. kurtosis excess = [gamma][sub 2][space]= [mu][sub 4][space] / [mu][sub 2][super 2][space]- 3 = kurtosis - 3 @@ -334,7 +334,7 @@ kurtosis excess = [gamma][sub 2][space]= [mu][sub 4][space] / [mu][sub 2][super Where [mu][sub i][space] is the i'th central moment of the distribution, and in particular [mu][sub 2][space] is the variance of the distribution. -The kurtosis excess is a measure of the "peakedness" of a distribution, and +The kurtosis excess is a measure of the "peakedness" of a distribution, and is more widely used than the "kurtosis proper". It is defined so that the kurtosis excess of a normal distribution is zero. @@ -344,7 +344,7 @@ a defined kurtosis excess. Kurtosis excess can have a value from -2 to + infinity. kurtosis = kurtosis_excess +3; - + The kurtosis excess of a normal distribution is zero. [h4:cdfPQ P and Q] @@ -361,12 +361,12 @@ the __quantile. [h4:cdf_inv Inverse CDF Function.] -The inverse of the cumulative distribution function, is the same as the +The inverse of the cumulative distribution function, is the same as the __quantile. [h4:survival_inv Inverse Survival Function.] -The inverse of the survival function, is the same as computing the +The inverse of the survival function, is the same as computing the [link math_toolkit.dist_ref.nmp.quantile_c quantile from the complement of the probability]. @@ -380,13 +380,13 @@ while the term __pdf applies to continuous distributions. [h4:lower_critical Lower Critical Value.] The lower critical value calculates the value of the random variable -given the area under the left tail of the distribution. +given the area under the left tail of the distribution. It is equivalent to calculating the __quantile. -[h4: upper_critical Upper Critical Value.] +[h4:upper_critical Upper Critical Value.] The upper critical value calculates the value of the random variable -given the area under the right tail of the distribution. It is equivalent to +given the area under the right tail of the distribution. It is equivalent to calculating the [link math_toolkit.dist_ref.nmp.quantile_c quantile from the complement of the probability]. @@ -394,8 +394,7 @@ probability]. Refer to the __ccdf. -[endsect][/section:nmp Non-Member Properties] - +[endsect] [/section:nmp Non-Member Properties] [/ non_members.qbk Copyright 2006 John Maddock and Paul A. Bristow. diff --git a/doc/html/index.html b/doc/html/index.html index ab4cb0b7d..a02e24638 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: October 10, 2017 at 14:01:12 GMT

        Last revised: October 27, 2017 at 17:06:21 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index bb0d7a41a..e3e6e8fa5 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -307,6 +307,10 @@
      • +

        bisection

        +
        +
        • +

      • bool

        • @@ -1556,6 +1560,7 @@

      • Additional Implementation Notes

      • Error Handling Example

      • Examples Where Root Finding Goes Wrong

        • +

      • Lambert W function

      • Students t Distribution

        • @@ -1888,6 +1893,13 @@
      • +

        ln

        +
        +
        • +

      • location

      • +

        point

        +
        +
        • +

      • polar

        • @@ -2631,6 +2647,7 @@

      • Bessel Functions of the First and Second Kinds

      • expm1

      • Inverse Chi-Squared Distribution Bayes Example

        • +

      • Lambert W function

      • Modified Bessel Functions of the First and Second Kinds

      • The Incomplete Beta Function Inverses

        • diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index d3fa7c973..8c8d8c8b4 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 90073b6f9..6840371fc 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 1b76863d8..b09c7a093 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        @@ -298,6 +298,10 @@
      • +

        BOOST_MATH_TEST_VALUE

        +
        +
        • +

      • BOOST_MATH_UNDERFLOW_ERROR_POLICY

        • diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index b84430d40..3704c87cf 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -669,6 +669,10 @@
      • +

        bisection

        +
        +
        • +

      • bool

        • @@ -971,6 +975,10 @@
      • +

        BOOST_MATH_TEST_VALUE

        +
        +
        • +

      • BOOST_MATH_UNDERFLOW_ERROR_POLICY

        • @@ -1444,6 +1452,10 @@
      • +

        Calculation of the Type of the Result

        +
        +
        • +

      • called

        • @@ -4432,6 +4444,7 @@

      • Additional Implementation Notes

      • Error Handling Example

      • Examples Where Root Finding Goes Wrong

        • +

      • Lambert W function

      • Students t Distribution

        • @@ -4814,15 +4827,20 @@

      • accuracy

      • al

      • alpha

        • +

      • bisection

        • +

      • BOOST_MATH_TEST_VALUE

      • branch

      • constants

      • expression

      • float

        • +

      • infinity

      • interval

      • lambert_w0

      • lambert_wm1

        • +

      • ln

      • range

      • refinement

        • +

      • small

      • W

        • @@ -5034,6 +5052,13 @@
      • +

        ln

        +
        +
        • +

      • Locating Function Minima using Brent's algorithm

        • accuracy

          • @@ -5249,7 +5274,10 @@

        • Mathematical Constants

          -
          +

        • Mathematically Undefined Function Policies

          @@ -5901,6 +5929,10 @@
      • +

        point

        +
        +
        • +

      • poisson

        • @@ -6698,6 +6730,7 @@

      • Bessel Functions of the First and Second Kinds

      • expm1

      • Inverse Chi-Squared Distribution Bayes Example

        • +

      • Lambert W function

      • Modified Bessel Functions of the First and Second Kinds

      • The Incomplete Beta Function Inverses

        • diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index b63b41239..da31c6f67 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index fa6234915..9ecf45760 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html b/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html index 5c290f413..508491501 100644 --- a/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html +++ b/doc/html/math_toolkit/pol_tutorial/changing_policy_defaults.html @@ -55,9 +55,9 @@ 

        #define BOOST_MATH_ASSERT_UNDEFINED_POLICY false
 #define BOOST_MATH_OVERFLOW_ERROR_POLICY errno_on_error
        -

        - may be ignored. -

        +
        • + may be ignored*. +

        The compiler command line shows:

        diff --git a/doc/html/math_toolkit/tuning.html b/doc/html/math_toolkit/tuning.html index 51f8ab00f..36c3c1aae 100644 --- a/doc/html/math_toolkit/tuning.html +++ b/doc/html/math_toolkit/tuning.html @@ -109,15 +109,15 @@ be stored as tables of floating point values instead. If mixed arithmetic is slow then add:

        -

        - #define BOOST_MATH_INT_TABLE_TYPE(RT, IT) RT -

        +
        1. + define BOOST_MATH_INT_TABLE_TYPE(RT, IT) RT +

        to boost/math/tools/user.hpp, otherwise the default of:

        -

        - #define BOOST_MATH_INT_TABLE_TYPE(RT, IT) IT -

        +
        1. + define BOOST_MATH_INT_TABLE_TYPE(RT, IT) IT +

        Set in boost/math/config.hpp is fine, and may well result in smaller code. diff --git a/doc/math.qbk b/doc/math.qbk index 4db9e2c34..9165e08cb 100644 --- a/doc/math.qbk +++ b/doc/math.qbk @@ -1,5 +1,5 @@ [book Math Toolkit - [quickbook 1.6] + [quickbook 1.7] [copyright 2006, 2007, 2008, 2009, 2010, 2012, 2013, 2014, 2017 Nikhar Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan RÃ¥de, Gautam Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, Daryle Walker and Xiaogang Zhang] [/purpose ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22] [license @@ -219,8 +219,11 @@ and use the function's name as the link text.] [/Lambert W function] [def __lambert_w [link math_toolkit.sf_lambert_w.lambert_w_function lambert_w]] [def __lambert_w_implementation [link math_toolkit.lambert_w.implementation implementation]] -[def __lambert_w_implementation [link math_toolkit.lambert_w.precision precision]] -[def __lambert_w_implementation [link math_toolkit.lambert_w.examples examples]] +[def __lambert_w_precision[link math_toolkit.lambert_w.precision precision]] +[def __lambert_w_examples [link math_toolkit.lambert_w.examples examples]] +[def __lambert_w_wm1_near_zero [link math_toolkit.lambert_w.wm1_near_zero wm1_near_zero]] + + [/Airy Functions] [def __airy_ai [link math_toolkit.airy.ai airy_ai]] diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 4d262d04f..306cba4a4 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -85,7 +85,6 @@ and to control what action to take on errors: [tip Always use [^try'n'catch] blocks to ensure you get an error message like this:] - [lambert_w_simple_examples_error_message_1] [lambert_w_simple_examples_out_of_range] @@ -189,6 +188,37 @@ or defined in a jamfile.v2: `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show result of estimates where small z is near zero. `` +[h4:edge_cases Edge and Corner cases] + +[h5:w0_edges w0 Branch] + +[h5:wm1_edges w-1 Branch] + +The range mathematically is -exp(-1) <= z <=0, but numerically, + +* `z == -exp(-1)` (for the type T) returns exactly -1. +* `z == 0` returns infinity (or the nearest equivalent if `std::has_infinity == false`). +* `z == std::numeric_limits::min()` returns the maximum possible value of Lambert W for the type T.[br] +For example, for `double`: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634[br] +and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 + +* `z < std::numeric_limits::min()`, means that z is denormalized (if `std::numeric_limits::has_denorm_min == true`), +for example: + + r = lambert_wm1(std::numeric_limits::denorm_min()); + +and will give a message like: + + Error in function boost::math::lambert_wm1(): + Argument z = -4.9406564584124654e-324 is too small + (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch! + +Denormalized values of z are not supported (because not all floating-point types denormalize), +and anyway it only covers a tiny fraction of the range of possible z arguments values. + + + + [h4:implemention Implementation] There are many previous implementations with increasing accuracy and speed. See references below. @@ -253,8 +283,8 @@ avoiding any transcendental function calls as these are necessarily expensive. The current implementation is based on his algorithm starting with a translation from FORTRAN into C++ by Darko Veberic. -Many applications of the Lambert W function make many repeated evaluations for Monte Carlo methods, -for which applications speed is important. +Many applications of the Lambert W function make many repeated evaluations for Monte Carlo methods; +for these applications speed is very important. Luu and Chapeau-Blondeau and Monir provide typical usage examples. Fukushima makes the important observation that much of the execution time of all @@ -274,15 +304,27 @@ as a starting point followed by refinement using __halley iterations or other me For this reason, the lookup tables and `bisection` are only carried out at low precision, usually `double`, chosen by the `typedef double lookup_t`. Unlike the FORTRAN version, -the lookup tables of Lambert_W of integral values are precomputed as C++ static arrays. +the lookup tables of Lambert_W of integral values are precomputed as C++ static arrays of floating-point literals. +The default is a `typedef` setting the type to `double`. +To allow users to vary the precision from `float` to `long double` these are computed to +128-bit precision to ensure that even platforms with `long double` do not lose precision. -For the less well-behaved regions for ['z] arguments near zero and near the branch singularity at -1/e, -some series functions are provided. +The FORTRAN version and translation only permits the z argument to be the largest +items in these lookup arrays, `wm0s[64] = 3.99049`, producing an error message and returning `NaN`. +So 64 is the largest possible value returned from the `lambert_w0` function. +This is far from the `std::numeric_limits<>::max()` for even `float`s. + +For the less well-behaved regions for Lambert W0 ['z] arguments near zero, +and near the branch singularity at -1/e, some series functions are provided. + +For Lambert W-1 branch, tiny values very near zero where W > 64 cannot be computed using the lookup table. +For this region, an approximation followed by a few (usually 3) Halley refinements. +See __lambert_w_wm1_near_zero. So, as usual, there are compromises to consider between execution speed and accuracy. This implementation allows users to get closer than Fukushima, at some small loss of speed (but does not guarantee the nearest representable result) -or to get faster but less precise evalations controlled by __policies. +or to get faster but less precise evalutions controlled by __precision_policy. [h4:small_z Small values of argument z near zero] @@ -297,7 +339,7 @@ computed using Wolfram with InverseSeries[Series[z Exp[z],{z,0,17}]] -See Tosio Fukushima, Journal of Computational and Applied Mathematics 244 (2013) page 86. +See Tosio Fukushima, Journal of Computational and Applied Mathematics 244 (2013), page 86. To provide higher precision constants (34 decimal digits) for types larger than `long double`, @@ -350,18 +392,18 @@ which are near to the singularity at `z = -exp(-1) = -3.6787944` where the branc T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3 described using Wolfram -InverseSeries\[Series\[sqrt\[2(p Exp\[1 + p\] + 1)\], {p,-1, 20}\]\] + InverseSeries\[Series\[sqrt\[2(p Exp\[1 + p\] + 1)\], {p,-1, 20}\]\] to provide Table 3. This implementation used Wolfram to obtain 40 series terms at 50 decimal digit precision - +`` N\[InverseSeries\[Series\[Sqrt\[2(p Exp\[1 + p\] + 1)\], { p,-1,40 }\]\], 50\] -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ... - -These constants are computed at compile time for the full precision for any RealType T -using original rationals from Table 3. +`` +These constants are computed at compile time for the full precision for any `RealType T` +using the original rationals from Fukushima Table 3. Longer decimal digits strings are rationals pre-evaluated using Wolfram. Some integer constants overflow, so use largest size available, suffixed by `uLL`. @@ -379,7 +421,74 @@ only provides the precision of the built-in type, like `double`, only 17 decimal [tip Be exceeding careful not to silently lose precision by constructing multiprecision types from literal decimal types, usually [^double].] -Fukushima used 20 series terms and it was confirmed that using more terms does not usefully increase accuracy. +Fukushima implmentation used 20 series terms and it was confirmed that using more terms does not usefully increase accuracy. + +[h5:wm1_near_zero Lambert W-1 arguments values very near zero.] + +The lookup tables of Fukushima have only 64 elements, so that the z argument nearest zero is -1.0264389699511303e-26, +that corresponds to a maximum Lambert W-1 value of 64.0. +His implementation did not cater for z argument values that are smaller (nearer to zero), +but this implementation adds code to accept smaller (but not denormalised) values of z. +A crude approximation for these very small values is to take the exponent and multiply by ln[10] ~= 2.3. +We also tried the approximation first proposed by Corless et al. using ln(-z), and then tried improving by a 2nd term -ln(ln(-z)), +and finally the ratio term -ln(ln(-z))/ln(-z). + +For a z very close to z = -1.0264389699511303e-26 when W = 64, when effect of ln(ln(-z) term, and ratio L1/L2 is greatest, +the possible 'guessed' are + + z = -1.e-26, w = -64.02, guess = -64.0277, ln(-z) = -59.8672, ln(-ln(-z) = 4.0921, llz/lz = -0.0684 + +whereas at the minimum (unnormalized) z + +z = -2.2250e-308, w = -714.9, guess = -714.9687, ln(-z) = -708.3964, ln(-ln(-z) = 6.5630, llz/lz = -0.0092 + +Although the addition of the 3rd ratio term did not reduce the number of Halley iterations needed, +it allows return of a better low precision estimate [*without any Halley iterations] using the __precision_policy. +For the worst case near w = 64, the error in the 'guess' is 0.008, ratio 0.0001 or 1 in 10,000 digits 10 ~= 4, +so we opt to skip Halley iterations and return the 'guess' if digits2 < 12. +Two log evalutations are still needed, but is probably over an order of magnitude faster. + +Halley's method was then used to refine the estimate of Lambert W-1 from this guess. +Experiments showed that although all approximations reached with __ulp of the closest representable value, +the computational cost of the log functions was easily paid by far fewer iterations +(typically from 8 down to 4 iterations for double or float). For example: + + using boost::math::policies::digits2; + // Very close to z = -1.0264389699511303e-26 when W = 64, when effect of ln(ln(-z) term and ratio L1/L2 is greatest. + double z = z = -1e-26; + double r = lambert_wm1(z, policy >()); + // lambert_wm1(-1.0000000000000000e-26) = -64.026509628385895 + +[h4:edge_cases Edge and Corner cases] + +[h5:w0_edges w0 Branch] + +[h5:wm1_edges w-1 Branch] + +The range mathematically is -exp(-1) <= z <=0, but numerically, + +* `z == -exp(-1)` (for the type T) returns exactly -1. +* `z == 0` returns infinity (or the nearest equivalent if `std::has_infinity == false`). +* `z == std::numeric_limits::min()` returns the maximum possible value of Lambert W for the type T. [br] +For example, for `double`: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 [br] +and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 [br] + +* `z < std::numeric_limits::min()`, means that z is denormalized (if `std::numeric_limits::has_denorm_min == true`), +for example: + + r = lambert_wm1(std::numeric_limits::denorm_min()); + +and will give a message like: + + Error in function boost::math::lambert_wm1(): + Argument z = -4.9406564584124654e-324 is too small + (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch! + +Denormalized values of z are not supported (because not all floating-point types denormalize), +and anyway it only covers a tiny fraction of the range of possible z arguments values. + + + [h4:testing Testing] @@ -447,6 +556,9 @@ this version by C++ version by John Burkardt. Initial guesses based on: +# R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, +On the Lambert W function, Adv.Comput.Math., vol. 5, pp. 329 to 359, (1996). + # D.A. Barry, J.-Y. Parlange, L. Li, H. Prommer, C.J. Cunningham, and F. Stagnitti. Analytical approximations for real values of the Lambert W-function. Mathematics and Computers in Simulation, 53(1), 95-103 (2000). diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index cdfbdde70..b250d4411 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -21,6 +21,9 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_W0 // Halley refinement diagnostics only for W0 branch. +BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_WM1 // Halley refinement diagnostics only for W-1 branch. +BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26 BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. @@ -39,7 +42,6 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of #include #include -#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include #include #include // for log (1 + x) @@ -51,6 +53,8 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of #include // evaluate_polynomial. #include #include +#include // boost::math::tools::max_value(). +#include // Macro BOOST_MATH_TEST_VALUE. #include #include @@ -63,60 +67,21 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of #include // For float_distance. //#include // For create_test_value and macro BOOST_MATH_TEST_VALUE. +typedef double lookup_t; // Type for lookup table (double or float, or even long double?) + +#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp" +// #include "lambert_w_lookup_table.ipp" // TODO copy final version. namespace boost { namespace math -{ +{ + namespace detail { - namespace lambert_w_lookup - { - - typedef double lookup_t; // Type for lookup table (double or float?) - - BOOST_STATIC_CONSTEXPR std::size_t noof_wm1s = 66; - BOOST_STATIC_CONSTEXPR lookup_t e[noof_wm1s] = // lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 - { - 2.7182818284590452, 1., 0.36787944117144232, 0.13533528323661269, 0.049787068367863943, 0.01831563888873418, 0.0067379469990854671, - 0.0024787521766663584, 0.00091188196555451621, 0.00033546262790251184, 0.00012340980408667955, 4.5399929762484852e-05, 1.6701700790245659e-05, - 6.1442123533282098e-06, 2.2603294069810543e-06, 8.3152871910356788e-07, 3.0590232050182579e-07, 1.1253517471925911e-07, 4.1399377187851667e-08, - 1.5229979744712628e-08, 5.6027964375372675e-09, 2.0611536224385578e-09, 7.5825604279119067e-10, 2.7894680928689248e-10, 1.026187963170189e-10, - 3.7751345442790977e-11, 1.3887943864964021e-11, 5.1090890280633247e-12, 1.8795288165390833e-12, 6.914400106940203e-13, 2.5436656473769229e-13, - 9.3576229688401746e-14, 3.4424771084699765e-14, 1.2664165549094176e-14, 4.6588861451033974e-15, 1.713908431542013e-15, 6.3051167601469894e-16, - 2.3195228302435694e-16, 8.5330476257440658e-17, 3.1391327920480296e-17, 1.1548224173015786e-17, 4.248354255291589e-18, 1.5628821893349888e-18, - 5.7495222642935598e-19, 2.1151310375910805e-19, 7.7811322411337965e-20, 2.8625185805493936e-20, 1.0530617357553812e-20, 3.8739976286871871e-21, - 1.4251640827409351e-21, 5.2428856633634639e-22, 1.9287498479639178e-22, 7.0954741622847041e-23, 2.6102790696677048e-23, 9.602680054508676e-24, - 3.532628572200807e-24, 1.2995814250075031e-24, 4.7808928838854691e-25, 1.7587922024243116e-25, 6.4702349256454603e-26, 2.3802664086944006e-26, - 8.7565107626965203e-27, 3.2213402859925161e-27, 1.185064864233981e-27, 4.359610000063081e-28, 1.6038108905486378e-28 - }; - - BOOST_STATIC_CONSTEXPR size_t noof_w0s = 65; - BOOST_STATIC_CONSTEXPR lookup_t g[noof_w0s] = // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. - { 0., 2.7182818284590452, 14.7781121978613, 60.256610769563003, 218.39260013257696, 742.06579551288302, 2420.5727609564107, 7676.4321089992102, - 23847.663896333826, 72927.755348178456, 220264.65794806717, 658615.558867176, 1953057.4970280471, 5751374.0961159665, 16836459.978306875, 49035260.58708166, - 142177768.32812596, 410634196.81078007, 1181879444.4719492, 3391163718.300558, 9703303908.1958056, 27695130424.147509, 78868082614.895014, 224130479263.72476, - 635738931116.24334, 1800122483434.6468, 5088969845149.8079, 14365302496248.563, 40495197800161.305, 114008694617177.22, 320594237445733.86, - 900514339622670.18, 2526814725845782.2, 7083238132935230.1, 19837699245933466., 55510470830970076., 1.5520433569614703e+17, 4.3360826779369662e+17, - 1.2105254067703227e+18, 3.3771426165357561e+18, 9.4154106734807994e+18, 2.6233583234732253e+19, 7.3049547543861044e+19, 2.032970971338619e+20, - 5.6547040503180956e+20, 1.5720421975868293e+21, 4.3682149334771265e+21, 1.2132170565093317e+22, 3.3680332378068632e+22, 9.3459982052259885e+22, - 2.5923527642935362e+23, 7.1876803203773879e+23, 1.99212416037262e+24, 5.5192924995054165e+24, 1.5286067837683347e+25, 4.2321318958281094e+25, - 1.1713293177672778e+26, 3.2408603996214814e+26, 8.9641258264226028e+26, 2.4787141382364034e+27, 6.8520443388941057e+27, 1.8936217407781711e+28, - 5.2317811346197018e+28, 1.4450833904658542e+29, 3.9904954117194348e+29 - }; - - BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = 12; - BOOST_STATIC_CONSTEXPR lookup_t a[noof_sqrts] = // 0.6065 0.7788, 0.8824 ... 0.9997, sqrt of previous elements. - { - 0.60653065971263342, 0.77880078307140487, 0.8824969025845954, 0.93941306281347579, 0.96923323447634408, 0.98449643700540841, - 0.99221793826024351, 0.99610136947011749, 0.99804878110747547, 0.99902391418197566, 0.99951183793988937, 0.99975588917489722 - }; - BOOST_STATIC_CONSTEXPR lookup_t b[noof_sqrts] = // 0.5 0.25 0.125, 0.0625 ... 0.0002441, halves of previous elements. - { 0.5, 0.25, 0.125, 0.0625, 0.03125, 0.015625, 0.0078125, 0.00390625, 0.001953125, 0.0009765625, 0.00048828125, 0.000244140625 }; - } // namespace Lambert_w_lookup //! Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944. - // Some integer constants overflow so use largest size available. + // Some integer constants overflow so use largest integer size available (LL). // Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]] // T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3. // Wolfram command used to obtain 40 series terms at 50 decimal digit precision was @@ -724,19 +689,19 @@ namespace math // since we can simplify the expressions algebraically, // and don't need most of the error checking of the boilerplate version // as we know in advance that the function is reasonably well-behaved, - // and in any case the derivatives require evaluation of Lambert W! + // (and in any case the derivatives require evaluation of Lambert W!) BOOST_MATH_STD_USING // Aid argument dependent (ADL) lookup of abs. using boost::math::constants::exp_minus_one; // 0.36787944 using boost::math::tools::max_value; - T tolerance = boost::math::policies::get_epsilon(); + T tolerance = boost::math::policies::get_epsilon(); // TODO should get_precision here. int iterations = 0; int iterations_required = 6; - int max_iterations = 10; + int max_iterations = 20; T w1 = w0; // Refined estimate. T previous_diff = boost::math::tools::max_value(); @@ -751,7 +716,7 @@ namespace math std::cout.precision(std::numeric_limits::max_digits10); // Show all posssibly significant digits. std::ios::fmtflags flags(std::cout.flags()); // Save. std::cout.setf(std::ios_base::showpoint); // Include any trailing zeros. - std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl; + std::cout << "w = " << w0 << ", z = " << z << ", w * exp(w) = " << w0 * expw0 << ", diff = " << diff << std::endl; std::cout.precision(precision); // Restore. std::cout.flags(flags); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY @@ -779,13 +744,16 @@ if (diff == 0) // Exact result - common. w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39. - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2))); - diff = (w1 * exp(w1)) - z; #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY T dis = boost::math::float_distance(w0, w1); + std::cout << "w = " << w0 << ", z = " << z << ", w * exp(w) = " << w0 * expw0 << ", diff = " << diff << std::endl; int d = static_cast(dis); - std::cout << "float_distance = " << d << std::endl; + if (abs(dis) < 2147483647) + { + std::cout << "float_distance = " << d << std::endl; + } #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY if (diff == 0) // Exact. @@ -803,7 +771,7 @@ if (diff == 0) // Exact result - common. w0 = w1; expw0 = exp(w0); } - while ((iterations < iterations_required) || (iterations <= max_iterations)); // Absolute limit during testing - looping if need this. + while ((iterations < iterations_required) || (iterations <= max_iterations)); // Absolute limit during testing - is looping if need this. return w1; } // T halley_update(T w0, const T z) @@ -951,7 +919,7 @@ if (diff == 0) // Exact result - common. // or static_casted integer, for example: static_cast(1) or static_cast(1). // Want to allow fixed_point types too, so do not just test for floating-point. // Integral types should been promoted to double by user Lambert w functions. - BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: W(1.), not W(1)!"); + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: lambert_w0(1.), not lambert_w0(1)!"); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 { @@ -964,25 +932,32 @@ if (diff == 0) // Exact result - common. } #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 - // Test for edge and corner cases first, + const char* function = "boost::math::lambert_w0()"; // Used for error messages. + // Test for edge and corner cases first: if (boost::math::isnan(z)) { - const char* function = "boost::math::lambert_w0()"; return policies::raise_domain_error(function, "Argument z is NaN!", z, pol); } if (boost::math::isinf(z)) { - const char* function = "boost::math::lambert_w0()"; - return policies::raise_domain_error(function, - "Argument z is infinite!", - z, pol); + if (std::numeric_limits::has_infinity) + { + return std::numeric_limits::infinity(); + } + else + { // Arbitrary precision type. + return tools::max_value(); + } + // Or might opt to throw an exception? + //return policies::raise_domain_error(function, + // "Argument z is infinite!", + // z, pol); } if (z > (std::numeric_limits::max)()/4) - { // TODO not sure this is right - what is largest possible for which can compute Lambert_w? - const char* function = "boost::math::lambert_w0()"; + { // TODO not sure this is right - what is largest possible for which can compute Lambert_w0? return policies::raise_domain_error(function, "Argument z %1% is too big!", z, pol); @@ -1008,13 +983,12 @@ if (diff == 0) // Exact result - common. } else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch (should using W1 branch instead). { - const char* function = "boost::math::lambert_w0()"; return policies::raise_domain_error(function, "Argument z = %1% out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).", z, pol); } else if (z < static_cast(-0.35)) - { // Near singularity/branch point at z = -0.36787944... + { // Near singularity/branch point at z = -0.3678794411714423215955237701614608727 const T p2 = 2 * (boost::math::constants::e() * z + 1); if (p2 > 0) { // Use near-singularity series expansion. @@ -1132,22 +1106,23 @@ if (diff == 0) // Exact result - common. // Perform additional Halley refinement(s) to ensure that // get a near as possible to correct result (usually +/- one epsilon). T result = halley_update(double_approx, z, pol); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN - std::cout.precision(std::numeric_limits::max_digits10); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl; + std::cout.precision(saved_precision); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 return result; - } // digits > 53 + } // digits > 53 - higher precision than double. else // T is double or less precision. { // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. using namespace boost::math::detail::lambert_w_lookup; // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch. // Since z is probably quite small, start with lowest (n = 0). - int n; // Indexing W0 lookup table g[n] of z. + int n; // Indexing W0 lookup table w0s[n] of z. for (n = 0; n <= 2; ++n) { // Try 1st few. - if (g[n] > z) + if (w0s[n] > z) { // goto bisect; } @@ -1156,13 +1131,13 @@ if (diff == 0) // Exact result - common. for (int j = 1; j <= 5; ++j) { n *= 2; // Try bigger steps. - if (g[n] > z) // z <= g[n] + if (w0s[n] > z) // z <= w0s[n] { goto overshot; // } } // for // get here if - std::cout << "Too big " << z << std::endl; + //std::cout << "Too big " << z << std::endl; //// else z too large :-( //const char* function = "boost::math::lambert_w0()"; return policies::raise_domain_error("boost::math::lambert_w0()", @@ -1179,7 +1154,7 @@ if (diff == 0) // Exact result - common. { break; } - if (g[n - nh] > z) + if (w0s[n - nh] > z) { n -= nh; } @@ -1187,8 +1162,8 @@ if (diff == 0) // Exact result - common. } bisect: - --n; // g[n] is nearest below, so n is integer part of W, - // and g[n+1] is next integral part of W. + --n; // w0s[n] is nearest below, so n is integer part of W, + // and w0s[n+1] is next integral part of W. // These are used as initial values for bisection. @@ -1207,15 +1182,15 @@ if (diff == 0) // Exact result - common. #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP - std::cout << "Result lookup W(" << z << ") bisection between g[" << n - 1 << "] = " << g[n - 1] << " and g[" << n << "] = " << g[n] - << ", bisect mean = " << (g[n - 1] + g[n]) / 2 << std::endl; + std::cout << "Result lookup W(" << z << ") bisection between w0s[" << n - 1 << "] = " << w0s[n - 1] << " and w0s[" << n << "] = " << w0s[n] + << ", bisect mean = " << (w0s[n - 1] + w0s[n]) / 2 << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP if (d2 <= 7) - { // Only 7 binary digits precision required to hold integer size of g[65], + { // Only 7 binary digits precision required to hold integer size of w0s[65], // so just return the mean of two nearby integral values. // This is a *very* approximate estimate, and perhaps not very useful? - return static_cast((g[n - 1] + g[n]) / 2); + return static_cast((w0s[n - 1] + w0s[n]) / 2); } // Compute the number of bisections (jmax) that ensure that result is close enough that // a single 5th order Schroeder update is sufficient to achieve near double (53-bit) accuracy. @@ -1236,15 +1211,18 @@ if (diff == 0) // Exact result - common. { // Small z, so need just 1 extra bisection. jmax = 9; } - lookup_t dz = static_cast(z); // Only use double precision for bisection. - + lookup_t dz = static_cast(z); + // Only use lookup_t precision, default double, for bisection. + // Use Halley refinement for higher precisions. // Perform the jmax fractional bisections for necessary precision. - lookup_t y = dz * e[n + 1]; // - lookup_t w = static_cast(n); // Integral Lambert W estimate. + // Avoid using exponential function for speed. + lookup_t w = static_cast(n); // Equation 25, Integral Lambert W. + // lookup_t y = dz * e[n + 1]; // Integral +1 Lambert W. + lookup_t y = dz * static_cast(wm1s[n + 1]); // Equation 26, Integral +1 Lambert W. for (int j = 0; j < jmax; ++j) - { - const lookup_t wj = w + b[j]; // Add 1/2, 1/4, 1/8 ... - const lookup_t yj = y * a[j]; // Multiply by sqrt(1/e), ... + { // Equation 27. + const lookup_t wj = w + static_cast(halves[j]); // Add 1/2, 1/4, 1/8 ... + const lookup_t yj = y * static_cast(sqrts[j]); // Multiply by sqrt(1/e), ... if (wj < yj) { w = wj; @@ -1257,11 +1235,11 @@ if (diff == 0) // Exact result - common. // so just return the nearest bisection. // (Might make this test depend on size of T?) #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION - std::cout << "Bisection estimate = " << w << std::endl; + std::cout << "Bisection estimate = " << w << " " << y << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION return static_cast(w); // Bisection only. } - else // More than 10 digits2 wanted so continue with Fukushima's Schroeder refinement. + else // More than 10 digits2 wanted, so continue with Fukushima's Schroeder refinement. { T result = static_cast(schroeder_update(w, y)); if (d2 <= (std::numeric_limits::digits - 3)) @@ -1291,78 +1269,198 @@ if (diff == 0) // Exact result - common. } // T lambert_w0_imp(const T z, const Policy& /* pol */) //! Lambert W for W-1 branch, -max(z) < z <= -1/e. + // TODO is -max(z) allowed? // TODO check changes to W0 branch have also been made here. template - T lambert_wm1_imp(const T z, const Policy& /* pol */) + T lambert_wm1_imp(const T z, const Policy& pol) { // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1). // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L), // or static_casted integer, for example: static_cast(1) or static_cast(1). // Want to allow fixed_point types too, so do not just test for floating-point. // Integral types should be promoted to double by user Lambert w functions. - // If integral type provided to user function lambert_w0 or _wm1, + // If integral type provided to user function lambert_w0 or lambert_wm1, // then should already have been promoted to double. - - BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: W(1.), not W(1)!"); + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!"); BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. - // else z is too large for the w-1 branch. - // TODO should this be the singularity value? And others are wrong too. - if (z >= 0) + using boost::math::tools::max_value; + + const char* function = "boost::math::lambert_wm1()"; // Used for error messages. + + if (z == static_cast(0)) + { // z is exactly zero.return -std::numeric_limits::infinity(); + return -std::numeric_limits::infinity(); + } + if (z > static_cast(0)) + { // + return policies::raise_domain_error(function, + "Argument z = %1% is out of range (z > 0) for Lambert W-1 branch! (Try Lambert W0 branch?)", + z, pol); + } + if(z > -(std::numeric_limits::min)()) + { // z is denormalized, so cannot be computed. + // -std::numeric_limits::min() is smallest for type T, + // for example, for double: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 + return policies::raise_domain_error(function, + "Argument z = %1% is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch!", + z, pol); + } + if (z == -boost::math::constants::exp_minus_one()) // == singularity/branch point z = -exp(-1) = -3.6787944. + { // At singularity, so return exactly -1. + return -static_cast(1); + } + // z is too negative for the W-1 (or W0) branch. + if (z < -boost::math::constants::exp_minus_one()) // > singularity/branch point z = -exp(-1) = -3.6787944. { - std::cerr << "lambert_wm1 argument out of range, z = " << z << std::endl; - return std::numeric_limits::quiet_NaN(); + return policies::raise_domain_error(function, + "Argument z = %1% is out of range (z < -exp(-1) = -3.6787944... <= 0) for Lambert W-1 (or W0) branch!", + z, pol); } if (z < -0.35) - { // Close to singularity/branch point. + { // Close to singularity/branch point but on w-1 branch. TODO. const T p2 = 2 * (boost::math::constants::e() * z + 1); if (p2 > 0) { return lambert_w_singularity_series(-sqrt(p2)); - // TODO Halley options here. + // TODO Halley refinement options here. } if (p2 == 0) - { + { // At the singularity at branch point. return -1; } - std::cerr << "(lambert_wm1) Argument out of range, z = " << z << std::endl; - return std::numeric_limits::quiet_NaN(); - } + return policies::raise_domain_error(function, + "Argument z = %1% is out of range!", + z, pol); + } // if (z < -0.35) + + // Create static arrays of Lambert Wm1 function + // TODO these are NOT the same size or values as the w0 constant array values????? + + // double LambertW0(const double z) + // static double e[66]; + // static double g[65]; + // static double a[12]; + // static double b[12]; // Create static arrays of Lambert W function for Wm1 // with lambert_w values of integers. // Used for bisection of W-1 branch. - static const size_t noof_sqrts = 12; + static const size_t noof_sqrts = 12; // and halves + // F[k] is 0 <= k <= 64 so size is 65 (but is 64 below????). + // G[k] is 1 <= k <= 64 so size is 64 + // So e and F are not the same! - static T e[64]; - static T g[64]; - static T a[noof_sqrts]; - static T b[noof_sqrts]; + static const size_t noof_wm1s = 64; + + static lookup_t e[noof_wm1s]; // e[0] to e[63] + static lookup_t g[noof_wm1s]; // g[0] == Gk when k = 1, to g[63] == Gk=64 + static lookup_t a[noof_sqrts]; + static lookup_t b[noof_sqrts]; if (!e[0]) { - const T e1 = 1 / boost::math::constants::e(); - T ej = e1; - e[0] = boost::math::constants::e(); + const lookup_t e1 = 1 / boost::math::constants::e(); + lookup_t ej = e1; // 1/e= 0.36787945 + e[0] = boost::math::constants::e(); g[0] = -e1; for (int j = 0, jj = 1; jj < 64; ++jj) - { + { // jj is j+1 ej *= e1; - e[jj] = e[j] * boost::math::constants::e(); + e[jj] = e[j] * boost::math::constants::e(); g[jj] = -(jj + 1) * ej; j = jj; } - a[0] = sqrt(boost::math::constants::e()); - b[0] = static_cast(0.5); + a[0] = sqrt(boost::math::constants::e()); + b[0] = static_cast(0.5); for (int j = 0, jj = 1; jj < noof_sqrts; ++jj) { - a[jj] = sqrt(a[j]); - b[jj] = b[j] * static_cast(0.5); + a[jj] = sqrt(a[j]); + // b[jj] = b[j] * static_cast(0.5); + b[jj] = b[j] / 2; // More efficient for multiprecision? j = jj; - } - } // static arrays filled. + } // for j + +//std::cout << " W-1 e[0] = " << e[0] << ", e[1] = " << e[1] << "... e[63] = " << e[63] << std::endl; +// W-1 e[0] = 2.71828175, e[1] = 7.38905573... e[63] = 6.23513822e+27 +// W-1 e[0] = 2.7182818284590451, e[1] = 7.3890560989306495... e[63] = 6.235149080811597e+27, e[64] = 58265.164084420219 +//std::cout << " W-1 g[0] = " << g[0] << ", g[1] = " << g[1] << "... g[63] = " << g[63] << std::endl; +// W-1 g[0] = -0.36787945 k=1, -1e^-1 = -0.3678794 , +// g[1] = -0.270670593 ... g[63] = -1.0264407e-26 +// W-1 g[0] = -0.36787944117144233, g[1] = -0.2706705664732254... g[63] = -1.0264389699511303e-26 + // TODO temporary output. + //std::cout << "lambert_wm1 version of arrays - NOT same as w0 version." << std::endl; + // print_collection(e, "e", " "); // e[0] = 2.71828175, e[1] = 1, e[2] = 0.36787945, 0.135335296 0.0497870743 0.0183156412 0.00673794793 ... e[63] = 2.293783159, e[64]= 6.235149080e+27 + // print_collection(g, "g", " "); // g[0] = -0.3678794, g[1] = -0.2706705... , g[63] = -1.026438e-26 + //print_collection(a, "a", " "); + //print_collection(b, "b", " "); + } // if (!e[0]) +// static arrays filled. + + // TODO move up when using precomputed array. + //if (abs(z) < abs(g[63])) + +if (z > g[63]) + { // z > -1.0264389699511303e-26 (but != 0 and >= std::numeric_limits::min() and so NOT denormalized). + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + + // std::cout << "abs(z) " << abs(z) << ", abs(g[63] = " << abs(g[63]) << std::endl; + + // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl; + // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl; + // -std::numeric_limits::min() = -1.1754943508222875e-38 + // -std::numeric_limits::min() = -2.2250738585072014e-308 + + // N[productlog(-1, -1.1754943508222875 * 10^-38 ), 50] = -91.856775324595479509567756730093823993834155027858 + + // N[productlog(-1, -2.2250738585072014e-308 * 10^-308 ), 50] = -1424.8544521230553853558132180518404363617968042942 + + T guess ; // bisect lowest possible Gk[=64] (for lookup_t type?) + + //int exponent = ilogb(z); + //std::cout << exponent << std::endl; + //guess = static_cast(exponent); + + // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996. + // François Chapeau-Blondeau and Abdelilah Monir + // Numerical Evaluation of the Lambert W Function + // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002 + // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf + // Estimate Lambert W using ln(-z) ... +// This is roughly the power of ten * ln(10) ~= 2.3. n ~= 10^n +// and improve by adding a second term -ln(ln(-z)) + T lz = log(-z); + T llz = log(-lz); + guess = lz - llz + (llz/lz); // Chapeau-Blondeau equation 20, page 2162. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY + std::cout << "z = " << z << ", guess = " << guess << ", ln(-z) = " << lz << ", ln(-ln(-z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl; + // z = -1.0000000000000001e-30, guess = -73.312782616731482, ln(-z) = -69.077552789821368, ln(-ln(-z) = 4.2352298269101114, llz/lz = -0.061311231447304194 + // z = -9.9999999999999999e-91, guess = -212.56650048504233, ln(-z) = -207.23265836946410, ln(-ln(-z) = 5.3338421155782205, llz/lz = -0.025738424423764311 + // >z = -2.2250738585072014e-308, guess = -714.95942238244606, ln(-z) = -708.39641853226408, ln(-ln(-z) = 6.5630038501819854, llz/lz = -0.0092645920821846622 + int d10 = policies::digits_base10(); // policy template parameter digits10 + int d2 = policies::digits(); // digits base 2 from policy. + std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 + << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY + if (policies::digits() < 12) + { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12. + return guess; + } + T result = halley_update(guess, z, pol); + std::cout.precision(saved_precision); + return result; + + //// G[k=64] == g[63] == -1.02643897e-26 + //return policies::raise_domain_error(function, + // "Argument z = %1% is too small (< -1.02643897e-26) !", + // z, pol); + } + + + + // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. // Bracketing sequence n = (2, 4, 8, 16, 32, 64) for W-1 branch. // Since z is probably quite small, start with lowest n (=2). int n = 2; @@ -1378,25 +1476,33 @@ if (diff == 0) // Exact result - common. goto overshot; } } - //else - // TODO use policy here. - std::cerr << "(lambert_wm1) Argument too small, z = " << z << std::endl; - return std::numeric_limits::quiet_NaN(); + // else z < g[63] == -1.0264389699511303e-26, so Lambert W integer part > 64. + + // Might assign the lower bracket to -1.0264389699511303e-26 and upper to (std::numeric_limits::min)() +// and jump to schroeder to halley? But that would only allow use with lookup_t precision. + // So try using Halley direct? + return policies::raise_domain_error(function, + "Argument z = %1% is too small (< -1.026439e-26) !", + z, pol); overshot: { - int nh = n / 2; + int nh = n / 2; for (int j = 1; j <= 5; ++j) { - nh /= 2; + nh /= 2; // halve step size. if (nh <= 0) - break; + { + break; // goto bisect; + } if (g[n - nh - 1] > z) + { n -= nh; + } } } bisect: - --n; // g[n] now holds lambert W of floor integer n. + --n; // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part. // Check precision specified by policy. int d2 = policies::digits(); @@ -1411,9 +1517,10 @@ if (diff == 0) // Exact result - common. return static_cast(n); } - // jmax is the number of bisections such that a single application of the fifth-order update formula - // after the bisections is enough to evaluate W-1 with 53-bit accuracy. - int jmax = 11; // + // jmax is the number of bisections computed from n, + // such that a single application of the fifth-order Schroeder update formula + // after the bisections is enough to evaluate Lambert W-1 with 53-bit accuracy. + int jmax = 11; // Assume maximum number of bisections will be needed (most common case). if (n >= 8) { jmax = 8; @@ -1426,28 +1533,34 @@ if (diff == 0) // Exact result - common. { jmax = 10; } - T w = - static_cast(n); - T y = z * e[n - 1]; + // Bracketing, Fukushima section 2.3, page 82: + // (Avoid using exponential function for speed). + // Only use lookup_t precision, default double, for bisection (for speed). + lookup_t w = -static_cast(n); // Equation 25, + lookup_t y = static_cast(z * e[n - 1]); // Equation 26, for (int j = 0; j < jmax; ++j) - { - const T wj = w - b[j]; - const T yj = y * a[j]; + { // Equation 27. + lookup_t wj = w - b[j]; // Subtract 1/2, 1/4, 1/8 ... + lookup_t yj = y * a[j]; // Multiply by sqrt(1/e), ... if (wj < yj) { w = wj; y = yj; } - } - T result = schroeder_update(w, y); // Schroeder 5th order method refinement. - result = halley_update(result, z); + } // for j + + T result = static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement. + // Only use Halley refinement (using exp) for higher precisions. + result = halley_update(result, z, pol); return result; } // template T lambert_wm1_imp(const T z) } // namespace detail //////////////////////////////////////////////////////////// - // User Lambert W functions. + // User Lambert W0 and Lambert W-1 functions. - //! W0 branch, -1/e < z < max(z) + //! W0 branch, -1/e <= z < max(z) + //! W-1 branch -1/e >= z > min(z) //! Lambert W0 using User-defined policy. template diff --git a/test/lambert_w_high_reference_values.cpp b/test/lambert_w_high_reference_values.cpp index 5085a2dac..3c908cc6e 100644 --- a/test/lambert_w_high_reference_values.cpp +++ b/test/lambert_w_high_reference_values.cpp @@ -7,18 +7,18 @@ // Write a C++ file \lambert_w_mp_hi_values.ipp // containing arrays of z arguments and 100 decimal digit precision lambert_w0(z) reference values. -// These can be used in tests of precision of less-precise types like +// These can be used in tests of precision of less-precise types like // built-in float, double, long double and quad and cpp_dec_float_50. // These cover the range from 0.5 to (std::numeric_limits<>::max)(); -// The Fukushima algorithm changes from a series function for all z > 0.5. +// The Fukushima algorithm changes from a series function for all z > 0.5. // Multiprecision types: //#include #include // boost::multiprecision::cpp_dec_float_100 using boost::multiprecision::cpp_dec_float_100; -#include // +#include // using boost::math::lambert_w0; using boost::math::lambert_wm1; @@ -38,9 +38,9 @@ using std::ofstream; const long double eps = std::numeric_limits::epsilon(); // Creates if no file exists, & uses default overwrite/ ios::replace. -const char filename[] = "lambert_w_high_reference_values.ipp"; // +const char filename[] = "lambert_w_high_reference_values.ipp"; // std::ofstream fout(filename, std::ios::out); - + typedef cpp_dec_float_100 RealType; // 100 decimal digits for the value fed to macro BOOST_MATH_TEST_VALUE. // Could also use cpp_dec_float_50 or cpp_bin_float types. @@ -63,10 +63,10 @@ int main() try { int output_precision = std::numeric_limits::digits10; - // cpp_dec_float_100 is ample precision and + // cpp_dec_float_100 is ample precision and // has several extra bits internally so max_digits10 are not needed. fout.precision(output_precision); - fout << std::showpoint << std::endl; // Don't show trailing zeros. + fout << std::showpoint << std::endl; // Do show trailing zeros. // Intro for RealType values. std::cout << "Lambert W test values written to file " << filename << std::endl; @@ -130,7 +130,7 @@ int main() { fout << " zs[" << index << "] = BOOST_MATH_TEST_VALUE(RealType, " - << z // Since start with converting a float may get lots of usefully random digits. + << z // Since start with converting a float may get lots of usefully random digits. << ");" << std::endl; diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index a2612b3d2..8ca0deb5d 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -8,7 +8,7 @@ // test_lambertw.cpp //! \brief Basic sanity tests for Lambert W function plog -//! or lambert_w using algorithm informed by Thomas Luu, Veberic and Fukushima. +//! or lambert_w using algorithm informed by Thomas Luu, Veberic and Tosio Fukushima. #include // for real_concept #define BOOST_TEST_MAIN @@ -84,6 +84,14 @@ std::string show_versions() //PRINT_MACRO(LONG_MAX); #endif // __GNUC__ +#ifdef __MINGW64__ +std::cout << "MINGW64 " << __MINGW64_MAJOR_VERSION__ << __MINGW64_MINOR_VERSION << std::endl; +#endif // __MINGW64__ + +#ifdef __MINGW32__ +std::cout << 2MINGW64 " << __MINGW32_MAJOR_VERSION__ << __MINGW32_MINOR_VERSION << std::endl; +#endif // __MINGW32__ + message << "\n STL " << BOOST_STDLIB; message << "\n Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100; @@ -121,7 +129,7 @@ void test_spots(RealType) #ifndef BOOST_NO_EXCEPTIONS BOOST_CHECK_THROW(boost::math::lambert_w0(-1.), std::domain_error); BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. - BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Would be infinite. + // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // If infinity should throw. BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex. #else @@ -165,9 +173,14 @@ void test_spots(RealType) // Tests with some spot values computed using // https://www.wolframalpha.com/input - // For example: N[lambert_w0[1], 50] outputs: + // For example: N[lambert_w[1], 50] outputs: // 0.56714329040978387299996866221035554975381578718651 + BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 + lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), + BOOST_MATH_TEST_VALUE(RealType, -1.), + tolerance); + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)), BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472), // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.2) @@ -214,6 +227,145 @@ void test_spots(RealType) // Output from https://www.wolframalpha.com/input/?i=lambert_w0(100) tolerance); + if (std::numeric_limits::has_infinity) + { + // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // If should throw exception. + //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // message is: + // Error in "test_types": class boost::exception_detail::clone_impl > : + // Error in function boost::math::lambert_w0() : Argument z is infinite! + BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // Infinity allowed. + } + if (std::numeric_limits::has_quiet_NaN) + { // Argument Z == NaN is always an throwable error. + // BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is: + // Error in function boost::math::lambert_w0(): Argument z is NaN! + BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); + BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error); + } + + // Some tests of Lambert W-1 branch. + + BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 at the singularity branch point. + lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), + BOOST_MATH_TEST_VALUE(RealType, -1.), + tolerance); + + // Near singularity and using series approximation. + //N[productlog(-1, -0.36), 50] = -1.2227701339785059531429380734238623131735264411311 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.36)), + BOOST_MATH_TEST_VALUE(RealType, -1.2227701339785059531429380734238623131735264411311), + tolerance); + + // Near singularity and NOT using series approximation (switch at -0.35) + // N[productlog(-1, -0.34), 50] + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.34)), + BOOST_MATH_TEST_VALUE(RealType, -1.4512014851325470735077533710339268100722032730024), + tolerance); + + // Decreasing z until near zero. + //N[productlog(-1, -0.3), 50] = -1.7813370234216276119741702815127452608215583564545 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)), + BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545), + tolerance); + + //N[productlog(-1, -0.2), 50] = -2.5426413577735264242938061566618482901614749075294 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.2)), + BOOST_MATH_TEST_VALUE(RealType, -2.5426413577735264242938061566618482901614749075294), + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.1)), + BOOST_MATH_TEST_VALUE(RealType, -3.577152063957297218409391963511994880401796257793), + tolerance); + + //N[productlog(-1, -0.01), 50] = -6.4727751243940046947410578927244880371043455902257 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.01)), + BOOST_MATH_TEST_VALUE(RealType, -6.4727751243940046947410578927244880371043455902257), + tolerance); + + // N[productlog(-1, -0.001), 50] = -9.1180064704027401212583371820468142742704349737639 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.001)), + BOOST_MATH_TEST_VALUE(RealType, -9.1180064704027401212583371820468142742704349737639), + tolerance); + + // N[productlog(-1, -0.000001), 50] = -16.626508901372473387706432163984684996461726803805 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.000001)), + BOOST_MATH_TEST_VALUE(RealType, -16.626508901372473387706432163984684996461726803805), + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-12)), + BOOST_MATH_TEST_VALUE(RealType, -31.067172842017230842039496250208586707880448763222), + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-25)), + BOOST_MATH_TEST_VALUE(RealType, -61.686695602074505366866968627049381352503620377944), + tolerance); + + // z nearly too small + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2e-26)), + BOOST_MATH_TEST_VALUE(RealType, -63.322302839923597803393585145387854867226970485197), + tolerance* 2); + + // z very nearly too small. G(k=64) g[63] = -1.0264389699511303e-26 to using 1.027e-26 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.027e-26)), + BOOST_MATH_TEST_VALUE(RealType, -63.999444896732265186957073549916026532499356695343), + tolerance); + // So -64 is the most negative value that can be determined using lookup. + // N[productlog(-1, -1.0264389699511303 * 10^-26 ), 50] -63.999999999999997947255011093606206983577811736472 == -64 + // G[k=64] = g[63] = -1.0264389699511303e-26 + + // z too small for G(k=64) g[63] = -1.0264389699511303e-26 to using 1.027e-26 + // N[productlog(-1, -10 ^ -26), 50] = -31.067172842017230842039496250208586707880448763222 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-26)), + BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868), + tolerance); + + + + // z == zero. + + if (std::numeric_limits::has_infinity) + { + BOOST_CHECK_EQUAL(lambert_wm1(0.L), -std::numeric_limits::infinity()); + + } + if (std::numeric_limits::has_quiet_NaN) + { + // BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is: + // Error in function boost::math::lambert_w0(): Argument z is NaN! + BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error); + } + + + // N[productlog(-1, -10 ^ -26), 50] = -31.067172842017230842039496250208586707880448763222 + //BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-26)), + // BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868L), + // tolerance); + + // 1e-28 is too small + // N[productlog(-1, -10 ^ -28), 50] = -31.067172842017230842039496250208586707880448763222 + //BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-28)), + // BOOST_MATH_TEST_VALUE(RealType, -68.702163291525429160769761667024460023336801014578L), + // tolerance); + + + + // Check for overflow when using a double (including when using for approximate value for refinement for higher precision). + + // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 + //BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e30)), + // BOOST_MATH_TEST_VALUE(RealType, -73.373110313822976797067478758120874529181611813766), + // tolerance); + //unknown location : fatal error : in "test_types" : + //class boost::exception_detail::clone_impl > + // : Error in function boost::math::lambert_wm1() : + // Argument z = -1.00000002e+30 out of range(z < -exp(-1) = -3.6787944) for Lambert W - 1 branch! + + BOOST_CHECK_THROW(lambert_wm1(-0.5), std::domain_error); + + + + + // This fails for fixed_point type used for other tests because out of range? //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), //BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), @@ -275,12 +427,17 @@ void test_spots(RealType) // Checks on input that should throw. - /* This should throw when implemented. - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-0.5), - BOOST_MATH_TEST_VALUE(RealType, ), - // Output from https://www.wolframalpha.com/input/?i=lambert_w0(-0.5) - tolerance); - */ + // This should throw when implemented. + + //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-0.5), + //BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); + // unknown location : fatal error : in "test_types": + //class boost::exception_detail::clone_impl >: + // Error in function boost::math::lambert_w0(): + // Argument z = -0.5 out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?). + BOOST_CHECK_THROW(lambert_w0(-0.5), std::domain_error); + + } //template void test_spots(RealType) BOOST_AUTO_TEST_CASE(test_types) @@ -299,15 +456,12 @@ BOOST_AUTO_TEST_CASE(test_types) //{ // Avoid pointless re-testing if double and long double are identical (for example, MSVC). // test_spots(0.0L); // long double //} - // Built-in/fundamental Quad 128-bit type, if available. -#ifdef BOOST_HAS_FLOAT128 - test_spots(static_cast(0)); -#endif + // TODO - renable these tests when lambert_wm1 lookup table complete // Multiprecision types: - test_spots(static_cast(0)); - test_spots(static_cast(0)); - test_spots(static_cast(0)); + //test_spots(static_cast(0)); + //test_spots(static_cast(0)); + //test_spots(static_cast(0)); // Fixed-point types: diff --git a/test/test_lambert_w0_precision_high.cpp b/test/test_lambert_w0_precision_high.cpp index 31221461d..0d1d19193 100644 --- a/test/test_lambert_w0_precision_high.cpp +++ b/test/test_lambert_w0_precision_high.cpp @@ -15,7 +15,7 @@ #include // boost::exception #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include -//#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. @@ -51,9 +51,7 @@ using boost::lexical_cast; // Include 'Known good' Lambert w values using N[productlog(-0.3), 100] // evaluated to full precision of RealType (up to 100 decimal digits). // Checked for a few z values using WolframAlpha command: N[productlog(-0.3), 100] -//#include "J:\Cpp\Misc\lambert_w_1000_test_values\lambert_w_mp_values.ipp" -#include "J:\Cpp\Misc\lambert_w_high_reference_values\lambert_w_mp_high_values.ipp" -// #include "lambert_w_mp_values.ipp" +#include "lambert_w_high_reference_values.ipp" // Optional functions to list z arguments and reference lambert w values. template @@ -229,7 +227,7 @@ int main() { std::cout << "Lambert W tests,\n" << noof_tests << - " single spot tests comparing with 100 decimal digits precision reference values." << std::endl; + " tests comparing with 100 decimal digits precision reference values." << std::endl; std::cout.precision(std::numeric_limits::max_digits10); std::cout << std::showpoint << std::endl; // Trailing zeros. diff --git a/test/test_lambert_w0_precision_low.cpp b/test/test_lambert_w0_precision_low.cpp index 9a8a39479..0ee840c42 100644 --- a/test/test_lambert_w0_precision_low.cpp +++ b/test/test_lambert_w0_precision_low.cpp @@ -15,7 +15,7 @@ #include // boost::exception #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include -//#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. // Built-in/fundamental Quad 128-bit type, if available. #ifdef BOOST_HAS_FLOAT128 @@ -60,8 +60,7 @@ using boost::lexical_cast; // Include 'Known good' Lambert w values using N[productlog(-0.3), 100] // evaluated to full precision of RealType (up to 100 decimal digits). // Checked for a few z values using WolframAlpha command: N[productlog(-0.3), 100] -#include "J:\Cpp\Misc\lambert_w_1000_test_values\lambert_w_mp_values.ipp" -// #include "lambert_w_mp_values.ipp" +#include "lambert_w_low_reference_values.ipp" // Optional functions to list z arguments and reference lambert w values. template From 04121d287266596872f51b7a68a66e282edc1f05 Mon Sep 17 00:00:00 2001 From: pabristow Date: Sat, 28 Oct 2017 19:13:58 +0100 Subject: [PATCH 19/71] Lambert w for huge z added, and test and more docs --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 3 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 6 +- doc/html/indexes/s05.html | 9 ++- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 74 +++++++++++------- .../math/special_functions/lambert_w.hpp | 75 +++++++++++++++++-- test/test_lambert_w.cpp | 36 +++++++-- 11 files changed, 164 insertions(+), 49 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index a02e24638..120f79b95 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: October 27, 2017 at 17:06:21 GMT

        Last revised: October 28, 2017 at 17:34:54 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index e3e6e8fa5..b8122742f 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -3110,6 +3110,7 @@

      • Geometric Distribution

      • Handling functions with large features near an endpoint with tanh-sinh quadrature

      • History and What's New

        • +

      • Lambert W function

      • Negative Binomial Sales Quota Example.

      • Sign Manipulation Functions

        • diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 8c8d8c8b4..e59d10d27 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 6840371fc..d11b8f5d0 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index b09c7a093..7ff378a82 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        @@ -183,6 +183,10 @@
      • +

        BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP

        +
        +
        • +

      • BOOST_MATH_INSTRUMENT_VARIABLE

        • diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 3704c87cf..aae4abbdc 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -860,6 +860,10 @@
      • +

        BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP

        +
        +
        • +

      • BOOST_MATH_INSTRUMENT_VARIABLE

        • @@ -4828,6 +4832,7 @@

      • al

      • alpha

      • bisection

        • +

      • BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP

      • BOOST_MATH_TEST_VALUE

      • branch

      • constants

        • @@ -4842,6 +4847,7 @@

      • refinement

      • small

      • W

        • +

      • zero

      • @@ -7678,6 +7684,7 @@

      • Geometric Distribution

      • Handling functions with large features near an endpoint with tanh-sinh quadrature

      • History and What's New

        • +

      • Lambert W function

      • Negative Binomial Sales Quota Example.

      • Sign Manipulation Functions

        • diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index da31c6f67..44efc5af3 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 9ecf45760..6011a2fa5 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 306cba4a4..10611afda 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -6,20 +6,19 @@ #include `` - namespace boost { namespace math { template ``__sf_result`` lambert_w0(T z); // W0 branch, default precision. template - ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 policy controlled precision. + ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy controlled precision. template ``__sf_result`` lambert_wm1(T z); // W-1 branch. template - ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 policy controlled precision. + ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy controlled precision. } // namespace boost } // namespace math @@ -33,6 +32,16 @@ On the z-interval \[0, [infin]\] there is just one real solution. On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-. The principal branches called `lambert_W0` and `lambert_Wm1` are provided by this real-only implementation. +[h5:applications Applications of the Lambert W function] + +The Lambert W function has a myriad of applications. +Corless et al. provide a comprehensive description of the range of applications, +from the mathematical like interated exponentiation and asymptoptic roots of trinomials, +the range of a jet plane, enzyme kinetics, water movement in soil, +epidemics, and diode current (an example replicated [@../../example/lambert_w_diode.cpp here]). +Since the publication of their landmark paper, there have been many more applications, and +also many new implementations of the function, upon which this implementation builds. + The function is described in Wolfram Mathworld as [@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function]]. The principal value of the Lambert W-function is implemented in the Wolfram Language as ['ProductLog\[z\]]. @@ -45,11 +54,17 @@ Also the [@https://www.wolframalpha.com Wolfram language] command: [^N\[Product produces the same output to 50 decimal digit precision. +The two real branches W0 and W-1 (not complex) are computed with the functions `lambert_w0` and `lambert_wm2` +from the first [^z] argument. + The final __Policy argument is optional and can be used to control the behaviour of the function: how it handles errors, what level of precision is wanted, etc. +By default, the best possible precision is computed. Refer to __policy_section for more details and see examples below. +The symbolic algebra program __Maple also computes Lambert W to an arbitrary precision. + [h4:examples Examples] [import ../../example/lambert_w_simple_examples.cpp] @@ -156,7 +171,7 @@ as a first approximation followed by Halley refinement, so that there is is little point trying to control precision. Higher precisions are always going to be [*very much slower]. -For more examples of controlling precision, see [@../../include/boost/math/example/lambert_w_precision.cpp lambert_w_precision.cpp]. +For more examples of controlling precision, see [@../../example/lambert_w_precision.cpp lambert_w_precision.cpp]. The implementation details of algorithm switch points are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] @@ -176,17 +191,9 @@ or defined on the project compile command-line: `/DBOOST_MATH_INSTRUMENT_LAMBER or defined in a jamfile.v2: `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` -`` - BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. - BOOST_MATH_INSTRUMENT_LAMBERT_W1 // W1 branch diagnostics. - BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. - BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. - BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. - BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // Higher than built-in precision types approximation and refinement. - BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. - BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show result of estimates where z is near singularity where branches meet. - BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show result of estimates where small z is near zero. -`` +[import ../../include/boost/math/special_functions/lambert_w.hpp] + +[boost_math_instrument_lambert_w_macros] [h4:edge_cases Edge and Corner cases] @@ -217,9 +224,7 @@ Denormalized values of z are not supported (because not all floating-point types and anyway it only covers a tiny fraction of the range of possible z arguments values. - - -[h4:implemention Implementation] +[h4:implementation Implementation] There are many previous implementations with increasing accuracy and speed. See references below. @@ -311,20 +316,35 @@ To allow users to vary the precision from `float` to `long double` these are com The FORTRAN version and translation only permits the z argument to be the largest items in these lookup arrays, `wm0s[64] = 3.99049`, producing an error message and returning `NaN`. -So 64 is the largest possible value returned from the `lambert_w0` function. +So 64 is the largest possible value ever returned from the `lambert_w0` function. This is far from the `std::numeric_limits<>::max()` for even `float`s. +Therefore this implementation uses an approximation or 'guess' and Halley's method to refine the result. +Logarithmic approximation is discussed at length by R.M.Corless at el. +Here we use the first two terms of equation 4.19: -For the less well-behaved regions for Lambert W0 ['z] arguments near zero, -and near the branch singularity at -1/e, some series functions are provided. + T lz = log(z); + T llz = log(lz); + guess = lz - llz + (llz / lz); -For Lambert W-1 branch, tiny values very near zero where W > 64 cannot be computed using the lookup table. +This gives a useful precision, and this guess can be returned by setting the precision to `digits2 == 11` or less. + + using boost::math::policies::digits2; + double z = z = 4.e+29; + r = lambert_w0(z, policy >()); + // lambert_wm1(3.9999999999999997e+29, policy >() ) = 64.001325187470187 + +Analogously, for Lambert W-1 branch, tiny values very near zero, W > 64 cannot be computed using the lookup table. For this region, an approximation followed by a few (usually 3) Halley refinements. See __lambert_w_wm1_near_zero. So, as usual, there are compromises to consider between execution speed and accuracy. -This implementation allows users to get closer than Fukushima, at some small loss of speed -(but does not guarantee the nearest representable result) -or to get faster but less precise evalutions controlled by __precision_policy. +This implementation allows users to get closer to zero (W-1) or larger (W0) than Fukushima, +at some small loss of speed (but does not guarantee the nearest representable result) +or to get faster but less precise evaluations controlled by __precision_policy. + +For the less well-behaved regions for Lambert W0 ['z] arguments near zero, +and near the branch singularity at -1/e, some series functions are used. + [h4:small_z Small values of argument z near zero] @@ -484,8 +504,10 @@ and will give a message like: Argument z = -4.9406564584124654e-324 is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch! -Denormalized values of z are not supported (because not all floating-point types denormalize), +Denormalized values of z are not supported for Lambert W-1 (because not all floating-point types denormalize), and anyway it only covers a tiny fraction of the range of possible z arguments values. +A domain_error exception is thrown. (This behaviour might be changed to return infinity, as for z == 0. + diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index b250d4411..9f0cbc998 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -14,6 +14,9 @@ and its author's FORTRAN code, and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si based on the algorithm and a FORTRAN version of Toshio Fukushima. +// TODO use this to insert into lmabert_w.qbk + +//[boost_math_instrument_lambert_w_macros Some macros that will show some (or much) diagnostic values if #defined. #define-able macros @@ -24,6 +27,7 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_W0 // Halley refinement diagnostics only for W0 branch. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_WM1 // Halley refinement diagnostics only for W-1 branch. BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26 +BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE // K > 64, z > 3.9904954117194348e+29 BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. @@ -31,6 +35,7 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of series for small z. #define BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from lookup table. +//] [/boost_math_instrument_lambert_w_macros] */ #ifndef BOOST_MATH_SF_LAMBERT_W_HPP @@ -935,7 +940,14 @@ if (diff == 0) // Exact result - common. const char* function = "boost::math::lambert_w0()"; // Used for error messages. // Test for edge and corner cases first: - if (boost::math::isnan(z)) + // denormal is probably OK for W0 branch ? + /* if (!boost::math::isnormal(z)) + { + return policies::raise_domain_error(function, + "Argument z is denormalized!", + z, pol); + } + */ if (boost::math::isnan(z)) { return policies::raise_domain_error(function, "Argument z is NaN!", @@ -1011,7 +1023,48 @@ if (diff == 0) // Exact result - common. // z < -1/e else // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Bisection and Schroeder (and Halley). { + if (z > lambert_w_lookup::w0s[63]) // g[63] = 3.9904954117194348e+29 + { // so cannot use lookup table. + T guess; // bisect largest possible g[63] Gk[=64] (for lookup_t type) + // + // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996. + // François Chapeau-Blondeau and Abdelilah Monir + // Numerical Evaluation of the Lambert W Function + // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002 + // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf + // Estimate Lambert W using ln(z) ... + // This is roughly the power of ten * ln(10) ~= 2.3, n ~= 10^n + // and improve by adding a second term ln(ln(z)) + T lz = log(z); + T llz = log(lz); + guess = lz - llz + (llz / lz); // Corless equation 4.19, page 349 and Chapeau-Blondeau equation 20, page 2162. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "z = " << z << ", guess = " << guess << ", ln(z) = " << lz << ", ln(-ln(z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl; + // z = 3.9999999999999997e+29, guess = 64.001325187470187, ln(z) = 68.161262057947212, ln(-ln(z) = 4.2218763984580194, llz/lz = 0.061939527980993024 + // After 3 Halley iterations: lambert_w0(3.9999999999999997e+29) = 64.002342375637951 + + int d10 = policies::digits_base10(); // policy template parameter digits10 + int d2 = policies::digits(); // digits base 2 from policy. + std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 + << std::endl; + std::cout.precision(saved_precision); + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE + if (policies::digits() < 12) + { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12. + return guess; + } + // else refine for higher precision. + T result = halley_update(guess, z, pol); + return result; + + // Or could throw an exception here. + //// G[k=64] == g[63] == + //return policies::raise_domain_error(function, 3.9999999999999997e+29 + // "Argument z = %1% is too small (< 3.9904954117194348e+29) !", + // z, pol); + } /////////////////////////////////////////////////////////// // TODO take this table out as a templated function, // to avoid potential multithreading initialization problems. @@ -1285,14 +1338,23 @@ if (diff == 0) // Exact result - common. BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. - using boost::math::tools::max_value; + using boost::math::tools::max_value; const char* function = "boost::math::lambert_wm1()"; // Used for error messages. if (z == static_cast(0)) { // z is exactly zero.return -std::numeric_limits::infinity(); return -std::numeric_limits::infinity(); - } + } + if (std::numeric_limits::has_denorm) + { // All real types except arbitrary precision. + if( !boost::math::isnormal(z)) + { // Almost zero - might also just return infinity like z == 0? + return policies::raise_domain_error(function, + "Argument z = %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)", + z, pol); + } + } if (z > static_cast(0)) { // return policies::raise_domain_error(function, @@ -1429,8 +1491,8 @@ if (z > g[63]) // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002 // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf // Estimate Lambert W using ln(-z) ... -// This is roughly the power of ten * ln(10) ~= 2.3. n ~= 10^n -// and improve by adding a second term -ln(ln(-z)) + // This is roughly the power of ten * ln(10) ~= 2.3. n ~= 10^n + // and improve by adding a second term -ln(ln(-z)) T lz = log(-z); T llz = log(-lz); guess = lz - llz + (llz/lz); // Chapeau-Blondeau equation 20, page 2162. @@ -1457,9 +1519,6 @@ if (z > g[63]) // "Argument z = %1% is too small (< -1.02643897e-26) !", // z, pol); } - - - // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. // Bracketing sequence n = (2, 4, 8, 16, 32, 64) for W-1 branch. // Since z is probably quite small, start with lowest n (=2). diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 8ca0deb5d..e46a6550d 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -26,14 +26,14 @@ using boost::multiprecision::cpp_dec_float_50; #include //#include // If available. #include // isnan, ifinite. -#include "test_value.hpp" // Macro BOOST_MATH_TEST_VALUE for create_test_value. - -//#define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for much Lambert_w diagnostic output. -// See lambert_w.hpp for list of instrumentation macros. +#include +#include +using boost::math::policies::digits2; #include // For Lambert W lambert_w function. using boost::math::lambert_w0; using boost::math::lambert_wm1; + #include #include #include @@ -243,7 +243,12 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error); } - // Some tests of Lambert W-1 branch. + if (std::numeric_limits::has_denorm == true) + { // Might also return infinity like z == 0? + BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::denorm_min()), std::domain_error); + } + + // Some tests of Lambert W-1 branch. BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 at the singularity branch point. lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), @@ -325,8 +330,7 @@ void test_spots(RealType) if (std::numeric_limits::has_infinity) { - BOOST_CHECK_EQUAL(lambert_wm1(0.L), -std::numeric_limits::infinity()); - + BOOST_CHECK_EQUAL(lambert_wm1(0), -std::numeric_limits::infinity()); } if (std::numeric_limits::has_quiet_NaN) { @@ -335,6 +339,24 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error); } + // Just right and Too big for lookup + + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348e+29)), + BOOST_MATH_TEST_VALUE(RealType, 64.0), + tolerance); +// Just too big, so using log approx and Halley refinement. + + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29)), + BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677), + tolerance); + // reduced precision + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29), policy >()), + BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677), + // tolerance * 1e10); // Fails + 0.00002); // 0.00001 fails. + + + // N[productlog(-1, -10 ^ -26), 50] = -31.067172842017230842039496250208586707880448763222 //BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-26)), From 3c3c91709f80c06532f1772d1cbdc1233014573a Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 2 Nov 2017 18:47:30 +0000 Subject: [PATCH 20/71] w-1 branch improvements and tests OK --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 7 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 6 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 13 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 79 +-- .../math/special_functions/lambert_w.hpp | 557 ++++++++++-------- .../lambert_w_lookup_table.ipp | 133 +++++ include/boost/math/tools/test_value.hpp | 120 ++++ test/lambert_w_lookup_table_generator.cpp | 466 +++++++++++++++ test/test_lambert_w.cpp | 220 ++++--- 14 files changed, 1262 insertions(+), 349 deletions(-) create mode 100644 include/boost/math/special_functions/lambert_w_lookup_table.ipp create mode 100644 include/boost/math/tools/test_value.hpp create mode 100644 test/lambert_w_lookup_table_generator.cpp diff --git a/doc/html/index.html b/doc/html/index.html index 120f79b95..09f08bfd8 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: October 28, 2017 at 17:34:54 GMT

        Last revised: October 31, 2017 at 18:07:04 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index b8122742f..374654531 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -2069,7 +2069,10 @@

      • message

        -
        +

      • min

        diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index e59d10d27..633667de3 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        • -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index d11b8f5d0..b8532c651 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        @@ -212,6 +212,10 @@

        lognormal

        +
      • +

        lookup_t

        +
        +
        • N diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 7ff378a82..dedad38b5 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index aae4abbdc..15b7b930e 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -4843,6 +4843,8 @@

      • lambert_w0

      • lambert_wm1

      • ln

        • +

      • lookup_t

        • +

      • message

      • range

      • refinement

      • small

        • @@ -5220,6 +5222,10 @@
      • +

        lookup_t

        +
        +
        • +

      • lrint

        • - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 6011a2fa5..4eb7ed192 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 10611afda..644e6fa56 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -199,15 +199,23 @@ or defined in a jamfile.v2: `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` [h5:w0_edges w0 Branch] +The range mathematically is -exp(-1) <= z <= 0, but numerically, + +* `z == -exp(-1)` (for the type T) returns exactly -1. +* `z < -exp(-1)` throws a `domain_error`, and/or return `NaN` according to the policy. +Provides that there is a `catch` clause, an error message (similar to that below) will report. +* `z == (std::numeric_limits::max)()` returns W for the floating_point type T, (for example, for `double`, 703.22703310477018L) +* `z == std::numeric_limits::infinity()` returns infinity (if available). + [h5:wm1_edges w-1 Branch] -The range mathematically is -exp(-1) <= z <=0, but numerically, +The range mathematically is -exp(-1) <= z <= 0, but numerically, * `z == -exp(-1)` (for the type T) returns exactly -1. * `z == 0` returns infinity (or the nearest equivalent if `std::has_infinity == false`). -* `z == std::numeric_limits::min()` returns the maximum possible value of Lambert W for the type T.[br] -For example, for `double`: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634[br] -and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 +* `z == std::numeric_limits::min()` returns the maximum possible value of Lambert W for the type T. [br] +For example, for `double`: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 [br] +and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 [br] * `z < std::numeric_limits::min()`, means that z is denormalized (if `std::numeric_limits::has_denorm_min == true`), for example: @@ -220,8 +228,9 @@ and will give a message like: Argument z = -4.9406564584124654e-324 is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch! -Denormalized values of z are not supported (because not all floating-point types denormalize), +Denormalized values of z are not supported for Lambert W-1 (because not all floating-point types denormalize), and anyway it only covers a tiny fraction of the range of possible z arguments values. +A domain_error exception is thrown. (This behaviour might be changed to return infinity, as for z == 0. [h4:implementation Implementation] @@ -303,6 +312,33 @@ with a known small error bound over nearly all the range of ['z] argument. However, though these give results within several epsilon of the nearest representable result, they do not get as close as is often possible with further refinement, usually to within one or two epsilon. +A mean difference was computed to express the typical error and is often about 0.5 epsilon. + +For speed during the bisection, Fukushima produces lookup tables of powers of e and z for integral Lambert W. +There are 64 elements in these tables. The FORTRAN version (and the C++ translation by Veberic) +computed these (once) as `static` data. This is slower, may cause trouble with multithreading, and +is slightly inaccurate because of rounding errors from repeated(64) multiplications. In this implementation +the values are computed using __multiprecision 50 decimal digit and output as arrays 37 decimal digit long literals. + + std::cout.precision(std::numeric_limits::max_digits10); + +The arrays are as const and static as possible, using BOOST_STATIC_CONSTEXPR macro. +(See [@../test/lambert_w_lookup_table_generator.cpp lambert_w_lookup_table_generator.cpp] +The precision was chosen to ensure that if used as `long double` arrays, +then the values output to +[@ ../include/boost/math/special_functions/lambert_w_lookup_table.ipp lambert_w_lookup_table.ipp] +will be the nearest representable value for the type chose by a `typedef` in +[@..include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp]. + + typedef double lookup_t; // Type for lookup table (`double` or `float`, or even `long double`?) + +This is to allow for future use at higher precision, up to platforms that use 128-bit +(hardware or software) for `long double`. + +The accuracy of the tables was confirmed using __wolfram and agrees at the 37th decimal place, +so ensuring that the value is read into even `long double` to the nearest representation. + +[h5:higher_precision Higher precision] For types more precise than `double`, Fukushima shows that it is best to use the `double` estimate as a starting point followed by refinement using __halley iterations or other methods. @@ -445,7 +481,8 @@ Fukushima implmentation used 20 series terms and it was confirmed that using mor [h5:wm1_near_zero Lambert W-1 arguments values very near zero.] -The lookup tables of Fukushima have only 64 elements, so that the z argument nearest zero is -1.0264389699511303e-26, +The lookup tables of Fukushima have only 64 elements, +so that the z argument nearest zero is -1.0264389699511303e-26, that corresponds to a maximum Lambert W-1 value of 64.0. His implementation did not cater for z argument values that are smaller (nearer to zero), but this implementation adds code to accept smaller (but not denormalised) values of z. @@ -479,36 +516,6 @@ the computational cost of the log functions was easily paid by far fewer iterati double r = lambert_wm1(z, policy >()); // lambert_wm1(-1.0000000000000000e-26) = -64.026509628385895 -[h4:edge_cases Edge and Corner cases] - -[h5:w0_edges w0 Branch] - -[h5:wm1_edges w-1 Branch] - -The range mathematically is -exp(-1) <= z <=0, but numerically, - -* `z == -exp(-1)` (for the type T) returns exactly -1. -* `z == 0` returns infinity (or the nearest equivalent if `std::has_infinity == false`). -* `z == std::numeric_limits::min()` returns the maximum possible value of Lambert W for the type T. [br] -For example, for `double`: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 [br] -and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 [br] - -* `z < std::numeric_limits::min()`, means that z is denormalized (if `std::numeric_limits::has_denorm_min == true`), -for example: - - r = lambert_wm1(std::numeric_limits::denorm_min()); - -and will give a message like: - - Error in function boost::math::lambert_wm1(): - Argument z = -4.9406564584124654e-324 is too small - (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch! - -Denormalized values of z are not supported for Lambert W-1 (because not all floating-point types denormalize), -and anyway it only covers a tiny fraction of the range of possible z arguments values. -A domain_error exception is thrown. (This behaviour might be changed to return infinity, as for z == 0. - - diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 9f0cbc998..a8fef9a86 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -14,16 +14,15 @@ and its author's FORTRAN code, and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si based on the algorithm and a FORTRAN version of Toshio Fukushima. -// TODO use this to insert into lmabert_w.qbk - -//[boost_math_instrument_lambert_w_macros Some macros that will show some (or much) diagnostic values if #defined. +//[boost_math_instrument_lambert_w_macros -#define-able macros +// #define-able macros BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION // Precision. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_W0 // Halley refinement diagnostics only for W0 branch. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_WM1 // Halley refinement diagnostics only for W-1 branch. BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26 @@ -34,7 +33,8 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision t BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of series for small z. -#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from lookup table. +BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from W0 lookup table. +BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table. //] [/boost_math_instrument_lambert_w_macros] */ @@ -74,14 +74,13 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of typedef double lookup_t; // Type for lookup table (double or float, or even long double?) -#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp" -// #include "lambert_w_lookup_table.ipp" // TODO copy final version. +//#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp" + #include "lambert_w_lookup_table.ipp" // boost.Math version. namespace boost { namespace math -{ - +{ namespace detail { @@ -293,25 +292,26 @@ namespace math ///////////////////////////////////////////////////////////////////////////////////////////// //! Series expansion used near zero (abs(z) < 0.05). - // Coefficients of the inverted series expansion of the Lambert W function around z = 0. - // Tosio Fukushima always uses all 17 terms of a Taylor series computed using Wolfram with - // InverseSeries[Series[z Exp[z],{z,0,17}]] - // Tosio Fukushima / Journal of Computational and Applied Mathematics 244 (2013) page 86. + //! \details + //! Coefficients of the inverted series expansion of the Lambert W function around z = 0. + //! Tosio Fukushima always uses all 17 terms of a Taylor series computed using Wolfram with + //! InverseSeries[Series[z Exp[z],{z,0,17}]] + //! Tosio Fukushima / Journal of Computational and Applied Mathematics 244 (2013) page 86. - // InverseSeries[Series[z Exp[z],{z,0,34}]] also computed. + //! Decimal values of specifications for built-in floating-point types below + //! are 21 digits precision == max_digits10 for long double. + //! Care Some coefficients might overflow some fixed_point types. - // Decimal values of specifications for built-in floating-point types below - // are 21 digits precision == max_digits10 for long double. - // TODO Might these overflow some fixed_point? + //! This version is intended to allow use by user-defined types like Boost.Multiprecision quad and cpp_dec_float types. + //! The three specializations below for built-in float, double + //! (and perhaps long double) will be chosen in preference for these types. - // This version is intended to allow use by user-defined types like Boost.Multiprecision quad and cpp_dec_float types. - // The three specializations below for built-in float, double (and perhaps long double) will be chosen in preference for these types. - - // This version uses rationals computed by Wolfram as far as possible, - // limited by maximum size of uLL integers. - // For higher term, uses decimal digit strings computed by Wolfram up to the maximum possible using uLL rationals, - // and then higher coefficients are computed as necessary using function lambert_w0_small_z_series_term - // until the precision required by the policy is achieved. + //! This version uses rationals computed by Wolfram as far as possible, + //! limited by maximum size of uLL integers. + //! For higher term, uses decimal digit strings computed by Wolfram up to the maximum possible using uLL rationals, + //! and then higher coefficients are computed as necessary using function lambert_w0_small_z_series_term + //! until the precision required by the policy is achieved. + //! InverseSeries[Series[z Exp[z],{z,0,34}]] also computed. // Series evaluation for LambertW(z) as z -> 0. // See http://functions.wolfram.com/ElementaryFunctions/ProductLog/06/01/01/0003/ @@ -323,21 +323,22 @@ namespace math //! but the optimum might be a function of the size of the type of z. //! \details - //! The tag_type selection is based on the value std::numeric_limits::max_digits10. + //! The tag_type selection is based on the value @c std::numeric_limits::max_digits10. //! This allows distinguishing between long double types that commonly vary between 64 and 80-bits, //! and also compilers that have a float type using 64 bits and/or long double using 128-bits. //! It assumes that max_digits10 is defined correctly or this might fail to make the correct selection. //! causing very small differences in computing lambert_w that would be very difficult to detect and diagnose. - //! Cannot switch on std::numeric_limits<>::max() because comparison values may overflow the compiler limit. - //! Cannot switch on std::numeric_limits::max_exponent10() because both 80 and 128 bit float use 11 bits for exponent. - //! So must rely on std::numeric_limits::max_digits10. + //! Cannot switch on @c std::numeric_limits<>::max() because comparison values may overflow the compiler limit. + //! Cannot switch on @c std::numeric_limits::max_exponent10() + //! because both 80 and 128 bit floating-point implmentations use 11 bits for the exponent. + //! So must rely on @c std::numeric_limits::max_digits10. //! Specialization of float zero series expansion used for small z (abs(z) < 0.05). //! Specializations of lambert_w0_small_z for built-in types. //! These specializations should be chosen in preference to T version. //! For example: lambert_w0_small_z(0.001F) should use the float version. - // Policy is not used by built-in types when all terms are used during an inline computation, - // but for the ta_type selection to work, they all must include Policy the their signature. + //! (Parameter Policy is not used by built-in types when all terms are used during an inline computation, + //! but for the tag_type selection to work, they all must include Policy in their signature. // Forward declaration of variants of lambert_w0_small_z. template @@ -353,7 +354,7 @@ namespace math T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&); // for float128 template - T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&); // Generic multiprecision. + T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&); // Generic multiprecision T. // Set tag_type depending on max_digits10. template @@ -534,7 +535,7 @@ namespace math T term; }; // template struct lambert_w0_small_z_series_term - //! Generic variant for User-defined types like Boost.Multiprecision. + //! Generic variant for T a User-defined types like Boost.Multiprecision. template inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&) { @@ -714,8 +715,6 @@ namespace math T expw0 = exp(w0); // Compute z == W * exp(W); from best Lambert W estimate so far. // Hope that w0 * expw0 == z; T diff = (w0 * expw0) - z; // Difference from argument z. - // std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl; - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10); // Save. std::cout.precision(std::numeric_limits::max_digits10); // Show all posssibly significant digits. @@ -725,7 +724,7 @@ namespace math std::cout.precision(precision); // Restore. std::cout.flags(flags); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY -if (diff == 0) // Exact result - common. + if (diff == 0) // Exact result - common. { return w0; } @@ -853,15 +852,15 @@ if (diff == 0) // Exact result - common. } // Halley do while //! Schroeder method, fifth-order update formula, see T. Fukushima page 80-81, and - // A. Householder, The Numerical Treatment of a Single Nonlinear Equation, - // McGraw-Hill, New York, 1970, section 4.4. - // Switch to schroeder_update after a pre-computed jb/jmax bisections, - // chosen to ensure that the result will be achieve the +/- 10 epsilon target. + //! A. Householder, The Numerical Treatment of a Single Nonlinear Equation, + //! McGraw-Hill, New York, 1970, section 4.4. + //! Switch to schroeder_update after a pre-computed jb/jmax bisections, + //! chosen to ensure that the result will be achieve the +/- 10 epsilon target. //! \param w Lambert w estimate from bisection. //! \param y bracketing value from bisection. //! \returns Refined estimate of Lambert w. - // Schroeder refinement, called unless not required by precision policy. + // Schroeder refinement, called unless NOT required by precision policy. template inline T schroeder_update(const T w, const T y) @@ -872,11 +871,21 @@ if (diff == 0) // Exact result - common. // w is estimate of Lambert W (from bisection or series). // y is z * e^-w -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER + BOOST_MATH_STD_USING // Aid argument dependent lookup of abs. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); using boost::math::float_distance; T fd = float_distance(w, y); - std::cout << "Pre-Schroder Distance = " << static_cast(fd) << std::endl; + std::cout << "Bisect (Pre-Schroder) Distance = "; + if (abs(fd) < 214748000.) + { + std::cout << static_cast(fd); + } + else + { + std::cout << "big."; + } + std::cout << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER const T f0 = w - y; // f0 = w - y. @@ -926,6 +935,8 @@ if (diff == 0) // Exact result - common. // Integral types should been promoted to double by user Lambert w functions. BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: lambert_w0(1.), not lambert_w0(1)!"); + const char* function = "boost::math::lambert_w0()"; // Used for error messages. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 { std::size_t saved_precision = std::cout.precision(std::numeric_limits::max_digits10); @@ -937,9 +948,7 @@ if (diff == 0) // Exact result - common. } #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 - const char* function = "boost::math::lambert_w0()"; // Used for error messages. - - // Test for edge and corner cases first: + // Check for edge and corner cases first: // denormal is probably OK for W0 branch ? /* if (!boost::math::isnormal(z)) { @@ -947,12 +956,13 @@ if (diff == 0) // Exact result - common. "Argument z is denormalized!", z, pol); } - */ if (boost::math::isnan(z)) + */ + if (boost::math::isnan(z)) { return policies::raise_domain_error(function, "Argument z is NaN!", z, pol); - } + } // isnan if (boost::math::isinf(z)) { if (std::numeric_limits::has_infinity) @@ -967,18 +977,11 @@ if (diff == 0) // Exact result - common. //return policies::raise_domain_error(function, // "Argument z is infinite!", // z, pol); - } - if (z > (std::numeric_limits::max)()/4) - { // TODO not sure this is right - what is largest possible for which can compute Lambert_w0? - return policies::raise_domain_error(function, - "Argument z %1% is too big!", - z, pol); - // Or could we return a suitable large value, computed from RealType T? - } + } // isinf BOOST_MATH_STD_USING // Aid argument dependent lookup of abs. if (abs(z) <= static_cast(0.05)) - { // z is near zero, so use near-zero series expansion. + { // z is near zero, so use small z/near-zero series expansion. // Change to use this series approximation made by Fukushima at 0.05, // found by trial and error, and may not be best for higher precision. // Chose float, double, or long double, or multiprecision specializations. @@ -1021,19 +1024,20 @@ if (diff == 0) // Exact result - common. } } // z < -0.35 // z < -1/e - else // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Bisection and Schroeder (and Halley). - { - if (z > lambert_w_lookup::w0s[63]) // g[63] = 3.9904954117194348e+29 - { // so cannot use lookup table. - T guess; // bisect largest possible g[63] Gk[=64] (for lookup_t type) - // + else + { //! Check if z so big that cannot use lookup table, so approximate and Halley iterate. + // std::cout << " lambert_w_lookup::w0zs[63] " << lambert_w_lookup::w0zs[63] << ' ' << lambert_w_lookup::w0zs[64] << std::endl; + // lambert_w_lookup::w0zs[63] = 1.4450833904658542e+29, lambert_w_lookup::w0zs[64]= 3.9904954117194348e+29, + if (z >= lambert_w_lookup::w0zs[lambert_w_lookup::noof_w0zs - 1]) // F[64] = 3.9904954117194348e+29 + { //! z so big that cannot use lookup table, so approximate and Halley iterate. + T guess; // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996. // François Chapeau-Blondeau and Abdelilah Monir // Numerical Evaluation of the Lambert W Function // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002 // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf // Estimate Lambert W using ln(z) ... - // This is roughly the power of ten * ln(10) ~= 2.3, n ~= 10^n + // This is roughly the power of ten * ln(10) ~= 2.3, n ~= 10^n // and improve by adding a second term ln(ln(z)) T lz = log(z); T llz = log(lz); @@ -1060,11 +1064,15 @@ if (diff == 0) // Exact result - common. return result; // Or could throw an exception here. - //// G[k=64] == g[63] == + //// G[k=64] == g[63] == //return policies::raise_domain_error(function, 3.9999999999999997e+29 - // "Argument z = %1% is too small (< 3.9904954117194348e+29) !", + // "Argument z = %1% is too small (< 3.9904954117194348e+29) !", // z, pol); - } + } // Too big for lookup table. + + // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Bisection and Schroeder (and Halley). + + /////////////////////////////////////////////////////////// // TODO take this table out as a templated function, // to avoid potential multithreading initialization problems. @@ -1077,10 +1085,10 @@ if (diff == 0) // Exact result - common. // e and g have space for 64-bit reals. /* - static const size_t noof_wm1s = 66; - static T e[noof_wm1s]; // lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 - static const size_t noof_w0s = 65; - static T g[noof_w0s]; // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. + static const size_t noof_wm1zs = 66; + static T e[noof_wm1zs]; // lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 + static const size_t noof_w0zs = 65; + static T g[noof_w0zs]; // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. // lambert_w0(2.77182) == 1.; // lambert_w0(14.7700) == 2.; // lambert_w0(2.77182) == 3.; @@ -1102,7 +1110,7 @@ if (diff == 0) // Exact result - common. e[0] = boost::math::constants::e(); // e = 2.7182 e[1] = 1; g[0] = 0; // G[k] for W0 branch. - for (int j = 1, jj = 2; jj != noof_wm1s; ++jj) + for (int j = 1, jj = 2; jj != noof_wm1zs; ++jj) { e[jj] = e[j] * boost::math::constants::exp_minus_one(); // For W-1 branch. // exp(-1) - 1/e exp_minus_one = 0.36787944. @@ -1144,7 +1152,7 @@ if (diff == 0) // Exact result - common. if (std::numeric_limits::digits > 53) { // T is more precise than 64-bit double (or long double, or ?), - // so compute an approximate value using only one Schroeder refinement, + // so recurse to compute an approximate double value using only one Schroeder refinement, // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50 // because are next going to use Halley refinement at full/high precision using this as an approximation). using boost::math::policies::precision; @@ -1155,27 +1163,29 @@ if (diff == 0) // Exact result - common. T double_approx = static_cast(lambert_w0_imp(static_cast(z), policy >())); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << result << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 - // Perform additional Halley refinement(s) to ensure that +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN + // Perform additional few Halley refinement(s) to ensure that // get a near as possible to correct result (usually +/- one epsilon). T result = halley_update(double_approx, z, pol); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl; + std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl; std::cout.precision(saved_precision); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 return result; } // digits > 53 - higher precision than double. else // T is double or less precision. { - // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. + // Use a lookup table using namespace boost::math::detail::lambert_w_lookup; + // to find the nearest integer part of Lambert W to use as starting point for Bisection, // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch. - // Since z is probably quite small, start with lowest (n = 0). - int n; // Indexing W0 lookup table w0s[n] of z. + // Since z is probably quite small, start with lowest (n = 0), + // up to largest possible F[k=64] for lookup_t type). + int n; // Indexing W0 lookup table w0zs[n] of z. for (n = 0; n <= 2; ++n) { // Try 1st few. - if (w0s[n] > z) + if (w0zs[n] > z) { // goto bisect; } @@ -1183,20 +1193,21 @@ if (diff == 0) // Exact result - common. n = 2; for (int j = 1; j <= 5; ++j) { - n *= 2; // Try bigger steps. - if (w0s[n] > z) // z <= w0s[n] + n *= 2; // Try bigger, and bigger steps. + if (w0zs[n] > z) // z <= w0zs[n] { - goto overshot; // + goto overshot; // Need to backup! } } // for // get here if //std::cout << "Too big " << z << std::endl; //// else z too large :-( //const char* function = "boost::math::lambert_w0()"; + // This should not now occur (> largest lookup now handled) so should be a logic error? + std::cout << "W = " << n << ", w0zs[n]" << w0zs[n] << ' ' << w0zs[n+1] << ", z = " << z << std::endl; return policies::raise_domain_error("boost::math::lambert_w0()", - "Argument z = %1% is too large!", + "Argument z = %1% is too large! (Should not occur, please report.)", z, pol); - overshot: { int nh = n / 2; @@ -1207,7 +1218,7 @@ if (diff == 0) // Exact result - common. { break; } - if (w0s[n - nh] > z) + if (w0zs[n - nh] > z) { n -= nh; } @@ -1215,36 +1226,29 @@ if (diff == 0) // Exact result - common. } bisect: - --n; // w0s[n] is nearest below, so n is integer part of W, - // and w0s[n+1] is next integral part of W. - + --n; // w0zs[n] is nearest below, so n is integer part of W, + // and w0zs[n+1] is next integral part of W. // These are used as initial values for bisection. +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP + std::cout << "Result lookup W0(" << z << ") bisection between w0zs[" << n << "] = " << w0zs[n] << " and w0zs[" << n << "] = " << w0zs[n+1] + << ", bisect mean = " << (w0zs[n - 1] + w0zs[n]) / 2 << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP - // typedef typename policies::precision::type prec; - //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. - // Check precision specified by policy. - //int digits2 = policies::digits(); - //std::cout << "digits2 = " << digits2 << std::endl; // digits = 24 for float. - - // for example = 1 from lambert_w(x, policy >() - int d2 = policies::digits(); // digits base 2 from policy. -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + // Check precision specified by policy in case can return early. + // Use can set precision, for example = 7 from lambert_w0(x, policy >() or lambert_w0(x, policy >() + int d2 = policies::digits(); // digits base 2 from policy (default 24 for float, 53 for double). +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION int d10 = policies::digits_base10(); // policy template parameter digits10 std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 - -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP - std::cout << "Result lookup W(" << z << ") bisection between w0s[" << n - 1 << "] = " << w0s[n - 1] << " and w0s[" << n << "] = " << w0s[n] - << ", bisect mean = " << (w0s[n - 1] + w0s[n]) / 2 << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP - +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION if (d2 <= 7) - { // Only 7 binary digits precision required to hold integer size of w0s[65], + { // Only 7 binary digits precision required to hold integer size of w0zs[65], // so just return the mean of two nearby integral values. // This is a *very* approximate estimate, and perhaps not very useful? - return static_cast((w0s[n - 1] + w0s[n]) / 2); + return static_cast((w0zs[n - 1] + w0zs[n]) / 2); } + // Compute the number of bisections (jmax) that ensure that result is close enough that // a single 5th order Schroeder update is sufficient to achieve near double (53-bit) accuracy. int jmax = 8; // Assume minimum number of bisections will be needed (most common case). @@ -1264,18 +1268,18 @@ if (diff == 0) // Exact result - common. { // Small z, so need just 1 extra bisection. jmax = 9; } - lookup_t dz = static_cast(z); + lookup_t dz = static_cast(z); // Only use lookup_t precision, default double, for bisection. - // Use Halley refinement for higher precisions. + // Use Halley refinement for higher precisions. // Perform the jmax fractional bisections for necessary precision. // Avoid using exponential function for speed. - lookup_t w = static_cast(n); // Equation 25, Integral Lambert W. - // lookup_t y = dz * e[n + 1]; // Integral +1 Lambert W. - lookup_t y = dz * static_cast(wm1s[n + 1]); // Equation 26, Integral +1 Lambert W. + lookup_t w = static_cast(n); // Fukushima Equation 25, Integral Lambert W. + // lookup_t y = dz * e[n + 1]; // Fukushima Integral +1 Lambert W. + lookup_t y = dz * static_cast(w0es[n + 1]); // Fukushima Equation 26, Integral +1 Lambert W. for (int j = 0; j < jmax; ++j) { // Equation 27. const lookup_t wj = w + static_cast(halves[j]); // Add 1/2, 1/4, 1/8 ... - const lookup_t yj = y * static_cast(sqrts[j]); // Multiply by sqrt(1/e), ... + const lookup_t yj = y * static_cast(sqrtw0s[j]); // Multiply by sqrt(1/e), ... if (wj < yj) { w = wj; @@ -1318,7 +1322,7 @@ if (diff == 0) // Exact result - common. } // more than 10 digits2 } } // normal range and precision. - throw std::logic_error("No result from lambert_w0_imp"); // Should never get here. + throw std::logic_error("No result from lambert_w0_imp! (Please report)."); // Should never get here. } // T lambert_w0_imp(const T z, const Policy& /* pol */) //! Lambert W for W-1 branch, -max(z) < z <= -1/e. @@ -1348,22 +1352,22 @@ if (diff == 0) // Exact result - common. } if (std::numeric_limits::has_denorm) { // All real types except arbitrary precision. - if( !boost::math::isnormal(z)) + if (!boost::math::isnormal(z)) { // Almost zero - might also just return infinity like z == 0? - return policies::raise_domain_error(function, - "Argument z = %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)", - z, pol); + return policies::raise_domain_error(function, + "Argument z = %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)", + z, pol); } } if (z > static_cast(0)) - { // + { // return policies::raise_domain_error(function, "Argument z = %1% is out of range (z > 0) for Lambert W-1 branch! (Try Lambert W0 branch?)", z, pol); } - if(z > -(std::numeric_limits::min)()) - { // z is denormalized, so cannot be computed. - // -std::numeric_limits::min() is smallest for type T, + if (z > -(std::numeric_limits::min)()) + { // z is denormalized, so cannot be computed. + // -std::numeric_limits::min() is smallest for type T, // for example, for double: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 return policies::raise_domain_error(function, "Argument z = %1% is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch!", @@ -1397,9 +1401,10 @@ if (diff == 0) // Exact result - common. z, pol); } // if (z < -0.35) + /* // Create static arrays of Lambert Wm1 function // TODO these are NOT the same size or values as the w0 constant array values????? - + // double LambertW0(const double z) // static double e[66]; // static double g[65]; @@ -1414,17 +1419,17 @@ if (diff == 0) // Exact result - common. // G[k] is 1 <= k <= 64 so size is 64 // So e and F are not the same! - static const size_t noof_wm1s = 64; + static const size_t noof_wm1zs = 64; - static lookup_t e[noof_wm1s]; // e[0] to e[63] - static lookup_t g[noof_wm1s]; // g[0] == Gk when k = 1, to g[63] == Gk=64 + static lookup_t e[noof_wm1zs]; // e[0] to e[63] + static lookup_t g[noof_wm1zs]; // g[0] == Gk when k = 1, to g[63] == Gk=64 static lookup_t a[noof_sqrts]; static lookup_t b[noof_sqrts]; if (!e[0]) { const lookup_t e1 = 1 / boost::math::constants::e(); - lookup_t ej = e1; // 1/e= 0.36787945 + lookup_t ej = e1; // 1/e= 0.36787945 e[0] = boost::math::constants::e(); g[0] = -e1; for (int j = 0, jj = 1; jj < 64; ++jj) @@ -1438,7 +1443,7 @@ if (diff == 0) // Exact result - common. b[0] = static_cast(0.5); for (int j = 0, jj = 1; jj < noof_sqrts; ++jj) { - a[jj] = sqrt(a[j]); + a[jj] = sqrt(a[j]); // b[jj] = b[j] * static_cast(0.5); b[jj] = b[j] / 2; // More efficient for multiprecision? j = jj; @@ -1460,44 +1465,41 @@ if (diff == 0) // Exact result - common. //print_collection(b, "b", " "); } // if (!e[0]) // static arrays filled. +*/ + using lambert_w_lookup::wm1es; + using lambert_w_lookup::wm1zs; + using lambert_w_lookup::noof_wm1zs; // size == 64 - // TODO move up when using precomputed array. - //if (abs(z) < abs(g[63])) + // std::cout <<" Wm1zs[63] (== G[64]) = " << " " << wm1zs[63] << std::endl; // Wm1zs[63] (== G[64]) = -1.0264389699511283e-26 + // Check that z argument value is not smaller than lookup_table G[64] + // std::cout << "(z > wm1zs[63]) = " << std::boolalpha << (z > wm1zs[63]) << std::endl; -if (z > g[63]) - { // z > -1.0264389699511303e-26 (but != 0 and >= std::numeric_limits::min() and so NOT denormalized). + if (z >= wm1zs[63]) // wm1zs[63] = -1.0264389699511282259046957018510946438e-26L W = 64.00000000000000000 + { // z >= -1.0264389699511303e-26 (but != 0 and >= std::numeric_limits::min() and so NOT denormalized). std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); - - // std::cout << "abs(z) " << abs(z) << ", abs(g[63] = " << abs(g[63]) << std::endl; - // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl; // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl; // -std::numeric_limits::min() = -1.1754943508222875e-38 // -std::numeric_limits::min() = -2.2250738585072014e-308 // N[productlog(-1, -1.1754943508222875 * 10^-38 ), 50] = -91.856775324595479509567756730093823993834155027858 - // N[productlog(-1, -2.2250738585072014e-308 * 10^-308 ), 50] = -1424.8544521230553853558132180518404363617968042942 + // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955 - T guess ; // bisect lowest possible Gk[=64] (for lookup_t type?) - - //int exponent = ilogb(z); - //std::cout << exponent << std::endl; - //guess = static_cast(exponent); - - // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996. + // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996. // François Chapeau-Blondeau and Abdelilah Monir // Numerical Evaluation of the Lambert W Function // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002 // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf // Estimate Lambert W using ln(-z) ... - // This is roughly the power of ten * ln(10) ~= 2.3. n ~= 10^n + // This is roughly the power of ten * ln(10) ~= 2.3. n ~= 10^n // and improve by adding a second term -ln(ln(-z)) + T guess; // bisect lowest possible Gk[=64] (for lookup_t type) T lz = log(-z); T llz = log(-lz); - guess = lz - llz + (llz/lz); // Chapeau-Blondeau equation 20, page 2162. -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY - std::cout << "z = " << z << ", guess = " << guess << ", ln(-z) = " << lz << ", ln(-ln(-z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl; + guess = lz - llz + (llz / lz); // Chapeau-Blondeau equation 20, page 2162. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY + std::cout << "z = " << z << ", guess = " << guess << ", ln(-z) = " << lz << ", ln(-ln(-z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl; // z = -1.0000000000000001e-30, guess = -73.312782616731482, ln(-z) = -69.077552789821368, ln(-ln(-z) = 4.2352298269101114, llz/lz = -0.061311231447304194 // z = -9.9999999999999999e-91, guess = -212.56650048504233, ln(-z) = -207.23265836946410, ln(-ln(-z) = 5.3338421155782205, llz/lz = -0.025738424423764311 // >z = -2.2250738585072014e-308, guess = -714.95942238244606, ln(-z) = -708.39641853226408, ln(-ln(-z) = 6.5630038501819854, llz/lz = -0.0092645920821846622 @@ -1505,7 +1507,7 @@ if (z > g[63]) int d2 = policies::digits(); // digits base 2 from policy. std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY if (policies::digits() < 12) { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12. return guess; @@ -1514,106 +1516,193 @@ if (z > g[63]) std::cout.precision(saved_precision); return result; - //// G[k=64] == g[63] == -1.02643897e-26 + // Was Fukushima + // G[k=64] == g[63] == -1.02643897e-26 //return policies::raise_domain_error(function, - // "Argument z = %1% is too small (< -1.02643897e-26) !", + // "Argument z = %1% is too small (< -1.02643897e-26) ! (Should not occur, please report.", // z, pol); - } - // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. - // Bracketing sequence n = (2, 4, 8, 16, 32, 64) for W-1 branch. - // Since z is probably quite small, start with lowest n (=2). - int n = 2; - if (g[n - 1] > z) + } // Z too small so use approximation and Halley. + // Else Use a lookup table to find the nearest integer part of Lambert W-1 as starting point for Bisection. + + if (std::numeric_limits::digits > 53) + { // T is more precise than 64-bit double (or long double, or ?), + // so compute an approximate value using only one Schroeder refinement, + // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50 + // because are next going to use Halley refinement at full/high precision using this as an approximation). + using boost::math::policies::precision; + using boost::math::policies::digits10; + using boost::math::policies::digits2; + using boost::math::policies::policy; + // Compute a 50-bit precision approximate W0 in a double (no Halley refinement). + T double_approx = static_cast(lambert_wm1_imp(static_cast(z), policy >())); + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN + std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << result << std::endl; + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1 + // Perform additional Halley refinement(s) to ensure that + // get a near as possible to correct result (usually +/- one epsilon). + T result = halley_update(double_approx, z, pol); + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1 + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl; + std::cout.precision(saved_precision); + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1 + return result; + } // digits > 53 - higher precision than double. + else // T is double or less precision. { - goto bisect; - } - for (int j = 1; j <= 5; ++j) - { - n *= 2; - if (g[n - 1] > z) + // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. + using namespace boost::math::detail::lambert_w_lookup; + // Bracketing sequence n = (2, 4, 8, 16, 32, 64) for W-1 branch. (0 is -infinity) + // Since z is probably quite small, start with lowest n (=2). + int n = 2; + if (wm1zs[n - 1] > z) { - goto overshot; + goto bisect; } - } - // else z < g[63] == -1.0264389699511303e-26, so Lambert W integer part > 64. - - // Might assign the lower bracket to -1.0264389699511303e-26 and upper to (std::numeric_limits::min)() -// and jump to schroeder to halley? But that would only allow use with lookup_t precision. - // So try using Halley direct? - return policies::raise_domain_error(function, - "Argument z = %1% is too small (< -1.026439e-26) !", - z, pol); - - overshot: - { - int nh = n / 2; for (int j = 1; j <= 5; ++j) { - nh /= 2; // halve step size. - if (nh <= 0) + n *= 2; + if (wm1zs[n - 1] > z) { - break; // goto bisect; - } - if (g[n - nh - 1] > z) - { - n -= nh; + goto overshot; } } - } - bisect: - --n; // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part. - - // Check precision specified by policy. - int d2 = policies::digits(); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W1 - std::cout << "digits2 = " << d2 << std::endl; // digits = 24 for float. -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1 - if (d2 < 5) - { // Only a very few digits2 required, so just return the floor integral part of Lambert_w. -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W1 - std::cout << "between g[" << n << "] = " << g[n] << " < " << z << " < " << g[n + 1] << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1 - return static_cast(n); - } - - // jmax is the number of bisections computed from n, - // such that a single application of the fifth-order Schroeder update formula - // after the bisections is enough to evaluate Lambert W-1 with 53-bit accuracy. - int jmax = 11; // Assume maximum number of bisections will be needed (most common case). - if (n >= 8) - { - jmax = 8; - } - else if (n >= 3) - { - jmax = 9; - } - else if (n >= 2) - { - jmax = 10; - } - // Bracketing, Fukushima section 2.3, page 82: - // (Avoid using exponential function for speed). - // Only use lookup_t precision, default double, for bisection (for speed). - lookup_t w = -static_cast(n); // Equation 25, - lookup_t y = static_cast(z * e[n - 1]); // Equation 26, - for (int j = 0; j < jmax; ++j) - { // Equation 27. - lookup_t wj = w - b[j]; // Subtract 1/2, 1/4, 1/8 ... - lookup_t yj = y * a[j]; // Multiply by sqrt(1/e), ... - if (wj < yj) + // else z < g[63] == -1.0264389699511303e-26, so Lambert W-1 integer part > 64. + // Might assign the lower bracket to -1.0264389699511303e-26 and upper to (std::numeric_limits::min)() + // and jump to schroeder to halley? But that would only allow use with lookup_t precision. + return policies::raise_domain_error(function, + "Argument z = %1% is too small (< -1.026439e-26) (logic error - please report!)", + z, pol); + // This should not now occur (should be caught by test above) so should be a logic_error? + overshot: { - w = wj; - y = yj; + int nh = n / 2; + for (int j = 1; j <= 5; ++j) + { + nh /= 2; // halve step size. + if (nh <= 0) + { + break; // goto bisect; + } + if (wm1zs[n - nh - 1] > z) + { + n -= nh; + } + } } - } // for j + bisect: + --n; // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part. + // These are used as initial values for bisection. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP + std::cout << "Result lookup W-1(" << z << ") bisection between wm1zs[" << n - 1 << "] = " << wm1zs[n - 1] << " and wm1zs[" << n << "] = " << wm1zs[n] + << ", bisect mean = " << (wm1zs[n - 1] + wm1zs[n]) / 2 << std::endl; + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP - T result = static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement. - // Only use Halley refinement (using exp) for higher precisions. - result = halley_update(result, z, pol); - return result; - } // template T lambert_wm1_imp(const T z) + // W0 version + // // Check precision specified by policy in case can return early. + // // Use can set precision, for example = 7 from lambert_w0(x, policy >() or lambert_w0(x, policy >() + // int d2 = policies::digits(); // digits base 2 from policy (default 24 for float, 53 for double). + //#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION + // int d10 = policies::digits_base10(); // policy template parameter digits10 + // std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 + // << std::endl; + //#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION + // if (d2 <= 7) + // { // Only 7 binary digits precision required to hold integer size of w0zs[65], + // // so just return the mean of two nearby integral values. + // // This is a *very* approximate estimate, and perhaps not very useful? + // return static_cast((w0zs[n - 1] + w0zs[n]) / 2); + // } + // Check precision specified by policy. + int d2 = policies::digits(); + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION + int d10 = policies::digits_base10(); // policy template parameter digits10 + std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 + << std::endl; + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION + if (d2 < 7) + { // Only 7 binary digits precision required to hold integer size of w0s[65], + // so just return the mean of two nearby integral values. + // This is a *very* approximate estimate, and perhaps not very useful? + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION + std::cout << "between wm1zs[" << n << "] = " << wm1zs[n + 1] << " <= " << z << " <= " << wm1zs[n] << std::endl; + // TODO check this. + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION + return static_cast((wm1zs[n] + wm1zs[n + 1]) / 2); + } // d2 < 7 + + // Compute jmax is the number of bisections computed from n, + // such that a single application of the fifth-order Schroeder update formula + // after the bisections is enough to evaluate Lambert W-1 with (near?) 53-bit accuracy. + // Fukushima established these by trial and error? + int jmax = 11; // Assume maximum number of bisections will be needed (most common case). + if (n >= 8) + { + jmax = 8; + } + else if (n >= 3) + { + jmax = 9; + } + else if (n >= 2) + { + jmax = 10; + } + // Bracketing, Fukushima section 2.3, page 82: + // (Avoid using exponential function for speed). + // Only use lookup_t precision, default double, for bisection (for speed). + // Use Halley refinement for higher precisions. + using lambert_w_lookup::halves; + using lambert_w_lookup::sqrtwm1s; + lookup_t w = -static_cast(n); // Equation 25, + lookup_t y = static_cast(z * wm1es[n - 1]); // Equation 26, + // Perform the jmax fractional bisections for necessary precision. + for (int j = 0; j < jmax; ++j) + { // Equation 27. + lookup_t wj = w - halves[j]; // Subtract 1/2, 1/4, 1/8 ... + lookup_t yj = y * sqrtwm1s[j]; // Multiply by sqrt(1/e), ... + if (wj < yj) + { + w = wj; + y = yj; + } + } // for j + if (d2 <= 10) + { // Only 10 digits2 required (== digits10 = 3 decimal digits precision), + // so just return the nearest bisection. + // (Might make this test depend on size of T?) + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION + std::cout << "Bisection estimate = " << w << " " << y << std::endl; + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION + return static_cast(w); // Bisection only. + } + else // More than 10 digits2 precision wanted, so continue with Fukushima's Schroeder refinement. + { + T result = static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement. + if (d2 <= (std::numeric_limits::digits - 3)) + { // Only enough digits2 required, so just return the Schroeder refined value. + // For example, for float, if (d2 <= 22) then + // digits-3 returns Schroeder result up to 3 bits might be wrong. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + std::cout << "Schroeder refinement estimate = " << result << std::endl; + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + return result; // Schroeder only. + } + else // Perform additional Halley refinement(s) to ensure that + // get a near as possible to correct result (usually +/- epsilon). + { + result = halley_update(result, z, pol); + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Halley refinement estimate = " << result << std::endl; + std::cout.precision(saved_precision); + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY + return result; // Halley + } // schroeder or Schroeder and Halley. + } // more than 10 digits2 + } // template T lambert_wm1_imp(const T z) + } } // namespace detail //////////////////////////////////////////////////////////// // User Lambert W0 and Lambert W-1 functions. diff --git a/include/boost/math/special_functions/lambert_w_lookup_table.ipp b/include/boost/math/special_functions/lambert_w_lookup_table.ipp new file mode 100644 index 000000000..44c6171d9 --- /dev/null +++ b/include/boost/math/special_functions/lambert_w_lookup_table.ipp @@ -0,0 +1,133 @@ +// I:/modular-boost/libs/math/include/boost/math/special_functions/lambert_w_lookup_table.ipp +// A collection of 128-bit precision integral Lambert W values computed using 37 decimal digits precision. +// C++ floating-point precision is 128-bit long double. +// Output as 53 decimal digits, suffixed L. + +// C++ floating-point type is provided by lambert_w.hpp typedef. +// For example: typedef lookup_t double; (or float or long double) + +// Written by i:\modular-boost\libs\math\test\lambert_w_lookup_table_generator.cpp Thu Nov 2 17:38:42 2017 + +// Copyright Paul A. Bristow 2017. +// 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) + +// Sizes of arrays of z values for Lambert W[0], W[1] ... W[64]"nand W[-1], W[-2] ... W[-64]. + +namespace boost { +namespace math { +namespace detail { +namespace lambert_w_lookup +{ +BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = 12; +BOOST_STATIC_CONSTEXPR std::size_t noof_halves = 12; +BOOST_STATIC_CONSTEXPR std::size_t noof_w0es = 65; +BOOST_STATIC_CONSTEXPR std::size_t noof_w0zs = 65; +BOOST_STATIC_CONSTEXPR std::size_t noof_wm1es = 64; +BOOST_STATIC_CONSTEXPR std::size_t noof_wm1zs = 64; + +BOOST_STATIC_CONSTEXPR lookup_t halves[noof_halves] = +{ // Common to Lambert W0 and W-1 (and exactly representable). + 0.5L, 0.25L, 0.125L, 0.0625L, 0.03125L, 0.015625L, 0.0078125L, 0.00390625L, 0.001953125L, 0.0009765625L, 0.00048828125L, 0.000244140625L +}; // halves, 0.5, 0.25, ... 0.000244140625, common to W0 and W-1. + +BOOST_STATIC_CONSTEXPR lookup_t sqrtw0s[noof_sqrts] = +{ // For Lambert W0 only. + 0.6065306597126334242631173765403218567L, 0.77880078307140486866846070009071995L, 0.882496902584595403104717592968701829L, 0.9394130628134757862473572557999761753L, 0.9692332344763440819139583751755278177L, 0.9844964370054084060204319075254540376L, 0.9922179382602435121227899136829802692L, 0.996101369470117490071323985506950379L, 0.9980487811074754727142805899944244847L, 0.9990239141819756622368328253791383317L, 0.9995118379398893653889967919448497792L, 0.9997558891748972165136242351259789505L +}; // sqrtw0s + +BOOST_STATIC_CONSTEXPR lookup_t sqrtwm1s[noof_sqrts] = +{ // For Lambert W-1 only. + 1.648721270700128146848650787814163572L, 1.284025416687741484073420568062436458L, 1.133148453066826316829007227811793873L, 1.064494458917859429563390594642889673L, 1.031743407499102670938747815281507144L, 1.015747708586685747458535072082351749L, 1.007843097206447977693453559760123579L, 1.003913889338347573443609603903460282L, 1.001955033591002812046518898047477216L, 1.000977039492416535242845292611606506L, 1.000488400478694473126173623807163354L, 1.000244170429747854937005233924135774L +}; // sqrtwm1s + +BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0es] = +{ // Fukushima e powers array e[1] = 2.718, 1. ... e[64] = 4.3596100000630809736231248158884615452e-28. + 2.7182818284590452353602874713526624978e+00L, + 1.0000000000000000000000000000000000000e+00L, 3.6787944117144232159552377016146086745e-01L, 1.3533528323661269189399949497248440341e-01L, 4.9787068367863942979342415650061776632e-02L, + 1.8315638888734180293718021273241242212e-02L, 6.7379469990854670966360484231484242488e-03L, 2.4787521766663584230451674308166678915e-03L, 9.1188196555451620800313608440928262647e-04L, + 3.3546262790251183882138912578086101931e-04L, 1.2340980408667954949763669073003382607e-04L, 4.5399929762484851535591515560550610238e-05L, 1.6701700790245659312635517360580879078e-05L, + 6.1442123533282097586823081788055323112e-06L, 2.2603294069810543257852772905386894694e-06L, 8.3152871910356788406398514256526229461e-07L, 3.0590232050182578837147949770228963937e-07L, + 1.1253517471925911451377517906012719164e-07L, 4.1399377187851666596510277189552806229e-08L, 1.5229979744712628436136629233517431862e-08L, 5.6027964375372675400129828162064630798e-09L, + 2.0611536224385578279659403801558209764e-09L, 7.5825604279119067279417432412681264430e-10L, 2.7894680928689248077189130306442932077e-10L, 1.0261879631701890303927527840612497760e-10L, + 3.7751345442790977516449695475234067792e-11L, 1.3887943864964020594661763746086856910e-11L, 5.1090890280633247198744001934792157666e-12L, 1.8795288165390832947582704184221926212e-12L, + 6.9144001069402030094125846587414092712e-13L, 2.5436656473769229103033856148576816666e-13L, 9.3576229688401746049158322233787067450e-14L, 3.4424771084699764583923893328515572846e-14L, + 1.2664165549094175723120904155965096382e-14L, 4.6588861451033973641842455436101684114e-15L, 1.7139084315420129663027203425760492412e-15L, 6.3051167601469893856390211922465427614e-16L, + 2.3195228302435693883122636097380800411e-16L, 8.5330476257440657942780498229412441658e-17L, 3.1391327920480296287089646522319196491e-17L, 1.1548224173015785986262442063323868655e-17L, + 4.2483542552915889953292347828586580179e-18L, 1.5628821893349887680908829951058341550e-18L, 5.7495222642935598066643808805734234249e-19L, 2.1151310375910804866314010070226514702e-19L, + 7.7811322411337965157133167292798981918e-20L, 2.8625185805493936444701216291839372068e-20L, 1.0530617357553812378763324449428108806e-20L, 3.8739976286871871129314774972691278293e-21L, + 1.4251640827409351062853210280340602263e-21L, 5.2428856633634639371718053028323436716e-22L, 1.9287498479639177830173428165270125748e-22L, 7.0954741622847041389832693878080734877e-23L, + 2.6102790696677048047026953153318648093e-23L, 9.6026800545086760302307696700074909076e-24L, 3.5326285722008070297353928101772088374e-24L, 1.2995814250075030736007134060714855303e-24L, + 4.7808928838854690812771770423179628939e-25L, 1.7587922024243116489558751288034363178e-25L, 6.4702349256454603261540395529264893765e-26L, 2.3802664086944006058943245888024963309e-26L, + 8.7565107626965203384887328007391660366e-27L, 3.2213402859925160890012477758489437534e-27L, 1.1850648642339810062850307390972809891e-27L, 4.3596100000630809736231248158884596428e-28L, + 1.6038108905486378529760870341423353810e-28L +}; // w0es + +BOOST_STATIC_CONSTEXPR lookup_t w0zs[noof_w0zs] = +{ // z values for W[0], W[1], W[2] ... W[64] (Fukushima array Fk). + 0.0000000000000000000000000000000000000e+00L, + 2.7182818284590452353602874713526624978e+00L, 1.4778112197861300454460854921150015626e+01L, 6.0256610769563003222785588963745153691e+01L, 2.1839260013257695631244104481144351361e+02L, + 7.4206579551288301710557790020276139812e+02L, 2.4205727609564107356503230832603296776e+03L, 7.6764321089992101948460416680168500271e+03L, 2.3847663896333826197948736795623109390e+04L, + 7.2927755348178456069389970204894839685e+04L, 2.2026465794806716516957900645284244366e+05L, 6.5861555886717600300859134371483559776e+05L, 1.9530574970280470496960624587818413980e+06L, + 5.7513740961159665432393360873381476632e+06L, 1.6836459978306874888489314790750032292e+07L, 4.9035260587081659589527825691375819733e+07L, 1.4217776832812596218820837985250320561e+08L, + 4.1063419681078006965118239806655900596e+08L, 1.1818794444719492004981570586630806042e+09L, 3.3911637183005579560532906419857313738e+09L, 9.7033039081958055593821366108308111737e+09L, + 2.7695130424147508641409976558651358487e+10L, 7.8868082614895014356985518811525255163e+10L, 2.2413047926372475980079655175092843139e+11L, 6.3573893111624333505933989166748517618e+11L, + 1.8001224834346468131040337866531539479e+12L, 5.0889698451498078710141863447784789126e+12L, 1.4365302496248562650461177217211790925e+13L, 4.0495197800161304862957327843914007993e+13L, + 1.1400869461717722015726999684446230289e+14L, 3.2059423744573386440971405952224204950e+14L, 9.0051433962267018216365614546207459567e+14L, 2.5268147258457822451512967243234631750e+15L, + 7.0832381329352301326018261305316090522e+15L, 1.9837699245933465967698692976753294646e+16L, 5.5510470830970075484537561902113104381e+16L, 1.5520433569614702817608320254284931407e+17L, + 4.3360826779369661842459877227403719730e+17L, 1.2105254067703227363724895246493485480e+18L, 3.3771426165357561311906703760513324357e+18L, 9.4154106734807994163159964299613921804e+18L, + 2.6233583234732252918129199544138403574e+19L, 7.3049547543861043990576614751671879498e+19L, 2.0329709713386190214340167519800405595e+20L, 5.6547040503180956413560918381429636734e+20L, + 1.5720421975868292906615658755032744790e+21L, 4.3682149334771264822761478593874428627e+21L, 1.2132170565093316762294432610117848880e+22L, 3.3680332378068632345542636794533635462e+22L, + 9.3459982052259884835729892206738573922e+22L, 2.5923527642935362320437266614667426924e+23L, 7.1876803203773878618909930893087860822e+23L, 1.9921241603726199616378561653688236827e+24L, + 5.5192924995054165325072406547517121131e+24L, 1.5286067837683347062387143159276002521e+25L, 4.2321318958281094260005100745711666956e+25L, 1.1713293177672778461879598480402173158e+26L, + 3.2408603996214813669049988277609543829e+26L, 8.9641258264226027960478448084812796397e+26L, 2.4787141382364034104243901241243054434e+27L, 6.8520443388941057019777430988685937812e+27L, + 1.8936217407781711443114787060753312270e+28L, 5.2317811346197017832254642778313331353e+28L, 1.4450833904658542238325922893692265683e+29L, 3.9904954117194348050619127737142206367e+29L + +}; // w0zs + +BOOST_STATIC_CONSTEXPR lookup_t wm1es[noof_wm1es] = +{ // Fukushima e array e[1] = e[1] = 2.718 ... e[64] = 4.60718e+28. + 2.7182818284590452353602874713526624978e+00L, + 7.3890560989306502272304274605750078132e+00L, 2.0085536923187667740928529654581717897e+01L, 5.4598150033144239078110261202860878403e+01L, 1.4841315910257660342111558004055227962e+02L, + 4.0342879349273512260838718054338827961e+02L, 1.0966331584284585992637202382881214324e+03L, 2.9809579870417282747435920994528886738e+03L, 8.1030839275753840077099966894327599650e+03L, + 2.2026465794806716516957900645284244366e+04L, 5.9874141715197818455326485792257781614e+04L, 1.6275479141900392080800520489848678317e+05L, 4.4241339200892050332610277594908828178e+05L, + 1.2026042841647767777492367707678594494e+06L, 3.2690173724721106393018550460917213155e+06L, 8.8861105205078726367630237407814503508e+06L, 2.4154952753575298214775435180385823880e+07L, + 6.5659969137330511138786503259060033569e+07L, 1.7848230096318726084491003378872270388e+08L, 4.8516519540979027796910683054154055868e+08L, 1.3188157344832146972099988837453027851e+09L, + 3.5849128461315915616811599459784206892e+09L, 9.7448034462489026000346326848229752776e+09L, 2.6489122129843472294139162152811882341e+10L, 7.2004899337385872524161351466126157915e+10L, + 1.9572960942883876426977639787609534279e+11L, 5.3204824060179861668374730434117744166e+11L, 1.4462570642914751736770474229969288569e+12L, 3.9313342971440420743886205808435276858e+12L, + 1.0686474581524462146990468650741401650e+13L, 2.9048849665247425231085682111679825667e+13L, 7.8962960182680695160978022635108224220e+13L, 2.1464357978591606462429776153126088037e+14L, + 5.8346174252745488140290273461039101900e+14L, 1.5860134523134307281296446257746601252e+15L, 4.3112315471151952271134222928569253908e+15L, 1.1719142372802611308772939791190194522e+16L, + 3.1855931757113756220328671701298646000e+16L, 8.6593400423993746953606932719264934250e+16L, 2.3538526683701998540789991074903480451e+17L, 6.3984349353005494922266340351557081888e+17L, + 1.7392749415205010473946813036112352261e+18L, 4.7278394682293465614744575627442803708e+18L, 1.2851600114359308275809299632143099258e+19L, 3.4934271057485095348034797233406099533e+19L, + 9.4961194206024488745133649117118323102e+19L, 2.5813128861900673962328580021527338043e+20L, 7.0167359120976317386547159988611740546e+20L, 1.9073465724950996905250998409538484474e+21L, + 5.1847055285870724640874533229334853848e+21L, 1.4093490824269387964492143312370168789e+22L, 3.8310080007165768493035695487861993899e+22L, 1.0413759433029087797183472933493796440e+23L, + 2.8307533032746939004420635480140745409e+23L, 7.6947852651420171381827455901293939921e+23L, 2.0916594960129961539070711572146737782e+24L, 5.6857199993359322226403488206332533034e+24L, + 1.5455389355901039303530766911174620068e+25L, 4.2012104037905142549565934307191617684e+25L, 1.1420073898156842836629571831447656302e+26L, 3.1042979357019199087073421411071003721e+26L, + 8.4383566687414544890733294803731179601e+26L, 2.2937831594696098790993528402686136005e+27L, 6.2351490808116168829092387089284697448e+27L +}; // wm1es + +BOOST_STATIC_CONSTEXPR lookup_t wm1zs[noof_wm1zs] = +{ // Fukushima G array of z values for integral K, (Fukushima Gk) g[0] (k = -1) = 1 ... g[64] = -1.0264389699511303e-26. + -3.6787944117144232159552377016146086745e-01L, + -2.7067056647322538378799898994496880682e-01L, -1.4936120510359182893802724695018532990e-01L, -7.3262555554936721174872085092964968848e-02L, -3.3689734995427335483180242115742121244e-02L, + -1.4872513059998150538271004584900007349e-02L, -6.3831737588816134560219525908649783853e-03L, -2.6837010232200947105711130062468881545e-03L, -1.1106882367801159454787302165703044346e-03L, + -4.5399929762484851535591515560550610238e-04L, -1.8371870869270225243899069096638966986e-04L, -7.3730548239938517104187698145666387735e-05L, -2.9384282290753706235208604777002963102e-05L, + -1.1641402067449950376895791995913672125e-05L, -4.5885348075273868255721924655343445906e-06L, -1.8005627955081458322204028649620350662e-06L, -7.0378941219347833214067471222239770590e-07L, + -2.7413963540482731185045932620331377352e-07L, -1.0645313231320808326024667350792279852e-07L, -4.1223072448771156559318807603116419528e-08L, -1.5923376898615004128677660806663065530e-08L, + -6.1368298043116345769816086674174450569e-09L, -2.3602323152914347699033314033408744848e-09L, -9.0603229062698346039479269140561762700e-10L, -3.4719859662410051486654409365217142276e-10L, + -1.3283631472964644271673440503045960993e-10L, -5.0747278046555248958473301297399200773e-11L, -1.9360320299432568426355237044475945959e-11L, -7.3766303773930764398798182830872768331e-12L, + -2.8072868906520523814747496670136120235e-12L, -1.0671679036256927021016406931839827582e-12L, -4.0525329757101362313986893299088308423e-13L, -1.5374324278841211301808010293913555758e-13L, + -5.8272886672428440854292491647585674200e-14L, -2.2067908660514462849736574172862899665e-14L, -8.3502821888768497979241489950570881481e-15L, -3.1572276215253043438828784344882603413e-15L, + -1.1928704609782512589094065678481294667e-15L, -4.5038074274761565346423524046963087756e-16L, -1.6993417021166355981316939131434632072e-16L, -6.4078169762734539491726202799339200356e-17L, + -2.4147993510032951187990399698408378385e-17L, -9.0950634616416460925150243301974013218e-18L, -3.4236981860988704669138593608831552044e-18L, -1.2881333612472271400115547331327717431e-18L, + -4.8440839844747536942311292467369300505e-19L, -1.8207788854829779430777944237164900798e-19L, -6.8407875971564885101695409345634890862e-20L, -2.5690139750480973292141845983878483991e-20L, + -9.6437492398195889150867140826350628738e-21L, -3.6186918227651991108814673877821174787e-21L, -1.3573451162272064984454015639725697008e-21L, -5.0894204288895982960223079251039701810e-22L, + -1.9076194289884357960571121174956927722e-22L, -7.1476978375412669048039237333931704166e-23L, -2.6773000149758626855152191436980592206e-23L, -1.0025115553818576399048488234179587012e-23L, + -3.7527362568743669891693429406973638384e-24L, -1.4043571811296963574776515073934728352e-24L, -5.2539064576179122030932396804434996219e-25L, -1.9650175744554348142907611432678556896e-25L, + -7.3474021582506822389671905824031421322e-26L, -2.7465543000397410133825686340097295749e-26L, -1.0264389699511282259046957018510946438e-26L +}; // wm1zs +} // namespace lambert_w_lookup +} // namespace detail +} // namespace math +} // namespace boost diff --git a/include/boost/math/tools/test_value.hpp b/include/boost/math/tools/test_value.hpp new file mode 100644 index 000000000..c10596209 --- /dev/null +++ b/include/boost/math/tools/test_value.hpp @@ -0,0 +1,120 @@ +// Copyright Paul A. Bristow 2017. +// Copyright John Maddock 2017. + +// 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) + +// test_value.hpp + +#ifndef TEST_VALUE_HPP +#define TEST_VALUE_HPP + +// BOOST_MATH_TEST_VALUE is used to create a test value of suitable type from a decimal digit string. +// Two parameters, both a floating-point literal double like 1.23 (not long double so no suffix L) +// and a decimal digit string const char* like "1.23" must be provided. +// The decimal value represented must be the same of course, with at least enough precision for long double. +// Note there are two gotchas to this approach: +// * You need all values to be real floating-point values +// * and *MUST* include a decimal point (to avoid confusion with an integer literal). +// * It's slow to compile compared to a simple literal. + +// Speed is not an issue for a few test values, +// but it's not generally usable in large tables +// where you really need everything to be statically initialized. + +// Macro BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE provides a global diagnostic value for create_type. + +#include // For float_64_t, float128_t. Must be first include! +#include +#include +#include + +#ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE +// global int create_type(0); must be defined before including this file. +#endif + +#ifdef BOOST_HAS_FLOAT128 +typedef __float128 largest_float; +#define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##Q +#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS std::numeric_limits::digits +#else +typedef long double largest_float; +#define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##L +#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS std::numeric_limits::digits +#endif + +template +inline T create_test_value(largest_float val, const char*, const boost::mpl::true_&, const T2&) +{ // Construct from long double or quad parameter val (ignoring string/const char* str). + // (This is case for MPL parameters = true_ and T2 == false_, + // and MPL parameters = true_ and T2 == true_ cpp_bin_float) + // All built-in/fundamental floating-point types, + // and other User-Defined Types that can be constructed without loss of precision + // from long double suffix L (or quad suffix Q), + // + // Choose this method, even if can be constructed from a string, + // because it will be faster, and more likely to be the closest representation. + // (This is case for MPL parameters = mpl::true_ and T2 == mpl::true_). + #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE + create_type = 1; + #endif + return static_cast(val); +} + +template +inline T create_test_value(largest_float, const char* str, const boost::mpl::false_&, const boost::mpl::true_&) +{ // Construct from decimal digit string const char* @c str (ignoring long double parameter). + // For example, extended precision or other User-Defined types which ARE constructible from a string + // (but not from double, or long double without loss of precision). + // (This is case for MPL parameters = mpl::false_ and T2 == mpl::true_). + #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE + create_type = 2; + #endif + return T(str); +} + +template +inline T create_test_value(largest_float, const char* str, const boost::mpl::false_&, const boost::mpl::false_&) +{ // Create test value using from lexical cast of decimal digit string const char* str. + // For example, extended precision or other User-Defined types which are NOT constructible from a string + // (NOR constructible from a long double). + // (This is case T1 = mpl::false and T2 == mpl::false). + #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE + create_type = 3; + #endif + return boost::lexical_cast(str); +} + +// T real type, x a decimal digits representation of a floating-point, for example: 12.34. +// It must include a decimal point (or it would be interpreted as an integer). + +// x is converted to a long double by appending the letter L (to suit long double fundamental type), 12.34L. +// x is also passed as a const char* or string representation "12.34" +// (to suit most other types that cannot be constructed from long double without possible loss). + +// BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) makes a long double or quad version, with +// suffix a letter L (or Q) to suit long double (or quad) fundamental type, 12.34L or 12.34Q. +// #x makes a decimal digit string version to suit multiprecision and fixed_point constructors, "12.34". +// (Constructing from double or long double (or quad) could lose precision for multiprecision or fixed-point). + +// The matching create_test_value function above is chosen depending on the T1 and T2 mpl bool truths. +// The string version from #x is used if the precision of T is greater than long double. + +// Example: long double test_value = BOOST_MATH_TEST_VALUE(double, 1.23456789); + +#define BOOST_MATH_TEST_VALUE(T, x) create_test_value(\ + BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x),\ + #x,\ + boost::mpl::bool_<\ + std::numeric_limits::is_specialized &&\ + (std::numeric_limits::radix == 2)\ + && (std::numeric_limits::digits <= BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS)\ + && boost::is_convertible::value>(),\ + boost::mpl::bool_<\ + boost::is_constructible::value>()\ +) +#endif // TEST_VALUE_HPP + + diff --git a/test/lambert_w_lookup_table_generator.cpp b/test/lambert_w_lookup_table_generator.cpp new file mode 100644 index 000000000..93816905a --- /dev/null +++ b/test/lambert_w_lookup_table_generator.cpp @@ -0,0 +1,466 @@ +// Lambert W lookup table generator lambert_w_lookup_table_generator.cpp + +//! \file +//! Output a table of precomputed array values for Lambert W0 and W-1, +//! and square roots and halves, and powers of e, +// as a .ipp file for use by lambert_w.hpp. + +//! \details Output as long double precision (suffix L) using Boost.Multiprecision +//! to 34 decimal digits precision to cater for platforms that have 128-bit long double. +//! The function bisection can then use any built-in floating-point type, +//! which may have different precision and speed on different platforms. +// The actual builtin floating-point type of the arrays is chosen by a typedef in lambert_W.hpp, +// by default, for example: typedef double lookup_t; + +#include +#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. +using boost::math::constants::exp_minus_one; // 0.36787944 +using boost::math::constants::root_e; // 1.64872 +#include +using boost::multiprecision::cpp_bin_float_quad; +using boost::multiprecision::cpp_bin_float_50; + +#include +#include +#include + +/* +typedef double lookup_t; // Type for lookup table (double or float?) + +BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = 12; +BOOST_STATIC_CONSTEXPR lookup_t a[noof_sqrts] = // 0.6065 0.7788, 0.8824 ... 0.9997, sqrt of previous elements. +{ +0.60653065971263342, 0.77880078307140487, 0.8824969025845954, 0.93941306281347579, 0.96923323447634408, 0.98449643700540841, +0.99221793826024351, 0.99610136947011749, 0.99804878110747547, 0.99902391418197566, 0.99951183793988937, 0.99975588917489722 +}; +BOOST_STATIC_CONSTEXPR lookup_t b[noof_sqrts] = // 0.5 0.25 0.125, 0.0625 ... 0.0002441, halves of previous elements. +{ 0.5, 0.25, 0.125, 0.0625, 0.03125, 0.015625, 0.0078125, 0.00390625, 0.001953125, 0.0009765625, 0.00048828125, 0.000244140625 }; + +BOOST_STATIC_CONSTEXPR size_t noof_w0zs = 65; +BOOST_STATIC_CONSTEXPR lookup_t g[noof_w0zs] = // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. +{ 0., 2.7182818284590452, 14.7781121978613, 60.256610769563003, 218.39260013257696, 742.06579551288302, 2420.5727609564107, 7676.4321089992102, +23847.663896333826, 72927.755348178456, 220264.65794806717, 658615.558867176, 1953057.4970280471, 5751374.0961159665, 16836459.978306875, 49035260.58708166, +142177768.32812596, 410634196.81078007, 1181879444.4719492, 3391163718.300558, 9703303908.1958056, 27695130424.147509, 78868082614.895014, 224130479263.72476, +635738931116.24334, 1800122483434.6468, 5088969845149.8079, 14365302496248.563, 40495197800161.305, 114008694617177.22, 320594237445733.86, +900514339622670.18, 2526814725845782.2, 7083238132935230.1, 19837699245933466., 55510470830970076., 1.5520433569614703e+17, 4.3360826779369662e+17, +1.2105254067703227e+18, 3.3771426165357561e+18, 9.4154106734807994e+18, 2.6233583234732253e+19, 7.3049547543861044e+19, 2.032970971338619e+20, +5.6547040503180956e+20, 1.5720421975868293e+21, 4.3682149334771265e+21, 1.2132170565093317e+22, 3.3680332378068632e+22, 9.3459982052259885e+22, +2.5923527642935362e+23, 7.1876803203773879e+23, 1.99212416037262e+24, 5.5192924995054165e+24, 1.5286067837683347e+25, 4.2321318958281094e+25, +1.1713293177672778e+26, 3.2408603996214814e+26, 8.9641258264226028e+26, 2.4787141382364034e+27, 6.8520443388941057e+27, 1.8936217407781711e+28, +5.2317811346197018e+28, 1.4450833904658542e+29, 3.9904954117194348e+29 +}; + +BOOST_STATIC_CONSTEXPR std::size_t noof_wm1zs = 66; +BOOST_STATIC_CONSTEXPR lookup_t e[noof_wm1zs] = // lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 +{ +2.7182818284590452, 1., 0.36787944117144232, 0.13533528323661269, 0.049787068367863943, 0.01831563888873418, 0.0067379469990854671, +0.0024787521766663584, 0.00091188196555451621, 0.00033546262790251184, 0.00012340980408667955, 4.5399929762484852e-05, 1.6701700790245659e-05, +6.1442123533282098e-06, 2.2603294069810543e-06, 8.3152871910356788e-07, 3.0590232050182579e-07, 1.1253517471925911e-07, 4.1399377187851667e-08, +1.5229979744712628e-08, 5.6027964375372675e-09, 2.0611536224385578e-09, 7.5825604279119067e-10, 2.7894680928689248e-10, 1.026187963170189e-10, +3.7751345442790977e-11, 1.3887943864964021e-11, 5.1090890280633247e-12, 1.8795288165390833e-12, 6.914400106940203e-13, 2.5436656473769229e-13, +9.3576229688401746e-14, 3.4424771084699765e-14, 1.2664165549094176e-14, 4.6588861451033974e-15, 1.713908431542013e-15, 6.3051167601469894e-16, +2.3195228302435694e-16, 8.5330476257440658e-17, 3.1391327920480296e-17, 1.1548224173015786e-17, 4.248354255291589e-18, 1.5628821893349888e-18, +5.7495222642935598e-19, 2.1151310375910805e-19, 7.7811322411337965e-20, 2.8625185805493936e-20, 1.0530617357553812e-20, 3.8739976286871871e-21, +1.4251640827409351e-21, 5.2428856633634639e-22, 1.9287498479639178e-22, 7.0954741622847041e-23, 2.6102790696677048e-23, 9.602680054508676e-24, +3.532628572200807e-24, 1.2995814250075031e-24, 4.7808928838854691e-25, 1.7587922024243116e-25, 6.4702349256454603e-26, 2.3802664086944006e-26, +8.7565107626965203e-27, 3.2213402859925161e-27, 1.185064864233981e-27, 4.359610000063081e-28, 1.6038108905486378e-28 +}; + +lambert_w0 version of array from Fukushima + +// lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 +e: 2.7182818284590452, 1., 0.36787944117144232, 0.13533528323661269, 0.049787068367863943, 0.01831563888873418, 0.0067379469990854671, +0.0024787521766663584, 0.00091188196555451621, 0.00033546262790251184, 0.00012340980408667955, 4.5399929762484852e-05, 1.6701700790245659e-05, +6.1442123533282098e-06, 2.2603294069810543e-06, 8.3152871910356788e-07, 3.0590232050182579e-07, 1.1253517471925911e-07, 4.1399377187851667e-08, +1.5229979744712628e-08, 5.6027964375372675e-09, 2.0611536224385578e-09, 7.5825604279119067e-10, 2.7894680928689248e-10, 1.026187963170189e-10, +3.7751345442790977e-11, 1.3887943864964021e-11, 5.1090890280633247e-12, 1.8795288165390833e-12, 6.914400106940203e-13, 2.5436656473769229e-13, +9.3576229688401746e-14, 3.4424771084699765e-14, 1.2664165549094176e-14, 4.6588861451033974e-15, 1.713908431542013e-15, 6.3051167601469894e-16, +2.3195228302435694e-16, 8.5330476257440658e-17, 3.1391327920480296e-17, 1.1548224173015786e-17, 4.248354255291589e-18, 1.5628821893349888e-18, +5.7495222642935598e-19, 2.1151310375910805e-19, 7.7811322411337965e-20, 2.8625185805493936e-20, 1.0530617357553812e-20, 3.8739976286871871e-21, +1.4251640827409351e-21, 5.2428856633634639e-22, 1.9287498479639178e-22, 7.0954741622847041e-23, 2.6102790696677048e-23, 9.602680054508676e-24, +3.532628572200807e-24, 1.2995814250075031e-24, 4.7808928838854691e-25, 1.7587922024243116e-25, 6.4702349256454603e-26, 2.3802664086944006e-26, +8.7565107626965203e-27, 3.2213402859925161e-27, 1.185064864233981e-27, 4.359610000063081e-28, 1.6038108905486378e-28 + +// lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. + +g: 0, 2.7182818284590452, 14.7781121978613, 60.256610769563003, 218.39260013257696, 742.06579551288302, 2420.5727609564107, 7676.4321089992102, +23847.663896333826, 72927.755348178456, 220264.65794806717, 658615.558867176, 1953057.4970280471, 5751374.0961159665, 16836459.978306875, 49035260.58708166, +142177768.32812596, 410634196.81078007, 1181879444.4719492, 3391163718.300558, 9703303908.1958056, 27695130424.147509, 78868082614.895014, 224130479263.72476, +635738931116.24334, 1800122483434.6468, 5088969845149.8079, 14365302496248.563, 40495197800161.305, 114008694617177.22, 320594237445733.86, +900514339622670.18, 2526814725845782.2, 7083238132935230.1, 19837699245933466, 55510470830970076, 1.5520433569614703e+17, 4.3360826779369662e+17, +1.2105254067703227e+18, 3.3771426165357561e+18, 9.4154106734807994e+18, 2.6233583234732253e+19, 7.3049547543861044e+19, 2.032970971338619e+20, +5.6547040503180956e+20, 1.5720421975868293e+21, 4.3682149334771265e+21, 1.2132170565093317e+22, 3.3680332378068632e+22, 9.3459982052259885e+22, +2.5923527642935362e+23, 7.1876803203773879e+23, 1.99212416037262e+24, 5.5192924995054165e+24, 1.5286067837683347e+25, 4.2321318958281094e+25, +1.1713293177672778e+26, 3.2408603996214814e+26, 8.9641258264226028e+26, 2.4787141382364034e+27, 6.8520443388941057e+27, 1.8936217407781711e+28, +5.2317811346197018e+28, 1.4450833904658542e+29, 3.9904954117194348e+29 + + +lambert_wm1 version of arrays from Fukushima +e: 2.7182817459106445 7.3890557289123535 20.085535049438477 54.59814453125 148.41314697265625 403.42874145507813 1096.6329345703125 2980.957275390625 8103.08154296875 22026.458984375 59874.12109375 162754.734375 442413.21875 1202603.75 3269015.75 8886106 24154940 65659932 178482192 485164896 1318814848 3584910336 9744796672 26489102336 72004845568 195729457152 532047822848 1446255919104 3931331100672 10686465835008 29048824659968 78962889850880 214643389759488 583461240832000 1586012102852608 4311227773747200 11719131799748608 31855901283450880 86593318145753088 2.3538502982225101e+17 6.398428560008151e+17 1.7392731886358364e+18 4.7278345784949473e+18 1.2851586685678387e+19 3.493423319351296e+19 9.4961089747571704e+19 2.581309902546461e+20 7.0167278463083348e+20 1.9073443887231177e+21 5.1846992652160593e+21 1.4093473476000776e+22 3.831003235981371e+22 1.0413746376682761e+23 2.8307496154307266e+23 7.6947746628514896e+23 2.0916565667371597e+24 5.6857119515524837e+24 1.5455367020327599e+25 4.2012039964445827e+25 1.1420056438012293e+26 3.1042929865047826e+26 8.4383428037470738e+26 2.2937792813113457e+27 6.2351382164292627e+27 + +g: -0.36787945032119751 -0.27067059278488159 -0.14936122298240662 -0.073262564837932587 -0.033689741045236588 -0.014872515574097633 -0.0063831745646893978 -0.0026837014593183994 -0.0011106884339824319 -0.00045399941154755652 -0.00018371877376921475 -7.3730567237362266e-05 -2.9384291337919421e-05 -1.1641405762929935e-05 -4.5885362851549871e-06 -1.8005634956352878e-06 -7.0378973759943619e-07 -2.7413975089984888e-07 -1.0645318582191976e-07 -4.122309249510181e-08 -1.5923385277005764e-08 -6.1368328196920174e-09 -2.3602335641470518e-09 -9.0603280433754207e-10 -3.471987974901225e-10 -1.3283640853956058e-10 -5.0747316071575455e-11 -1.9360334516105304e-11 -7.3766357605586919e-12 -2.8072891233854591e-12 -1.0671687058344537e-12 -4.0525363013271809e-13 -1.5374336461045079e-13 -5.8272932648966574e-14 -2.206792725173521e-14 -8.3502896573240185e-15 -3.1572303958374423e-15 -1.192871523299666e-15 -4.5038112940094517e-16 -1.699343306816689e-16 -6.4078234365689933e-17 -2.4148019279880996e-17 -9.095073346605316e-18 -3.4237017961279004e-18 -1.2881348671140216e-18 -4.8440896082993503e-19 -1.8207810463107454e-19 -6.8407959442757565e-20 -2.569017156788846e-20 -9.6437611040447661e-21 -3.6186962678628536e-21 -1.357346940624028e-21 -5.0894276378983633e-22 -1.9076220526102576e-22 -7.1477077345829229e-23 -2.6773039821769189e-23 -1.0025130740057213e-23 -3.7527418826161672e-24 -1.4043593713279384e-24 -5.2539147015754201e-25 -1.9650207139502987e-25 -7.3474141096711539e-26 -2.7465588329293218e-26 -1.0264406957471058e-26 + + +a: 1.6487212181091309 1.2840254306793213 1.1331484317779541 1.0644944906234741 1.0317434072494507 1.0157476663589478 1.007843017578125 1.0039138793945313 1.0019550323486328 1.0009770393371582 1.0004884004592896 1.000244140625 + +// These are common to both W0 and W-1 +b: 0.5 0.25 0.125 0.0625 0.03125 0.015625 0.0078125 0.00390625 0.001953125 0.0009765625 0.00048828125 0.000244140625 + + +*/ + +// Creates if no file exists, & uses default overwrite/ ios::replace. +const char filename[] = // "lambert_w_lookup_table.ipp"; +"I:/modular-boost/libs/math/include/boost/math/special_functions/lambert_w_lookup_table.ipp"; + +std::ofstream fout(filename, std::ios::out); + +// 128-bit precision type (so that full precision if long double type uses 128-bit). +// typedef cpp_bin_float_quad table_lookup_t; // Output using max_digits10 for 37 decimal digit precision. +// (This is the precision for the tables output as a C++ program, +// not the precision used by the lambert_w.hpp, that defines another typedef lookup_t, default double. + +typedef cpp_bin_float_50 table_lookup_t; // Compute tables to 50 decimla digit precision to avoid slight inaccuracy from repeated multiply. + +// But Output using max_digits10 for 37 decimal digit precision. + +int main() +{ + std::cout << "Lambert W table lookup values to file." << std::endl; + if (!fout.is_open()) + { // File failed to open OK. + std::cerr << "Open file " << filename << " failed!" << std::endl; + std::cerr << "errno " << errno << std::endl; + return -1; + } + try + { + std::cout << "Lambert W test values writing to file " << filename << std::endl; + int output_precision = std::numeric_limits::max_digits10; // 37 decimal digits. + fout.precision(output_precision); + fout << + "// " << filename << "\n" + "// A collection of 128-bit precision integral Lambert W values computed using " + << output_precision << " decimal digits precision.\n" + "// C++ floating-point precision is 128-bit long double.\n" + "// Output as " + << std::numeric_limits::max_digits10 + << " decimal digits, suffixed L.\n" + "\n" + "// C++ floating-point type is provided by lambert_w.hpp typedef." "\n" + "// For example: typedef lookup_t double; (or float or long double)" "\n" + + "\n" + "// Written by " << __FILE__ << " " << __TIMESTAMP__ << "\n" + + "\n" + "// Copyright Paul A. Bristow 2017." "\n" + "// Distributed under the Boost Software License, Version 1.0." "\n" + "// (See accompanying file LICENSE_1_0.txt" "\n" + "// or copy at http://www.boost.org/LICENSE_1_0.txt)" "\n" + << std::endl; + + fout << "// Sizes of arrays of z values for Lambert W[0], W[1] ... W[64]" + "\"n""and W[-1], W[-2] ... W[-64]." << std::endl; + + fout << "\nnamespace boost {\nnamespace math {\nnamespace detail {\nnamespace lambert_w_lookup\n{ \n"; + + BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = 12; + BOOST_STATIC_CONSTEXPR std::size_t noof_halves = 12; + fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = " << noof_sqrts << ";" << std::endl; + fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_halves = " << noof_halves << ";" << std::endl; // Common to both branches. + + BOOST_STATIC_CONSTEXPR std::size_t noof_w0zs = 65; // F[k] 0 <= k <= 64. + BOOST_STATIC_CONSTEXPR std::size_t noof_w0es = 66; // f[0] = F[0], f[64] = F[64] + BOOST_STATIC_CONSTEXPR std::size_t noof_wm1zs = 64; // G[k] 1 <= k <= 64. (W-1 = 0 would be z = -infinity, so not stored in array) + BOOST_STATIC_CONSTEXPR std::size_t noof_wm1es = 64; // g[0] == G[1], g[63] = G64] + + fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_w0es = " << noof_w0zs << ";" << std::endl; + fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_w0zs = " << noof_w0zs << ";" << std::endl; + fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_wm1es = " << noof_wm1zs << ";" << std::endl; + fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_wm1zs = " << noof_wm1zs << ";" << std::endl; + + // Defining actual lookup table sqrts of e^k, e^-k = 1/e, etc. + table_lookup_t halves[noof_halves]; // 0.5 0.25 0.125, 0.0625 ... 0.0002441, halves of previous elements. + table_lookup_t sqrtw0s[noof_sqrts]; // 0.6065 0.7788, 0.8824 ... 0.9997, sqrt of previous elements. + table_lookup_t sqrtwm1s[noof_sqrts]; // 1.6487, 1.2840 1.1331 ... 1.00024 , sqrt of previous elements. + table_lookup_t w0es[noof_w0es]; // lambert_w[k] for W0 branch. 2.7182, 1, 0.3678, 0.1353, ... 1.6038e-28 + table_lookup_t w0zs[noof_w0zs]; // lambert_w[k] for W0 branch. 0. , 2.7182, 14.77, 60.2566 ... 1.445e+29, 3.990e+29. + table_lookup_t wm1es[noof_wm1es]; // lambert_w[k] for W-1 branch. 2.7182 7.38905 20.085 ... 6.235e+27 + table_lookup_t wm1zs[noof_wm1zs]; // lambert_w[k] for W-1 branch. -0.3678 ... -1.0264e-26 + + // e values lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 + + using boost::math::constants::e; + using boost::math::constants::exp_minus_one; + + { // F[k] and e^W for W0 branch. + table_lookup_t ej = 1; // + w0es[0] = e(); // e = 2.7182 // exp(-1) - 1/e exp_minus_one = 0.36787944. + w0es[1] = 1; // e + w0zs[0] = 0; // F[0] for W0 branch. + for (int j = 1, jj = 2; jj != noof_w0zs + 1; ++jj) + { + w0es[jj] = w0es[j] * exp_minus_one(); // previous * 0.36787944. + ej *= e(); // 2.7182 + w0zs[j] = j * ej; // For W0 branch. + j = jj; // Previous. + } // for + } + // Checks on accuracy of W0 exponents. + + // Checks on e power w0es + + // w0es[64] = 4.3596100000630809736231248158884615452e-28 + // N[e ^ -63, 37] = 4.359610000063080973623124815888459643×10^-28 + // So slight loss at last decimal place. + + // Checks on accuracy of z for integral W0 w0zs + // w0zs[0] = 0, z = -infinity expected? but = zero + // w0zs[1] = 2.7182818284590452353602874713526623144 + // w0[2] z = 14.778112197861300454460854921150012956 + // w0zs[64] = 3.9904954117194348050619127737142022705e+29 + // N[productlog(0, 3.9904954117194348050619127737142022705 10^+29), 37] + // = 63.99999999999999999999999999999999547 + // = 64.0 to 34 decimal digits, so exact. :-) + + { // G[k] and e^-k for W-1 branch. + // Fukushima indexing of G (k-1) differs by 1 from(k). + // G[0] = -infinity, so his first item in array g[0] is -0.3678 which is G[1] + // and last is g[63] = G[64] = 1.026e-26 + table_lookup_t e1 = 1. / e(); // 1/e = 0.36787944117144233 + table_lookup_t ej = e1; + wm1es[0] = e(); // e = 2.7182 + wm1zs[0] = -e1; // -1/e = - 0.3678 + for (int j = 0, jj = 1; jj != noof_wm1zs; ++jj) + { + ej *= e1; // * 0.3678.. + wm1es[jj] = wm1es[j] * e(); + wm1zs[jj] = -(jj + 1) * ej; + j = jj; // Previous. + } // for + } + + // Checks on W-1 branch accuracy wm1es by comparing with Wolfram. + // exp powers: + // N[e ^ 1, 37] 2.718281828459045235360287471352662498 + // wm1es[0] = 2.7182818284590452353602874713526623144 - close enough. + // N[e ^ 3, 37] 20.08553692318766774092852965458171790 + // computed wm1es[2] 2.0085536923187667740928529654581712847e+01L OK + // e ^ 66 = 4.6071866343312915426773184428060086893349003037096040 × 10^28 + // N[e ^ 66, 34] = 4.607186634331291542677318442806009 10^28 + // computed 4.6071866343312915426773184428059867859e+28L + // N[e ^ 66, 37] = 4.607186634331291542677318442806008689×10^28 + // so suffering some loss of precision by repeated multiplication computation. + // :-( + + // Repeat with cpp_bin_float_50 and correct to 37th decimal digit. + // 4.60718663433129154267731844280600868933490030370929982 + // output std::cout.precision(std::numeric_limits::max_digits10) as 37 decimal digits. + // 4.6071866343312915426773184428060086893e+28L + // N[e ^ 66, 37] = 4.607186634331291542677318442806008689×10^28 + // Agrees exactly for 37th place, so should be read in to nearest representable value. + + + // Checks W-1 branch z values wm1zs + // W-1[0] = -2.7067056647322538378799898994496883858e-01 + // w-1[1] = -1.4936120510359182893802724695018536337e-01 + + // wm1zs[65] -1.4325445274604020119111357113179868158e-27 + + // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] + // = -65.99999999999999999999999999999999955 + // = -66 accurately, so this is OK. + // z = 66 * e^66 = + // =N[-66*e ^ -66, 37] + // -1.432544527460402011911135711317986177×10^-27 + // wm1zs[65] -1.4325445274604020119111357113179868158e-27 + // which agrees well enough to 34 decimal digits. + // last wm1zs[65] = 0 is unused. + + // Halves, common to both W0 and W-1. + halves[0] = static_cast(0.5); // Exactly representable. + for (int j = 0; j != noof_sqrts -1; ++j) + { + halves[j+1] = halves[j] / 2; // Half previous element (/2 will be optimised better?). + } // for j + + // W0 sqrts + sqrtw0s[0] = static_cast(0.606530659712633423603799534991180453441918135487186955682L); + for (int j = 0; j != noof_sqrts -1; ++j) + { + sqrtw0s[j+1] = sqrt(sqrtw0s[j]); // Sqrt of previous element. sqrt(1/e), sqrt(sqrt(1/e)) ... + } // for j + + // W-1 sqrts + sqrtwm1s[0] = root_e(); + for (int j = 0; j != noof_sqrts -1; ++j) + { + sqrtwm1s[j+1] = sqrt(sqrtwm1s[j]); // Sqrt of previous element. sqrt(1/e), sqrt(sqrt(1/e)) ... + } // for j + + + // Output values as C++ arrays, as static and constexpr as possible. + fout << std::noshowpoint; // Do show NOT trailing zeros for halves and sqrts values. + + fout << + "\n" "BOOST_STATIC_CONSTEXPR lookup_t halves[noof_halves] = " // + "\n" "{ // Common to Lambert W0 and W-1 (and exactly representable)." << "\n "; + for (int i = 0; i != noof_halves; i++) + { + fout << halves[i] << 'L'; + if (i != noof_halves - 1) + { // Omit trailing comma on last element. + fout << ", "; + } + else + { + fout << std::endl; + } + } + fout << "}; // halves, 0.5, 0.25, ... 0.000244140625, common to W0 and W-1." << std::endl; + + fout << + "\n" "BOOST_STATIC_CONSTEXPR lookup_t sqrtw0s[noof_sqrts] = " // + "\n" "{ // For Lambert W0 only." << "\n "; + for (int i = 0; i != noof_sqrts; i++) + { + fout << sqrtw0s[i] << 'L'; + if (i != noof_sqrts - 1) + { // Omit trailing comma on last element. + fout << ", "; + } + else + { + fout << std::endl; + } + } + fout << "}; // sqrtw0s" << std::endl; + + fout << + "\n" "BOOST_STATIC_CONSTEXPR lookup_t sqrtwm1s[noof_sqrts] = " // + "\n" "{ // For Lambert W-1 only." << "\n "; + for (int i = 0; i != noof_sqrts; i++) + { + fout << sqrtwm1s[i] << 'L'; + if (i != noof_sqrts - 1) + { // Omit trailing comma on last element. + fout << ", "; + } + else + { + fout << std::endl; + } + } + fout << "}; // sqrtwm1s" << std::endl; + + fout << std::scientific // May be needed to avoid very large dddddddddddddddd.ddddddddddddddd output? + << std::showpoint; // Do show trailing zeros for sqrts and halves. + + // Two W0 arrays + + fout << // W0 e values. + "\n" "BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0es] = " // + "\n" "{ // Fukushima e powers array e[1] = 2.718, 1. ... e[64] = 4.3596100000630809736231248158884615452e-28." << "\n "; + for (int i = 0; i != noof_w0es; i++) + { + fout << w0es[i] << 'L'; + if (i != noof_w0es - 1) + { // Omit trailing comma on last element. + fout << ", "; + } + if (i % 4 == 0) + { + fout << "\n "; + } + } + fout << "\n}; // w0es" << std::endl; + + fout << // W0 z values for W[1], . + "\n" "BOOST_STATIC_CONSTEXPR lookup_t w0zs[noof_w0zs] = " // + "\n" "{ // z values for W[0], W[1], W[2] ... W[64] (Fukushima array Fk). " << "\n "; + for (int i = 0; i != noof_w0zs; i++) + { + fout << w0zs[i] << 'L'; + if (i != noof_w0zs - 1) + { // Omit trailing comma on last element. + fout << ", "; + } + if (i % 4 == 0) + { + fout << "\n "; + } + } + fout << "\n}; // w0zs" << std::endl; + + // Two arrays for w-1 + + fout << // W-1 e values. + "\n" "BOOST_STATIC_CONSTEXPR lookup_t wm1es[noof_wm1es] = " // + "\n" "{ // Fukushima e array e[1] = e[1] = 2.718 ... e[64] = 4.60718e+28." << "\n "; + for (int i = 0; i != noof_wm1es; i++) + { + fout << wm1es[i] << 'L'; + if (i != noof_wm1es - 1) + { // Omit trailing comma on last element. + fout << ", "; + } + if (i % 4 == 0) + { + fout << "\n "; + } + } + fout << "\n}; // wm1es" << std::endl; + + fout << // Wm1 z values for integral K. + "\n" "BOOST_STATIC_CONSTEXPR lookup_t wm1zs[noof_wm1zs] = " // + "\n" "{ // Fukushima G array of z values for integral K, (Fukushima Gk) g[0] (k = -1) = 1 ... g[64] = -1.0264389699511303e-26." << "\n "; + for (int i = 0; i != noof_wm1zs; i++) + { + fout << wm1zs[i] << 'L'; + if (i != noof_wm1zs - 1) + { // Omit trailing comma on last element. + fout << ", "; + } + if (i % 4 == 0) + { // 4 values per line. + fout << "\n "; + } + } + fout << "\n}; // wm1zs" << std::endl; + + fout << "} // namespace lambert_w_lookup\n} // namespace detail\n} // namespace math\n} // namespace boost" << std::endl; + } + catch (std::exception& ex) + { + std::cout << "Exception " << ex.what() << std::endl; + } + + fout.close(); + return 0; + +} // int main() + +/* + +Original arrays as output by Veberic/Fukushima code: + + +w0 branch + + + +W-1 branch + +e: 2.7182818284590451 7.3890560989306495 20.085536923187664 54.598150033144229 148.41315910257657 403.42879349273500 1096.6331584284583 2980.9579870417274 8103.0839275753815 22026.465794806707 59874.141715197788 162754.79141900383 442413.39200892020 1202604.2841647759 3269017.3724721079 8886110.5205078647 24154952.753575277 65659969.137330450 178482300.96318710 485165195.40978980 1318815734.4832134 3584912846.1315880 9744803446.2488918 26489122129.843441 72004899337.385788 195729609428.83853 532048240601.79797 1446257064291.4734 3931334297144.0371 10686474581524.447 29048849665247.383 78962960182680.578 214643579785915.75 583461742527454.00 1586013452313428.3 4311231547115188.5 11719142372802592. 31855931757113704. 86593400423993600. 2.3538526683701958e+17 6.3984349353005389e+17 1.7392749415204982e+18 4.7278394682293381e+18 1.2851600114359284e+19 3.4934271057485025e+19 9.4961194206024286e+19 2.5813128861900616e+20 7.0167359120976157e+20 1.9073465724950953e+21 5.1847055285870605e+21 1.4093490824269355e+22 3.8310080007165677e+22 1.0413759433029062e+23 2.8307533032746866e+23 7.6947852651419974e+23 2.0916594960129907e+24 5.6857199993359170e+24 1.5455389355900996e+25 4.2012104037905024e+25 1.1420073898156810e+26 3.1042979357019109e+26 8.4383566687414291e+26 2.2937831594696028e+27 6.2351490808115970e+27 + +g: -0.36787944117144233 -0.27067056647322540 -0.14936120510359185 -0.073262555554936742 -0.033689734995427351 -0.014872513059998156 -0.0063831737588816162 -0.0026837010232200957 -0.0011106882367801162 -0.00045399929762484866 -0.00018371870869270232 -7.3730548239938541e-05 -2.9384282290753722e-05 -1.1641402067449956e-05 -4.5885348075273889e-06 -1.8005627955081467e-06 -7.0378941219347870e-07 -2.7413963540482742e-07 -1.0645313231320814e-07 -4.1223072448771179e-08 -1.5923376898615014e-08 -6.1368298043116385e-09 -2.3602323152914367e-09 -9.0603229062698418e-10 -3.4719859662410078e-10 -1.3283631472964657e-10 -5.0747278046555293e-11 -1.9360320299432585e-11 -7.3766303773930841e-12 -2.8072868906520550e-12 -1.0671679036256938e-12 -4.0525329757101402e-13 -1.5374324278841227e-13 -5.8272886672428505e-14 -2.2067908660514491e-14 -8.3502821888768594e-15 -3.1572276215253082e-15 -1.1928704609782527e-15 -4.5038074274761624e-16 -1.6993417021166378e-16 -6.4078169762734621e-17 -2.4147993510032983e-17 -9.0950634616416589e-18 -3.4236981860988753e-18 -1.2881333612472291e-18 -4.8440839844747606e-19 -1.8207788854829806e-19 -6.8407875971564987e-20 -2.5690139750481013e-20 -9.6437492398196038e-21 -3.6186918227652047e-21 -1.3573451162272088e-21 -5.0894204288896066e-22 -1.9076194289884390e-22 -7.1476978375412793e-23 -2.6773000149758669e-23 -1.0025115553818592e-23 -3.7527362568743735e-24 -1.4043571811296988e-24 -5.2539064576179218e-25 -1.9650175744554385e-25 -7.3474021582506962e-26 -2.7465543000397468e-26 -1.0264389699511303e-26 + +a: 1.6487212707001282 1.2840254166877414 1.1331484530668263 1.0644944589178595 1.0317434074991028 1.0157477085866857 1.0078430972064480 1.0039138893383477 1.0019550335910028 1.0009770394924165 1.0004884004786945 1.0002441704297478 + +b: 0.50000000000000000 0.25000000000000000 0.12500000000000000 0.062500000000000000 0.031250000000000000 0.015625000000000000 0.0078125000000000000 0.0039062500000000000 0.0019531250000000000 0.00097656250000000000 0.00048828125000000000 0.00024414062500000000 + + +*/ + + diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index e46a6550d..7c2375141 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -7,7 +7,7 @@ // or copy at http://www.boost.org/LICENSE_1_0.txt) // test_lambertw.cpp -//! \brief Basic sanity tests for Lambert W function plog +//! \brief Basic sanity tests for Lambert W function plog productlog //! or lambert_w using algorithm informed by Thomas Luu, Veberic and Tosio Fukushima. #include // for real_concept @@ -33,7 +33,6 @@ using boost::math::policies::digits2; using boost::math::lambert_w0; using boost::math::lambert_wm1; - #include #include #include @@ -85,15 +84,16 @@ std::string show_versions() #endif // __GNUC__ #ifdef __MINGW64__ -std::cout << "MINGW64 " << __MINGW64_MAJOR_VERSION__ << __MINGW64_MINOR_VERSION << std::endl; +std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION << std::endl; +// +// << __MINGW64_MAJOR_VERSION << __MINGW64_MINOR_VERSION << std::endl; not declared in this scope??? #endif // __MINGW64__ #ifdef __MINGW32__ -std::cout << 2MINGW64 " << __MINGW32_MAJOR_VERSION__ << __MINGW32_MINOR_VERSION << std::endl; +std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION << std::endl; #endif // __MINGW32__ message << "\n STL " << BOOST_STDLIB; - message << "\n Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100; #ifdef BOOST_HAS_FLOAT128 @@ -112,6 +112,7 @@ void test_spots(RealType) using boost::math::lambert_w0; using boost::math::lambert_wm1; using boost::math::constants::exp_minus_one; + using boost::math::constants::e; using boost::math::policies::policy; /* Example of an exception-free 'ignore_all' policy (possibly ill-advised?). @@ -129,12 +130,12 @@ void test_spots(RealType) #ifndef BOOST_NO_EXCEPTIONS BOOST_CHECK_THROW(boost::math::lambert_w0(-1.), std::domain_error); BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. - // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // If infinity should throw. + // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Was If infinity should throw, now infinity. BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex. - #else - BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits > : // Error in function boost::math::lambert_w0() : Argument z is infinite! BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // Infinity allowed. + BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::infinity()), std::domain_error); // Infinity NOT allowed. } if (std::numeric_limits::has_quiet_NaN) - { // Argument Z == NaN is always an throwable error. + { // Argument Z == NaN is always an throwable error for both branches. // BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is: // Error in function boost::math::lambert_w0(): Argument z is NaN! BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); @@ -248,18 +250,17 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::denorm_min()), std::domain_error); } - // Some tests of Lambert W-1 branch. - + // Tests of Lambert W-1 branch. BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 at the singularity branch point. lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), BOOST_MATH_TEST_VALUE(RealType, -1.), tolerance); // Near singularity and using series approximation. - //N[productlog(-1, -0.36), 50] = -1.2227701339785059531429380734238623131735264411311 + // N[productlog(-1, -0.36), 50] = -1.2227701339785059531429380734238623131735264411311 BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.36)), BOOST_MATH_TEST_VALUE(RealType, -1.2227701339785059531429380734238623131735264411311), - tolerance); + tolerance); // quadfloat fails -1.22277013397850595294736893808946655 at 2e-19 // Near singularity and NOT using series approximation (switch at -0.35) // N[productlog(-1, -0.34), 50] @@ -324,8 +325,6 @@ void test_spots(RealType) BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868), tolerance); - - // z == zero. if (std::numeric_limits::has_infinity) @@ -339,22 +338,49 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error); } - // Just right and Too big for lookup - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348e+29)), + // Tests for too big and too small to use lookup table. + // Exactly W = 64, not enough to be OK for lookup. + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348e+29)), // Fails 63.999989810930515 != 64.0 difference1.59204e-07 + //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348e+29)), + // fails Argument z = 3.9904954117194347e+29 is too large! (Should not occur, please report.) + // i:\modular - boost\libs\math\test\test_lambert_w.cpp(345) : last checkpoint + // Corrected with an <= test rather than an < BOOST_MATH_TEST_VALUE(RealType, 64.0), tolerance); -// Just too big, so using log approx and Halley refinement. + // Just below z for F[64] + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.99045411719434e+29)), + BOOST_MATH_TEST_VALUE(RealType, 63.999989810930515), tolerance); + + // Just too big, so using log approx and Halley refinement. BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29)), BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677), tolerance); - // reduced precision + + // Check at reduced precision. BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29), policy >()), BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677), - // tolerance * 1e10); // Fails 0.00002); // 0.00001 fails. + // Similar tests for W-1 branch lambert_wm1(-1.0264389699511283e-26) = -64.000000000000000 + // Exactly z for W=-64 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.0264389699511282259046957018510946438e-26)), + BOOST_MATH_TEST_VALUE(RealType, -64.000000000000000000000000000000000000), + tolerance); + + // Just more negative than G[64 max] = wm1zs[63] so can't use lookup table. + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.5e-27)), + BOOST_MATH_TEST_VALUE(RealType, -65.953279000145077719128800110134854577850889171784), + tolerance); + + // Just less negative than G[64 max] = wm1zs[63] so can use lookup table. + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.1e-26)), + BOOST_MATH_TEST_VALUE(RealType, -63.929686062157630858625440758283127600360210072859), + tolerance); + + + + @@ -369,8 +395,6 @@ void test_spots(RealType) // BOOST_MATH_TEST_VALUE(RealType, -68.702163291525429160769761667024460023336801014578L), // tolerance); - - // Check for overflow when using a double (including when using for approximate value for refinement for higher precision). // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 @@ -384,10 +408,6 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(-0.5), std::domain_error); - - - - // This fails for fixed_point type used for other tests because out of range? //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), //BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019), @@ -396,7 +416,6 @@ void test_spots(RealType) // // 15.258789063 // // 11.383346558 // tolerance * 100000); - // So need to use some spot tests for specific types, or use a bigger fixed_point type. // Check zero. @@ -407,6 +426,8 @@ void test_spots(RealType) // 'boost::multiprecision::detail::expression,boost::multiprecision::et_on>,void,void,void>' // : no appropriate default constructor available // TODO ??????????? + + /* if (std::numeric_limits::is_specialized) { // Check +/- values near to zero. @@ -442,13 +463,9 @@ void test_spots(RealType) BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); } - - */ - - + */ // Checks on input that should throw. - // This should throw when implemented. //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-0.5), @@ -458,8 +475,6 @@ void test_spots(RealType) // Error in function boost::math::lambert_w0(): // Argument z = -0.5 out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?). BOOST_CHECK_THROW(lambert_w0(-0.5), std::domain_error); - - } //template void test_spots(RealType) BOOST_AUTO_TEST_CASE(test_types) @@ -474,10 +489,10 @@ BOOST_AUTO_TEST_CASE(test_types) // Fundamental built-in types: test_spots(0.0F); // float test_spots(0.0); // double - //if (sizeof(long double) > sizeof (double)) - //{ // Avoid pointless re-testing if double and long double are identical (for example, MSVC). - // test_spots(0.0L); // long double - //} + if (sizeof(long double) > sizeof(double)) + { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). + test_spots(0.0L); // long double + } // TODO - renable these tests when lambert_wm1 lookup table complete // Multiprecision types: @@ -486,25 +501,26 @@ BOOST_AUTO_TEST_CASE(test_types) //test_spots(static_cast(0)); // Fixed-point types: - // Some fail 0.1 to 1.0 ??? - //test_spots(static_cast >(0)); + // test_spots(static_cast >(0)); // fixed_point::negatable<15,-16> has range 1.52587891e-05 to 32768, epsilon 3.05175781e-05 //test_spots(boost::math::concepts::real_concept(0.1)); // "real_concept" - was OK. -} // BOOST_AUTO_TEST_CASE( test_types ) +} // BOOST_AUTO_TEST_CASE( test_types) -BOOST_AUTO_TEST_CASE(test_range_of_values) +BOOST_AUTO_TEST_CASE(test_range_of_double_values) { using boost::math::lambert_w0; using boost::math::constants::exp_minus_one; BOOST_TEST_MESSAGE("Test Lambert W function type double for range of values."); + // Want to test almost largest value. // test_value = (std::numeric_limits::max)() / 4; // std::cout << std::setprecision(std::numeric_limits::max_digits10) << "Max value = " << test_value << std::endl; - // Can't use a test like this for all types because max_value depends on RealType and thus the expected result of lambert_w0 does too. + // Can't use a test like this for all types because max_value depends on RealType + // and thus the expected result of lambert_w0 does too. //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(test_value), // BOOST_MATH_TEST_VALUE(RealType, ???), // tolerance); @@ -512,7 +528,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) typedef double RealType; - int epsilons = 2; + int epsilons = 1; RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; @@ -538,7 +554,6 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // 0.00990147384359501 wolfram digits10 // 0.0099014738435950119 N[lambert_w[0.01],17] // 0.00990147384359501 N[lambert_w[0.01],15] which really is more different than expected. - // 0.00990728209160670 approx // 0.00990147384359511 previous @@ -603,37 +618,39 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) if (std::numeric_limits::is_specialized) { // Check near std::numeric_limits<>::max() for type. - //std::cout << std::setprecision(std::numeric_limits::max_digits10) - // << (std::numeric_limits::max)() // == 1.7976931348623157e+308 - // << " " << (std::numeric_limits::max)() / 4 // == 4.4942328371557893e+307 + // << (std::numeric_limits::max)() // == 1.7976931348623157e+308 + // << " " << (std::numeric_limits::max)()/4 // == 4.4942328371557893e+307 // << std::endl; // All these result in faulty error message // unknown location : fatal error : in "test_range_of_values": class boost::exception_detail::clone_impl >: Error in function boost::math::lambert_w0(): Argument z = %1 too large. // I:\modular - boost\libs\math\test\test_lambert_w.cpp(456) : last checkpoint - //BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/4), // near max_value/4 for IEEE 64-bit double. - // static_cast(700.45838920868939857588606393559517), - // // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 - // // as a double == 701.83341468208209 - // // Lambert computed 702.02379914670587 - // std::numeric_limits::epsilon()); + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(1.7976931348623157e+308 / 2), // max_value/2 for IEEE 64-bit double. + static_cast(702.53487067487671916110655783739076368512998658347L), + // N[productlog[0, 1.7976931348623157*10^308 /2],50] == 702.53487067487671916110655783739076368512998658347 + tolerance); - //BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307/2), // max_value/2 for IEEE 64-bit double. - // static_cast(701.15054872492476914094824907722937), - // // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 - // // as a double == 701.83341468208209 - // // Lambert computed 702.02379914670587 - // std::numeric_limits::epsilon()); + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(1.7976931348623157e+308 /4), // near max_value/4 for IEEE 64-bit double. + static_cast(701.8427092142920014223182853764045476L), + // N[productlog(0, 1.7976931348623157* 10^308 /4 ), 37] =701.8427092142920014223182853764045476 + // N[productlog(0, 0.25 * 1.7976931348623157*10^307), 37] + tolerance); - //BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307), // max_value for IEEE 64-bit double. - // static_cast(702.02379914670587), - // // N[lambert_w[4.4942328371557893e+307], 35] == 701.84270921429200143342782556643059 - // // as a double == 701.83341468208209 - // // Lambert computed 702.02379914670587 - // // std::numeric_limits::epsilon() * 256); - // 0.0003); // Much less precise near the max edge. + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double. + static_cast(701.84270921429200143342782556643059L), + // N[lambert_w[4.4942328371557893e+307], 35] == 701.8427092142920014334278255664305887 + // as a double == 701.83341468208209 + // Lambert computed 702.02379914670587 + 0.000003); // OK Much less precise at the max edge??? + + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0((std::numeric_limits::max)()), // max_value for IEEE 64-bit double. + static_cast(703.2270331047701868711791887193075930), + // N[productlog(0, 1.7976931348623157* 10^308), 37] = 703.2270331047701868711791887193075930 + // 703.22700325995515 lambert W + // 703.22703310477016 Wolfram + tolerance * 2e8); // OK but much less accurate near max. // This test value is one epsilon close to the singularity at -exp(1) * x // (below which the result has a non-zero imaginary part). @@ -647,6 +664,71 @@ BOOST_AUTO_TEST_CASE(test_range_of_values) // Would not expect to get a result closer than sqrt(epsilon)? } // if (std::numeric_limits::is_specialized) + // Not using near_singularity series approximation. + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)), + BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545), + // Output from https://www.wolframalpha.com/input/ + //N[productlog(-1, -0.3), 50] = -1.7813370234216276119741702815127452608215583564545 + tolerance); + + // Using table lookup and schroeder with decreasing z to zero. + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.2)), + BOOST_MATH_TEST_VALUE(RealType, -2.5426413577735264242938061566618482901614749075294), + // N[productlog[-1, -0.2],50] -2.5426413577735264242938061566618482901614749075294 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.1)), + BOOST_MATH_TEST_VALUE(RealType, -3.5771520639572972184093919635119948804017962577931), + //N[productlog(-1, -0.1), 50] = -3.5771520639572972184093919635119948804017962577931 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.001)), + BOOST_MATH_TEST_VALUE(RealType, -9.1180064704027401212583371820468142742704349737639), + // N[productlog(-1, -0.001), 50] = -9.1180064704027401212583371820468142742704349737639 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.000001)), + BOOST_MATH_TEST_VALUE(RealType, -16.626508901372473387706432163984684996461726803805), + // N[productlog(-1, -0.000001), 50] = -16.626508901372473387706432163984684996461726803805 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-6)), + BOOST_MATH_TEST_VALUE(RealType, -16.626508901372473387706432163984684996461726803805), + // N[productlog(-1, -10 ^ -6), 50] = -16.626508901372473387706432163984684996461726803805 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.0e-26)), + BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868), + // Output from https://www.wolframalpha.com/input/ + // N[productlog(-1, -1 * 10^-26 ), 50] = -64.026509628385889681156090340691637712441162092868 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2e-26)), + BOOST_MATH_TEST_VALUE(RealType, -63.322302839923597803393585145387854867226970485197), + // N[productlog[-1, -2*10^-26],50] = -63.322302839923597803393585145387854867226970485197 + tolerance *2); + + // Smaller than lookup table, so must use approx and Halley refinements. + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-30)), + BOOST_MATH_TEST_VALUE(RealType, -73.373110313822976797067478758120874529181611813766), + // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 + tolerance); + + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "(std::numeric_limits::min)() " << (std::numeric_limits::min)() << std::endl; + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2.2250738585072014e-308)), + BOOST_MATH_TEST_VALUE(RealType, -714.96865723796647086868547560654825435542227693935), + // N[productlog[-1, -2.2250738585072014e-308],50] = -714.96865723796647086868547560654825435542227693935 + tolerance); + + // For z = 0, W = -infinity + if (std::numeric_limits::has_infinity) + { + BOOST_CHECK_EQUAL(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, 0.)), + -std::numeric_limits::infinity()); + } + } // BOOST_AUTO_TEST_CASE( test_main ) /* From 89ae7288360fa6de8ed7a2165f0298e81c0701b0 Mon Sep 17 00:00:00 2001 From: pabristow Date: Mon, 6 Nov 2017 17:18:33 +0000 Subject: [PATCH 21/71] added graphs and updated docs to use them. --- doc/graphs/diode_iv_plot.png | Bin 0 -> 35457 bytes doc/graphs/diode_iv_plot.svg | 76 ++++++++ doc/graphs/lambert_w_graph.png | Bin 0 -> 16208 bytes doc/graphs/lambert_w_graph.svg | 65 +++++++ doc/graphs/lambert_w_graph_big_W.png | Bin 0 -> 20562 bytes doc/graphs/lambert_w_graph_big_W.svg | 67 +++++++ doc/html/index.html | 2 +- doc/html/indexes/s01.html | 9 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 10 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 56 ++++++ example/lambert_w_diode_graph.cpp | 115 ++++++------ example/lambert_w_graph.cpp | 174 ++++++++++++++++++ .../math/special_functions/lambert_w.hpp | 8 +- .../lambert_w_lookup_table.ipp | 10 +- test/lambert_w_lookup_table_generator.cpp | 35 ++-- 20 files changed, 543 insertions(+), 94 deletions(-) create mode 100644 doc/graphs/diode_iv_plot.png create mode 100644 doc/graphs/diode_iv_plot.svg create mode 100644 doc/graphs/lambert_w_graph.png create mode 100644 doc/graphs/lambert_w_graph.svg create mode 100644 doc/graphs/lambert_w_graph_big_W.png create mode 100644 doc/graphs/lambert_w_graph_big_W.svg create mode 100644 example/lambert_w_graph.cpp diff --git a/doc/graphs/diode_iv_plot.png b/doc/graphs/diode_iv_plot.png new file mode 100644 index 0000000000000000000000000000000000000000..707cdcb2fff4e5299cc23d8ebf4450ebbbf5b3e3 GIT binary patch literal 35457 zcmeAS@N?(olHy`uVBq!ia0y~yU|h_=z-Z0E#=yW(u;AS-1_lO}VkgfK4h{~E8jh3> z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYmdA*=|3C1Ne{Z-ZmsppZh>NRm^_m;I*-Xney7^w5;nMq5 zJX5a;Jt!@`e1Emf z_q#Xe&b%tb)TrV)NhNc_wq?u{K&-p_|5tNwxEP@@NyRfLRhWMVbJocdY#T0nSbzkc zs_9?$oTTC@r9OG0isz&yg+`KtguAy*NlB@ov^4e6kSXz3uL?TFX z^2ryfzB3FMb#-;OPM_4V~4T&|5@#q{HPrcD#8{{Bw)>x`n}Vopv@ zMK!f$SGMbVK7IS~@$r_HmJBPNl|3)BtQxK#-H>?r!-o$F>gw%Jo}|3Hv-9voWp|5$ z2Mn{#^V9C{tDP}p#)?dcXxx^R|hcF~Iqim$G(Kff+^_m3}^{WGtu5M(HScjw`=v$MBkTx@!Eb@l4C z)2B>1a&K?-&g$=ayLRm|$-LCEulDz%_3PskCs4-`}xr`|f}9 z=FKz<9)J^pPZch z<>lq}X}Zy$K0I{Ri`(Pz_*idYNlD7{b93+PtDU{G_<2%dBBO(!A7AyiHxCcBa!W`_ zUD{oqAGIZ8;kNfXc3Ak$w>vAHzsK=#8!smh&y(r#b&lTN-TP{PU)oWa9C|l+xnJS) zbFvIfOiUi$-iL48m?39dCGx9IMP0r4&yT`6bLVE>+LGD$bh>`LnuW!TxV=@085tZJ z^~bHt-aPpC_xFvPHw{xxOkn!%`tIJ|)4kH>8Ta;BPMbC@=k~VV2M-eV{rTiwQaZJM z*Y)-B&reKLK63nc@YbwQ8ylM!x3;d%lJ1wce|BeQaYaRiNQUE^ySv4?xw-f3-Fx+v zva<5c&FTCPA3ltTj11hI=G(?A-8OAn*uvxd1rHCg%Gp-6Y~OA^ZQ8V~)1N+l`tfr4 z{1tI~tZEJD-58?Aoryp{v8r-*MlUeSKZwyE~Q)dH467oo8FkaOK|p z4<8EpWUbvYGBkGX+*wgo_2}{A=Dt3^# zRAxxb%+$PB@tBvfZY$=lnz=J(s} zu6Fm1c8hbz#>O&ou(PuVZqJKdxO}<#G`-kWtAf|Z*(T=X#3bCcEPlq}@aNNM{Z*TG z?66?$I5*e2Thcgy}+`QSj%y;&x z+~oWFYMBJM#dI_Tw)ge*fr2P1(!rs@z{p6*&CP95;p1b6PM-8+P%=0FKJ&PKi@0mf=tXDcTHNNI!>xGLK1*@v64jn%1JY(iePKO^qeyr%zpFe&2 zbcPUn|Ji1154>j=m^g8w6Ne(7jD^CMEn8Y<&Ybz-%NLPv-@Y*k+}%~GEpU5f@bZ?{ z*47J`E(zuD`PjB1boI0i+qaA7-r6GAU{U^VPSoF4ZgH;M+}wvRUTD0!x>|k9)~&76 zr%(6r^{svPTiMpT=frtOBgwr>7O5=el{VvW;E^zJ2n~xc>gwnam^N+Np;M>4SXfwA zoZ6muR|}-Ky}kX!$&-Oo^&>VoFeE)WF>#fCH#@&vN7>t3qO*E-mA}{H;o)&fNLV1? z)N$sF&&7SU)rkoS3Q9^!aTRNJm%kTl*syI|*zZR^{{G?@FJ4?V-+NL|PHt}N=FOWy zadG0r34zSaOs9_hlP9iSyY|J^)zf#Bzn|yf?H#RQ>&(Xv2qZ-@>{}zrDH1B;ejBQ~B_> zQj5U*{r~qd9GPjHe&y8X@4K_EYALn|NJ>hAqRqn6a^=0xFJ5GTvj4+3Z*)F=`V{i| znYwaxbhKf~ivW;aAD^5QUKpU!;7<7JO1~Kfj$7Z(wJsO4xHzTDS#5Dp@RXD- z_5c4d#aFbdF8-tc`p`a$Ptn%wd@=$~91|x`RtCkv#*G_2yu5-||NijsFw@Bw&(6+f z5;)w(8@zh<|J1MNH(yIXnLl$)^!9fAr!cT!4TUQ%V`h>wro z`YG{n8>h3g^TY`g6j}t5PEXTi63`A`7qZ$s`}svk z{(95(@ zZf<7Cy8h>L>DyaV|Nj17{OwKTuP-kT-`!o_+16f=> z-`^j?jeiwUR8&;)<%OW3q2a3Y zm41GGSwH3L|1df%_nRBHL$}rG;LhUb2BxN|mzViwo!+u#OWcp|%6n({xIG2c_Y6CB z?zG(==j6oXurRh$Rz`*))rhg9tE(#Q?(^K=r>1JNu(GbyEiNon)YpH%^R>FV`r-f$ z17qXhQke@|{v_`zdmGhQsG+B)*V^}9>kV63rle(&igDVRg#Z8k@<^NYyuH1B^30hl ze<}S-KePYeFYV=ibF~DD|8;r?=G@-KD=jTu_v0bETaU!SKR-X;+>q!zabL{*r<48d z9HXOWw{nYrI;lQ?L&`}ZF};`*)$jLyKU8{qYqtB@S*ABPCbP%a{ZzHGva0$2_j^TE z)u(IG`HZLfq`6uj&76PxPoM73`JX3w`1(HGeBLhk^|iGxUcY|)=#f)WQc`2p$&)7; zZrr@Nw_tW=W@bui>cXW(|NI+1_bsYHn_Bs(rgRO^)4t`rtz6c7_+1 zmYyztJ#*G9CXrw5lmDxxrKPbgklH+D;>5ru5}(fJ-LL;&+tl35y=R(U?5{gtb#-(u zT)L#BtGo8ZZ=LL)$G_aGelJ?(^E3VV)6^Fi7QT4(YE$ZIF@`^X{;UXI&X;?8o36m; zW4+Scy_GjMB)Z<4zj33Xv{{aVhDL|yWHnI9xU2N_v9GVMd)M$pMMa&NVc2}(LV%cl zoKIPq*<^M9w9n7Z>c@mfN6&tExLsIS`0&NW?v}N`OdK5@vrbz4FP=SRO2`YdPxik- zf%4+|dilD#x;0T-yI#D=(2Ln|V1{8b*Ok-$HRrpY&iC>0xp4LB(My*$UAP}zP_V(r zMc-3xvC+5r|NpdWhp)S^r?U9gmdww0cE!cTF|e?)iA79{pH|O#{Nzc_fVg*pPAjhJ zzFD&=_4G6b8Ox$24u2OJ7#c22Jlw{iXi@a!MDgpa%*=^%=dRs0|I8Vmx}Q&{C%yk( z8TV~Q*CSWmWA&@T)=J&GcW;hO<)ppU-;4hKDg~7>Wu3bA&kncqPmk*H^YdF1yL+0b zcG!g3vsYXFWDNOz?%cVs=;zDl*HyjS7#S61RQ$}R?)O`BhHr0ghcAh6>yc=jHcc#g zTh77r=lPYDmD~7aS4HLJ=JrmWEIe`IL>CvA6>C=qXzVC>$aL%0EmpmUf202u{{1Z> zXIFEgQ&|1Qy}j1^_U${rH)m%3(nmKoCTBej3=CZL_}ucvi=96|JKNdU_w3Qp?(@CA zT9Pw+PI)*vF`b^KoBZX)#fZpA(U)h6-rU&u;>C*(SHt61`aUiG`>V9>&qw#1oE!;@ z0)+*8a-P3?=jY+kam)0Lu)5!a$B%;(Zud%?FH1h&H^;iX@9F93;y*t5`TN%=)?8lh z&;H3X^s4Q;*uMHc@v6uEk0qH>^y$SVCq6P4Xp>B<|WaP;-{t%=`1FTVb7XzombMJLvt zn=)kz)BEMywtYJPbN=+XGP1IaSN1u4e{(Zf!Sfk64^K$7{Ac~_TeokEYpyfDSJ5n{ z8};F|{{9X1|LfTJWFiu#P2?0-n=pO)@iQ}xuTDBS%QTyVlXIc}d^`O;fBr1G@BiJEH;?p1fD0ufE@W?%ut73knMb_4M=>MQzP;ijIzE0JRXa?s|T<&7O0y zOH>eZm;;^}F+ z+FP>AQ&N@`l$VP)WL#M>@x#}zqKDi0#lOC~Dm+=;U+>b#XWxyCjEscd-rg?0x9Y2q zY1S2i;N^ayS5L|pCuL@8&N9tb>*?)vJv~h~^s)0i({n2fe(rr4wmvTQ#iti9G9JEs zsmbv0<;#^;YUSnShIM}`Lig798UHemj=s(GxWmcWxwW&i^TPG(;>zxQIz{W(o;l-_ zn3);5K>NQvD;pb^w6yfXrAt+BZOv9!^O>PgQ&ZEjc=6&N58LHKzJ98{{PXv3@f&Ud z0TWhLf7wy^_{fID!yqrN2wy+1;?tAPRdHoy+g8Ny-^bw6%*N~T_SV+cb?esM*qH3T zaPP~UoE(?AR;3_4N0xX_cA2Ub3ThGWD199^u`ixO@!ITibib&YheNUtU~v_L*tqnv#;j(dxAD)v?(1akdZN zzSY&y(P>$~emz6W?%lhi`gg_G{dA3pj9mH1)WASsb=X=VVRb)|h8>lkm))v+es1pS zS5qw$4lo!d9%2bC{~=ylKb`AydA`-$pPy&0_whDv*#F#ba@VtylhtqBy7lPUv$pPT zZaqCcP#6E+-fH9gdp2S^5dkkEQ=_7!)YQ}}s;gI@`@|5nCBt#K-`t8%PdLlp-&57q z?Ul2w+EDp9?Ox4i->tb8*4B^TzV(fYlA1Yl=9Sgq{ifO1F6=B$pEP-L=G9eGZ&{_K zrS-_!N<~LUCnY6u@bS5Mdv|ZYUpIT9bNebQPaFS!IopgYD+FiGoO$HPkp=75`~Uv- zR?;kIM%LdpUg@CCX}&_j!WS=IOuVzB5LA%exf65d?AedszJ={o=W1=lmb22# z%0AxBjcwPiT_rCrFs7$JXFBcc>nmwnW%BLYw~|F4JP=Wzj-2VODZD?Y$r0VOdB}QCENb@ZrHWUg;Ot)=CEk2AX7F^LaaO z+T_W?m6eq&?Ciqg;_l1+=HA$rD_#2PO69|i&sWFpHuLoK+>(2H+Xb;1eSLh*?EJ@$ z9&KH*LgU??oy{9J8ValVBwSwR%bI4>(cizk?Cq^DudaIMO4t7SqG)OwdNnxjKm+58 zmoG1_kGJ2nd2?rf|M6qT+ODn+H%>hz^5yGSPEO8)$BwmKTN}-MYTBJ8o|7{!FXL@y z<4wA`DYfLyjfwJgKN@$Jzc;G?SF_bp_4f9B|KokKp8o#NA0BR3QBwoOmYUCufCb`9 zLPTC3Fk;x!@}NHVlf;9gd%aXVC&i`DoH=vHu3btk0bir0p7PRJU}HG-dyk6esx8;n zL>`u}|8wy2a(~9BdzXRgWKq$j*SG_;syC&ocm^$f`s&pxsl{nYNlsN&R<~~5>XEaZ zwKe;?n3d(mkXiroBu}P*R85^Z(=#DKAu%yAB`qx}G12k#G~Jbfi`$ktuU1Jhnxx`6 z$>g2su5^`_1ILfI=iS|vX(i%0No8e=R*g~A<}}{r{`1vLO+zm)^q8dLsT#6y^2M{W z%_FzvNXFNGox02!G}amC)H-*owXN;kgU#%lGcPYoIxDZ{IZ0)2l~&H_7k|IsU+zEO zuA;g+8*K1P)zB07O5FQo9?mVlmw0VWew7a`Xmn>bn zvaYYscS+{wFpIG1cP&(3h9+la^-Qn6xLk3P)}sB@mqSmSE}1rMn$KLT(5sn>W@gjw z+_@ueH~mSs{=R_Ou~HA#ZnwU??>B>u^wuS5Yt6ev+qZ2qb6R-f{IjQC(b2mvv>%^p zs=LJ@ntNeqZFY9ElY+^IzU)_j*>tyT-D>iA_rLpdiWc?Aoe!L`Vnu)+>%2n;4{|c! z-6N#3SlJ<7>x1ijuOkdUeml+=HIm$#b2I2`j6{IlMU!7bhw0ZozX9)nKLeUAMIM4b@rIbkvr<@tDp31X>i8cI_JpV?Uv2YG%(zL{J@Dh zM`kP#57$e*_O0~9DIY~!)n`YidPjb}rQ5;xclDjg8yY9FiiKtgNf$1T`Ock?7t5@x zt2EbId#TLKkX`SX|6cLZN-@$}nZNI++uP?i zyTdjWel?n9y3T*`udUsC_hu(vSkbDk#GR+2?O&@2hZJEdguG!aDy*zukgHW>Sxdj)|@FYk0JNY>Hp=j6FHn5dYAP*-F3fO z@gd9fKPw+=M7y%4dryy3_2-(hM=bZIV>4UfmluJ)?TVi3r{0+(6DO=grcJ6umxlU=zYMNGt*u`~&Qt``^XU?Sj`tq{o%SoG_o*q-#z7Wrl zRn>0)r%a#T?!-53s*35&n>T&t+s!?1_nRlSnElj7<+&jzLvN*AS>`K!ZoYm0&ZS$I zIZs>??o?K0CSUtS&^YbPfs-dYJ6wF-RYKLKelxoJe*gb-%RldTx_=-5l-iG_rl%X{ z-ZEL{KfiDD=FQ6vPt;oIHM{4_moFDCuHC}x>=|_ODV@mz@O3x;* zIXx<#LHDfZ8YZ(%R`)-4^=jzlhaOXB__$39@qGI9>Bo=9<&Eq9RJ^*ndil$OC0>4N z%ATuQK1I9i+qdt^`uOwKg-pWe?P6pNAa@cqz944#zf>o^Ca?)dxmarnr{Q7^Epc443`TZ*;7L!66K+fgV ziP+GvE_OGlOOy$+V~UU4q%X6gcN8e*-rlyZ^m8)Hd}b~R6B842yS^^=;`Qsxv#zeH`Fb_Hb=~i;*W)*5URL|| z_O|6X=Crd(|Ns46TE`%ki;XT#>rpaJEY zUoV%RnQuS;P0rKr?E+1nlhq9K?}5_liqO?!Z*Ol;|NQJM>$dH+zssb|ay**Zcnb;& z63)yp^qFn8b`SsSsll0(FV3^AuE_uO{KZS@3{ZfFf`$xurA!vM_sh-Vd%CsY%ZtES z=J|a)ckW!Z#(TP+ii(PWgapR{`T9SO85tUTtG)(Zl{C!~VPs^qsrcX!s@9V5``cR{ zX)~YDXOABr*5ChU(KV^nJzBX&la^e+Sbo2@eez^s+v;yuN;KB@ZrETTBO`O=l#Hxw z=xK&N8Ox^jc6K(l`uTUhy}vJSY;3$O=jI|U>+*Lp{c^TRCnhMaGBP(e=i%Y`@%4KA z=}!i6l}3`Dm$H-I-r9O)MPT#2z17)PQ?7gEOw?0|6bZP6>t)~5Qwpxc5S9}H4U+Wt|^{ZCsste2g z<$c>f-P*WytL_DDJyTOr25W0;hD(<(U%Y%-d&9dGfr~l#`JW%@6i!J^-B|rSuZ>?m zZo#~L`|Mu6e3>dxdo(b!`m*Px*GZqBot2Q3G|af5;M@KwYE|TBwTTlaf*g2#O{8$c ztE;PvKR-Lm^m<#)%}KjTUvH}XoE8)mbmHX6h4K6ASYO#zerkDjb@g<|FQV>Cb0uSU zm2|ovbX@gpvr4E-^tK$w`1ts@axEddc9pz5^z-xc(6x#UkB|2!=jN`RbrIaLkQM!x zd1XbQj732Ms8zT=-rmQ@=gKs7Rn>_TCIq~E&b{Ws$&B~+_JZb~{N`E}etmT{Y3=U1 zzg2$n_C9fWd6KT`o~hZdudRLZ?3q!?ivW-(q%Dh7OtY?lx;RUgEfbQEIB{vI_s>6{ z&xgv2fik?46Vvy1ceOYC`|$Aa$#dtPU0E5NwfDuRxpuWu>FMdS%=6=(9si`Ydc(<# zzrVinNSSnGU0pSC+BCPz%Y3OxkB&4jnny}qM}mE14JEK_oka+&#OhsjH>U;X#@x2K24gia6Vc~d(WczAg&D?h1Rym-;|-n@0|^#1+(w^T5y zHC%D>#a3={h7Vu9giPJJYuBX7la;MiJl3zBU-zr?!i4}epBW2Y1}sV6ux(q~nHh$z z>+DNkg?xFsmT5tg+TuU|ez>{0tuk_UekvS2->!Dm#2G3pb!2U;rnvXZeZ1%{4=!C-bH*WlBe0_EJdO6S#R7!gK-80dN0v7&HGJ`E${PzWEq}(&%z~qTj+S~yrV~nQBNZCfs4^I z&O0XTr+&&6m+8gqtLdH6Qeaj7`sDZM^69ttU7p9pB3JTUl z)mcw7S?8p-_}SUntJiIProMP{`uSDQx~ryLxDa4uY<%@pNlA%CNrF9F+p#BN#*$B; zHTIcJDOZG7hw<^M$U-xmFeeVyf;cP{u%*0tk_4KmiDGeb_KELp$a|Ng$(d>QBYu(bd`zunH4 zv?x$8&%gKN(b4W7KY!Ym@4a9DKi2fA^?_r$|77eow7l(eTN*bB`Kh=vF%_iR^D*gq5H%7go?{cYlI&*v-3ynepp>&AJMd% zjqSO+ik81kR*2^PzxTK~)h+z`f4q3`>F&lQfucr|j6Z(=zP!|1JZeiu{{GZ|i$q;)FP4~03i+m$V|3}-wP!y* zKAy$rJjp9IElq86`uS(C*Y9`p-hSv`r&rL%6KRbqd!0Ug`ZU8ZnXUNwxub^;If0rC zJ13s>m=vd2{QO+%pC2Em*0H6p{Iqh*$&CB^YGeKwH|*JyRJL&P5~EE;PrYt!&tGpg zBYKinx7X~RclY*sUwK^6GQrr)W7hWc^Kv=4xi7D*oD6E$_paD-GUMBun_r|1SYq!s z`KM1=@~Pz8o5(|l4|CV{7b91dhvxq*k&3r-aCbyGyizh8nEG#Ts z6TQ7pR67h*mtC@$*`wmgY-D6K!@k}QH0HXiNN1wT$8K-&p;hcU<1OWzG||X6`J0Zj^Y4#d6w;Nub#7?CD{dB5ZPfP2}W* z&Fs@(K6rNJO31z+kGPqbm^N(R{`_&jJ!lSHKgOTq;J?4WZ|oKR-X8nQJ}$+1c5bHzvEEn`is`&ex*iVo93{ zgT?Os$4;K?e0h2KmO`VNq6AR`U8<@9*#LKR;}jFM4@tY5KbD6(5tny}5b#=H_(J z@WZN_M@Krpyt>-W$jl}nBGR&TYw5~k(T}DD78MyiKR-YH|G&R;EDD<*Bv{_vtzru* zm@EGLC|sD_2^w=ebLPy3ty`ZyIM{sT`0;E7rYUEcNs}i_8mIBBTeoh< z&YgyZkB$iC*MsV@yt`7?*4Cks|Ns5nS@ZLg@&5IqT&%0Z*Dp&yKQF73V~V;Lx0sHC zq2a{b+uNpEtV`D{JN@Fk{r@MY_4hwHF;O||JR4K$HF@(qnfH6Y&wHb&;`zV$`8iq8 zqKijIyRR;rf9YbN-CBQ+#{PbOF)^_>_xHyKCwe{2Io!qz>eTNp&kwzMW~TAa*X#G+ z*jcRZKi^JOPjB6k+x&cd%Urv~vQqW*^j4*=Tept&8Ye%$x}BYzzW#cr?Jr-x?3_1G zE__{#W?{_vpeH>G12jO(LvC)(7T>pTU(JVu>{nKWa(jDw8yOjScz7rn7)*G3d;8|x z+h%3&@AYopT)dK9$5YhvU&JDQ`#&2FaNb(K|KF*Tlhp;CHk7^&sGJs?(FPb6_=@1WHie#nQi9G znJlcVpjpptXHK2sa(8#Pv9*=7F4Jk}lLfWq{`~oT{>H6a)2c2^3K9HMtP_}&qy#cF zy}&g0)|4w(Ld0~VT*}JKEG2xGzo^SzSt%gOx^SU@AY;G0bA*J8o7VsP zt3+$QPF=QGC;Hc~Um*MXWK9#Tez*zhH+tIss=l0wGn_-xIY{B~V z>!bE%US6j3{`8$YbC&zhUo|x~Ep62_(PIY>G8!8jA3Ai1EB4=$lfsiGPhJ_lJ#XS; zja5qOi$R0hE8~iajMheNeRSUbzfNJm)5Nc@uFkQj3MhL!?UYMgoE)ehac+*~j9IfL z&6v^Qv@pQ>_S-u;dGci8t=ZSv7F2zG#rn?vS^T%vfs5T1zJC4cl~Kk81wL7; zBd4ZnU;KA{@&szLd?n3~$!l~G%@cJAEy=fh$CCCipw+F6|L+x{&`NOy>GtD}%f1OllRP64uqt~xb2gO3!+gpMA>uRrp8uZ(8ZXVkG zexLXCb+MLJUo`&y{?7j3*4FGSS-F3{@$vCfd!n}GoUH%%S-wSJ)#OGuyo1viRA9Cr`c@wa2fR?&Wsz;>Dbsn_A!R z|37cR0tFo%9SOrE7CAY&rK0gOL50V`K>r=ZuiKV6PmEJG&%2Xwq(gAV?Af6F&cnmA zVZ(-mKR-VH`0-=KRZ~O5ivd&4PoKxPJ^%3g=ZY#4j}|MaxcoeIf+0OUbyHz!sM_pC z=7UFFBjZlw_HiY?xUeu}We{t?wyf)GB7>j(j@egZ37ScKzwftR{ok+RY;0_AZg1}g zg~U=X(W_5)W?fyi^4d(R(yWQwLG89{>ta`D)w;U7Z?5{9wajmB)PpeZeMgSCT)K4W z!{^V*S5^ehm^srh?To~u$B$oLUd|sE7sn%OHD$sCfjM*MdVjqaxN&k|T%6qhzwhfm ze*O$vy!PbDlLgC{AMcSg2GxkijvZSnHb*7YWOw;{H9Na`jm+$mCQLZMZ~w=^$H!-( z`C?N~j;DKP&o+N}O_zh~m-R!Nx-~vJrFRZ&#+si+Wp8eP%1JXbvn9)x8P)&$!({uYYgO9WSwDXN zHm>zKr>Cbu5tM#z&ci!9iyJ;2T*BZ# z-%j`H`O=A#1D%|h?$>->#*#bz|{!zh3o4Z*q2&`_HV7Jg7YHDquMSAZ8*W7y_!^j-*Qe!gpJZTYsAYA9HlTJ=n|9sB+{R+3e=K1&b_9*K_e=lA%f-0)e8#?vwY8XC7hdM`KRPTdQtI{l$AjzQ&Unl6g+eSW!Ej4mw&ui z++R>$u0Od}Q>5TA+Z;>g^z&NrmX;Sbscy;ReZOyY&c`W_Jh!S$ot<>Q%f!$y@ym;g zbF9nztjphBSQ~9#R8%BkTV-NrXZPpZ?flfb+>iIu&dzFGzdnECwaj~aEcHt7aD7=k zeaRw=%11A(k?F~tvcYAx{Nuj4t&C=6v z?3KQ?J^UW?t}5YYdSPmdukSqEs1)v4_G)vw*o3%x*L~?G>E~p6dU|G97C$Sl=D4~# z-2dv%#M|3)S2dm8hDyP@7*Mb&YA+$rzed-pz^-?%|@=2D3rZA*?XnJhNh&8vbd^J3-_mp||CAJ<&s zx^$w{Os}XCsa`kJMc=>gjo;(=a%;$%6qBSQ98%_aXRfRa&b+-%_uRR2t1>?b3kiWH zf33^kJ^AzV^P8KSm!A<5JRlxl(>Qmotg?IGll}ky=FfcVKIz}fGc%1_T3bO2ucEf+ z_0F3ow>A6vGQYW2`Z3=>Cg0d0xGleZjgEu?!=FD>gj>RntUg+Kvr@(0OYLW%QD)$O zZ@vFMW)C%&99^<-?dsl{&5~(X&ls%F>&pxcUXvXiyt&l(jLcbswOL)Ryxd=WzL?Z{ zOkxwYlzjR6HK@7t?cLqemzH{inllULWZ5VyH}BbFlarGpVVWf}T|d6=naC5@(jOlZ z!`4QHF8K4};^LSc1&vQnPyhUO`~6Mn=jA|Sh&44fzrVdrKG48;{?4r1Hl%T~yo}C_wsy40a5B&``8Xr7$lk4)TWiu?bg!`O>*;7CL zynp&a&^boUy)&i>{8|4xnkV7=om2ly-ruv$yR*a5#f2p-EX=~%`tl-I?k`_X{d@E5 z#l^)r_x417EzZc$P*hZ`sIJ~z{QO+{y70A8ri&IYzIv+1_w3Kd>%DJ;uJ*mO`MJDK zh?|(ii$*`o`jr|iDQS(JZ2yiGf10v)56{>5nC)9^&xUPN_;PBaXyKm|c6xKHU9+Ot zzURdr+0`Z6z5iy{+`Wg3uX}ei&o4W?Z|^@sbJ0Cb1I{zvMfj~ zb7AKadoLwho6ap8R4&P@P86Hvk>;c2wk>VOwM~bXOcOnJRo8G;R@=nAlE?bQW?b3i zbbLk0|9fY76(4(A94xFl;?8co$iI+1TaM+};y-qi<6^frOmh%eu;*;hqt2k$*Vaa> zo!_F-m3Md7#kJAqSI^(xmYaOIjrY8-3qxF7+$znhmoH!L?CVulcmK)3sXh5o{m%9y zO?z1-rhUHJ`X+{>yZzPD-yFY`JkJHFC9<#nbiX`BNJ6?H)$*KG>GxCbTi9ZkW?o)q z)46rgD(BEWuWYRa@9t&3U(3z@&3XE|4P~}l>UKZbd(UW-g5J}ob=PldMylNDRDM{d zb5gO>rgFxTnpTyGzfIV=)3tTxuH9I$?a;~7a@~x1GpwU0W@oo<+o!kf>5bSJe|DpJ zf8SWVG!0uhkGJl}hs3S()AgfH9=m#)!QfK+qjOA4*Rn2SO9(o*S;_WnVBOBhJ$JT* zs!p29Y`JsR&GHy7iI-E~?pwj_;dfi=5dBzdH(P3 zwB(n6*tDg=<*m5<<^YaK@@m4x%56Jt7pk zSXvsoy7(c}nfdGA$eJg!{rKIyGV|uKsne&r-+611ly^j+)Us=Zcc4pbr_=QS@!xFU zZd}`bbYG)wUhSPJp3D18t$vAaXm1Hwxkv2eim0twS?B*uSaQiA|DKJHk555KiHe2} zr+9eyt!=s78uD8Wiq+;=Eqya-Z}s-7>2EGgnmo(*&-}nS{M{jHb594V*m)e;(`NaN z_sz;@p}k@Aw=J3#ZhA&0Zr$YxDw&tEC-$hU+@c%13)B!Z%e&+8_t)2-+7kCl8n1}V zu#?^QUrx<8sO+lVT2GHwCxLqPc^euG4xMimt~8u#hWVYc;9S;@0E#OTz?lZsYWQrg(fi*QYb#--bZftD6y*+>Rv6nY)+_-NEBc2IjA)W7nbWx_b+Jabh(OG>)N^VaP9`<~qH-!1EYB44rPkJzEb zm-`LYW_hhO+q%MjgI((fs8Q*(rw`unTf+08p}z@h5!_uF^$^sqQYM@zfAyWgvNz1C>W&@Ko5zW2bb9%Pr-afXg z^!1Ow-|x@2+?Vm^$Hyhhmv654m~^l5xh$WYO@v-^g7=}*r@N!{_Mdk5@L;&Jqp(?2 zJIo;GhQY4#_kIBrKK*p~^{e2Yjm^d8MRikx4+Zb2{-F20exLt~n*lPjECQBS%igp3 zpcX0}>gpZsw{@=m%S<6oNlukCwWPEJH(Tkm-@E?4TD{()@DWR1Ufz;r%ZmR0tF^JU z1ua#&c5SKsj`z>!*FW3){odmI`}=O(z749^rs+f;YULI$C@idew<~&EPU58{o+ddr zCQQ?fo-}RRu{%49XWCYqvGd6+2wd#8R4zYKv&bmx#sn)j=3rb6$u3o<{>F=+v=VRU<=@jmfG;XW>{LHZYT})_Y zSeTe?)t3d)+w<=1sod=IoI}^w)z59-ym_ns|NnB?Uqw~bFzw6?rmtb^Vmx18TU+`0 zthu+klc$z*VPPRCF_*l!(D?9h?avR+H+GBj$uyYd&fA|CRU#E$x8soR|L7$yOCDT1 z-}^0o%kia)xvkjN-`_Fs%pD)O|4Rdckx|wyB1=&&dKz0){WV>lCxvBcn8k9veaAL$H%9mt1C$R z{>Ef>_kKB5eSLm&bMt3sXNNC(8y&gwzPgE_;lZOvTQ_Xj@O<6&go8|3S63YcEq*)2 z%fkcOo$%qq2T;TB%skuOE`?LK3w>R-yZE_ZW4zD4!|nXZNl8kRCw@8Q?dh5L=f_8r z{CjiC@6B|(z3mj^>goE;ca4{2iZ}_Bsr7Kb))OdE;n;4MSMqCx zv2?XbV;vqC&E86^||KyG4TbHlO3|%!l{P@8$jO@njuWnvj zJS)>w=B(_>tSHfH;p#10wVqW6&S+==P058OpJ6b|zXxhg{@nlnxBZtdUn;)52weGA z-^^^<>hSfSUM`<+x4F-0;e$Ini+Q9>R$N%^|L)zp8#iwX3J3&b6;9onq`p|uxvk*y zGv9f3wO#%F{kJx4*kHiK%>47yX?<^92Tv{Tn>TOv$Xbh~r>944{WWL%y{3uEi5C|g zl7Bv7@|=_NwbvCLeQ&fga;M4M3sc^$-kqEi-6#BX>I5f^4$uCFg{P9`RPB{iG+QPt z5ons+#OcSQW}_-o%v>Dmv@$KK_tmqjnHm4pVtun8#D(76wb6K^bNuq6p8T%f-qg3Z zw%*xY-Y;MOXX3`><3{-(HHJjBA+`BjL%$cssqML7=)G#-nzTAKQ zq^VO~gMudAGIDo!|MT~6Xlzn^s%`bRCtqIPzj#sqdFNA=-e3)p9%*wvZ*OlInQ6uu z6FzO^`#+;PT=k!y&GYbi&u{h3zVh;w*Y(iY!jEN@PpuSH($rQ>I^BGPeN~I_BoU{O zC=oU*wksP}IO=vs?TFYJaC?_oY*zWftEWW6v%`J9aDA&eJAd{%x1&3r2CNbi7XJBi z`FzkwWv{e(8h8zO_19NNpPilk^2SEx;%8?T{@wrUw|?xdEjNCjId$sM-SYdYmXo0}(-lan*=>?qv$_`;MV^~JW;-#&nr1h=%bI2l*FZcIGP zCbl->_`A3E8CD`I=hXgq*q)O5G%0D*%&)JvT2zbuyX$E3$w_7T|Mw;jpC9@t_1blI zy!z#3OD$)eakT7`N$plMobg~u!n>pQAN&20%{zKe>1U?Vxv+CPqIL$|-euOi%4|{n z-hUwP9$v(j_N!>sf=30##gBh{d@N&C(qUKo3$%vMtzT|!)V=Nb@t}=`b1aKrTv*7w zxBC0B`}gCo&b3liZQZkHPkLT_e0+TF3vWL^K4x}46+^>`#_8uoURD|C%~H~qU-?%wL}X-7H) zLB-&f%*$=Jwq~!MR#{!Wdfq~_k{1DG@9wO8b!BVC$45!A%cQN#bo%9Nl@t^foZwfR zYg=vh@83VrDv88HEL&5##dH?b{{Hp_G{VxpI#BiBmwUTPyC(-YS7qhpuwPoopd=#_Hy6THY^!B`` zCnhRKh$Js^W@l&Tle0Ooz_EEn;9|DByUX1<4(_S^%)!a|@WsW&qFFMjos%xE3|{`? z&Q4>l)|O<>}{(uHWw`|`V;W(a?Ck>`|~?fpJy0s zVGMrfd+^4x94pl$OO6W&h#gpZ!h6-}?1lbLg_{c(uXGNMx{}eje!9L~ncOP9^Ppu@ z4RdDuHLqE-1~h_XTlM9^|9|iQN9-t2oL}>abGlyaq05&i-`<}8_~pyUN7`=g{c@}e zs=vR>dI~BCp3kq>E15gjy4)!JoD9RIOP3_9N;Et@J!AIO%w**j1MQ`a+LFPjv44H` zwKb88Zk!74oOJQs-QAg2SBbj!%N;$jqKNm!WUYD0$NM%`d=yMdE;p*(WoDeFaaw*} z#R>h%bq7x!<+@+I@5YtQnpEpdSql__Ev)5-)_n2F1;Q6MfETL zraVajMZ)`q`-|1S@Q5qx2VGvI=DW&t;Y#P=VQV_inY{OV&rZ~IUvYiC z+~j=!V+R(c#Qqj_Iym)(_8+M~+WTAo9Q*m<^Ofyu{iBy}tGV+jIqG_jujpd08|qP$ zyjHlJd~t7YwMq6hp8R}J+rPcB@t6D;(01plxqG_K&9OZEygU5k-&<2bTb!9UZroV% z{-5c_jnX$axwh-&8r`&hVbISkZ=CR)VUD$hc=haunh)pH{E!CO`tiYIiC0pWmX?XD znaphX?@*u9O;%K7OiEI)k-2mC;Pvp!fnHKUi&9Fyzl&WL zv$JXMUfXs)S*;Cw%HQ8xUt@IX>Q&tf=J8dwOO`CTuaYjSxL#u6VLPO|9PD;SX-#6DIm>#@#2Rc z8;v%qsA|S@a-Q1sA_L@_o}L4zy#9u+m9ntd^XD?xQm(Z}roUA4ofUFxqsJw0_c(qf z*jj+o=guvQ+^pZx6?JT%t<{TpwkPNLPJgj=p?KckJ6&6PCoB;FIbhxF-5q}2X$gND zYkpm`s+qmjEq=LB&(o798)ry-$!}dOE6wb$^e=C(i@UQ+ixH!$s^;>H4O>~Ot5?Lu zTCR+rs&%UV_0?dtS$|TJbJv0v%yoEun64Ts#?{)i%y+tg+`f)x>tc@hUBWCrJ8T#~ zzdB#v5nJPCvpery((kWt@AU5X-e2|i$F9%UOG@5#tlOqn&)S@KRB}_`jy*Q1PMn;L z4-!&?Iy(Z?X6&%|>YXko77<#ivVIlwl|S)DA3p`D%~=&Xm2;VwsKIo8_9Ofr=w_Yj3+*>A~X=uwLmF#P44qm#n$>i~rCE{6Evo!hTY7RA)dfxeSK>qr< zbtV7T{Wea&9LB-=zxG4CS=_A?o$cx`o?PnmkFNLHe(SEmm9-K6CtWyFlQ{X>+WDt? zs;jw0iiv*xu4LomPY6A zZC$ufv8t+SRlC#6SFePmq)z?({QPCujWv_kPk8etr|7@wG>26?_UzsNch%?G_wO^GUs?Buxo+APlhjQo z>uoC<3IhyEo0=4jcyx58bRN4J`t#LA=gOUDE`EGpZ8Rywac{`!7xyRkXo+y;-P_~2 zzwWP>>W=4~{r$^JUtcrHzbBKNoP4kTf9)-vhE7@uFB0$4SQ>AO`yXd}%HQLXk%v0~`ypGe= z{(iBm_t2@iPFyQJ+CxgFze}F=^UuE-@rP%qnO^mI^|{8T>dm?5)qC#W&pfmH{rBHL z>+DufoHeVfk(u2rs_D-h%VIV&GqVq0zp^q&NJu<*b8~a4p4+2Gj|6`Au?a4zSQ{nU z5$qnj;iL|OmQa$!_YAg_DfafC#pa9izpuWxw5angbJAr>L`z$zCqzo_esSa& z)5VK#=FgD$Rx9J|yue%hz@0gNb9!4@FRT>)aCObx9-{>|;tXq@L%7ug3}@L?8oj%> zm)qFb_+0H`VRb(TFE6g;{`1?GrCqlFqpqynyxf1jlC7=mu3ft-zP=KjGiS~$8@;PG zIrrt-?8|Q^)c*E1*mCLEhyCrvR$5P{KYzUa_x^|PpVuevdt0NT=auv8w_|6ggA0p* z=+~b)&;M30h_xu274E_f*7$|$fwqO-dj)FuV>)Ioa~&YbZnd3A-; zxt&k+R>ob>!sWfy-xE?(Tldxec8ZUmZ})q^xupfBMMqaxuD=krlT&Vqk2mu?JJv&oZ`unAzS((d?b^n5v5gN8H=1VO zNVolTwmzz;D~pds%WdPvjVo5IYTCQEc5<)p^vRQ(zrVl#c}sM3w6l*7Pi19gM}Plu ze)~TR_4V~PZro5XHWs$Bvhtn8uWEIEzI}UlH+KX}f+45Ysg#Xjg_3i^Ef!s$6vxo8 z;*7?boo4K!XSibKmWY=9D(e-VBcNa=maAvmaO1YSg9k^og|xKvf^`3cb21Cu`OD6m zb}eF23oyL3Jzri+Tl?ep`@ZI>Xd-jH|K zsz=h8?eVeR!_DmcKi(BzTN8QW{CReUDbuDY>Dh7iobqB|Xy!DC{Caw#z=BO&69hi3 zUEZbDz@Q=Sc>c?)@18R@dY_UA2o65{@Nj!zKtO}$qX@9*y)zqHhwk>S{}V>fn}>x1?UuUe($;dQMh;`+K+XE!&t@Y#Ems=Mxg@ps58 z{9BX~!svPP(0_Ipj)0>qarGj3F%7XD9D;do$}Jg=s4Q5%oZZsWvct2(Ij_S1&)+xp zIh?b(leg+wn7>iIbz=L`+h2aYk2kXu^Wx8Ud>LpkMeaVkvom+A?c9Jnn(yIQW_y1)WAnwYw-ZA}e;3`}|9?}xmvMNFhAVRoPLg>tn7{D2~92s zH#asf@0-h;A3b_>;p)|=Gu4)BK6(07(b!lxD=Vw!eXY2tC}_L*iZyGF9B5?Do|Di& z|Hh377dN-2lPQaepP$>Xb*pGa*)26k4vydIlWY1sC+*8 z5$mmgN2{H>PP5+H;&@7nv$I0|&yE&>Ns$g7HEjh+Q>P1Giv7qIsl2mw4{wipwbMDl ztGTaI%5UTyO4_(@FSA(pgx}veKYmbfiJUoMUoGd)zvWJkUjP4HH^+fvGoPY#w4?0yVKP=|X*&(EK;959`;w|1T`$zUl$6u~TEl&Jx4EQ20z+VEsA~E9dw-wp zyL|cb$pekdom;k;Y}~j}ac}i^H7_r(BZm$(xwyHReVTYB)I`x`=7!gNyV*EH#10=m zEGTx(=A1@KYO134@438Lp0&c=tQOn3k387q;j_z1s`?{)S4&J>h`}fyZXAcjKyt}(vS-HhPtFtxqp4D&Oy=99CGaC;mvW0|& zKfbwX+|ttW;PLT(14F~c?rv@&Vd2@YHoS6Oko4vI{d)74`fZEY%J>}azX^X)y~{kU z?t?>4na-c%EsNXr=DTxB@H}|rdf?{FyH|f5WH);#V&6_uOl)MzW z|F)*4MnG7&S=qhsz<~#!d)-}KU4Q)ev0&9Iu6y_H`Od12up{=QM+k5n{)8Gwm4x)$v2x9 ze0$q?zn*=WZ*qUq-|O)WlZ69rONzK&J-EC4eLzr9lV0quf?J?~%e%WvQAdYIKW@)~ ze}8|^HfcX`!o$PU^Wd#pvo0@Nxsp>^S=q(K<-^@~zrMb{aP{iikCg$sy1EvYmJg5h zO8ZVKuI0Sa=ol9#_wCy^P-(QtwcF*=>~#zKy=Pk&!|2wRQtq>1qhQ^kknWJ6peA+yc@N&+-VWNq z@aD}MgXCj8=RS3d>o0Qem$RtUe{Z*eiiuj%Mo8w|$d+h6EEz4tgcaK#}hvCuV zo569xA<9*spYgKs%k>;O+CvOkh68;!;>eKA?cFo(iZJQ%k zX}a?L=b2NdPBpdLrlhLc+SSFi@Ak_VFBI(T=Dq*a)WozU^RnBMRt|v;5^Ll3O05oG zpZ6waMOe=BQyd%o+8>|2<)Nar-{Hm+gOZT9KPp?Fq-^#?o=mhkh_Q_${N&=DMw`w|W^iHM6Q|Ni#YqU41@*t(d`t=ZR$_FXx9 z=8Tl7d~I#*xfh1wxk&y=$xjI~5myngE{JqlV!CPN$K~<4%Fnq{@ka^&(9Jc9B8bmFMD$%aJ`L> zuWw*j*fG<>%*sm3Ns}gJ>4LUOH1FGI$0uWPV6%>b0)wQaCSZ!R|f5%l!g^f`lwISAG5QzKCnynmui|z0V)K;Ur%7_??rZSL0ply#I9xpVJbK za41+wSzgLrsH6U>XXUjeRc%dqcXuV8n`1er+C@}Ubi%}mjf)m3ZOgmc)y&QhinGmk z7dp2~nS$mOGP1KDpP6YKu{n*G;lTa-@;++9$;bPi?w-48lhL0)e?C0!w?B07AY(H- zKO4iIy1!D~VmhG78L7WIegRCPi}(NkH~Vwj6%`8$2|YbMCUw`XeCrQ=F1YxY>EG;n znZ0j!J$!Ov@&uvjOij&=t=x>dx)09De%r#+5OBO@@ro=^Q)O4FwwPW_$H8XyZoOHXWS%^ITKM9EqR%`V$)``Bg0}l_%e@U+AG=QP zcD$Fb@6k=Erx_Tks;VT+awP8Usbp4GR{rw#w)m${pFo4rdhz>uetv!qnltmARv*g| z(vx;(#=+vbhT7WPpP!vQ{OD+Rw(Nr~J3%RJ(xdwq*4H8FE`*~$&m$l^G+f%8bt^GJ_wtcSQIeWR)1Slc=N@@#S7Q3?-y40Td--9khosVfd!7uKi+ve zIx;e|@h~u)tG{~X3Ijv*_B__fC!efYy;}Q-%^$vJb^tP?a%^h(Fy!_%|dYHHZh zEi)dZcmLh-ZX^5TJ8q9IG}sEn@8bFJA>qEVRjpJ&`2S~h8eLhDEW3QB&zaNH(!#RN z%!%XPzS`~`J1jJ`w9LGULQV$-`aQ_|WBtzeX6O8v265j z+-vR~tRZR*eMvvCg;VP$kr z0Ii-E(~UZEIW8uK$Jlst6#KhuJtiim507ppZ`k+Zo`>napUQfV(x%57dM`CEd&|cb z6MHk=Ws5+d$XC|JuE4Ja&*FnaLRxn1vXZl}yYt}4tSA>3mPwNzy)1U~J&|1}@b6-5 z&(6@;4PVb!ADCtOMo@It<&fhduBO~fwc1mrOu2F^S z&Dvor{qC{H)f^rF>+ReB7e6?}ns81gaJg$>h_Pyb;j244jnB=o1g&gZ_szXuPSM6j z=2%J8^RTnu15~!9`X0HZ;`>MF-$dIz=l{=VSgz5vs?$MM;#jYAd#|+lp(|HJ9v|;_ zpKX@=;n&yfA3uK{ymoDx@fVh>zy5rGZ@s2hqP6+_62oPim^gTs2G<3PeD!4#Rj#eA zy|b&78+43Y(Gv~{9=0h{r*2F*$W&2T={V<}aK_Z6`SpjIiVqi9Y?82FCCymgl;O_W zwdj@0f+Q9O+o~@P5fKs+JZwe9#S0fNzC5Ec@czu6D_%X{rF!fa-A|q{PxJ^=Gec@B z$ctCX7oA&fU}t9s>Qwvho-#$mUr|e2`|!87w=W_ze_MYaynb-aDxp%X z`+NO&`us7d7O3m5;=Imht5EmZKB_~bYt?isapm;%bRKy-8PH}tM@Prr*8)xg5)vJ8 zd#fDX+?L(@yr+KUh7AI{%ikaC64fqvd&_j*Q}g_LN4~tgY?yF>0o20ZxN+mxTlJx# zqSpmpO-ax?#lhzHLva6byQbjf_a^Z0Fg;t5;nHB3zsfs z)z;RQkdkr=4HZ>YRXuU?3ctad%g?x0iQwa|5M! zAt52DrRH-NEm8ul$}PXNJa%_k;*k!)4O_MxnWh_kAjRn8gM-a%$Ctip6G&Ka+vQE~ z-oABr?<^1~nJcCQ?tHVe2@4CaiQm6(W3gaFT%4Sjx3_faGS{yC-qZCI*RSAOI`u%O z^YM+g#uBo*Y|c+Vi8?qrU3nQO6573Lm6nQ%O2f&NMb7Pf0RaI5rCu@ne%sw>5diHv z0L@!~jyQZ(617D$c-ey;=k4ZLZxb)ff49i#HrK6iy~|E6TQ%OjdlwKM-o9&>)s`(= zF6^x?2d#+rOt!MHC`bzXpL2U#Z}!~N)AbMExg#@c7U-mwlDXf{CKzl;J1doum38RU zDK6XUZ!K+YY|H%S-dbZdld~jkOX}%qQqPSiO`F!%*2Z?_>Q%#n2M(aL?drPpSnZJ` zM;=^R8Eo?wG*YRWX>~%f9V$GUhnJ!-+AD-LW z^P6YQl5*R@>onV*pJ@`4y{tpv*`UHg!!KXIK79SU+kd{@!}Iq4k2JAzFIc;_cVqH# zGtV=J4mtVEHsf_}<9WD6Qc9|5?c+y}n%2ecPP(-vv-F;R_t8TyE-nTwtDIw7Eym2o z)39WT$~^n}K1t)W0~ap}CMG7HO%h{k+~)~u=-L1OBW#?0?n%k(e;*z)gPORhr>7}e zTT37Bmv^tJsp++S$ndRsv+3WYr%#@|n!>EeQvB?UV_2BjzrWw_OR?wuowabGqLGo& zj$0yAZ?x*~XVF-T@OKn0Vg9qo&-#fZk4I&+~?rp!G>*J%wy*_?_+oVZCT1Spf zjMUP+BIBif^LU)%qI*9we>QAb&ah?$lh*2%|GU{578x}-?AZ8pX{-2ZGcGQ!4I4Ky zGJtCF#>U1Sb{<<}5cv4fJTGhKV z9r*eAdEwVrp)q?Z1nvKPU|xRr*fBP7y_kljOI6KsZ?(kkE;H5meoW!Q^^BMp85tRw zig(hXAt4Wrc8gn7eo|THKcA1AoBPT0=hrPB&Rexg>-ltD&;gvF^UFHAx>f}%E|NO- z{z&eYscJX&{Rwwi&71P%iK2G&_j(bLuY0xh^xRxsS-*VwVv)OX zUS3wO`ST;NCGy&t^XK`qva%$M(|FDs1qTOzd3l-r|DVt2zeo4T*;F*VySw}I7XLXG zf}j!3j~_wj$6VN$?5?7w2I@8N`hD@{VPlpy%K`f*=f(li{n^*o)ol0n@_Mw(=lR~p z41Mx9*%<T8D;OU+*_mqTFl%YGe&78sC`xYk^(7mUpQmt|%h~&= z34i?fF=AVeWJyVhLGd%6bDNsk`JLk9sqX7LHAuHqH5#etw>#n;YAt|NHv`qN2Du+3wwuGfv~VwKeEQ zifj+BShwz+q)gSB8HN*nzS`KfWsAv^Cr>`y-QUu}5^lJw=qcBy&!0cOx~iRXf1m8X zfB!i6`P=vHt84Ca_Vwj``SNAW^y$;5JNx?jLOMOZ^K2xmzrAVPxY4kUN0KQtH1x>v zlp{)pRvaUcTItRkQNsd;z=V)@)0<53AVm z1q3nu_`lITP#1I{!o&CP``_N){`k($;sgVUnA7!tzlI+b^Eefak6*d$eNh7H=EdZo=5_#D^xtyg<$?SZ3- z&m`u?u>HMJ(Q)zO_LX5SVPRrzZEZL9R+~39Hyc)dN@;0nDL6N6%9JSuFE6ROxVa@A z?GgnQ-JpbhZ*Mg-1E|xsWQoeY-|sIk=La2`^w`MO)>cAVTG`HS-@)UC#m{`++}zBb zetzE3H#ax$oaXB0_ULH0_}NEwf)^SBck}Y_6uh}%xbL*7iOGXUkCa}#(-ce!*{~tM zfi+Dn)%j(n$P%7gT~?}HLY%CutTOg>GUv{n19=B@!o}7*w{A&YUl-fFYL(VJo619) zZmYxBuPc4y{W2;~P()NzQB}1yox{X&OYUtkJ3G4%U%s?#-fZmSBFn5%-#3*IlDe^)|ffF6Xdv+cD26_T)r$Ey*;mW^=j=obLMQwxTutom9;2(dmaZb zFKhSFN53BLwhM2G&=LFg_ICR`+v=h;8v$YA!#$G5Qd7$P{P>=?9K3T!=G(V#9bH{b z^XAF@`tq`Q(j=i3D^`F`bC57f;n-F3^3s9|Uey9atBMZ_({!VcUF~-9_U3+mZticr za~*5etPv3V$R%&Lq|<6@TI$rd4r?ktGf5uTKe#9U^Nwjgfrp+vdv@%y@Vcr$r`!4E z51l;8si&t0TIrv6cNeRzt?iwi#mleF+jGC@^E2NcKYloPdUBeXnf-XZe*X`Du-zUki+ z4vM*V!t<(Qq^hFed#U>U+Oo$d+C&-(ZM)w7-fAXm%aL@Gx;MKz&LuCP8~*x*JaCi zg>V2*Cqt{<{#cr86o$ueR=nuhuaFK zt+>2UW7Sl_j0IQLtkLlccUd>Lv-|Lc3j#lX{^a%R5t?Va+5F(=Z}WH9R+-(|wpO^* zO2l=m6O*ViH#hej`+B*fM~}w5?d;}zW>#hkrsPXGD&xls3onncev z%U+i!f5kKQXNkmR%uf0=*?N&*`=S+Leh=2&{q^gYMb(##@Rrc9Z_;@6QS<)g;Ee3#@Q!}StT{*Ma^P2g zjxW2*#X#X5Xd`8k_5FL!yE{8~ln&qt zetv$7Z_*r`oztTGxA)HLJ?g(sIpw6@jq`HauS!6!$=Z7K#JO{PZEDMOw`G6dw=-@= z>0ga?{jn{H(bFL2L~T8j|0wL;pKHky-ACFD}Q`YWaE?Rcz%B8|FyzS8>+wOmAtzn`RUWA7uVOzFIu$d)fD%X6qRE= zlFYfexsVg#CHDXOwfe%d<=Nkku2{8->*>>{HPh>Vd|>pSZ|52p7q|DDb=DOPnHxI= zdroz=Ez>AE`tzuVOhThcrD{*LsQ#-GjaR$BeR}GxqNbJvI@|L0c74z|p1QiaP1Tnb zo{v;jRKR_jnx95O!or}%450ZvalI=xYrW&*?*ec;kc@4_HR>ojR3rq(ji= zH0Zdyt}ZS~%c2zKzGZ3`TLe-Mt+Re3btOlB)5Xh|4^LM2H%K`#L2CN{Z@2S3e0`6; zzP?^j`LNuF&D)GutS^0WfpONY+ncx-+ERtuDTG z`t<3Evu2$#pZ@C3*|TS}WAgIy_{6$fx98tKbno80_jOXQcI$vn`T|Y*?%87l%BEYk znD9uMaLk)GPxqVRwXE`YcR<~YH*0hSz9`CV3`;gxUM>zAFws3V+dMxZJ-xl9g+)VK zTUkScBP}g$&eNq!m;U(jQh3v*O`zi@zr48Eoc;Un@9)a0s;%$;Reyce3Tl~d*neoRd_XP5AAaW-FI?F8@Nhf$sN?(l?Mq5Z3ckIG1nr{Cf5^;W zX=%yu;P+ikRaI7o3Dc)P-`#&qVN=qP1cQK>m@}8xEn4*HY*SF}<-GIrY(b-?5{oYq8dU+4KL*AKK0-rU@LPvvJewlrB#{jt^J)~#DVo=%T1cydBeMMVX)#4+Y{ z{m-Z3clJ~YPn$MP!oJRC&z?OADJe%H_obbkRdu}P-yh36ckY1BxLy;tcUJbzPft$= zhJ>&%Gc*7A`I9jr{#5mc2aHdiKDA8OIo>CG_{>aW&>8m{8X5_oo}2_VpyKw|oi)$9 zzAlz=gLM#S7k_%ClM|DOh{z7T|E8=HMHhegP>^$DL*w$lcXk%fx$Ika|FzU-D6{AlaKec?%ivvqpNFJ{w@Zzhj#Ox+TY(QzP=Lmn`6=FJKOBwv14qY(sQ}r zTm}Ypzd0+mvPVtVi{0_A{rHh12d-Wf)ec{GWK-(tifj5hIxX9_nU%e{!PpSnp{1=| z`0r2Ulxx73)3d+idO>fShHtm|Z`v2Rz%k|H*yTmyP zGJMdJKB2XyUhiV&*ZXb(KuUOYpF5%fElF{P(d>vG>xOtP2p{c3q!K+tMugf;4opo|_ zWMugE*}H%K-UGXjurN4O`!0yJweE6R&e#^!uty;6{k|>VZI;c8ZG64gUE#ql`$v}= z*S(!(_wM?p?uJE12LhshY@ED_LDka1n?;z@zM4IvoZ(38ou8Xl$atJ)KJ%qTTAab| z8FLH6FQ+*o5k5Q}_3C>nN*_La*yuf7@8IRj!hL;x1|}v)8kyM>Qc_w#GomIYB0Ox& zVPRo&a&vND+r@&8$(k@_3QK8e>5m^j3U1xrn%(Z$%yw1#`i2b#FJ8P@;M~qv@%b4q zC_5$|Zo3+>Vb$H;<@`ZGK_5PRaQOf4Z{h1}x+Sl#@z($O$i6M-W)rB;P*P(0_3Ky6 z_p?&B%OiUjz8#KTw{G2r&6}IIY%x($QF-wGef(=PY4f}%ReRGu%l&wBpY_52cq68o ziyhs}LcVv>A6=ZvzTw|l*>av-!_R&8rzGEeThJhi|Bgwx2+?od(y;-f>*9w*>MYW1l`5O?#ZCSWPiQAmX_9rijPT4mMwGg_vdHl zmpjtH$js8EuBgZ;EiFAy+tts{uckZjtJ$ejr()hRGBSSn_z^VmYhr5p@Zm#7ef{-O zkE^Szi}T{Qd_b1=Kg+>7WaR4v3@YaW3vV);dzpKyS-cMXJ7r~-jN2vs)2?XfX^M8<3_5YrwH+S=G*+o*r2b8@+g<)% zuI}yz*-J)eU$1%We|lZP2`|>qP7*!2R-K>*w8p}Wtw%kgqNFDMmoHwq^Tzen_HC-} z%DM0NZz#&#DQm3JwP@e9tnR?#&Gj!reEN2^Ur7CZF+c0<<+K11*R3I2Buts@f~O}H zeaK|_^Q6}>?lY+B2%K`^Vv3~tC8cCmjNN%N0>eYUhxdr`e^Qy9x-Lbq!5FG?a|dM zHb%Voro(A;Xa+~;q9{>KhWQL7BBe@K%nR%PUrbVQ`5z&%sJN2zmQ6?dtiD^@%@=5_ znpekgK%i78WNvEVzx7w|84GP&{4DLo%-MV=H}@~NzjH0957?Cz7L{vQ_4AWz&?Mnj zqoVJ1x9ue6d=rywZ+>B5FX9?#nz8lhi+=lm2i6|YUa@Lb)+LMT-~9(#W(c@c&2M2m5cbJNK0+|yIbwW?tTJylLPOwM)gQteC>Ym!bh2=hHtSOG;|`aybKU=tu>E&>%4yA z#EBL2r!a&mm%cscch>3Ri+LVlmyeyl7}&eXziZKoYm07*Eq?MOC1zI%=lgqmo7b(= zOFJ`zF*Y`KUFkgA>Nex_a}IHFa-iYv+uKU(XMA~Zuz5%EXR#T*7q;$Rw1w$>b$Qc_ zDJE_EtFAxz8z|zs)$Hsyqr3V0|AGd%Ev&7TH8nY7cbB=kxv{1H{QLX+$HV;g3yPng zn=oZc%i6WNmo8s^z2|@O@xH`gcT{=b-8#D_=~32nzJS$h8m=~5SlyFx4V=O->+Q^o z8E$G>?t4{7B zsJ$>-;XtG~JL<||n>^_okMz@Pu|;c5)I6V*O1y}dm@`OFN%j;^jpFE^b{+L(}()HK(+ zyh!h^ZuB-DNl8i2yxjfTQ>RZaUbCiWwQuZdUX$A|9KF2QG(8J9yvRDe`R?ft0ui@v zILE{^U7j|5cI%WS+XKP^n-kT!*L|J*D0#uUi)^c2&5C&|A2eA(Q?u1<*PY{&Cr|CW zG)Za8>l>Y`_pbOLY-GRez>OiA9t0x#p7`#p5jkK)vt1b*= zv|F~%S^aZf%ARf{xtzEuTyijecBYX zr?anR$`lcuT{jEY&i`o0sv{;`#dars#r#j3CeEMU+js0)%-htZM=R!wuwT}@bGdRu zgwLKX9_Q@Uxe{e4cJg^E1BXBMtmbuKgAKub_uwo~tJ^~3D-O3sOC zSA{1{3W|A~pFGcb|6V~6k*Pax-B;h&IH^nOis|iwTO5fGpKcCdXqdXy_K2!o{k%`b zn*%4zZ{|Ce7V}$ESJUm(?(GI|lg?f}mtrLN_mAPOZ!gYH&OXzvZeaMDD^oI(!67x3 zb(68Zg1WZs+_O3#ZEU8bORrKr$#me~9n;%MDT#@UuCA_szFhX7W5&+TUh?u1D?`DL z4~c(%KA->L`}gC=`{fObo_K(IL1t!uo^w}yeI+WQBC&*>37 z-1eX{gy(!2n^jcB>@RYkKF!}>^H*=)@ky=oUR>XA?>B$%fvx{SzIRHPCo0v+SoN&F zoBcOx#p>*YhmTZa-m2I3D;pUx)xUWxcl_PKztuPPX0xx0;eC`f-}tq9%xjaq{djb9 zbHSUt^%GXt-k5N(qo<-Rd7t`2vkZgfw#v4$e}7vln&~md8^654*FWF3y{(NceD`gJ z^qgCpWNmYI{(ms*`)8dmFQ4~t3ac01($dmOxH7Mn^-*b!(3B}tEKdLV|Is-hK%wv7 z+tXX;PuHK9eA3DPPNl%1t8pO_9NwSLdH6l9{jw-p+?a*suFLMS`Tt++tbT5`%x4yZ z_Ud&NKR>aaHw*Fpv{RxHJiwmmx6E&@7id=htFVN`iO6$F8&9l@-R&`5FScXuTv<*I zj*Ngkn>HDJ`tk9x)O6dL9}^5_`m8gHkB?_+0G;%k{`bX;j7f9np1nM8#te_3prDFd z_H}++iJ8@Kgdn2i-r}r$gzq3;@GBVQU zt*58wlfS>e+q|7MYZePbXJ6m5tp8tL3RnL7V|o79)TvWdOiZRMpDO?w`1edrRrUY< z`T2QIM@Po+=#ml>Mh6p9)5>f0|Nq%~dU-v{Jb&txlA)oY&0AMj*C#hOr`x>sQJZX2 z^JBvD+NYDImLv+S5XJv~k9*e+eZoc)IfbfP7LLioCvhgqP}yTrsq zo7cilClL;9!`SyJ^!V(7E8}>$6_$+`IXix;3f z)%?!eCC;+1w*$>3T3heVUw`KWpNvJrr%y!-<+nFBGS<}ADr#$MU)jN6Q1&Kb#;jR~ z?%ervTiblo*VosTwY9mgUAuNaZl|E9xA)=e*ToqW)Wf&OE$cmc>J-<$efw;_?^!Wz z?ai`;1t5EOotKq(k!sboNW<$%hT$TOu0<|=V#-*#*WcxH@PMucRJgSzliAr7L=7e+ntw|rUqJ8xo+FPzrPRPxDm17#>9ye zEeap8ELpnLu=-ohj2Sbo?E1I6{C&ZnAB9hzJUMXVhJ>`2GF8dsdcKOiYYH+L;+q*Fi%j{r&v+ z_SJF=3k!n=8nm>uzV>l%P+w|O^n^o8OAB;l-Io^^7hn5&_|TyT@89z~aX^*~bVprZ zzrLr3r=_I@w8N#Doxg42!iU?<7e%pDrG<1acJEL6_~>XsL4iY9nAn^-b1K-P{sy_Y zu*k^DK78_|WpDNOfAwY&2SJLNESk8a-`toxB z4coW7hlYygW8P0Y*V^Y!($u&_|j z)a-o!>*2$P8#ZoiT(d^!&Ye2}adCay^Y3$sRR8?+)S~DK$DFxyK@G!m40}v9wX~Y% z&zHY`9@MrCUhentZkxQ?BO@b!d^|2MC?yq@ zy>6?gpI_VFy|!1bUQNu)>vL>oQ#6_K|G<*zdaF)0C;_AvNGJAec z506dtH=fhe_1$A)?rb+-5XEOD6L3~bTf1}LKD(W@zs;7Py>@MyjBV8xKk#ztl6Q9^ z7u@ilXQQ}k)v6_H*7OJ*lH2a%=GL}k*|KZ9?%MzV2OZ?j~S*XV7_zwZaS z2(PmC<0IFkyga`Mov_~5?QLyB#l^*qNwv8b7C5FH?~|Q#z4-Y#)#B&pp6=c^cdqQs zZMo6SkC!c9E*u#ddG2>~V4$Oksp-$Y<=?jM*<+KGkl+BC@R0pIzy6=%vSrKWd}L8p zQtDW>Dy#SLUBN?g?tZSWt)Hz74JU$zgRS)xTR?~YpP6Sn`*YRxb+JdTUY+{>mztVd zOtQnjPp9=$-rU&8bo8GXFE6iXv(58A9eGwBHf`FpHg*4b3141Z)X>%z{*lAOur6*d zm$I_*xfMc}E?s(YeSQ4g`s<*3vc9~$47wlc{S8o5c6W0>7s~nm?yjPyW~X)eyDK~P zty`xDS`YQ~DXZG#PGNPwgjZKqe(j5v{r&p;?`vzLHFR{IL{2}LprEM8C~H;nV2h=d zm6C-;#DW_lUrnQWet39#Hnz2~T~DdCva;G5_phtJ|G2;XUzX_T=#I|LhyC{d1T?<= z{{DWan(&&wzyJRJmb$)v)vBi5yRFUg@BKMjt#g0Uq)AO?xpwEX7q42y6&ZOms^3~u zlk@HE?Z;OHE@s)6GkMxHHYbko99db}l=SrL6`5Op72Wyx_&8`u*O%AV`M-VpcH-2j zN0Hy7_t`yrb)$6W6-hC%w&?A7iCgs~VAA^_q9Q^wF`p4hz_j8NPKA7O()Kpz$ zM2vFf>wLBwY9ytzJ9*L_tigq zRsA_u8kUvLo;Od<$;nATSeO~K(<65GwtE{{f5tMuv1fXAW+rofetzTeGppbKj*W@w zaqSjMe0pl?hRvIu0|Erf-rtLTzk`R3xkX^!_uW>@XZ`v2`+da5Bv!NBTP;sdPk(%@ zS32f)V2JaDq$BN(jf_RbJC{eFJ9+Zq%+hb(t5&U&Fv$?Gv9&FHbHi{=>~67}H*fmN zRlmNr_QU7T&AWD4UAcO7;*1$5UjDdn;l|UaPc`)P{yjUe;?}KOH@0Sro0ynn?VWSN z|LewDNo#d=_EV=$nSK*lJuh$HuIDpbT3A3AohozaKhqfMK>-?xB~LmxIP_*F&PxZwM{*cGc+C%?F`aE4W>77s74bV=llMXN3*9dQS(>`+rX_O;(eM`z8oymRrF zE?#7ue9|Q|GjngUwY9afj!w_#U0b$@=*RDSB5iGLE&cxfe)ps#B_Uzqg=^OIG&C?Y z?o*jNckag@ACu3$-mt+SBRl*0PVV(fmZ)6M*;Tr9-MYSYvAc_8%X8mv@9gBfa^=c| z2_Gt#U0$?EY2NACr4Qe{>3Q)YLqt^cs;1e2e{(A;D-T}2yxA}IU3T~1r-sXyEK#tw zmhS88GhHVyFMqzYM@~-e!j&sWc9-uletAvx+w}dfFI)(Sh>CLZ_U?XfCMG5}!#p3n zU?ltcy2KwJ9@bo6x}s{~-j_e3x8+C{mX@l5T54xz8oLAsPfkhObbtArIWkEZ86JM~ zY&m+aUvV~$3A)=o z<-vi*IZx~A>W*BvFd_fFm8q#|WA$ZK6%~Qf(o!J-0f$GAAA7Ek+k0Y~ZnVYe>AKNw zbLPykSU-8vq!Y8v^F7ki)NXFg77q*xQtIsNWIAeB{Y}Tv$Ve$LFi=HBr6nUXv+(Sm zS1(?8Ow*4)SGl+BZB$Zvy8FF7mCkW{Dja!uc~5T5zRuERn{qF*+cVE14VS@H_@5U1@3=Ev-JY5_^w8Pg4aB^}^nm%1UU{6+SYpY9m`1Bt? zeoT1sB*iG}iiQz*8&B=;Z-UOw&OxD}t{jR_K!N4!+snevK6%X=olW`o?G~+F>swS* z^h(y+#AHfFR@S6;e)&n^>*EBIlaq^HUC})E$#b&W#E*}U7ss`?w@<#lK7Mk)y#1uP z*5yLBwziYz&AZpI_<8@gW!buR-cfj=<3Ek{svlIJZsi02KO^{1)on%)xNPIk$KbR&7ceM)bxaLc)Lmp~C$ zQ{^oZfg-MfO77i)u7M(|MO!2Sm4wB`*+E;&+}ygXrbgY}UoU_0;zbWXzh{+lE2So% zbO{O)y0@pY`M?1O#dMFr`}R>i8WUHpSpyP3b^5gHT&{S2IhzA}DnDOX7i$e#=Ug*? zH75^G%hai&px~$j#X)war>0@>-FpY{YLLW>Ym%|r|j0#(AC9NQ(L=p9_y*|=Z{}q9d0=pbl>bE z@9BD==IC|fC=u6>?&o_n8bM3p=gpfJlWU%Tucf`6JtZ~uVA4i|#6v7Rl140shK3bC zJ}Bno=7J7}+V|V0{GE)Kx3{3AB&WQ*{5gwa>#{coHl>~xkeBbDt{=ZBet%sIKVy1I z%7X0c>p+Ls2o=uY~;k{=@D3%IfOu#_8w&JZotMCDsN;W{dStpF9Cs zI>)M%%SUbUF|dh)hezenqem*1mNPG#6+Q7V z%DrXc#G$y{Z>|!B$SUMd!as+e}gJR2s6)QBD8f>b*bZqWhw@&ZohD7G@ zHBC)S>#pyu`l>Wp&G*rsdA8MN7q4D@y5@M&#uNVbe~*~HoU?tqxuK!qL!OVIbI+Aj zRbB0Begr)JxG_RUNnPC?bnMa9e?LAZGc|yY`nY^;cX|G%l9xg2zOIYe3AQ^kGqd;i za*ZwltDSOJ6V|O;cj4N#V<#u8Gj2HV2bx!n+?>Y906OMCSXlVW>+AiSd)wRDRa8`d z_{kji|7u{Ps;b)2-`_rEipX`Ag2u*1&=Jq+wuXj=GiJ>ydi(g*)zufSUqAlz^z?_% zpSM4Gl42mivu|0Tr?GxJ-efso?A>c8`6FE6KP=WX9^XI}>S2QCcB0k*VUOi9P!_jf!J9e+YwGz5+Qw}Wi zo!xf7{=Y20yxozF$;UxQk)AWEt*u?RQjp=Bcy(UhJM-t9zl6Gv9$MhoY*6(jgN2

        G{yt|FWzBd?SRhoGRK&D&kOb`=yCH&34qTJiGW z-Me#}&wYM={^6@vw-)T|(^wU{P*!3^8)#C3(Lv2`&WWpWp`osAywYwVp`o42m#fb- zOlF%nZQ8S0{VSI7@ywey&&AKLPbY5Aj61tZyA5XgB&DXhg3jK)vNE`H=~7ims}c=R ztzTDH*CO!kPSCk?=U5mR9b#f)PV6du?Qy(M*7CQmzP|dpb?aOL11Ewmsn&_zHD$-n zofA(_*Z*w0?e_M3;n>*Npt!hmo6np--_M``I&v*CEHu;=bjITT{q=Y6dvs+@wJT3p z5bP1aJ8Am#cF^jfzrVizj<5cHewCR>L*gIS*ALXhA3BAZK2VZqn!TEXOHwB0FW;l> z1w|s_g<_5(>Ef(~B_itL3$-*j7&~RTqBL_eTjyQ-{byOiq{;TDotvJV*!H%))KMVA zLMF>g|fzXWjO_*Ou#F9kx2tXlBO72%94|x?6ctH_hr^oy;Mtg$Epf-#^>$7n-{7hW-7sx5_v87 zI9r^&;UVsqU#nJytv;1v)a9Zy>-=*s6(Onq<6TFS{QK*z=9bva&-c%_FSd{=*&Fxu z+qZ9D3LCGx_k3__Qn*mG^Gep%AORLHwaH$~FV~wqwQktoDZ$9llYFa?;edS$h^g$x z!0@<3kl}zu5(|StA0eR~{@;(De|CnOS literal 0 HcmV?d00001 diff --git a/doc/graphs/diode_iv_plot.svg b/doc/graphs/diode_iv_plot.svg new file mode 100644 index 000000000..053ce7983 --- /dev/null +++ b/doc/graphs/diode_iv_plot.svg @@ -0,0 +1,76 @@ + + + + + + + + + + + + + + + + + + + + + + + + + +0.3 +0.4 +0.5 +0.6 +0.7 +0.8 +0.9 +1 + +0 +4 +0 +-4 +-8 +-12 +-16 +-20 + +log(current) (A) + +voltage (V) + + + + + + + + + + + + + +I0(V) +Rs=0 Ω +Rs=2 Ω +Rs=10 Ω +Rs=51 Ω +Rs=249 Ω + +Diode current versus voltage + + + diff --git a/doc/graphs/lambert_w_graph.png b/doc/graphs/lambert_w_graph.png new file mode 100644 index 0000000000000000000000000000000000000000..4049c813b1ab6a804ebccc03fc0049c3b517927a GIT binary patch literal 16208 zcmeAS@N?(olHy`uVBq!ia0y~yU|h_=z-Z0E#=yW(u;AS-1_lO}VkgfK4h{~E8jh3> z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrZR>p*U{dfH1^@fH94W>;emhD)uXvb7;FRm=Dbyv5VJ;k34Bn(kM8`GynPH zgU-*+e4q34%z{0C=Y6)lzuqq}K){JZF(hSi8KV=2qRZU<`)t`NR)lp3ICb1o6Xjq$ zbLa%~hmfT*iY)?LXU|zC?8LFqic?v!MPSur10gzdLZ(fd)^;!asx1 zz2)ZS#0S(l!kp8oRY zX7%@bzsJpdKFcik)V;mcKfmw)zt$=B(5$P0yBQYR?TtIXE%)|~&FTE%>*J2zy*u|{ zGyCOrvDTZ*($CLJ{r~Upvj39*|NVad=FU!Gb93`!eX`xlm#cRz+K_cs%PjYn%i%U& zN#iu0#>PhT+P6D)Sk(P`sebA5<(C&0GAq0H9XWSyozL!Was5w^`|T&qnBg&5&9~yq zMfZ;%J{V+g&c3eq=<#Dog9L_~H*e}hZerORcm7DHaOB=9)5^+95mC{Pm;LP-FRTh( zZS;O)NI-yq?<^BVGqY)n7Ad`X`u2Su7+qSW=vll-)!g=ZPW#2|2VPWUOLPKUY zo*gfL>uPB|`hLIu`JbPk8P>$^p0?P%Ur0j2W4d1KjhK7bF+1Gmf=332syF2Tu z)|V<<=XO5R-+%bz?R>7Ui~acdbMn)xTagCU6mU~O1q3G+Yt3|iJzP#*y@nuQZ{{8!fq@-5exP2QG45zw8wa?tD z{dO~*Yr&cM_VF+8@88d)(bw0BE z=g*f{R8?u&|NF5xDLs8T!?N}7?(WvMw6sinTmSQ^_|c0O12b=ISO~Jo!oou1-o1OL zW*VoTxn=w3!(pxke||jf@0vY(Hj~D|g9lIj{QUfE+~P0Ur>1B=tE33o(H8nJLyfj=NySwag)Uh7P#Ts3U z-rU(4%s7QpSZ&J9>-X=+XI@z`@#ePg_v_;sr>x)i%d4}i%gB1!?Ag&X&;NULwA-tl zPgcZXEqqu?R$>+Zh3FcH_lK3VIuu>6%vmZ&WCp03BW zprWDzqkP0f@OCp@0s*;(9m zFd;y$`i&uLK-AW(r6q4}1X@;nSg=T=>(j5->$Mv`eY>4MTlV<*^ZtcJML|tXO;hss z{|!5N@?_w-IhKp>6rZ={T5x8D;o&RaKxR#zJh|w+?RSlvH*a<=(m1uyxm|>vojvu# zgM(?ub$ONj{ryvaeR=7Xm9=Wp#EFSjb_NCkh2`bzKRn-F@iB=t;9kXJ-p#k-D;}~w zT|U1qh#~dXmdv!{|Eqn?gQae%`^_=9UAH^&$?Mmv@04DTJ@xMH?x}|kIi(yrkzLN9c3#&ajpyg*o7dLAyJHzVd;ji82~eVBoD#V?ZRR#v z`??rT4vv5~Z{JQm+|ECH+w``H>({Tpv?5SB_2;LjUWthdH>I7Gx?Jz!lB<{)q8(z= zlXv9oS>Mb{OFD0EyJXPS(-XqQ&Fy>JyWX(9txap@%$dvHZrr$$YeA2^{k=C9b#--J zix)2z5*JV3_V>rf$6O1xWL!M78 zUWc0X2nh*^IB@dwhl@O2AAiaI|DVm1X3SW@;Pw9A-m_W%-`D?-UYHzSDzP>H{=GHs zl}}CxvIfZ2d~m$HZEN=RS^tbD&YoR;`IeTnTlKd$fecUA?S7|q`QPpQ{h?wC+yX_qy1Vmlyj$2V zXB6wq=yRW6-fqsXudk=ytXnK?6&n+iadXqso7=9fjeh*@-MLn7@e8lN-neyZQ|@iE z0~V`t&(E`6woOx0^TpRHz1UqY-D0|D`i#@g%s92@?d(rqzp7eT%!u7xHgWds)7REU zUwm28(%$~~N-LgD4KFAwGqYV6zFv+&RaJFa?owvG zHeTtr$&-Vp?k#(H{)OB7ylo6YBMY|E97-k!HK_4Krgsw$>qv&;AYerL@mYvoc>Vsdu2 z`SQxo&#p$DKYQcGovMVKml_WB_5ZbM-)`Ar(qP0a%3xz-vtjdQWmD6wXNtFN+ZGzt zz9GkG%kF8`6(1C8e}7xLW5*0(b-#jFS2VZf+-#aXd$!isCCip2rKhLAO5C|?*CGwB z=aRzo1~ls;zTutEXjO zUw3h#GyCNa?=HpvSZdyRZ{=(M=unsU_x5hwxbflh`Soggdhgm2zs&#tr@g7ENsCi? zt{=NZzRljaoE)9-^>KR_Czrp!Cu_i`uK&JRW9`C4^Fv<>e0lA^c-pP4+0!GX74zH< zt(d0$_h>PwK-y-SeQmwUPL-~8{Iyz6_v-}BDM&?qb{ z-1F^L_Oi##8^eQtMOIZ-CMG8zo~Z18=GGmbloS=+s4WR!UtLWz4tw(C$%kjN^O-)J zF+P8%?5_R4AIki8KNO79&+U1e%<*=z!7A2WWpBMUr=2}jBWqtbXQHxu&~iUnHJ=#{ zAt53Q7cR8S}l8mC=Y8LSQx+Ex1c*rTJ}k`@ID zkB{{lZ_U2Ah_zcxS4msD+i$LwVa11pd9~jnL5Y9)a&`B9xwRj%`(!MI49=}HD177+ zwk{@e;a@NRt3QAKytpMZ_;Oivbo8#$*K88&<)_YDw@Y~6zI|Wb-JQ+M&Uax~Y4)vc zx!(Kh{?4!})ryOYD=*2BmX@BT7u(g}&;R+^*~PBiVt4BQ{{`jD$B&bDt$Y09#fc4x zhe6@|@Zm$BITjOxm;2rQvSZt}ZGS!-=HIbvmr=n3hj+W*+a2qd_s_`CxV=69`PA^Z z#0Li&x5s|JxY+&Y%jNTL?5X^mEAN~!|LyGjPs={uKG{%QncLdx>FKFxVKL*`+1bJ( zA|cOK$M3J(l6kr9!-s-Pmo9e`{a*dAWBxpUa8qM!7gS zG5!Aj{`k$CGsWX78Y@3P3tZm!bH}U+69n9PBpMfK%(1VZryaiT!Lw(_W*8>FxV)Ud z^z}8?p1r#H`T1;oG8KmtUR+wrJ#XGT6?OH=Q>M6V&%3KtlC>%EaNCU=H$EI-=ASZC z_Q1u97fmj^tPWeN^{x5m<}i8r`O?>{N?rtTadCP0`>Shcbo~7M{PTyy{2&u{m%ZKb z{a&?iZgFvOVM)o7{QLWs#feI!Up;Z+!~*wzxwPw7ZES2R-fTP$Dnx8;=e~K9^XJbW z3G+OehYuevJ74$UK%)c?n~;#uiPNW*wY0d*&CR{MyiS}uw=DhqyplIJE|%Om)+_z_ zgmQmEa`NGqmzR6`_^6neO!?X@?5r%su2=fitehoT}QMMcH5%@HZ->B0N! zYIl{t&$GI!vBp*J10#c#tD|9_50g!(wkL<8OYUSIiRwQ^v-~&|TVAR3vDa%%2)1@W1YrSZZ>(xinB5emzTMR3A^pB`g-W#!Gm9Zc%3peTNm%mEbhKX z`qt!w>*Y`E^ft*Ltp@~`5 zyt5xAy(!wX@$~6~cIxd`J1uWKeHyr2VZM;Nd)M4Knq_4RZ`|w@Qcv%i`+DK_@*Q6r z|33-zci*?%`mOa>71O%!xgik@JZ%4prGIl3a_u;u(|xt&VhgA641>g`mxX7({mr?z zL9Sk2-;HO>ojAb*dm>9Y@?M>0{;OMk?9q{u3(^V;Huv9JdS~LAnhyWw4->S0R4!R| zXrZ%!ID0$);gge(tv}%omSuG0Rmc zY56hvkG8<0vec9V2b+({onPo&&+31;?ZQIlE!ph+_BlKY!q%>O^JSL6HIG9c9bG$W zB>7|-oZAcT?Cqb%&VTSKOS1m*SZfa6){Bc5)>apkhwqM3)ah%PC{RCrLITgcz14~L z?H+%>dGpu;PTr*{4-)k3ZF|!uDn1DKD465aF?;hVgQ#selJRCQQy58fLX7%+i?#b>dX%vq$m{+xVbMWpU#Vp&^Jj#LG zl03&I=0tD%BkFK{-NC!%&Jhx4W+d_`NX96%sCi0oo(_q~u(`Ue);i}-hRxGwZ+P}r zNmkoUR+IGKfAiL=*p&i{m{fXNQZ@9e)N5UB1oVzE#cl%DNzq z!r3Z4EoLvj9+UPm&ub}t-ShDAd;W;JR!N=f+dw*5AvrC%WIoYvtNCnhTA+}m)E>)P3kMXapH=AEBqDj=LJlO`*f`KRi+ zY{oU8w_L3Prbo06XS~0+*Jb@LS=Y2b*XCG#6o0VWzK3y3>FSU3<~1@u{CvLm`>zuQ z*@{`Jt9cf0Og=6oaA)3%6LMM8m3Y{0Y-a!WgZX@X-SKZlOgu067rRON@2#v{8M{zm z`_t?3^`KT2yL?T++n~IRe}8`7sr`PpjfuspDlVND(YBbV)L2DB#%eg-KorM z=KDIIq!=!pSgw9MEk~7ASNdeFUtC`=AHFWe@U~sj5sqd4^Ygalet<R530K{&~D# zetG)&c~@2jw>LB}?ECdBx$Ws;(5i7Kny92wU{ zFg`xkxLn<5F4w(#$0im$KY#eoPmwnF1t&5s0)1zhX1n?L@JO5G807A*_^4$6|4;GE zf}c;P#~VoSyeP2(jaXb?FaP%Tc6Ck7&hz&F=RBWR-S_nL^y^=uS6o%;Ir3IpukGsU z#5WPiAI{9-)QytJce}e^{$9=H9ebJtOb=YXJb7F0?OClCudR(PEGT&J>gwt_*5&86 z*jic5`uF!Y^Rdg3M~@!;^W6Ub!Mk_ou2`XQtY7~8m6gHTe{Qw5wk}z|eERKWD^_$| zxe~HD*V585b=%*$i!@Z!)fZpCU-RgBPY+K~adG~yn!37wy03$0w@h3i<7#;C^XK#R zP4nk(WWTa$sbS5xH;tOX3o47Zt`^xE;^NX0DUo}7Td%uZCCgkt_naIZhUxn8&ptdn z%p+mIV89kU->!B=@!hW7e}8{}er08F8e^I9=VxaR-@PkqZf<^Sd%k~6%$%1yZ*ES% zyv$d6nr?L4^y%V<+xgiOetvptl6{S*yu5tRo;?}2x9LvTi#2-t{o`?YVF7^y_x4t2 zUS7r<7Z+DiUA?*XciHCa|6VNa|M30$@w<2DR(*YS@m>D^pT-hApr)Zo&J6)`b8}GB zz;QA2Zj~OFqjT)}^Y`-}Jow>+a=`w5AL|x0v-dKJh%6~MG>qrd<8;(ohF{r3M7PEJx~*s*KZrktBbpFVx^@bOVmRc-zG z`T6X==zsu+pdg`syI&f{>F1t&d3pKA&!2|L$9RHguiy8pYkFK&C%arl!oF0cFhi$O(Ib?Wab-&rOP`|bZ7_;%h>V7brCLpur|Ta>;M zIe743!$*_bpPrunxbxkzw|2F^X6*a^?VFm4O3RNQ6`PY^f2|VJkMntcZZ2c;g@4~} z=P!Hy|NH*`7dNGPKRY)!yXxh99_oUBd4F5B4L+rQ4Ifzf^WqF*$wp>eN12>rIJ= z*+4z3+uL#rOG{OCbb6AH_f4EO?bxo;*FM*~8Kg|JT*}I}-7MU+X%oZa(iNX}?A|@Q ziNS#N!qR`^IT!B$SktZtO14pE>)>+&Od396EaM-n})xF)=c+ zyUR?g|L%W%aWVTY`~Q1y{k5#{SUs6BBK3U6wKb70E_csgsIFca+x7Iq>%^yCKR!5H z)JPobG1NOQAhf6~)hWa)B}JuMO!v_7drt8PEDHs@R2wFdP{(Sz1*|Vc}zLl$bp{N(P=R~`FoyYM$SxKW5kELf$nC%9JCMRK0x? zMPy`pcJH>9ul*wU@Zm!XOUs$J?pMFxn{#8s!JI9(c9p))xVVV*Y@VU&)%(?wyUX4l zx_NWvG~MWXCG(FQajEY zT8BMC4zzL`6fP>1Y}1W?&@TVrf?~xd&lS<(Z(p_S$hEEhcI4c-z9~~gf+b#-SnVo* z?-v#}?dDgdhE8F1rVppI*H4%}{rIlZ*FXMzK0nj4_?d2e_Te^OpP5FjkB|3nE_&+q z?A+YbpU>OJKa;xhRYq2J(U$5Vw?p~I*F+w> zT75cjeVnaZpUlav+1JmkyUHVLHAOpooq(ul>a}}^4>xbkzW(XSWdBER-uNtb>z!d; zuBYtYr}MpZ&z?O$p4y8QxwY|fv-GNpdwxk*QI z?)!(N@bCNc&Rni?!T+`87dFW4eV2NuC0)|E=*L_6CqD`w+dsLwI`I%o#lOnOy{k+$ z3}wHtacuZ7b^qp1igvuWeyxl>IX7~1rFmXmtVi$tvkN-(rr!DOct9>9=%@I;s;d$n z+m&_JL@l4FrK5A?;K7Br`t-eInGZEwZut0I(^fgV{N0?7b_+^h_n5DmXUF?aY#!U8 zO_kM$Yrn6IJ<97Tu+n{kBPmy)|*4|RN~a-FL#x_J+*X6wv1g#z}uj#Yx?^S zci4&_rS2H~3*(P7}p^@d%*GG>YbgK7U z?=Z`4`u6tfIu8!TyxD2hZWAX?Tz1^w_N&Owojc#$-0XgIl}XA&rx(|F+4#-QEz@;W zY1vRP>$RjL4_jAP*BLbpo}a~iTmJt3Ui@A6-M(#EFJFH6a`~8P%eD3G`+ddrTLh+g z727Vp6w0xFzS!Q9OTpQ*7H-=VqaWMCCwt&1E1%2+1tF&h(X(HBUR_z~JlCq!!^6WM z*Sh!_kHbvMdF!t4udm;hbCXGe**D)H;evF;_GkP-!hXRC2Q9A|zO&d{o}2h}!f(qf ztCVYY1-zY<=Uun4@M@8I^;Yej#z(78Xg9I-WrY|0mU;8=%+KySwfq%kA-km%O(fhH z&dxGTzP&AX+41{zzje#X%D%j~_;}gxB}{mK4$T`RNMPp(|a!lwS{ z=7sRLMJ*T7B+kyYp04QJW{`Z0=hn8|(|>+`mNd-@*_kb}HfHCgoUO-XfA@d9vRGO2 z|M}^<#fz>?5_&SGo34c1*w(uwk$+X}L;MMg%Z-A+G0@9d+a-DkJWwXL33|MzvgMpw|n$bT-XQ`uh6#Qt#l{zCLRU$PdWkShUu7HjE zGgke6CLOU$By6qGy(?NRD@@YU)9=-Ok2TA^m2zv^tXZeFWL}vqjg;Ow8b0&ZJ3`d~PpZyjap8!J)PP?m}nwXJ=+6&zj{EV!N7W zv7~X@hu5=uZ%iwWpQM(OcBq;E(4C#fQWaVR%2kYvF6n@VD^4wNY-YHzuhyDj=FFL( zDYbupv!DGteCCYLv0iES$!fkF{QT*Ee|=r{eADL5FR!nce|>#@`lThFENpB=KRzUK zadXeKD%FbJU8bs_(D3f=?%8|SPnsn3>+5Uxk`fbcF&zaHlPM1#B<%b1>9o=Mzo)d< zUs&ob&cw|8^5*8{FN-xwe|}1J>yz)U98R_rL^2=MNu0K0K|z|HB^N5DbuW!Tkjq{aw;h?`S$HwOKU5r3hk4%cAKo`8?m>_wEFwIryxT*)#ouR@Sd)h zwtnK|$%n1q?>T&7p)=!+J(b40%igZK#lN6QrRU0oxxDA?`MJd${{8~xpsODslN-F! zW)B`dY}~)!e&4=*Ev>B|Z)L9!3&oO^_l(cm9A@UXDL8Igx-YM- zR$N>>YFkd`E6J(5E@~eB^QWfn|KIXQj~?CFeceJmwQ%E4mD$P1dJf*ZXYqN%S#KhO4e+x~{TcUPwixz6=#Kdk#s*{1Lj%fyKjUEJJ^ zl8$iXGjw&M_~bhfaI;BA|eIf-bA+XNCxHY28}&}68`UZ)(2{8 zw|8aT-lofNdt2`Ar>`>`c@kD+{{JQJGl!#2%T>x)dw=?95E(s3|4&B(28QjbJ zQt#?AU+Jc%rT`Jv=;-Kuf4@cl$@@6}qGs?igNzFbd-m-4@b&A{$^LeVdU}0|&TSi# zkM~8t;}6)L7kh0@8;%2msW+YUR6~c>b6{C>17cW#(As6 zfCWoZ18%v2? ze0t4#My0?8_Gux%N>^L=Y+1BqNz0ozIZ|dh9-f|@;`(t%u3w+NOLWe=)hkwXfLf*k z0u6r4mDSbT=gg7WytGJ5%g}J*p+io8{{G##dGqQo|3cqO2(Zmz+ryy!R`Tc1pMrO+ zmKe|}GYdTw3uc#}1b;a=R<>2Lhva?LH!&d%%`}Qp- z5043WPVeihtGm}m)zog?KWlxA@hZ*uTGqqu&C{pfn#!Tr@+>0tyhpLfQ47ge*W*{m zb_zIUO#0H3b?DsOV^gF5%iL6M5jZrbCD1ow-<=&(c1&BB$f?-U<{@#l#r|JI;^8an zoH!IsPHU}~%)POp@u>Zu7SP%p5sOl;OP6~u|L0I_*`c`ljpWnk&nHiwyS7ZyP1?-i z{k;O|%ax$P?Zm0JiyfQU0=F;Z*RG3RSEhL^Rq5SM_qSRt0#29LY)W6EX=Uw^Bk`ilS-HqmiM5fN+gRt#gemE7hOwBb!=vPbxol~K+Iut;+2)b>NPbr62@sgx0c@7w?=10d_34^pG~CQ zet&gcmU~6Yf zVCl&-CTtVWT+?k4*uLac!RD40mScUg(P_VTzu)J*+;48)>lqg>UYui9dg{xMD?eF8 zOs^YHdhP1O5tz8DW#at#@~^M0U41FJ?(T5G6 z=iXobxz*Y}tdnt)QDVKQjJI!_{d-5ht0#hjw|fUVIX%<=a;u_()Lw{YyjfMI zTCTR7K`-6GJAbS8&f2n~ZxIZ2b)~8?DptxlD=`STt9EI9pH;q??ua{fL zdzWGEs?v%Ihb-RvIod4((@tm|)=*Mvy4Y{q*xS1+|NPxp(6o!zA+5t6+BUX|nw}ub zoqntIteUvpTt)rg|1c(Ov%O@Av!FRaKW-Wp9!Krx!y}zQqj<46m-PKK|w9<&WRKE%TnPcV>oR^Nkx3 zUS3|SHXrk{uKJ=8ZGLotM%Sv+AHSVz_N-FnP;7BsQ6Ta2_wUaym(K?+T=AQ4cXqPB zoo7sp3^Nd@Cm>#?eow+xfLox5^wsn%M ztgME0e=4TwM!OXi8QK5&z?_+xY4i8XWfnHJO{u4+ty;G^=vc4x@j3kV2ako_6+JR% zZtrFT6_piHZ30di_i}yNr_7so?%UhjH}}9o14N=+?s;dU}2O`+hJrl)b%WSotZ%tyju*u2q=j^{lCx z*Lcp&2?U4!Hm-Q%SJ&6eyZ6gIt^fa9Ue>B4;ntQ+P@`_1Z8d1U&gP_}Tt>#mt2c*r zi-@p1KerNQ!HH|vrcIb202+5UFf(Hz2&5a8dC{%rUaq!8>$(>zYht8j0 zzw6c737MCdeSEk3{i1JGZVYvG$A0%rnsnf__uH%%0jJqoGH$cY^Oxn{-#2B-ln3wM z`=_L+2&?<4C@C@3*Z+UDX5%H$aL3*6Umh<^WWK7$I``fBdlOqG3OL<~Xgz%5^5x0? zc0XG>Iyj=XWCYGNy=&<1?j95KYISUz=jmw$uSCAQ0M+Fj3w=fT7GGN%eR)^u>sM=z zX0fs#?i7ZkYE^HKD-B_5du&0ANX^v}Lzttswd}9}hsN7U2CEp?MoGRm)zS*uEu`3T zL5*{8}CYDdXP1O#M*j1ugSXj7Y#}0$EGZIeD&f0tGUte3x z>3!aPd2l^jThQ95gV)wV9J*xgy2GXWe!bET3JQ`iNMQK-`ucM3>3X0+fVZ38dAz<> zv>p^JJ!;i%mzVpS*V^aYFxZxR`&jw?+T(Z2@2^b?Enile{rE#(Gowk#w*U@BlY>fi zy3d|GdGO-JiZaRaBbS9`WFJ0q-Ks6<#PRlGjl|zSpU=zK*UkC(`1tDBQ?iqTOPx3h zlUL1Iw!7@@tW3_&uWi3va5l-jbmU9L-Cd=7zFhKN6SsHPGT+(P5?Ze=4%L4A;oS-i zuxYu0sy%Psyy4*D(%Ss@S8(C$Yil2Os?SrfvYItv!h~o!Q1*XzJ-(iG!IC8{O^2Mk zy1E%PG}_ku(bD?I$70sJmtDbfbasK^{d~W8fkfBWX@BivUag94 z6nGZG30mpo)+14P`MLi*o0EUP-#_2RE3GBs0_w>vS+ZnC?&hDxOB^=FNhdy$XR+5^ zU8Bp!%4I6FqI}T?2@#$DwIZ*3nFDox)>>o~y_mG(tjW*tqEk~eD=I1q9voogld)is zcrVMv&%ghr9cYZ^rpBIFc7KD1o$d^e|1)jS8SPQ#U2w$P|Xs!yCrMk<-ewjz?1I(7X4g!_nKQ!8G z8eeIPG9PfNi&p8$inzTER4{)m50i9rb#;C6^y$jjW4v3lR6%w6qxWl!dO)l1+P-nS z#|JGc(@bSyb4pZHQC$gcbG3)IU3_zMbEN!k{@Yf!q;)cqnGYVkWG&>>@j5b9A~W`- zOex4&Dm@_z-V?YLTP!)1MYrT|F87DDcG_Deay2zS1r-!A{)aqRb)y`Tl%70W1vb06 zWg?f1Y_Id4$B(Y8bKy|ja!~6qXtK`c?+uMFRd4U6hj^`%=2Scqzs9JijaT~EXZ`(c zy}fI1Exj`(#$3p$V}C@d1S=ccC9^Hf&#oEons+B#rA45A<0*qpEV|K$Rt7`zibCR& zNtd$Sx)yQg0&d*4o;tqNWxU5D@UP7PPK%-;XlQZQE|` z@72=q04tGnyI=cV)_0ak;)w~0CV6*e7$zSJh>2NK7J2p1eR(4z1@rK?UM&JnwzGH^ z@2mYSBrkvd-{0Ss#m{)MudPXZdTMIc^ibV5Zw{RIuX1nh)x_XseV`IU`MPQFrnN$a=s;jsE_)#II7vu5!+gnMKj0v|?L#21-skE$k zYa;EIzyGh<>aev+wzhLEi=Rc5p4U)tsB!}tKh?m?!z1C%jg6_>_WypjyX4gs&IZfk zX9nr#Wc=n@xmHwIu(Gn+{CqOm+&0a}hbMhqbpOLAH!DPX*QbZ9@)VBP=md^aTSTif z;Py1#XrqJ!4A<7hM(0V?emp7;X@Z_RR^j<3N-xG|@87D`(SflRg;IQXmXt3scL=(6 zcK&veU-tj=Crn$MCtH4MfyDi8)&Dks?p|5vz)?KQ#&@{}m(^UphDnoz_++h)?EQW( z`kh_uu9AftHV7EpTU=tQ+IyJ&JM)DDf>A$1^3RqZTFC6PyXdo2Zs~(K|J&~uDoxsS zAb~+X95gCw*;=5=996M0_T<~mm!Isf37nnzY5kKenU^g}UI>5&MNd!Deety_uJ-HI zqVF?JGKD6q`5M{w-P|{S#R)lv8@C!3*KVCw;~vH0SY@T5`rt`PGn>_l#UH;12$pSI za6R(hZ;flsy`p>g6}PxdPWvIqgepE9WPf>Y@9t3kgbkaS_4Rj@a5gnx zUFXK3m^DxB@QJHer@p(pdv&Z^@2Bt64TPMo#Le3Ca;upZud-sxie8l-lSAkEg@nKz zuq%p*O9YD^uNGKj23lsZIgOXw?k7JR_s*B13ks8W)I@@#L^e#)t@PEEgZB<@I(GL| zrj?>g?y{2?OUhTp@2|UIv3v8I->O;DgA(iNKzZy+T-Z(HO)mHD9drHm=`&~mLNRMz z%S5*ux1ATe6|M5)2(jtte#nC(&^j_z zVy;c)q`4cT14Ufl25B9=9qo6SQ!z_@HP2$*=xrO`v>z4Qd?{N~UY=7~(dBK*)bEnL z^7ix6a^D-RO;6EGVQ3auv~AO=c@vj@`qZ>U1=L39n5CY$L{SKoT)hr?IPcl3sLR{c z4RPbNmWgdw)^h9VO_&5OhypjO^q7E)>?~zY<=&5%zQGQEfAFMb zP^O&RgjuV~M4dPSH?J}3QS+a7X8Y;7K4ocG`el=hU! z?3pbcvwIoDBAxs<#jH9pJ0_eLtLb!HAHI8vSN0VSBjbfDINrR4B!;%oZ$0mJz1Cyn zk!m}4?9;t@&CFL;tM3Jc)}o*HuT9sFPdnJeIyK5^PweipFI{iC{g$sjc4}4s?%jpo z@)TQE=$gp7u{Afk%T=~4pI;}{+^VZsr!HkSW!^-AMP(ODB=-LOb{n+*{;g5goc8uF zJuL!TyVDM5+}@U3^Zjml&A*?|v!(|g?IFWF3Q)=oqekl`<`1p8GFJSX|JMZmzcTb!?9lX$~^yFSp8Y>gm_$G?tc)ppV9B!*VSKbLzg~MV(01N<>ULw zaAZxC-|KJX7jNhXJU#WU$Gg@%r^GBJE$Um1`!~KmlZ*#`UPVo}mfqR+=a0;%qT(I( zSBiI7iW_Py>b|Ag8Ko)tfhmM*@uwGGt2S-gP|}UqCQ#c zq7M%oH|JVOOW(1v$$WENkvcGvNdur|59}jI=wsI_7w>Ws`+edwG zkMH;7o--%*RBrjNBZ_-!nG09Guexkzd2^5mffifLr+q8`y5r?r-km!w zV|@2GIM&JW+gNn9a@%QspWzh3&)a_S{?X&dg(W0Fqh8y#Z8Og;e|U&>U2J*Y>&xfu z9WJ%P5e zC2y|myi<0V&Hdx4)$0Z8{MXOkc5|ccG{Nuu$Cno-e|uve^6sNsf6WAUx!NAaz~)oA z=9QPax8w;Q+MzyQYyaKT`WIJ)X3wk0s@eJWS?veA%F3NS|F6$B&s}`|HRqSFY!6O! zT1c6d?9ROXzs91!r>Epz#q0Y|_r3E!U6=Cr|6lq4zdyY$y8U-gj^_XG^%r%16eaF_ zo3uSQ_1v2Bh>g2)*8inIA%!~7GBptq zc+enfEt;)*GbIo7hH~#r$a{tfg_Vb@V z?tebL+DCEK@%Y4+MGGYMPZH7f^7IUJ>ycRa;_EN3x8}vqd{_gH^~=|v-ez6?E`*DV zEAM9B_jh-_^77v4-hO*~yZ^~kr*@_8Zf57#dinC@(``3*6fS1csH>~nZgX#B=lb62a@K&lzhAFM%e_C)$h_SquC8w1rsC)4qPJ;lXsigZ zZa%mm=jJ9?LkXUz+p51_4HtEoX_9$Kw_nrct4ENRvB%`aFV{VP_^|NsLB7zH+1Ee$ zS5MjX``vEsE9-)n`-x^<-&gx{d9&8)+}qnkv#u|4?dIB=eQ!@?>n&CmmXH;(u0MZI zzwfO3^ySOW<+eiZSDjDxl)Wo^!1lbmTz_Rt3JO*PSkLuyuc)YK z%@T3aHmRNuSrhx&cJXb~oErvAOiUbnd||t%SYO&znyuzPFX!X?!^e)b_1mfU`0H{eig*$`IGn=s*W31}OodZJ2; zfKw@`E1(#H!b#uiynDU4tnAsVtHU!dEMWY8w|xGsry-}R-|s#C=xBFgY3b9==j~R1 z=v^BX6cPg3^l<;l+f7<)ckGz)_V#w;{ChTGYonHyS#Hn$`RVDK`}^mA_)q{^2W^nR zu>a4e?pvv$QI3v`>i+Xol$4rwzuz}|W$<#)7N*s)(^fpqI$P^zoOb5Hhlhv%{QLbr zYkH8Ps;a7mrRB#@r}aU@HVk*}-UZFN9o^Huzxv0+_KzPwCceA#NqyZ`k@L3SWj=oV zxCYdM40?BB_xpXPZ*9%KxgoLn*3ynB_jksZ_JG>pj~*q(RlQWbyzSlH-J3Hnt9|Vf zN-HWZUKzc8-L2F+g06v}dBoaZUjlcF1fKSk$h@-9x&6Y+k~HC(Uq63NoIQJWQs|;9 z@9ypft@*3?cvSqV-qUSw?(UwxG5NTVl$2LHpX>~)(p8|c|J);X1JI6yzu)gqzj<$e zeLWMiZh7jJLx&C--G1}tO@N4NYu1skeKMAZIs}y?b`&VuR(%QBJ?HkL_wUbl2r7dT ziG1A;#m2_Q9%*yGx0_sa(>^AqBquu`ZsR?jvt2tq(9j#SOF+bR;erJRO0-_Qy1H7d zKI+6JS=*{9D^_TL+V1!F)n3(mzOAydQczUXH6%pj-o1N1GYlHt~_}l$diLd`_dfx804ny^~HxnhNg_gX%W%}#;`}6GbH3=6T zzm(s*cTYq_Bp@hADN!Xvx&E`ssk3K$@9nKNPCX?OwLS0bt*zOe{r%}DC#hyl56eC~ z&vy2iGd`O(ZHm~Cz{s#~-##9xkbg$+ql&-23QbB*etB^*duC>)&wRVNj?HYI>!Vk! zy4Dit;lZJ&rOK9_IqUZc>FMq+E-b;zd;)jt1fIS+>vvC!fKx{Aopewp za|Sg@oX}RpgF0O;(6#dGuH8vjxe^!?b0&ZP-?GEcm6Vh~1B(y4S_Gn05>-}(CMGV- z+}0FyyifM=sj1p;?(POPS{XegIbiR2MD;gsq8aT)TGdEmcm%kgwNyc!b;*xuvA13(Lv*d3thg+_=#s zE_OF)SwSku((jkN^*83-wKB`S)v|y8 z{##Eu6iqz*E_Y^a&An}Q=3R$eVIb>dh%Y2HKuCyuEns@y=6G%m;i10K(Sg%ZV_ce{>$4Z6A-w0T_j tOZdB(?K|cPIB_iGv-DL56@~x#+g99MH}Cg}AO;2o22WQ%mvv4FO#t~{{j2~0 literal 0 HcmV?d00001 diff --git a/doc/graphs/lambert_w_graph.svg b/doc/graphs/lambert_w_graph.svg new file mode 100644 index 000000000..145fe99f8 --- /dev/null +++ b/doc/graphs/lambert_w_graph.svg @@ -0,0 +1,65 @@ + + + + + + + + + + + + + + + + + + + + + + + + + +0 +1 +2 +3 +0 +-1 + +0 +1 +0 +-1 +-2 +-3 +-4 + +W + +z + + + + + + + + + +W0 branch +W-1 branch + +Lambert W function. + + + diff --git a/doc/graphs/lambert_w_graph_big_W.png b/doc/graphs/lambert_w_graph_big_W.png new file mode 100644 index 0000000000000000000000000000000000000000..ffeac2c446b58bebf784188060528d02c27c1300 GIT binary patch literal 20562 zcmeAS@N?(olHy`uVBq!ia0y~yU|h_=z-Z0E#=yW(u;AS-1_lO}VkgfK4h{~E8jh3> z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYR>p*U{dfGMxHZ!$r3D=vO~3W>RI|KxWWVw~>$Q1}#@a7o z+wKJA&yGyH{w;5rx$gI0TX#O6rlh5p@vdu!!U~0sH@6M$-T*R4ikE{&=!n z(YfzB^Cc7SeYSmW{rrYTs}qM}%LavLZ*hed0jC@PzdjB;a674$L$PJY&>JxD4u%0cmOxTGdu~5j(i9=Dx?~n(FV#`ra2~Ne94HlfriY)?S>WL~X0*4-{ z^t1>#Ma*fLDB#4=J=s8rTADg0AS85Xo^5sB$$v-QdLH7)xVVVb%*<@bvSm@bM1-H8pa1;N&(G8J7RMwX z>p6JrSQ|4t-;^wAn+gLnGqalScgvUFx>x%>HYYcCXU)%|owx7rD%B2N?zhyvUv5q0 z<~D!3pDo|s-VTrcYx?xV!^1aj-1zWfaevemeN>cG`nfrZ_V)j$z45;@?~QJ3!-aXw?0f}JPl^8e`nvpZ>fytOBR3|oMsLem zn0&nN*w3oH^Ip8jU?_Wc=j4vU$3EAh_t)9VT9quQ`}^x@Uj5lwrVKvw?dIm)-4*(6 z<&_mpO-$e3-fmyKSUGlAiDBmI(A8pdtxADjeUM)W$=-sM+GG%PdfA4vK%-u zQCT-;s=%@(=_+13-|zeF)#@Jk>&r{#1JBOR_I)OARnpPZ!*f8u?fU5xClao&i~aKc z{{Oby{$5^82QFXU?DX}Hm$+Wc0{4EoGc%2sheS_S^S!Y>Up{}&$75^t-{cDk3p3{K zYjc`1VP2rBh`6}0sOZsswZC`N{4~0E?;ek=)s$;%qi5@s|N4^2Cu8C8{M_8kD=P%| z|M|piXlQt4ZS?fxa@9QY^72!H)I#Oq|%bd$%>iY_nXa<(CZ;4m23e&v$fW-2d;F_VaUdnR#qi z+W-5}ykLRCu9BBdQBhK$xb&Q?ref2>#9y_t>I>uNwu%$YV`=^I3vu^Y{NvTl4+>?bzLAy1UEYtC^cmpD;ndtxqO$)%1$5uR_i8 z@A-Ima4cN7@W`=apI)!u9~2XFW<%oP7k73R&s-nh`Qk;!w%prn2To2_?=9_R2+|D;~%9JAu9GeSDOHFS+ zJ2%%la&sE5rKM%b%S)}GXs@omy#4U}`hSw@>gsHKGAHKQR{!{VJ^tmTrQC<%3|6yoRCck+|{pAXGN zWo2P;adE3+cbA>Icrozj&z~!Q{HU1xRIcIyBkKxL?Jy00e}C2$VQZsSUS94$`_1Af zhPk)46va>f`1rWC!`mAh4_oAad2w--_jJ9iPft#A1-!n#-h7+w$0Ne4%HG~uwPC}C zGr4g)i;m{#K0e+b?xiUzE4!BA>zmEzr$uddY-U?k_xG3D=X=%fZCO|3@B8V-D`9XT zWp?T7Yr0==&9^T1+nRqrj`7sNgN|FXu6q6a^-HU|x_ar9pwG|Gn@8V2)+;?V$V=9$ z!*UBePQm(FzHfPny&(FWQ$dx-aJ$-ph zOw5%{si%FmiAqbaW-v`W#Pan)Gr!dKuc!6*Pl-Nk|No~y>x$gl+a#aQwXct}w6M@n zS69EfDb@Sxj>6=}_ubRdmYw{Sn3%{Fu>aq$)gRxl$iKhu*f;sQAC6a7g?it-d2{77 z-RMyoOYfsJuyKsE&lza<9jMUpNjo|Zt@y0BacHKp*B5YIuQw< zy7wj@=X8sbF6X(zSySli5Y|+{qxBgh4>}m#(XRoddRxf>VL2>DnApN~xCNW)E z6S>)E+vDfYm&e4$hCV*ld-c)L?odC!zOL@>VB4xM0S#4;d(C@J&$FwI0(s@@%ggSm z>FL@_r&tv{XecTv2|3)xYkV`$Q{v~ZU#sf>|GuxKtLq!PyX@?Zdm9p+pT2$_{qTDJ z!$YlH0r`8sPV;=Lzvn|!)V`XXOjmj&jeWNL|32$fkkGB=eshgx#$Pq~^!hJGDSy@?MO%0C=Y?x(NyQ}c#qen?sHzvEYuDH0^T{_->>6DZI>tkZ(6wchQt=&`g z{oPuIum66(mwqm5S>$4xb0fgg(sHG;d!NMf=`9oY@8AFF>(@~Ge?Jy$X=ntj4qqSE z@ap1X_n-Rr=3iSEyPDzatJUkLWoiH1U{d_d=kcD$$NN_wIN|dU|Ea$8`s=IH`uju9ojbSmP{zR~)}?jw_J2M& zv#!wJ|L0Q5{&(-*t@4{|b?W?i|Jwh5ziXMBho`2bO!*yiHgbR6-c8%LhdVktzWVg^ z^whZfyF4XkuE>y>8T{$x%PQ4G5kbMkPcQdB>D}qv&Zjp2-?sew>ljQ6AGu6^`{UuE?QE~BfqyHx+Djy5b4*bOa|M&a-vvsTs9yp}t=db7D;_CVAb?C(}`xCE2&3c4{ zghUpALUzip*S^1&&#yDucDMTdUN6n1eDZcV-}v|IT$Oc`wJtMx87OB{5y1HBAiKQD zIqk~N-@bnjudJ+0y%u)U;MU&i?Mxxt^X_`-{y%GeU&F!n-;c+~DpeChmix(;{`pZj z`RU$0d%SFqZ<-?N_WS$$@CGhkUfr$d9v$r#T_9KaMDX#RNd}+9?E zP5XB5-o0t_=HS4b!D*o&fU9b*IW=#{l}$jnI6KLnVG4gsycDfBqoQz zz==1X9_x`zE{Z#T@uFbE!^7>fWyJMo=D*{f`|jO4lgvv;QsQ1;Tl?|DhX-$NZhrB# zDknGh=Eh|91PPA~)!*|TZ(6x><%<$4Az@)}+0}B^WjU?$iz}I!m@+Oc;oM#JR!LvK zf5i%ooSd8&7ZmT*%PbSc%?#K z*`$QN{8}X>EbQs!_2|SzWrozc|0nOf&pz34wxgp%`kl6^=~Q8LzY7Z-nV+4Tn|RT&_LX}VEKsQW@}lr??(E5P=A4N%N;D_Hg!YpZL_$#pQ+#8 z-SwWV=DQ+(zn!I}@9(|* z`svZ>1Ra?b~M_v+c>xw3HNs{ChT&x9uu@9ke=Z zt=IegI+c}`Jo0vPil3kRcvL(-;?3dfZ(Z8T!UJ-0bZUQpb6tPE_|XwgzqwXNzrDTv z@xzA=9=0o2uC%bSlB$l7latd}dShp?`p1tSm&(=47lz$EboemijZLZC)@5%Nq@SO6 zY}>oLyO}@S&fmW=`8eO%|B2Ih8vXqI)?Ir$?aLvrL+`4tuZvy0W5x-uZ*?hZ^{N~=?*_y%2X7v0LPMvJ9YC$Wvcu+{lkvW#d8Q0d#bj`Lb zeI+6(DcRE2CS`9reb2+`HJ)G6LcawW?ydfQ?AWoksoLQ};^OIMJ%c0+}aX& za>J9RCZ@?hZ*R{xm$O^DYLd4>?u`wNj~+dez7}xtx|WHFNW{pM`Bm zvHkq~{PFwu=il6%em~^FRGEEuHY7Hm{Ig?+#pJ_R6J9X3wX_uc_>d?hB(!SJdFh#k z$!ywTYZ6XOP^|g!u-$ZJD(R66+PN|J?`<5PGPm%7haZ#h>3+&%&)7fTe5t4 z_$&TxaeJ$_(Tc@I~{`k!spZE9nYVWzb>BsNi%x$Y(r_9N| zy`xb1`~CX*seIpK@((mHf;1){@B8>__4-+JPJ4TM8}FO;_4W1R$Bwl*xATR*U|J_A zDA>}{vLWlLR^9)<<&XcYS)=oKdh-0bUoU5`+G|wx{hjaTw6ma|z-+TzqjTraoqKlw z|G)Cy>yxKWP5tv=!uVf;xZq>;KO!zh683-QC^N z)lS#vZ=Y*bs&(|}QJarPgj3SeX60zBt3OYhFLb~5yR32gxh1u~zv)D8TXV;Gjdu9D zlrJwX&iawGMa)AYc6sshb1f|`Q>x}z6gIKT*9cf!TPrCmOPXW|yuGzG`O}k=U*6oD z{N+oDn%|s=chm2#0yXpYe7luh^6Eldvkkx|1{m`OS?+5e|>*{{>#hDz0X&z zI(6<`-&F1Jp#62V&(6$rzP!vA)U0>xm$S{du%PkdhH0x;Ydg2|J^k|XGROxfC#x6# z`ts6fdv<>Q`Aw;(3(CvW4>U0LNEkMqIN@TaIL0 zTpW*_&5VbK+dp3k_P@9;)_T$6#g+elK9{tqDCm7t{pQBTl(e)<880t8N; zJXuj$xv}V}m)-wApSg0E$L=oEiP*rfH}3ot&EOZ8m-D~h_ghcC_RGYL*GvBHT(Epz zRo96V9%gxWJi5hnC5+Q}CQh9A<>lq&R}?0$s(7_>xmTOIanccvU*Fzle~Q>qu(0sv zV)y<}f4|?KU1P9w^3A;;+43doYB&pY^CMSJoixd*TTB;JryM+ZaH-tiUtbr8t`7V1 z;$ribEhg*Y_ImBF`x~(-h4b(4@6V5P3diiLnOXgQueiLtd{J?6VNubed)4nvD}(hk zGz|8gjIUp@e#MH8J$r1bzP@tZUG}!;^Y=G5o!{Tv`}5iC{2c`knKo|RxMSC@Pk%n2 z|NO9Be%h}qSC{!pyY))7#;t$;=H}*@T_v5nN?#k5y@@z<_;6uS5fjhx>wo|Jk+3L8 zSed_!x#aaVUU_->pr9ZRKfh=1cE4YDVWFqLzyF&zZzL>>mfXzVT3K0Xn0LowmU({M z#{ViAGp$TMfAZwP zqeojiIyfe;))f&KpFD9QC|$g`vT}0azW#px$H)7R-@7;O%a@W(n>TZEa6I^UTz*Zfi@9giL*2?-0IJbO0v!-InrRaJ{FzdUj7+_LoZ^GaS^IJhIWzP|pktJmX4 zk377*7S;a#R`cN?`_d{!)&1hO)!$5h?qxXqK4-RBu2#v3%?lPZJbIM$Zs+rPLE&B> zK7USrb7SL;n>Pi;#od#Vl-}Oj`uOkn`_FHt&o_+>TYh=sv8(4qqR4^xCy);qkRox8JXut>!zc;L{UNE-o$!yBdoG3wtRU z8BpbX=9|f_?fK^~``i0QL`d-4|1l_jer{>@^>sCWJ|17PWXXqf*6$_yb8g(YVNmiS zU{~pDx3DlV(8!Roa`Q6Z*+P<%p0~H<_TJuG^V4YI!iC59BSk09nBkF;p}{L{cI5Kq z%~ux3?k+oa;q<9fi~QzVmAt=qw?gChxyj5DddpK6i`2`-d$Hx&D7kVdZh3cVsx}Kd z`{gB`!kfdVh(}Fiy2AX#V6MO;v+oDl&P+w;HUTNAQ?J+W zKlkV7=d*FWQ5=dbr594ppSX5y+Pc`?j~+cb^!dDfe}8}f(RF>gEdq<4Wo}CU^7s3F z=T)Csx4GhD zQrMb^M5Fcl>J|9yO{X51Fs+2=ZDyIR?uM;f*Io#nuX~bBIwvQ0OZ@Zs*A-T;T)iS( zTv|HXA#>X~|hE!T1-ez7x0el@7FWVhNkAfZ^?IvK6@?v(8;5+ z+lHymDZASnjR~ zbAGssZkxcrg=N+Ae^G~S&0%tzapvNa3-4N5Sblwd-M)Oe`q|m$>6e%J`ph(HogP=U z^3d%YdyJ=bZ1Ahum0)?^uVMk)>b;h%t_3EXPR%;8oeJmb_*{<) zR1}v_Tv51OuX(z5#r<838SIQLBwmx#~*rb^=PgcL*>;CuGSKZiY0!|%Li%uFa9qv7`tL$ym($anzOQ$RE zXRqF=q}U>0dQ|JY-n*Nd+fDcX$#`khBH$D6T}{hGtmKR=7!#iQ6FAeu7OcJaBn*2W1R47{f+wg@b0T4U66 zYg_JV+lPYF^qe^qU05SiK?CeN_C};iq^74Ao9dpul**ylvO-}s&tiVN9}Vtqr!AEg zTXw`oq)LE_`!)CW9EPg^4a#p9_ieja|NnQqlarH|?X|Vh=`Sy}>@XG)O`Jb7^QG1i zS(nN2Rk8*N48F5W4E>fbU;g<gvY<1=j$)63SG^$cK+na&ThxHO0Dwa=sk6&gF45i2ca((vo+!Ta)m{w#>KKD__>S^N4&YnILr+-g<*O=sf7iF^M4`weOg zKezvWr})XUXPXiZGCkhIEw1}XvVXUcN6mAkFM)61yEH)xV#j$TZ|9vkNcCOH`#Q`>kIEhKi8x4ZQ&h_gLx z6CUnuFWsGSWrbk%_jjphXPF)|(9+OIIM~E0A}03fqPu+H?rjgR?ascwPSw&<(%js< ztE)@GrozC{(Q%G_{k)bI7B)Vaj>(gSgO~eleGJSSJY-}}9wtZZ9} zrPGz3KQ$Kh|JHA?tiLB#zoO{dUUd?A;HQ!k+-QA~ozsH7zxVX8o-Me=$Rd4a-mmc2UprZU(Wo2b$ zN^0uE*RP}BeG3i_E-WuUe(>PIoa(YNv!h3k?%2J1cCNmTj*7N+_pZ{{_de{rBI5i1 zS>3Of%XjSBWmNOygS6i6)YD@7{{6~+ocwmZ{oN+6))ftFbS!El!qzsOw`-mrcj*1e zz=|&~(>SI^ZC&6mKf_M;+8RTh`}=Hd{+iVM)}3RQ%dzH1#f@#e({vgwixWMis{r=Z6m;zPYuvd(R#lhDD1ONm!L=$jQmQxwBK)faUnJv$J2`-*3d{zu&&Gu~EjN;J}W1t3p?Q`1C31{k^?+O0UQM`0?Yx%aXZ^Ul6hWuT}Tg z1qOfS-`6s0WwnU4=ziR~*+Om3LBo$SeV)&GFN>c`nm*Mr@Nb*QFZQ4t1``f79DDLr z!XxmoL)TyFz! p1uhA#>dsz68)`&;ls+}?C<5PTiV-$0|FdMN=yU=1>fA**v!bx zHevGQWFFAWz?7gbFD^1Sw6w5DnPenvlC7_=PmZpfGN9|v{Z932^7zI?go*Q?ck-q-&(=DSl=RP+dx6|29$d-DAG<-OJApvkp;|L++X ztlqF;!j~^4a&-b!n-0<+q#Zl^>6aOByDzfF@cVJ#3eM_V4$5bt@~W@bK_H zIoqzebLVc{w>A5E(XTI=pvjG}FtOU--%>w5I_l!)7It`btmQ1;#rpexFo}zcxA8~@ zEqrQS{x0Xw7Ul_6rp8}(c4?5&(6$jj$5Dp_t)1iFE6vZySp<41qE?%avI+BJGpb|lP6D#zCVBU>Qo!A zbWi)Iw6n8Z-{0GNb6f80jn7#P>i^YPmApup^X}5p?vLs0?CiVB-ky4RxZOLq{@a_I z$CN>nNlAZyeLc3V^7FHY@7|sJ|L?nf^4{zD;s=f&Z!dj)P13*FB;!Iu@$++2f6vM4 zN;{nK_SRM&34;SFM^77x!!wf3)ddD7c{x9}XQxXTOF20yXmCiYtDlk! z51lnv*Wy<8|F2uj%*@Qbyt_MFH+q}I{X4g}<(|H}I((*Gt(AM9Oyb{PU)7W!)YR0R zICswMre9c?*a6=2Pj~FxIde{M*1bKJ4A0NcmP^XGxoPRiEkRvZSBHb@gh^AT9BE`` z_i>Y$uJLkjqvDn+LC0POFZa8+EjKz@VCLne-r|!#f2_ZMZ0(Yp22q<*JZGxkZdtKu zi-|=km)|^-Kh>|MD3zkk1X=xDciZ|>Bri;0E3 z+xPF@>5k6MgV(NIdotn9{g)+H`+mLBw)^wJnT=P9C1maKOKYRe_x<_gEhHqQB|B@{ zf|~}rB&E%A5)OvPN9^JWyv)V@pKDg~@dq~yYx-r5>-`g{sBl;vc3~0gmR#<|?$U?U z4FcTe-hDXBJil-MetS<(&o6IoUbe8;(dqg7`}^k;%KbBR{$FtB{|M@nNJ^gk^YgQ1 z@iU(M{eR8=|GK_E&ti?Wo!vb3c@<61=T-Oh^zg)0zcqF1l}asYown0nC(oW$)z)5p=WyQj-`Ds5JG%XT-RTDhn`fG4i`~0-@5qrO26=aO zNPjz{b5QGW#-$~mChrTTf1ERM$Jv)(+diAM^BtV1T<~SZ!@^fn9_}_>8zm|C_g7)= zA(2l`Q9>6&s_SzWHJzK+x~lKlEE~x-zP%5V9v|yXK0Qsh`uh5J?%bJSl*$DfBlXW~LLnYYNEQ?Q&Hefs5S)Wo3OUDlC-U`%(_K@m5q-U0NBe z{^srfD(>$eKQ0VjzW?6mn%df%+j6CYm;0sO*-^M-$BqjdliiQ?%kzVVq`hPtvo0^| zEnMveN8~%f~+CzrOZi`{yq4%L`XXFrEIFw@_`)E}pn`4`Mg+?-Ua(ejri# zt=GfvPcu8)w0etGTg)4;9=Lbvy@j!`S^l~|RSdFL5^OWCOlWFinltB=WShR$3yll1 z9n3t>lh+7tFPf|K^lKy*0Th#~Q9DxlTw{ERAE{?srOY z{XGt4WoBh%Wq%&a|4(>#XXiA%*WXH>a;=GGUmbopf4`*OLgNg9J^$^#yvdX((`^wD zTXNFi*W-SB3F|VQ)nRLubaZ&;`W=6HdAatUf9qm*|M>a8ZrwqyeCEQ!510KvoYrsC zmj3dF^ZQ-)&FRfEe=p)tY*EcL>iPG1{(pm-9|ez}-hBJ^ZRW*AuC3SoeSDr=`Iu}P zIGV!OJ%lJ@xwb_O|=)Z*MC< z9Aw|P_QB4cz{PG4pUNM~e;szcV5wBWAB!~+i4{whORszR^@MfvT1D9p7geRQ|{e(LRQxo2jZpTD#;^YGKt8*(ITzRRkp z95^xY!%^`ItEb0Y_swY0F5t?@ed*MaHZ!gyY;xk0M~@C|NIYEe^=ddH2Pfyk?Ca~! z%(Io|=jY%2`pA(Z6DCYZm}6IS>6G0>Q4xuA|8=5RZf}=nQ`qxUjYlG3$Ac9Dvy8r; zZx?v#Y4~r+Ndqnpjsv%Uua~}Ll6y;JsmS$pvD(I<>4ekZ)@JPKR_;vGpjW=ZTqQ>f zel-0odp_CyL(D#g{`q3T5?5NjTogX>BSG`%*8h869ef%coW9Yhhf9C8-&zeVHj$KP zk-H{+5`CedF0U86xkU9@=1)8CLspqaJ#PJSXJ?sa&#Jx57)&fZVke{pdY{CLSOv+ozv?H$1)wieTxdiO8R zzdFmxL6-Z<%wUFaqpiQKrg@xYnk)Az`wy3^_@xDYx&`|G*IgBRoWag%9_Q1MwfLmL zEQ>-V?`b-TA08asl7D~R)6>&GUk#6+YTb}{tVi<948y|~u|>Bq0FjrP8~`tB@?xwfpv_69v2(snY}))?Mta^z5a zCoqdg*?=cW!nUep>NQ_4uSZupZ$GGZ+qlu<%pBM5Ug?J~JuC{Dq)axHggS8)o{oI# zdLnF1#KAS@%OiL7Y?8I%INav=|KE$-yqnQ76>@q(OhHHW1?<)wZQd_UhINMzOa=#4*8ORivxyhmXfEEMk4~?9j!f{;^3QDmyb z-Rk#yZHyE@U3*_~SuNx8v4XxACj={=Ngg(jY87yra$1Z3^4%g=*AJggZz$0`Gdo>k z8)!W4kV;S9wV$62%5*HOr1J8@*Uww3E#%a3yDwC3*=)mPw&ugTum9=u(z`7zmnX4A z!BM3}AT()e;+Ip}>o+|4pY=g+z1P7rGYt}%bmH@NtePwlXVz5V>n>E~zN*}1jy^E1&ndo#0X_pgP1PTcjU=CFokdisyI z=7;w?aVV~8RXfbV6Ccyt(XryvuH*gk>FHOtz0zK$(vfwwX{t7_@^g@hpm08M{(Sn| zTU%9BLjFBF4jMVm-}Bq?t4L5l!j6Y?StbfNU6Jr@o7mpYo_wq)@n93{mdwj-Cnu{f zp0ev}s|KsT4db?LLM~1mfz2kBGuFlJt*ZHWRGi_+@#Df$QeNxh_DWb5rObQ{8X221 zC1uXP$1Z=)iW}ALdf2r5;zg)FNw@3Vkh12;kt0*2-8QG6Hgeh@5|5mN} z!FJ!Z+wym@iR;X*ikpjGhflfG?8omuId9JzRngZA1D5}_;x29D%PnhMs;wCxxA5V_ z80Y=r=BwAuUaBonE_Jp&FfmcFu(0q>`Tg3bde^sP2Jb3+n>FX$nR5@1Y+TH+!^-in zSIyfK?@lPj+^?HBXY1@0*H7*DDh&^r$aije*g8A!6PgWMblzT{IW3jLFTVG_k=948 zD`jlu;@;s&^CsKQ*}sBh6pgIha`)wRRd9XWoy{p;)Nk6*t&{kY#g?wu8=Rhhs4 z@3z9K&*vhP4)JWyE7-vNJxcUWWuBhRFNHnU!rON{ul^;XwPwMIg2eY+*V7%Z7j218 z_p=ib&E9`5#k!#IO5I$iJ6f}34hRSdIkof278DmJ-`bM-=H6au@#)cD1V6QkFUSl& z94gi#;B-f5)*H#ItHb-<0jlQ+mnfwDa@M z-UxKo-X2tD<}-^WzLxdgJ=5SB0!|#8*BJHOt9q?_EvIkY9k2ZTymxmUoSZ{o_Mo#CE<%kFvIDD7FZsZaOs&6e*RJJ4K^^^qTV=-nrN0U#_2G%Z8+|o5oTm z83KNCUw_u!eDq1&rjTh{UMnkio^PTPhvFHK&eqxwj5dF_+}Rk)p{R34tJ+O;(zLW4 zx<@`fp0>_~L-Acj*iGYEmc?qy?O$~37ykdt&&Jcx#+&aO=)|FTDrIV-N#P?GyPvOS ze-i)oO!{y^9%#vN`qacHPoKIn|1YYt*|@RbtyD|<{auS%1e~ULeoov{_BQI*x3}GK z>(}q=)r(|GKGrZd_G@l1hoZ~W%qj+F(72%8PZe?fI2X;(hhO{TY)|#&MxTm%uzY^P z%S%}+0yq?1N-yM`_gH`3xb9CyT;F4FRxVRW@?5Q-qyQ}o@-Me?+ zR2}b=RaR9!YVr4Yps~2!*|V*Ge=jV5KT9K)L(xSvQ?Dl|I5_j#8p+vaxk;Co`9696 zoVjiH_PS3e)l=IpM(6K63a-ObpB+3}QgC;d?EGiB7Smrditg#l^1b|eVFbUrUevBh zpI&|m2w3vhio45!v9fjAx+OK1trOxoRz^-+cf>~D+&f(1oyjcj#Sb1NnC0EcnB(W+ zpJqQOPf-?AD8&W*>OHU$MoP0!`C|tul-vqAm?ZMxiU@A)#}9V zu4P$9>e~e_ZQ2t5{A!N#j^9@{g2wVIc<;=A4 zLzk9%?<{)i<$JBWV`>Q_r_OP`&v8@759LB3k&S_X!%s6qvBWzuar1n#ky1Kof`RfA*9Jb}(kGoqM<`ohma$i6C&-I=!C5Mj&GBfFfgUg7}Oq1BEDl6;q zcPY=$&2@2i-(3Da4l?DusQCH0it6g{^0`wd&6?%)sP%LG*^ch!2MIgtCki-agtQ)h z@#f~{GqX&)U%bfZleg~+;);)t-&Owp-0b{)p5NcyeR*Z2u%DlwX=HvYXfEICD^uj> z)BSCdg@qTEbf$I-IdKFo<7&TnaTMV?(Q<3IB{al@3-4kR8%(9|F4s){Sv4byX(jl&EO9oKQ65P z{!YfaY>is>zJ->>&pw=ZkywA$qBg3^&52`SqIqf0+Pu5FuB;4ZPft&O^X83)mR8dD zcXyX8T^br*8~W+PVgBIb$LBAXt36@x_z-Kxl@p6hITc$pqL&`hP*-n{-CZX6-n8Vw z0md&?wg(R$Y-w%%c*$GeFyn%Plvz$h@Yk@8`Sax!eP{nSeSAuEMfmw5R*>%S*25XM zx8=IHxGcE*l7oXo!Nz9J$;s-Mm;1{zt@`=fdUx5|q;GF-#_T9yjE|28`NyqaE_P|| zO;J(Fcl818kIi?0nk*5mhfiF;KK;D?|2cNGzb#&8T{`2k5{@ZKFa6?>FYTdQmyGDEwY#<7?;e{k zZJOm$P+(A4SSZT3xL4YI(}&mkj2rZ|jKJGJ&R+VXtFkTszMr2TA2S=ziVs%8>V8iy zS8_9M(AJq^Amqf+d-;udSbWt>)w;i5!;OrMBllL7PSrO|i4V~*zak8h&pH3%{{MgG zudl6r{B(M}nvzn}j2SbErk_7?;=!ky!?D*BqYzgTMRdY6TKTwUOr z`^D66ug~bR?3LTZtrOc>`EILDY~zm08D>4}!XqL&+S}cCp1yJGR?_F~g2i4d?b!`j z9<8{@UH005=gZ}+TGcPFzO696FP1aq+v_b`8Lgw=Udvp5Gg<9WRHjjnn0}m(pC6y1 zqT-)_zu)KF*zmCJyGPWn5>4;vdZvE)_awbtBGlh-a~I}3@Mbr>9g0u zm6Z8Eac_-RcL?10?e!Tw2LJF6>vCUuwOnBHt^3Ex#r5dU&SIUI9iU+mJ{gOEhlzLV z)t`e(k>4gajbB|{%x+utWyQ4In_{mI1V5Ia+$!*hZ~4i27tdDx{d)c7_08N2W?uY! zd}8Z7I22tf*BJFI^PhjN|MfP8w#he(b{8tPTrgYBqnw_ee&^0V8{;)oK=GO}C$#P2 z*BtOhpU);8XPGbVr{_3Y+T^8#yXY}miOXFb5isjS#?!D{sz$zDlg zw)t*nZ|ursKEc4I*mA*U^&839^K7X*F0U4F;yAm@_}M$pSk`UC=fGdsa3lPtNWS!yR$CVI&59cN&WqQobK&|KI!nKYmo7 zFRAuKV6K2u#yquZxBBTbW_0xT`?pU2|J?rn$v;Q683RB&rWRJt;$I9}4>o6xjGFJP zkgdEPpsL|n<|l*L&Q@;mPcN6x-;{cKn)J6GE-tPMFH4TS{Ikb~VM+?9aGjTSIOF0X zS5V;!+T!y3dHLa|$NS|$yCBYNxiKM{A=C0|d~&IVUR#oF%#N&=UZ=tr7~5=#OE3HP z_G8sEQKwl=dz8Gxlj3sIA+M+4+r=rG!9RXkA3k9v zc}urN;1;O$_wHR^f4=SE7H|?dyZMxXkt%4uJt}=_V#$jOireyTF*IzN3QCo0H=i=F zDtN#!+iVT%6EPttjza4TPcFQhZCdxILdq-`lmRWh)LR6$GlG((Ke)iJ4U=~>n&ro# zxaGVS|K+o@&HK;q|HCyw+W@q<Qgw{9`rM~{wnv#_y!y5P(oTI+lX6yRqszhP)wv`A@N-d#|IrL{M& zuFme}&Bz8&badQqOgsFdQ+?h7(8Btt?{Bx?e_)YhomY{XU-Ijx_0+2s9t}(CH!tTEL@fy&iL@);MEPH(4s}g_xru-_a7g0I5ylVi{VfN z2ZgYj&x5@?=l`{Yr-vu6UwbD67%+Hk0#z30wGO|iI(6*T{6zvzcfPIpH22q&lar6U zxsy0!!aQ)M3vIi&E%$cB#uPyYuS*~u{+FG1uhud$nl!;|ZYRfUmF*J*oH}kdgnsK; zrygG=>csJO^Dl!*V9oPG<(5Tn$qYR4BpKezT*8#qsVHj#8==aW%TQfgx3 zmAbG#-X1gyDxJS4@Zr~~K`*|x?QZr2C4(*glbI#d{N{KhBq(HGTf?YeZ$IC%_*sa> zgnwVx*MI!?`~CF<(6-N2lhdl*9zJ|{?4|nrnn`o!$b5TuH+tdM`<2gSujSn21iLSf zeHOR!-Z=lnM8(F&#$%Ohqqnmun3-*Jy1ilh_Twj4KCycYPK>3qc$68et*sy1R97Fq zc;wKbLtgp*dF#|$1a2+gS?u=h+qWCHZ%>{vBV!I|Bi{jol-)Xie}7N^{q1do;)SmN zJX`nfE-!eRT>VLVe)4vgjZJ54Zahc=m0}@0m97EDZ(f=@MSnfV7p@pt-B{0`n?4=9 zC^yICyLiTf4F2hp^dE~~>TToQs}tL|gE`}qzoLpti>!5-#Pa=rzeUT)$Z&9TYZuSm zvc=@n=g;0}{k`@$yxLd$MEt79N^@ULjVq0lo0n>9&W~$ccjJTF($u3z+g9h@xP7-E zuv_a=<67MtneT42G%mJHNsVKE{!7U1(X9aL)duOd#qx1O7x*LmoL0E_!%1(OpX-zf7>TIZx) z56TGLFWcf`7HnUtt$81w2Rv^k@yRHk-zRvovp!;%NFn=$6bW8gt110< z$jPlo;^6lCbV=r5@+Y%;SEOFvkSUZbHx#8qwb>qq+(=Qp&^iy@@ z*RwNot*0NCmt%!R?_0^cJrkAP9|i2zJ8x?lw=YcvTK=)Juw2*_D$Ouu2`n#s1+52k z%9tP8c5!F%bBmG>=e^m%+kc-$KD7ibU;TJAeZI6B#IiM;(!bm(KL7E4{xqhd8Gg_# zd3`b?56E?4@@|t{!HmjtpqXTym_0lb4wryR)8%?j611Ojs&@FaS@snl68`-CySg+UvuZ~8@7Kk|ybh_nZF=(F zImY=_ygwg3iu9fyq^F)P{_4udM_yiwmU?T3zr8i@#;scuCr-?I8FcDt==J_Tdvc13 zH|xZ9MY6J1rlh9|+^aX)XZLBYZQy4eA-ApB*VC@72)w%MZ1MAR6X(r~%lbF(#aa^{ zo`YA{mPn}1>py<+q~!fy&#IGmT1LiLh`WEjwlMYG_a6^ySxhrM*G8>NyFFPyZo!TS z_vVIUX}8bMxAd&KCHhC2^>Og}#+#|<=2$t!#@pYqeKjk0|EyU)Vb4sNnrF|>y)G_Z z{NsS$t@3w)&pulSmy77Xud1l1nw@K3`bJ@=$!8M9t1tIoV6_{K5edgznsSB|H2RYYpnygZk4=f+uQ8C^4p=N znn!*zi%Ng5OMUnF%Esm&>@1I?ZvU~nba`EYuI2;jAHQ37X7+#HwNcy6ZvVSjZ>M5x+$@>DCw1H3nah=b zK7BsF;`7^?HvdwV+)S0LN)YL{VY;8=%D}+C9ds_hF9~M0S@Mte<(y1fRPOTe=JfcP zx#!QFTNb)mKuAw*`cIohu=$|X>@i!edqXsI>A4`*KU7VcKvSJ?fPH)&*H>_f3=wx4$QaR$bL5O@%8w+XUFCDr9Uk9KDEYp zORaR>pGr~3-m~==DwB_y?Ai0m=;!?Nvvcq7&({Yzvp0I%%-sKZ7oGlnJ>|_KXEf#N z>N?%ce2S~|SXZR~2-KYNaN?RRX%`o{X1%+!Gc>CF+L}nNfaGI6n#D6OFZW-4Oq@WBDb zsS_s#rd4}+by=0YiP(Aj#=hF!mtKEOyZ!Cm-PH`D0s;Zgeub}#33Tt5(=C@bG&I!G z*I$3;+m9a=QzuLaNUKguTh`UvtGoFxXj5W?lwp#~&QgxR(vz!HnoWK$4R3Ilt6bu? zU0z5iD6jhMt*xBAy1xZvL0jlg=kjwH)ORc~y0s-UIIntd)z=l_>*Hp=Eh{Vg@*?n? zqE*AS)Gu$e9A&;Q)+<6ZJL>f1uMh6fKG6y46gzOMH2`sD&w zU60vvgHDa`{oa#zY=WY*Mg2b;ewz;sOT9I(FY%l#VUTcu*ZyhLE$RF{j#*i+c&mA* zZOgc*G$m-q?%mP5rWk?d;aj=IA3b}P_A=;{sGQunL#^DLJUm-UG#~LTcnPXw6xZC0 zXO;lhSa{E%SS@pF?e*84Jw2fDE|ctQJ^B0pPO~b_``a4y_|c;uACJphmcNs!tE&TT z*D=XR_!neZzdiG^+O_rZ{(gRZz0&4shgvwz{|Kd&-q@JTZfR-x<^BErPN(bt|NZ{v z#zyA3e(tNo)>eGE=w4WAT0eK+E6^sxx<4P?KYjk3d3BX2=uC;jhZo-|<>Ka^X`U~4 zyk8!);bHgteX}nvc2CZZHlBa9#7eeXOgHKOzrPh#RYH=IkqaMQ)YR0h`Fz%Vj%~GA zczF1`-S6$*?R-8@YNcSp<72%ls;Up4Jv(+{qVno3y_?g|Zz_Eqrsgvv;Ox~->)z0B zJ-bR?9y&EuyR)Ms;ru*XliXWZluGw}zgPX@YZV)h#DP|B@fSBXDxW-=8ZZB@s`~r8 zrKPX0@yJ+ASg}Im-QMr_q}E*%03Ap1)(Cd_5S%B%VM@} zFm>+kQ*y`5wB_|ehsj*gCopp`CO zUR;|tZ+1Psv+{GAjBS;OR4-d?Z7l~kw{w2}d)xWtKR=~L=!mU}+RF9s-@k~RMXFlb z+ODS~U4T zRxX(_L!zs%Pj0K7fq?^CbK;%r8v6R`{QUfZpJw`~6%`jRUbSjfp?td8?Bj1AySq%8 zInz@+Y|Vyr8)@UTGYh!I^*FZQy?fXF>!#PQUM-q8Z(d>i^QY6}m*w8x);X#0$nyDh zR`1R)TD-XV*YDrQV{Y#%)m|I9xow&Me7!Imv!{38`I>s zuxa|2FC{urTQ~{}3m0Ge_U2}DLjyyGiImOvJH{nC@EM_`z+26i5_x84h%a^mW^UECx_P1?au;AfG zxxIV$c64_)N3C@W2oSLQ`DC(T{Nrb5XIqrNlTlJqaye}|@7lGnmbSK}r>CZV`26`W zzx|(t&2>LMB)%xIs`>Zx`J^Yw!52bqOSZPQPTakF_t{!SMa3ttUuy?0N|cn8RGEId zmG8cJ-W>&feSNFiUnYWrPoF&t3JIC=p=(^C(fSreX$L6pv;A7y3s9PzkMsawIPvt<<+dH?Rm0azkTbP zWN2+YdtS{a&#KR7%{6Uo=A;-&u8rQ_$HvCi(edIyBlD5~jT1>5CtS^1dbC^o^1Hjc zTc2OQdiCP#_51y}TAPfFjgQ~${1?vF+_-1&-jnz5&ll5)NVv>vtE=n#LgoI|tFFfB z=eE2&7aJ7h)Y;i7A|c_y&L<Y@XeajleRtnUHa_eYh>DKh zn0T1&MTylM`+B*pTepG^IAK_@W(`kVT-=X;zuyN21T-9%ufL-PDhxm-gvZy4R#sNt z*qq+4VcE&Ca^*@6e*WXx>-V-jdzPl6uFhTm|J12d51u?>SsT{<_xJb1XV0Ehd%pR+ zU3W_hi;KIvvZm(AwA@8AeAGh1!w;tzIj+9ywEp_x3=`0(jf9kxQ&N(Wk&%&rjLo+K z$76CwrtF?|?)r6cUteFd@1^DC_cuS?AMxqarw?b%?>~5Qa`K07`|kcepJ8(7;zhyw z|9{OJ9zObfEjpj`H6I^eM^6t6!;vFL4&1&ieY{Wh@T$<&Z)W8`KR0(r)mN<$EzyRD z|G)hH{aa8*rsvtSG>Kj}fr%4}udRtRd#nb^w=tE=gH~=Rc<7XKXGdT~^r^VC^YeJ+ z<>eKZcXxA}Nb$aU{d!~OWwnyh(t}AGIV{EX<8qAqoYW>es!dkZ(&CyoZ=Q#j*CFlo zdy>9uztYmy4vdWK+_ufk!ph2N@kIqKEiPAA*NVrz<`=GBZGHDHPchxesp)J+?}7yi zEUc`FUte8)@%F82Rh3m%R@R$YALHEaG5vi$zy8AY>+B33o}LG{WL^#k4`-k2*M7hL zzpQ-S55=~&wgj`;58u7(+qKJT_y3)n+mBDtc6)t&y?bP&q?MIbi==({x|oCP@-+qz zBl~15oBHj3arE}~nzeFB%#$zq{LDA!?k-WInK^f^7Zw(REVyv_a`N{cO-)S?FE63I z=g*%%o*rK(xa@UXOUr>AGi7Dv2|xfB$}i&F%{W z9M)e~*4BPKZ@p>uHJv-VO1Ybxo6GdwbaizcgED+ zxBObQH}>;getUcS9lLftS~@+>sitPn*;)Jd??3DE^x3mC&{lx@zh9@T$j?s*J`rMV ztfchm)2Brb9wbZ)^6>#b+Z63(EwrrHf>(%Q)i8=kXsodURsc+GWD( zegVnJ%A#UoT-isD9tG7BZ{NP1GG~sDoSat?jNDAp|Rlfbp7D$Y;9E)l?gF=>fJ|`yv%ytoI5)^uUxz4CMqiWV|Wy!ZUk*n6OUE0;frKGg0=qcCKY11YhOjxiv{rse$l}ol}U+Pw6?Zhxp~vGoljONJUski&W9tN!Y0Ybcut)@y?EI&wNL91{#ZQA5=((+MWx*KSb+s_|A0x~l-O-)S$BO@iZZr$4Z^Y5pbg4G58 z)hEZvUzur~zM}1x~MLTv#%$zy1ps46j zm#FrHY17oaj!l>#0BT@ZT3VhsdGg?$oyCDsQC$}<1TY*HPRP#6`tbF7{Nf!uB2oepdW`yWRDqWzxStKMM*9BueXpf`n>nY64y5sBGrb}%zfo^dqEv82SLt*!0D<9_=h#iTci$J5<%4hagH<=yG{{QUglb?f{# zMF#h5JlWhWIJ@BX_Wa}j{{Aj}bHnh&(;~3>jCRIJ!mBoJ6g+S9nWv_lRGzF+5plnABsaW=SxZh}3jP_VCwr-qV{5kKJ&7QFeD{@(#J=9z!+W gy4ii82>8c(!Xo*sm>cg|1_lNOPgg&ebxsLQ0B?xf*Z=?k literal 0 HcmV?d00001 diff --git a/doc/graphs/lambert_w_graph_big_W.svg b/doc/graphs/lambert_w_graph_big_W.svg new file mode 100644 index 000000000..de0a4461f --- /dev/null +++ b/doc/graphs/lambert_w_graph_big_W.svg @@ -0,0 +1,67 @@ + + + + + + + + + + + + + + + + + + + + + + + + + +0 +2e3 +4e3 +6e3 +8e3 +1e4 +0 + +0 +1 +2 +3 +4 +5 +6 +7 +8 +0 +-1 + +W + +z + + + + + + + +W0 branch + +Lambert W function for larger z. + + + diff --git a/doc/html/index.html b/doc/html/index.html index 09f08bfd8..baaa1776f 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: October 31, 2017 at 18:07:04 GMT

        Last revised: November 06, 2017 at 16:58:03 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 374654531..131bba4ad 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -1460,8 +1460,11 @@
        • -

          i

          -
          +

          I

          +

        • ibeta

          diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 633667de3..656aabfd6 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index b8532c651..b871b19c1 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index dedad38b5..14b561dc1 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 15b7b930e..afdd2c4ab 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -4250,8 +4250,11 @@

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 4eb7ed192..53a19cf71 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 644e6fa56..d91e02a8d 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -32,6 +32,14 @@ On the z-interval \[0, [infin]\] there is just one real solution. On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-. The principal branches called `lambert_W0` and `lambert_Wm1` are provided by this real-only implementation. +[import ../../example/lambert_w_graph.cpp] + +In the graphs below, the red line is the W0 branch, and the blue line the W-1 branch. + +[graph lambert_w_graph] + +[graph lambert_w_graph_big_w] + [h5:applications Applications of the Lambert W function] The Lambert W function has a myriad of applications. @@ -106,6 +114,48 @@ and to control what action to take on errors: The full source of these examples is at [@../../example/lambert_w_example.cpp lambert_w_example.cpp] +[h5:diode_resistance Diode Resistance Example] + +[import ../../example/lambert_w_diode_graph.cpp] + +A typical example of a practical application is estimating the current flow +through a diode with series resistance from a paper by Banwell and Jayakumar. + +Having the Lambert_w function available makes it simple to reproduce the plot Fig 2 in their paper +comparing estimates using with Lambert W function and some actual measurements. +The colored curves show the effect of various series resistance on the current +compared to an extrapolated line in grey with no internal (or external) resistance. + +Two formulae relating the diode current and effect of series resistance can be combined, +but yield an otherwise intractable equation relating the current versus voltage +with a varying series resistance. +A generalized equation was found in terms of the Lambert W function: + +Banwell and Jakaumar equation 5 + +[sixemspace][space] I(V) = [mu] V[sub T]/ R [sub S] [dot] W[sub 0](I[sub 0] R[sub S] / ([mu] V[sub T])) + +using these variables + +[lambert_w_diode_graph_1] + +can be rendered in C++ + +[lambert_w_diode_graph_2] + +to reproduce their Fig 2: + +[graph diode_iv_plot] + +The plotted points for no external series resistance +(derived from their published plot as the raw data are not publicly available) +are used to extrapolate back to estimate the intrinsic emitter resistance as 0.3 ohm. +Its effect is visible when the straight line from low voltages starts to curve. + +See [@../../example/lambert_w_diode_graph.cpp lambert_w_diode_graph.cpp] +for details of the calculation. + + [h4:precision Controlling the compromise between Precision and Speed] The compromise between precision and speed can be controlled using __precision_policy. @@ -235,6 +285,8 @@ A domain_error exception is thrown. (This behaviour might be changed to return [h4:implementation Implementation] +['First be right, then be fast.] + There are many previous implementations with increasing accuracy and speed. See references below. For most of the range of ['z] arguments, some initial approximation is followed by a single refinement, @@ -609,6 +661,10 @@ Gaussian Noise With Exponent 1/2, IEEE Transactions on Signal Processing, 50(9) # Toshio Fukushima, Precise and fast computation of Lambert W-functions without transcendental function evaluations, Journal of Computational and Applied Mathematics, 244 (2013) 77-89. +# T.C. Banwell and A. Jayakumar, Electronic Letter, Feb 2000, 36(4), pages 291-2. +Exact analytical solution for current flow through diode with series resistance. +[@http://dx.doi.org/10.1049/el:20000301] + [endsect] [/section:lambert_w Lambert W function] [/ diff --git a/example/lambert_w_diode_graph.cpp b/example/lambert_w_diode_graph.cpp index 84ba6f6b8..d28482b08 100644 --- a/example/lambert_w_diode_graph.cpp +++ b/example/lambert_w_diode_graph.cpp @@ -5,12 +5,12 @@ // (See accompanying file LICENSE_1_0.txt or // copy at http ://www.boost.org/LICENSE_1_0.txt). -/*! \brief Graph showing use of Lambert W function to compute current +/*! \brief Graph showing use of Lambert W function to compute current through a diode-connected transistor with preset series resistance. \details T. C. Banwell and A. Jayakumar, Exact analytical solution of current flow through diode with series resistance, -Electron Letters, 36(4):291-2 (2000) +Electron Letters, 36(4):291-2 (2000). DOI: dx.doi.org/10.1049/el:20000301 The current through a diode connected NPN bipolar junction transistor (BJT) @@ -28,14 +28,12 @@ http://www3.imperial.ac.uk/pls/portallive/docs/1/7292572.PDF */ #include -using boost::math::lambert_w; +using boost::math::lambert_w0; #include using boost::math::isfinite; - #include using namespace boost::svg; - #include // using std::cout; // using std::endl; @@ -52,38 +50,34 @@ using std::map; using std::multiset; #include using std::numeric_limits; - -#include - using boost::math::isfinite; - +#include // /*! Compute thermal voltage as a function of temperature, about 25 mV at room temperature. https://en.wikipedia.org/wiki/Boltzmann_constant#Role_in_semiconductor_physics:_the_thermal_voltage -\param temperature Temperature (degrees centigrade). +\param temperature Temperature (degrees Celsius). */ const double v_thermal(double temperature) { - constexpr const double boltzmann_k = 1.38e-23; // joules/kelvin. - const double charge_q = 1.6021766208e-19; // Charge of an electron (columb). + BOOST_CONSTEXPR const double boltzmann_k = 1.38e-23; // joules/kelvin. + BOOST_CONSTEXPR double charge_q = 1.6021766208e-19; // Charge of an electron (columb). double temp = +273; // Degrees C to K. return boltzmann_k * temp / charge_q; } // v_thermal /*! - Banwell & Jayakumar, equation 2 + Banwell & Jayakumar, equation 2, page 291. */ double i(double isat, double vd, double vt, double nu) { double i = isat * (exp(vd / (nu * vt)) - 1); return i; -} // +} // /*! - - Banwell & Jayakumar, Equation 4. + Banwell & Jayakumar, Equation 4, page 291. i current flow = isat v voltage source. isat reverse saturation current in equation 4. @@ -102,8 +96,9 @@ double i(double isat, double vd, double vt, double nu) \param nu Ideality factor (default = unity). \returns I amp as function of V volt. - */ + +//[lambert_w_diode_graph_2 double iv(double v, double vt, double rsat, double re, double isat, double nu = 1.) { // V thermal 0.0257025 = 25 mV @@ -122,12 +117,14 @@ double iv(double v, double vt, double rsat, double re, double isat, double nu = double e = exp(eterm); // std::cout << "exp(eterm) = " << e << std::endl; - double w0 = lambert_w(x * e); + double w0 = lambert_w0(x * e); // std::cout << "w0 = " << w0 << std::endl; return i * w0 - isat; - } // double iv +//] [\lambert_w_diode_graph_2] + + std::array rss = { 0., 2.18, 10., 51., 249 }; // series resistance (ohm). std::array vds = { 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9 }; // Diode voltage. std::array lni = { -19.65, -15.75, -11.86, -7.97, -4.08, -0.0195, 3.6 }; // ln(current). @@ -138,8 +135,7 @@ int main() { std::cout << "Lambert W diode current example." << std::endl; - //[lambert_w_diode_graph_1 - +//[lambert_w_diode_graph_1 double nu = 1.0; // Assumed ideal. double vt = v_thermal(25); // v thermal, Shockley equation, expect about 25 mV at room temperature. double boltzmann_k = 1.38e-23; // joules/kelvin @@ -150,50 +146,49 @@ int main() double rsat = 0.; double isat = 25.e-15; // 25 fA; std::cout << "Isat = " << isat << std::endl; - double re = 0.3; // Estimated from slope of straight section of graph (equation 6). - double v = 0.9; double icalc = iv(v, vt, 249., re, isat); - std::cout << "voltage = " << v << ", current = " << icalc << ", " << log(icalc) << std::endl; // voltage = 0.9, current = 0.00108485, -6.82631 +//] [/lambert_w_diode_graph_1] - //] [/lambert_w_diode_graph_1] + // Plot a few measured data points. + std::map zero_data; // Extrapolated from slope of measurements with no external resistor. + zero_data[0.3] = -19.65; + zero_data[0.4] = -15.75; + zero_data[0.5] = -11.86; + zero_data[0.6] = -7.97; + zero_data[0.7] = -4.08; + zero_data[0.8] = -0.0195; + zero_data[0.9] = 3.9; - - // plot a few measured data points. - std::map zero_data; // rss[0] // Zero series resistor. - - //zero_data[0.3] = -19.65; - //zero_data[0.4] = -15.75; - //zero_data[0.5] = -11.86; - //zero_data[0.6] = -7.97; - //zero_data[0.7] = -4.08; - //zero_data[0.8] = -0.0195; - //zero_data[0.9] = 3.9; + std::map measured_zero_data; // No external series resistor. + measured_zero_data[0.3] = -19.65; + measured_zero_data[0.4] = -15.75; + measured_zero_data[0.5] = -11.86; + measured_zero_data[0.6] = -7.97; + measured_zero_data[0.7] = -4.2; + measured_zero_data[0.72] = -3.5; + measured_zero_data[0.74] = -2.8; + measured_zero_data[0.76] = -2.3; + measured_zero_data[0.78] = -2.0; + // Measured from Fig 2 as raw data not available. double step = 0.1; - for (int i = 0; i < vds.size(); i++) { zero_data[vds[i]] = lni[i]; std::cout << lni[i] << " " << vds[i] << std::endl; } - - /* - */ - step = 0.01; + step = 0.01; std::map data_2; - for (double v = 0.3; v < 1.; v += step) { double current = iv(v, vt, 2., re, isat); data_2[v] = log(current); - - // std::cout << "v " << v << ", current = " << current << " log current = " << log(current) << std::endl; + // std::cout << "v " << v << ", current = " << current << " log current = " << log(current) << std::endl; } - std::map data_10; for (double v = 0.3; v < 1.; v += step) { @@ -208,8 +203,6 @@ int main() data_51[v] = log(current); // std::cout << "v " << v << ", current = " << current << " log current = " << log(current) << std::endl; } - - std::map data_249; for (double v = 0.3; v < 1.; v += step) { @@ -225,7 +218,7 @@ int main() .y_size(300) .legend_on(true) .x_label("voltage (V)") - .y_label("log(current)") + .y_label("log(current) (A)") //.x_label_on(true) //.y_label_on(true) //.xy_values_on(false) @@ -247,15 +240,15 @@ int main() //.background_border_color(black); ; - data_plot.plot(zero_data, "Rs=0").fill_color(black).shape(square).size(3).line_on(true).line_width(1); - data_plot.plot(data_2, "Rs=2").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); - data_plot.plot(data_10, "Rs=10").line_color(purple).shape(none).line_on(true).bezier_on(false).line_width(1); - data_plot.plot(data_51, "Rs=51").line_color(green).shape(none).line_on(true).line_width(1); - data_plot.plot(data_249, "Rs=249").line_color(red).shape(none).line_on(true).line_width(0.5); - data_plot.write("./diode_IV_plot"); + data_plot.plot(zero_data, "I0(V)").fill_color(lightgray).shape(none).size(3).line_on(true).line_width(0.5); + data_plot.plot(measured_zero_data, "Rs=0 Ω").fill_color(lightgray).shape(square).size(3).line_on(true).line_width(0.5); + data_plot.plot(data_2, "Rs=2 Ω").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.plot(data_10, "Rs=10 Ω").line_color(purple).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.plot(data_51, "Rs=51 Ω").line_color(green).shape(none).line_on(true).line_width(1); + data_plot.plot(data_249, "Rs=249 Ω").line_color(red).shape(none).line_on(true).line_width(1); + data_plot.write("./diode_iv_plot"); // bezier_on(true); - } catch (std::exception& ex) { @@ -269,7 +262,17 @@ int main() //[lambert_w_output_1 Output: - + Lambert W diode current example. + V thermal 0.0257025 + Isat = 2.5e-14 + voltage = 0.9, current = 0.00108485, -6.82631 + -19.65 0.3 + -15.75 0.4 + -11.86 0.5 + -7.97 0.6 + -4.08 0.7 + -0.0195 0.8 + 3.6 0.9 //] [/lambert_w_output_1] */ diff --git a/example/lambert_w_graph.cpp b/example/lambert_w_graph.cpp new file mode 100644 index 000000000..2735e08bf --- /dev/null +++ b/example/lambert_w_graph.cpp @@ -0,0 +1,174 @@ +// Copyright Paul A. Bristow 2017 +// Copyright John Z. Maddock 2017 + +// 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). + +/*! \brief Graph showing use of Lambert W function. + +\details + +*/ + +#include +using boost::math::lambert_w0; +using boost::math::lambert_wm1; +#include +using boost::math::isfinite; +#include +using namespace boost::svg; + +#include +// using std::cout; +// using std::endl; +#include +#include +#include +#include +#include +#include +using std::pair; +#include +using std::map; +#include +using std::multiset; +#include +using std::numeric_limits; +#include // + + + /*! + */ +int main() +{ + try + { + std::cout << "Lambert W graph example." << std::endl; + +//[lambert_w_graph_1 +//] [/lambert_w_graph_1] + + std::map w0s; // Lambert W0 branch values. + std::map wm1s; // Lambert W-1 branch values. + std::map w0s_big; // Lambert W0 branch values for large z and W. + std::map wm1s_big; // Lambert W-1 branch values for small z and large -W. + + int count = 0; + for (double z = -0.3678794411714423215955237701614608727; z < 2.8; z += 0.01) + { + double w0 = lambert_w0(z); + w0s[z] = w0; + count++; + } + std::cout << "points " << count << std::endl; + + count = 0; + for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001) + { + double wm1 = lambert_wm1(z); + wm1s[z] = wm1; + count++; + } + std::cout << "points " << count << std::endl; + + + svg_2d_plot data_plot; + svg_2d_plot data_plot2; + + data_plot.title("Lambert W function.") + .x_size(400) + .y_size(300) + .legend_on(true) + .x_label("z") + .y_label("W") + //.x_label_on(true) + //.y_label_on(true) + //.xy_values_on(false) + .x_range(-1, 3.) + .y_range(-4., +1.) + .x_major_interval(1.) + .y_major_interval(1.) + .x_major_grid_on(true) + .y_major_grid_on(true) + //.x_values_on(true) + //.y_values_on(true) + .y_values_rotation(horizontal) + //.plot_window_on(true) + .x_values_precision(3) + .y_values_precision(3) + .coord_precision(4) // Needed to avoid stepping on curves. + .copyright_holder("Paul A. Bristow") + .copyright_date("2017") + //.background_border_color(black); + ; + + + + // bigger W + for (double z = -0.3678794411714423215955237701614608727; z < 10000.; z += 50.) + { + double w0 = lambert_w0(z); + w0s_big[z] = w0; + count++; + } + std::cout << "points " << count << std::endl; + + count = 0; + for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001) + { + double wm1 = lambert_wm1(z); + wm1s_big[z] = wm1; + count++; + } + std::cout << "points " << count << std::endl; + + data_plot.plot(w0s, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.plot(wm1s, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.write("./lambert_w_graph"); + + data_plot2.title("Lambert W function for larger z.") + .x_size(400) + .y_size(300) + .legend_on(true) + .x_label("z") + .y_label("W") + //.x_label_on(true) + //.y_label_on(true) + //.xy_values_on(false) + .x_range(-1, 10000.) + .y_range(-1., +8.) + .x_major_interval(2000.) + .y_major_interval(1.) + .x_major_grid_on(true) + .y_major_grid_on(true) + //.x_values_on(true) + //.y_values_on(true) + .y_values_rotation(horizontal) + //.plot_window_on(true) + .x_values_precision(3) + .y_values_precision(3) + .coord_precision(4) // Needed to avoid stepping on curves. + .copyright_holder("Paul A. Bristow") + .copyright_date("2017") + //.background_border_color(black); + ; + + data_plot2.plot(w0s_big, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1); + //data_plot2.plot(wm1s_big, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot2.write("./lambert_w_graph_big_W"); + + // bezier_on(true); // ??? + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} // int main() + + /* + + //[lambert_w_graph_1_output + + //] [/lambert_w_graph_1_output] + */ diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index a8fef9a86..e60f2e5d1 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -1650,9 +1650,9 @@ namespace math jmax = 10; } // Bracketing, Fukushima section 2.3, page 82: - // (Avoid using exponential function for speed). - // Only use lookup_t precision, default double, for bisection (for speed). - // Use Halley refinement for higher precisions. + // (Avoiding using exponential function for speed). + // Only use @c lookup_t precision, default double, for bisection (again for speed), + // and use later Halley refinement for higher precisions. using lambert_w_lookup::halves; using lambert_w_lookup::sqrtwm1s; lookup_t w = -static_cast(n); // Equation 25, @@ -1673,7 +1673,7 @@ namespace math // so just return the nearest bisection. // (Might make this test depend on size of T?) #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION - std::cout << "Bisection estimate = " << w << " " << y << std::endl; + std::cout << "Bisection estimates = " << w << " " << y << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION return static_cast(w); // Bisection only. } diff --git a/include/boost/math/special_functions/lambert_w_lookup_table.ipp b/include/boost/math/special_functions/lambert_w_lookup_table.ipp index 44c6171d9..c2fbb8b3c 100644 --- a/include/boost/math/special_functions/lambert_w_lookup_table.ipp +++ b/include/boost/math/special_functions/lambert_w_lookup_table.ipp @@ -6,7 +6,7 @@ // C++ floating-point type is provided by lambert_w.hpp typedef. // For example: typedef lookup_t double; (or float or long double) -// Written by i:\modular-boost\libs\math\test\lambert_w_lookup_table_generator.cpp Thu Nov 2 17:38:42 2017 +// Written by I:\modular-boost\libs\math\test\lambert_w_lookup_table_generator.cpp Fri Nov 3 11:56:21 2017 // Copyright Paul A. Bristow 2017. // Distributed under the Boost Software License, Version 1.0. @@ -42,8 +42,8 @@ BOOST_STATIC_CONSTEXPR lookup_t sqrtwm1s[noof_sqrts] = 1.648721270700128146848650787814163572L, 1.284025416687741484073420568062436458L, 1.133148453066826316829007227811793873L, 1.064494458917859429563390594642889673L, 1.031743407499102670938747815281507144L, 1.015747708586685747458535072082351749L, 1.007843097206447977693453559760123579L, 1.003913889338347573443609603903460282L, 1.001955033591002812046518898047477216L, 1.000977039492416535242845292611606506L, 1.000488400478694473126173623807163354L, 1.000244170429747854937005233924135774L }; // sqrtwm1s -BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0es] = -{ // Fukushima e powers array e[1] = 2.718, 1. ... e[64] = 4.3596100000630809736231248158884615452e-28. +BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0zs] = +{ // Fukushima e powers array e[0] = 2.718, 1., e[2] = e^-1 = 0.135, e[3] = e^-2 = 0.133 ... e[64] = 4.3596100000630809736231248158884615452e-28. 2.7182818284590452353602874713526624978e+00L, 1.0000000000000000000000000000000000000e+00L, 3.6787944117144232159552377016146086745e-01L, 1.3533528323661269189399949497248440341e-01L, 4.9787068367863942979342415650061776632e-02L, 1.8315638888734180293718021273241242212e-02L, 6.7379469990854670966360484231484242488e-03L, 2.4787521766663584230451674308166678915e-03L, 9.1188196555451620800313608440928262647e-04L, @@ -61,7 +61,7 @@ BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0es] = 2.6102790696677048047026953153318648093e-23L, 9.6026800545086760302307696700074909076e-24L, 3.5326285722008070297353928101772088374e-24L, 1.2995814250075030736007134060714855303e-24L, 4.7808928838854690812771770423179628939e-25L, 1.7587922024243116489558751288034363178e-25L, 6.4702349256454603261540395529264893765e-26L, 2.3802664086944006058943245888024963309e-26L, 8.7565107626965203384887328007391660366e-27L, 3.2213402859925160890012477758489437534e-27L, 1.1850648642339810062850307390972809891e-27L, 4.3596100000630809736231248158884596428e-28L, - 1.6038108905486378529760870341423353810e-28L + }; // w0es BOOST_STATIC_CONSTEXPR lookup_t w0zs[noof_w0zs] = @@ -87,7 +87,7 @@ BOOST_STATIC_CONSTEXPR lookup_t w0zs[noof_w0zs] = }; // w0zs BOOST_STATIC_CONSTEXPR lookup_t wm1es[noof_wm1es] = -{ // Fukushima e array e[1] = e[1] = 2.718 ... e[64] = 4.60718e+28. +{ // Fukushima e array e[0] = e^1 = 2.718, e[1] = e^2 = 7.39 ... e[64] = 4.60718e+28. 2.7182818284590452353602874713526624978e+00L, 7.3890560989306502272304274605750078132e+00L, 2.0085536923187667740928529654581717897e+01L, 5.4598150033144239078110261202860878403e+01L, 1.4841315910257660342111558004055227962e+02L, 4.0342879349273512260838718054338827961e+02L, 1.0966331584284585992637202382881214324e+03L, 2.9809579870417282747435920994528886738e+03L, 8.1030839275753840077099966894327599650e+03L, diff --git a/test/lambert_w_lookup_table_generator.cpp b/test/lambert_w_lookup_table_generator.cpp index 93816905a..0961b3376 100644 --- a/test/lambert_w_lookup_table_generator.cpp +++ b/test/lambert_w_lookup_table_generator.cpp @@ -170,10 +170,10 @@ int main() fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = " << noof_sqrts << ";" << std::endl; fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_halves = " << noof_halves << ";" << std::endl; // Common to both branches. - BOOST_STATIC_CONSTEXPR std::size_t noof_w0zs = 65; // F[k] 0 <= k <= 64. - BOOST_STATIC_CONSTEXPR std::size_t noof_w0es = 66; // f[0] = F[0], f[64] = F[64] - BOOST_STATIC_CONSTEXPR std::size_t noof_wm1zs = 64; // G[k] 1 <= k <= 64. (W-1 = 0 would be z = -infinity, so not stored in array) - BOOST_STATIC_CONSTEXPR std::size_t noof_wm1es = 64; // g[0] == G[1], g[63] = G64] + BOOST_STATIC_CONSTEXPR std::size_t noof_w0zs = 65; // F[k] 0 <= k <= 64. f[0] = F[0], f[64] = F[64] + BOOST_STATIC_CONSTEXPR std::size_t noof_w0es = 66; // noof_w0zs +1 for gratuitous extra power. + BOOST_STATIC_CONSTEXPR std::size_t noof_wm1zs = 64; // G[k] 1 <= k <= 64. (W-1 = 0 would be z = -infinity, so not stored in array) g[0] == G[1], g[63] = G[64] + BOOST_STATIC_CONSTEXPR std::size_t noof_wm1es = 64; // fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_w0es = " << noof_w0zs << ";" << std::endl; fout << "BOOST_STATIC_CONSTEXPR std::size_t noof_w0zs = " << noof_w0zs << ";" << std::endl; @@ -194,15 +194,15 @@ int main() using boost::math::constants::e; using boost::math::constants::exp_minus_one; - { // F[k] and e^W for W0 branch. + { // z values for integral W F[k] and powers for W0 branch. table_lookup_t ej = 1; // - w0es[0] = e(); // e = 2.7182 // exp(-1) - 1/e exp_minus_one = 0.36787944. - w0es[1] = 1; // e - w0zs[0] = 0; // F[0] for W0 branch. - for (int j = 1, jj = 2; jj != noof_w0zs + 1; ++jj) + w0es[0] = e(); // e = 2.7182 exp(-1) - 1/e exp_minus_one = 0.36787944. + w0es[1] = 1; // e^0 + w0zs[0] = 0; // F[0] = 0 or W0 branch. + for (int j = 1, jj = 2; jj != noof_w0es; ++jj) { w0es[jj] = w0es[j] * exp_minus_one(); // previous * 0.36787944. - ej *= e(); // 2.7182 + ej *= e(); // * 2.7182 w0zs[j] = j * ej; // For W0 branch. j = jj; // Previous. } // for @@ -224,7 +224,7 @@ int main() // = 63.99999999999999999999999999999999547 // = 64.0 to 34 decimal digits, so exact. :-) - { // G[k] and e^-k for W-1 branch. + { // z values for integral powers G[k] and e^-k for W-1 branch. // Fukushima indexing of G (k-1) differs by 1 from(k). // G[0] = -infinity, so his first item in array g[0] is -0.3678 which is G[1] // and last is g[63] = G[64] = 1.026e-26 @@ -299,8 +299,8 @@ int main() sqrtwm1s[j+1] = sqrt(sqrtwm1s[j]); // Sqrt of previous element. sqrt(1/e), sqrt(sqrt(1/e)) ... } // for j - - // Output values as C++ arrays, as static and constexpr as possible. + // Output values as C++ arrays, + // using BOOST_STATIC_CONSTEXPR as static and constexpr as possible for platform. fout << std::noshowpoint; // Do show NOT trailing zeros for halves and sqrts values. fout << @@ -360,9 +360,10 @@ int main() // Two W0 arrays fout << // W0 e values. - "\n" "BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0es] = " // - "\n" "{ // Fukushima e powers array e[1] = 2.718, 1. ... e[64] = 4.3596100000630809736231248158884615452e-28." << "\n "; - for (int i = 0; i != noof_w0es; i++) + // Fukushima code generates an extra unused power, but it is not output by using noof_w0zs instead of noof_w0es. + "\n" "BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0zs] = " // + "\n" "{ // Fukushima e powers array e[0] = 2.718, 1., e[2] = e^-1 = 0.135, e[3] = e^-2 = 0.133 ... e[64] = 4.3596100000630809736231248158884615452e-28." << "\n "; + for (int i = 0; i != noof_w0zs; i++) { fout << w0es[i] << 'L'; if (i != noof_w0es - 1) @@ -397,7 +398,7 @@ int main() fout << // W-1 e values. "\n" "BOOST_STATIC_CONSTEXPR lookup_t wm1es[noof_wm1es] = " // - "\n" "{ // Fukushima e array e[1] = e[1] = 2.718 ... e[64] = 4.60718e+28." << "\n "; + "\n" "{ // Fukushima e array e[0] = e^1 = 2.718, e[1] = e^2 = 7.39 ... e[64] = 4.60718e+28." << "\n "; for (int i = 0; i != noof_wm1es; i++) { fout << wm1es[i] << 'L'; From 6aa9f286ff6db8723fbc70bbe3059e1236d6d2bd Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 16 Nov 2017 17:58:59 +0000 Subject: [PATCH 22/71] Tests OK, including multiprecision. --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 2 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 2 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/html4_symbols.qbk | 7 +- doc/sf/lambert_w.qbk | 281 +++++++---- example/lambert_w_diode.cpp | 31 +- example/lambert_w_precision_example.cpp | 22 +- example/lambert_w_simple_examples.cpp | 49 +- .../math/special_functions/lambert_w.hpp | 467 +++++++----------- test/test_lambert_w.cpp | 160 +++--- test/test_lambert_w0_precision_high.cpp | 2 +- test/test_lambert_w0_precision_low.cpp | 2 +- 17 files changed, 494 insertions(+), 543 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index baaa1776f..ead0f0445 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: November 06, 2017 at 16:58:03 GMT

        Last revised: November 13, 2017 at 15:16:30 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 131bba4ad..e5556e7ba 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 656aabfd6..6318b09f4 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index b871b19c1..04b5fff61 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 14b561dc1..6320b126c 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index afdd2c4ab..571518615 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index 1e001c814..cf170ede0 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 53a19cf71..b83c15ba1 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html4_symbols.qbk b/doc/html4_symbols.qbk index ce69fecc2..3c0ae907b 100644 --- a/doc/html4_symbols.qbk +++ b/doc/html4_symbols.qbk @@ -9,6 +9,7 @@ [/ See also Latin-1 aka Western (ISO-8859-1) in latin1_symbols.qbk] [/ http://www.htmlhelp.com/reference/html40/entities/latin1.html] [/Unicode Latin extended http://www.unicode.org/charts/U0080.pdf] +[/https://en.wikipedia.org/wiki/Template:Unicode_chart_Arrows chart arrows] [/ Also some miscellaneous math characters added to this list - see the end.] [/ For others see also math_toolkit.symbols.qbk] @@ -117,7 +118,8 @@ [template int[]'''∫'''] [/ ? integral] [template there4[]'''∴'''] [/ ? therefore] [template sim[]'''∼'''] [/ ~ tilde operator = varies with = similar to] -[template cong[]'''≅'''] [/ ? approximately equal to] +[template simeq[]'''≃'''] [/ ~_asymptotic equality] +[template cong[]'''≅'''] [/ =~ approximately equal to] [template approx[]'''≈'''] [/ ? ~~ very approximately equal to] [template asymp[]'''≈'''] [/ ˜ almost equal to = asymptotic to] [template ne[]'''≠'''] [/ ? not equal to] @@ -149,6 +151,9 @@ [template rchev[]'''⟩'''] [/ right chevron] [template rflat[]'''⟮'''] [/ right flat bracket Misc Math Symbol A] [template lflat[]'''⟮'''] [/ left flat bracket] +[template mapsto[]'''↦'''] [/ function maps to https://en.wikipedia.org/wiki/Maplet ] + [template obelus[]'''÷'''] [/ division dot over and under dash divide symbol] + [/ U2000.pdf punctuation] [template endash[]'''–'''] [/ em width dash] [template emdash[]'''—'''] [/ en width dash] diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index d91e02a8d..8724afa34 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -4,9 +4,9 @@ `` #include - `` - namespace boost { namespace math { + + namespace boost { namespace math { template ``__sf_result`` lambert_w0(T z); // W0 branch, default precision. @@ -23,14 +23,15 @@ } // namespace boost } // namespace math + [h4:description Description] -The __Lambert_W is the solution of the equation W[dot]e[super W] = z. -It is also called the Omega function, the inverse function of f(W) = W e[super W]. +The __Lambert_W is the solution of the equation ['W[dot]e[super W] = z]. +It is also called the Omega function, the inverse function of ['f(W) = W e[super W]]. On the z-interval \[0, [infin]\] there is just one real solution. On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-. -The principal branches called `lambert_W0` and `lambert_Wm1` are provided by this real-only implementation. +Two principal branches functions called `lambert_W0` and `lambert_Wm1` are provided by this real-only implementation. [import ../../example/lambert_w_graph.cpp] @@ -40,79 +41,92 @@ In the graphs below, the red line is the W0 branch, and the blue line the W-1 br [graph lambert_w_graph_big_w] -[h5:applications Applications of the Lambert W function] +There is a singularity where the branches meet at argument [^z = -1/e] and [^W = -1 = -0.367879]. -The Lambert W function has a myriad of applications. -Corless et al. provide a comprehensive description of the range of applications, -from the mathematical like interated exponentiation and asymptoptic roots of trinomials, -the range of a jet plane, enzyme kinetics, water movement in soil, -epidemics, and diode current (an example replicated [@../../example/lambert_w_diode.cpp here]). -Since the publication of their landmark paper, there have been many more applications, and -also many new implementations of the function, upon which this implementation builds. - -The function is described in Wolfram Mathworld as -[@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function]]. -The principal value of the Lambert W-function is implemented in the Wolfram Language as ['ProductLog\[z\]]. - -__WolframAlpha has provided some reference values for testing. - -For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651... - -Also the [@https://www.wolframalpha.com Wolfram language] command: [^N\[ProductLog\[-1\], 50\]] - -produces the same output to 50 decimal digit precision. - -The two real branches W0 and W-1 (not complex) are computed with the functions `lambert_w0` and `lambert_wm2` -from the first [^z] argument. +This implementation computes the two real branches W0 and W-1 (not complex) +with the functions `lambert_w0` and `lambert_wm2` from the first [^z] argument. The final __Policy argument is optional and can be used to control the behaviour of the function: -how it handles errors, what level of precision is wanted, etc. +how it handles errors and what level of precision can be traded for speed. By default, the best possible precision is computed. Refer to __policy_section for more details and see examples below. -The symbolic algebra program __Maple also computes Lambert W to an arbitrary precision. +[h5:applications Applications of the Lambert W function] + +The Lambert W function has a myriad of applications. +Corless et al. provide a comprehensive description of the range of applications, +from the mathematical, like interated exponentiation and asymptotic roots of trinomials, +to the real-world such as the range of a jet plane, enzyme kinetics, water movement in soil, +epidemics, and diode current (an example replicated [@../../example/lambert_w_diode.cpp here]). +Since the publication of their landmark paper, there have been many more applications, and +also many new implementations of the function, upon which this implementation builds. [h4:examples Examples] [import ../../example/lambert_w_simple_examples.cpp] -You will need the following include and `using` statements: +You will usually need the following include and `using` statements: + [lambert_w_simple_examples_includes] Some examples follow: [lambert_w_simple_examples_0] +Other floating-point types can be used too, here float. +It is convenient to use function `show_value` +to display all potentially significant decimal digits +for the type. + [lambert_w_simple_examples_1] +Example of an integer argument to lambert_w, +showing that an integer is correctly promoted to a `double`. + [lambert_w_simple_examples_2] +Using multiprecision types to get much higher precision is painless. + [lambert_w_simple_examples_3] [warning When using multiprecision, take great care not to construct or assign non-integers from `double` silently losing precision.] +Using multiprecision types to get multiprecision precision wrong! + [lambert_w_simple_examples_4] Note the spurious non-zero decimal digits appearing after digit 17 in the argument 0.9000000000000000...! -See the correct result constructing from a decimal digit string: +See the correct result constructing from a decimal digit string "0.9": + [lambert_w_simple_examples_4a] -Note the expected zeros for all places up to 50, and the correct result. + +Note the expected zeros for all places up to 50, and the correct result! + +(It is just as easy to compute much higher precisions, +at least to thousands of decimal digits, but not shown here for brevity. +See [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] +). Policies can be used to control precision (a little less precision gives a significant speedup): + [lambert_w_simple_examples_precision_policies] and to control what action to take on errors: + [lambert_w_simple_examples_error_policies] [tip Always use [^try'n'catch] blocks to ensure you get an error message like this:] [lambert_w_simple_examples_error_message_1] +Show error reporting if pass a value to `lambert_w0` that is out of range, +and probably was meant to be passed to `lambert_m1` instead. + [lambert_w_simple_examples_out_of_range] -The full source of these examples is at [@../../example/lambert_w_example.cpp lambert_w_example.cpp] +The full source of these examples is at [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] [h5:diode_resistance Diode Resistance Example] @@ -128,8 +142,8 @@ compared to an extrapolated line in grey with no internal (or external) resistan Two formulae relating the diode current and effect of series resistance can be combined, but yield an otherwise intractable equation relating the current versus voltage -with a varying series resistance. -A generalized equation was found in terms of the Lambert W function: +with a varying series resistance, but was reformulated as a +generalized equation in terms of the Lambert W function: Banwell and Jakaumar equation 5 @@ -152,15 +166,31 @@ The plotted points for no external series resistance are used to extrapolate back to estimate the intrinsic emitter resistance as 0.3 ohm. Its effect is visible when the straight line from low voltages starts to curve. -See [@../../example/lambert_w_diode_graph.cpp lambert_w_diode_graph.cpp] +See [@../../example/lambert_w_diode.cpp lambert_w_diode.cpp] and +[@../../example/lambert_w_diode_graph.cpp lambert_w_diode_graph.cpp] for details of the calculation. +[h5:implementations Existing implementations] + +The function is described in Wolfram Mathworld as = +[@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function]]. +The principal value of the Lambert W-function is implemented in the Wolfram Language as ['ProductLog\[z\]]. + +__WolframAlpha has provided some reference values for testing. + +For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651... + +Also the [@https://www.wolframalpha.com Wolfram language] command: [^N\[ProductLog\[-1\], 50\]] + +produces the same output to 50 decimal digit precision. + +The symbolic algebra program __Maple also computes Lambert W to an arbitrary precision. [h4:precision Controlling the compromise between Precision and Speed] The compromise between precision and speed can be controlled using __precision_policy. -Using the default policy, all the functions usually return values within two __ulp +Using the default policy, all the functions usually return values within a few __ulp for the floating-point type, except for very small arguments very near zero, and for arguments very close to the singularity at the branch point. @@ -188,63 +218,70 @@ but may be slightly more intuitive than specifying precision in bits. [import ../../example/lambert_w_precision_example.cpp] -To show the various stages the example below shows evaluation of Lambert W at varying precisions +To show the various stages the example below shows `float` evaluation of Lambert W at varying precisions specified using a policy with `digits10` increasing from 1 to 9. -For float this covers the full precision range as `max_digits10 = 9`. +For float, this covers the full precision range as `max_digits10 = 9`. [lambert_w_precision_1] + +The output for ['z = 1.F] is: + [lambert_w_precision_output_1] -If the policy precision is specified using `digits2`, one can see the small improvement from Halley at 22 bits: +showing no improvement from the Halley refinement, but for ['z = 10.F] +needs Halley refinement to get the last bit or two correct. + +[lambert_w_precision_output_1a] + +For `float`, the full code for all possible 23 `digits2` precisions is too long to show here, +but if the policy precision is specified using `digits2` (= 23 for 32-bit `float` type), +one can see the small improvement from Halley at 22 bits: std::cout << lambert_w0(z, policy >()) ... Lambert W (10.0000000, digits2<21>) = 1.74552798 << Schroeder. Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley. -For `double`, `max_digits10 == 17` and `digits == 53`, so the table is too long to here. +For `double`, `max_digits10 == 17` and `digits == 53`, so the table is much too long to show here. +(See the full code with typical output as comments at +[@../../example/lambert_w_precision_example.cpp lambert_w_precision_example.cpp]). -The final Schroeder refinement is skipped if `(digits2 <= (std::numeric_limits::digits - 3))` -3 less than the maximum for the type `std::numeric_limits::digits`. +The final Schroeder refinement is skipped by this implementation if +`(digits2 <= (std::numeric_limits::digits - 3))` +3 bits less than the maximum for the type `std::numeric_limits::digits`. -For type `double`, the switch is at `policy `, so this is recommended for general use when speed is important. +For type `double`, the switch is at `policy `, +so this is recommended for general use when speed is important. -[tip Use `lambert_w0(z, policy >())` if speed is more important than the ultimate precision.] +[tip Use `lambert_w0(z, policy >())` if speed is more important than the ultimate precision, +for example, Monte Carlo applications.] -If speed is very important then `digits2<10>` only using Schroeder might suffice: +If speed is [*very] important then `digits2<10>` only using Bisection alone might suffice: - Lambert W (10.0000000, digits2<10>) = 1.74414063 << Schroeder only. + Lambert W (10.0000000, digits2<10>) = 1.74414063 << Bisection only. -For floating-point types with precision greater than __fundamental_types, a `double` evaluation is used -as a first approximation followed by Halley refinement, -so that there is is little point trying to control precision. -Higher precisions are always going to be [*very much slower]. +Setting digits2 <= 10 (about 3 decimal digits precision) will return the results from bisection. -For more examples of controlling precision, see [@../../example/lambert_w_precision.cpp lambert_w_precision.cpp]. +the precision gain from the Schroeder and Halley is small. + + Lambert W (10.0000000, digits2<11>) = 1.74552798 << Schroeder. + ... + Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley. + +[h5:big_floats Floating-point types larger than double] + +For floating-point types with precision greater than __fundamental_types, +a `double` evaluation is used as a first approximation followed by Halley refinement, +so that there is is little to gain trying to control precision. +Higher precision types are always going to be [*very, very much slower]. + +For more examples of controlling precision, see +[@../../example/lambert_w_precision_example.cpp lambert_w_precision_example.cpp]. The implementation details of algorithm switch points are in [@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] -[h5:diagnostics Diagnostics Macros] - -Several macros are provided to output diagnostic information (potentially [*much] output). -These can be statements like - -`#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` - -placed [*before] the include statement - -`#include `, - -or defined on the project compile command-line: `/DBOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS`, - -or defined in a jamfile.v2: `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` - -[import ../../include/boost/math/special_functions/lambert_w.hpp] - -[boost_math_instrument_lambert_w_macros] - [h4:edge_cases Edge and Corner cases] [h5:w0_edges w0 Branch] @@ -280,8 +317,26 @@ and will give a message like: Denormalized values of z are not supported for Lambert W-1 (because not all floating-point types denormalize), and anyway it only covers a tiny fraction of the range of possible z arguments values. -A domain_error exception is thrown. (This behaviour might be changed to return infinity, as for z == 0. +A domain_error exception is thrown. (This behaviour might be changed to return infinity, as for z == 0). +[h5:diagnostics Diagnostics Macros] + +Several macros are provided to output diagnostic information (potentially [*much] output). +These can be statements like + +`#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` + +placed [*before] the include statement + +`#include `, + +or defined on the project compile command-line: `/DBOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS`, + +or defined in a jamfile.v2: `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` + +[import ../../include/boost/math/special_functions/lambert_w.hpp] + +[boost_math_instrument_lambert_w_macros] [h4:implementation Implementation] @@ -291,16 +346,20 @@ There are many previous implementations with increasing accuracy and speed. See For most of the range of ['z] arguments, some initial approximation is followed by a single refinement, often using Halley or similar method, and gives a useful precision. -To get a better precision, additional iterative refinements, -for example, using __halley or __schroder method, may be needed. +To get a better precision, additional refinements, probably iterative, may be needed +for example, using __halley or __schroder methods. +For speed, several implementations avoid evaluation of a test +using the exponential function calculating that a single refinement step will suffice, +but these rarely get to the best result possible. For the most precise results possible, for C++, close to the nearest representation for the type, it is usually necessary to use a higher precision type for intermediate computation, finally casting back to the smaller desired result type. This strategy is used by Maple and Wolfram, for example, using arbitrary precision arithmetic, -and some of these high-precision values are used for testing this library. +and some of their high-precision values are used for testing this library. This method is also used to provide __boost_test values using __multiprecision, -typically, a 50 decimal digit type like `cpp_dec_float_50` cast to a `float`, `double` or `long double` type. +typically, a 50 decimal digit type like `cpp_dec_float_50` +`static_cast` to a `float`, `double` or `long double` type. For ['z] argument values near the singularity and near zero, other approximations may be used, possibly followed by refinement or increasing series terms until a desired precision is achieved. @@ -314,9 +373,9 @@ But because the Boost.Lambert_W algorithm has been tested using __multiprecision users who require this can always easily achieve the nearest representation for the __fundamental_types if the application justifies the very large extra computation cost. -One real-only implementation was based on an algorithm by__Luu_thesis, +One real-only implementation was based on an algorithm by __Luu_thesis, (see routine 11 on page 98 for his Lambert W algorithm) -and his Halley refinement is used in this implementation when required. +and his Halley refinement is used iteratively in this implementation when required. This implementation is based on Thomas Luu's code posted at [@https://svn.boost.org/trac/boost/ticket/11027 Boost Trac \#11027]. @@ -344,7 +403,7 @@ than the additional cost of computating the 2nd derivative for Halley's method. [h4:faster_implementation Implementing Faster Algorithms] -More recently, the Tosio Fukushima has developed faster algorithms, +More recently, the Tosio Fukushima has developed an even faster algorithm, avoiding any transcendental function calls as these are necessarily expensive. The current implementation is based on his algorithm starting with a translation from FORTRAN into C++ by Darko Veberic. @@ -353,49 +412,56 @@ Many applications of the Lambert W function make many repeated evaluations for M for these applications speed is very important. Luu and Chapeau-Blondeau and Monir provide typical usage examples. -Fukushima makes the important observation that much of the execution time of all +Fukushima improves the important observation that much of the execution time of all previous iterative algorithms was spent evaluating transcendental functions, mainly `exp`. He has put a lot of work into avoiding any slow transcendental functions by using lookup tables and bisection, and finally by a single Schroeder refinement, without any check on the precision of the result (necessarily evaluating an expensive exponential). Theoretical and practical tests confirm that this gives Lambert W estimates -with a known small error bound over nearly all the range of ['z] argument. +with a known small error bound (several __ulp) over nearly all the range of ['z] argument. -However, though these give results within several epsilon of the nearest representable result, -they do not get as close as is often possible with further refinement, usually to within one or two epsilon. +However, though these give results within several __epsilon of the nearest representable result, +they do not get as close as is very often possible with further refinement, +usually to within one or two __epsilon. A mean difference was computed to express the typical error and is often about 0.5 epsilon. For speed during the bisection, Fukushima produces lookup tables of powers of e and z for integral Lambert W. There are 64 elements in these tables. The FORTRAN version (and the C++ translation by Veberic) computed these (once) as `static` data. This is slower, may cause trouble with multithreading, and is slightly inaccurate because of rounding errors from repeated(64) multiplications. In this implementation -the values are computed using __multiprecision 50 decimal digit and output as arrays 37 decimal digit long literals. +the values have been computed using __multiprecision 50 decimal digit +and output as C++ arrays 37 decimal digit long literals using std::cout.precision(std::numeric_limits::max_digits10); -The arrays are as const and static as possible, using BOOST_STATIC_CONSTEXPR macro. -(See [@../test/lambert_w_lookup_table_generator.cpp lambert_w_lookup_table_generator.cpp] +The arrays are as const and static as possible (for the compiler version), +using BOOST_STATIC_CONSTEXPR macro. +(See [@../../test/lambert_w_lookup_table_generator.cpp lambert_w_lookup_table_generator.cpp] The precision was chosen to ensure that if used as `long double` arrays, then the values output to -[@ ../include/boost/math/special_functions/lambert_w_lookup_table.ipp lambert_w_lookup_table.ipp] +[@ ../../include/boost/math/special_functions/lambert_w_lookup_table.ipp lambert_w_lookup_table.ipp] will be the nearest representable value for the type chose by a `typedef` in -[@..include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp]. +[@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp]. typedef double lookup_t; // Type for lookup table (`double` or `float`, or even `long double`?) This is to allow for future use at higher precision, up to platforms that use 128-bit (hardware or software) for `long double`. -The accuracy of the tables was confirmed using __wolfram and agrees at the 37th decimal place, +The accuracy of the tables was confirmed using __WolframAlpha and agrees at the 37th decimal place, so ensuring that the value is read into even `long double` to the nearest representation. [h5:higher_precision Higher precision] -For types more precise than `double`, Fukushima shows that it is best to use the `double` estimate -as a starting point followed by refinement using __halley iterations or other methods. +For types more precise than `double`, Fukushima showed that it is best to use the `double` estimate +as a starting point followed by refinement using __halley iterations or other methods +and our experience confirms this. -For this reason, the lookup tables and `bisection` are only carried out at low precision, +Using __multiprecision it is simple to compute very high precision values of Lambert +W at least to thousands of decimal digits over most of the range of z arguments. + +For this reason, the lookup tables and bisection are only carried out at low precision, usually `double`, chosen by the `typedef double lookup_t`. Unlike the FORTRAN version, the lookup tables of Lambert_W of integral values are precomputed as C++ static arrays of floating-point literals. The default is a `typedef` setting the type to `double`. @@ -407,7 +473,7 @@ items in these lookup arrays, `wm0s[64] = 3.99049`, producing an error message a So 64 is the largest possible value ever returned from the `lambert_w0` function. This is far from the `std::numeric_limits<>::max()` for even `float`s. Therefore this implementation uses an approximation or 'guess' and Halley's method to refine the result. -Logarithmic approximation is discussed at length by R.M.Corless at el. +Logarithmic approximation is discussed at length by R.M.Corless et al. (page 349). Here we use the first two terms of equation 4.19: T lz = log(z); @@ -431,19 +497,18 @@ at some small loss of speed (but does not guarantee the nearest representable re or to get faster but less precise evaluations controlled by __precision_policy. For the less well-behaved regions for Lambert W0 ['z] arguments near zero, -and near the branch singularity at -1/e, some series functions are used. +and near the branch singularity at ['-1/e], some series functions are used. +[h5:small_z Small values of argument z near zero] -[h4:small_z Small values of argument z near zero] - -When argument ['z] is small and near zero, cancellation errors mean that accuracy is lost, -so other series function variants of `lambert_w0_small_z`. +When argument ['z] is small and near zero, cancellation errors mean that precision is lost, +so other series function variants of `lambert_w0_small_z` are used. (There is no equivalent for the W-1 branch as this only covers argument `z < -1/e`). The cutoff used is as found by trial and error by Fukushima `abs(z) < 0.05`. Coefficients of the inverted series expansion of the Lambert W function around `z = 0` are computed following Fukushima using 17 terms of a Taylor series -computed using Wolfram with +computed using __Mathematica with InverseSeries[Series[z Exp[z],{z,0,17}]] @@ -498,13 +563,13 @@ Variants of Function `lambert_w_singularity_series` are used to handle ['z] argu which are near to the singularity at `z = -exp(-1) = -3.6787944` where the branches W0 and W-1 join. T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3 -described using Wolfram +described using __Mathematica InverseSeries\[Series\[sqrt\[2(p Exp\[1 + p\] + 1)\], {p,-1, 20}\]\] to provide Table 3. -This implementation used Wolfram to obtain 40 series terms at 50 decimal digit precision +This implementation used __Mathematica to obtain 40 series terms at 50 decimal digit precision `` N\[InverseSeries\[Series\[Sqrt\[2(p Exp\[1 + p\] + 1)\], { p,-1,40 }\]\], 50\] @@ -513,21 +578,21 @@ This implementation used Wolfram to obtain 40 series terms at 50 decimal digit p These constants are computed at compile time for the full precision for any `RealType T` using the original rationals from Fukushima Table 3. -Longer decimal digits strings are rationals pre-evaluated using Wolfram. +Longer decimal digits strings are rationals pre-evaluated using __Mathematica. Some integer constants overflow, so use largest size available, suffixed by `uLL`. Above the 14th term, the rationals exceed the range of `unsigned long long` and are replaced by pre-computed decimal values at least 21 digits precision == `max_digits10` for `long double`. A macro `BOOST_MATH_TEST_VALUE` taking a decimal floating-point literal was used -to allow use of both built-in floating-point types like `double` +to allow testing with both built-in floating-point types like `double` which have contructors taking literal decimal values like `3.14`, [*and] also multiprecision and other User-defined Types that only provide full-precision construction from decimal digit strings like `"3.14"`. (Construction of multiprecision types from built-in floating-point types only provides the precision of the built-in type, like `double`, only 17 decimal digits). -[tip Be exceeding careful not to silently lose precision by constructing multiprecision types from literal decimal types, usually [^double].] +[tip Be exceeding careful not to silently lose precision by constructing multiprecision types from literal decimal types, usually [^double]. See examples.] Fukushima implmentation used 20 series terms and it was confirmed that using more terms does not usefully increase accuracy. @@ -539,8 +604,8 @@ that corresponds to a maximum Lambert W-1 value of 64.0. His implementation did not cater for z argument values that are smaller (nearer to zero), but this implementation adds code to accept smaller (but not denormalised) values of z. A crude approximation for these very small values is to take the exponent and multiply by ln[10] ~= 2.3. -We also tried the approximation first proposed by Corless et al. using ln(-z), and then tried improving by a 2nd term -ln(ln(-z)), -and finally the ratio term -ln(ln(-z))/ln(-z). +We also tried the approximation first proposed by Corless et al. using ln(-z), (equation 4.19 page 349) +and then tried improving by a 2nd term -ln(ln(-z)), and finally the ratio term -ln(ln(-z))/ln(-z). For a z very close to z = -1.0264389699511303e-26 when W = 64, when effect of ln(ln(-z) term, and ratio L1/L2 is greatest, the possible 'guessed' are @@ -569,8 +634,6 @@ the computational cost of the log functions was easily paid by far fewer iterati // lambert_wm1(-1.0000000000000000e-26) = -64.026509628385895 - - [h4:testing Testing] Initial testing of the algorithm was done using a small number of spot tests. diff --git a/example/lambert_w_diode.cpp b/example/lambert_w_diode.cpp index 9686c9c7a..0ccd4c1f6 100644 --- a/example/lambert_w_diode.cpp +++ b/example/lambert_w_diode.cpp @@ -14,7 +14,8 @@ The current through a diode connected NPN bipolar junction transistor (BJT) type 2N2222 (See https://en.wikipedia.org/wiki/2N2222 and https://www.fairchildsemi.com/datasheets/PN/PN2222.pdf Datasheet) - was measured, for a voltage between 0.3 to 1 volt, see Fig 2 for a log plot, showing a knee visible at about 0.6 V. + was measured, for a voltage between 0.3 to 1 volt, see Fig 2 for a log plot, + showing a knee visible at about 0.6 V. The transistor parameter isat was estimated to be 25 fA and the ideality factor = 1.0. The intrinsic emitter resistance re was estimated from the rsat = 0 data to be 0.3 ohm. @@ -22,12 +23,10 @@ The solid curves in Figure 2 are calculated using equation 5 with rsat included with re. http://www3.imperial.ac.uk/pls/portallive/docs/1/7292572.PDF - - */ #include -using boost::math::lambert_w; +using boost::math::lambert_w0; #include // using std::cout; @@ -38,7 +37,6 @@ using boost::math::lambert_w; #include #include - /*! Compute thermal voltage as a function of temperature, about 25 mV at room temperature. @@ -104,7 +102,7 @@ double iv(double v, double vt, double rsat, double re, double isat, double nu = double e = exp(eterm); std::cout << "exp(eterm) = " << e << std::endl; - double w0 = lambert_w(x * e); + double w0 = lambert_w0(x * e); std::cout << "w0 = " << w0 << std::endl; return i * w0 - isat; @@ -140,22 +138,27 @@ int main() double icalc = iv(v, vt, 249., re, isat); std::cout << "voltage = " << v << ", current = " << icalc << ", " << log(icalc) << std::endl; // voltage = 0.9, current = 0.00108485, -6.82631 - //] [/lambert_w_diode_example_1] } catch (std::exception& ex) { std::cout << ex.what() << std::endl; } - - } // int main() - /* - - //[lambert_w_output_1 +/* Output: +//[lambert_w_output_1 + Lambert W diode current example. + V thermal 0.0257025 + Isat = 2.5e-14 + nu * vt / rsat = 0.000103099 + isat * rsat / (nu * vt) = 2.42486e-10 + (v + isat * rsat) / (nu * vt) = 35.016 + exp(eterm) = 1.61167e+15 + w0 = 10.5225 + voltage = 0.9, current = 0.00108485, -6.82631 +//] [/lambert_w_output_1] +*/ - //] [/lambert_w_output_1] - */ diff --git a/example/lambert_w_precision_example.cpp b/example/lambert_w_precision_example.cpp index 58a0ddf37..c9d31095f 100644 --- a/example/lambert_w_precision_example.cpp +++ b/example/lambert_w_precision_example.cpp @@ -31,10 +31,10 @@ using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. using boost::multiprecision::cpp_bin_float_double_extended; using boost::multiprecision::cpp_bin_float_double; using boost::multiprecision::cpp_bin_float_quad; - - // For lambert_w function. #include +// using boost::math::lambert_w0; +// using boost::math::lambert_wm1; #include // using std::cout; @@ -158,14 +158,15 @@ int main() } { -//[lambert_w_precision_1 // Test evaluation of Lambert W at varying precisions specified using a policy with digits10 increasing from 1 to 9. // For float this covers the full precision range as max_digits10 = 9. float z = 10.F; std::cout << "\nTest evaluation of float Lambert W (" << z << ") at varying precisions" "\nspecified using a policy with digits10 increasing from 1 to 9. " << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; +//[lambert_w_precision_1 + std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " + << std::numeric_limits::epsilon() << std::endl; std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Lambert W (" << z << ", digits10<0>) = " << lambert_w0(z, policy >()) << std::endl; @@ -200,6 +201,11 @@ int main() Lambert W (1.00000000, digits10<9>) = 0.567143261 Lambert W (1.00000000) = 0.567143261 +//] [/lambert_w_precision_output_1] + +// z = 10.F needs Halley to get the last bit or two correct. +//[lambert_w_precision_output_1a + z = 10.F needs Halley to get the last bit or two correct. Lambert W (10.0000000, digits10<1>) = 1.35914087 << bisection. Lambert W (10.0000000, digits10<2>) = 1.35914087 @@ -211,7 +217,7 @@ int main() Lambert W (10.0000000, digits10<8>) = 1.74552810 Lambert W (10.0000000, digits10<9>) = 1.74552810 Lambert W (10.0000000) = 1.74552810 -//] [/lambert_w_precision_output_1] +//] [/lambert_w_precision_output_1a] */ } { // similar example using float but specifying with digits2 @@ -261,8 +267,8 @@ int main() Lambert W (10.0000000, digits2<7>) = 1.35914087 Lambert W (10.0000000, digits2<8>) = 1.35914087 Lambert W (10.0000000, digits2<9>) = 1.35914087 - Lambert W (10.0000000, digits2<10>) = 1.74414063 << Schroeder - Lambert W (10.0000000, digits2<11>) = 1.74552798 + Lambert W (10.0000000, digits2<10>) = 1.74414063 << Bisection. + Lambert W (10.0000000, digits2<11>) = 1.74552798 << Schroeder. Lambert W (10.0000000, digits2<12>) = 1.74552798 Lambert W (10.0000000, digits2<13>) = 1.74552798 Lambert W (10.0000000, digits2<14>) = 1.74552798 @@ -273,7 +279,7 @@ int main() Lambert W (10.0000000, digits2<19>) = 1.74552798 Lambert W (10.0000000, digits2<20>) = 1.74552798 Lambert W (10.0000000, digits2<21>) = 1.74552798 - Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley + Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley. Lambert W (10.0000000, digits2<23>) = 1.74552810 Lambert W (10.0000000, digits2<24>) = 1.74552810 Lambert W (10.0000000) = 1.74552810 << default policy precision. diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp index 1d4b345f0..a60d582bb 100644 --- a/example/lambert_w_simple_examples.cpp +++ b/example/lambert_w_simple_examples.cpp @@ -37,6 +37,9 @@ using boost::multiprecision::float128; #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. +using boost::multiprecision::backends::cpp_dec_float; +using boost::multiprecision::number; +typedef number > cpp_dec_float_1000; // 1000 decimal digit types #include using boost::multiprecision::cpp_bin_float_double; // == double @@ -95,21 +98,24 @@ int main() using boost::math::policies::throw_on_error; //[lambert_w_simple_examples_0 - std::cout.precision(std::numeric_limits::max_digits10); // Show all potentially significant decimal digits. + std::cout.precision(std::numeric_limits::max_digits10); + // Show all potentially significant decimal digits. std::cout << std::showpoint << std::endl; // Show trailing zeros too. { double z = 10.; double r; - r = lambert_w0(z); // Default policy digits10 = 17, digits2 = 53 - std::cout << "lambert_w0(z) = " << r << std::endl; // lambert_w0(z) = 1.7455280027406992 + r = lambert_w0(z); // Default policy for double: digits10 = 17, digits2 = 53 + std::cout << "lambert_w0(z) = " << r << std::endl; + // lambert_w0(z) = 1.7455280027406992 //] [/lambert_w_simple_examples_0] - } { - //[lambert_w_simple_examples_1 - // Other floating-point types can be used too. + // Other floating-point types can be used too, here float. // It is convenient to use function `show_value` - // to display all potentially significant decimal digits for the type. + // to display all potentially significant decimal digits + // for the type. + //[lambert_w_simple_examples_1 + float z = 10.F; float r; r = lambert_w0(z); // Default policy digits10 = 7, digits2 = 24 @@ -120,9 +126,9 @@ int main() //] //[/lambert_w_simple_examples_1] } { -//[lambert_w_simple_examples_2 // Example of an integer argument to lambert_w, // showing that an integer is correctly promoted to a double. +//[lambert_w_simple_examples_2 std::cout.precision(std::numeric_limits::max_digits10); double r = lambert_w0(10); // int argument "10" that should be promoted to double argument. std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406992 @@ -133,22 +139,22 @@ int main() //] //[/lambert_w_simple_examples_2] } { - //[lambert_w_simple_examples_3 // Using multiprecision types to get much higher precision is painless. - cpp_dec_float_50 z("10"); // Note construction using a decimal digit string, not a double literal. + //[lambert_w_simple_examples_3 + cpp_dec_float_50 z("10"); + // Note construction using a decimal digit string "10", not a double literal 10. cpp_dec_float_50 r; r = lambert_w0(z); - std::cout << "lambert_w0("; - show_value(z); + std::cout << "lambert_w0("; show_value(z); std::cout << ") = "; show_value(r); std::cout << std::endl; // lambert_w0(10.000000000000000000000000000000000000000000000000000000000000000000000000000000) = // 1.7455280027406993830743012648753899115352881290809413313533156788409111570000000 //] //[/lambert_w_simple_examples_3] } + // Using multiprecision types to get multiprecision precision wrong! { //[lambert_w_simple_examples_4 - // Using multiprecision types to get multiprecision precision wrong! cpp_dec_float_50 z(0.9); // Will convert to double, losing precision beyond decimal place 17! cpp_dec_float_50 r; r = lambert_w0(z); @@ -163,8 +169,8 @@ int main() //] //[/lambert_w_simple_examples_4] } { - //[lambert_w_simple_examples_4a // Using multiprecision types to get multiprecision precision right! + //[lambert_w_simple_examples_4a cpp_dec_float_50 z("0.9"); // Construct from decimal digit string. cpp_dec_float_50 r; r = lambert_w0(z); @@ -176,14 +182,27 @@ int main() // = 0.52983296563343441213336643954546304857788132269804249284012528304239956432480864 //] //[/lambert_w_simple_examples_4a] } + // Getting extreme precision (1000 decimal digits) Lambert W values. + { + std::cout.precision(std::numeric_limits::digits10); + cpp_dec_float_1000 z("2.0"); + cpp_dec_float_1000 r; + r = lambert_w0(z); // Default policy digits10 = 1000 + std::cout << "lambert_w0(z) = " << r << std::endl; + // 0.8526055020137254913464724146953174668984533001514035087721073946525150656742630448965773783502494847334503972691804119834761668851953598826198984364998343940330324849743119327028383008883133161249045727544669202220292076639777316648311871183719040610274221013237163543451621208284315007250267190731048119566857455987975973474411544571619699938899354169616378479326962044241495398851839432070255805880208619490399218130868317114428351234208216131218024303904457925834743326836272959669122797896855064630871955955318383064292191644322931561534814178034773896739684452724587331245831001449498844495771266728242975586931792421997636537572767708722190588748148949667744956650966402600446780664924889043543203483210769017254907808218556111831854276511280553252641907484685164978750601216344998778097446525021666473925144772131644151718261199915247932015387685261438125313159125475113124470774926288823525823567568542843625471594347837868505309329628014463491611881381186810879712667681285740515197493390563 + // Wolfram alpha command N[productlog[0, 2.0],1000] gives the identical result: + // 0.8526055020137254913464724146953174668984533001514035087721073946525150656742630448965773783502494847334503972691804119834761668851953598826198984364998343940330324849743119327028383008883133161249045727544669202220292076639777316648311871183719040610274221013237163543451621208284315007250267190731048119566857455987975973474411544571619699938899354169616378479326962044241495398851839432070255805880208619490399218130868317114428351234208216131218024303904457925834743326836272959669122797896855064630871955955318383064292191644322931561534814178034773896739684452724587331245831001449498844495771266728242975586931792421997636537572767708722190588748148949667744956650966402600446780664924889043543203483210769017254907808218556111831854276511280553252641907484685164978750601216344998778097446525021666473925144772131644151718261199915247932015387685261438125313159125475113124470774926288823525823567568542843625471594347837868505309329628014463491611881381186810879712667681285740515197493390563 + } { //[lambert_w_simple_examples_precision_policies + std::cout.precision(std::numeric_limits::digits10); double z = 5.; // Define a new, non-default, policy to calculate to precision of approximately 3 decimal digits. std::cout << "lambert_w0(" << z << ", policy>()) = " << lambert_w0(z, policy>()) << std::endl; // lambert_w0(0.29999999999999999, policy>()) = 0.23675531078855935 //] //[/lambert_w_simple_examples_precision_policies] + //[lambert_w_simple_examples_error_policies // Define an error handling policy: typedef policy< @@ -196,9 +215,9 @@ int main() //] //[/lambert_w_simple_example_error_policies] } { - //[lambert_w_simple_examples_out_of_range // Show error reporting if pass a value to lambert_w0 that is out of range, // and probably was meant to be passed to lambert_m1 instead. +//[lambert_w_simple_examples_out_of_range double z = -1.; double r = lambert_w0(z); std::cout << "lambert_w0(-1.) = " << r << std::endl; diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index e60f2e5d1..fe61fddc4 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -5,11 +5,12 @@ // copy at http ://www.boost.org/LICENSE_1_0.txt). /* -Implementation of the Fukushima algorithm for the Lambert W real-only function. +Implementation of the Fukushima algorithm for the Lambert W0 and W-1 real-only functions. This code is based on the algorithm by -Toshio Fukushima, "Precise and fast computation of Lambert W-functions without -transcendental function evaluations", J. Comp. Appl. Math. 244 (2013) 77-89, +Toshio Fukushima, +"Precise and fast computation of Lambert W-functions without transcendental function evaluations", +J. Comp. Appl. Math. 244 (2013) 77-89, and its author's FORTRAN code, and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si based on the algorithm and a FORTRAN version of Toshio Fukushima. @@ -75,7 +76,7 @@ BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table. typedef double lookup_t; // Type for lookup table (double or float, or even long double?) //#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp" - #include "lambert_w_lookup_table.ipp" // boost.Math version. + #include "lambert_w_lookup_table.ipp" // Boost.Math version. namespace boost { @@ -84,17 +85,14 @@ namespace math namespace detail { - //! Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944. - // Some integer constants overflow so use largest integer size available (LL). - // Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]] - // T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3. - // Wolfram command used to obtain 40 series terms at 50 decimal digit precision was - // N[InverseSeries[Series[Sqrt[2(p Exp[1 + p] + 1)], { p,-1,40 }]], 50] - // -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ... - // Made these constants full precision for any T using original fractions from Table 3. - // Decimal values of specifications for built-in floating-point types below - // are at least 21 digits precision == max_digits10 for long double. - // Longer decimal digits strings are rationals evaluated using Wolfram. + //! \brief Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944. + //! Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]] + //! Wolfram command used to obtain 40 series terms at 50 decimal digit precision was + //! N[InverseSeries[Series[Sqrt[2(p Exp[1 + p] + 1)], { p,-1,40 }]], 50] + //! -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ... + //! Decimal values of specifications for built-in floating-point types below + //! are at least 21 digits precision == max_digits10 for long double. + //! Longer decimal digits strings are rationals evaluated using Wolfram. template T lambert_w_singularity_series(const T p) @@ -112,7 +110,7 @@ namespace math static const T q[] = { - -T(1), // j0 + -static_cast(1), // j0 +T(1), // j1 -T(1) / 3, // 1/3 j2 +T(11) / 72, // 0.152777777777777778, // 11/72 j3 @@ -151,7 +149,7 @@ namespace math // so must use BOOST_MATH_TEST_VALUE(T, ) format in hope of using suffix Q for quad or decimal digits string for others. //-T(0.000058113607504413816772205464778828177256611844221913L), // j20 N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913 BOOST_MATH_TEST_VALUE(T, -0.000058113607504413816772205464778828177256611844221913) // j20 - last used by Fukushima - // more terms don't seem to give any improvement (worse in fact) and are not use for many z values. + // More terms don't seem to give any improvement (worse in fact) and are not use for many z values. //BOOST_MATH_TEST_VALUE(T, +0.000039076684867439051635395583044527492132109160553593), // j21 //BOOST_MATH_TEST_VALUE(T, -0.000026338064747231098738584082718649443078703982217219), // j22 //BOOST_MATH_TEST_VALUE(T, +0.000017790345805079585400736282075184540383274460464169), // j23 @@ -163,7 +161,7 @@ namespace math }; // static const T q[] /* - // Temporary copy of original double values for comparison and these are reproduced well. + // Temporary copy of original double values for comparison; these are reproduced well. static const T q[] = { -1L, // j0 @@ -191,41 +189,34 @@ namespace math */ // Decide how many series terms to use, increasing as z approaches the singularity, - // balancing run time and computational noise from round-off. + // balancing run-time versus computational noise from round-off. // In practice, we truncate the series expansion at a certain order. // If the order is too large, not only does the amount of computation increase, // but also the round-off errors accumulate. // See Fukushima equation 35, page 85 for logic of choice of number of series terms. - // TODO remove temporary check on different between double and quad values. worst 1e-17 - //std::cout << "q[21]" << std::endl; - //for (int i = 0; i != 21; i++) - //{ - // std::cout << i << " " << q[i] << " " << q[i] - double_q[i] << std::endl; - //} - BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. - const T ap = abs(p); + const T absp = abs(p); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS { int terms = 20; // Default to using all terms. - if (ap < 0.001150) + if (absp < 0.001150) { // Very near singularity. terms = 6; } - else if (ap < 0.0766) + else if (absp < 0.0766) { // Near singularity. terms = 10; } std::streamsize saved_precision = std::cout.precision(3); - std::cout << "abs(p) = " << ap << ", terms = " << terms << std::endl; + std::cout << "abs(p) = " << absp << ", terms = " << terms << std::endl; std::cout.precision(saved_precision); } #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS - if (ap < 0.01159) + if (absp < 0.01159) { // Only 6 near-singularity series terms are useful. return -1 + @@ -237,7 +228,7 @@ namespace math p*q[6] ))))); } - else if (ap < 0.0766) // Use 10 near-singularity series terms. + else if (absp < 0.0766) // Use 10 near-singularity series terms. { // Use 10 near-singularity series terms. return -1 + @@ -291,7 +282,7 @@ namespace math ///////////////////////////////////////////////////////////////////////////////////////////// - //! Series expansion used near zero (abs(z) < 0.05). + //! \brief Series expansion used near zero (abs(z) < 0.05). //! \details //! Coefficients of the inverted series expansion of the Lambert W function around z = 0. //! Tosio Fukushima always uses all 17 terms of a Taylor series computed using Wolfram with @@ -302,7 +293,8 @@ namespace math //! are 21 digits precision == max_digits10 for long double. //! Care Some coefficients might overflow some fixed_point types. - //! This version is intended to allow use by user-defined types like Boost.Multiprecision quad and cpp_dec_float types. + //! This version is intended to allow use by user-defined types + //! like Boost.Multiprecision quad and cpp_dec_float types. //! The three specializations below for built-in float, double //! (and perhaps long double) will be chosen in preference for these types. @@ -612,7 +604,7 @@ namespace math 341422.05066583836331735491399356945575432970390954 z^19 Wolfram value differs at 36 decimal digit, as expected. */ - using boost::math::policies::get_epsilon; + using boost::math::policies::get_epsilon; // for type T. using boost::math::tools::sum_series; using boost::math::tools::evaluate_polynomial; // http://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/roots/rational.html @@ -650,9 +642,11 @@ namespace math //std::cout.precision(saved_precision); boost::uintmax_t max_iter = policies::get_max_series_iterations(); // Max iterations from policy. + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES + std::cout << "max iter from policy = " << max_iter << std::endl; + // // max iter from policy = 1000000 is default. + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES - //std::cout << "max iter from policy = " << max_iter << std::endl; // max iter from policy = 1000000 - // max_iter = 0; result = sum_series(s, get_epsilon(), max_iter, result); // result == evaluate_polynomial. //sum_series(Functor& func, int bits, boost::uintmax_t& max_terms, const U& init_value) @@ -690,28 +684,27 @@ namespace math inline T halley_update(T w0, const T z, const Policy&) { - // Iterate a few times to refine value using Halley's method. + // Only if necessary, iterate a few times to refine estimate using Halley's method. // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate // since we can simplify the expressions algebraically, // and don't need most of the error checking of the boilerplate version // as we know in advance that the function is reasonably well-behaved, - // (and in any case the derivatives require evaluation of Lambert W!) + // (and in any case the derivatives require evaluation of Lambert W!). + + //! So also do-while version. BOOST_MATH_STD_USING // Aid argument dependent (ADL) lookup of abs. using boost::math::constants::exp_minus_one; // 0.36787944 using boost::math::tools::max_value; - T tolerance = boost::math::policies::get_epsilon(); - - // TODO should get_precision here. int iterations = 0; - int iterations_required = 6; - int max_iterations = 20; + // int iterations_required = 6; // + int max_iterations = 20; // Only as a check on looping. - T w1 = w0; // Refined estimate. + T tolerance = boost::math::policies::get_epsilon(); T previous_diff = boost::math::tools::max_value(); - + T w1 = w0; // Refined estimate. T expw0 = exp(w0); // Compute z == W * exp(W); from best Lambert W estimate so far. // Hope that w0 * expw0 == z; T diff = (w0 * expw0) - z; // Difference from argument z. @@ -721,6 +714,14 @@ namespace math std::ios::fmtflags flags(std::cout.flags()); // Save. std::cout.setf(std::ios_base::showpoint); // Include any trailing zeros. std::cout << "w = " << w0 << ", z = " << z << ", w * exp(w) = " << w0 * expw0 << ", diff = " << diff << std::endl; + if (diff == 0) + { + std::cout << "Exact, so no Halley refinement from " << w0 << std::endl; + } + else if(abs(diff) <= tolerance) + { + std::cout << "Within tolerance, so no Halley refinement from " << w0 << std::endl; + } std::cout.precision(precision); // Restore. std::cout.flags(flags); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY @@ -728,12 +729,17 @@ namespace math { return w0; } - // Refine. + // relative does NOT work well, so check for improvement in diff instead. + //else if ((abs(diff) / w0) <= tolerance) + //{ + // return w0; + //} + // else Refine. do { iterations++; #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY - std::cout << iterations << " Halley iterations." << std::endl; + std::cout << "Halley iteration #" << iterations << "."<< std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY previous_diff = diff; // Remember so that can check if any new estimate is better. @@ -775,11 +781,16 @@ namespace math w0 = w1; expw0 = exp(w0); } - while ((iterations < iterations_required) || (iterations <= max_iterations)); // Absolute limit during testing - is looping if need this. + // while ((iterations < iterations_required) || (iterations <= max_iterations)); // Absolute limit during testing - is looping if need this. + while (iterations <= max_iterations); // Absolute limit during testing - is looping if need this. return w1; } // T halley_update(T w0, const T z) + + //! Halley update version that does one update without a check, + //! and then more updates as necessary. + // TODO Might use a template parameter to avoid duplication? template inline T halley_update_do_while(T w0, const T z) @@ -792,6 +803,7 @@ namespace math int iterations = 0; int min_iterations = 1; // Specify a minimum number of iterations to perform. int max_iterations = 6; // Should not be needed, but include to avoid risk of looping forever. + // (Might be necessary to increase this?) #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY std::cout << "At least = " << min_iterations << " Halley iterations." << std::endl; std::cout << "(But not more than " << max_iterations << " Halley iterations.)" << std::endl; @@ -799,8 +811,6 @@ namespace math T w1; // Refined estimate. T previous_diff = boost::math::tools::max_value(); - - // TODO perform check first with while( diff small) do {refinement} do { // Iterate a few times to refine value using Halley's method. // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate @@ -847,14 +857,14 @@ namespace math (iterations >= max_iterations) // Absolute max limit during testing // (unexpected looping if need this). ); - return w1; // } // Halley do while - //! Schroeder method, fifth-order update formula, see T. Fukushima page 80-81, and + //! \brief Schroeder method, fifth-order update formula, + //! \details See T. Fukushima page 80-81, and //! A. Householder, The Numerical Treatment of a Single Nonlinear Equation, //! McGraw-Hill, New York, 1970, section 4.4. - //! Switch to schroeder_update after a pre-computed jb/jmax bisections, + //! Fukushima algorithm switches to @c schroeder_update after pre-computed bisections, //! chosen to ensure that the result will be achieve the +/- 10 epsilon target. //! \param w Lambert w estimate from bisection. //! \param y bracketing value from bisection. @@ -865,29 +875,31 @@ namespace math inline T schroeder_update(const T w, const T y) { - // Compute derivatives using Schroeder refinement, Fukushima equations 18, page 6. + // Compute derivatives using 5th order Schroeder refinement. // Since this is the final step, it will always use the highest precision type T. - // Called: result = schroeder_update(w, y); + // Example of Call: + // result = schroeder_update(w, y); + //where // w is estimate of Lambert W (from bisection or series). - // y is z * e^-w + // y is z * e^-w. BOOST_MATH_STD_USING // Aid argument dependent lookup of abs. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); using boost::math::float_distance; T fd = float_distance(w, y); - std::cout << "Bisect (Pre-Schroder) Distance = "; + std::cout << "Schroder "; if (abs(fd) < 214748000.) { - std::cout << static_cast(fd); + std::cout << " Distance = "<< static_cast(fd); } else { - std::cout << "big."; + std::cout << "Difference w - y = " << (w - y) << "."; } std::cout << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER - + // Fukushima equation 18, page 6. const T f0 = w - y; // f0 = w - y. const T f1 = 1 + y; // f1 = df/dW const T f00 = f0 * f0; @@ -899,29 +911,13 @@ namespace math f00 * (6 * y * y + 8 * f1 * y + f0y)); // Fukushima Page 81, equation 21 from equation 20. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER - std::cout << "Schroeder refined " << w << " " << y << " to " << result << ", difference " << w - result << std::endl; + std::cout << "Schroeder refined " << w << " " << y << ", difference " << w-y << ", change " << w - result << ", to result " << result << std::endl; std::cout.precision(saved_precision); // Restore. #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER return result; } // template T schroeder_update(const T w, const T y) - // Temporary to list out the static arrays. - template - inline void print_collection(const T& coll, std::string name, std::string sep) - { - std::streamsize precision = std::cout.precision(); - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << name << ": "; - - for (auto it = std::begin(coll); it != std::end(coll); ++it) - { - std::cout << *(it) << sep; - } - std::cout.precision(precision); // Restore. - std::cout << std::endl; - } // print_collection - ///////////// namespace detail implementations of Lambert W for W0 and W-1 branches. //! Compute Lambert W for W0 (or W+) branch. @@ -933,8 +929,9 @@ namespace math // or static_casted integer, for example: static_cast(1) or static_cast(1). // Want to allow fixed_point types too, so do not just test for floating-point. // Integral types should been promoted to double by user Lambert w functions. - BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: lambert_w0(1.), not lambert_w0(1)!"); - + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, + "Must be floating-point or fixed type (not integer type), for example: lambert_w0(1.), not lambert_w0(1)!"); + const char* function = "boost::math::lambert_w0()"; // Used for error messages. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 @@ -949,14 +946,7 @@ namespace math #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 // Check for edge and corner cases first: - // denormal is probably OK for W0 branch ? - /* if (!boost::math::isnormal(z)) - { - return policies::raise_domain_error(function, - "Argument z is denormalized!", - z, pol); - } - */ + if (boost::math::isnan(z)) { return policies::raise_domain_error(function, @@ -1010,16 +1000,24 @@ namespace math // http://www.boost.org/doc/libs/release/libs/multiprecision/doc/html/boost_multiprecision/intro.html // Taking care to avoid trouble from expression templates. T w_series = lambert_w_singularity_series(T(sqrt(p2))); - //Schroeder does not improve result - differences about 5e-15, so do NOT use refinement step below. + // Neither Halley nor Schroeder do not improve result for builtin, + // differences about 5e-15, so do NOT use refinement step below unless multiprecision. + // //int d2 = policies::digits(); // Precision as digits base 2 from policy. //if (d2 > (std::numeric_limits::digits - 6)) //{ // If more (fullest) accuracy required, then use refinement. // T y = z * exp(-w_series); // T s_result = schroeder_update(w_series, y); //} - // neither does Halley - //T y = z * exp(-w_series); - //return halley_update(w_series, y); + if (std::numeric_limits::digits > 53) + { // Multiprecision, so try a refinement: + w_series = halley_update(w_series, z, pol); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Halley updated to " << w_series << std::endl; + std::cout.precision(saved_precision); +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN + } return w_series; } } // z < -0.35 @@ -1041,7 +1039,7 @@ namespace math // and improve by adding a second term ln(ln(z)) T lz = log(z); T llz = log(lz); - guess = lz - llz + (llz / lz); // Corless equation 4.19, page 349 and Chapeau-Blondeau equation 20, page 2162. + guess = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "z = " << z << ", guess = " << guess << ", ln(z) = " << lz << ", ln(-ln(z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl; @@ -1071,85 +1069,6 @@ namespace math } // Too big for lookup table. // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Bisection and Schroeder (and Halley). - - - /////////////////////////////////////////////////////////// - // TODO take this table out as a templated function, - // to avoid potential multithreading initialization problems. - // (Would like to avoid initializing table of static data? - // but cannot avoid - always computed at load time). - // This data is not used if z is small or z < -0.35 near branch point, - // so this code is good at avoiding unnecessary initialisation. - // See Fukushima section 2.2, page 81. - // Defining integral parts of Lambert W function values to be used for bisection. - // e and g have space for 64-bit reals. - - /* - static const size_t noof_wm1zs = 66; - static T e[noof_wm1zs]; // lambert_w[k] for W-1 branch. 2.7182 1. 0.3678 0.1353 0.04978 ... 4.359e-28 1.603e-28 - static const size_t noof_w0zs = 65; - static T g[noof_w0zs]; // lambert_w[k] for W0 branch. 0 2.7182 14.77 60.2566 ... 1.445e+29 3.990e+29. - // lambert_w0(2.77182) == 1.; - // lambert_w0(14.7700) == 2.; - // lambert_w0(2.77182) == 3.; - // ... - // lambert_w0(3.990e+29) == 64. - // 3.990e+29 == g[64]; - - // Defining lookup table sqrts of 1/e. - static const size_t noof_sqrts = 12; - static T a[noof_sqrts]; // 0.6065 0.7788, 0.8824 ... 0.9997, sqrt of previous elements. - static T b[noof_sqrts]; // 0.5 0.25 0.125, 0.0625 ... 0.0002441, halves of previous elements. - - if (!e[0]) - { // Fill static data on first use. - // Fukushima calls array F[k] = ke^k (0 <= k <= 64 for f) - // and G[k] -ke^-k (1 <= k <= 64 for g) - - T ej = 1; // F[k] for W-1 branch. - e[0] = boost::math::constants::e(); // e = 2.7182 - e[1] = 1; - g[0] = 0; // G[k] for W0 branch. - for (int j = 1, jj = 2; jj != noof_wm1zs; ++jj) - { - e[jj] = e[j] * boost::math::constants::exp_minus_one(); // For W-1 branch. - // exp(-1) - 1/e exp_minus_one = 0.36787944. - ej *= boost::math::constants::e(); // 2.7182 - g[j] = j * ej; // For W0 branch. - j = jj; - } // for - - // a[0] = sqrt(e1); - // TODO compile time constant sqrt(1/e) - add to math constants, and add to documentation too. - // This would be slightly more accurate - conversion from long double could lose precision, - // but might not matter if using Schroeder and/or Halley? - // a[0] = boost::math::constants::sqrt_one_div_e(); - a[0] = static_cast(0.606530659712633423603799534991180453441918135487186955682L); - b[0] = static_cast(0.5); // Exactly representable. - for (int j = 0, jj = 1; jj != noof_sqrts; ++jj) - { - a[jj] = sqrt(a[j]); // Sqrt of previous element. sqrt(1/e),sqrt(sqrt(1/e)) ... - // b[jj] = b[j] * static_cast(0.5); // Half previous element. - b[jj] = b[j] / 2; // Half previous element (/2 will be optimised better?). - j = jj; - } - print_collection(e, "e", " "); // 2.71828175 1 0.36787945 0.135335296 0.0497870743 0.0183156412 0.00673794793 ... 1.60381359e-28 - print_collection(g, "g", " "); - print_collection(a, "a", " "); - print_collection(b, "b", " "); - - // Values saved as Fukushima bisection static arrays.txt - // These might be stored as constants in data? - //e: 2.71828 1 0.367879 0.135335 0.0497871 0.0183156 0.00673795 0.00247875 0.000911882 0.000335463 0.00012341 4.53999e-05 1.67017e-05 6.14421e-06 2.26033e-06 8.31529e-07 3.05902e-07 1.12535e-07 4.13994e-08 1.523e-08 5.6028e-09 2.06115e-09 7.58256e-10 2.78947e-10 1.02619e-10 3.77514e-11 1.3888e-11 5.10909e-12 1.87953e-12 6.91441e-13 2.54367e-13 9.35763e-14 3.44248e-14 1.26642e-14 4.65889e-15 1.71391e-15 6.30512e-16 2.31952e-16 8.53305e-17 3.13914e-17 1.15482e-17 4.24836e-18 1.56288e-18 5.74953e-19 2.11513e-19 7.78114e-20 2.86252e-20 1.05306e-20 3.874e-21 1.42517e-21 5.24289e-22 1.92875e-22 7.09548e-23 2.61028e-23 9.60269e-24 3.53263e-24 1.29958e-24 4.7809e-25 1.75879e-25 6.47024e-26 2.38027e-26 8.75652e-27 3.22135e-27 1.18507e-27 4.35962e-28 1.60381e-28 - //g : 0 2.71828 14.7781 60.2566 218.393 742.066 2420.57 7676.43 23847.7 72927.7 220265 658615 1.95306e+06 5.75137e+06 1.68365e+07 4.90352e+07 1.42178e+08 4.10634e+08 1.18188e+09 3.39116e+09 9.7033e+09 2.76951e+10 7.8868e+10 2.2413e+11 6.35738e+11 1.80012e+12 5.08897e+12 1.43653e+13 4.04952e+13 1.14009e+14 3.20594e+14 9.00514e+14 2.52681e+15 7.08323e+15 1.98377e+16 5.55104e+16 1.55204e+17 4.33608e+17 1.21052e+18 3.37714e+18 9.4154e+18 2.62336e+19 7.30495e+19 2.03297e+20 5.6547e+20 1.57204e+21 4.36821e+21 1.21322e+22 3.36803e+22 9.34599e+22 2.59235e+23 7.18767e+23 1.99212e+24 5.51929e+24 1.5286e+25 4.23213e+25 1.17133e+26 3.24086e+26 8.96411e+26 2.47871e+27 6.85203e+27 1.89362e+28 5.23177e+28 1.44508e+29 3.99049e+29 - //a : 0.606531 0.778801 0.882497 0.939413 0.969233 0.984496 0.992218 0.996101 0.998049 0.999024 0.999512 0.999756 - //b : 0.5 0.25 0.125 0.0625 0.03125 0.015625 0.0078125 0.00390625 0.00195313 0.000976563 0.000488281 0.000244141 - - - } // if (!e[0]) end of static data fill. - */ - /////////////////////////////////////////////////////////////////////////// - if (std::numeric_limits::digits > 53) { // T is more precise than 64-bit double (or long double, or ?), // so recurse to compute an approximate double value using only one Schroeder refinement, @@ -1162,16 +1081,16 @@ namespace math // Compute a 50-bit precision approximate W0 in a double (no Halley refinement). T double_approx = static_cast(lambert_w0_imp(static_cast(z), policy >())); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN - std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << result << std::endl; + std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // Perform additional few Halley refinement(s) to ensure that // get a near as possible to correct result (usually +/- one epsilon). T result = halley_update(double_approx, z, pol); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0__NOT_BUILTIN std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl; std::cout.precision(saved_precision); -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0__NOT_BUILTIN return result; } // digits > 53 - higher precision than double. else // T is double or less precision. @@ -1231,7 +1150,7 @@ namespace math // These are used as initial values for bisection. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP std::cout << "Result lookup W0(" << z << ") bisection between w0zs[" << n << "] = " << w0zs[n] << " and w0zs[" << n << "] = " << w0zs[n+1] - << ", bisect mean = " << (w0zs[n - 1] + w0zs[n]) / 2 << std::endl; + << ", bisect mean = " << ( w0zs[n] + w0zs[n + 1]) / 2 << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Check precision specified by policy in case can return early. @@ -1244,39 +1163,44 @@ namespace math #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION if (d2 <= 7) { // Only 7 binary digits precision required to hold integer size of w0zs[65], - // so just return the mean of two nearby integral values. + // so just return the mean of the two nearby integral values. // This is a *very* approximate estimate, and perhaps not very useful? - return static_cast((w0zs[n - 1] + w0zs[n]) / 2); + return static_cast((w0zs[n] + w0zs[n+1]) / 2); } - // Compute the number of bisections (jmax) that ensure that result is close enough that + // Compute the number of bisections that ensure that result is close enough that // a single 5th order Schroeder update is sufficient to achieve near double (53-bit) accuracy. - int jmax = 8; // Assume minimum number of bisections will be needed (most common case). + int bisections = 8; // Assume minimum number of bisections will be needed (most common case). if (z <= -0.36) { // Very near singularity, so need several more bisections. - jmax = noof_sqrts; + bisections = noof_sqrts; // 12 } else if (z <= -0.3) { // Near singularity, so need a few more bisections. - jmax = 11; + bisections = 11; } else if (n <= 0) { // Very small z, so need 3 more bisections. - jmax = 10; + bisections = 10; } else if (n <= 1) { // Small z, so need just 1 extra bisection. - jmax = 9; + bisections = 9; } + // bisections += 2; // Try a few extras to see if this gets closer to 'best possible result'. Probably not. +// But would need more halfs and sqrts to test worst case? +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION + std::cout << "n = " << n << ", so " << bisections << " bisections." << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION lookup_t dz = static_cast(z); // Only use lookup_t precision, default double, for bisection. // Use Halley refinement for higher precisions. - // Perform the jmax fractional bisections for necessary precision. + // Perform the bisections fractional bisections for necessary precision. // Avoid using exponential function for speed. lookup_t w = static_cast(n); // Fukushima Equation 25, Integral Lambert W. // lookup_t y = dz * e[n + 1]; // Fukushima Integral +1 Lambert W. lookup_t y = dz * static_cast(w0es[n + 1]); // Fukushima Equation 26, Integral +1 Lambert W. - for (int j = 0; j < jmax; ++j) + for (int j = 0; j < bisections; ++j) { // Equation 27. const lookup_t wj = w + static_cast(halves[j]); // Add 1/2, 1/4, 1/8 ... const lookup_t yj = y * static_cast(sqrtw0s[j]); // Multiply by sqrt(1/e), ... @@ -1285,15 +1209,19 @@ namespace math w = wj; y = yj; } - } // for jmax +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION + std::cout << "#" << std::setw(2) << j << " w = " << w << ", y = " << y << std::endl; +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION + } // for bisections - if (d2 <= 10) - { // Only 10 digits2 required (== digits10 = 3 decimal digits precision), - // so just return the nearest bisection. - // (Might make this test depend on size of T?) #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION std::cout << "Bisection estimate = " << w << " " << y << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION + + if (d2 <= 10) + { // Only 10 digits2 required (== digits10 ~= 3 decimal digits precision), + // so just return the nearest bisection. + // (Might make this test depend on size of T?) return static_cast(w); // Bisection only. } else // More than 10 digits2 wanted, so continue with Fukushima's Schroeder refinement. @@ -1303,9 +1231,9 @@ namespace math { // Only enough digits2 required, so just return the Schroeder refined value. // For example, for float, if (d2 <= 22) then // digits-3 returns Schroeder result if up to 3 bits might be wrong. -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER std::cout << "Schroeder refinement estimate = " << result << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER return result; // Schroeder only. } else // Perform additional Halley refinement(s) to ensure that @@ -1322,12 +1250,11 @@ namespace math } // more than 10 digits2 } } // normal range and precision. - throw std::logic_error("No result from lambert_w0_imp! (Please report)."); // Should never get here. + throw std::logic_error("No result from lambert_w0_imp! (Please report!)"); // Should never get here. } // T lambert_w0_imp(const T z, const Policy& /* pol */) //! Lambert W for W-1 branch, -max(z) < z <= -1/e. // TODO is -max(z) allowed? - // TODO check changes to W0 branch have also been made here. template T lambert_wm1_imp(const T z, const Policy& pol) { @@ -1338,22 +1265,28 @@ namespace math // Integral types should be promoted to double by user Lambert w functions. // If integral type provided to user function lambert_w0 or lambert_wm1, // then should already have been promoted to double. - BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!"); + BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, + "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!"); BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. - using boost::math::tools::max_value; - const char* function = "boost::math::lambert_wm1()"; // Used for error messages. if (z == static_cast(0)) - { // z is exactly zero.return -std::numeric_limits::infinity(); - return -std::numeric_limits::infinity(); + { // z is exactly zero so return -std::numeric_limits::infinity(); + if (std::numeric_limits::has_infinity) + { + return -std::numeric_limits::infinity(); + } + else + { + return -tools::max_value(); + } } if (std::numeric_limits::has_denorm) { // All real types except arbitrary precision. if (!boost::math::isnormal(z)) - { // Almost zero - might also just return infinity like z == 0? + { // Almost zero - might also just return infinity like z == 0 or max_value? return policies::raise_domain_error(function, "Argument z = %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)", z, pol); @@ -1362,7 +1295,7 @@ namespace math if (z > static_cast(0)) { // return policies::raise_domain_error(function, - "Argument z = %1% is out of range (z > 0) for Lambert W-1 branch! (Try Lambert W0 branch?)", + "Argument z = %1% is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?)", z, pol); } if (z > -(std::numeric_limits::min)()) @@ -1384,91 +1317,40 @@ namespace math "Argument z = %1% is out of range (z < -exp(-1) = -3.6787944... <= 0) for Lambert W-1 (or W0) branch!", z, pol); } - if (z < -0.35) - { // Close to singularity/branch point but on w-1 branch. TODO. + if (z < static_cast(-0.35)) + { // Close to singularity/branch point z = -0.3678794411714423215955237701614608727 but on W-1 branch. const T p2 = 2 * (boost::math::constants::e() * z + 1); - if (p2 > 0) - { - return lambert_w_singularity_series(-sqrt(p2)); - // TODO Halley refinement options here. - } if (p2 == 0) { // At the singularity at branch point. return -1; } + if (p2 > 0) + { + T w_series = lambert_w_singularity_series(T(-sqrt(p2))); + if (std::numeric_limits::digits > 53) + { // Multiprecision, so try a Halley refinement. + w_series = halley_update(w_series, z, pol); +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Halley updated to " << w_series << std::endl; + std::cout.precision(saved_precision); +#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN + } + return w_series; + } + // Should not get here. return policies::raise_domain_error(function, - "Argument z = %1% is out of range!", + "Argument z = %1% is out of range for Lambert W-1 branch. (Should not get here - please report!)", z, pol); + + //return policies::raise_domain_error(function, + // "Argument z = %1% is out of range!", + // z, pol); } // if (z < -0.35) - /* - // Create static arrays of Lambert Wm1 function - // TODO these are NOT the same size or values as the w0 constant array values????? - - // double LambertW0(const double z) - // static double e[66]; - // static double g[65]; - // static double a[12]; - // static double b[12]; - - // Create static arrays of Lambert W function for Wm1 - // with lambert_w values of integers. - // Used for bisection of W-1 branch. - static const size_t noof_sqrts = 12; // and halves - // F[k] is 0 <= k <= 64 so size is 65 (but is 64 below????). - // G[k] is 1 <= k <= 64 so size is 64 - // So e and F are not the same! - - static const size_t noof_wm1zs = 64; - - static lookup_t e[noof_wm1zs]; // e[0] to e[63] - static lookup_t g[noof_wm1zs]; // g[0] == Gk when k = 1, to g[63] == Gk=64 - static lookup_t a[noof_sqrts]; - static lookup_t b[noof_sqrts]; - - if (!e[0]) - { - const lookup_t e1 = 1 / boost::math::constants::e(); - lookup_t ej = e1; // 1/e= 0.36787945 - e[0] = boost::math::constants::e(); - g[0] = -e1; - for (int j = 0, jj = 1; jj < 64; ++jj) - { // jj is j+1 - ej *= e1; - e[jj] = e[j] * boost::math::constants::e(); - g[jj] = -(jj + 1) * ej; - j = jj; - } - a[0] = sqrt(boost::math::constants::e()); - b[0] = static_cast(0.5); - for (int j = 0, jj = 1; jj < noof_sqrts; ++jj) - { - a[jj] = sqrt(a[j]); - // b[jj] = b[j] * static_cast(0.5); - b[jj] = b[j] / 2; // More efficient for multiprecision? - j = jj; - } // for j - - -//std::cout << " W-1 e[0] = " << e[0] << ", e[1] = " << e[1] << "... e[63] = " << e[63] << std::endl; -// W-1 e[0] = 2.71828175, e[1] = 7.38905573... e[63] = 6.23513822e+27 -// W-1 e[0] = 2.7182818284590451, e[1] = 7.3890560989306495... e[63] = 6.235149080811597e+27, e[64] = 58265.164084420219 -//std::cout << " W-1 g[0] = " << g[0] << ", g[1] = " << g[1] << "... g[63] = " << g[63] << std::endl; -// W-1 g[0] = -0.36787945 k=1, -1e^-1 = -0.3678794 , -// g[1] = -0.270670593 ... g[63] = -1.0264407e-26 -// W-1 g[0] = -0.36787944117144233, g[1] = -0.2706705664732254... g[63] = -1.0264389699511303e-26 - // TODO temporary output. - //std::cout << "lambert_wm1 version of arrays - NOT same as w0 version." << std::endl; - // print_collection(e, "e", " "); // e[0] = 2.71828175, e[1] = 1, e[2] = 0.36787945, 0.135335296 0.0497870743 0.0183156412 0.00673794793 ... e[63] = 2.293783159, e[64]= 6.235149080e+27 - // print_collection(g, "g", " "); // g[0] = -0.3678794, g[1] = -0.2706705... , g[63] = -1.026438e-26 - //print_collection(a, "a", " "); - //print_collection(b, "b", " "); - } // if (!e[0]) -// static arrays filled. -*/ using lambert_w_lookup::wm1es; using lambert_w_lookup::wm1zs; - using lambert_w_lookup::noof_wm1zs; // size == 64 + using lambert_w_lookup::noof_wm1zs; // size == 64 // std::cout <<" Wm1zs[63] (== G[64]) = " << " " << wm1zs[63] << std::endl; // Wm1zs[63] (== G[64]) = -1.0264389699511283e-26 // Check that z argument value is not smaller than lookup_table G[64] @@ -1486,7 +1368,8 @@ namespace math // N[productlog(-1, -2.2250738585072014e-308 * 10^-308 ), 50] = -1424.8544521230553853558132180518404363617968042942 // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955 - // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996. + // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, + // “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996. // François Chapeau-Blondeau and Abdelilah Monir // Numerical Evaluation of the Lambert W Function // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002 @@ -1536,7 +1419,7 @@ namespace math // Compute a 50-bit precision approximate W0 in a double (no Halley refinement). T double_approx = static_cast(lambert_wm1_imp(static_cast(z), policy >())); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN - std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << result << std::endl; + std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl; #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1 // Perform additional Halley refinement(s) to ensure that // get a near as possible to correct result (usually +/- one epsilon). @@ -1568,12 +1451,10 @@ namespace math } } // else z < g[63] == -1.0264389699511303e-26, so Lambert W-1 integer part > 64. - // Might assign the lower bracket to -1.0264389699511303e-26 and upper to (std::numeric_limits::min)() - // and jump to schroeder to halley? But that would only allow use with lookup_t precision. + // This should not now occur (should be caught by test and code above) so should be a logic_error? return policies::raise_domain_error(function, "Argument z = %1% is too small (< -1.026439e-26) (logic error - please report!)", z, pol); - // This should not now occur (should be caught by test above) so should be a logic_error? overshot: { int nh = n / 2; @@ -1632,22 +1513,22 @@ namespace math return static_cast((wm1zs[n] + wm1zs[n + 1]) / 2); } // d2 < 7 - // Compute jmax is the number of bisections computed from n, + // Compute bisections is the number of bisections computed from n, // such that a single application of the fifth-order Schroeder update formula // after the bisections is enough to evaluate Lambert W-1 with (near?) 53-bit accuracy. // Fukushima established these by trial and error? - int jmax = 11; // Assume maximum number of bisections will be needed (most common case). + int bisections = 11; // Assume maximum number of bisections will be needed (most common case). if (n >= 8) { - jmax = 8; + bisections = 8; } else if (n >= 3) { - jmax = 9; + bisections = 9; } else if (n >= 2) { - jmax = 10; + bisections = 10; } // Bracketing, Fukushima section 2.3, page 82: // (Avoiding using exponential function for speed). @@ -1657,8 +1538,8 @@ namespace math using lambert_w_lookup::sqrtwm1s; lookup_t w = -static_cast(n); // Equation 25, lookup_t y = static_cast(z * wm1es[n - 1]); // Equation 26, - // Perform the jmax fractional bisections for necessary precision. - for (int j = 0; j < jmax; ++j) + // Perform the bisections fractional bisections for necessary precision. + for (int j = 0; j < bisections; ++j) { // Equation 27. lookup_t wj = w - halves[j]; // Subtract 1/2, 1/4, 1/8 ... lookup_t yj = y * sqrtwm1s[j]; // Multiply by sqrt(1/e), ... @@ -1672,9 +1553,9 @@ namespace math { // Only 10 digits2 required (== digits10 = 3 decimal digits precision), // so just return the nearest bisection. // (Might make this test depend on size of T?) - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION - std::cout << "Bisection estimates = " << w << " " << y << std::endl; - #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION + std::cout << "W-1 Bisection estimates = " << w << " " << y << std::endl; + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION return static_cast(w); // Bisection only. } else // More than 10 digits2 precision wanted, so continue with Fukushima's Schroeder refinement. @@ -1684,9 +1565,9 @@ namespace math { // Only enough digits2 required, so just return the Schroeder refined value. // For example, for float, if (d2 <= 22) then // digits-3 returns Schroeder result up to 3 bits might be wrong. - #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0 + #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1 std::cout << "Schroeder refinement estimate = " << result << std::endl; - #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0 + #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1 return result; // Schroeder only. } else // Perform additional Halley refinement(s) to ensure that diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 7c2375141..bddd582d1 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -26,7 +26,7 @@ using boost::multiprecision::cpp_dec_float_50; #include //#include // If available. #include // isnan, ifinite. -#include +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. #include using boost::math::policies::digits2; #include // For Lambert W lambert_w function. @@ -126,20 +126,25 @@ void test_spots(RealType) > ignore_all_policy; */ -// // Test some bad parameters to the function, with default policy and with ignore_all policy. +// Test some bad parameters to the function, with default policy and with ignore_all policy. #ifndef BOOST_NO_EXCEPTIONS BOOST_CHECK_THROW(boost::math::lambert_w0(-1.), std::domain_error); + BOOST_CHECK_THROW(boost::math::lambert_wm1(-1.), std::domain_error); BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. - // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Was If infinity should throw, now infinity. + // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Was if infinity should throw, now infinity. BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex. -#else +#else // No exceptions so set policy to ignore and check result is NaN BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits::digits > 53) + { // Multiprecision types. + epsilons *= 8; + } RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; std::cout << "Precision " << std::numeric_limits::digits10 << " decimal digits." << std::endl; @@ -245,6 +250,7 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error); } + // denorm - but might be == min or zero? if (std::numeric_limits::has_denorm == true) { // Might also return infinity like z == 0? BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::denorm_min()), std::domain_error); @@ -260,24 +266,42 @@ void test_spots(RealType) // N[productlog(-1, -0.36), 50] = -1.2227701339785059531429380734238623131735264411311 BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.36)), BOOST_MATH_TEST_VALUE(RealType, -1.2227701339785059531429380734238623131735264411311), - tolerance); // quadfloat fails -1.22277013397850595294736893808946655 at 2e-19 + 10 * tolerance); // tolerance OK for quad + // -1.2227701339785059531429380734238623131735264411311 + // -1.222770133978505953142938073423862313173526441131033 + + // Just using series approximation (switch at -0.35). + // N[productlog(-0.351), 50] = -0.72398644140937651483634596143951001600417138085814 + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)), + BOOST_MATH_TEST_VALUE(RealType, -0.72398644140937651483634596143951001600417138085814), + 2 * tolerance); // Note 2 * tolerance + // got -0.723986441409376931150560229265736446 without Halley + // exp -0.72398644140937651483634596143951001 + // got -0.72398644140937651483634596143951029 with Halley + + // Same for W-1 branch + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.351)), + BOOST_MATH_TEST_VALUE(RealType, -1.3385736984773431852492145715526995809854973408320), + 10 * tolerance); // 2 tolerance OK for quad // Near singularity and NOT using series approximation (switch at -0.35) // N[productlog(-1, -0.34), 50] BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.34)), BOOST_MATH_TEST_VALUE(RealType, -1.4512014851325470735077533710339268100722032730024), - tolerance); + 10 * tolerance); // tolerance OK for quad + // // Decreasing z until near zero. //N[productlog(-1, -0.3), 50] = -1.7813370234216276119741702815127452608215583564545 BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)), BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545), - tolerance); + 2 * tolerance); + // -1.78133702342162761197417028151274526082155835645446 //N[productlog(-1, -0.2), 50] = -2.5426413577735264242938061566618482901614749075294 BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.2)), BOOST_MATH_TEST_VALUE(RealType, -2.5426413577735264242938061566618482901614749075294), - tolerance); + 2 * tolerance); BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.1)), BOOST_MATH_TEST_VALUE(RealType, -3.577152063957297218409391963511994880401796257793), @@ -306,7 +330,7 @@ void test_spots(RealType) BOOST_MATH_TEST_VALUE(RealType, -61.686695602074505366866968627049381352503620377944), tolerance); - // z nearly too small + // z nearly too small. BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2e-26)), BOOST_MATH_TEST_VALUE(RealType, -63.322302839923597803393585145387854867226970485197), tolerance* 2); @@ -323,9 +347,7 @@ void test_spots(RealType) // N[productlog(-1, -10 ^ -26), 50] = -31.067172842017230842039496250208586707880448763222 BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-26)), BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868), - tolerance); - - // z == zero. + tolerance); // -64.0265121 if (std::numeric_limits::has_infinity) { @@ -338,19 +360,17 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error); } - // Tests for too big and too small to use lookup table. + // W0 Tests for too big and too small to use lookup table. // Exactly W = 64, not enough to be OK for lookup. - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348e+29)), // Fails 63.999989810930515 != 64.0 difference1.59204e-07 - //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348e+29)), - // fails Argument z = 3.9904954117194347e+29 is too large! (Should not occur, please report.) - // i:\modular - boost\libs\math\test\test_lambert_w.cpp(345) : last checkpoint - // Corrected with an <= test rather than an < + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348050619127737142206366920907815909119e+29)), BOOST_MATH_TEST_VALUE(RealType, 64.0), tolerance); // Just below z for F[64] BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.99045411719434e+29)), - BOOST_MATH_TEST_VALUE(RealType, 63.999989810930515), tolerance); + BOOST_MATH_TEST_VALUE(RealType, 63.999989810930513468726486827408823607175844852495), tolerance); + // Fails for quad_float -1.22277013397850595265 + // -1.22277013397850595319 // Just too big, so using log approx and Halley refinement. BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29)), @@ -362,42 +382,37 @@ void test_spots(RealType) BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677), 0.00002); // 0.00001 fails. - // Similar tests for W-1 branch lambert_wm1(-1.0264389699511283e-26) = -64.000000000000000 + // Similar too near zero tests for W-1 branch + // lambert_wm1(-1.0264389699511283e-26) = -64.000000000000000 // Exactly z for W=-64 - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.0264389699511282259046957018510946438e-26)), + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.026438969951128225904695701851094643838952857740385870e-26)), BOOST_MATH_TEST_VALUE(RealType, -64.000000000000000000000000000000000000), - tolerance); + 2 * tolerance); // Just more negative than G[64 max] = wm1zs[63] so can't use lookup table. BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.5e-27)), BOOST_MATH_TEST_VALUE(RealType, -65.953279000145077719128800110134854577850889171784), - tolerance); + tolerance); // -65.9532776 // Just less negative than G[64 max] = wm1zs[63] so can use lookup table. BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.1e-26)), BOOST_MATH_TEST_VALUE(RealType, -63.929686062157630858625440758283127600360210072859), tolerance); - - - - - - - // N[productlog(-1, -10 ^ -26), 50] = -31.067172842017230842039496250208586707880448763222 - //BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-26)), - // BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868L), - // tolerance); + // N[productlog(-1, -10 ^ -26), 50] = -31.067172842017230842039496250208586707880448763222 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-26)), + BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868), + tolerance); // 1e-28 is too small // N[productlog(-1, -10 ^ -28), 50] = -31.067172842017230842039496250208586707880448763222 - //BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-28)), - // BOOST_MATH_TEST_VALUE(RealType, -68.702163291525429160769761667024460023336801014578L), - // tolerance); + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-28)), + BOOST_MATH_TEST_VALUE(RealType, -68.702163291525429160769761667024460023336801014578), + tolerance); // Check for overflow when using a double (including when using for approximate value for refinement for higher precision). - // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 + // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 //BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e30)), // BOOST_MATH_TEST_VALUE(RealType, -73.373110313822976797067478758120874529181611813766), // tolerance); @@ -406,6 +421,9 @@ void test_spots(RealType) // : Error in function boost::math::lambert_wm1() : // Argument z = -1.00000002e+30 out of range(z < -exp(-1) = -3.6787944) for Lambert W - 1 branch! + BOOST_CHECK_THROW(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e30)), std::domain_error); + + // Too negative BOOST_CHECK_THROW(lambert_wm1(-0.5), std::domain_error); // This fails for fixed_point type used for other tests because out of range? @@ -427,60 +445,12 @@ void test_spots(RealType) // : no appropriate default constructor available // TODO ??????????? - -/* - if (std::numeric_limits::is_specialized) - { // Check +/- values near to zero. - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(std::numeric_limits::epsilon()), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-std::numeric_limits::epsilon()), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - } // is_specialized - - // Check infinite if possible. - if (std::numeric_limits::has_infinity) - { - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(+std::numeric_limits::infinity()), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-std::numeric_limits::infinity()), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - } - - // Check NaN if possible. - if (std::numeric_limits::has_quiet_NaN) - { - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(+std::numeric_limits::quiet_NaN()), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-std::numeric_limits::quiet_NaN()), - BOOST_MATH_TEST_VALUE(RealType, 0.0), - tolerance); - } - */ - - // Checks on input that should throw. - // This should throw when implemented. - - //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(-0.5), - //BOOST_MATH_TEST_VALUE(RealType, 0.0), tolerance); - // unknown location : fatal error : in "test_types": - //class boost::exception_detail::clone_impl >: - // Error in function boost::math::lambert_w0(): - // Argument z = -0.5 out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?). - BOOST_CHECK_THROW(lambert_w0(-0.5), std::domain_error); -} //template void test_spots(RealType) + } //template void test_spots(RealType) BOOST_AUTO_TEST_CASE(test_types) { BOOST_MATH_CONTROL_FP; - // BOOST_TEST_MESSAGE( output only appears if command line has --log_level="message" + // BOOST_TEST_MESSAGE output only appears if command line has --log_level="message" // or call set_threshold_level function: boost::unit_test_framework::unit_test_log.set_threshold_level(boost::unit_test_framework::log_messages); BOOST_TEST_MESSAGE("Test Lambert W function for several types."); @@ -494,11 +464,12 @@ BOOST_AUTO_TEST_CASE(test_types) test_spots(0.0L); // long double } - // TODO - renable these tests when lambert_wm1 lookup table complete // Multiprecision types: + test_spots(static_cast(0)); + test_spots(static_cast(0)); + test_spots(static_cast(0)); //test_spots(static_cast(0)); - //test_spots(static_cast(0)); - //test_spots(static_cast(0)); + // Fixed-point types: // Some fail 0.1 to 1.0 ??? @@ -664,7 +635,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values) // Would not expect to get a result closer than sqrt(epsilon)? } // if (std::numeric_limits::is_specialized) - // Not using near_singularity series approximation. + // Not using near_singularity series approximation. BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)), BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545), // Output from https://www.wolframalpha.com/input/ @@ -714,6 +685,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values) // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 tolerance); + // std::numeric_limits::min std::cout.precision(std::numeric_limits::max_digits10); std::cout << "(std::numeric_limits::min)() " << (std::numeric_limits::min)() << std::endl; @@ -722,6 +694,8 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values) // N[productlog[-1, -2.2250738585072014e-308],50] = -714.96865723796647086868547560654825435542227693935 tolerance); + + // For z = 0, W = -infinity if (std::numeric_limits::has_infinity) { diff --git a/test/test_lambert_w0_precision_high.cpp b/test/test_lambert_w0_precision_high.cpp index 0d1d19193..e69e297ad 100644 --- a/test/test_lambert_w0_precision_high.cpp +++ b/test/test_lambert_w0_precision_high.cpp @@ -15,7 +15,7 @@ #include // boost::exception #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include -#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. #include // boost::multiprecision::cpp_dec_float_50 using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. diff --git a/test/test_lambert_w0_precision_low.cpp b/test/test_lambert_w0_precision_low.cpp index 0ee840c42..6865d87e4 100644 --- a/test/test_lambert_w0_precision_low.cpp +++ b/test/test_lambert_w0_precision_low.cpp @@ -15,7 +15,7 @@ #include // boost::exception #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include -#include "test_value.hpp" // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. // Built-in/fundamental Quad 128-bit type, if available. #ifdef BOOST_HAS_FLOAT128 From 21ccf8b18314605fd57e42b95e19e7ae357e9720 Mon Sep 17 00:00:00 2001 From: pabristow Date: Fri, 17 Nov 2017 17:57:45 +0000 Subject: [PATCH 23/71] More testing near zero and some typos fixed. --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 9 ++++- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 15 +++++++- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 53 ++++++++++++++------------ example/lambert_w_simple_examples.cpp | 10 +++-- test/test_lambert_w.cpp | 17 +++++---- 11 files changed, 71 insertions(+), 45 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index ead0f0445..80384743b 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: November 13, 2017 at 15:16:30 GMT

        Last revised: November 17, 2017 at 17:52:11 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index e5556e7ba..2aa00f2d3 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -2444,6 +2444,13 @@
      • +

        required

        +
        +
        • +

      • riemann_zeta

        • C99 and C++ TR1 C-style Functions

          • diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 6318b09f4..d00036fb9 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 04b5fff61..3414e187a 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 6320b126c..05fe506db 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 571518615..e10aa67ad 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -4851,6 +4851,7 @@

      • message

      • range

      • refinement

        • +

      • required

      • small

      • W

      • zero

        • @@ -6350,6 +6351,13 @@
      • +

        required

        +
        +
        • +

      • Riemann Zeta Function

        • accuracy

          • @@ -6644,7 +6652,10 @@

        • Setting the Maximum Interval Halvings and Memory Requirements

          -
          +

        • set_zero

          diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index cf170ede0..dd23a8fae 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index b83c15ba1..2412f4240 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 8724afa34..d6fa88f5c 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -41,9 +41,9 @@ In the graphs below, the red line is the W0 branch, and the blue line the W-1 br [graph lambert_w_graph_big_w] -There is a singularity where the branches meet at argument [^z = -1/e] and [^W = -1 = -0.367879]. +There is a singularity where the branches meet at argument [^z = -1/e] [cong] [^ -0.367879...] and [^W = -1]. -This implementation computes the two real branches W0 and W-1 (not complex) +This implementation computes the two real (not complex) branches W0 and W-1 with the functions `lambert_w0` and `lambert_wm2` from the first [^z] argument. The final __Policy argument is optional and can be used to control the behaviour of the function: @@ -74,7 +74,7 @@ Some examples follow: [lambert_w_simple_examples_0] -Other floating-point types can be used too, here float. +Other floating-point types can be used too, here `float`. It is convenient to use function `show_value` to display all potentially significant decimal digits for the type. @@ -82,7 +82,7 @@ for the type. [lambert_w_simple_examples_1] Example of an integer argument to lambert_w, -showing that an integer is correctly promoted to a `double`. +showing that an 'int' literal is correctly promoted to a `double`. [lambert_w_simple_examples_2] @@ -91,20 +91,21 @@ Using multiprecision types to get much higher precision is painless. [lambert_w_simple_examples_3] [warning When using multiprecision, take great care not to -construct or assign non-integers from `double` silently losing precision.] +construct or assign non-integers from `double`, `float`... silently losing precision.] -Using multiprecision types to get multiprecision precision wrong! +Using multiprecision types to get multiprecision precision wrong is all too easy! [lambert_w_simple_examples_4] -Note the spurious non-zero decimal digits appearing after digit 17 in the argument 0.9000000000000000...! + +[note See spurious non-zero decimal digits appearing after digit 17 in the argument 0.9000000000000000...!] See the correct result constructing from a decimal digit string "0.9": [lambert_w_simple_examples_4a] -Note the expected zeros for all places up to 50, and the correct result! +Note the expected zeros for all places up to 50 - and the correct result! -(It is just as easy to compute much higher precisions, +(It is just as easy to compute even higher precisions, at least to thousands of decimal digits, but not shown here for brevity. See [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] ). @@ -122,7 +123,7 @@ and to control what action to take on errors: [lambert_w_simple_examples_error_message_1] Show error reporting if pass a value to `lambert_w0` that is out of range, -and probably was meant to be passed to `lambert_m1` instead. +and probably was meant to be passed to `lambert_wm1` instead. [lambert_w_simple_examples_out_of_range] @@ -135,25 +136,26 @@ The full source of these examples is at [@../../example/lambert_w_simple_example A typical example of a practical application is estimating the current flow through a diode with series resistance from a paper by Banwell and Jayakumar. -Having the Lambert_w function available makes it simple to reproduce the plot Fig 2 in their paper -comparing estimates using with Lambert W function and some actual measurements. +Having the Lambert W function available makes it simple to reproduce the plot +in their paper (Fig 2) comparing estimates using with Lambert W function +and some actual measurements. The colored curves show the effect of various series resistance on the current compared to an extrapolated line in grey with no internal (or external) resistance. Two formulae relating the diode current and effect of series resistance can be combined, but yield an otherwise intractable equation relating the current versus voltage -with a varying series resistance, but was reformulated as a +with a varying series resistance. This was reformulated as a generalized equation in terms of the Lambert W function: Banwell and Jakaumar equation 5 [sixemspace][space] I(V) = [mu] V[sub T]/ R [sub S] [dot] W[sub 0](I[sub 0] R[sub S] / ([mu] V[sub T])) -using these variables +Using these variables [lambert_w_diode_graph_1] -can be rendered in C++ +the formula can be rendered in C++ [lambert_w_diode_graph_2] @@ -178,7 +180,8 @@ The principal value of the Lambert W-function is implemented in the Wolfram Lang __WolframAlpha has provided some reference values for testing. -For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651... +For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] +is 0.56714329040978387299996866221035554975381578718651... Also the [@https://www.wolframalpha.com Wolfram language] command: [^N\[ProductLog\[-1\], 50\]] @@ -221,7 +224,7 @@ but may be slightly more intuitive than specifying precision in bits. To show the various stages the example below shows `float` evaluation of Lambert W at varying precisions specified using a policy with `digits10` increasing from 1 to 9. -For float, this covers the full precision range as `max_digits10 = 9`. +For `float`, this covers the full precision range as `max_digits10 = 9`: [lambert_w_precision_1] @@ -230,7 +233,7 @@ The output for ['z = 1.F] is: [lambert_w_precision_output_1] showing no improvement from the Halley refinement, but for ['z = 10.F] -needs Halley refinement to get the last bit or two correct. +we need a Halley refinement (or few) to get the last bit or two correct. [lambert_w_precision_output_1a] @@ -307,7 +310,7 @@ and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 [br] * `z < std::numeric_limits::min()`, means that z is denormalized (if `std::numeric_limits::has_denorm_min == true`), for example: - r = lambert_wm1(std::numeric_limits::denorm_min()); +`r = lambert_wm1(std::numeric_limits::denorm_min());` and will give a message like: @@ -352,7 +355,7 @@ For speed, several implementations avoid evaluation of a test using the exponential function calculating that a single refinement step will suffice, but these rarely get to the best result possible. -For the most precise results possible, for C++, close to the nearest representation for the type, +For the most precise results possible, for C++, closest to the nearest representation for the type, it is usually necessary to use a higher precision type for intermediate computation, finally casting back to the smaller desired result type. This strategy is used by Maple and Wolfram, for example, using arbitrary precision arithmetic, @@ -399,7 +402,8 @@ We also considered using __newton method. but concluded that since Newton/Raphson's method takes typically 6 iterations to converge within tolerance, whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ulp, so Newton/Raphson's method unlikely to be quicker -than the additional cost of computating the 2nd derivative for Halley's method. +than the additional cost of computating the 2nd derivative for Halley's method, +in this case requiring an expensive exponential function evaluation on each step. [h4:faster_implementation Implementing Faster Algorithms] @@ -424,7 +428,8 @@ with a known small error bound (several __ulp) over nearly all the range of ['z] However, though these give results within several __epsilon of the nearest representable result, they do not get as close as is very often possible with further refinement, usually to within one or two __epsilon. -A mean difference was computed to express the typical error and is often about 0.5 epsilon. +A mean difference was computed to express the typical error and is often about 0.5 epsilon, +the theoretical minimum. For speed during the bisection, Fukushima produces lookup tables of powers of e and z for integral Lambert W. There are 64 elements in these tables. The FORTRAN version (and the C++ translation by Veberic) @@ -450,7 +455,7 @@ This is to allow for future use at higher precision, up to platforms that use 12 (hardware or software) for `long double`. The accuracy of the tables was confirmed using __WolframAlpha and agrees at the 37th decimal place, -so ensuring that the value is read into even `long double` to the nearest representation. +so ensuring that the value is read into even 128-bit `long double` to the nearest representation. [h5:higher_precision Higher precision] @@ -487,7 +492,7 @@ This gives a useful precision, and this guess can be returned by setting the pre r = lambert_w0(z, policy >()); // lambert_wm1(3.9999999999999997e+29, policy >() ) = 64.001325187470187 -Analogously, for Lambert W-1 branch, tiny values very near zero, W > 64 cannot be computed using the lookup table. +Similarly, for Lambert W-1 branch, tiny values very near zero, W > 64 cannot be computed using the lookup table. For this region, an approximation followed by a few (usually 3) Halley refinements. See __lambert_w_wm1_near_zero. diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp index a60d582bb..c52dd22ae 100644 --- a/example/lambert_w_simple_examples.cpp +++ b/example/lambert_w_simple_examples.cpp @@ -210,13 +210,15 @@ int main() overflow_error > throw_policy; - std::cout << "Lambert W (" << z << ") = " << lambert_w0(z) << std::endl; // 0.23675531078855930 - std::cout << "\nLambert W (" << z << ", throw_policy()) = " << lambert_w0(z, throw_policy()) << std::endl; + std::cout << "Lambert W (" << z << ") = " << lambert_w0(z) + << std::endl; // 0.23675531078855930 + std::cout << "\nLambert W (" << z << ", throw_policy()) = " + << lambert_w0(z, throw_policy()) << std::endl; //] //[/lambert_w_simple_example_error_policies] } { - // Show error reporting if pass a value to lambert_w0 that is out of range, - // and probably was meant to be passed to lambert_m1 instead. + // Show error reporting from passing a value to lambert_w0 that is out of range, + // and probably was meant to be passed to lambert_wm1 instead. //[lambert_w_simple_examples_out_of_range double z = -1.; double r = lambert_w0(z); diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index bddd582d1..1bd9b85bd 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -143,7 +143,7 @@ void test_spots(RealType) int epsilons = 1; if (std::numeric_limits::digits > 53) { // Multiprecision types. - epsilons *= 8; + epsilons *= 8; // (Perhaps needed because need slightly longer (55) reference values?). } RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; @@ -153,7 +153,7 @@ void test_spots(RealType) std::cout.setf(std::ios_base::showpoint); // show trailing significant zeros. std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl; - // Test at singularity. Three tests because some failed previously - bug now gone? + // Test at singularity. //RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527); RealType singular_value = -exp_minus_one(); // -exp(-1) = -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 @@ -182,6 +182,7 @@ void test_spots(RealType) // For example: N[lambert_w[1], 50] outputs: // 0.56714329040978387299996866221035554975381578718651 + // At branch junction singularity. BOOST_CHECK_CLOSE_FRACTION( // Check -exp(-1) ~= -0.367879450 == -1 lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527)), BOOST_MATH_TEST_VALUE(RealType, -1.), @@ -289,9 +290,9 @@ void test_spots(RealType) BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.34)), BOOST_MATH_TEST_VALUE(RealType, -1.4512014851325470735077533710339268100722032730024), 10 * tolerance); // tolerance OK for quad - // + // - // Decreasing z until near zero. + // Decreasing z until near zero (small z) . //N[productlog(-1, -0.3), 50] = -1.7813370234216276119741702815127452608215583564545 BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)), BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545), @@ -369,7 +370,7 @@ void test_spots(RealType) // Just below z for F[64] BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.99045411719434e+29)), BOOST_MATH_TEST_VALUE(RealType, 63.999989810930513468726486827408823607175844852495), tolerance); - // Fails for quad_float -1.22277013397850595265 + // Fails for quad_float -1.22277013397850595265 // -1.22277013397850595319 // Just too big, so using log approx and Halley refinement. @@ -382,9 +383,9 @@ void test_spots(RealType) BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677), 0.00002); // 0.00001 fails. - // Similar too near zero tests for W-1 branch + // Similar too near zero tests for W-1 branch // lambert_wm1(-1.0264389699511283e-26) = -64.000000000000000 - // Exactly z for W=-64 + // Exactly z for W=-64 BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.026438969951128225904695701851094643838952857740385870e-26)), BOOST_MATH_TEST_VALUE(RealType, -64.000000000000000000000000000000000000), 2 * tolerance); @@ -423,7 +424,7 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e30)), std::domain_error); - // Too negative + // Too negative BOOST_CHECK_THROW(lambert_wm1(-0.5), std::domain_error); // This fails for fixed_point type used for other tests because out of range? From 80b4bf3bef1b89f2ab590f94b5ee1403a0ff2bba Mon Sep 17 00:00:00 2001 From: pabristow Date: Sat, 18 Nov 2017 12:02:51 +0000 Subject: [PATCH 24/71] Change to jamfile --- .../elliptic_table_100_msvc_X86_SSE2.qbk | 8 +- doc/roots/root_comparison_tables_msvc.qbk | 10 +-- doc/roots/roots_table_100_msvc_X86_SSE2.qbk | 24 ++--- doc/sf/lambert_w.qbk | 4 + test/Jamfile.v2 | 89 ++++++++++--------- 5 files changed, 71 insertions(+), 64 deletions(-) diff --git a/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk b/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk index e20c18bbe..bf06d6572 100644 --- a/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk +++ b/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk @@ -13,8 +13,8 @@ Compiled in optimise mode., _X86_SSE2] [table:elliptic root with radius 28 and arc length 300) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 5][ 750][1.20][ -1][ ][ 9][ 1312][1.56][ 1][ ][ 9][ 1312][1.58][ 1][ ][ 11][993750][1.47][ -3][ ]] -[[Newton ][ 3][ 765][1.22][ -1][ ][ 4][ 1000][1.19][ 1][ ][ 4][ 1015][1.23][ 1][ ][ 5][806250][1.19][ 0][ ]] -[[Halley ][ 2][ 625][[role blue 1.00]][ 0][ ][ 3][ 843][[role blue 1.00]][ 3][ ][ 3][ 828][[role blue 1.00]][ 3][ ][ 4][676562][[role blue 1.00]][ 0][ ]] -[[Schr'''ö'''der][ 3][ 828][1.32][ -1][ ][ 6][ 1484][1.76][ 1][ ][ 6][ 1500][1.81][ 1][ ][ 5][845312][1.25][ -2][ ]] +[[TOMS748 ][ 5][ 734][1.09][ -1][ ][ 9][ 1312][1.40][ 1][ ][ 9][ 1312][1.40][ 1][ ][ 11][989062][1.46][ -3][ ]] +[[Newton ][ 3][ 765][1.14][ -1][ ][ 4][ 1015][1.08][ 1][ ][ 4][ 1000][1.07][ 1][ ][ 5][801562][1.18][ 0][ ]] +[[Halley ][ 2][ 671][[role blue 1.00]][ 0][ ][ 3][ 937][[role blue 1.00]][ 3][ ][ 3][ 937][[role blue 1.00]][ 3][ ][ 4][676562][[role blue 1.00]][ 0][ ]] +[[Schr'''ö'''der][ 3][ 875][1.30][ -1][ ][ 6][ 1625][1.73][ 1][ ][ 6][ 1609][1.72][ 1][ ][ 5][846875][1.25][ -2][ ]] ] [/end of table root] diff --git a/doc/roots/root_comparison_tables_msvc.qbk b/doc/roots/root_comparison_tables_msvc.qbk index 04d5db457..7be783fb3 100644 --- a/doc/roots/root_comparison_tables_msvc.qbk +++ b/doc/roots/root_comparison_tables_msvc.qbk @@ -11,9 +11,9 @@ http://www.boost.org/LICENSE_1_0.txt). [table:cbrt_4 Cube root(28) for float, double, long double and cpp_bin_float_50 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algorithm][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[cbrt ][ 0][187500][[role blue 1.0]][ 0][ ][ 0][171875][[role blue 1.0]][ 1][ ][ 0][187500][[role blue 1.0]][ 1][ ][ 0][7468750][[role blue 1.0]][ 0][ ]] -[[TOMS748 ][ 8][718750][3.8][ -1][ ][ 11][921875][[role red 5.4]][ 2][ ][ 11][906250][[role red 4.8]][ 2][ ][ 6][52812500][[role red 7.1]][ -2][ ]] -[[Newton ][ 5][500000][2.7][ 0][ ][ 6][515625][3.0][ 0][ ][ 6][515625][2.8][ 0][ ][ 2][7781250][[role blue 1.0]][ 0][ ]] -[[Halley ][ 3][484375][2.6][ 0][ ][ 4][515625][3.0][ 0][ ][ 4][515625][2.8][ 0][ ][ 2][19375000][2.6][ 0][ ]] -[[Schr'''ö'''der][ 4][515625][2.8][ 0][ ][ 5][515625][3.0][ 0][ ][ 5][531250][2.8][ 0][ ][ 2][24453125][3.3][ 0][ ]] +[[cbrt ][ 0][187500][[role blue 1.0]][ 0][ ][ 0][171875][[role blue 1.0]][ 1][ ][ 0][171875][[role blue 1.0]][ 1][ ][ 0][7437500][[role blue 1.0]][ 0][ ]] +[[TOMS748 ][ 8][718750][3.8][ -1][ ][ 11][921875][[role red 5.4]][ 2][ ][ 11][921875][[role red 5.4]][ 2][ ][ 6][52484375][[role red 7.1]][ -2][ ]] +[[Newton ][ 5][468750][2.5][ 0][ ][ 6][500000][2.9][ 0][ ][ 6][500000][2.9][ 0][ ][ 2][7703125][[role blue 1.0]][ 0][ ]] +[[Halley ][ 3][484375][2.6][ 0][ ][ 4][531250][3.1][ 0][ ][ 4][531250][3.1][ 0][ ][ 2][18765625][2.5][ 0][ ]] +[[Schr'''ö'''der][ 4][515625][2.8][ 0][ ][ 5][531250][3.1][ 0][ ][ 5][515625][3.0][ 0][ ][ 2][23203125][3.1][ 0][ ]] ] [/end of table cbrt_4] diff --git a/doc/roots/roots_table_100_msvc_X86_SSE2.qbk b/doc/roots/roots_table_100_msvc_X86_SSE2.qbk index b5ecddb48..d8501ef22 100644 --- a/doc/roots/roots_table_100_msvc_X86_SSE2.qbk +++ b/doc/roots/roots_table_100_msvc_X86_SSE2.qbk @@ -14,24 +14,24 @@ Fraction of full accuracy 1 [table:root_5 5th root(28) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 7][ 673][[role blue 1.00]][ 0][ ][ 11][ 964][1.29][ 1][ ][ 11][ 962][1.28][ 1][ ][ 12][142500][[role red 7.41]][ 0][ ]] -[[Newton ][ 3][ 743][1.10][ 0][ ][ 4][ 746][[role blue 1.00]][ -1][ ][ 4][ 750][[role blue 1.00]][ -1][ ][ 6][19218][[role blue 1.00]][ 0][ ]] -[[Halley ][ 2][ 732][1.09][ 0][ ][ 3][ 770][[role blue 1.03]][ 0][ ][ 3][ 778][[role blue 1.04]][ 0][ ][ 4][35937][1.87][ 0][ ]] -[[Schr'''ö'''der][ 2][ 756][1.12][ 0][ ][ 3][ 768][[role blue 1.03]][ -1][ ][ 3][ 770][[role blue 1.03]][ -1][ ][ 4][46562][2.42][ 0][ ]] +[[TOMS748 ][ 7][ 667][[role blue 1.00]][ 0][ ][ 11][ 951][1.28][ 1][ ][ 11][ 971][1.31][ 1][ ][ 12][140000][[role red 7.47]][ 0][ ]] +[[Newton ][ 3][ 743][1.11][ 0][ ][ 4][ 745][[role blue 1.00]][ -1][ ][ 4][ 742][[role blue 1.00]][ -1][ ][ 6][18750][[role blue 1.00]][ 0][ ]] +[[Halley ][ 2][ 735][1.10][ 0][ ][ 3][ 760][[role blue 1.02]][ 0][ ][ 3][ 764][[role blue 1.03]][ 0][ ][ 4][35781][1.91][ 0][ ]] +[[Schr'''ö'''der][ 2][ 745][1.12][ 0][ ][ 3][ 764][[role blue 1.03]][ -1][ ][ 3][ 760][[role blue 1.02]][ -1][ ][ 4][45000][2.40][ 0][ ]] ] [/end of table root] [table:root_7 7th root(28) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 12][ 956][1.24][ 1][ ][ 15][ 1217][1.55][ 2][ ][ 15][ 1217][1.54][ 2][ ][ 14][185937][[role red 6.88]][ 0][ ]] -[[Newton ][ 5][ 773][[role blue 1.00]][ 0][ ][ 6][ 785][[role blue 1.00]][ 0][ ][ 6][ 790][[role blue 1.00]][ 0][ ][ 8][27031][[role blue 1.00]][ 0][ ]] -[[Halley ][ 4][ 801][[role blue 1.04]][ 0][ ][ 5][ 840][1.07][ 0][ ][ 5][ 820][[role blue 1.04]][ 0][ ][ 6][56406][2.09][ 0][ ]] -[[Schr'''ö'''der][ 5][ 839][1.09][ 0][ ][ 6][ 839][1.07][ 0][ ][ 6][ 840][1.06][ 0][ ][ 7][80468][2.98][ 0][ ]] +[[TOMS748 ][ 12][ 942][1.24][ 1][ ][ 15][ 1212][1.56][ 2][ ][ 15][ 1273][1.51][ 2][ ][ 14][202968][[role red 6.95]][ 0][ ]] +[[Newton ][ 5][ 760][[role blue 1.00]][ 0][ ][ 6][ 775][[role blue 1.00]][ 0][ ][ 6][ 842][[role blue 1.00]][ 0][ ][ 8][29218][[role blue 1.00]][ 0][ ]] +[[Halley ][ 4][ 793][[role blue 1.04]][ 0][ ][ 5][ 828][1.07][ 0][ ][ 5][ 901][1.07][ 0][ ][ 6][61718][2.11][ 0][ ]] +[[Schr'''ö'''der][ 5][ 823][1.08][ 0][ ][ 6][ 834][1.08][ 0][ ][ 6][ 915][1.09][ 0][ ][ 7][87656][3.00][ 0][ ]] ] [/end of table root] [table:root_11 11th root(28) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 12][ 1057][1.35][ -2][ ][ 14][ 1284][1.56][ 2][ ][ 14][ 1321][1.63][ 2][ ][ 17][282812][[role red 8.83]][ 2][ ]] -[[Newton ][ 6][ 781][[role blue 1.00]][ 0][ ][ 7][ 823][[role blue 1.00]][ 0][ ][ 7][ 809][[role blue 1.00]][ 0][ ][ 9][32031][[role blue 1.00]][ 0][ ]] -[[Halley ][ 4][ 818][[role blue 1.05]][ -1][ ][ 5][ 876][1.06][ 0][ ][ 5][ 846][[role blue 1.05]][ 0][ ][ 6][58437][1.82][ 0][ ]] -[[Schr'''ö'''der][ 6][ 882][1.13][ 0][ ][ 7][ 993][1.21][ 0][ ][ 7][ 917][1.13][ 0][ ][ 8][98750][3.08][ 0][ ]] +[[TOMS748 ][ 12][ 1146][1.35][ -2][ ][ 14][ 1335][1.57][ 2][ ][ 14][ 1354][1.59][ 2][ ][ 17][305468][[role red 9.01]][ 2][ ]] +[[Newton ][ 6][ 846][[role blue 1.00]][ 0][ ][ 7][ 850][[role blue 1.00]][ 0][ ][ 7][ 854][[role blue 1.00]][ 0][ ][ 9][33906][[role blue 1.00]][ 0][ ]] +[[Halley ][ 4][ 862][[role blue 1.02]][ -1][ ][ 5][ 896][1.05][ 0][ ][ 5][ 909][1.06][ 0][ ][ 6][63593][1.88][ 0][ ]] +[[Schr'''ö'''der][ 6][ 918][1.09][ 0][ ][ 7][ 942][1.11][ 0][ ][ 7][ 970][1.14][ 0][ ][ 8][107656][3.18][ 0][ ]] ] [/end of table root] diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index d6fa88f5c..21eeffba9 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -322,6 +322,10 @@ Denormalized values of z are not supported for Lambert W-1 (because not all flo and anyway it only covers a tiny fraction of the range of possible z arguments values. A domain_error exception is thrown. (This behaviour might be changed to return infinity, as for z == 0). +[h4:compilers Compilers] + +The code has been tested on VS 15.4.4 and GCC 7.1.0 but it is expected to work on all C++ compilers. + [h5:diagnostics Diagnostics Macros] Several macros are provided to output diagnostic information (potentially [*much] output). diff --git a/test/Jamfile.v2 b/test/Jamfile.v2 index 3246e0d91..fded1fd04 100644 --- a/test/Jamfile.v2 +++ b/test/Jamfile.v2 @@ -402,7 +402,7 @@ test-suite special_fun : : # input files : # requirements TEST_LDOUBLE - intel:off + intel:off : test_igamma_inva_long_double ] [ run test_igamma_inva.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework : # command line @@ -414,6 +414,9 @@ test-suite special_fun : [ run test_instantiate1.cpp test_instantiate2.cpp ] [ run test_jacobi.cpp pch_light ../../test/build//boost_unit_test_framework ] [ run test_laguerre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ] + + [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework ] + [ run test_legendre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework : : : [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : "-Bstatic -lquadmath -Bdynamic" ] ] [ run test_ldouble_simple.cpp ../../test/build//boost_unit_test_framework ] # Needs to run in release mode, as it's rather slow: @@ -977,53 +980,53 @@ test-suite misc : [ compile e_float_concept_check.cpp : [ check-target-builds ../config//has_e_float : : no ] off ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST1 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_1 ] + : : : TEST1 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_1 ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST1A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_1a ] + : : : TEST1A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_1a ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST2 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_2 ] + : : : TEST2 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_2 ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST2A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_2a ] + : : : TEST2A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_2a ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST3 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_3 ] + : : : TEST3 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_3 ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST3A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_3a ] + : : : TEST3A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_3a ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST4 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_4 ] + : : : release TEST4 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_4 ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST5 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_5 ] + : : : release TEST5 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_5 ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST6 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_6 ] + : : : TEST6 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_6 ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST6A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_6a ] + : : : TEST6A [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_6a ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST7 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_7 ] + : : : release TEST7 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_7 ] [ run tanh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST8 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] - [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : - tanh_sinh_quadrature_test_8 ] + : : : release TEST8 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] : + tanh_sinh_quadrature_test_8 ] [ run sinh_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework : : : release [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] ] @@ -1031,22 +1034,22 @@ test-suite misc : : : : TEST1 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] : exp_sinh_quadrature_test_1 ] [ run exp_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST2 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + : : : release TEST2 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] : exp_sinh_quadrature_test_2 ] [ run exp_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : TEST3 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + : : : TEST3 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] : exp_sinh_quadrature_test_3 ] [ run exp_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST4 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + : : : release TEST4 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] : exp_sinh_quadrature_test_4 ] [ run exp_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST5 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + : : : release TEST5 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] : exp_sinh_quadrature_test_5 ] [ run exp_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST6 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + : : : release TEST6 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] : exp_sinh_quadrature_test_6 ] [ run exp_sinh_quadrature_test.cpp ../../test/build//boost_unit_test_framework - : : : release TEST7 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] + : : : release TEST7 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : -lquadmath ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] : exp_sinh_quadrature_test_7 ] [ run compile_test/exp_sinh_incl_test.cpp compile_test_main : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax ] ] From 781fda44b2a81b05b00137531098f3b922730e2c Mon Sep 17 00:00:00 2001 From: pabristow Date: Sat, 18 Nov 2017 12:27:34 +0000 Subject: [PATCH 25/71] add three qbk files --- .../elliptic_table_100_msvc_X86_SSE2.qbk | 8 +++---- doc/roots/root_comparison_tables_msvc.qbk | 10 ++++---- doc/roots/roots_table_100_msvc_X86_SSE2.qbk | 24 +++++++++---------- 3 files changed, 21 insertions(+), 21 deletions(-) diff --git a/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk b/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk index bf06d6572..eb2c72079 100644 --- a/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk +++ b/doc/roots/elliptic_table_100_msvc_X86_SSE2.qbk @@ -13,8 +13,8 @@ Compiled in optimise mode., _X86_SSE2] [table:elliptic root with radius 28 and arc length 300) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 5][ 734][1.09][ -1][ ][ 9][ 1312][1.40][ 1][ ][ 9][ 1312][1.40][ 1][ ][ 11][989062][1.46][ -3][ ]] -[[Newton ][ 3][ 765][1.14][ -1][ ][ 4][ 1015][1.08][ 1][ ][ 4][ 1000][1.07][ 1][ ][ 5][801562][1.18][ 0][ ]] -[[Halley ][ 2][ 671][[role blue 1.00]][ 0][ ][ 3][ 937][[role blue 1.00]][ 3][ ][ 3][ 937][[role blue 1.00]][ 3][ ][ 4][676562][[role blue 1.00]][ 0][ ]] -[[Schr'''ö'''der][ 3][ 875][1.30][ -1][ ][ 6][ 1625][1.73][ 1][ ][ 6][ 1609][1.72][ 1][ ][ 5][846875][1.25][ -2][ ]] +[[TOMS748 ][ 5][ 828][1.15][ -1][ ][ 9][ 1453][1.52][ 1][ ][ 9][ 1437][1.56][ 1][ ][ 11][1326562][1.46][ -3][ ]] +[[Newton ][ 3][ 890][1.24][ -1][ ][ 4][ 1156][1.21][ 1][ ][ 4][ 1171][1.27][ 1][ ][ 5][1089062][1.20][ 0][ ]] +[[Halley ][ 2][ 718][[role blue 1.00]][ 0][ ][ 3][ 953][[role blue 1.00]][ 3][ ][ 3][ 921][[role blue 1.00]][ 3][ ][ 4][909375][[role blue 1.00]][ 0][ ]] +[[Schr'''ö'''der][ 3][ 906][1.26][ -1][ ][ 6][ 1703][1.79][ 1][ ][ 6][ 1687][1.83][ 1][ ][ 5][1131250][1.24][ -2][ ]] ] [/end of table root] diff --git a/doc/roots/root_comparison_tables_msvc.qbk b/doc/roots/root_comparison_tables_msvc.qbk index 7be783fb3..ce39f06c3 100644 --- a/doc/roots/root_comparison_tables_msvc.qbk +++ b/doc/roots/root_comparison_tables_msvc.qbk @@ -11,9 +11,9 @@ http://www.boost.org/LICENSE_1_0.txt). [table:cbrt_4 Cube root(28) for float, double, long double and cpp_bin_float_50 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algorithm][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[cbrt ][ 0][187500][[role blue 1.0]][ 0][ ][ 0][171875][[role blue 1.0]][ 1][ ][ 0][171875][[role blue 1.0]][ 1][ ][ 0][7437500][[role blue 1.0]][ 0][ ]] -[[TOMS748 ][ 8][718750][3.8][ -1][ ][ 11][921875][[role red 5.4]][ 2][ ][ 11][921875][[role red 5.4]][ 2][ ][ 6][52484375][[role red 7.1]][ -2][ ]] -[[Newton ][ 5][468750][2.5][ 0][ ][ 6][500000][2.9][ 0][ ][ 6][500000][2.9][ 0][ ][ 2][7703125][[role blue 1.0]][ 0][ ]] -[[Halley ][ 3][484375][2.6][ 0][ ][ 4][531250][3.1][ 0][ ][ 4][531250][3.1][ 0][ ][ 2][18765625][2.5][ 0][ ]] -[[Schr'''ö'''der][ 4][515625][2.8][ 0][ ][ 5][531250][3.1][ 0][ ][ 5][515625][3.0][ 0][ ][ 2][23203125][3.1][ 0][ ]] +[[cbrt ][ 0][203125][[role blue 1.0]][ 0][ ][ 0][234375][[role blue 1.0]][ 1][ ][ 0][203125][[role blue 1.0]][ 1][ ][ 0][10281250][[role blue 1.0]][ 0][ ]] +[[TOMS748 ][ 8][843750][[role red 4.2]][ -1][ ][ 11][1125000][[role red 4.8]][ 2][ ][ 11][1203125][[role red 5.9]][ 2][ ][ 6][71765625][[role red 7.1]][ -2][ ]] +[[Newton ][ 5][593750][2.9][ 0][ ][ 6][578125][2.5][ 0][ ][ 6][625000][3.1][ 0][ ][ 2][10062500][[role blue 1.0]][ 0][ ]] +[[Halley ][ 3][593750][2.9][ 0][ ][ 4][609375][2.6][ 0][ ][ 4][593750][2.9][ 0][ ][ 2][20859375][2.1][ 0][ ]] +[[Schr'''ö'''der][ 4][593750][2.9][ 0][ ][ 5][593750][2.5][ 0][ ][ 5][609375][3.0][ 0][ ][ 2][25171875][2.5][ 0][ ]] ] [/end of table cbrt_4] diff --git a/doc/roots/roots_table_100_msvc_X86_SSE2.qbk b/doc/roots/roots_table_100_msvc_X86_SSE2.qbk index d8501ef22..e610debd1 100644 --- a/doc/roots/roots_table_100_msvc_X86_SSE2.qbk +++ b/doc/roots/roots_table_100_msvc_X86_SSE2.qbk @@ -14,24 +14,24 @@ Fraction of full accuracy 1 [table:root_5 5th root(28) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 7][ 667][[role blue 1.00]][ 0][ ][ 11][ 951][1.28][ 1][ ][ 11][ 971][1.31][ 1][ ][ 12][140000][[role red 7.47]][ 0][ ]] -[[Newton ][ 3][ 743][1.11][ 0][ ][ 4][ 745][[role blue 1.00]][ -1][ ][ 4][ 742][[role blue 1.00]][ -1][ ][ 6][18750][[role blue 1.00]][ 0][ ]] -[[Halley ][ 2][ 735][1.10][ 0][ ][ 3][ 760][[role blue 1.02]][ 0][ ][ 3][ 764][[role blue 1.03]][ 0][ ][ 4][35781][1.91][ 0][ ]] -[[Schr'''ö'''der][ 2][ 745][1.12][ 0][ ][ 3][ 764][[role blue 1.03]][ -1][ ][ 3][ 760][[role blue 1.02]][ -1][ ][ 4][45000][2.40][ 0][ ]] +[[TOMS748 ][ 7][ 795][[role blue 1.00]][ 0][ ][ 11][ 1106][1.26][ 1][ ][ 11][ 1135][1.43][ 1][ ][ 12][148750][[role red 7.50]][ 0][ ]] +[[Newton ][ 3][ 839][1.06][ 0][ ][ 4][ 879][[role blue 1.00]][ -1][ ][ 4][ 871][1.09][ -1][ ][ 6][19843][[role blue 1.00]][ 0][ ]] +[[Halley ][ 2][ 843][1.06][ 0][ ][ 3][ 903][[role blue 1.03]][ 0][ ][ 3][ 859][1.08][ 0][ ][ 4][37968][1.91][ 0][ ]] +[[Schr'''ö'''der][ 2][ 867][1.09][ 0][ ][ 3][ 920][[role blue 1.05]][ -1][ ][ 3][ 796][[role blue 1.00]][ -1][ ][ 4][47187][2.38][ 0][ ]] ] [/end of table root] [table:root_7 7th root(28) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 12][ 942][1.24][ 1][ ][ 15][ 1212][1.56][ 2][ ][ 15][ 1273][1.51][ 2][ ][ 14][202968][[role red 6.95]][ 0][ ]] -[[Newton ][ 5][ 760][[role blue 1.00]][ 0][ ][ 6][ 775][[role blue 1.00]][ 0][ ][ 6][ 842][[role blue 1.00]][ 0][ ][ 8][29218][[role blue 1.00]][ 0][ ]] -[[Halley ][ 4][ 793][[role blue 1.04]][ 0][ ][ 5][ 828][1.07][ 0][ ][ 5][ 901][1.07][ 0][ ][ 6][61718][2.11][ 0][ ]] -[[Schr'''ö'''der][ 5][ 823][1.08][ 0][ ][ 6][ 834][1.08][ 0][ ][ 6][ 915][1.09][ 0][ ][ 7][87656][3.00][ 0][ ]] +[[TOMS748 ][ 12][ 959][1.26][ 1][ ][ 15][ 1214][1.56][ 2][ ][ 15][ 1209][1.52][ 2][ ][ 14][184531][[role red 6.79]][ 0][ ]] +[[Newton ][ 5][ 764][[role blue 1.00]][ 0][ ][ 6][ 776][[role blue 1.00]][ 0][ ][ 6][ 796][[role blue 1.00]][ 0][ ][ 8][27187][[role blue 1.00]][ 0][ ]] +[[Halley ][ 4][ 795][[role blue 1.04]][ 0][ ][ 5][ 826][1.06][ 0][ ][ 5][ 865][1.09][ 0][ ][ 6][55625][2.05][ 0][ ]] +[[Schr'''ö'''der][ 5][ 826][1.08][ 0][ ][ 6][ 831][1.07][ 0][ ][ 6][ 832][[role blue 1.05]][ 0][ ][ 7][78750][2.90][ 0][ ]] ] [/end of table root] [table:root_11 11th root(28) for float, double, long double and cpp_bin_float_50 types, using _X86_SSE2 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]] [[Algo ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]] -[[TOMS748 ][ 12][ 1146][1.35][ -2][ ][ 14][ 1335][1.57][ 2][ ][ 14][ 1354][1.59][ 2][ ][ 17][305468][[role red 9.01]][ 2][ ]] -[[Newton ][ 6][ 846][[role blue 1.00]][ 0][ ][ 7][ 850][[role blue 1.00]][ 0][ ][ 7][ 854][[role blue 1.00]][ 0][ ][ 9][33906][[role blue 1.00]][ 0][ ]] -[[Halley ][ 4][ 862][[role blue 1.02]][ -1][ ][ 5][ 896][1.05][ 0][ ][ 5][ 909][1.06][ 0][ ][ 6][63593][1.88][ 0][ ]] -[[Schr'''ö'''der][ 6][ 918][1.09][ 0][ ][ 7][ 942][1.11][ 0][ ][ 7][ 970][1.14][ 0][ ][ 8][107656][3.18][ 0][ ]] +[[TOMS748 ][ 12][ 1059][1.37][ -2][ ][ 14][ 1253][1.60][ 2][ ][ 14][ 1251][1.60][ 2][ ][ 17][275468][[role red 8.81]][ 2][ ]] +[[Newton ][ 6][ 771][[role blue 1.00]][ 0][ ][ 7][ 784][[role blue 1.00]][ 0][ ][ 7][ 784][[role blue 1.00]][ 0][ ][ 9][31250][[role blue 1.00]][ 0][ ]] +[[Halley ][ 4][ 828][1.07][ -1][ ][ 5][ 831][1.06][ 0][ ][ 5][ 826][1.05][ 0][ ][ 6][56718][1.81][ 0][ ]] +[[Schr'''ö'''der][ 6][ 875][1.13][ 0][ ][ 7][ 881][1.12][ 0][ ][ 7][ 881][1.12][ 0][ ][ 8][97031][3.10][ 0][ ]] ] [/end of table root] From 9b9414c25664f113b39cf69e7188c6af880649f7 Mon Sep 17 00:00:00 2001 From: pabristow Date: Mon, 20 Nov 2017 17:03:29 +0000 Subject: [PATCH 26/71] numerous minor fixes for JM 1st comments on docs 19Nov17 --- doc/graphs/diode_iv_plot.png | Bin 35457 -> 35338 bytes doc/graphs/diode_iv_plot.svg | 2 +- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 3 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 4 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- .../root_comparison/cbrt_comparison.html | 182 +++++++++--------- .../root_comparison/elliptic_comparison.html | 56 +++--- .../root_comparison/root_n_comparison.html | 160 +++++++-------- doc/sf/lambert_w.qbk | 44 +++-- example/lambert_w_diode_graph.cpp | 3 +- example/lambert_w_simple_examples.cpp | 75 +++++--- .../math/special_functions/lambert_w.hpp | 21 +- test/test_lambert_w.cpp | 4 +- 18 files changed, 304 insertions(+), 262 deletions(-) diff --git a/doc/graphs/diode_iv_plot.png b/doc/graphs/diode_iv_plot.png index 707cdcb2fff4e5299cc23d8ebf4450ebbbf5b3e3..867a8bbdd7a078ad7f8e6348d8d63b0f4d5d0e3c 100644 GIT binary patch literal 35338 zcmeAS@N?(olHy`uVBq!ia0y~yU|h_=z-Z0E#=yW(u;AS-1_lO}VkgfK4h{~E8jh3> z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYmd8v@{eR#if3?3P6JMJY$D&2cEQ(rpmaoXvo3oPl?5Q&! zpRAd`TBm&GEVXra?85q{Y`IgdsNwu=lIH7}{r2Y$uM}Rq7T2{uU}sK``eov8=WsN z^hkAylbpKPs`S-{`u}xOW;rLmy}kYO$K(FYOG`Kzw&&k}cC1(W$FE;OtHX4+ew{RV z^3AQ;;^pt|IEIH$Pdhv7;`aRbFJHfMzjfv~xX`)XqV|`Gm6cV=`+IvYeEX-VuHG(d zT~_e%k!w#+&x^~;`E{eW>0B(dt@$yb_V+hIF|oFtJ1t9JUt3!H``eCPyO;{Tya+Th zGJ0`;|NdK5=K1%YTw5ExCHJ-%J3BkWrp=pg?ytB1_U+rAZ@02#Y^$a`KHh(MxxakW z_Pn#r?EE_l9y0mPHamLqWM}T}ZH2F|>872Z*W234%CK|i&Np{FJr|-`jKHllOEzK_MZh^>KR*OiWm&?0>vA zdVA6Pd$w=hypb?U@mTm=sr=oYhrhnQ-ja2d%iG&~Th2`<4-by`nvblzcAc`nn|*y< z;g1iALPA0-A~&nW#l@Apy%oB(*S%k^@Yxy3J$v?W#X7#ZwUwKjoBPk7KUYpIUbN`O z&SG^zLBWW~$iU@(vTeN5ZPTWOO+3zD@b6EhoLx=F{Q2_JrcKK_{ps`PpFf|^Um3bu zY;DxmpsDxwR!`qs{ar{{cyZTa-`QsVcikIThp#Vsc1DsR@9wUn=jK{7Ub%O_ql2SQ z&ekg;LZY&=vZA{B@%#7veSLll-yS`7Y*X%SGbLr^(Bo2KVs0KD9CNKo7rFIHWqn;A zv-8lsz15yxUWabqo}GBOZRI!Zy$p&1r^44v@XEWhqmW5pclrCethp1F-MJjj%(IOS z-Ij2WiLqm@b@{5Rwsn7YY}mFi_SHx;tl%%*EyY@{Anb z-rg4%I5IPK{QLWx+u_UG+u>{La&p#W+}W}5!quyyy;7z^+qP|U^7i(w`TO-LSk z)!P}4?5X_Bb#(3G#mZ9Vd27PNL_}12dU{$WPMnx=Ys<=lvNExT6Q@sCzxv3nc;r~G zG^@hCU$0g>o#vCb(_z?{ch@TP=JWaWdL<<#E%WBh`|#a-Me=$gUj~3yIe=h9v$IKOiWbV zvSo`)GaIkV-Cd<1*^KM!<}w_aX`FuL)%p4M@fq3K-0JG;4<9~M1o^4Izu&{#yZYI0 zWn14h8Ydh771( z`iZk=L#LjfZSK#IbfiOYm45f{@9(?$WUWMI_UtNuugAl~b7W`n^A-W8l+@JDK3Qun zW@ctVNy(pglJ9OzZf9uOx^?R<@pL!0wvNuuz`rrGQc|+BwPRvpj%-Xm?vj?a%){Sb z-09EUo}AoV*Y$CGkKEl|?pjr~>s9TG+uPS)xO_RdHWL&{B`+_zzIgevvz=dl)wkdY zJ#*&FX<58@u|>gyh7;$`iR~_XE7b7e^XK61(r0I8G6}Tv%h$d8t<)m$e&6qP3`bT5 zFTZk%``hlMqg;wD0yAgMJaqGBq=mKh>U*DO%#Z+O|A&trDSi6(_4<8Uj~+d05jZ8hT2R@I z!@*~^nQ!jjdUa*RDV*#A#m~>_ZrRT*uGjJR_xIKJPQQ7RbCvVh*VorWzX}NnwelRmXa`MDEbJm1?KiJIPI_YAsv^k4H8?W@T zuR^ds}Tu(bRKuESUs;e|sA|RX2K@4@1(gFE3kP`OmS~ z7-013#>T}Lu3ZcJtH*6&Y1!%4DmJ0&YeFqzxvI$<6Tg8 ze!s)@b+I=$r}HoOpTEq1zTKUj#qB?SR9Ka~2zVj)ck?z`dHM6=@ihyz`1$$Sr<`w` zr)q2*{MDfT#016jcjG;`=H2}@v(}T1Uv5p6Uyy=^28SYxr>AGu@h>kfDld4EEM=B6 z;KE; z-Py5F?DN^#=Ank>+1Gq>Z#%d1>3-RB?8J$VeYL+grJtAEvv==I(`>P3c78X1|M#tZ z$sZmZtod|O-6ZQuhoo_uLD`!dNwxbJ+-G7&)0`GQI5X3D#;jSJ>i$-3O^u3*I{)|g#CiT|i@6Hk-?L@7 zbNBB2NPR;?!38Il9qH@qYcQJ0;NtFXzxCbbZM8o?r8YG;U!Asd*RDzP=l?(RH8?0J zKtp84%$X~t_%fmn8piIe+8SUl5*~hC>36y4SBBkddL#^+US3|lIsLp`8?W@Se*1qO zVPVr=b^n-e`2W*s{W%teivrHDs_Pxyn0i_)Cnx8}zu)gA?P@HFpPx&8du!{_Uq!XE z`t5#kZEelRqv9`Ky!ddp z{QkqYZ_ln?zmH2pI!{BSYk6HBx70R~nseUDy1Kpoc0XIr&Ng4XetrMy)!Lq(o~^Hz zE?L5mke>eiPVTbh%O}sB+dFNV*z0R+gQJ(NU*ErWt!`vwq=cm8RI7Kd{LJ32WBC33 zJ^O=R^LrI(w!y){4NCtDxb_`6bLI>~NbNKuW8-d7=Yu!j?tZ_|+rz_S;q^yHyXWuR z*V@V&6&1B)`Ev2<`A^qAm~pT2`CO&`l@H$RS;Ql2B@!DOYnFS9@}-QOD<5}CEb)+nf{wS9hm-ni<^3#YGKLiaBx{Ztng7A`3*-MD3o z&ZqBULPAQy7r7^$TrubGm&^V!`)X!}t&O_4E_QeNwXYvPGCsJov$%Dd=oHaAhYHKe z*rsf+ZV|{T?Y3H-b9a|1Lp#5`UdVn6P^!JN!_bL?Pu}j&nO#v)QBR&cS@Bj~Tf4iN zoqt-z{_~#}9S@N?zdPxVIy*c2pFe*r>i$^lE_?gv*4FGENn^LSV$qIg+WBO)HcQN% zJ2!G`mgwney2|?c{-vLoSA3g0dGg|I=g!;z|8pjJ^Oh|s$9g3He7l{`@aEp$-4Ppk z-+m39&Bcpu`cU*cXzk2fWU_{x2Lg|YxT+5t_qWrm0fG~j>*c(YD?DDt{F2V z^kQ~=ICEpkrHLn3%u!KO+mv!r$gNkZb?Vg6jpuZZ_eeJP_3_2m{aku0!0!6G*vIYi zbq9_eYind?XF7GeY~H+iEp2V9?jE))dn57h-@n#vcei8)Ta~{%Gt)RdVpmD#LjCtW zJw4BlndjazVX*u2!TH^tor|@^odkr17yr6>@#4fidu-Ol>|}C?iIJ)O^(FA@T}|zI z^X8SjzSjHs`T5NiA0GwDUcM|c$5dR#xv*Elkg3&a;V&f_!=#p5pA?Pe>O=jH}i%X8;t z-@1KUTzefGuhfIruTLLrW(Sqc%KDnL0U)989ie2q5 zoA2K~f3CA<{oC#E^QZO>)mgJw6b6lzxeR=PUrfVhNzI{7%^=jyjUAws0+1VGaU8~D* zaZ6_K)@Mst=UqFWadT5Ds99}cVbKw|*p0KkzCJN4ORJ~1_vppN?pI&QS(o{|c>Q|y zFO{7;cXGRspNTCe_f`S0$^s=&1`L0yF1yLU6V^vl^Ed2({H zYg*c}01c5tN0onm z7;f9PZO882k6*p&TD@BP>@3s8W!TJl^ZGhFIqT}`R&BOnh>wqt ztN&XnXJ2<_u64PGzyEUgez}}GJ0^1{I(6vq;pY7Pf2Zli z?wT-ZlGALn+$+}%jg6D9tO&eu>z0tTw6})`M^sc4sCUmJYZY?U<56VQmluwc)qGE! zI;CW0CRSTpYgP8<#D>JfA+OEz?#!?%eKldql$O3ezU1S5ph1o&PoE~{<@L>eArlemi#T5Q)mm$~v_oaPfxi+tu~-`X)>eV7Rq4 z`#8wpa5hUz%O_8sT-aAzZDVVDb(^5HwD;pSa#Gqz`l zjg4KiW=%m!Ny?`uCtds69zJ<;^Ykb8 z_e(oFJ7-;8<(ieHb@1RpP`jk$MSxk(jRn^ZxVXEw@2ma&>Bq<9prD`+pFSnMy|ooo z?!0)B5w$I60VhM|9|K4xCL>0t5nq0FYl}U zt+f6?NlA%>O@+a_b?aQ*-HU&J%kAmym9($3d3}AozR4p;Cnu(_udXf*Umurs8#FGH znVGq2S`jlFkAuH|f8F0-6DLo0c5-4eGc#KgvvbnP$?A*OulLW$&@eMI1C7T7#GUk= zV==Mp?JdKM3kuV8BAuR}oBQ+M@Ao^4pYs(zKNl(;yeav3U&*^WGkbb?pV$L#Sh=VFOS}yH;d18l8UF+Qm^?v`~H55_M2zp85K2a zne#*y&q-b@gVYyGo9AsvIVrU7&nIu+b|ueADtjBeth379+}N7g`P2UX`l>2r?=wlo zv+8HaE$zkS_iLxy)&6?${Q2^i0V|I`! zv(H_+G)Xgf*$OG$BS();oId^gok~x;|9^_NUR=r;SG$&5b~pcl-JaR6uH*(Rve>e9 zt00%FquKg^Teohx`pJdg+j4;^SGPs&+uF6fT#XkFSg%|8U3$xfYu7HFdH<_E`BZ1o zta*zyE?!KGu_j8X9V>=IDOzsduM} zh56oxwKrs$3s+8<#VR}dM#ztS?~ga_oXA`DY@O)7_xqg|ynn5GQO|}oV5isFrVf{k z=aC=xzdoTNz?5ZPzUso?d%V30OTKLGTf9e0%O+~q7o*CU6-&HgPV-5bbSS&`Wmxfe zt_u28RBS5S6w({gnX+X4`u>?SXD&NDVTqQqvU2lzyLmog)8-ruStSvwBD~+`J}wewJ!ryUM`(5dGcX)`I-Y?US2LND^oM_ye#N>)pP4!-|xTQ z@BjSqj{Ze+gDWK(la>@(T3Y(dwVIlFdD+89j~2ZwSdz8kmYTAyt!+uk>bI>6RaSzE zvC>x|c0V34$HZ#yySYcj(bUgvl8Wa1xqkEQ=6X(6d-&|xGLS|eHD%9L%Rr-&9}e?N zn&-(thPGEdOEH?XBx}WkE)4~RhBjX5EGrq$Rr^kAXli!$eA&V!%Mvsxj?IZ9?d+_h zD*_jP`1I*giNz$AkjKmJ{`>cDj#aIca&j;z3yQjN9PE)auK0Y`JoCzmiOUX8RGFGp zo%-c={(i&SZ%H?|M6WVy5jZo)axx<`+l4ie#=h;!o>{AMjV3L5<-&0=eSWRm{e88W z7ZDdl)8p)l9OrrA0toSao)pcj&c6uH7HLeqEY;yl)oY z(jZU=_W8NF+F^I^?k+F>^(Awe&rGMuYQ7c)4;&^6*Z%u@J^sy|ox<|+^3(L=&%L;~ zxU;)k`}GCwty!~s?0!BGF3bHpZ_gbWP-vy*U0mc^QC)p`Ww5$$dr<1rCr=D2Kc$H2 zL^P~hr{_D{Y-!=+V>x$rYz(-o8@=tq#$@+7bLN10Shc^tBtAPcQ>x?F)6m?>7thVL zu1vp`{^F%{hLwn?R&ad%U(;SG(?#z6a_KyDk z@TpIqJrk0UIPu}(;n39leLvOg|9%mE`SPWx*?v? z@tbcKd+uVm95`AwW?j|Fy1vf${k^@WvR+d^J#3d>6rl0r&F1qTzJFIYGZPEg*0p)# z#=zCt+1cLxa<)Gnw#$d4MsLemn16pCsGEMOr?=P8$mr3-!|kGl98;To+$M#v*8Knb z{mP2KX1m&78CFxYTsaON>y?%?%@SF+ZrzVxzcyuG*JA)xOP4QeZ#j2jqVmqFuUgaf zC;PjP;hv&qJ6B^%>SLm#Id!uAhNNCQT9fHcr%51z+OI`-7nlojJ z$fe7dH*Vd^Iwjoh;lqavS5}2~U%7I{>2=BLYrNIf)n<8jI+ib24+{(X@$=`(tAQFK zOO`DQS{=6blYNKRqFZs2v3n{ewksag5a9yF{L*cim({*}{VHjc(y`2W<)kxb&tANG zHPqAu)P{5Gm0~c-y*1^*g9lEpU%Y&2m~+EmTkh>+-|yF-pP=Y`;qUb|mliHus3Fqj zbbijN&0ceR%HG~;UB6y`{r-Pe;p<{FFYd~|w&vlJ_3bC>z1U4Xt8V7r+cR^|9-FJq z#Vg;ueDUJK*6i>;d3(RSJUvH8$CCH=WE&Kn+X`M^TdVY&yI00?(vc%B=jK|6KhfPK ztnPPVkt?^9Nk+iC;{lN&w^FvGot0wam1=2jW`6ndrAhw1Inw5NBGrGtzP@f;bm;es zm#?QMPni^ASN86Xr=K4mBO~K1zNM#DhOd`<_wL=Q`QdA$j!x5!esOE7HfVe`i*JQh z=_`Yp9|d7+A_6m{{Cqb1%e%X~FI@GHi<8q1Ta)nZ&CRFP3R8WS)~0=VxqSYm z?fLO#@9*(y*h>hj`6y^;cpRSS8T9kk)@<>UCr|cBoBLf}7~*+)x_!t$=FnE zII+uny57>%)6>4Zy2>3NAHOx#y6lZc(Ok>oXAfS#)}DR;zxUETM!QO1i=8}q5;Q*< zdTpuq^d$a=ik?%i&a|%|=FEfz+-_1C#X`R&@@6nc ziSE8X$7V;#ORbfif+a7nO@41C{#Ry^%@TV?mKjpE+p}g~yxRC=iOakfHy*wS+5D(X zCo^WLkK5X)txnokcH`|mUC{JCIx<9BOS%bCafC$D_{ z=F~G^`;Zs=xZhP|hd+296)yd$XnsQYa>YL8l=~}REeTRnuC1;8_3iEH>+$tx4>U6G zEPTu+t{0PVxQ+LG%=_>6>($ktzt>d0mdo|z!o9gQo70$mrLJig%7h> z{fi!6Q~pr6?#5rHBTJpKrhVF>ed}+8fjN^kZ;aqSQ6}9OZ8O1p`|Ib2X75*iu-COB zYr*2Wlu4hCEH3Nqy8Hg+`3y7IT7bJ3IGi4R_2}SSc|+D)DpYf_phH4}LjInQZ2R`@ zd-3X(QR%A?w_d5QXG){CWGwvl`QhZ}7gn9PZ0D)9?8lFaegA%CKhukF`;zSIuI%}A z{UtT!+}zx{zhA?B+Z8=i^|ZCSXBww}s{jAJKI3KBE&D)EEy2o21yB8nfBw`g^Phk2 z&CSglH*C02VlgQs5mZr5Kk??~W=ZqBIWlJ>SCy^GHM+I8+Fbk}kCOfV7T*^tE9dCM z@0-&nYrU%U*|a6E7Tr=?Y+e3N;I9Ug;*$>ENzdNi*(n?y9S!Pbg32waz}(3f&&)J_ zX_~;XYgcP})|4e(CBMF8Dk&*-&B=0@w5mI6c8|)-)PmpNa{1(JPFz_TY%1HOk~t;E zT+35RNM8Q@tE;Ocx8=+Pwc>jxpY)hyqF`)1d1vwSPe;Y$MP^NknzTx}a<<K<8?|*& z@$++Y>}r3_eEsz4Q^Sf6381mG&6|xcFY`To|NeaY|9^!2{r&ys*+lAn47;tpxcpva zyZgzTclMWuUtZ{O^+=zr^@h!x7Z*Q2m-SRw%_pE&ZT;G{XV*k-UJ<>0oto2>Q!}Se z7e75+pZ&p=mBF9}QS9!rkLRr4Px-lTTi)GMJBy!pbaWgzcdjq*?ykc3_iXRg|F6}H z+wR&n9`uIK4r{OXFPoNZM|O8g@Ex*v?j#>P3hxi`1x%X4yaN_7OR%6Rwg zUBf0r@5U)pMBMu2dS}m;e)sO3&kTcwS8m_mnk}Atd)v`-=lnvi?XR!bi{16*%KPkA zr-P@aYJ=JuQA$itJ1_02{OsZ7m2`TV?$W;3nO-%iU!Kpe2PKn&A0HC8?re0J`Sp08 z>}l)wdz7O&JTLvfv#)lxb35P0f`?99A1*H`nX>sSxGQ=5(4i*V>TelZJ}aBn#_krg zwY9DK{%)<-Y{O)>`oCYrZ*R+ed~&k-k>kgwSN&F0RQ&Pl*Q%*IckNm=ZRgINqEYHf zN=+>-EHyPXU3Zpk-)>%2RTZlV87nt$GR?Ecv$Y%-OS*pPqC^MTUh<%Zdz?k(D(x zHdeN=*>mD)zr4Mgs%mR^T;@x4CO7`~i{q6rwiQJr)n3d%f6ePse>hv~eyZ3axjO=Xj-}$dozdzx$sbEl4 zEcn0g)BnK0Q!HOzO#GCZ!czLm;qI;nPnOh}=JE9P1@PU^*O%4T*B8@|^J(XkeQ|HE z_3H5TVcB~wtc^Bb7q|BmXrjj`l}p+@@5z&slO-f28BeA6|F5(8GG zdV4SSo~}2G?`^A!s^(*TwEGdU8VW*Z24Q2d=ITzba+(XZF5* z`?Mst=G~n&zwQ^OV#}*-w^jx(H!wG^PrKg4$}Lv#-~eOTx|oyI@Aod(^7r;mJ~zkm z%q&yx^z`TAmVcD?1{ig9b|zk4=3DdqZaE7(dvapp!4D4)fBf`GYxR#)XJ1@g%-LCY z=I!k3rm|fjtug!S<~}^!o}8C=?(OaEh6V-)4jpPLe0=QT`}ga^t{*w#;v8rf?Z$Rz z7wi7{trrA5I@&G-Jk>T9j)|Fa^4MA5nK^8HEaBm)m4f}2TCEG6+k+On@j6t7{(igt z{T?GVI&M8TMKic-?_bT}WgD`t zYF)h=?&HIw9lkE*)D+EDxve4|US3MJwsU!<%?yg3c$_(NM#8qrgp-r=%gf8`^78U+ ze6n5{85(+eda1wOtT=K~!`^=W|9{{2=iJ!P=-kdXarW%)dGq8hFZWM>cW0-BwDk1I zf=MAa-`v>P+|t6r#wX*El%#aO{=eFtxuV67_bs1aOf=ef zrJQ~HuM1mO8{OQoOKW|>memR2mD$IH8z%=QB`L+%eifBA&r>lnnj~eK zWl;GkEjZ#wd~au%}J9cZP>bXssDVtmiG3|xwp-F)fdf?*-;%n zvqCSnsat&N|E$c$>EabtTL0hPjhMFCdbB9lm+S*&DCQ@}%3twJZ>XcenSEnIT z@Bd+E`gysa;NZ^Q-lbt{qgJK6F1@-r-Cs#r8Ps#{>+3t8`_QKTU(K`g^W#_SssI0v zLorTc+H=h^Bdhvrj&_vvZ6r;Y7At6sXg zyKgRf>IE7CDU;iiYvSLW}Q9n1+>}x4kSB3t$|NpPNb=jMQzrVhMmcQla=RbP<_^O_%c5~$B zw2zR`~)OQ+AAN%{BZr%uF%hLyp~L7k2VFJDIL{SMN2@T=6Kl*?~^*uJ9T zg{9dUx5e&Nc~>3{Zd1QHDJ0SBkH)1VM_K|GyA?h=Bbj%9pYQg(yC=?`O}(-r@W=1p zpKs^ypZa_6(fZ$CF8gzGaA;h#S{t?X(AIs`3(LMt3XwV9FQ0y-L-5D1UqbTo{{3>c zGfXmrW~wdvQ)5xjcWrIUySoQ(NmYGovH#!VH}}B}!;b#;zrP#@ZrOUYvT9Mn=wP;&!0c1ayvdQdUJR8^!59Gb?q+qHv3i9FK3%^XN~Hu z|I+e4le`{%dwV-(PsKzz+o}aim%7Hq&5Mekc&V$qS-!5p{60%`w1l-((xSu{0XwQh zm6Q@*hs`ixlrjr3bDFSZ)dC+q?w+2Wir;UyTb8~O*`9YdNIH9^jjNm6r+d}!MQ{Fc zo^df`Y)e~NJw;ac5*&HKR^BKEYp_O)~OZJ;`)cq&E1gBucGd}KJHX>Ze87n z^ZPcej7*i-(Ux)~ZGzlvzbqH6mxeEwxcz&7-+kp0_vMqtrn*)6Soyk{E&N`-cm96I zm0ntbMpAY)7QVC1Qcq3M+>(D^PF!64s=<%W&dxdZ_47dMJion(EPHn+GOv^4!RPb# z$IqSX6I6ElaR2|m?RUN@d;TwZbw%^g;lrSLt=!w&T>bs~tG>Pp++X+i`MTdP1lL5f z+yCRZdD9?)A?L;d8HFuI_jJ#lKdJsSkxP?5*rWene9_PJO`RU9wq~-qvAJht&KeXO z9Nsg{a+#^`#&zkwbGMZm6dN7hvP@HKtL_EkivvUu*So$xUfsw@NLw4U6z;><|D4YQEs;3ZD;;Xz-r6cCCDk>5zWnWNxz(?# z`1tsa967RLs^sihpO43jZ!BKn{^{~@d7Yp%Gl>_CeysH?HCR$on>*S59V`Akb?qLW zuk+)#udzKD80YvR^g-y6_3h=w|ITn;x@5ew`ZLot(>D=6uBN?tBRhX*T$0V7Ji)h^fkGn8Y($?o0^r`+K^0(q<2SZ>7hHMv{Ujm$a)-{%A1s%LbKANtX>a znI7JE%o>JygZJX{mLAj*Oe93S{~MV-HI%h zH{g5vedd=>yEwP7H8DO-o)*ME<<}|g^;1sI5j%QuZM6BW($~v=Ri2)vyC!z`x0#(B z2aX?iH(gTY=Ei1N`0>dzt>qIo7-{~TUY#LxBf24x^?vM$lg%GkR)lT~z98=Hwakdq zIx6(fzQvOc-eAztF1WJNdV0OO&JV7$v(29u&Ji`0&3^Rw;}@5b=VmpZP2b#Q&M#>V z&0g>}dujgHX)}30uGIgw`<&-lwU1>so!cLIaQZ&_*qriI+hpb*^_>wrA`)LF^|p44 zp0oQF!BcSj&e1NLXzeXuOE<1P@a$2Q)r6m4c0OLBwI=E;Z{3Rvid*NW>qVT~HPxHJ z;8OdfKBlE>S(mXT1RY$gWP38SZfE448yiBGPMXWTvvStW@)|9Pm!WU=m2MRU4a6BH zAKQ?6T5Qs!NnLmT?=1c>|G&m>hF)p*^7k6cgDV1~943AH+#jjIqRAiBu~*Lf&)SMf z&XYseZ*k9zxW4_^xzl}8yjc%!ES3vf7Z$NQGCAz@o0YtixQ;EmeB^!9s=8G!Mpb{m zUjO*v!-W!wAkoDE8b2QQ+Zz}gCx3o+HfBcwqq({HR;%ad58v5&>RRFD<<1ETGiFW8 zkNJ7?=aKte>ffq#E>2(6xlh9P%hQY!-qMZvDgC+5(Ql-0KE8K6c4o<|=*5fUIio#1 zu6j-NaO30S%POw(2#TCxoX)4Fre$P^ZR6j^|^hu%GEM8G8vx>rDbYl42o+ux;al;;t86` z35tx~Q(?Gp;lef1+xyyhr9XvpY$<5n5;DV#ci(S5HNOzEt9q*)JzAY66j(QYSWuvJ z&PAY9v1`e1&l$UJK6v%oaHxOwVS(Pd9- z^PMJXooM5g-cj?@2)rD*LtZiAb^nKt$4?nPSQj7exA?D;NF~=IJr}_`t2rBj6I=cZ z_RX6pxApdwWo55#nMhyf5&k~QCH>{Y$k#{vy(h(`srtEba&m%NZ=faaudnHb+RI8y zOILk=clO4{Moc-hUCybh1uSQMJSY{o3skj6j> zm6w%XQ+mqY+&BnY8FqP@Z{_Q?+Y3rdk6yYosi%iWNJz+{{GH6+>hGWhg*vgjL?(aQ z(HZBa<~z&9tWCypgZt%$9{Qb=)%`y`?za~b5IB&%ey>}coK7TDd<|oMZ(}O=fdwt) z$BQl%ar{(md7yl-<&Th4U76jw^}8QkJl`yL|J#8*+ho#yr+z*zUoRjk%G$7Po0*@V z-=1HuRzEd6v|pfU!2$)pITnsFF*4`Qo$HY>WQvZyowQb7R`zV4tThK8pIdnNbTQp1 zgM5r4t7wblE+fem2tM32b@5{gGOPS}%NJ>iT#O#;=nh>u2{Vmi({l=va zA3rW!_xgPi7bj=K>+9<`=iD@E7q9LdL?Lr@RiGIl#j&eRg}--%qFY zEz90WynFX<$gwuk`S;H)a_zRL z|7Wvq-MaHJ<(HTF`pmJIc&u0Y@~+bCOP4Q$MxBh)&!xP-x7Q@|(vmZeb@h+>x%En$ zKYMa=@{8B@zpq?4a-@ZoTTDPk#wRT7n)mD;m6Z+|85+jv=a%@-xBKz?_vUQz9{Ke- zs^+!3if+u??=)|3?~&b|ckWb9wyu6Zp+bLRRqX4Bwr6HD-eyY(SzJ|m#q+G6s*&lW z7hf_KU0T%P*R5t{J8Q`rl}Vc?d7kom6nINH=~A+QQ$lV^@6?H+`DQhfcgjA?vZ`U& zvuDqb&*$wKEvmj~#O^KwEg`A-b~8P7-}l#%vDNl`=<;U4FFU@Z_~-A_cX;-AW~FGo`+Mi*k4pC#>)nfz1HS(Hn({RDqsCXki!U#_EOQf@ zEa!aWF-Ov+y;@FJ5G9{RGO-PfiGa`uw@DygdEf9LuG*_D!AotJq0cSU4s& zmXn{q{#n)MXJ;4Z-Q9I&hN1J?I|mLltl#&GOJ86A+M3A2XJ#6Ei-x;uhi31(y**$2 z*HICRk{1GMYHCK3p89*QTnRbWEA75IY;DEovn#jcuYa?l>ZQ;P+te9uiYyP8AF|y4 z%jRHvbK(2P=U&I}>B~+J-||)Kx$gZKSG|jwr&xq%3wozysRU*Q-tq5HQd90)qJC=i z>?!J+H)h`ozPv?k>zV9_8P7Tv&s3J%CTB6j>Osmo7vIaXZp^;1cx|ZV{q999tgI6! zPF(mZnQcSiW4C2KGY{4O`z-(E%a@8D9};K2)z{PO(+*$v;p1_6`>lPDMZP>zCM!Ij9x*N zCr+MBJTt>^$BrErmYq%C^GmBof{|NH#CEQ8o|jm?-tI$Bd8eN^eQxp3AJ0nSZ^|a$ z=91A^KSjjJF~?1(KS=(g!BfSBCl|J;wF^y>aqxi}`#!&~FYb$oiyvPVx_U?TcRl+*ADEMm^&~zx(75WUqod=VPp7nf z=2~q%@o)-g^4H1PdH$}y*W;>tPfk`B*E)apZ0dytjyrbkGAey_W%;`KvuAt9#mSZV zTW2%9dHeR{sZ}<)YVt(78eyM85jgyRr!{BZF9Q6-@HGv zvVXbcBK$5{v^pKUu`zk$mMupv7HT%LX)Z7Qas0+^Eza%27Q6rGgm1sMpf22e*SZ&7 ztLMM=zRsbjsqHy6=AHW8aMd{%o&+qqyx8!9;eu_hxv!$G9KCvKYSp!`6^rjl?}*&_ zFzszyXWYYS>sga8UtK5DFLNp+C`icu{~zP&da;W#FE3jYzdtUwa(&$18#@Y>=USJi zU0V}b@+Z9d|Iu#o=@s*D-n_Zz>$T`5OO_P8xv??b?{IQLLc`v@wi`G4%g?pZ)9YL2 zJA0Z1pRZ=2(XE}u>Y%yk&dyHPv~Q=9-rm}(6R~ZUtbN`3mjO$-zWw|Ce)8P8?VTsx zuC2NF=u760a^{OGJ_pYEbKXQukY`-2ZhzopFdZ5`fu`*=q4%F|L9t=zpr5@TVbr*&FCs%iVUy&Hn z{LA#!>Pdd;)BP%LRzA#n+O=+*%-z*%zP`IV`{Chsa51yW2Ya$#2F4!6wm3=s+ zee2C#Znposy=TkKJ@@f^Uvc_-*{IqJUH_tgg`fD5pJ|yH)3xu&Pxt3Lg^F9FKW^VK zw?Nvs)>!JM`J#PO)pcd94L2W5v3YB=(dfznm!PY6x7q49dRT2_XQmbM)r#>;eJ5kyF#-2*!c7FL|i&&Utt*opz<=?ks&IG&xE>70?F;oc{+GUTs@_tYLx>tecIY=DM{>%Pi;`}Tnf)~RoAZ~uJRzkbpT z36FlcTRQRU-q=t1uF}8R`+QN_Nl7W*+#^qRPd419Ip2+QqvS@GR`x=}SBqYKi@NdH z;7;zH%y&0r?%&$S@`L3;>hq;ppXSVB73@5*@ukU$Q>VI0Uthbp*q#61=lTB)>i^Z) z{d%FS7q_Ql`*!o~d3O)pzP*)KHlMHZR~Qtxj{$6CVEW;HR&8@o8?**J>hV3ySmzW ze#lSI-p*ETeqr(Ly_uJ{%(RP*{P*AnGoPPL$JEuLjOk1pK5o$5T$}bhz1Z}bmiQvQ z0>fWQ=}PAWrU|*7j?%5X`ZDy_uJ5U7yJuG1s1mtZ;c#hA>gj0{XU|?8c5QEU`MTKM z%Xa;`xiOhtTrWn!#zuynojtDl?be|9R?t2GL1i})t@>-BljhH#f6K#y^?c8ryLWdM zJZy@Jt*-tZbTss$*VLYzoSY5Yx39m_siCj`ekQ-f(p3*HE%n~>|6f>AviYW*nP$rF zPH8o2?#tz#9{k9@XX6`Q8}`b5AL@*XjXAmaAAR3&-%_-!i#t$!MRH(!8sFKBcQ@u- z^mV^{Xrt@aOsUwJf2)~}GWANC2K~K%;6Q^}?yU>Ud}oW_i+_7->&nm)BHybiA%_iB}Yf>DzfmUvdA3=ok5OdM&)2 zZ?|nJ&pY3~)_zIu+-+A3R<-3WQe8R4YibWDU7wz&`|lZ%VTm8N6<>ZO$*5xhS z_A}_}gjut^Zg2bC+4*zY0f$&ADch9N$F?RfZZ>pYSDUtC>YcMcX6NkRI9E5keBzX^ z9en3xU%a_B^L*UzH%lcFqaFtZE9&tjB|W&PoSNk67q(AGcxtMl;i>Qnqu6D~pO1&BXrB7R)$)^w8rI z``5=MB`FvM&1{%7d8)I?jayB7ZLh3aDsyGM8}HNoa&o6!f+ysxSv&Ql$D~l10{FQA zT>-rRHZ6JOv@qbpo}WreN@5%GqxA&4w>LI?oPI1h?)A;dH&j#9HvBzSR=4Mya=FmE z3+ETh|G)n9|BE-5Bx7@9|8X(iJ#{&CamLS|r&@%hxD*vnEfJDj>0|Km%QXi{**_L7yDS4W@`!i^hzb@sk2Wx<+gHiU{R5gv{}xBUteFFWL|1n8N7Vb z^y$Yt1eJe$yPXf(6LZ=^_2tf6TO!Z={Vl(-ywu429`}*8-O_jWzx;RQ;ucY-gZ1zK zPcId}UijvqVO)9b-2U5jKHIDA8eCZ$vpGen#b{$o%YkP0Q%i)USL<~5{rfF8YpUpu zU0U&5vl_RX@A=sF>D96a+h)#{m5>yS?mfP2vR2&6Nr5RTD(m}5C4w&_rT!pzE^GEZ{Ksh z=36)E%&+d(k=2E|ZM)ihGVB`P|El?3w7u^1>EQjVcGkzwELpT@%K8@>PjwB<%~KZ@ z7BQu#fA|{uZ-1KaQ)9{CU|;!8715O;Co@3f;<>k{9XQ|+wkG1>+1ciyr)6YiPnYEN zr=L7^>e2T5b&o$jJ`P%Sou2+YY5nbm&g?h0?C$#TJ^tv*;K>oTKWrvS>wo&Dpa1yA zos9u|-81_m>dGvo^>PoKKimJls@|RbIiINfhs#TrYftt)`1)UMPqXt1c^Rg_hY5)b zeN6K5PKEc&ow}Xs=T~n(dEyeUSFP)M{@I>b;k59h`_%QXuTRw{Cr=I6 zXWf4B&Ycsv*Jo;Eo8PI4efn8)rI&W7QP%x^w%ua7i_*`}Tea!Rl@PnXUxJmCls9%uczTfC??GyV~ z-*fE1pZ9k82R#q|dH$r{qT;8)gKC)VR2iEAMUfNm8op&c-U*5eCyW@qW ztor&HHv(>MKXzGI%B10c`ulT_lg|COXxP6?|L*sPuNF8j)L1$}CG#Li$3MbVcRT+3hDEt`4%eg99>p3I=&vrFvGA76a@UCqAZzyHoX zw&!=<{`v2pe?GcqZcotyC4Ppr&LP_B0fw`zO10kI+skciY<#X3v~AbJ)AQk#mBAM- zWc+LYpOTXD;mgb5l#~>Q@Nn_&Hw!UldrQOw&BRp&a?IQ8is-$9Sn;W+0A{sWC??;)dud~R#t;bqu=|} z(&o2uFW2B|XgKN-69bwpXhB4usjdJ1 z{&tR!pKtg3ikpnJSnJ*Fl8>8@Req63?sL4&?&#ygqjTs`{KWc)*RA&-x_Ux%{j>c} z)l1VVCK%buR{Rp-;7|YW;ARaSOx z+R1jIxzEqfKYa8ks}9qK87xzuZi={_XE`U_YSH;ib_@+G)@YpBYbHMRj91LuBGIy6 zWxm351Qg7~Zi&k~ym_mvpwePHr?;2)!ftbea=iULo=J_ICcz(9j>h z-#?qZ$y!sBlaZ0p=B;hjmxh)W78_ez!>lVBe}27Q|KscRc*DFq7Cti!82ROF9_&7E zS^R9lf&~l=0byZnJASAbtXjpuz@v5`#Z<@LsbN)?gVTxa^R!koGA(dovAvvqPd)LN zo^HBBXsBpAzr0&wqT({&nQYU0|6WXv%YQO`YGUyTwm*OW=&vb^X|LS7S3yxtv7+wk zRe}1CGLIDb75_c3J90>l@zSM$H!oR^CAcSiEZU&6_C~tX{Oo1l7q5~^5WM(j-Rj6U z=XV$+cNayKdu?ISa(nmgT|s%ddt98{m8-L#N9|d=RyQX%_ov?e`u}#*bfeiA49v`q z-P>DjSn$9hBs|d6#o~$Ew`2Fu|2sTwL#093+qTWhaZb_u zZ11I+)coJ{abrMD1$S3})50G=>?B^z(s=c@WzxUJ0h?;XwXA0^SS2-K-Oq?r)2A1& z_STwd?7DBtQ1fK&nVmORTv$CTcbdb|6|uX^UR++zFC#0vG2^1rJVy6+UTL=4+P`X^ z6XdzMx#!qcPcvS5_3iELiMhFFw+k@7S=r$2?QOY!{hb}n%M%qD8u(tlncr41lS?9- znagRPc}K;OA!X=a&80w?IhH|L`nh-&GU6ydolub}>vol6IgfDc<9&$l-Sd`66Lr zN@;aGAt|pd--LK_3P^Co?B$Bte@^aG+7pilUosDz>$7FIbY(no=8Q|E8K| zyLQ=Jeqz%8=TA*aYN}&s=+yUn-#>bkbZ1YcaA;_#giS@kTH!Yzg{7stPn_^DnCVmU z_Lk_jZQGd6``y;zU`+gw{T5!`!(P@H0bJhOrXc3q+&D|qw z-G|5fJbhFf`;9y9KNVoyw$F#-Vphl>L1j0A4f&^q7+jp3nkp(PCahYu%I)oTz2fKR zR9CH9<>KSh^XK31_gmKq3ky4c`TEuK{=V9i3mls}y1KY_R)2pN{(bJmiH>aiaz0Cz zF752?<$Za3yMACuh>Dn)n2M3nrq2E)`xbF3dbPxs-!S!9ut`Eru5ZJJX@zcz+S=Ta zH}i7>ykD)3&^fTvS)py3d(x?^8*g;mZ%}@dK1Z&U*Za55Q^~*0-bqRi-ttOFGaIKf z&9&Y<|NqW%{)lZocl`oOH*DU_tjHp7UkBQn`{4C!Zh86nY2D>NJ|sSQ{`~V_z2uD% z1?A<(8yJ}dgoK)+x9253Jk&bFrqamE>&N{!dfM8D7dSRgm^ria$PpKt>Tf)trDz`> zGW+=WJb3h|>Bx~I&#cz439gX%`}h0(v%k6*t~eOGenI^??JxFM#W&xtRxnc+V|;w* zqWARki&=Qs3LY{&cys1m*57}&4_=>^3n;m3<=}CCf8g5gO`D9u*2nR(va-6kyBF(r z_x2vWx3_v@_4ho`y0*yA6+b>G#_g$STGo;rIIkJ(6z% z*Zlv*T~NgI%Bp$MimHn5?_|Bay+IRwez(^~Z@;kEoxi2E_2JQO@f-W=>o-3Wkd)-q z)C3(MQGCn9#3UglrKO{TW8ZC1p53);*H%0JRV!C=s;jHt*-^MSvM5iZ(aPY&>C=br z-IMF<>xpYviGIb>k|`|BQ{s^*L-^~RH}95|JoUK z{8`uImC}pVYF3|DJYmaG%k!&Xt@2Mbu^T((c2tW;>=5YaPxr6%4fK6+cDA{MRf$Gd zS64!Qe*c393G3ua!@|NW>i$@St%+y^t>U^BU&EH0n`>$NDeLlu=fI+BLCCMJ5&-+&)6UPgmv3h0fA)KG^6@^lr-@lvU7tP`t?TsG*3z0VWlBi8 z;Vi>swl8157Ctz@I4?DPU5sN|np)kzpU>HzUW#F{GCpgKZaD|F`T8m=Kikz3=vZ`5SvAB}}@{axql={beeq7t@h^ zywCJ!VZZXDLvkuI)ev>K5u&|HQJoA?DEga76d`EjEjX}%7Ky}pnd$RuX z?OG>I5<1o+c{#`O#Oc$IFD!JPVO6T7rKP2yuiu}0dmHGGjF{MM_S2_LYkPWnIy1wU zFJBCjj&SU${LJR&=Jw+Le)}g+pBBEnq#CoUgp*rL$Kn6Kzq57!{}Nasadwtz_j9Y{ zvNE%0=jZpUdQZDzc_0&Au@(bC!UXm zbz}7@-#H$;(}JDM>;KhEnLfREt8T;whOVxz3Dc&rG34CaBWa$0&m}4fyenq1y1!XQ zhFl$=j77t}z17!u<-EDE@xt}%?epi$uUfSVw8Df((x~PAJ`oWSgNzFb3=jTUQER}URyxMkVb*WzBrWq}Fb~t+c{?@W%xA3It;jha+&V2J@kwZJPkX#@? zy9=kYFfaQN|Lu8q7p!03f8fA@Wp{EnTh#n8Sa$wn)08P&Rs?4TpYr0U+j67-wOqBq z(OeTg-doHcQ%^JU^MA8l6ug|lbnE(e?Tc1ib6s${qr2OA zciG!nDweBCSFTYgF#jj}ec9V1{Oc}nJe^_o-~q#m)yxwoI(Y90aR{8^!4cAPZjR;Q z?aYTiJUnceb!CN{s_Rxe9WjHAujB5_-NVZr`#ib0F8shfxrp6j5xb_`lU}sK%x^)G zN&UYXpIJw&UAkAT(t6G&=~|n&=;{0&_F2YaRuxH~dz~I!(tq=_HA~XCd(nz*?hBHZ zELy}QICz>u>N8KDJmHu#VMET14UCJ`e40~qU8iR4v3>pi zvBy^Ru#^|c&IgJg{HaWM7ZbSLH86x*HNf!It*zRA^X+>7{Ha;@&Anev(Z)vRSV`1# zv$Nj=RJNu1AG@W(`$yzoqwSva|K~F-*XUZ+>mVzk<};(ASK9p0l`A5`>V7TTwwcB4 zuj8$+ufK8YR#Dr$1-It?|5w|-RWP~W!%UN7p`lC*7nYpL?^?9aYe5odhivrryo0At zbG!G+Fg71-m^4X9OfQBbKR>_Yay3(K(3{Ww5fx=DeD2d8RGTV4@Dq5u!XYqZFGolZ z!-DYjaU9&-%*_WK;^O2=N=jxK>A#YmJTt7d^PclZ_Y$tQ7maq zYPlXie%u_sKJMcdZ%@yUB8xtKD$2RPPqwnMviJOknSZ`skKZ9*BYWmmR^akaXMfK) zex!V!^M~py-aE=(v3{KW9~3_!%~y6ySXx^rKRGe+#->zmE^hAZ*mi-Y0|y+wyu8eA zWMsrU@A=eV~j z0+zD`NBS95T>AdQ_M70GU0+&L5(E_V^PA4jp>%^eL;auWv+T zweaB~)+0xbBpm4wOxPIF(bwnZ=*S2%_Sct86%`c| z&-`6wZ*L|3`SGzvy%w~E&aGF9)!W-U=jJ9>A2nfqIh%}dX|-VBWMfsnl)=Y)1sFA*j@2a=~MUWz%bSyvQ~X> zBM-jFF%~&BU5{BvXpvw4q7_yl;o-`Pii|#L!gH-ko0^)MRs=u#boTo}wU!6Rq{2CWIXVl{u_mMtb%u3lZZY+2jEX7T6b^m!!GXFoF9{(fnv#MBk>(9^67q3~vGhHwC*Q?LIPoF-GNxo>fYSk;z_9S6p z;ltnF-d?b3Raao1^Mb$69UX!mEN9kO<*KEr*|=|?T}^H6$B&QQ|NMMDKVnA#=xjcN zx<5bCIwM0uS|p9r5^iiroMYzf?7XftCMM>>-szDPCu7$ zVS(d>DN~MoetsUb)7iqxN=Zj&jq9013Kz^zURdb-@%jAvq;GF-&dIy`{{H^s7Z@RbA#lUBR|(@oVPHiP>AE(30@(&dw9(&K=wT|6la$18d`r zOiWzT($vDEtzF9=YHP51X}uPmwRje1iYQZ%(?7d)X^cK%6Q=$DS~^>3^2tN5udiRY zVnv5nVPVQtPcGB;Osmy$MbX9j# z6H`u34g+w1@Re12QkjbF~j z;ru+?%3JFG^LV7CrGNbRvA}z}-itdsjfI4TFRl(>@239ClC8P%>+9=>FI^IPeSQ7& zuKRnd%lF+@RaGsFU3PoJV}?HYo9qk$p$Y#@T zonLCo)_W!%KX+Cv&!%pMkJ_Whk3os%#fujSpp=x#&M()pZ=c5rnriv>{5;#{o*o{R|Ml_<*R0_Y>fN)`Ht&u_ z$%_k(t9^ZZc(}!MGCu6vXR~+eq&&szEKwUiTu2eAvR;@zPw9;CeWlr3m`}OR6?HXT zukJsuVBhgIYu5@&NuB!2vv}4lsq}&ug^!OpKI=X%b?NfuiL+;)F8?niBouS>#iysI zH8eC1tPWqlq4swf3kwTqit^X5U%gg*p`oFm!QR-oz(B^((9ntEN)88-OiEvcyt%oV z{n)W%5@tCPAt50G^78!$4mkYzaF~C>lqoJwPE4CNZAwTV3dy~~d~^CYGy@=g9>;SebJ;Qw(s*R4`_cbB_6I52F>zu&hx{e08GgaY0FKcCMR zl$P%96jncU<_yp7vbT?RsT-%AnZb5+^~|#6qD4xex#<%pJl4eQ6gu3_f4rHU|HAhCc!mS3LRW(dr}F=Qe|df?8(W=M~)vi|78I>B-pn4+k-PRjX!+(@+3-3QnFKAKW|meIf~7gJB9h^^1um38TzlLXn3iJh=>&Y`B7+LZJm6$ zjrYgf?e}*~i;j+dd~0iVKw#j($?ED>@x?0*-s~LM-x9QQNq$SIied1|U>-hHe z_Tl5l+2i8k3d+jbIy*TT7HrrcV4QyL$g0rQ1_ciexE;^r>U}k3&g99>Cr)^zq@^ti zUhene?r!rZ`zJaYndjZ<&}Iw|_Mg9EzKopi*we}8-H{QllvOJli? z&Q4I%qxY1xx%u?sLkW3#eAU&}F0QVQ{{H-be|>e%%+#DRb?V02-({dPukY?E%?{af zOlXIMtWAZ$>FN5Wiw*Pc?qapIwY{^mc=@?`d*X{f zKlAMCA&;mQ?}Wy_W+v@kHp$jS!B z#-5Fgi;2-Gc<0+DAn?s!Y~_0QemTLy!op2iSG7JpI?6q1)+{e4XXleGoWdQOHW{5f zdv@*jeJ+__m)&)7j_$YV?-bAYEw0%zCB&pK=xYFIh;sL``|q`mbE?FL^|ZYG`f#^j zn4;pxnZEM7?H(E5{OJ0ykV(;J+K0ztC}WSSIR0tw#~6EjHD!gGxGzVb(wkj}*EurH zmAraJbxY~%Fu&;E-`*ysr?X2-OaJ+PzkY^IWzl3&pH)BC${WgSEB*Oc@{w(a?kwe3 zB^q5>$t+SDrqY%L8r`SWM(Q_T1qxHHWm~VEC{x&QC=sryUX$Sv&Z{hGWhUX>4V*M zm_^HN)v8q-yu3$$eSIw`B-8|&J9>46(|fw!(OIV1QAaKa#cxhH$P~l9i<50}uAj1C z<$qSIe@1NjTYL<^o|Fw-?i?5*tzK|FueP>U#(nzW<|w|Rj)s8+c+=c z(-SMFY44i$KCb{PIvPG(*R8C~kE?kW>|B5{0~5pCt+BhmpZ$Dn&TIF=+CND>H#YfP zc^M$$dUa)Ko$&U;=iB5Cw**TU9!=y?n|}kGsuu0*5?dVhZ2#ly4>p_?ZcOu=A^E3& z#pQ(>U8}^SdZH$ZZ$Ff{BS$2!Y|9~j|M%TivR#W-R4qQbVyZ{|T&5k?k2;qzK69}Z zFSQc+dNyi%o-7-`T+hK~_T(2A7J^pRA3AhsmTp{DmKLa^(IZsNp=66Sd_TefUb(ADKl zPEP*w=ks}|+4I*O6<_@7RaQty$cNZ}|Nd6n)cz9r`SU05t@kqwlM51_yBVy~lAgWj z#8iFcC#pQ)7@^77Rs8v3IA_kB4=*k*PV1aL zVFE*LZZ4=%-`UwY!!Vi6#@4p*U(MUgyPiCMe)#TP*@FiU+T5>>-j;LlU^Dx}*RQ*0 z%#hfUe_u{dPw&L3Q>%>I>;L~1=i}oG2naZ^v-tUkS68)jZg1l?&%4vGcCD_FvGMFT z6+c(ate;~mUU~ZCzrWQ<+1cJto<8l|zTN!%r&FiAj8adDT-sTjZdCK5ASo-$tL*Kq z(D#4$SAXxT(2MfCvbE&o=NT1^MKu$hJUm++W}A6ciYf}ezwtjlG|+WjNr?LQuOcUo zzv(|KXT5sDgdb-ZDF3!)(+gn<6y;)dT zSjwFpg5+bZe1TzMYKz_b^Nw7+qBculk;{$J_SojAH_m2NRaF(Ao^ZDDN{7Av zbieL5Z)RpDXs9qHL5CH+xVSh*ULZ0uQZP+b#=88SOGO1smv+OU zmE?`C#~(PbX7P&P#Vf*=uUf^GeSKZ)jvW?hXJ#DCyuY(p9n@5uKAqju({r9vNJz+$ z?F$$hwrnvG5fRCXE&Kbc6x7WIZH0NeK5p+J{r!KM9z00U(Ej}I;mU;z85ul0Jst1w ztF?S9Dk|#X?frPRx9_`W&z^17GdDM9?>>6y_V)b5{QUFf_Pt+y#TFkq;_~F_Q^&YC zx#DMM9IL9V+IS?H^!3+={T9gXwJv|RAa-}zhRxd?F8r=I64iV7&c3@YbH!Y@YUSVC z1Dbje5)xXlWJ$|{1qw4}&McfZed^SQkB|4CICswN`nuSQtHbrzz5V|Fe*cv#A^U#6 zzr373?cAJ`m;e3xn(Z^wh*dj$9q1gzosWEHnQ(%-9M-n|yLMT*^~rRujozO0;6Nkj z+?koi=>^Zv$?j|AXL$1D2}8sC^5s*eh%h+B#m#$fH>>GHmtgZj2TxB<|J|E5eG2FH zI_taJw)$Jb=VxaV3?x89yIoyfA6~EDZ|1#E*K@vI?Sp5}+RXFs9XPONGN>2`bNBY< z2CV|_ld%MyzwqVF&B@t6{q6s@%r?(Ibm@{1Xyj`9cJrQ|9*fi0*F;`^Fys7u`}Wzh zr9rb8p#Fw#^u{FCuI}!{gan5A`g(>p-j)1vHVu3B*gWrfdSheq4BKimtFkv7tgNg) zbFD-VxA7i+eSQ7UV{h;6wPq-D?~=2v`k>?Q;nC34#B}}X{$~oCl0@X>`o6xt{&~xM z+v;h>yH57clB(952O3JdbxVo?bkM+?J3BX@OWKlq+e}1Uyg2TD^%s#dud*C3iO>9U zopZ;z1O+`kzKa(x&Uw6CW7W$QD_4RBUN&ss-oA9HDrjV9bNczBY2|Nj2!a-p%%3lB zmV1juT3Q-ZddBW5VPyF6^XJu@%xj~!=f!+KoSc;O;MJ=x(9FosPfu-Li;IdndV6zQ zm%U*)pyv`A8VcHzqot)~anvI=R(85xtW##D<_sUTDO09g*j=9g<>lq}e7(c%{Ox^x ze4sV-!96p4)c*YaYnXa!iq-jbpg5e^+{~PJcbDpgZES386DCf4IO~mnaPa5VlmEZH zyLimu({N*d;b6QsZ*e-fF4QXW!Ico z7(hcbRk0Bf9HOG4GFBxVdU|>`udj>r-MA6q;^LBUds}Wz@x;lK58to<-}~|LaZt4} zZQ8UspfjNunhzfM_V)JAy!#>hPFA~tPCTys2u~0{^yaSk_j!lE7;6{qeXkL-Q?6kL z&w}dqXZ^pI&PiIZL&o5WP~Dp)ISzq*7eo%a96EoG@!DL5LdEiZI_nrNeP%SaeRzzu zfuEH@v0KX6*w`2pJaD+PtCZWe>dOK7`ag}j(c2RK|NGm~(b2GP zpWXG^&C9;|iYYhzEttM~wf37gZ$J$IPEJl17M3eJ&mQZQ-Wj+4<{oyt-{p)y{!i~= zh&OrksKLef`^<`xpNwnji;v4XN1xdz+`z@Qd+*N2*W6-y{EQu7mHN5Y#L1I|?5vHKemnV)}iJ>Dm4`MvMaqer0g(PS(N7#Iw)u4t@@-5s_dc@4jzlf#YwvsoQj z>ff0$O+I;~TU>v^k|iw3$&cCWjYEQa^6u{JmwU#$-}1YWsKGThky#(lyoe1^>SCLz z=(kf@?Z{^L@D&LR8{gloU&$R^CKwQM&Mq&}`venc6lUrA^|!CgQ(@Z6+Zx}~b*gcT z&4EJ>I|>=UNlGd@{C-xwWl30}XQs!QiB5TGO3V7+{Qkkdpy zQ{&?Ph#!#lVo+N~{l*8_q5AYx$-1?!A3fPs&GjZS_Wz; zm%rcswteBt{E3wo9ekgi14Tl+&7yn${dmlOhigyIt5>hmdN-Fp(D3QvbbP{QZ{b&z zdo4o5HSqo_v*?~adHX(jF`f1)TS_(`{c*WgaGBk{rrDpjC;zy#@~l|)_i7^|_$9B38%Y*_l73*0NZy69rk6&@zD-w8J^#y@;+A@=#4tU#%ih-;v(oUWVi zn};uFZ@6zJzI+$|kw?-0z&)~8vmLqvg{%H*NLj@lE?AmuuEWO-YDc;T-tRH{eIYv~ zMI~sG(1EN)>+V`+-qeu0Eq!uT)DJ_eRi58G14XWeZMl&&WzL+QZgKrbcXyXxxO(;I zn#j!yR01Ur%82 zq+=(--%IVa?^?8C+p?o^%Rr~a1Vlw~rKhK>sH!fk{{HU7nKMsxK&$fh{eEW+T5<(B z(Ztow&28`Z`ZqTW&&=7r#IV}jV+u{+tLi)-3`^)sM)nBYH|J|iMO}5a)0{tNy0ddhe5&A zRFq-C;?FOAT-@E+Gcz-tX1m3>xv{-^^(r7JsAqR~FAiQDsd{%@wOYoqMUQ_wQxO+aDhvgVuvMIXUg9x+Ezf z!NBn8^XG-jm$NgRID59Wug`C8>xl~&1mx}OSPtyF5*8WC>dEPub7zn2+bL5Nb#=qn z-{Dl0u+C-NQew40L7%(lmDZWKKiPY?<#J7$6clj%%JGFgDGQITQCz=(M^Z9U)h zhLSyAQ$%WA&fjCcxKMa*)>2(TWtRW{uTN!l@LqDV=H0iqw?RGTMT-_y?8@03p)+H~ zjD+Xs=Fagh2c7zqmZs)6-|lSr{7;`gY3S=e&kDYLrLAq7+>#|J6K099cfZ?ab9*lj zf8)|#+apI+EpmTW-t_RT;#N%!l_=ZzAj)3TjxFoet$@JG53=g#Ph;`))XaEYB=4VB z#&*i9`{Kf4@pa!GE$Tn8bQ zMZp&tH$;m*z1?x^zUmRDP+wuKtXVN{GtD>=>vH2<4vo_*rf$>Lky zUECiP-^%Wq@%=&6{#k*o*Vij0Wajqk@9pAgp1G7)W$BJ;lYPCljDNqi1q6gV+7dct z`a|Cml_g7-BwRe)m;Lt)|H_1oGcFiEuyg)9V}5hfADI#}v*%g*`r3|OK{7tO3;mxT zOfvkaWyEv0+OlYC`Vw_zZDrY6R#g}B^G|Gjb9OaHiHT9`9GmY;Z(NCTl zk7{;KPS1?jh4pNoii`rH4*izwsF!WMG)YNf)(mG)*WSzL5<(R9tc31XeLFZk&b95( znN{X0s!Mm=x_`{3z0O@(V@vR(EPu}$X4llv6`2{uw>T0XKHVI^&@gqY?GaVG+Id`` ziUJ}gbo(7ki}|got?T$|_jZG~X=ksVOED7s`^RwC_gAMUXP@a-H!yt7mnj*^;1C+B zTD0k&vbi;L>{*?UHa1hzrB|7rWIOQh&ej{?A;Ge@w;s03*FD%`X<@M-dV3y21E}wM z-u}Ofg9C$I&5wqQi`^eTJ3D*B#)tOt7gmR_Kafx}i*?h66(YNS{R#*Pa`GxNa_g07 zdmdBDZ z@_))oy(jwf=g%F*{}p$Ym_FTN&&Pe#?fqAdU6tM0f9Jf(v9P@H(3k1`=kR66=6*Ez z!fCQ~hkg0|oqUIW_3l5o?)-A5Z)Wd!*}j!G&6*{(DCzNzYxnnNtDidMwXtljdHCS}6}u3QP3 z_l;lPZo-Zo7W2L}H8Fkq^wfLaw~vpH3p1qr|M&Onsi^`^^K7f#yu7?BZY3urd6boz z`Bw)834w0l%)EZ#f&zm_Nr_4L@8kXQCqF+wUwLi)s#Qu07cR7U+ae$&CFQkh)vAhH z^X=>XxVX7@-dePHF(<>Kg$oaEuJiKZ^7Qh0lzIN#IWsr?>av>(|8@6x74_$1U?cdg>I{zJ2>_ zzVBIaZSB#rgasgbcl*mqyhyd`TBPCiB*So#M%N;jJ~3si-0SbwbMWxEBqS(o*}C=N z)2FParl$K||N8YyNlA%`0kkf`XSNxykx|pxKT)BfppiCZGc&QWva$~!K0J_enKu8^ zr=mGlrCf{M``g;uj)h-e@0*sU2J%=_6H|}0Ip4W+=W4E>J$35P{{R0@Uo|Uu;2CK{NS~!J4qi7b^){lRDd>pYU#dGhr=v^h6Hnz5w z#dfAwj`zza=I8gndX;tK)~%#lTQW=iqGn8)(juxIreI+)HG zJ2FyIQUwJCp!+`Ve?5HoaAI;Yb7W-Xj-5LfE?UHte}A8-#PjEoPm{%^g1{``65z<~xAS65SuZ}$KH zIQ#heT0Z7X| zix-xbKHa^qvy=0>#01cgrlft{9*2$l-C|?svaqt6p5C`|S_>chm(YHBd$+tiyHpaM-(zpO;tk#U$PX|G2N5JlSb{tD&!t@64Gq1y4_j?z;_YJl))sYEk}f z&VlJ{*-89zHZwj~eRy!Nqqq0y>+9=T@1@sHnKI?Uv$L~pHvXJDb?Nfuk55ikm#{9= zId%FptDQ7+!|L$$prhuDSG8=}V#3BF5%B*0SJ2=!XkpByOPdaE)Q{W4AucX{PW8q- z+iItvAffVicUG3x#>U2Wbao!ReOuZ`O}MVEZiZcLRrBL(NB({KyRY=MSXWn9#kEue z2@ekshvj~AEpq$%`Z)Ob#5BxYYdgi1?Sg`X7p_}(&NOm9sM$V!|D(r`KOW|{KXC1u zSW;3F=wvCDuDO#Y9WtGn;QMCElqpfy*RNaGwtKg=S^m90SF3g6C(oM2mHXEJ^Q{#t zRyc%(Z9Dha&&$i{c%Q6c+8K#P{o6~HFK-q&BpU7R&TeUGxiwB|?M|8UKR*h2zOxguvbvt1pP&5x-d^6m=*Y;p3=KVMoV{kr5|#8*pKoPkWhMRj@o|P(uGG5t{eAcA z|Hm%4!NbNZBy?x;V^1%yMXOe=y7tvP=SIW2*xgC5uB>D_`deoI<7eWx@7f1C;nWUWbD&q+e8;xMD~>HV+QHAv%>3kOq5t+dvuB?+e*NZoNJxl5$_asr z%F2f~HYP{xF4HY4Dw<{c?b_PthwtC>o0^)gSh-Ts&~W1Aj|(?$)Yj4p2nzaiwJ~t( zmMt5yuj{Q?z505k<;3~3l7HKj<>l#3nKC8ot!9|<-5THX#+;m-J+jtf{`2jie);hI zetq-7goIO5G)vcg-+JTc&!09Mf9}0s{rz2QVlG_jeAsi})bc9mJV4M);3)~{!{PV$&;I>OaWbXrDSL* z=;h_Lqv&auL;R$3=gxsD9v zIl{7P)hZ8;3)x&#m0}`S~+4G9KKuzBjYvweauH_e(P}G<0-z7p`1+vRs;* zoBPasdwJ0Eo2}W`4T_$4?0X#)(tP1w$sgVLeRFo~+BIp(5|yG~UosahT$7qXHAVwVR5nY-sT=6m%UZ$>grN4Gz?sDBmLYQMK?D$6)mlLda)eM2Nha2RGUjlNfkXU`uQnUNm0@9)925uUEzyYtmt_0>XneZy!@m&b9|2V zNIHYJ?(ECIZA{19Npt7=etUb{ean_D9(j3r&B^U; zZ9=@fyr7#cKfSuDos^T~<2TRdWTai{DG{T>M=s}HfA|o}xxt!&fiv9G#WAGd)32}D zpB^4&-&FkEZ_)DQ?nXvNQiWgsT)bD3dvy7|k}nIdTY+|P+`D)0$G_k2FYc?Y25kk3 zih7f2rlP8vn4En0r}iX)rtItM65rq3n_x7vprGKut*zOLYHHUW><|(X+EMtJZJK^O zpSig?XpQspb8{c-T)%Lkp|_WJ$3WmD*B+~CVyVsz8cBb*VnuI`SGdw z&T5&e9bPo8{MD7t)y|GVK|lqw0Hu|k>(=Sz z2dfv$&jkJ}Eq483HUckS*MHEtrVfm1pz{Or-_ zTC_r}1*0+SmGbD(Bhc2e6DK?Zmj^BX{r$bNm6g=VlP7J?D_>18n(5)?b!fJEzJP>; z#uFaRSGV1}1yzkgLqk2hyqsKJTUP`>e0{K)eTIF#omI(;2Ko9w6W8!5F z>i$K~CVcw(^=QBSzm9%+`!0p-u3u&spZ91qUg;^x&C5HNnQSzZgM*_1l+AulX6Kg! zEoj`dX%ncGcz&Mk&v(We8XONFJ_HTq&6_9ZctN^~;@&T)t=#)ARH5-MzfH)~sD?m~&%; z)qG~_!bdD7rlywXt$L+QxlWxr_2KK+r&VGr7A#;0Umy3>$0#E+vor7Ru7@WkD#x79 z2oyOgZ)?1WrRdca&5Fv(!mW4rR0_+<$xWC#m9_imp(UP^4RUT696562!NbGt8@6r* zEob`q?(>_Qn>Dnxol{a&YHDgM9-n!8VEh`JZb>a&x^%<#?Z+P;Zl5@NcK6NA>Gh?D4h1jwOT4haan5zndMOXd%8tj3okru&~Rj7V-qSYESxlF&Y4VU+bWZp zhRJM-EfXfI`wKBVd3SgBoTu)6GKxt_Nh&rra|E0`LPA6s9pr4QjzqeLhffEcS*#tF zn5cODwO#G637Wyn3gW7(s)S-=W6xFTh;@V3k;Y6u2fFrR#*7&SZ9hPF{7sxRN$LIl z{p-K}h|m!Ot?a0)tBZNtFK@5LaH3b*+#%iV;uU>&}iJxOp$i(pb&68VOvq6i27#_U4yBoBgzk!k2;&w$vg@cn*)B7WZ zf3ENx4vvcI`thT}!_%|SmqA=YqGMz7@uF+O!otlfS886jTNk&NtG2clv@Yl0zkeQn zer(MLA6VZijf;~zb^3Ir8_)L5o116Ol&q<(W!%v2%*D(5bml&1S69{+fhEhAo4<(A zT(x%5_a2Q#P!_s-S61C`4yZVL`1&=su(0r#x3|R^CQO@l%y`?3En7@XOiZL~?gy5X zn1FVtet&;|v3tLqhnLr*JJm@WBTk$+@t{ZY#QERf-zzFBGt0}%``upP*j(|fcNJ(= z2*cJshj$Mjf>u;7Ua$Z(Rov3r%6fk9hFO-4A|fKM>KBMyZM&G{!kKfdNAkzt@ApAh zxyx9W@qB)M{<+TO>(`&pl44A#-}wCL)7sK`3qa%SJd#E%$;bO#3kpDq6V#?SS5#P7 z_~ONj4|5u8EPrP#_nW(5{d)fT`u|l&r%s;^DjLtnI5QaJ-ZEJextZC-0#W#!8`%$-3Y+0Ocx1DQ5&+0wFgt10MKuq|6mK!+r4UQ_@7Uq^TMV=a&L zb8{G*4?fsc@?Djcm37_9!^XzOpjAttAWKS0TCr-CQ(m6lb(_G&?)}GFxy3(xc<5a7 z=Z9eR_jgAdnb~)wDacxtXsnCd+cjgxj4Jv26BL~V1O*RXUblKRx4F4_MRm2ZrY7gR zckgUo+tmM)S+{Oo@2uAyi*AYBYHZBv*<1Zxhyir_X3X2GSFffV=@4{rb#1MvtehCR zIZZG#GjrX~j;z-Q9z1>O`sB%z6O&ZEPppmJ&N2CiX#Ydw-6^^SV#pyzyZWU^sI0Xe($EWJ&S!b94TNg@g!%hlgKU7i(>leNAUm&P}67 z&z`yI#qK)t{RZgZ@siR~Pghsg^G5ac^-K*sG8PlkBTGw74Gj$y85tSB)+=kS^8IzC zvC&V_(bTK1&hFpO=kh!f1`M&gN*+cXOWIiQ_LgZ&Tbq-Y7uULV>k5jB9^EW^a$@3z zYiaz-@v*VI_V)Im%J<2Mi5s?Vb*-zj11$?+0QIH5eE9-u#g@Fh#44=r_vDSft*z|T zsZ$M%j1GNzdb;rczgkeAKpQj?*V5YR==G}p?OprsrUIGcANfnnx44>^zP=!&V%M?2 zjQ#pN7yl(2b!RDOe6+N%{>9RwU$4JaT`v+T_k> zpLen~A8fxa-nOvj{`IQ8brJE?mX__FTXTQ<^Gg2P+itJzJHB|4#;<30S?2i~x3U-> z+F!o=?v>YH-^p{QM5>+tEW*-gHrsdgM*ZpC(@rn__It0)@t;Nibxv=I&?&K+Ya-Vl zEi3)PE~$mjQid;TZP=`{X|KNj?s^>2_gJG#sn>1swa3pZ*Dca`=bt}+XWaT#ucHn> z-0-!q@tv~UiwUb%O;PE*WD*)0S`-_8`Q;b);C;+Le2;K2B=lt-XJn}7Fl1twq3p)M zPz)B6U}QKWsLaq{nZ&|i;NHW)@T^0S;eZT^qIXLpZEnwHWq818dbjfX^*jcKoDZ}3 d7!uy`e&!AFt2Fgr!N9=4;OXk;vd$@?2>_LXr|AFy literal 35457 zcmeAS@N?(olHy`uVBq!ia0y~yU|h_=z-Z0E#=yW(u;AS-1_lO}VkgfK4h{~E8jh3> z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYmdA*=|3C1Ne{Z-ZmsppZh>NRm^_m;I*-Xney7^w5;nMq5 zJX5a;Jt!@`e1Emf z_q#Xe&b%tb)TrV)NhNc_wq?u{K&-p_|5tNwxEP@@NyRfLRhWMVbJocdY#T0nSbzkc zs_9?$oTTC@r9OG0isz&yg+`KtguAy*NlB@ov^4e6kSXz3uL?TFX z^2ryfzB3FMb#-;OPM_4V~4T&|5@#q{HPrcD#8{{Bw)>x`n}Vopv@ zMK!f$SGMbVK7IS~@$r_HmJBPNl|3)BtQxK#-H>?r!-o$F>gw%Jo}|3Hv-9voWp|5$ z2Mn{#^V9C{tDP}p#)?dcXxx^R|hcF~Iqim$G(Kff+^_m3}^{WGtu5M(HScjw`=v$MBkTx@!Eb@l4C z)2B>1a&K?-&g$=ayLRm|$-LCEulDz%_3PskCs4-`}xr`|f}9 z=FKz<9)J^pPZch z<>lq}X}Zy$K0I{Ri`(Pz_*idYNlD7{b93+PtDU{G_<2%dBBO(!A7AyiHxCcBa!W`_ zUD{oqAGIZ8;kNfXc3Ak$w>vAHzsK=#8!smh&y(r#b&lTN-TP{PU)oWa9C|l+xnJS) zbFvIfOiUi$-iL48m?39dCGx9IMP0r4&yT`6bLVE>+LGD$bh>`LnuW!TxV=@085tZJ z^~bHt-aPpC_xFvPHw{xxOkn!%`tIJ|)4kH>8Ta;BPMbC@=k~VV2M-eV{rTiwQaZJM z*Y)-B&reKLK63nc@YbwQ8ylM!x3;d%lJ1wce|BeQaYaRiNQUE^ySv4?xw-f3-Fx+v zva<5c&FTCPA3ltTj11hI=G(?A-8OAn*uvxd1rHCg%Gp-6Y~OA^ZQ8V~)1N+l`tfr4 z{1tI~tZEJD-58?Aoryp{v8r-*MlUeSKZwyE~Q)dH467oo8FkaOK|p z4<8EpWUbvYGBkGX+*wgo_2}{A=Dt3^# zRAxxb%+$PB@tBvfZY$=lnz=J(s} zu6Fm1c8hbz#>O&ou(PuVZqJKdxO}<#G`-kWtAf|Z*(T=X#3bCcEPlq}@aNNM{Z*TG z?66?$I5*e2Thcgy}+`QSj%y;&x z+~oWFYMBJM#dI_Tw)ge*fr2P1(!rs@z{p6*&CP95;p1b6PM-8+P%=0FKJ&PKi@0mf=tXDcTHNNI!>xGLK1*@v64jn%1JY(iePKO^qeyr%zpFe&2 zbcPUn|Ji1154>j=m^g8w6Ne(7jD^CMEn8Y<&Ybz-%NLPv-@Y*k+}%~GEpU5f@bZ?{ z*47J`E(zuD`PjB1boI0i+qaA7-r6GAU{U^VPSoF4ZgH;M+}wvRUTD0!x>|k9)~&76 zr%(6r^{svPTiMpT=frtOBgwr>7O5=el{VvW;E^zJ2n~xc>gwnam^N+Np;M>4SXfwA zoZ6muR|}-Ky}kX!$&-Oo^&>VoFeE)WF>#fCH#@&vN7>t3qO*E-mA}{H;o)&fNLV1? z)N$sF&&7SU)rkoS3Q9^!aTRNJm%kTl*syI|*zZR^{{G?@FJ4?V-+NL|PHt}N=FOWy zadG0r34zSaOs9_hlP9iSyY|J^)zf#Bzn|yf?H#RQ>&(Xv2qZ-@>{}zrDH1B;ejBQ~B_> zQj5U*{r~qd9GPjHe&y8X@4K_EYALn|NJ>hAqRqn6a^=0xFJ5GTvj4+3Z*)F=`V{i| znYwaxbhKf~ivW;aAD^5QUKpU!;7<7JO1~Kfj$7Z(wJsO4xHzTDS#5Dp@RXD- z_5c4d#aFbdF8-tc`p`a$Ptn%wd@=$~91|x`RtCkv#*G_2yu5-||NijsFw@Bw&(6+f z5;)w(8@zh<|J1MNH(yIXnLl$)^!9fAr!cT!4TUQ%V`h>wro z`YG{n8>h3g^TY`g6j}t5PEXTi63`A`7qZ$s`}svk z{(95(@ zZf<7Cy8h>L>DyaV|Nj17{OwKTuP-kT-`!o_+16f=> z-`^j?jeiwUR8&;)<%OW3q2a3Y zm41GGSwH3L|1df%_nRBHL$}rG;LhUb2BxN|mzViwo!+u#OWcp|%6n({xIG2c_Y6CB z?zG(==j6oXurRh$Rz`*))rhg9tE(#Q?(^K=r>1JNu(GbyEiNon)YpH%^R>FV`r-f$ z17qXhQke@|{v_`zdmGhQsG+B)*V^}9>kV63rle(&igDVRg#Z8k@<^NYyuH1B^30hl ze<}S-KePYeFYV=ibF~DD|8;r?=G@-KD=jTu_v0bETaU!SKR-X;+>q!zabL{*r<48d z9HXOWw{nYrI;lQ?L&`}ZF};`*)$jLyKU8{qYqtB@S*ABPCbP%a{ZzHGva0$2_j^TE z)u(IG`HZLfq`6uj&76PxPoM73`JX3w`1(HGeBLhk^|iGxUcY|)=#f)WQc`2p$&)7; zZrr@Nw_tW=W@bui>cXW(|NI+1_bsYHn_Bs(rgRO^)4t`rtz6c7_+1 zmYyztJ#*G9CXrw5lmDxxrKPbgklH+D;>5ru5}(fJ-LL;&+tl35y=R(U?5{gtb#-(u zT)L#BtGo8ZZ=LL)$G_aGelJ?(^E3VV)6^Fi7QT4(YE$ZIF@`^X{;UXI&X;?8o36m; zW4+Scy_GjMB)Z<4zj33Xv{{aVhDL|yWHnI9xU2N_v9GVMd)M$pMMa&NVc2}(LV%cl zoKIPq*<^M9w9n7Z>c@mfN6&tExLsIS`0&NW?v}N`OdK5@vrbz4FP=SRO2`YdPxik- zf%4+|dilD#x;0T-yI#D=(2Ln|V1{8b*Ok-$HRrpY&iC>0xp4LB(My*$UAP}zP_V(r zMc-3xvC+5r|NpdWhp)S^r?U9gmdww0cE!cTF|e?)iA79{pH|O#{Nzc_fVg*pPAjhJ zzFD&=_4G6b8Ox$24u2OJ7#c22Jlw{iXi@a!MDgpa%*=^%=dRs0|I8Vmx}Q&{C%yk( z8TV~Q*CSWmWA&@T)=J&GcW;hO<)ppU-;4hKDg~7>Wu3bA&kncqPmk*H^YdF1yL+0b zcG!g3vsYXFWDNOz?%cVs=;zDl*HyjS7#S61RQ$}R?)O`BhHr0ghcAh6>yc=jHcc#g zTh77r=lPYDmD~7aS4HLJ=JrmWEIe`IL>CvA6>C=qXzVC>$aL%0EmpmUf202u{{1Z> zXIFEgQ&|1Qy}j1^_U${rH)m%3(nmKoCTBej3=CZL_}ucvi=96|JKNdU_w3Qp?(@CA zT9Pw+PI)*vF`b^KoBZX)#fZpA(U)h6-rU&u;>C*(SHt61`aUiG`>V9>&qw#1oE!;@ z0)+*8a-P3?=jY+kam)0Lu)5!a$B%;(Zud%?FH1h&H^;iX@9F93;y*t5`TN%=)?8lh z&;H3X^s4Q;*uMHc@v6uEk0qH>^y$SVCq6P4Xp>B<|WaP;-{t%=`1FTVb7XzombMJLvt zn=)kz)BEMywtYJPbN=+XGP1IaSN1u4e{(Zf!Sfk64^K$7{Ac~_TeokEYpyfDSJ5n{ z8};F|{{9X1|LfTJWFiu#P2?0-n=pO)@iQ}xuTDBS%QTyVlXIc}d^`O;fBr1G@BiJEH;?p1fD0ufE@W?%ut73knMb_4M=>MQzP;ijIzE0JRXa?s|T<&7O0y zOH>eZm;;^}F+ z+FP>AQ&N@`l$VP)WL#M>@x#}zqKDi0#lOC~Dm+=;U+>b#XWxyCjEscd-rg?0x9Y2q zY1S2i;N^ayS5L|pCuL@8&N9tb>*?)vJv~h~^s)0i({n2fe(rr4wmvTQ#iti9G9JEs zsmbv0<;#^;YUSnShIM}`Lig798UHemj=s(GxWmcWxwW&i^TPG(;>zxQIz{W(o;l-_ zn3);5K>NQvD;pb^w6yfXrAt+BZOv9!^O>PgQ&ZEjc=6&N58LHKzJ98{{PXv3@f&Ud z0TWhLf7wy^_{fID!yqrN2wy+1;?tAPRdHoy+g8Ny-^bw6%*N~T_SV+cb?esM*qH3T zaPP~UoE(?AR;3_4N0xX_cA2Ub3ThGWD199^u`ixO@!ITibib&YheNUtU~v_L*tqnv#;j(dxAD)v?(1akdZN zzSY&y(P>$~emz6W?%lhi`gg_G{dA3pj9mH1)WASsb=X=VVRb)|h8>lkm))v+es1pS zS5qw$4lo!d9%2bC{~=ylKb`AydA`-$pPy&0_whDv*#F#ba@VtylhtqBy7lPUv$pPT zZaqCcP#6E+-fH9gdp2S^5dkkEQ=_7!)YQ}}s;gI@`@|5nCBt#K-`t8%PdLlp-&57q z?Ul2w+EDp9?Ox4i->tb8*4B^TzV(fYlA1Yl=9Sgq{ifO1F6=B$pEP-L=G9eGZ&{_K zrS-_!N<~LUCnY6u@bS5Mdv|ZYUpIT9bNebQPaFS!IopgYD+FiGoO$HPkp=75`~Uv- zR?;kIM%LdpUg@CCX}&_j!WS=IOuVzB5LA%exf65d?AedszJ={o=W1=lmb22# z%0AxBjcwPiT_rCrFs7$JXFBcc>nmwnW%BLYw~|F4JP=Wzj-2VODZD?Y$r0VOdB}QCENb@ZrHWUg;Ot)=CEk2AX7F^LaaO z+T_W?m6eq&?Ciqg;_l1+=HA$rD_#2PO69|i&sWFpHuLoK+>(2H+Xb;1eSLh*?EJ@$ z9&KH*LgU??oy{9J8ValVBwSwR%bI4>(cizk?Cq^DudaIMO4t7SqG)OwdNnxjKm+58 zmoG1_kGJ2nd2?rf|M6qT+ODn+H%>hz^5yGSPEO8)$BwmKTN}-MYTBJ8o|7{!FXL@y z<4wA`DYfLyjfwJgKN@$Jzc;G?SF_bp_4f9B|KokKp8o#NA0BR3QBwoOmYUCufCb`9 zLPTC3Fk;x!@}NHVlf;9gd%aXVC&i`DoH=vHu3btk0bir0p7PRJU}HG-dyk6esx8;n zL>`u}|8wy2a(~9BdzXRgWKq$j*SG_;syC&ocm^$f`s&pxsl{nYNlsN&R<~~5>XEaZ zwKe;?n3d(mkXiroBu}P*R85^Z(=#DKAu%yAB`qx}G12k#G~Jbfi`$ktuU1Jhnxx`6 z$>g2su5^`_1ILfI=iS|vX(i%0No8e=R*g~A<}}{r{`1vLO+zm)^q8dLsT#6y^2M{W z%_FzvNXFNGox02!G}amC)H-*owXN;kgU#%lGcPYoIxDZ{IZ0)2l~&H_7k|IsU+zEO zuA;g+8*K1P)zB07O5FQo9?mVlmw0VWew7a`Xmn>bn zvaYYscS+{wFpIG1cP&(3h9+la^-Qn6xLk3P)}sB@mqSmSE}1rMn$KLT(5sn>W@gjw z+_@ueH~mSs{=R_Ou~HA#ZnwU??>B>u^wuS5Yt6ev+qZ2qb6R-f{IjQC(b2mvv>%^p zs=LJ@ntNeqZFY9ElY+^IzU)_j*>tyT-D>iA_rLpdiWc?Aoe!L`Vnu)+>%2n;4{|c! z-6N#3SlJ<7>x1ijuOkdUeml+=HIm$#b2I2`j6{IlMU!7bhw0ZozX9)nKLeUAMIM4b@rIbkvr<@tDp31X>i8cI_JpV?Uv2YG%(zL{J@Dh zM`kP#57$e*_O0~9DIY~!)n`YidPjb}rQ5;xclDjg8yY9FiiKtgNf$1T`Ock?7t5@x zt2EbId#TLKkX`SX|6cLZN-@$}nZNI++uP?i zyTdjWel?n9y3T*`udUsC_hu(vSkbDk#GR+2?O&@2hZJEdguG!aDy*zukgHW>Sxdj)|@FYk0JNY>Hp=j6FHn5dYAP*-F3fO z@gd9fKPw+=M7y%4dryy3_2-(hM=bZIV>4UfmluJ)?TVi3r{0+(6DO=grcJ6umxlU=zYMNGt*u`~&Qt``^XU?Sj`tq{o%SoG_o*q-#z7Wrl zRn>0)r%a#T?!-53s*35&n>T&t+s!?1_nRlSnElj7<+&jzLvN*AS>`K!ZoYm0&ZS$I zIZs>??o?K0CSUtS&^YbPfs-dYJ6wF-RYKLKelxoJe*gb-%RldTx_=-5l-iG_rl%X{ z-ZEL{KfiDD=FQ6vPt;oIHM{4_moFDCuHC}x>=|_ODV@mz@O3x;* zIXx<#LHDfZ8YZ(%R`)-4^=jzlhaOXB__$39@qGI9>Bo=9<&Eq9RJ^*ndil$OC0>4N z%ATuQK1I9i+qdt^`uOwKg-pWe?P6pNAa@cqz944#zf>o^Ca?)dxmarnr{Q7^Epc443`TZ*;7L!66K+fgV ziP+GvE_OGlOOy$+V~UU4q%X6gcN8e*-rlyZ^m8)Hd}b~R6B842yS^^=;`Qsxv#zeH`Fb_Hb=~i;*W)*5URL|| z_O|6X=Crd(|Ns46TE`%ki;XT#>rpaJEY zUoV%RnQuS;P0rKr?E+1nlhq9K?}5_liqO?!Z*Ol;|NQJM>$dH+zssb|ay**Zcnb;& z63)yp^qFn8b`SsSsll0(FV3^AuE_uO{KZS@3{ZfFf`$xurA!vM_sh-Vd%CsY%ZtES z=J|a)ckW!Z#(TP+ii(PWgapR{`T9SO85tUTtG)(Zl{C!~VPs^qsrcX!s@9V5``cR{ zX)~YDXOABr*5ChU(KV^nJzBX&la^e+Sbo2@eez^s+v;yuN;KB@ZrETTBO`O=l#Hxw z=xK&N8Ox^jc6K(l`uTUhy}vJSY;3$O=jI|U>+*Lp{c^TRCnhMaGBP(e=i%Y`@%4KA z=}!i6l}3`Dm$H-I-r9O)MPT#2z17)PQ?7gEOw?0|6bZP6>t)~5Qwpxc5S9}H4U+Wt|^{ZCsste2g z<$c>f-P*WytL_DDJyTOr25W0;hD(<(U%Y%-d&9dGfr~l#`JW%@6i!J^-B|rSuZ>?m zZo#~L`|Mu6e3>dxdo(b!`m*Px*GZqBot2Q3G|af5;M@KwYE|TBwTTlaf*g2#O{8$c ztE;PvKR-Lm^m<#)%}KjTUvH}XoE8)mbmHX6h4K6ASYO#zerkDjb@g<|FQV>Cb0uSU zm2|ovbX@gpvr4E-^tK$w`1ts@axEddc9pz5^z-xc(6x#UkB|2!=jN`RbrIaLkQM!x zd1XbQj732Ms8zT=-rmQ@=gKs7Rn>_TCIq~E&b{Ws$&B~+_JZb~{N`E}etmT{Y3=U1 zzg2$n_C9fWd6KT`o~hZdudRLZ?3q!?ivW-(q%Dh7OtY?lx;RUgEfbQEIB{vI_s>6{ z&xgv2fik?46Vvy1ceOYC`|$Aa$#dtPU0E5NwfDuRxpuWu>FMdS%=6=(9si`Ydc(<# zzrVinNSSnGU0pSC+BCPz%Y3OxkB&4jnny}qM}mE14JEK_oka+&#OhsjH>U;X#@x2K24gia6Vc~d(WczAg&D?h1Rym-;|-n@0|^#1+(w^T5y zHC%D>#a3={h7Vu9giPJJYuBX7la;MiJl3zBU-zr?!i4}epBW2Y1}sV6ux(q~nHh$z z>+DNkg?xFsmT5tg+TuU|ez>{0tuk_UekvS2->!Dm#2G3pb!2U;rnvXZeZ1%{4=!C-bH*WlBe0_EJdO6S#R7!gK-80dN0v7&HGJ`E${PzWEq}(&%z~qTj+S~yrV~nQBNZCfs4^I z&O0XTr+&&6m+8gqtLdH6Qeaj7`sDZM^69ttU7p9pB3JTUl z)mcw7S?8p-_}SUntJiIProMP{`uSDQx~ryLxDa4uY<%@pNlA%CNrF9F+p#BN#*$B; zHTIcJDOZG7hw<^M$U-xmFeeVyf;cP{u%*0tk_4KmiDGeb_KELp$a|Ng$(d>QBYu(bd`zunH4 zv?x$8&%gKN(b4W7KY!Ym@4a9DKi2fA^?_r$|77eow7l(eTN*bB`Kh=vF%_iR^D*gq5H%7go?{cYlI&*v-3ynepp>&AJMd% zjqSO+ik81kR*2^PzxTK~)h+z`f4q3`>F&lQfucr|j6Z(=zP!|1JZeiu{{GZ|i$q;)FP4~03i+m$V|3}-wP!y* zKAy$rJjp9IElq86`uS(C*Y9`p-hSv`r&rL%6KRbqd!0Ug`ZU8ZnXUNwxub^;If0rC zJ13s>m=vd2{QO+%pC2Em*0H6p{Iqh*$&CB^YGeKwH|*JyRJL&P5~EE;PrYt!&tGpg zBYKinx7X~RclY*sUwK^6GQrr)W7hWc^Kv=4xi7D*oD6E$_paD-GUMBun_r|1SYq!s z`KM1=@~Pz8o5(|l4|CV{7b91dhvxq*k&3r-aCbyGyizh8nEG#Ts z6TQ7pR67h*mtC@$*`wmgY-D6K!@k}QH0HXiNN1wT$8K-&p;hcU<1OWzG||X6`J0Zj^Y4#d6w;Nub#7?CD{dB5ZPfP2}W* z&Fs@(K6rNJO31z+kGPqbm^N(R{`_&jJ!lSHKgOTq;J?4WZ|oKR-X8nQJ}$+1c5bHzvEEn`is`&ex*iVo93{ zgT?Os$4;K?e0h2KmO`VNq6AR`U8<@9*#LKR;}jFM4@tY5KbD6(5tny}5b#=H_(J z@WZN_M@Krpyt>-W$jl}nBGR&TYw5~k(T}DD78MyiKR-YH|G&R;EDD<*Bv{_vtzru* zm@EGLC|sD_2^w=ebLPy3ty`ZyIM{sT`0;E7rYUEcNs}i_8mIBBTeoh< z&YgyZkB$iC*MsV@yt`7?*4Cks|Ns5nS@ZLg@&5IqT&%0Z*Dp&yKQF73V~V;Lx0sHC zq2a{b+uNpEtV`D{JN@Fk{r@MY_4hwHF;O||JR4K$HF@(qnfH6Y&wHb&;`zV$`8iq8 zqKijIyRR;rf9YbN-CBQ+#{PbOF)^_>_xHyKCwe{2Io!qz>eTNp&kwzMW~TAa*X#G+ z*jcRZKi^JOPjB6k+x&cd%Urv~vQqW*^j4*=Tept&8Ye%$x}BYzzW#cr?Jr-x?3_1G zE__{#W?{_vpeH>G12jO(LvC)(7T>pTU(JVu>{nKWa(jDw8yOjScz7rn7)*G3d;8|x z+h%3&@AYopT)dK9$5YhvU&JDQ`#&2FaNb(K|KF*Tlhp;CHk7^&sGJs?(FPb6_=@1WHie#nQi9G znJlcVpjpptXHK2sa(8#Pv9*=7F4Jk}lLfWq{`~oT{>H6a)2c2^3K9HMtP_}&qy#cF zy}&g0)|4w(Ld0~VT*}JKEG2xGzo^SzSt%gOx^SU@AY;G0bA*J8o7VsP zt3+$QPF=QGC;Hc~Um*MXWK9#Tez*zhH+tIss=l0wGn_-xIY{B~V z>!bE%US6j3{`8$YbC&zhUo|x~Ep62_(PIY>G8!8jA3Ai1EB4=$lfsiGPhJ_lJ#XS; zja5qOi$R0hE8~iajMheNeRSUbzfNJm)5Nc@uFkQj3MhL!?UYMgoE)ehac+*~j9IfL z&6v^Qv@pQ>_S-u;dGci8t=ZSv7F2zG#rn?vS^T%vfs5T1zJC4cl~Kk81wL7; zBd4ZnU;KA{@&szLd?n3~$!l~G%@cJAEy=fh$CCCipw+F6|L+x{&`NOy>GtD}%f1OllRP64uqt~xb2gO3!+gpMA>uRrp8uZ(8ZXVkG zexLXCb+MLJUo`&y{?7j3*4FGSS-F3{@$vCfd!n}GoUH%%S-wSJ)#OGuyo1viRA9Cr`c@wa2fR?&Wsz;>Dbsn_A!R z|37cR0tFo%9SOrE7CAY&rK0gOL50V`K>r=ZuiKV6PmEJG&%2Xwq(gAV?Af6F&cnmA zVZ(-mKR-VH`0-=KRZ~O5ivd&4PoKxPJ^%3g=ZY#4j}|MaxcoeIf+0OUbyHz!sM_pC z=7UFFBjZlw_HiY?xUeu}We{t?wyf)GB7>j(j@egZ37ScKzwftR{ok+RY;0_AZg1}g zg~U=X(W_5)W?fyi^4d(R(yWQwLG89{>ta`D)w;U7Z?5{9wajmB)PpeZeMgSCT)K4W z!{^V*S5^ehm^srh?To~u$B$oLUd|sE7sn%OHD$sCfjM*MdVjqaxN&k|T%6qhzwhfm ze*O$vy!PbDlLgC{AMcSg2GxkijvZSnHb*7YWOw;{H9Na`jm+$mCQLZMZ~w=^$H!-( z`C?N~j;DKP&o+N}O_zh~m-R!Nx-~vJrFRZ&#+si+Wp8eP%1JXbvn9)x8P)&$!({uYYgO9WSwDXN zHm>zKr>Cbu5tM#z&ci!9iyJ;2T*BZ# z-%j`H`O=A#1D%|h?$>->#*#bz|{!zh3o4Z*q2&`_HV7Jg7YHDquMSAZ8*W7y_!^j-*Qe!gpJZTYsAYA9HlTJ=n|9sB+{R+3e=K1&b_9*K_e=lA%f-0)e8#?vwY8XC7hdM`KRPTdQtI{l$AjzQ&Unl6g+eSW!Ej4mw&ui z++R>$u0Od}Q>5TA+Z;>g^z&NrmX;Sbscy;ReZOyY&c`W_Jh!S$ot<>Q%f!$y@ym;g zbF9nztjphBSQ~9#R8%BkTV-NrXZPpZ?flfb+>iIu&dzFGzdnECwaj~aEcHt7aD7=k zeaRw=%11A(k?F~tvcYAx{Nuj4t&C=6v z?3KQ?J^UW?t}5YYdSPmdukSqEs1)v4_G)vw*o3%x*L~?G>E~p6dU|G97C$Sl=D4~# z-2dv%#M|3)S2dm8hDyP@7*Mb&YA+$rzed-pz^-?%|@=2D3rZA*?XnJhNh&8vbd^J3-_mp||CAJ<&s zx^$w{Os}XCsa`kJMc=>gjo;(=a%;$%6qBSQ98%_aXRfRa&b+-%_uRR2t1>?b3kiWH zf33^kJ^AzV^P8KSm!A<5JRlxl(>Qmotg?IGll}ky=FfcVKIz}fGc%1_T3bO2ucEf+ z_0F3ow>A6vGQYW2`Z3=>Cg0d0xGleZjgEu?!=FD>gj>RntUg+Kvr@(0OYLW%QD)$O zZ@vFMW)C%&99^<-?dsl{&5~(X&ls%F>&pxcUXvXiyt&l(jLcbswOL)Ryxd=WzL?Z{ zOkxwYlzjR6HK@7t?cLqemzH{inllULWZ5VyH}BbFlarGpVVWf}T|d6=naC5@(jOlZ z!`4QHF8K4};^LSc1&vQnPyhUO`~6Mn=jA|Sh&44fzrVdrKG48;{?4r1Hl%T~yo}C_wsy40a5B&``8Xr7$lk4)TWiu?bg!`O>*;7CL zynp&a&^boUy)&i>{8|4xnkV7=om2ly-ruv$yR*a5#f2p-EX=~%`tl-I?k`_X{d@E5 z#l^)r_x417EzZc$P*hZ`sIJ~z{QO+{y70A8ri&IYzIv+1_w3Kd>%DJ;uJ*mO`MJDK zh?|(ii$*`o`jr|iDQS(JZ2yiGf10v)56{>5nC)9^&xUPN_;PBaXyKm|c6xKHU9+Ot zzURdr+0`Z6z5iy{+`Wg3uX}ei&o4W?Z|^@sbJ0Cb1I{zvMfj~ zb7AKadoLwho6ap8R4&P@P86Hvk>;c2wk>VOwM~bXOcOnJRo8G;R@=nAlE?bQW?b3i zbbLk0|9fY76(4(A94xFl;?8co$iI+1TaM+};y-qi<6^frOmh%eu;*;hqt2k$*Vaa> zo!_F-m3Md7#kJAqSI^(xmYaOIjrY8-3qxF7+$znhmoH!L?CVulcmK)3sXh5o{m%9y zO?z1-rhUHJ`X+{>yZzPD-yFY`JkJHFC9<#nbiX`BNJ6?H)$*KG>GxCbTi9ZkW?o)q z)46rgD(BEWuWYRa@9t&3U(3z@&3XE|4P~}l>UKZbd(UW-g5J}ob=PldMylNDRDM{d zb5gO>rgFxTnpTyGzfIV=)3tTxuH9I$?a;~7a@~x1GpwU0W@oo<+o!kf>5bSJe|DpJ zf8SWVG!0uhkGJl}hs3S()AgfH9=m#)!QfK+qjOA4*Rn2SO9(o*S;_WnVBOBhJ$JT* zs!p29Y`JsR&GHy7iI-E~?pwj_;dfi=5dBzdH(P3 zwB(n6*tDg=<*m5<<^YaK@@m4x%56Jt7pk zSXvsoy7(c}nfdGA$eJg!{rKIyGV|uKsne&r-+611ly^j+)Us=Zcc4pbr_=QS@!xFU zZd}`bbYG)wUhSPJp3D18t$vAaXm1Hwxkv2eim0twS?B*uSaQiA|DKJHk555KiHe2} zr+9eyt!=s78uD8Wiq+;=Eqya-Z}s-7>2EGgnmo(*&-}nS{M{jHb594V*m)e;(`NaN z_sz;@p}k@Aw=J3#ZhA&0Zr$YxDw&tEC-$hU+@c%13)B!Z%e&+8_t)2-+7kCl8n1}V zu#?^QUrx<8sO+lVT2GHwCxLqPc^euG4xMimt~8u#hWVYc;9S;@0E#OTz?lZsYWQrg(fi*QYb#--bZftD6y*+>Rv6nY)+_-NEBc2IjA)W7nbWx_b+Jabh(OG>)N^VaP9`<~qH-!1EYB44rPkJzEb zm-`LYW_hhO+q%MjgI((fs8Q*(rw`unTf+08p}z@h5!_uF^$^sqQYM@zfAyWgvNz1C>W&@Ko5zW2bb9%Pr-afXg z^!1Ow-|x@2+?Vm^$Hyhhmv654m~^l5xh$WYO@v-^g7=}*r@N!{_Mdk5@L;&Jqp(?2 zJIo;GhQY4#_kIBrKK*p~^{e2Yjm^d8MRikx4+Zb2{-F20exLt~n*lPjECQBS%igp3 zpcX0}>gpZsw{@=m%S<6oNlukCwWPEJH(Tkm-@E?4TD{()@DWR1Ufz;r%ZmR0tF^JU z1ua#&c5SKsj`z>!*FW3){odmI`}=O(z749^rs+f;YULI$C@idew<~&EPU58{o+ddr zCQQ?fo-}RRu{%49XWCYqvGd6+2wd#8R4zYKv&bmx#sn)j=3rb6$u3o<{>F=+v=VRU<=@jmfG;XW>{LHZYT})_Y zSeTe?)t3d)+w<=1sod=IoI}^w)z59-ym_ns|NnB?Uqw~bFzw6?rmtb^Vmx18TU+`0 zthu+klc$z*VPPRCF_*l!(D?9h?avR+H+GBj$uyYd&fA|CRU#E$x8soR|L7$yOCDT1 z-}^0o%kia)xvkjN-`_Fs%pD)O|4Rdckx|wyB1=&&dKz0){WV>lCxvBcn8k9veaAL$H%9mt1C$R z{>Ef>_kKB5eSLm&bMt3sXNNC(8y&gwzPgE_;lZOvTQ_Xj@O<6&go8|3S63YcEq*)2 z%fkcOo$%qq2T;TB%skuOE`?LK3w>R-yZE_ZW4zD4!|nXZNl8kRCw@8Q?dh5L=f_8r z{CjiC@6B|(z3mj^>goE;ca4{2iZ}_Bsr7Kb))OdE;n;4MSMqCx zv2?XbV;vqC&E86^||KyG4TbHlO3|%!l{P@8$jO@njuWnvj zJS)>w=B(_>tSHfH;p#10wVqW6&S+==P058OpJ6b|zXxhg{@nlnxBZtdUn;)52weGA z-^^^<>hSfSUM`<+x4F-0;e$Ini+Q9>R$N%^|L)zp8#iwX3J3&b6;9onq`p|uxvk*y zGv9f3wO#%F{kJx4*kHiK%>47yX?<^92Tv{Tn>TOv$Xbh~r>944{WWL%y{3uEi5C|g zl7Bv7@|=_NwbvCLeQ&fga;M4M3sc^$-kqEi-6#BX>I5f^4$uCFg{P9`RPB{iG+QPt z5ons+#OcSQW}_-o%v>Dmv@$KK_tmqjnHm4pVtun8#D(76wb6K^bNuq6p8T%f-qg3Z zw%*xY-Y;MOXX3`><3{-(HHJjBA+`BjL%$cssqML7=)G#-nzTAKQ zq^VO~gMudAGIDo!|MT~6Xlzn^s%`bRCtqIPzj#sqdFNA=-e3)p9%*wvZ*OlInQ6uu z6FzO^`#+;PT=k!y&GYbi&u{h3zVh;w*Y(iY!jEN@PpuSH($rQ>I^BGPeN~I_BoU{O zC=oU*wksP}IO=vs?TFYJaC?_oY*zWftEWW6v%`J9aDA&eJAd{%x1&3r2CNbi7XJBi z`FzkwWv{e(8h8zO_19NNpPilk^2SEx;%8?T{@wrUw|?xdEjNCjId$sM-SYdYmXo0}(-lan*=>?qv$_`;MV^~JW;-#&nr1h=%bI2l*FZcIGP zCbl->_`A3E8CD`I=hXgq*q)O5G%0D*%&)JvT2zbuyX$E3$w_7T|Mw;jpC9@t_1blI zy!z#3OD$)eakT7`N$plMobg~u!n>pQAN&20%{zKe>1U?Vxv+CPqIL$|-euOi%4|{n z-hUwP9$v(j_N!>sf=30##gBh{d@N&C(qUKo3$%vMtzT|!)V=Nb@t}=`b1aKrTv*7w zxBC0B`}gCo&b3liZQZkHPkLT_e0+TF3vWL^K4x}46+^>`#_8uoURD|C%~H~qU-?%wL}X-7H) zLB-&f%*$=Jwq~!MR#{!Wdfq~_k{1DG@9wO8b!BVC$45!A%cQN#bo%9Nl@t^foZwfR zYg=vh@83VrDv88HEL&5##dH?b{{Hp_G{VxpI#BiBmwUTPyC(-YS7qhpuwPoopd=#_Hy6THY^!B`` zCnhRKh$Js^W@l&Tle0Ooz_EEn;9|DByUX1<4(_S^%)!a|@WsW&qFFMjos%xE3|{`? z&Q4>l)|O<>}{(uHWw`|`V;W(a?Ck>`|~?fpJy0s zVGMrfd+^4x94pl$OO6W&h#gpZ!h6-}?1lbLg_{c(uXGNMx{}eje!9L~ncOP9^Ppu@ z4RdDuHLqE-1~h_XTlM9^|9|iQN9-t2oL}>abGlyaq05&i-`<}8_~pyUN7`=g{c@}e zs=vR>dI~BCp3kq>E15gjy4)!JoD9RIOP3_9N;Et@J!AIO%w**j1MQ`a+LFPjv44H` zwKb88Zk!74oOJQs-QAg2SBbj!%N;$jqKNm!WUYD0$NM%`d=yMdE;p*(WoDeFaaw*} z#R>h%bq7x!<+@+I@5YtQnpEpdSql__Ev)5-)_n2F1;Q6MfETL zraVajMZ)`q`-|1S@Q5qx2VGvI=DW&t;Y#P=VQV_inY{OV&rZ~IUvYiC z+~j=!V+R(c#Qqj_Iym)(_8+M~+WTAo9Q*m<^Ofyu{iBy}tGV+jIqG_jujpd08|qP$ zyjHlJd~t7YwMq6hp8R}J+rPcB@t6D;(01plxqG_K&9OZEygU5k-&<2bTb!9UZroV% z{-5c_jnX$axwh-&8r`&hVbISkZ=CR)VUD$hc=haunh)pH{E!CO`tiYIiC0pWmX?XD znaphX?@*u9O;%K7OiEI)k-2mC;Pvp!fnHKUi&9Fyzl&WL zv$JXMUfXs)S*;Cw%HQ8xUt@IX>Q&tf=J8dwOO`CTuaYjSxL#u6VLPO|9PD;SX-#6DIm>#@#2Rc z8;v%qsA|S@a-Q1sA_L@_o}L4zy#9u+m9ntd^XD?xQm(Z}roUA4ofUFxqsJw0_c(qf z*jj+o=guvQ+^pZx6?JT%t<{TpwkPNLPJgj=p?KckJ6&6PCoB;FIbhxF-5q}2X$gND zYkpm`s+qmjEq=LB&(o798)ry-$!}dOE6wb$^e=C(i@UQ+ixH!$s^;>H4O>~Ot5?Lu zTCR+rs&%UV_0?dtS$|TJbJv0v%yoEun64Ts#?{)i%y+tg+`f)x>tc@hUBWCrJ8T#~ zzdB#v5nJPCvpery((kWt@AU5X-e2|i$F9%UOG@5#tlOqn&)S@KRB}_`jy*Q1PMn;L z4-!&?Iy(Z?X6&%|>YXko77<#ivVIlwl|S)DA3p`D%~=&Xm2;VwsKIo8_9Ofr=w_Yj3+*>A~X=uwLmF#P44qm#n$>i~rCE{6Evo!hTY7RA)dfxeSK>qr< zbtV7T{Wea&9LB-=zxG4CS=_A?o$cx`o?PnmkFNLHe(SEmm9-K6CtWyFlQ{X>+WDt? zs;jw0iiv*xu4LomPY6A zZC$ufv8t+SRlC#6SFePmq)z?({QPCujWv_kPk8etr|7@wG>26?_UzsNch%?G_wO^GUs?Buxo+APlhjQo z>uoC<3IhyEo0=4jcyx58bRN4J`t#LA=gOUDE`EGpZ8Rywac{`!7xyRkXo+y;-P_~2 zzwWP>>W=4~{r$^JUtcrHzbBKNoP4kTf9)-vhE7@uFB0$4SQ>AO`yXd}%HQLXk%v0~`ypGe= z{(iBm_t2@iPFyQJ+CxgFze}F=^UuE-@rP%qnO^mI^|{8T>dm?5)qC#W&pfmH{rBHL z>+DufoHeVfk(u2rs_D-h%VIV&GqVq0zp^q&NJu<*b8~a4p4+2Gj|6`Au?a4zSQ{nU z5$qnj;iL|OmQa$!_YAg_DfafC#pa9izpuWxw5angbJAr>L`z$zCqzo_esSa& z)5VK#=FgD$Rx9J|yue%hz@0gNb9!4@FRT>)aCObx9-{>|;tXq@L%7ug3}@L?8oj%> zm)qFb_+0H`VRb(TFE6g;{`1?GrCqlFqpqynyxf1jlC7=mu3ft-zP=KjGiS~$8@;PG zIrrt-?8|Q^)c*E1*mCLEhyCrvR$5P{KYzUa_x^|PpVuevdt0NT=auv8w_|6ggA0p* z=+~b)&;M30h_xu274E_f*7$|$fwqO-dj)FuV>)Ioa~&YbZnd3A-; zxt&k+R>ob>!sWfy-xE?(Tldxec8ZUmZ})q^xupfBMMqaxuD=krlT&Vqk2mu?JJv&oZ`unAzS((d?b^n5v5gN8H=1VO zNVolTwmzz;D~pds%WdPvjVo5IYTCQEc5<)p^vRQ(zrVl#c}sM3w6l*7Pi19gM}Plu ze)~TR_4V~PZro5XHWs$Bvhtn8uWEIEzI}UlH+KX}f+45Ysg#Xjg_3i^Ef!s$6vxo8 z;*7?boo4K!XSibKmWY=9D(e-VBcNa=maAvmaO1YSg9k^og|xKvf^`3cb21Cu`OD6m zb}eF23oyL3Jzri+Tl?ep`@ZI>Xd-jH|K zsz=h8?eVeR!_DmcKi(BzTN8QW{CReUDbuDY>Dh7iobqB|Xy!DC{Caw#z=BO&69hi3 zUEZbDz@Q=Sc>c?)@18R@dY_UA2o65{@Nj!zKtO}$qX@9*y)zqHhwk>S{}V>fn}>x1?UuUe($;dQMh;`+K+XE!&t@Y#Ems=Mxg@ps58 z{9BX~!svPP(0_Ipj)0>qarGj3F%7XD9D;do$}Jg=s4Q5%oZZsWvct2(Ij_S1&)+xp zIh?b(leg+wn7>iIbz=L`+h2aYk2kXu^Wx8Ud>LpkMeaVkvom+A?c9Jnn(yIQW_y1)WAnwYw-ZA}e;3`}|9?}xmvMNFhAVRoPLg>tn7{D2~92s zH#asf@0-h;A3b_>;p)|=Gu4)BK6(07(b!lxD=Vw!eXY2tC}_L*iZyGF9B5?Do|Di& z|Hh377dN-2lPQaepP$>Xb*pGa*)26k4vydIlWY1sC+*8 z5$mmgN2{H>PP5+H;&@7nv$I0|&yE&>Ns$g7HEjh+Q>P1Giv7qIsl2mw4{wipwbMDl ztGTaI%5UTyO4_(@FSA(pgx}veKYmbfiJUoMUoGd)zvWJkUjP4HH^+fvGoPY#w4?0yVKP=|X*&(EK;959`;w|1T`$zUl$6u~TEl&Jx4EQ20z+VEsA~E9dw-wp zyL|cb$pekdom;k;Y}~j}ac}i^H7_r(BZm$(xwyHReVTYB)I`x`=7!gNyV*EH#10=m zEGTx(=A1@KYO134@438Lp0&c=tQOn3k387q;j_z1s`?{)S4&J>h`}fyZXAcjKyt}(vS-HhPtFtxqp4D&Oy=99CGaC;mvW0|& zKfbwX+|ttW;PLT(14F~c?rv@&Vd2@YHoS6Oko4vI{d)74`fZEY%J>}azX^X)y~{kU z?t?>4na-c%EsNXr=DTxB@H}|rdf?{FyH|f5WH);#V&6_uOl)MzW z|F)*4MnG7&S=qhsz<~#!d)-}KU4Q)ev0&9Iu6y_H`Od12up{=QM+k5n{)8Gwm4x)$v2x9 ze0$q?zn*=WZ*qUq-|O)WlZ69rONzK&J-EC4eLzr9lV0quf?J?~%e%WvQAdYIKW@)~ ze}8|^HfcX`!o$PU^Wd#pvo0@Nxsp>^S=q(K<-^@~zrMb{aP{iikCg$sy1EvYmJg5h zO8ZVKuI0Sa=ol9#_wCy^P-(QtwcF*=>~#zKy=Pk&!|2wRQtq>1qhQ^kknWJ6peA+yc@N&+-VWNq z@aD}MgXCj8=RS3d>o0Qem$RtUe{Z*eiiuj%Mo8w|$d+h6EEz4tgcaK#}hvCuV zo569xA<9*spYgKs%k>;O+CvOkh68;!;>eKA?cFo(iZJQ%k zX}a?L=b2NdPBpdLrlhLc+SSFi@Ak_VFBI(T=Dq*a)WozU^RnBMRt|v;5^Ll3O05oG zpZ6waMOe=BQyd%o+8>|2<)Nar-{Hm+gOZT9KPp?Fq-^#?o=mhkh_Q_${N&=DMw`w|W^iHM6Q|Ni#YqU41@*t(d`t=ZR$_FXx9 z=8Tl7d~I#*xfh1wxk&y=$xjI~5myngE{JqlV!CPN$K~<4%Fnq{@ka^&(9Jc9B8bmFMD$%aJ`L> zuWw*j*fG<>%*sm3Ns}gJ>4LUOH1FGI$0uWPV6%>b0)wQaCSZ!R|f5%l!g^f`lwISAG5QzKCnynmui|z0V)K;Ur%7_??rZSL0ply#I9xpVJbK za41+wSzgLrsH6U>XXUjeRc%dqcXuV8n`1er+C@}Ubi%}mjf)m3ZOgmc)y&QhinGmk z7dp2~nS$mOGP1KDpP6YKu{n*G;lTa-@;++9$;bPi?w-48lhL0)e?C0!w?B07AY(H- zKO4iIy1!D~VmhG78L7WIegRCPi}(NkH~Vwj6%`8$2|YbMCUw`XeCrQ=F1YxY>EG;n znZ0j!J$!Ov@&uvjOij&=t=x>dx)09De%r#+5OBO@@ro=^Q)O4FwwPW_$H8XyZoOHXWS%^ITKM9EqR%`V$)``Bg0}l_%e@U+AG=QP zcD$Fb@6k=Erx_Tks;VT+awP8Usbp4GR{rw#w)m${pFo4rdhz>uetv!qnltmARv*g| z(vx;(#=+vbhT7WPpP!vQ{OD+Rw(Nr~J3%RJ(xdwq*4H8FE`*~$&m$l^G+f%8bt^GJ_wtcSQIeWR)1Slc=N@@#S7Q3?-y40Td--9khosVfd!7uKi+ve zIx;e|@h~u)tG{~X3Ijv*_B__fC!efYy;}Q-%^$vJb^tP?a%^h(Fy!_%|dYHHZh zEi)dZcmLh-ZX^5TJ8q9IG}sEn@8bFJA>qEVRjpJ&`2S~h8eLhDEW3QB&zaNH(!#RN z%!%XPzS`~`J1jJ`w9LGULQV$-`aQ_|WBtzeX6O8v265j z+-vR~tRZR*eMvvCg;VP$kr z0Ii-E(~UZEIW8uK$Jlst6#KhuJtiim507ppZ`k+Zo`>napUQfV(x%57dM`CEd&|cb z6MHk=Ws5+d$XC|JuE4Ja&*FnaLRxn1vXZl}yYt}4tSA>3mPwNzy)1U~J&|1}@b6-5 z&(6@;4PVb!ADCtOMo@It<&fhduBO~fwc1mrOu2F^S z&Dvor{qC{H)f^rF>+ReB7e6?}ns81gaJg$>h_Pyb;j244jnB=o1g&gZ_szXuPSM6j z=2%J8^RTnu15~!9`X0HZ;`>MF-$dIz=l{=VSgz5vs?$MM;#jYAd#|+lp(|HJ9v|;_ zpKX@=;n&yfA3uK{ymoDx@fVh>zy5rGZ@s2hqP6+_62oPim^gTs2G<3PeD!4#Rj#eA zy|b&78+43Y(Gv~{9=0h{r*2F*$W&2T={V<}aK_Z6`SpjIiVqi9Y?82FCCymgl;O_W zwdj@0f+Q9O+o~@P5fKs+JZwe9#S0fNzC5Ec@czu6D_%X{rF!fa-A|q{PxJ^=Gec@B z$ctCX7oA&fU}t9s>Qwvho-#$mUr|e2`|!87w=W_ze_MYaynb-aDxp%X z`+NO&`us7d7O3m5;=Imht5EmZKB_~bYt?isapm;%bRKy-8PH}tM@Prr*8)xg5)vJ8 zd#fDX+?L(@yr+KUh7AI{%ikaC64fqvd&_j*Q}g_LN4~tgY?yF>0o20ZxN+mxTlJx# zqSpmpO-ax?#lhzHLva6byQbjf_a^Z0Fg;t5;nHB3zsfs z)z;RQkdkr=4HZ>YRXuU?3ctad%g?x0iQwa|5M! zAt52DrRH-NEm8ul$}PXNJa%_k;*k!)4O_MxnWh_kAjRn8gM-a%$Ctip6G&Ka+vQE~ z-oABr?<^1~nJcCQ?tHVe2@4CaiQm6(W3gaFT%4Sjx3_faGS{yC-qZCI*RSAOI`u%O z^YM+g#uBo*Y|c+Vi8?qrU3nQO6573Lm6nQ%O2f&NMb7Pf0RaI5rCu@ne%sw>5diHv z0L@!~jyQZ(617D$c-ey;=k4ZLZxb)ff49i#HrK6iy~|E6TQ%OjdlwKM-o9&>)s`(= zF6^x?2d#+rOt!MHC`bzXpL2U#Z}!~N)AbMExg#@c7U-mwlDXf{CKzl;J1doum38RU zDK6XUZ!K+YY|H%S-dbZdld~jkOX}%qQqPSiO`F!%*2Z?_>Q%#n2M(aL?drPpSnZJ` zM;=^R8Eo?wG*YRWX>~%f9V$GUhnJ!-+AD-LW z^P6YQl5*R@>onV*pJ@`4y{tpv*`UHg!!KXIK79SU+kd{@!}Iq4k2JAzFIc;_cVqH# zGtV=J4mtVEHsf_}<9WD6Qc9|5?c+y}n%2ecPP(-vv-F;R_t8TyE-nTwtDIw7Eym2o z)39WT$~^n}K1t)W0~ap}CMG7HO%h{k+~)~u=-L1OBW#?0?n%k(e;*z)gPORhr>7}e zTT37Bmv^tJsp++S$ndRsv+3WYr%#@|n!>EeQvB?UV_2BjzrWw_OR?wuowabGqLGo& zj$0yAZ?x*~XVF-T@OKn0Vg9qo&-#fZk4I&+~?rp!G>*J%wy*_?_+oVZCT1Spf zjMUP+BIBif^LU)%qI*9we>QAb&ah?$lh*2%|GU{578x}-?AZ8pX{-2ZGcGQ!4I4Ky zGJtCF#>U1Sb{<<}5cv4fJTGhKV z9r*eAdEwVrp)q?Z1nvKPU|xRr*fBP7y_kljOI6KsZ?(kkE;H5meoW!Q^^BMp85tRw zig(hXAt4Wrc8gn7eo|THKcA1AoBPT0=hrPB&Rexg>-ltD&;gvF^UFHAx>f}%E|NO- z{z&eYscJX&{Rwwi&71P%iK2G&_j(bLuY0xh^xRxsS-*VwVv)OX zUS3wO`ST;NCGy&t^XK`qva%$M(|FDs1qTOzd3l-r|DVt2zeo4T*;F*VySw}I7XLXG zf}j!3j~_wj$6VN$?5?7w2I@8N`hD@{VPlpy%K`f*=f(li{n^*o)ol0n@_Mw(=lR~p z41Mx9*%<T8D;OU+*_mqTFl%YGe&78sC`xYk^(7mUpQmt|%h~&= z34i?fF=AVeWJyVhLGd%6bDNsk`JLk9sqX7LHAuHqH5#etw>#n;YAt|NHv`qN2Du+3wwuGfv~VwKeEQ zifj+BShwz+q)gSB8HN*nzS`KfWsAv^Cr>`y-QUu}5^lJw=qcBy&!0cOx~iRXf1m8X zfB!i6`P=vHt84Ca_Vwj``SNAW^y$;5JNx?jLOMOZ^K2xmzrAVPxY4kUN0KQtH1x>v zlp{)pRvaUcTItRkQNsd;z=V)@)0<53AVm z1q3nu_`lITP#1I{!o&CP``_N){`k($;sgVUnA7!tzlI+b^Eefak6*d$eNh7H=EdZo=5_#D^xtyg<$?SZ3- z&m`u?u>HMJ(Q)zO_LX5SVPRrzZEZL9R+~39Hyc)dN@;0nDL6N6%9JSuFE6ROxVa@A z?GgnQ-JpbhZ*Mg-1E|xsWQoeY-|sIk=La2`^w`MO)>cAVTG`HS-@)UC#m{`++}zBb zetzE3H#ax$oaXB0_ULH0_}NEwf)^SBck}Y_6uh}%xbL*7iOGXUkCa}#(-ce!*{~tM zfi+Dn)%j(n$P%7gT~?}HLY%CutTOg>GUv{n19=B@!o}7*w{A&YUl-fFYL(VJo619) zZmYxBuPc4y{W2;~P()NzQB}1yox{X&OYUtkJ3G4%U%s?#-fZmSBFn5%-#3*IlDe^)|ffF6Xdv+cD26_T)r$Ey*;mW^=j=obLMQwxTutom9;2(dmaZb zFKhSFN53BLwhM2G&=LFg_ICR`+v=h;8v$YA!#$G5Qd7$P{P>=?9K3T!=G(V#9bH{b z^XAF@`tq`Q(j=i3D^`F`bC57f;n-F3^3s9|Uey9atBMZ_({!VcUF~-9_U3+mZticr za~*5etPv3V$R%&Lq|<6@TI$rd4r?ktGf5uTKe#9U^Nwjgfrp+vdv@%y@Vcr$r`!4E z51l;8si&t0TIrv6cNeRzt?iwi#mleF+jGC@^E2NcKYloPdUBeXnf-XZe*X`Du-zUki+ z4vM*V!t<(Qq^hFed#U>U+Oo$d+C&-(ZM)w7-fAXm%aL@Gx;MKz&LuCP8~*x*JaCi zg>V2*Cqt{<{#cr86o$ueR=nuhuaFK zt+>2UW7Sl_j0IQLtkLlccUd>Lv-|Lc3j#lX{^a%R5t?Va+5F(=Z}WH9R+-(|wpO^* zO2l=m6O*ViH#hej`+B*fM~}w5?d;}zW>#hkrsPXGD&xls3onncev z%U+i!f5kKQXNkmR%uf0=*?N&*`=S+Leh=2&{q^gYMb(##@Rrc9Z_;@6QS<)g;Ee3#@Q!}StT{*Ma^P2g zjxW2*#X#X5Xd`8k_5FL!yE{8~ln&qt zetv$7Z_*r`oztTGxA)HLJ?g(sIpw6@jq`HauS!6!$=Z7K#JO{PZEDMOw`G6dw=-@= z>0ga?{jn{H(bFL2L~T8j|0wL;pKHky-ACFD}Q`YWaE?Rcz%B8|FyzS8>+wOmAtzn`RUWA7uVOzFIu$d)fD%X6qRE= zlFYfexsVg#CHDXOwfe%d<=Nkku2{8->*>>{HPh>Vd|>pSZ|52p7q|DDb=DOPnHxI= zdroz=Ez>AE`tzuVOhThcrD{*LsQ#-GjaR$BeR}GxqNbJvI@|L0c74z|p1QiaP1Tnb zo{v;jRKR_jnx95O!or}%450ZvalI=xYrW&*?*ec;kc@4_HR>ojR3rq(ji= zH0Zdyt}ZS~%c2zKzGZ3`TLe-Mt+Re3btOlB)5Xh|4^LM2H%K`#L2CN{Z@2S3e0`6; zzP?^j`LNuF&D)GutS^0WfpONY+ncx-+ERtuDTG z`t<3Evu2$#pZ@C3*|TS}WAgIy_{6$fx98tKbno80_jOXQcI$vn`T|Y*?%87l%BEYk znD9uMaLk)GPxqVRwXE`YcR<~YH*0hSz9`CV3`;gxUM>zAFws3V+dMxZJ-xl9g+)VK zTUkScBP}g$&eNq!m;U(jQh3v*O`zi@zr48Eoc;Un@9)a0s;%$;Reyce3Tl~d*neoRd_XP5AAaW-FI?F8@Nhf$sN?(l?Mq5Z3ckIG1nr{Cf5^;W zX=%yu;P+ikRaI7o3Dc)P-`#&qVN=qP1cQK>m@}8xEn4*HY*SF}<-GIrY(b-?5{oYq8dU+4KL*AKK0-rU@LPvvJewlrB#{jt^J)~#DVo=%T1cydBeMMVX)#4+Y{ z{m-Z3clJ~YPn$MP!oJRC&z?OADJe%H_obbkRdu}P-yh36ckY1BxLy;tcUJbzPft$= zhJ>&%Gc*7A`I9jr{#5mc2aHdiKDA8OIo>CG_{>aW&>8m{8X5_oo}2_VpyKw|oi)$9 zzAlz=gLM#S7k_%ClM|DOh{z7T|E8=HMHhegP>^$DL*w$lcXk%fx$Ika|FzU-D6{AlaKec?%ivvqpNFJ{w@Zzhj#Ox+TY(QzP=Lmn`6=FJKOBwv14qY(sQ}r zTm}Ypzd0+mvPVtVi{0_A{rHh12d-Wf)ec{GWK-(tifj5hIxX9_nU%e{!PpSnp{1=| z`0r2Ulxx73)3d+idO>fShHtm|Z`v2Rz%k|H*yTmyP zGJMdJKB2XyUhiV&*ZXb(KuUOYpF5%fElF{P(d>vG>xOtP2p{c3q!K+tMugf;4opo|_ zWMugE*}H%K-UGXjurN4O`!0yJweE6R&e#^!uty;6{k|>VZI;c8ZG64gUE#ql`$v}= z*S(!(_wM?p?uJE12LhshY@ED_LDka1n?;z@zM4IvoZ(38ou8Xl$atJ)KJ%qTTAab| z8FLH6FQ+*o5k5Q}_3C>nN*_La*yuf7@8IRj!hL;x1|}v)8kyM>Qc_w#GomIYB0Ox& zVPRo&a&vND+r@&8$(k@_3QK8e>5m^j3U1xrn%(Z$%yw1#`i2b#FJ8P@;M~qv@%b4q zC_5$|Zo3+>Vb$H;<@`ZGK_5PRaQOf4Z{h1}x+Sl#@z($O$i6M-W)rB;P*P(0_3Ky6 z_p?&B%OiUjz8#KTw{G2r&6}IIY%x($QF-wGef(=PY4f}%ReRGu%l&wBpY_52cq68o ziyhs}LcVv>A6=ZvzTw|l*>av-!_R&8rzGEeThJhi|Bgwx2+?od(y;-f>*9w*>MYW1l`5O?#ZCSWPiQAmX_9rijPT4mMwGg_vdHl zmpjtH$js8EuBgZ;EiFAy+tts{uckZjtJ$ejr()hRGBSSn_z^VmYhr5p@Zm#7ef{-O zkE^Szi}T{Qd_b1=Kg+>7WaR4v3@YaW3vV);dzpKyS-cMXJ7r~-jN2vs)2?XfX^M8<3_5YrwH+S=G*+o*r2b8@+g<)% zuI}yz*-J)eU$1%We|lZP2`|>qP7*!2R-K>*w8p}Wtw%kgqNFDMmoHwq^Tzen_HC-} z%DM0NZz#&#DQm3JwP@e9tnR?#&Gj!reEN2^Ur7CZF+c0<<+K11*R3I2Buts@f~O}H zeaK|_^Q6}>?lY+B2%K`^Vv3~tC8cCmjNN%N0>eYUhxdr`e^Qy9x-Lbq!5FG?a|dM zHb%Voro(A;Xa+~;q9{>KhWQL7BBe@K%nR%PUrbVQ`5z&%sJN2zmQ6?dtiD^@%@=5_ znpekgK%i78WNvEVzx7w|84GP&{4DLo%-MV=H}@~NzjH0957?Cz7L{vQ_4AWz&?Mnj zqoVJ1x9ue6d=rywZ+>B5FX9?#nz8lhi+=lm2i6|YUa@Lb)+LMT-~9(#W(c@c&2M2m5cbJNK0+|yIbwW?tTJylLPOwM)gQteC>Ym!bh2=hHtSOG;|`aybKU=tu>E&>%4yA z#EBL2r!a&mm%cscch>3Ri+LVlmyeyl7}&eXziZKoYm07*Eq?MOC1zI%=lgqmo7b(= zOFJ`zF*Y`KUFkgA>Nex_a}IHFa-iYv+uKU(XMA~Zuz5%EXR#T*7q;$Rw1w$>b$Qc_ zDJE_EtFAxz8z|zs)$Hsyqr3V0|AGd%Ev&7TH8nY7cbB=kxv{1H{QLX+$HV;g3yPng zn=oZc%i6WNmo8s^z2|@O@xH`gcT{=b-8#D_=~32nzJS$h8m=~5SlyFx4V=O->+Q^o z8E$G>?t4{7B zsJ$>-;XtG~JL<||n>^_okMz@Pu|;c5)I6V*O1y}dm@`OFN%j;^jpFE^b{+L(}()HK(+ zyh!h^ZuB-DNl8i2yxjfTQ>RZaUbCiWwQuZdUX$A|9KF2QG(8J9yvRDe`R?ft0ui@v zILE{^U7j|5cI%WS+XKP^n-kT!*L|J*D0#uUi)^c2&5C&|A2eA(Q?u1<*PY{&Cr|CW zG)Za8>l>Y`_pbOLY-GRez>OiA9t0x#p7`#p5jkK)vt1b*= zv|F~%S^aZf%ARf{xtzEuTyijecBYX zr?anR$`lcuT{jEY&i`o0sv{;`#dars#r#j3CeEMU+js0)%-htZM=R!wuwT}@bGdRu zgwLKX9_Q@Uxe{e4cJg^E1BXBMtmbuKgAKub_uwo~tJ^~3D-O3sOC zSA{1{3W|A~pFGcb|6V~6k*Pax-B;h&IH^nOis|iwTO5fGpKcCdXqdXy_K2!o{k%`b zn*%4zZ{|Ce7V}$ESJUm(?(GI|lg?f}mtrLN_mAPOZ!gYH&OXzvZeaMDD^oI(!67x3 zb(68Zg1WZs+_O3#ZEU8bORrKr$#me~9n;%MDT#@UuCA_szFhX7W5&+TUh?u1D?`DL z4~c(%KA->L`}gC=`{fObo_K(IL1t!uo^w}yeI+WQBC&*>37 z-1eX{gy(!2n^jcB>@RYkKF!}>^H*=)@ky=oUR>XA?>B$%fvx{SzIRHPCo0v+SoN&F zoBcOx#p>*YhmTZa-m2I3D;pUx)xUWxcl_PKztuPPX0xx0;eC`f-}tq9%xjaq{djb9 zbHSUt^%GXt-k5N(qo<-Rd7t`2vkZgfw#v4$e}7vln&~md8^654*FWF3y{(NceD`gJ z^qgCpWNmYI{(ms*`)8dmFQ4~t3ac01($dmOxH7Mn^-*b!(3B}tEKdLV|Is-hK%wv7 z+tXX;PuHK9eA3DPPNl%1t8pO_9NwSLdH6l9{jw-p+?a*suFLMS`Tt++tbT5`%x4yZ z_Ud&NKR>aaHw*Fpv{RxHJiwmmx6E&@7id=htFVN`iO6$F8&9l@-R&`5FScXuTv<*I zj*Ngkn>HDJ`tk9x)O6dL9}^5_`m8gHkB?_+0G;%k{`bX;j7f9np1nM8#te_3prDFd z_H}++iJ8@Kgdn2i-r}r$gzq3;@GBVQU zt*58wlfS>e+q|7MYZePbXJ6m5tp8tL3RnL7V|o79)TvWdOiZRMpDO?w`1edrRrUY< z`T2QIM@Po+=#ml>Mh6p9)5>f0|Nq%~dU-v{Jb&txlA)oY&0AMj*C#hOr`x>sQJZX2 z^JBvD+NYDImLv+S5XJv~k9*e+eZoc)IfbfP7LLioCvhgqP}yTrsq zo7cilClL;9!`SyJ^!V(7E8}>$6_$+`IXix;3f z)%?!eCC;+1w*$>3T3heVUw`KWpNvJrr%y!-<+nFBGS<}ADr#$MU)jN6Q1&Kb#;jR~ z?%ervTiblo*VosTwY9mgUAuNaZl|E9xA)=e*ToqW)Wf&OE$cmc>J-<$efw;_?^!Wz z?ai`;1t5EOotKq(k!sboNW<$%hT$TOu0<|=V#-*#*WcxH@PMucRJgSzliAr7L=7e+ntw|rUqJ8xo+FPzrPRPxDm17#>9ye zEeap8ELpnLu=-ohj2Sbo?E1I6{C&ZnAB9hzJUMXVhJ>`2GF8dsdcKOiYYH+L;+q*Fi%j{r&v+ z_SJF=3k!n=8nm>uzV>l%P+w|O^n^o8OAB;l-Io^^7hn5&_|TyT@89z~aX^*~bVprZ zzrLr3r=_I@w8N#Doxg42!iU?<7e%pDrG<1acJEL6_~>XsL4iY9nAn^-b1K-P{sy_Y zu*k^DK78_|WpDNOfAwY&2SJLNESk8a-`toxB z4coW7hlYygW8P0Y*V^Y!($u&_|j z)a-o!>*2$P8#ZoiT(d^!&Ye2}adCay^Y3$sRR8?+)S~DK$DFxyK@G!m40}v9wX~Y% z&zHY`9@MrCUhentZkxQ?BO@b!d^|2MC?yq@ zy>6?gpI_VFy|!1bUQNu)>vL>oQ#6_K|G<*zdaF)0C;_AvNGJAec z506dtH=fhe_1$A)?rb+-5XEOD6L3~bTf1}LKD(W@zs;7Py>@MyjBV8xKk#ztl6Q9^ z7u@ilXQQ}k)v6_H*7OJ*lH2a%=GL}k*|KZ9?%MzV2OZ?j~S*XV7_zwZaS z2(PmC<0IFkyga`Mov_~5?QLyB#l^*qNwv8b7C5FH?~|Q#z4-Y#)#B&pp6=c^cdqQs zZMo6SkC!c9E*u#ddG2>~V4$Oksp-$Y<=?jM*<+KGkl+BC@R0pIzy6=%vSrKWd}L8p zQtDW>Dy#SLUBN?g?tZSWt)Hz74JU$zgRS)xTR?~YpP6Sn`*YRxb+JdTUY+{>mztVd zOtQnjPp9=$-rU&8bo8GXFE6iXv(58A9eGwBHf`FpHg*4b3141Z)X>%z{*lAOur6*d zm$I_*xfMc}E?s(YeSQ4g`s<*3vc9~$47wlc{S8o5c6W0>7s~nm?yjPyW~X)eyDK~P zty`xDS`YQ~DXZG#PGNPwgjZKqe(j5v{r&p;?`vzLHFR{IL{2}LprEM8C~H;nV2h=d zm6C-;#DW_lUrnQWet39#Hnz2~T~DdCva;G5_phtJ|G2;XUzX_T=#I|LhyC{d1T?<= z{{DWan(&&wzyJRJmb$)v)vBi5yRFUg@BKMjt#g0Uq)AO?xpwEX7q42y6&ZOms^3~u zlk@HE?Z;OHE@s)6GkMxHHYbko99db}l=SrL6`5Op72Wyx_&8`u*O%AV`M-VpcH-2j zN0Hy7_t`yrb)$6W6-hC%w&?A7iCgs~VAA^_q9Q^wF`p4hz_j8NPKA7O()Kpz$ zM2vFf>wLBwY9ytzJ9*L_tigq zRsA_u8kUvLo;Od<$;nATSeO~K(<65GwtE{{f5tMuv1fXAW+rofetzTeGppbKj*W@w zaqSjMe0pl?hRvIu0|Erf-rtLTzk`R3xkX^!_uW>@XZ`v2`+da5Bv!NBTP;sdPk(%@ zS32f)V2JaDq$BN(jf_RbJC{eFJ9+Zq%+hb(t5&U&Fv$?Gv9&FHbHi{=>~67}H*fmN zRlmNr_QU7T&AWD4UAcO7;*1$5UjDdn;l|UaPc`)P{yjUe;?}KOH@0Sro0ynn?VWSN z|LewDNo#d=_EV=$nSK*lJuh$HuIDpbT3A3AohozaKhqfMK>-?xB~LmxIP_*F&PxZwM{*cGc+C%?F`aE4W>77s74bV=llMXN3*9dQS(>`+rX_O;(eM`z8oymRrF zE?#7ue9|Q|GjngUwY9afj!w_#U0b$@=*RDSB5iGLE&cxfe)ps#B_Uzqg=^OIG&C?Y z?o*jNckag@ACu3$-mt+SBRl*0PVV(fmZ)6M*;Tr9-MYSYvAc_8%X8mv@9gBfa^=c| z2_Gt#U0$?EY2NACr4Qe{>3Q)YLqt^cs;1e2e{(A;D-T}2yxA}IU3T~1r-sXyEK#tw zmhS88GhHVyFMqzYM@~-e!j&sWc9-uletAvx+w}dfFI)(Sh>CLZ_U?XfCMG5}!#p3n zU?ltcy2KwJ9@bo6x}s{~-j_e3x8+C{mX@l5T54xz8oLAsPfkhObbtArIWkEZ86JM~ zY&m+aUvV~$3A)=o z<-vi*IZx~A>W*BvFd_fFm8q#|WA$ZK6%~Qf(o!J-0f$GAAA7Ek+k0Y~ZnVYe>AKNw zbLPykSU-8vq!Y8v^F7ki)NXFg77q*xQtIsNWIAeB{Y}Tv$Ve$LFi=HBr6nUXv+(Sm zS1(?8Ow*4)SGl+BZB$Zvy8FF7mCkW{Dja!uc~5T5zRuERn{qF*+cVE14VS@H_@5U1@3=Ev-JY5_^w8Pg4aB^}^nm%1UU{6+SYpY9m`1Bt? zeoT1sB*iG}iiQz*8&B=;Z-UOw&OxD}t{jR_K!N4!+snevK6%X=olW`o?G~+F>swS* z^h(y+#AHfFR@S6;e)&n^>*EBIlaq^HUC})E$#b&W#E*}U7ss`?w@<#lK7Mk)y#1uP z*5yLBwziYz&AZpI_<8@gW!buR-cfj=<3Ek{svlIJZsi02KO^{1)on%)xNPIk$KbR&7ceM)bxaLc)Lmp~C$ zQ{^oZfg-MfO77i)u7M(|MO!2Sm4wB`*+E;&+}ygXrbgY}UoU_0;zbWXzh{+lE2So% zbO{O)y0@pY`M?1O#dMFr`}R>i8WUHpSpyP3b^5gHT&{S2IhzA}DnDOX7i$e#=Ug*? zH75^G%hai&px~$j#X)war>0@>-FpY{YLLW>Ym%|r|j0#(AC9NQ(L=p9_y*|=Z{}q9d0=pbl>bE z@9BD==IC|fC=u6>?&o_n8bM3p=gpfJlWU%Tucf`6JtZ~uVA4i|#6v7Rl140shK3bC zJ}Bno=7J7}+V|V0{GE)Kx3{3AB&WQ*{5gwa>#{coHl>~xkeBbDt{=ZBet%sIKVy1I z%7X0c>p+Ls2o=uY~;k{=@D3%IfOu#_8w&JZotMCDsN;W{dStpF9Cs zI>)M%%SUbUF|dh)hezenqem*1mNPG#6+Q7V z%DrXc#G$y{Z>|!B$SUMd!as+e}gJR2s6)QBD8f>b*bZqWhw@&ZohD7G@ zHBC)S>#pyu`l>Wp&G*rsdA8MN7q4D@y5@M&#uNVbe~*~HoU?tqxuK!qL!OVIbI+Aj zRbB0Begr)JxG_RUNnPC?bnMa9e?LAZGc|yY`nY^;cX|G%l9xg2zOIYe3AQ^kGqd;i za*ZwltDSOJ6V|O;cj4N#V<#u8Gj2HV2bx!n+?>Y906OMCSXlVW>+AiSd)wRDRa8`d z_{kji|7u{Ps;b)2-`_rEipX`Ag2u*1&=Jq+wuXj=GiJ>ydi(g*)zufSUqAlz^z?_% zpSM4Gl42mivu|0Tr?GxJ-efso?A>c8`6FE6KP=WX9^XI}>S2QCcB0k*VUOi9P!_jf!J9e+YwGz5+Qw}Wi zo!xf7{=Y20yxozF$;UxQk)AWEt*u?RQjp=Bcy(UhJM-t9zl6Gv9$MhoY*6(jgN2

        G{yt|FWzBd?SRhoGRK&D&kOb`=yCH&34qTJiGW z-Me#}&wYM={^6@vw-)T|(^wU{P*!3^8)#C3(Lv2`&WWpWp`osAywYwVp`o42m#fb- zOlF%nZQ8S0{VSI7@ywey&&AKLPbY5Aj61tZyA5XgB&DXhg3jK)vNE`H=~7ims}c=R ztzTDH*CO!kPSCk?=U5mR9b#f)PV6du?Qy(M*7CQmzP|dpb?aOL11Ewmsn&_zHD$-n zofA(_*Z*w0?e_M3;n>*Npt!hmo6np--_M``I&v*CEHu;=bjITT{q=Y6dvs+@wJT3p z5bP1aJ8Am#cF^jfzrVizj<5cHewCR>L*gIS*ALXhA3BAZK2VZqn!TEXOHwB0FW;l> z1w|s_g<_5(>Ef(~B_itL3$-*j7&~RTqBL_eTjyQ-{byOiq{;TDotvJV*!H%))KMVA zLMF>g|fzXWjO_*Ou#F9kx2tXlBO72%94|x?6ctH_hr^oy;Mtg$Epf-#^>$7n-{7hW-7sx5_v87 zI9r^&;UVsqU#nJytv;1v)a9Zy>-=*s6(Onq<6TFS{QK*z=9bva&-c%_FSd{=*&Fxu z+qZ9D3LCGx_k3__Qn*mG^Gep%AORLHwaH$~FV~wqwQktoDZ$9llYFa?;edS$h^g$x z!0@<3kl}zu5(|StA0eR~{@;(De|CnOS diff --git a/doc/graphs/diode_iv_plot.svg b/doc/graphs/diode_iv_plot.svg index 053ce7983..788e09227 100644 --- a/doc/graphs/diode_iv_plot.svg +++ b/doc/graphs/diode_iv_plot.svg @@ -63,7 +63,7 @@ xmlns ="http://www.w3.org/2000/svg" -I0(V) +I₀(V) Rs=0 Ω Rs=2 Ω Rs=10 Ω diff --git a/doc/html/index.html b/doc/html/index.html index 80384743b..e821887b6 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        • Last revised: November 17, 2017 at 17:52:11 GMT

        Last revised: November 20, 2017 at 15:48:07 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 2aa00f2d3..be7024a17 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -1563,7 +1563,6 @@

      • Additional Implementation Notes

      • Error Handling Example

      • Examples Where Root Finding Goes Wrong

        • -

      • Lambert W function

      • Students t Distribution

        • diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index d00036fb9..7242fb102 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 3414e187a..895b0f347 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 05fe506db..d6fe944ed 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index e10aa67ad..f39c5487e 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -4451,7 +4451,6 @@

      • Additional Implementation Notes

      • Error Handling Example

      • Examples Where Root Finding Goes Wrong

        • -

      • Lambert W function

      • Students t Distribution

        • @@ -4842,7 +4841,6 @@

      • expression

      • float

      • I

        • -

      • infinity

      • interval

      • lambert_w0

      • lambert_wm1

        • diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index dd23a8fae..d938ebf42 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 2412f4240..c88086300 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html index 57c050c83..9ee6c427b 100644 --- a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html @@ -441,7 +441,7 @@

        - 187500 + 203125

        		@@ -463,7 +463,7 @@

        - 171875 + 234375

        		@@ -485,7 +485,7 @@

        - 187500 + 203125

        		@@ -507,7 +507,7 @@

        - 7468750 + 10281250

        		@@ -536,12 +536,12 @@

        - 718750 + 843750

        - 3.8 + 4.2

        		@@ -558,29 +558,7 @@

        - 921875 -

        -         		-

        - 5.4 -

        -         		-

        - 2 -

        -         		- -

        - 11 -

        -         		-

        - 906250 + 1125000

        		@@ -595,6 +573,28 @@ +

        + 11 +

        +         		+

        + 1203125 +

        +         		+

        + 5.9 +

        +         		+

        + 2 +

        +         		+

        6 @@ -602,7 +602,7 @@

        - 52812500 + 71765625

        		@@ -631,12 +631,12 @@

        - 500000 + 593750

        - 2.7 + 2.9

        		@@ -653,12 +653,12 @@

        - 515625 + 578125

        - 3.0 + 2.5

        		@@ -675,12 +675,12 @@

        - 515625 + 625000

        - 2.8 + 3.1

        		@@ -697,7 +697,7 @@

        - 7781250 + 10062500

        		@@ -726,7 +726,29 @@

        - 484375 + 593750 +

        +         		+

        + 2.9 +

        +         		+

        + 0 +

        +         		+ +

        + 4 +

        +         		+

        + 609375

        		@@ -748,34 +770,12 @@

        - 515625 + 593750

        - 3.0 -

        -         		-

        - 0 -

        -         		- -

        - 4 -

        -         		-

        - 515625 -

        -         		-

        - 2.8 + 2.9

        		@@ -792,12 +792,12 @@

        - 19375000 + 20859375

        - 2.6 + 2.1

        		@@ -821,12 +821,12 @@

        - 515625 + 593750

        - 2.8 + 2.9

        		@@ -843,7 +843,29 @@

        - 515625 + 593750 +

        +         		+

        + 2.5 +

        +         		+

        + 0 +

        +         		+ +

        + 5 +

        +         		+

        + 609375

        		@@ -858,28 +880,6 @@ -

        - 5 -

        -         		-

        - 531250 -

        -         		-

        - 2.8 -

        -         		-

        - 0 -

        -         		-

        2 @@ -887,12 +887,12 @@

        - 24453125 + 25171875

        - 3.3 + 2.5

        		diff --git a/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html b/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html index d6cbdb0ea..588a40dee 100644 --- a/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html @@ -324,12 +324,12 @@

        - 750 + 828

        - 1.20 + 1.15

        		@@ -346,12 +346,12 @@

        - 1312 + 1453

        - 1.56 + 1.52

        		@@ -368,12 +368,12 @@

        - 1312 + 1437

        - 1.58 + 1.56

        		@@ -390,12 +390,12 @@

        - 993750 + 1326562

        - 1.47 + 1.46

        		@@ -419,12 +419,12 @@

        - 765 + 890

        - 1.22 + 1.24

        		@@ -441,12 +441,12 @@

        - 1000 + 1156

        - 1.19 + 1.21

        		@@ -463,12 +463,12 @@

        - 1015 + 1171

        - 1.23 + 1.27

        		@@ -485,12 +485,12 @@

        - 806250 + 1089062

        - 1.19 + 1.20

        		@@ -514,7 +514,7 @@

        - 625 + 718

        		@@ -536,7 +536,7 @@

        - 843 + 953

        		@@ -558,7 +558,7 @@

        - 828 + 921

        		@@ -580,7 +580,7 @@

        - 676562 + 909375

        		@@ -609,12 +609,12 @@

        - 828 + 906

        - 1.32 + 1.26

        		@@ -631,12 +631,12 @@

        - 1484 + 1703

        - 1.76 + 1.79

        		@@ -653,12 +653,12 @@

        - 1500 + 1687

        - 1.81 + 1.83

        		@@ -675,12 +675,12 @@

        - 845312 + 1131250

        - 1.25 + 1.24

        		diff --git a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html index 8ad71dd21..c2ad7635b 100644 --- a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html @@ -320,7 +320,7 @@

        - 673 + 795

        		@@ -342,12 +342,12 @@

        - 964 + 1106

        - 1.29 + 1.26

        		@@ -364,12 +364,12 @@

        - 962 + 1135

        - 1.28 + 1.43

        		@@ -386,12 +386,12 @@

        - 142500 + 148750

        - 7.41 + 7.50

        		@@ -415,12 +415,12 @@

        - 743 + 839

        - 1.10 + 1.06

        		@@ -437,7 +437,7 @@

        - 746 + 879

        		@@ -459,12 +459,12 @@

        - 750 + 871

        - 1.00 + 1.09

        		@@ -481,7 +481,7 @@

        - 19218 + 19843

        		@@ -510,12 +510,12 @@

        - 732 + 843

        - 1.09 + 1.06

        		@@ -532,7 +532,7 @@

        - 770 + 903

        		@@ -554,12 +554,12 @@

        - 778 + 859

        - 1.04 + 1.08

        		@@ -576,12 +576,12 @@

        - 35937 + 37968

        - 1.87 + 1.91

        		@@ -605,12 +605,12 @@

        - 756 + 867

        - 1.12 + 1.09

        		@@ -627,12 +627,12 @@

        - 768 + 920

        - 1.03 + 1.05

        		@@ -649,12 +649,12 @@

        - 770 + 796

        - 1.03 + 1.00

        		@@ -671,12 +671,12 @@

        - 46562 + 47187

        - 2.42 + 2.38

        		@@ -881,12 +881,12 @@

        - 956 + 959

        - 1.24 + 1.26

        		@@ -903,12 +903,12 @@

        - 1217 + 1214

        - 1.55 + 1.56

        		@@ -925,12 +925,12 @@

        - 1217 + 1209

        - 1.54 + 1.52

        		@@ -947,12 +947,12 @@

        - 185937 + 184531

        - 6.88 + 6.79

        		@@ -976,7 +976,7 @@

        - 773 + 764

        		@@ -998,7 +998,7 @@

        - 785 + 776

        		@@ -1020,7 +1020,7 @@

        - 790 + 796

        		@@ -1042,7 +1042,7 @@

        - 27031 + 27187

        		@@ -1071,7 +1071,7 @@

        - 801 + 795

        		@@ -1093,12 +1093,12 @@

        - 840 + 826

        - 1.07 + 1.06

        		@@ -1115,12 +1115,12 @@

        - 820 + 865

        - 1.04 + 1.09

        		@@ -1137,12 +1137,12 @@

        - 56406 + 55625

        - 2.09 + 2.05

        		@@ -1166,12 +1166,12 @@

        - 839 + 826

        - 1.09 + 1.08

        		@@ -1188,7 +1188,7 @@

        - 839 + 831

        		@@ -1210,12 +1210,12 @@

        - 840 + 832

        - 1.06 + 1.05

        		@@ -1232,12 +1232,12 @@

        - 80468 + 78750

        - 2.98 + 2.90

        		@@ -1442,12 +1442,12 @@

        - 1057 + 1059

        - 1.35 + 1.37

        		@@ -1464,12 +1464,12 @@

        - 1284 + 1253

        - 1.56 + 1.60

        		@@ -1486,12 +1486,12 @@

        - 1321 + 1251

        - 1.63 + 1.60

        		@@ -1508,12 +1508,12 @@

        - 282812 + 275468

        - 8.83 + 8.81

        		@@ -1537,7 +1537,7 @@

        - 781 + 771

        		@@ -1559,7 +1559,7 @@

        - 823 + 784

        		@@ -1581,7 +1581,7 @@

        - 809 + 784

        		@@ -1603,7 +1603,7 @@

        - 32031 + 31250

        		@@ -1632,12 +1632,12 @@

        - 818 + 828

        - 1.05 + 1.07

        		@@ -1654,7 +1654,7 @@

        - 876 + 831

        		@@ -1676,12 +1676,12 @@

        - 846 + 826

        - 1.05 + 1.05

        		@@ -1698,12 +1698,12 @@

        - 58437 + 56718

        - 1.82 + 1.81

        		@@ -1727,7 +1727,7 @@

        - 882 + 875

        		@@ -1749,12 +1749,12 @@

        - 993 + 881

        - 1.21 + 1.12

        		@@ -1771,12 +1771,12 @@

        - 917 + 881

        - 1.13 + 1.12

        		@@ -1793,12 +1793,12 @@

        - 98750 + 97031

        - 3.08 + 3.10

        		diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 21eeffba9..61ad1c4b6 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -13,12 +13,14 @@ template ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy controlled precision. + // Use `lambert_w0(z, policy >())` // If speed is more important than the last-digit precision. template ``__sf_result`` lambert_wm1(T z); // W-1 branch. template ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy controlled precision. + // Use `lambert_wm1(z, policy >())` // If speed is more important than the last-digit precision. } // namespace boost } // namespace math @@ -97,20 +99,26 @@ Using multiprecision types to get multiprecision precision wrong is all too easy [lambert_w_simple_examples_4] -[note See spurious non-zero decimal digits appearing after digit 17 in the argument 0.9000000000000000...!] +[note See spurious non-seven decimal digits appearing after digit #17 in the argument 0.7777777777777777...!] -See the correct result constructing from a decimal digit string "0.9": +And similarly constructing from a literal `double 0.9`, with more random digits after digit number 17. [lambert_w_simple_examples_4a] -Note the expected zeros for all places up to 50 - and the correct result! +Note how the `cpp_float_dec_50` result is only as correct as from a `double = 0.9`. + +Now see the correct result for all 50 decimal digits constructing from a decimal digit string "0.9": + +[lambert_w_simple_examples_4b] + +Note the expected zeros for all places up to 50 - and the correct Lambert W result! (It is just as easy to compute even higher precisions, at least to thousands of decimal digits, but not shown here for brevity. See [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] ). -Policies can be used to control precision (a little less precision gives a significant speedup): +Policies can be used to control precision (a tiny less precision gives a significant speedup): [lambert_w_simple_examples_precision_policies] @@ -122,7 +130,7 @@ and to control what action to take on errors: [lambert_w_simple_examples_error_message_1] -Show error reporting if pass a value to `lambert_w0` that is out of range, +Show error reporting if passing a value to `lambert_w0` that is out of range, and probably was meant to be passed to `lambert_wm1` instead. [lambert_w_simple_examples_out_of_range] @@ -289,29 +297,26 @@ The implementation details of algorithm switch points are in [h5:w0_edges w0 Branch] -The range mathematically is -exp(-1) <= z <= 0, but numerically, +The range mathematically is -1/e <= z <= +[infin], but numerically, (for the type T) -* `z == -exp(-1)` (for the type T) returns exactly -1. -* `z < -exp(-1)` throws a `domain_error`, and/or return `NaN` according to the policy. -Provides that there is a `catch` clause, an error message (similar to that below) will report. +* `z == -1/e` returns exactly -1. +* `z < -1/e` throws a `domain_error`, and/or returns `NaN` according to the policy. +Provided that there is a `catch` clause, an error message (similar to that below) will be reported. * `z == (std::numeric_limits::max)()` returns W for the floating_point type T, (for example, for `double`, 703.22703310477018L) -* `z == std::numeric_limits::infinity()` returns infinity (if available). +* `z == std::numeric_limits::infinity()` returns +[infin] (if available). [h5:wm1_edges w-1 Branch] -The range mathematically is -exp(-1) <= z <= 0, but numerically, +The range mathematically is -1/e <= z <= 0, but numerically, -* `z == -exp(-1)` (for the type T) returns exactly -1. -* `z == 0` returns infinity (or the nearest equivalent if `std::has_infinity == false`). -* `z == std::numeric_limits::min()` returns the maximum possible value of Lambert W for the type T. [br] +* `z == -1/e` (for the type T) returns exactly -1. +* `z == 0` returns -[infin] (or the nearest equivalent if `std::has_infinity == false`). +* `z == std::numeric_limits::min()` returns the maximum (most negative) possible value of Lambert W for the type T. [br] For example, for `double`: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 [br] and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 [br] -* `z < std::numeric_limits::min()`, means that z is denormalized (if `std::numeric_limits::has_denorm_min == true`), -for example: - -`r = lambert_wm1(std::numeric_limits::denorm_min());` - +* `z < std::numeric_limits::min()`, means that z is zero or denormalized (if `std::numeric_limits::has_denorm_min == true`), +for example: `r = lambert_wm1(std::numeric_limits::denorm_min());` and an overflow_error exception is thrown. and will give a message like: Error in function boost::math::lambert_wm1(): @@ -320,7 +325,6 @@ and will give a message like: Denormalized values of z are not supported for Lambert W-1 (because not all floating-point types denormalize), and anyway it only covers a tiny fraction of the range of possible z arguments values. -A domain_error exception is thrown. (This behaviour might be changed to return infinity, as for z == 0). [h4:compilers Compilers] diff --git a/example/lambert_w_diode_graph.cpp b/example/lambert_w_diode_graph.cpp index d28482b08..8357ca338 100644 --- a/example/lambert_w_diode_graph.cpp +++ b/example/lambert_w_diode_graph.cpp @@ -240,7 +240,8 @@ int main() //.background_border_color(black); ; - data_plot.plot(zero_data, "I0(V)").fill_color(lightgray).shape(none).size(3).line_on(true).line_width(0.5); + // ₀ = subscript zero. + data_plot.plot(zero_data, "I₀(V)").fill_color(lightgray).shape(none).size(3).line_on(true).line_width(0.5); data_plot.plot(measured_zero_data, "Rs=0 Ω").fill_color(lightgray).shape(square).size(3).line_on(true).line_width(0.5); data_plot.plot(data_2, "Rs=2 Ω").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); data_plot.plot(data_10, "Rs=10 Ω").line_color(purple).shape(none).line_on(true).bezier_on(false).line_width(1); diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp index c52dd22ae..ebdbd12b1 100644 --- a/example/lambert_w_simple_examples.cpp +++ b/example/lambert_w_simple_examples.cpp @@ -97,25 +97,26 @@ int main() using boost::math::policies::ignore_error; using boost::math::policies::throw_on_error; - //[lambert_w_simple_examples_0 + { +//[lambert_w_simple_examples_0 std::cout.precision(std::numeric_limits::max_digits10); - // Show all potentially significant decimal digits. - std::cout << std::showpoint << std::endl; // Show trailing zeros too. - { - double z = 10.; - double r; - r = lambert_w0(z); // Default policy for double: digits10 = 17, digits2 = 53 - std::cout << "lambert_w0(z) = " << r << std::endl; - // lambert_w0(z) = 1.7455280027406992 - //] [/lambert_w_simple_examples_0] - } - { + // Show all potentially significant decimal digits, + std::cout << std::showpoint << std::endl; + // and show trailing zeros too. + + double z = 10.; + double r; + r = lambert_w0(z); // Default policy for double: digits10 = 17, digits2 = 53 + std::cout << "lambert_w0(z) = " << r << std::endl; + // lambert_w0(z) = 1.7455280027406992 +//] [/lambert_w_simple_examples_0] + } + { // Other floating-point types can be used too, here float. // It is convenient to use function `show_value` // to display all potentially significant decimal digits // for the type. //[lambert_w_simple_examples_1 - float z = 10.F; float r; r = lambert_w0(z); // Default policy digits10 = 7, digits2 = 24 @@ -124,7 +125,7 @@ int main() std::cout << ") = "; show_value(r); std::cout << std::endl; // lambert_w0(10.0000000) = 1.74552810 //] //[/lambert_w_simple_examples_1] - } + } { // Example of an integer argument to lambert_w, // showing that an integer is correctly promoted to a double. @@ -133,16 +134,20 @@ int main() double r = lambert_w0(10); // int argument "10" that should be promoted to double argument. std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406992 double rp = lambert_w0(10, policy<>()); // int argument "10" that should be promoted to double argument, - // for simplicity using (default policy. + // for simplicity using default policy. std::cout << "lambert_w0(10, policy<>()) = " << rp << std::endl; - // lambert_w0(10) = 1.7455280027406992 + // lambert_w0(10, policy<>()) = 1.7455280027406992 + auto rr = lambert_w0(10); // C++11 needed. + std::cout << "lambert_w0(10) = " << rp << std::endl; + // lambert_w0(10) = 1.7455280027406992 too, showing that rr has been promoted to double. //] //[/lambert_w_simple_examples_2] - } + } { // Using multiprecision types to get much higher precision is painless. //[lambert_w_simple_examples_3 cpp_dec_float_50 z("10"); - // Note construction using a decimal digit string "10", not a double literal 10. + // Note construction using a decimal digit string "10", + // not a floating-point double literal 10. cpp_dec_float_50 r; r = lambert_w0(z); std::cout << "lambert_w0("; show_value(z); @@ -155,22 +160,42 @@ int main() // Using multiprecision types to get multiprecision precision wrong! { //[lambert_w_simple_examples_4 - cpp_dec_float_50 z(0.9); // Will convert to double, losing precision beyond decimal place 17! + cpp_dec_float_50 z(0.7777777777777777777777777777777777777777777777777777777777777777777777777); + // Compiler evaluates the nearest double-precision binary representation, + // from the max_digits10 of the floating_point literal double 0.7777777777777777777777777777..., + // so any extra digits in the multiprecision type + // beyond max_digits10 (usually 17) are random and meaningless. cpp_dec_float_50 r; r = lambert_w0(z); std::cout << "lambert_w0("; show_value(z); std::cout << ") = "; show_value(r); std::cout << std::endl; - // lambert_w0(0.90000000000000002220446049250313080847263336181640625000000000000000000000000000) - // = 0.52983296563343442067798493880332411646762461354815017917592839379740431483218821 - std::cout << "lambert_w0(0.9) = " << lambert_w0(static_cast(z)) // 0.52983296563343441 - << std::endl; + // lambert_w0(0.77777777777777779011358916250173933804035186767578125000000000000000000000000000) + // = 0.48086152073210493501934682309060873341910109230469724725005039758139532634080894 //] //[/lambert_w_simple_examples_4] } { - // Using multiprecision types to get multiprecision precision right! //[lambert_w_simple_examples_4a + cpp_dec_float_50 z(0.9); // Construct from floating_point literal double 0.9. + cpp_dec_float_50 r; + r = lambert_w0(0.9); + std::cout << "lambert_w0("; + show_value(z); + std::cout << ") = "; show_value(r); + std::cout << std::endl; + // lambert_w0(0.90000000000000002220446049250313080847263336181640625000000000000000000000000000) + // = 0.52983296563343440510607251781038939952850341796875000000000000000000000000000000 + std::cout << "lambert_w0(0.9) = " << lambert_w0(static_cast(0.9)) + // lambert_w0(0.9) + // = 0.52983296563343441 + << std::endl; + //] //[/lambert_w_simple_examples_4a] + } + { + // Using multiprecision types to get multiprecision precision right! + //[lambert_w_simple_examples_4b + cpp_dec_float_50 z("0.9"); // Construct from decimal digit string. cpp_dec_float_50 r; r = lambert_w0(z); @@ -180,7 +205,7 @@ int main() std::cout << std::endl; // 0.90000000000000000000000000000000000000000000000000000000000000000000000000000000) // = 0.52983296563343441213336643954546304857788132269804249284012528304239956432480864 - //] //[/lambert_w_simple_examples_4a] + //] //[/lambert_w_simple_examples_4b] } // Getting extreme precision (1000 decimal digits) Lambert W values. { diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index fe61fddc4..7c580a7be 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -1272,6 +1272,22 @@ namespace math const char* function = "boost::math::lambert_wm1()"; // Used for error messages. + // Check for edge and corner cases first: + + if (boost::math::isnan(z)) + { + return policies::raise_domain_error(function, + "Argument z is NaN!", + z, pol); + } // isnan + + if (boost::math::isinf(z)) + { + return policies::raise_domain_error(function, + "Argument z is infinite!", + z, pol); + } // isinf + if (z == static_cast(0)) { // z is exactly zero so return -std::numeric_limits::infinity(); if (std::numeric_limits::has_infinity) @@ -1287,11 +1303,12 @@ namespace math { // All real types except arbitrary precision. if (!boost::math::isnormal(z)) { // Almost zero - might also just return infinity like z == 0 or max_value? - return policies::raise_domain_error(function, + return policies::raise_overflow_error(function, "Argument z = %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)", z, pol); } } + if (z > static_cast(0)) { // return policies::raise_domain_error(function, @@ -1302,7 +1319,7 @@ namespace math { // z is denormalized, so cannot be computed. // -std::numeric_limits::min() is smallest for type T, // for example, for double: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 - return policies::raise_domain_error(function, + return policies::raise_overflow_error(function, "Argument z = %1% is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch!", z, pol); } diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 1bd9b85bd..642373960 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -254,7 +254,7 @@ void test_spots(RealType) // denorm - but might be == min or zero? if (std::numeric_limits::has_denorm == true) { // Might also return infinity like z == 0? - BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::denorm_min()), std::domain_error); + BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::denorm_min()), std::overflow_error); } // Tests of Lambert W-1 branch. @@ -695,8 +695,6 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values) // N[productlog[-1, -2.2250738585072014e-308],50] = -714.96865723796647086868547560654825435542227693935 tolerance); - - // For z = 0, W = -infinity if (std::numeric_limits::has_infinity) { From 66067c3b6b3dada7b8747c2bd29fbab02507cbe5 Mon Sep 17 00:00:00 2001 From: pabristow Date: Fri, 24 Nov 2017 16:53:18 +0000 Subject: [PATCH 27/71] Added include to test_value to ensure that when used standalone with GCC that supports suffix Q, multiprecision float128 is included. --- include/boost/math/tools/test_value.hpp | 7 +++++++ test/test_lambert_w.cpp | 10 +++++++--- 2 files changed, 14 insertions(+), 3 deletions(-) diff --git a/include/boost/math/tools/test_value.hpp b/include/boost/math/tools/test_value.hpp index c10596209..aba66cf6b 100644 --- a/include/boost/math/tools/test_value.hpp +++ b/include/boost/math/tools/test_value.hpp @@ -31,6 +31,13 @@ #include #include +// Built-in/fundamental GCC float128 or Intel Quad 128-bit type, if available. +#ifdef __GNUC__ +#include // Not available for MSVC. +// sets BOOST_MP_USE_FLOAT128 for GCC +using boost::multiprecision::float128; +#endif //# __GNUC__ and NOT _MSC_VER + #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE // global int create_type(0); must be defined before including this file. #endif diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 642373960..5539b394e 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -10,12 +10,16 @@ //! \brief Basic sanity tests for Lambert W function plog productlog //! or lambert_w using algorithm informed by Thomas Luu, Veberic and Tosio Fukushima. +#include // for BOOST_MSVC definition. +#include // for BOOST_MSVC versions. #include // for real_concept + +// Boost macros #define BOOST_TEST_MAIN #define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. - #include // Boost.Test #include + #include #include #include @@ -96,7 +100,7 @@ std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION << message << "\n STL " << BOOST_STDLIB; message << "\n Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100; -#ifdef BOOST_HAS_FLOAT128 +#ifdef BOOST_HAS_FLOAT message << ", BOOST_HAS_FLOAT128" << std::endl; #endif message << std::endl; @@ -153,7 +157,7 @@ void test_spots(RealType) std::cout.setf(std::ios_base::showpoint); // show trailing significant zeros. std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl; - // Test at singularity. + // Test at singularity. //RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527); RealType singular_value = -exp_minus_one(); // -exp(-1) = -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527 From c696891c448545d49b481620880a0f9c781ecc10 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Mon, 27 Nov 2017 19:05:30 +0000 Subject: [PATCH 28/71] Math: Add LambertW rational approximations and allow use of cpp_bin_float. --- minimax/f.cpp | 24 ++++++++++++++++++ minimax/multiprecision.hpp | 51 ++++++++++++++++++++++++++++++++++++++ 2 files changed, 75 insertions(+) diff --git a/minimax/f.cpp b/minimax/f.cpp index 2c95378f1..a87f4475a 100644 --- a/minimax/f.cpp +++ b/minimax/f.cpp @@ -11,6 +11,7 @@ #include #include #include +#include #include @@ -358,6 +359,29 @@ mp_type f(const mp_type& x, int variant) mp_type xx = 1 / x; return boost::math::cyl_bessel_k(1, xx) * sqrt(xx) * exp(xx); } + case 40: + return boost::math::lambert_w0(x); + case 41: + { + if (x == 0) + return 1; + return boost::math::lambert_w0(x) / x; + } + case 42: + { + static const mp_type e1 = exp(mp_type(-1)); + return x / -boost::math::lambert_w0(-e1 + x); + } + case 43: + { + mp_type xx = 1 / x; + return 1 / boost::math::lambert_w0(xx); + } + case 44: + { + // OK for -0.28 < w < 0.05 only: + return -1 / boost::math::lambert_wm1(-x); + } } return 0; } diff --git a/minimax/multiprecision.hpp b/minimax/multiprecision.hpp index f8e3d7b90..2f44ac07b 100644 --- a/minimax/multiprecision.hpp +++ b/minimax/multiprecision.hpp @@ -64,6 +64,57 @@ namespace boost { } } +#elif defined(USE_CPP_BIN_FLOAT_100) + +#include + +typedef boost::multiprecision::cpp_bin_float_100 mp_type; + +inline void set_working_precision(int n) +{ +} + +inline void set_output_precision(int n) +{ + std::cout << std::setprecision(n); + std::cerr << std::setprecision(n); +} + +inline mp_type round_to_precision(mp_type m, int bits) +{ + int i; + mp_type f = frexp(m, &i); + f = ldexp(f, bits); + i -= bits; + f = floor(f); + return ldexp(f, i); +} + +inline int get_working_precision() +{ + return std::numeric_limits::digits; +} + +namespace boost { + namespace math { + namespace tools { + + template <> + inline boost::multiprecision::cpp_bin_float_double_extended real_cast(mp_type val) + { + return boost::multiprecision::cpp_bin_float_double_extended(val); + } + template <> + inline boost::multiprecision::cpp_bin_float_quad real_cast(mp_type val) + { + return boost::multiprecision::cpp_bin_float_quad(val); + } + + } + } +} + + #elif defined(USE_MPFR_100) #include From 3cebb614a53f5543bb8c7e0b204212b4683696bb Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Mon, 27 Nov 2017 19:06:53 +0000 Subject: [PATCH 29/71] Math.LambertW: fix Halley termination condition. --- include/boost/math/special_functions/lambert_w.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index fe61fddc4..9eb71a723 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -854,7 +854,7 @@ namespace math } while ( (iterations < min_iterations) || // do minimum iterations. - (iterations >= max_iterations) // Absolute max limit during testing + (iterations <= max_iterations) // Absolute max limit during testing // (unexpected looping if need this). ); return w1; // From 698982d0dbe3d16e9ce981805b29de0e0527d04d Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Tue, 28 Nov 2017 17:59:44 +0000 Subject: [PATCH 30/71] Math.LambertW: More rational approximations. --- minimax/f.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/minimax/f.cpp b/minimax/f.cpp index a87f4475a..11d4be7bb 100644 --- a/minimax/f.cpp +++ b/minimax/f.cpp @@ -379,8 +379,8 @@ mp_type f(const mp_type& x, int variant) } case 44: { - // OK for -0.28 < w < 0.05 only: - return -1 / boost::math::lambert_wm1(-x); + mp_type ex = exp(x); + return boost::math::lambert_w0(ex) - x; } } return 0; From eff8ec3c748c6bb0a8692da91a536d8421df4117 Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 7 Dec 2017 16:44:33 +0000 Subject: [PATCH 31/71] Tidy before getting uptodate with develop branch --- test/test_lambert_w.cpp | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 5539b394e..fc2f2b467 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -6,7 +6,7 @@ // (See accompanying file LICENSE_1_0.txt // or copy at http://www.boost.org/LICENSE_1_0.txt) -// test_lambertw.cpp +// test_lambert_w.cpp //! \brief Basic sanity tests for Lambert W function plog productlog //! or lambert_w using algorithm informed by Thomas Luu, Veberic and Tosio Fukushima. @@ -34,9 +34,11 @@ using boost::multiprecision::cpp_dec_float_50; #include using boost::math::policies::digits2; #include // For Lambert W lambert_w function. -using boost::math::lambert_w0; +//using boost::math::lambert_w0; // Use jm version instead using boost::math::lambert_wm1; +#include "C:\Users\Paul\Desktop\lambert_w0.hpp" // JM latest providing jm_lambert_w0 and jm_lambert_wm1 + #include #include #include From 6d73d8f517687891620eb9417f4551adf8ce6c22 Mon Sep 17 00:00:00 2001 From: pabristow Date: Tue, 23 Jan 2018 14:38:56 +0000 Subject: [PATCH 32/71] commit so can switch to develop (problem in one polynomial nearest singularity --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 2 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 2 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- .../pol_tutorial/namespace_policies.html | 4 +- .../pol_tutorial/policy_tut_defaults.html | 25 +++- .../pol_tutorial/policy_usage.html | 4 +- .../pol_tutorial/what_is_a_policy.html | 29 +++- doc/html/math_toolkit/result_type.html | 2 +- doc/policies/policy_tutorial.qbk | 53 +++++-- doc/sf/lambert_w.qbk | 47 ++++-- example/lambert_w_graph.cpp | 49 ++++--- example/lambert_w_simple_examples.cpp | 2 +- .../math/special_functions/lambert_w.hpp | 5 +- test/test_lambert_w.cpp | 137 +++++++++++------- test/test_lambert_w0_precision_high.cpp | 10 +- test/test_lambert_w0_precision_low.cpp | 14 +- 21 files changed, 267 insertions(+), 130 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index e821887b6..9cdba317b 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: November 20, 2017 at 15:48:07 GMT

        Last revised: December 18, 2017 at 18:05:20 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index be7024a17..8f19b405c 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 7242fb102..969845731 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 895b0f347..99dca7502 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index d6fe944ed..77f3997ec 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index f39c5487e..2dcaf5d10 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index d938ebf42..84747b896 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index c88086300..955b0fcb3 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/pol_tutorial/namespace_policies.html b/doc/html/math_toolkit/pol_tutorial/namespace_policies.html index d9c3a3428..4895a1a9c 100644 --- a/doc/html/math_toolkit/pol_tutorial/namespace_policies.html +++ b/doc/html/math_toolkit/pol_tutorial/namespace_policies.html @@ -176,12 +176,12 @@ errno = 33 that now the macro BOOST_MATH_DECLARE_DISTRIBUTIONS accepts two parameters: the floating point type to use, and the policy type to apply. For example:

        -
        BOOST_MATH_DECLARE_DISTRIBUTIONS(double, mypolicy)
+
        BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)
 
        
 
        
         Results a set of typedefs being defined like this:
       
        
-
        typedef boost::math::normal_distribution<double, mypolicy> normal;
+
        typedef boost::math::normal_distribution<double, my_policy> normal;
 
        
 
        
         The name of each typedef is the same as the name of the distribution class
diff --git a/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html b/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html
index 997c4fcfb..67a1c7174 100644
--- a/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html
+++ b/doc/html/math_toolkit/pol_tutorial/policy_tut_defaults.html
@@ -113,14 +113,31 @@
 //
 // Define a policy that sets ::errno on overflow, and does
 // not promote double to long double internally:
-//
-typedef policy<domain_error<errno_on_error>, promote_double<false> > mypolicy;
+
+typedef policy
+<
+  domain_error<errno_on_error>,
+  promote_double<false>
+> my_policy;
 
        
 
        
-        then mypolicy defines a policy
-        where only the overflow error handling and double-promotion
+        then my_policy defines a
+        policy where only the overflow error handling and double-promotion
         policies differ from the defaults.
       
        
+
        
+        We can also add a desired precision, for example, 9 bits or 3 decimal digits,
+        to an error-handling policy, usually to trade precision for speed:
+      
        
+
        typedef policy<domain_error<errno_on_error>, digit2<9> > my_policy;
+
        
+
        
+        Or if you want to further modify an existing user policy, use normalise:
+      
        
+
        using boost::math::policies::normalise;
+
+typedef normalise<my_policy, digits2<9>>::type my_policy_9; // errno on error, and limited precision.
+
        
 
 
diff --git a/doc/html/math_toolkit/pol_tutorial/policy_usage.html b/doc/html/math_toolkit/pol_tutorial/policy_usage.html
index 017c611bf..034b5cbfd 100644
--- a/doc/html/math_toolkit/pol_tutorial/policy_usage.html
+++ b/doc/html/math_toolkit/pol_tutorial/policy_usage.html
@@ -36,8 +36,8 @@
             is the recommended method for setting installation-wide policies.
           
      • 
-            By instantiating a distribution object with an explicit policy: this
-            is mainly reserved for ad hoc policy changes.
+            By instantiating a statistical distribution object with an explicit policy:
+            this is mainly reserved for ad hoc policy changes.
           
      • 
             By passing a policy to a special function as an optional final argument:
diff --git a/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html b/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html
index 7001d0918..cb7e338b0 100644
--- a/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html
+++ b/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html
@@ -52,21 +52,34 @@
           
        • 
-        Some of these policies could arguably be runtime variables, but then we couldn't
-        use compile-time dispatch internally to select the best evaluation method
-        for the given policies.
+        Some of these policies could arguably be run-time variables, but then we
+        couldn't use compile-time dispatch internally to select the best evaluation
+        method for the given policies.
       
        
         For this reason a Policy is a type: in fact it's an
         instance of the class template boost::math::policies::policy<>. This class is just a compile-time-container
-        of user-selected policies (sometimes called a type-list):
+        of user-selected policies (sometimes called a type-list).
+      
        
+
        
+        Many policy
+        defaults are provided, so most of the time you can ignore the policy
+        framework, but you can overwrite with your own policies to give detailed
+        control, for example:
       
        using namespace boost::math::policies;
 //
-// Define a policy that sets ::errno on overflow, and does
-// not promote double to long double internally:
-//
-typedef policy<domain_error<errno_on_error>, promote_double<false> > mypolicy;
+// Define a policy that sets ::errno on overflow,
+// and does not promote double to long double internally,
+// and only aims for precision of only 3 decimal digits,
+// to an error-handling policy, usually to trade precision for speed:
+
+typedef policy
+<
+  domain_error<errno_on_error>,
+  promote_double<false>,
+  digits10<3>
+> my_policy;
 
        
 
 
 
 
 
 
 
 
 
        
diff --git a/doc/html/math_toolkit/result_type.html b/doc/html/math_toolkit/result_type.html
index 04491408f..c375e7430 100644
--- a/doc/html/math_toolkit/result_type.html
+++ b/doc/html/math_toolkit/result_type.html
@@ -39,7 +39,7 @@
       etc, are all valid calls, as long as "foo" is a function taking two
       floating-point arguments. But that leaves the question:
     
        
-
        
+
        
 
        
 
        
       "Given a special function with N arguments of types T1, T2,
diff --git a/doc/policies/policy_tutorial.qbk b/doc/policies/policy_tutorial.qbk
index ff0d92fe0..537734496 100644
--- a/doc/policies/policy_tutorial.qbk
+++ b/doc/policies/policy_tutorial.qbk
@@ -15,20 +15,30 @@ control:
 and `double` to `long double` in order to improve precision.
 * What precision to use when calculating the result.
 
-Some of these policies could arguably be runtime variables, but then we couldn't
+Some of these policies could arguably be run-time variables, but then we couldn't
 use compile-time dispatch internally to select the best evaluation method
 for the given policies.
 
 For this reason a Policy is a /type/: in fact it's an instance of the
 class template `boost::math::policies::policy<>`.  This class is just a
-compile-time-container of user-selected policies (sometimes called a type-list):
+compile-time-container of user-selected policies (sometimes called a type-list).
+
+Over a dozen __policy_defaults are provided, so most of the time you can ignore the policy framework,
+but you can overwrite the defaults with your own policies to give detailed control, for example:
 
    using namespace boost::math::policies;
-   //
-   // Define a policy that sets ::errno on overflow, and does
-   // not promote double to long double internally:
-   //
-   typedef policy, promote_double > mypolicy;
+
+   // Define a policy that sets ::errno on overflow,
+   // and does not promote double to long double internally,
+   // and only aims for precision of only 3 decimal digits,
+   // to an error-handling policy, usually to trade precision for speed:
+
+   typedef policy
+   <
+     domain_error,
+     promote_double,
+     digits10<3>
+   > my_policy;
 
 [endsect] [/section:what_is_a_policy So Just What is a Policy Anyway?]
 
@@ -83,13 +93,28 @@ inherits the defaults for any policies not explicitly set, so given:
    //
    // Define a policy that sets ::errno on overflow, and does
    // not promote double to long double internally:
-   //
-   typedef policy, promote_double > mypolicy;
 
-then `mypolicy` defines a policy where only the overflow error handling and
+   typedef policy
+   <
+     domain_error,
+     promote_double
+   > my_policy;
+
+then `my_policy` defines a policy where only the overflow error handling and
 `double`-promotion policies differ from the defaults.
 
-[endsect][/section:policy_tut_defaults Policies Have Sensible Defaults]
+We can also add a desired precision, for example, 9 bits or 3 decimal digits,
+to an error-handling policy, usually to trade precision for speed:
+
+   typedef policy, digit2<9> > my_policy;
+
+Or if you want to further modify an existing user policy, use `normalise`:
+
+  using boost::math::policies::normalise;
+
+  typedef normalise>::type my_policy_9; // errno on error, and limited precision.
+
+[endsect] [/section:policy_tut_defaults Policies Have Sensible Defaults]
 
 [section:policy_usage So How are Policies Used Anyway?]
 
@@ -97,7 +122,7 @@ The details follow later, but basically policies can be set by either:
 
 * Defining some macros that change the default behaviour: [*this is the
    recommended method for setting installation-wide policies].
-* By instantiating a distribution object with an explicit policy:
+* By instantiating a statistical distribution object with an explicit policy:
    this is mainly reserved for ad hoc policy changes.
 * By passing a policy to a special function as an optional final argument:
    this is mainly reserved for ad hoc policy changes.
@@ -297,11 +322,11 @@ Handling policies for the statistical distributions is very similar except that
 the macro BOOST_MATH_DECLARE_DISTRIBUTIONS accepts two parameters: the
 floating point type to use, and the policy type to apply.  For example:
 
-   BOOST_MATH_DECLARE_DISTRIBUTIONS(double, mypolicy)
+   BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)
 
 Results a set of typedefs being defined like this:
 
-   typedef boost::math::normal_distribution normal;
+   typedef boost::math::normal_distribution normal;
 
 The name of each typedef is the same as the name of the distribution
 class template, but without the "_distribution" suffix.
diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk
index 61ad1c4b6..b939eeb61 100644
--- a/doc/sf/lambert_w.qbk
+++ b/doc/sf/lambert_w.qbk
@@ -13,14 +13,13 @@
 
    template 
    ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy controlled precision.
-   // Use `lambert_w0(z, policy >())` // If speed is more important than the last-digit precision.
 
     template 
    ``__sf_result`` lambert_wm1(T z); // W-1 branch.
 
    template 
    ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy controlled precision.
-   // Use `lambert_wm1(z, policy >())` // If speed is more important than the last-digit precision.
+   // Use `lambert_wm1(z, policy >())` // If speed is more important than last-digit precision.
 
   } // namespace boost
   } // namespace math
@@ -35,10 +34,10 @@ On the z-interval \[0, [infin]\] there is just one real solution.
 On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-.
 Two principal branches functions called `lambert_W0` and `lambert_Wm1` are provided by this real-only implementation.
 
-[import ../../example/lambert_w_graph.cpp]
-
 In the graphs below, the red line is the W0 branch, and the blue line the W-1 branch.
 
+[import ../../example/lambert_w_graph.cpp]
+
 [graph lambert_w_graph]
 
 [graph lambert_w_graph_big_w]
@@ -48,6 +47,10 @@ There is a singularity where the branches meet at argument [^z = -1/e] [cong] [^
 This implementation computes the two real (not complex) branches W0 and W-1
 with the functions `lambert_w0` and `lambert_wm2` from the first [^z] argument.
 
+For C++ types `float` the maximum z argument `(std::numeric_limits<>::max)()`
+Lambert_w0(3.2e+38) = 84.29,
+and for `double`, lambert_w0(1.797e+308) = 703.3.
+
 The final __Policy argument is optional and can be used to control the behaviour of the function:
 how it handles errors and what level of precision can be traded for speed.
 By default, the best possible precision is computed.
@@ -79,7 +82,7 @@ Some examples follow:
 Other floating-point types can be used too, here `float`.
 It is convenient to use function `show_value`
 to display all potentially significant decimal digits
-for the type.
+(`std::numeric_limits<>::max_digits10`) for the type.
 
 [lambert_w_simple_examples_1]
 
@@ -95,7 +98,7 @@ Using multiprecision types to get much higher precision is painless.
 [warning When using multiprecision, take great care not to
 construct or assign non-integers from `double`, `float`... silently losing precision.]
 
-Using multiprecision types to get multiprecision precision wrong is all too easy!
+Using multiprecision types, it is all too easy to get multiprecision precision wrong!
 
 [lambert_w_simple_examples_4]
 
@@ -303,7 +306,11 @@ The range mathematically is -1/e <= z <= +[infin], but numerically, (for the typ
 * `z < -1/e` throws a `domain_error`, and/or returns `NaN` according to the policy.
 Provided that there is a `catch` clause, an error message (similar to that below) will be reported.
 * `z == (std::numeric_limits::max)()` returns W for the floating_point type T, (for example, for `double`, 703.22703310477018L)
-* `z == std::numeric_limits::infinity()`  returns +[infin] (if available).
+* `z == std::numeric_limits::infinity()`  throws a `overflow_error`.
+
+(An argument z passed as infinity probably indicates an error has already occured,
+but if it is desired to return infinity,
+this case can be handled before calling `lambert_w0`).
 
 [h5:wm1_edges w-1 Branch]
 
@@ -328,7 +335,7 @@ and anyway it only covers a tiny fraction of the range of possible z arguments v
 
 [h4:compilers Compilers]
 
-The code has been tested on VS 15.4.4 and GCC 7.1.0 but it is expected to work on all C++ compilers.
+The code has been tested on VS 15.5.2, Clang 5.0.0 and GCC 7.1.0 but it is expected to work on all C++ compilers.
 
 [h5:diagnostics Diagnostics Macros]
 
@@ -413,6 +420,13 @@ so Newton/Raphson's method unlikely to be quicker
 than the additional cost of computating the 2nd derivative for Halley's method,
 in this case requiring an expensive exponential function evaluation on each step.
 
+
+
+[h4:compact_implementation Implementing Compact Algorithms]
+
+The most compact algorithm can probably be implemented using the log approximation of Corless et al.
+followed by Halley iteration (but is also slowest and least precise near zero and near the branch singularity).
+
 [h4:faster_implementation Implementing Faster Algorithms]
 
 More recently, the Tosio Fukushima has developed an even faster algorithm,
@@ -439,6 +453,10 @@ usually to within one or two __epsilon.
 A mean difference was computed to express the typical error and is often about 0.5 epsilon,
 the theoretical minimum.
 
+A disadvantage is that the distribution of differences from the references value is reasonably random and unbiased,
+whereas the Schroeder stage is significantly biased.
+
+
 For speed during the bisection, Fukushima produces lookup tables of powers of e and z for integral Lambert W.
 There are 64 elements in these tables. The FORTRAN version (and the C++ translation by Veberic)
 computed these (once) as `static` data. This is slower, may cause trouble with multithreading, and
@@ -539,7 +557,8 @@ are 21 digits precision == `std::numeric_limits::max_digits10` for `long doub
 Specializations for `lambert_w0_small_z` are provided for
 `float`, `double`, `long double`, `float128` and for __multiprecision types like .
 
-The tag_type selection is based on the value `std::numeric_limits::max_digits10`.
+The tag_type selection is based on the value `std::numeric_limits::max_digits10`
+(and [*not] on the floating-point type T).
 This distinguishes between `long double` types that commonly vary between 64 and 80-bits,
 and also compilers that have a `float` type using 64 bits and/or `long double` using 128-bits.
 
@@ -646,6 +665,16 @@ the computational cost of the log functions was easily paid by far fewer iterati
    double r = lambert_wm1(z, policy >());
    // lambert_wm1(-1.0000000000000000e-26) = -64.026509628385895
 
+[h5:halley]
+
+After obtaining a double approximation, for `double` and quad 128-bit precision,
+a single iteration should suffice because
+Halley iteration should triple the precision with each step
+(as long as the function is well behaved - and it is),
+and since we have at least half of the bits correct already,
+one Halley step is ample to get to 128-bit precision.
+
+
 
 [h4:testing Testing]
 
diff --git a/example/lambert_w_graph.cpp b/example/lambert_w_graph.cpp
index 2735e08bf..9501da732 100644
--- a/example/lambert_w_graph.cpp
+++ b/example/lambert_w_graph.cpp
@@ -14,6 +14,10 @@
 #include 
 using boost::math::lambert_w0;
 using boost::math::lambert_wm1;
+
+#include "c:\Users\Paul\Desktop\lambert_w0.hpp" // for jm_tests
+using boost::math::jm_lambert_w0;
+
 #include 
 using boost::math::isfinite;
 #include 
@@ -54,23 +58,28 @@ int main()
     std::map w0s_big;   // Lambert W0 branch values for large z and W.
     std::map wm1s_big;   // Lambert W-1 branch values for small z and large -W.
 
+    std::cout.precision(std::numeric_limits::max_digits10);
+
+ //   for (double z = -0.3678794411714423215955237701614608727; z < 2.8; z += 0.001)
     int count = 0;
-    for (double z = -0.3678794411714423215955237701614608727; z < 2.8; z += 0.01)
+    for (double z = -0.36787944117144232159552377016146086744581113103176804; z < 1.; z += 0.001)
     {
-      double w0 = lambert_w0(z);
+      double w0 = jm_lambert_w0(z);
+      //double w0 = lambert_w0(z);
       w0s[z] = w0;
+      std::cout << "z " << z << ", w = " << w0 << std::endl;
       count++;
     }
     std::cout << "points " << count << std::endl;
 
-    count = 0;
-    for (double z = -0.3678794411714423215955237701614608727; z  < -0.001; z += 0.001)
-    {
-      double wm1 = lambert_wm1(z);
-      wm1s[z] = wm1;
-      count++;
-    }
-    std::cout << "points " << count << std::endl;
+    //count = 0;
+    //for (double z = -0.3678794411714423215955237701614608727; z  < -0.001; z += 0.001)
+    //{
+    //  double wm1 = lambert_wm1(z);
+    //  wm1s[z] = wm1;
+    //  count++;
+    //}
+    //std::cout << "points " << count << std::endl;
 
 
     svg_2d_plot data_plot;
@@ -114,17 +123,17 @@ int main()
     }
     std::cout << "points " << count << std::endl;
 
-    count = 0;
-    for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001)
-    {
-      double wm1 = lambert_wm1(z);
-      wm1s_big[z] = wm1;
-      count++;
-    }
-    std::cout << "points " << count << std::endl;
+    //count = 0;
+    //for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001)
+    //{
+    //  double wm1 = lambert_wm1(z);
+    //  wm1s_big[z] = wm1;
+    //  count++;
+    //}
+    //std::cout << "points " << count << std::endl;
 
     data_plot.plot(w0s, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1);
-    data_plot.plot(wm1s, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1);
+ //   data_plot.plot(wm1s, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1);
     data_plot.write("./lambert_w_graph");
 
     data_plot2.title("Lambert W function for larger z.")
@@ -156,7 +165,7 @@ int main()
 
     data_plot2.plot(w0s_big, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1);
     //data_plot2.plot(wm1s_big, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1);
-    data_plot2.write("./lambert_w_graph_big_W");
+    data_plot2.write("./lambert_w_graph_big_w");
 
     // bezier_on(true); // ???
   }
diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp
index ebdbd12b1..e3e7d6cda 100644
--- a/example/lambert_w_simple_examples.cpp
+++ b/example/lambert_w_simple_examples.cpp
@@ -134,7 +134,7 @@ int main()
      double r = lambert_w0(10); // int argument "10" that should be promoted to double argument.
      std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406992
      double rp = lambert_w0(10, policy<>()); // int argument "10" that should be promoted to double argument,
-     // for simplicity using default policy.
+     // for simplicity using default boost::math::policy.
      std::cout << "lambert_w0(10, policy<>()) = " << rp << std::endl;
      // lambert_w0(10, policy<>()) = 1.7455280027406992
      auto rr = lambert_w0(10); // C++11 needed.
diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index a93fb9b25..74eac4943 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -919,7 +919,7 @@ namespace math
   } // template T schroeder_update(const T w, const T y)
 
   /////////////  namespace detail implementations of Lambert W for W0 and W-1 branches.
-
+ 
   //! Compute Lambert W for W0 (or W+) branch.
   template
   T lambert_w0_imp(const T z, const Policy& pol)
@@ -1251,7 +1251,8 @@ namespace math
       }
     } // normal range and precision.
     throw std::logic_error("No result from lambert_w0_imp!  (Please report!)");  // Should never get here.
-  } //  T lambert_w0_imp(const T z, const Policy& /* pol */)
+  } //  T lambert_w0_imp(const T z, const Policy& pol)
+ 
 
   //! Lambert W for W-1 branch, -max(z) < z <= -1/e.
   // TODO is -max(z) allowed?
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index fc2f2b467..afe60782a 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -37,6 +37,7 @@ using boost::math::policies::digits2;
 //using boost::math::lambert_w0; // Use jm version instead
 using boost::math::lambert_wm1;
 
+// #include "C:\Users\Paul\Desktop\lambert_w0 - Copy before amalgamation.hpp"  // JM latest providing jm_lambert_w0 and jm_lambert_wm1
 #include "C:\Users\Paul\Desktop\lambert_w0.hpp"  // JM latest providing jm_lambert_w0 and jm_lambert_wm1
 
 #include 
@@ -115,7 +116,7 @@ void test_spots(RealType)
   // (Unused Parameter value, arbitrarily zero, only communicates the floating point type).
   // test_spots(0.F); test_spots(0.); test_spots(0.L);
 
-  using boost::math::lambert_w0;
+  using boost::math::jm_lambert_w0;
   using boost::math::lambert_wm1;
   using boost::math::constants::exp_minus_one;
   using boost::math::constants::e;
@@ -134,11 +135,11 @@ void test_spots(RealType)
 
 //  Test some bad parameters to the function, with default policy and with ignore_all policy.
 #ifndef BOOST_NO_EXCEPTIONS
-  BOOST_CHECK_THROW(boost::math::lambert_w0(-1.), std::domain_error);
-  BOOST_CHECK_THROW(boost::math::lambert_wm1(-1.), std::domain_error);
-  BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN.
+  BOOST_CHECK_THROW(jm_lambert_w0(-1.), std::domain_error);
+  BOOST_CHECK_THROW(lambert_wm1(-1.), std::domain_error);
+  BOOST_CHECK_THROW(jm_lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN.
   // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Was if infinity should throw, now infinity.
-  BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex.
+  BOOST_CHECK_THROW(jm_lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex.
 #else // No exceptions so set policy to ignore and check result is NaN
   BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits > :
     // Error in function boost::math::lambert_w0() : Argument z is infinite!
-    BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // Infinity allowed.
+    //BOOST_CHECK_EQUAL(jm_lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // If infinity allowed.
     BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::infinity()), std::domain_error); // Infinity NOT allowed.
   }
   if (std::numeric_limits::has_quiet_NaN)
   { // Argument Z == NaN is always an throwable error for both branches.
-    // BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
+    // BOOST_CHECK_EQUAL(jm_lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
     // Error in function boost::math::lambert_w0(): Argument z is NaN!
-    BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error);
+    BOOST_CHECK_THROW(jm_lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error);
     BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error);
   }
 
@@ -279,12 +280,15 @@ void test_spots(RealType)
 
     // Just using series approximation (switch at -0.35).
     // N[productlog(-0.351), 50] = -0.72398644140937651483634596143951001600417138085814
-    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
       BOOST_MATH_TEST_VALUE(RealType, -0.72398644140937651483634596143951001600417138085814),
-      2 * tolerance); // Note 2 * tolerance
+      // 2 * tolerance); // Note 2 * tolerance for PB fukushima
     // got -0.723986441409376931150560229265736446 without Halley
     // exp -0.72398644140937651483634596143951001
     // got -0.72398644140937651483634596143951029 with Halley
+      // -0.723987103 JM 4.7126390815771382  3.13946001911235553672 3.13946001911235553658372193565165217
+     2 * tolerance); // expect -0.72398644140937651 but get 4.7126390815771382 for  JM????
+    // Float is OK
 
     // Same for W-1 branch
     BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
@@ -362,30 +366,30 @@ void test_spots(RealType)
   }
   if (std::numeric_limits::has_quiet_NaN)
   {
-    // BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
+    // BOOST_CHECK_EQUAL(jm_lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
     // Error in function boost::math::lambert_w0(): Argument z is NaN!
     BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error);
   }
 
    // W0 Tests for too big and too small to use lookup table.
    // Exactly W = 64, not enough to be OK for lookup.
-    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348050619127737142206366920907815909119e+29)),
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348050619127737142206366920907815909119e+29)),
     BOOST_MATH_TEST_VALUE(RealType, 64.0),
     tolerance);
 
     // Just below z for F[64]
-    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.99045411719434e+29)),
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.99045411719434e+29)),
      BOOST_MATH_TEST_VALUE(RealType, 63.999989810930513468726486827408823607175844852495), tolerance);
     // Fails for quad_float -1.22277013397850595265
     //                      -1.22277013397850595319
 
   // Just too big, so using log approx and Halley refinement.
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29)),
     BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677),
     tolerance);
 
   // Check at reduced precision.
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29), policy >()),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29), policy >()),
     BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677),
     0.00002);  // 0.00001 fails.
 
@@ -434,7 +438,7 @@ void test_spots(RealType)
   BOOST_CHECK_THROW(lambert_wm1(-0.5), std::domain_error);
 
   // This fails for fixed_point type used for other tests because out of range?
-    //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
+    //BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
     //BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019),
     //// Output from https://www.wolframalpha.com/input/?i=lambert_w0(1e6)
     //// tolerance * 1000); // fails for fixed_point type exceeds 0.00015258789063
@@ -444,7 +448,7 @@ void test_spots(RealType)
   // So need to use some spot tests for specific types, or use a bigger fixed_point type.
 
   // Check zero.
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0)),
     BOOST_MATH_TEST_VALUE(RealType, 0.0),
     tolerance);
   // these fail for cpp_dec_float_50
@@ -460,7 +464,7 @@ BOOST_AUTO_TEST_CASE(test_types)
   // BOOST_TEST_MESSAGE output only appears if command line has --log_level="message"
   // or call set_threshold_level function:
   boost::unit_test_framework::unit_test_log.set_threshold_level(boost::unit_test_framework::log_messages);
-  BOOST_TEST_MESSAGE("Test Lambert W function for several types.");
+  BOOST_TEST_MESSAGE("\nTest Lambert W function for several types.");
   BOOST_TEST_MESSAGE(show_versions());  // Full version of Boost, STL and compiler info.
 
   // Fundamental built-in types:
@@ -489,10 +493,10 @@ BOOST_AUTO_TEST_CASE(test_types)
 
 BOOST_AUTO_TEST_CASE(test_range_of_double_values)
 {
-  using boost::math::lambert_w0;
   using boost::math::constants::exp_minus_one;
+  using boost::math::jm_lambert_w0;
 
-  BOOST_TEST_MESSAGE("Test Lambert W function type double for range of values.");
+  BOOST_TEST_MESSAGE("\nTest Lambert W function type double for range of values.");
 
   // Want to test almost largest value.
   // test_value = (std::numeric_limits::max)() / 4;
@@ -510,19 +514,19 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
   RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction.
   std::cout << "Tolerance " << epsilons  << " * epsilon == " << tolerance << std::endl;
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)),
     BOOST_MATH_TEST_VALUE(RealType, 9.9999900000149999733333854165586669000967020964243e-7),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[1e-6],50])
     tolerance);
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0001)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0001)),
     BOOST_MATH_TEST_VALUE(RealType, 0.000099990001499733385405869000452213835767629477903460),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50])
     tolerance);
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.001)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.001)),
     BOOST_MATH_TEST_VALUE(RealType, 0.00099900149733853088995782787410778559957065467928884),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50])
     tolerance);
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.01)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.01)),
     BOOST_MATH_TEST_VALUE(RealType, 0.0099014738435950118853363268165701079536277464949174),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50])
     tolerance * 25);  // <<< Needs a much bigger tolerance???
@@ -535,58 +539,58 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
   // 0.00990728209160670  approx
   // 0.00990147384359511  previous
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.05)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.05)),
     BOOST_MATH_TEST_VALUE(RealType, 0.047672308600129374726388900514160870747062965933891),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50])
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)),
     BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50])
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.)),
     BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50])
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 2.)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 2.)),
     BOOST_MATH_TEST_VALUE(RealType, 0.852605502013725491346472414695317466898453300151403508772),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(2.)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.049908894964039959988697070552897904589466943706341452932),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(3.)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 5.)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 5.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.5)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 6.)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 6.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.432404775898300311234078007212058694786434608804302025655),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(6)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 10.)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 10.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.7455280027406993830743012648753899115352881290809),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[10],50])
     tolerance);
 
-    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 100.)),
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 100.)),
     BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(100)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1000.)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1000.)),
     BOOST_MATH_TEST_VALUE(RealType, 5.2496028524015962271260563196973062825214723860596),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1000)
     tolerance);
 
   // This fails for fixed_point type used for other tests because out of range of the type?
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
     BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1e6)
     tolerance); //
@@ -605,25 +609,25 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     // unknown location : fatal error : in "test_range_of_values": class boost::exception_detail::clone_impl >: Error in function boost::math::lambert_w0(): Argument z = %1 too large.
     // I:\modular - boost\libs\math\test\test_lambert_w.cpp(456) : last checkpoint
 
-    BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(1.7976931348623157e+308 / 2), // max_value/2 for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(1.7976931348623157e+308 / 2), // max_value/2 for IEEE 64-bit double.
       static_cast(702.53487067487671916110655783739076368512998658347L),
       // N[productlog[0, 1.7976931348623157*10^308 /2],50] == 702.53487067487671916110655783739076368512998658347
       tolerance);
 
-    BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(1.7976931348623157e+308 /4), // near max_value/4 for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(1.7976931348623157e+308 /4), // near max_value/4 for IEEE 64-bit double.
       static_cast(701.8427092142920014223182853764045476L),
       // N[productlog(0, 1.7976931348623157* 10^308 /4 ), 37] =701.8427092142920014223182853764045476
       // N[productlog(0, 0.25 * 1.7976931348623157*10^307), 37]
       tolerance);
 
-    BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double.
       static_cast(701.84270921429200143342782556643059L),
       // N[lambert_w[4.4942328371557893e+307], 35]  == 701.8427092142920014334278255664305887
       // as a double == 701.83341468208209
       //                              Lambert computed 702.02379914670587
       0.000003); // OK Much less precise at the max edge???
 
-    BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0((std::numeric_limits::max)()), // max_value for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0((std::numeric_limits::max)()), // max_value for IEEE 64-bit double.
       static_cast(703.2270331047701868711791887193075930),
       // N[productlog(0, 1.7976931348623157* 10^308), 37] = 703.2270331047701868711791887193075930
       //                                                    703.22700325995515 lambert W
@@ -634,7 +638,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     // (below which the result has a non-zero imaginary part).
     RealType test_value = -exp_minus_one();
     test_value += (std::numeric_limits::epsilon() * 1);
-    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(test_value),
+    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(test_value),
       BOOST_MATH_TEST_VALUE(RealType, -0.99999996349975895),
       tolerance * 1000000000);
     // -0.99999996788201051
@@ -642,6 +646,29 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     // Would not expect to get a result closer than sqrt(epsilon)?
   } //  if (std::numeric_limits::is_specialized)
 
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.8060843159708177782855213616209920019974599683466713016),
+    2 * tolerance); // -0.806084335
+
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.365)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.8798200914159538111724840007674053239388642469453350954),
+    5 * tolerance); // Note 5 * tolerance
+
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.3678)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.9793607149578284774761844434886481686055949229547379368),
+   15 * tolerance); // Note 15 * tolerance when this close to singularity.
+
+
+
+  // Just using series approximation (Fukushima switch at -0.35, but JM at 0.01 of singularity < -0.3679).
+  // N[productlog(-0.351), 50] = -0.72398644140937651483634596143951001600417138085814
+  // N[productlog(-0.351), 55] = -0.7239864414093765148363459614395100160041713808581379727
+  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.72398644140937651483634596143951001600417138085814),
+    10 * tolerance); // Note was 2 * tolerance
+  // fails for JM version.
+
+
    // Not using near_singularity series approximation.
     BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)),
       BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545),
diff --git a/test/test_lambert_w0_precision_high.cpp b/test/test_lambert_w0_precision_high.cpp
index e69e297ad..8616e5be1 100644
--- a/test/test_lambert_w0_precision_high.cpp
+++ b/test/test_lambert_w0_precision_high.cpp
@@ -6,6 +6,8 @@
 
 // Test evaluations of Lambert W function and comparison with reference values > 0.5 computed at 100 decimal digits precision.
 
+// ALso used to test JM_lambert_w0 
+
 //#define BOOST_MATH_LAMBERT_W_TEST_OUTPUT // Define to output all values of argument z and lambert W and differences.
 
 #include  // For float_64_t, float128_t. Must be first include!
@@ -34,6 +36,9 @@ using boost::multiprecision::cpp_bin_float_quad;
                                                
 #include // For lambert_w0 and _wm1 functions.
 
+#include "C:\Users\Paul\Desktop\lambert_w0.hpp"  // JM series version 2.
+// using boost::math::jm_lambert_w0;
+
 #include 
 #include 
 #include 
@@ -88,6 +93,7 @@ float test_zws()
   init_zws(); // Test z arguments and Lambert W reference values.
 
   using boost::math::lambert_w0;
+  using boost::math::jm_lambert_w0;
   using boost::math::lambert_wm1;
   using boost::math::float_distance;
 
@@ -101,7 +107,7 @@ float test_zws()
   for (size_t i = 0; i != noof_tests; i++)
   {
     RealType z = zs[i];
-    RealType w = lambert_w0(z); // Only for float or double!
+    RealType w = jm_lambert_w0(z); // Only for float or double!
     RealType kw = ws[i];  // 'Known good' 100 decimal digits.
 
     RealType fd = float_distance(w, kw);
@@ -140,6 +146,7 @@ float test_zws()
 template
 int test_spot(RealType z)
 {
+  using boost::math::jm_lambert_w0;
   using boost::math::lambert_w0;
   using boost::math::float_distance;
 
@@ -161,6 +168,7 @@ template
 int compare_spot(RealType z, RealType w)
 {
   using boost::math::lambert_w0;
+  using boost::math::jm_lambert_w0;
   using boost::math::lambert_wm1;
   using boost::math::nextafter;
   using boost::math::float_next;
diff --git a/test/test_lambert_w0_precision_low.cpp b/test/test_lambert_w0_precision_low.cpp
index 6865d87e4..299134412 100644
--- a/test/test_lambert_w0_precision_low.cpp
+++ b/test/test_lambert_w0_precision_low.cpp
@@ -6,6 +6,8 @@
 
 // Test evaluations of Lambert W function and comparison with reference values computed at 100 decimal digits precision.
 
+// Alos uses JM version 2 comparing with PB/fukushima lambert_w0 before it is incorporated.
+
 //#define BOOST_MATH_LAMBERT_W_TEST_OUTPUT // Define to output all values of argument z and lambert W and differences.
 
 #include  // For float_64_t, float128_t. Must be first include!
@@ -39,6 +41,10 @@ using boost::multiprecision::cpp_bin_float_50; // 50 decimal digits type.
 
 // For lambert_w function.
 #include 
+
+#include "C:\Users\Paul\Desktop\lambert_w0.hpp"  // JM series version 2 for testing.
+// using boost::math::jm_lambert_w0;
+
 using boost::multiprecision::cpp_bin_float_double_extended;
 using boost::multiprecision::cpp_bin_float_double;
 using boost::multiprecision::cpp_bin_float_quad;
@@ -149,9 +155,10 @@ template
 int test_spot(RealType z)
 {
   using boost::math::lambert_w0;
+  using boost::math::jm_lambert_w0;
   using boost::math::float_distance;
 
-  RealType lw = lambert_w0(z);
+  RealType lw = jm_lambert_w0(z);
   RealType rlw = static_cast(lambert_w0(z));
 
   std::cout.precision(std::numeric_limits::max_digits10); // or
@@ -168,7 +175,8 @@ int test_spot(RealType z)
 template
 int compare_spot(RealType z, RealType w)
 {
-  using boost::math::lambert_w0;
+ // using boost::math::lambert_w0;
+  using boost::math::jm_lambert_w0;
   using boost::math::lambert_wm1;
   using boost::math::nextafter;
   using boost::math::float_next;
@@ -187,7 +195,7 @@ int compare_spot(RealType z, RealType w)
   // std::cout.precision(std::numeric_limits::max_digits10);
   std::cout.precision(std::numeric_limits::digits10);
 
-  RealType lw = lambert_w0(z);
+  RealType lw = jm_lambert_w0(z);
   RealType flw = w;
 
   std::cout << lw << "\n" << flw << std::endl;

From b4ffbedf1e72b1f0fc69bc9c45533a473851d84a Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Tue, 30 Jan 2018 12:11:03 +0000
Subject: [PATCH 33/71] Change to use JM W0 version.

---
 example/lambert_w_graph.cpp                   |   44 +-
 .../math/special_functions/lambert_w.hpp      | 3030 +++++++++--------
 .../lambert_w_lookup_table.ipp                |   17 +-
 .../math/special_functions/lambert_w_pb.hpp   | 1662 +++++++++
 minimax/Jamfile.v2                            |   38 +-
 minimax/f.cpp                                 |    1 +
 test/lambert_w_lookup_table_generator.cpp     |   44 +-
 test/test_lambert_w.cpp                       |  284 +-
 8 files changed, 3606 insertions(+), 1514 deletions(-)
 create mode 100644 include/boost/math/special_functions/lambert_w_pb.hpp

diff --git a/example/lambert_w_graph.cpp b/example/lambert_w_graph.cpp
index 9501da732..fcf597d2a 100644
--- a/example/lambert_w_graph.cpp
+++ b/example/lambert_w_graph.cpp
@@ -60,27 +60,25 @@ int main()
 
     std::cout.precision(std::numeric_limits::max_digits10);
 
- //   for (double z = -0.3678794411714423215955237701614608727; z < 2.8; z += 0.001)
     int count = 0;
-    for (double z = -0.36787944117144232159552377016146086744581113103176804; z < 1.; z += 0.001)
+    for (double z = -0.36787944117144232159552377016146086744581113103176804; z < 2.8; z += 0.001)
     {
       double w0 = jm_lambert_w0(z);
       //double w0 = lambert_w0(z);
       w0s[z] = w0;
-      std::cout << "z " << z << ", w = " << w0 << std::endl;
+ //     std::cout << "z " << z << ", w = " << w0 << std::endl;
       count++;
     }
     std::cout << "points " << count << std::endl;
 
-    //count = 0;
-    //for (double z = -0.3678794411714423215955237701614608727; z  < -0.001; z += 0.001)
-    //{
-    //  double wm1 = lambert_wm1(z);
-    //  wm1s[z] = wm1;
-    //  count++;
-    //}
-    //std::cout << "points " << count << std::endl;
-
+    count = 0;
+    for (double z = -0.3678794411714423215955237701614608727; z  < -0.001; z += 0.001)
+    {
+      double wm1 = lambert_wm1(z);
+      wm1s[z] = wm1;
+      count++;
+    }
+    std::cout << "points " << count << std::endl;
 
     svg_2d_plot data_plot;
     svg_2d_plot data_plot2;
@@ -112,8 +110,6 @@ int main()
       //.background_border_color(black);
       ;
     
-
-
     // bigger W
     for (double z = -0.3678794411714423215955237701614608727; z < 10000.; z += 50.)
     {
@@ -123,17 +119,17 @@ int main()
     }
     std::cout << "points " << count << std::endl;
 
-    //count = 0;
-    //for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001)
-    //{
-    //  double wm1 = lambert_wm1(z);
-    //  wm1s_big[z] = wm1;
-    //  count++;
-    //}
-    //std::cout << "points " << count << std::endl;
+    count = 0;
+    for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001)
+    {
+      double wm1 = lambert_wm1(z);
+      wm1s_big[z] = wm1;
+      count++;
+    }
+    std::cout << "points " << count << std::endl;
 
     data_plot.plot(w0s, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1);
- //   data_plot.plot(wm1s, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1);
+    data_plot.plot(wm1s, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1);
     data_plot.write("./lambert_w_graph");
 
     data_plot2.title("Lambert W function for larger z.")
@@ -164,7 +160,7 @@ int main()
       ;
 
     data_plot2.plot(w0s_big, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1);
-    //data_plot2.plot(wm1s_big, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1);
+    data_plot2.plot(wm1s_big, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1);
     data_plot2.write("./lambert_w_graph_big_w");
 
     // bezier_on(true); // ???
diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 74eac4943..d8514ab4d 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -1,20 +1,35 @@
+// Copyright John Maddock 2017.
 // Copyright Paul A. Bristow 2016, 2017.
 
 // 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).
 
+#ifndef BOOST_MATH_LAMBERTW0_HPP
+#define BOOST_MATH_LAMBERTW0_HPP
+
+// TODO change name of include file after PB/TF/DV version replaced fully.
+//#ifndef BOOST_MATH_SF_LAMBERT_W_HPP
+//#define BOOST_MATH_SF_LAMBERT_W_HPP
+
+#ifdef _MSC_VER
+#  pragma warning (disable: 4127) // warning C4127: conditional expression is constant.
+#endif // _MSC_VER
+
+//#include 
+
 /*
-Implementation of the Fukushima algorithm for the Lambert W0 and W-1 real-only functions.
+Implementation of an algorithm for the Lambert W0 and W-1 real-only functions.
 
-This code is based on the algorithm by
-Toshio Fukushima, 
+This code is based in part on the algorithm by
+Toshio Fukushima,
 "Precise and fast computation of Lambert W-functions without transcendental function evaluations",
-J. Comp. Appl. Math. 244 (2013) 77-89,
-and its author's FORTRAN code,
+J.Comp.Appl.Math. 244 (2013) 77-89,
 and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si
-based on the algorithm and a FORTRAN version of Toshio Fukushima.
+based on the algorithm and a FORTRAN version of Toshio Fukushima's algorithm.
+*/
 
+/*
 Some macros that will show some (or much) diagnostic values if #defined.
 //[boost_math_instrument_lambert_w_macros
 
@@ -39,20 +54,12 @@ BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table.
 //] [/boost_math_instrument_lambert_w_macros]
 */
 
-#ifndef BOOST_MATH_SF_LAMBERT_W_HPP
-#define BOOST_MATH_SF_LAMBERT_W_HPP
-
-#ifdef _MSC_VER
-#  pragma warning (disable: 4127) // warning C4127: conditional expression is constant
-#endif // _MSC_VER
-
 #include 
 #include 
 #include 
 #include 
 #include  // for log (1 + x)
 #include  // For exp_minus_one == 3.67879441171442321595523770161460867e-01.
-#include  // for float_distance
 #include  // Link fails for pow without this, even though uses std::pow.
 #include  // series functor.
 #include   // polynomial.
@@ -60,7 +67,7 @@ BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table.
 #include 
 #include 
 #include  // boost::math::tools::max_value().
-#include  //  Macro BOOST_MATH_TEST_VALUE.
+#include  // For create_test_value and macro BOOST_MATH_TEST_VALUE.
 
 #include 
 #include 
@@ -71,19 +78,154 @@ BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table.
 #include 
 #include 
 #include   // For float_distance.
-//#include  // For create_test_value and macro BOOST_MATH_TEST_VALUE.
 
 typedef double lookup_t; // Type for lookup table (double or float, or even long double?)
 
 //#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp"
- #include "lambert_w_lookup_table.ipp" // Boost.Math version.
+// #include "lambert_w_lookup_table.ipp" // Boost.Math version.
+#include 
 
-namespace boost
+namespace boost {
+namespace math {
+namespace lambert_w_detail {
+
+//! \brief Applies a single Halley step to make a better estimate of Lambert W.
+//! \details Used the simplified formulae obtained from
+//! http://www.wolframalpha.com/input/?i=%5B2(z+exp(z)-w)+d%2Fdx+(z+exp(z)-w)%5D+%2F+%5B2+(d%2Fdx+(z+exp(z)-w))%5E2+-+(z+exp(z)-w)+d%5E2%2Fdx%5E2+(z+exp(z)-w)%5D
+//! [2(z exp(z)-w) d/dx (z exp(z)-w)] / [2 (d/dx (z exp(z)-w))^2 - (z exp(z)-w) d^2/dx^2 (z exp(z)-w)]
+
+//! \tparam T floating-point (or fixed-point) type.
+//! \param w_est Lambert W estimate.
+//! \param z Argument z for Lambert_w function.
+//! \returns New estimate of Lambert W, hopefully improved.
+//!
+template 
+inline T lambert_w_halley_step(T w_est, const T z)
 {
-namespace math
+  T e = exp(w_est);
+  w_est -= 2 * (w_est + 1) * (e * w_est - z) / (z * (w_est + 2) + e * (w_est * (w_est + 2) + 2));
+  return w_est;
+} // template  lambert_w_halley_step(T w_est, T z)
+
+//! \brief Halley iterate to refine Lambert_w estimate,
+//! taking at least one Halley_step.
+//! Repeat Halley steps until the *last step* had fewer than half the digits wrong,
+//! the step we've just taken should have been sufficient to have completed the iteration.
+
+//! \tparam T floating-point (or fixed-point) type.
+//! \param z Argument z for Lambert_w function.
+//! \param w_est Lambert w estimate.
+template 
+inline
+  T lambert_w_halley_iterate(T w_est, const T z)
 {
-  namespace detail
+  static const T max_diff = boost::math::tools::root_epsilon() * fabs(w_est);
+
+  T w_new = lambert_w_halley_step(w_est, z);
+  T diff = fabs(w_est - w_new);
+  while (diff > max_diff)
   {
+    w_est = w_new;
+    w_new = lambert_w_halley_step(w_est, z);
+    diff = fabs(w_est - w_new);
+  }
+  return w_new;
+} // template  lambert_w_halley_iterate(T w_est, T z)
+
+
+// Two Halley function versions that either
+// single step (if mpl::false_) or iterate (if mpl::true_).
+// Selected at compile-time using parameter 3.
+template 
+inline
+T lambert_w_maybe_halley_iterate(T z, T w, mpl::false_ const&)
+{
+   return lambert_w_halley_step(z, w); // Single step.
+}
+
+template 
+inline
+T lambert_w_maybe_halley_iterate(T z, T w, mpl::true_ const&)
+{
+   return lambert_w_halley_iterate(z, w); // Iterate steps.
+}
+
+//! maybe_reduce_to_double function,
+//! Two versions that have a compile-time option to
+//! reduce argument z to double precision (if mpl::true_).
+//! Version is selected at compile-time using parameter 2.
+
+template 
+inline
+double maybe_reduce_to_double(const T& z, const mpl::true_&)
+{
+  return static_cast(z); // Reduce to double precision.
+}
+
+template 
+inline
+T maybe_reduce_to_double(const T& z, const mpl::false_&)
+{ // Don't reduce to double.
+  return z;
+}
+
+//! \brief Schroeder method, fifth-order update formula,
+//! \details See T. Fukushima page 80-81, and
+//! A. Householder, The Numerical Treatment of a Single Nonlinear Equation,
+//! McGraw-Hill, New York, 1970, section 4.4.
+//! Fukushima algorithm switches to @c schroeder_update after pre-computed bisections,
+//! chosen to ensure that the result will be achieve the +/- 10 epsilon target.
+//! \param w Lambert w estimate from bisection or series.
+//! \param y bracketing value from bisection.
+//! \returns Refined estimate of Lambert w.
+
+// Schroeder refinement, called unless NOT required by precision policy.
+template
+inline
+T schroeder_update(const T w, const T y)
+{
+  // Compute derivatives using 5th order Schroeder refinement.
+  // Since this is the final step, it will always use the highest precision type T.
+  // Example of Call:
+  //   result = schroeder_update(w, y);
+  //where
+  // w is estimate of Lambert W (from bisection or series).
+  // y is z * e^-w.
+
+  BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+    std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+  using boost::math::float_distance;
+  T fd = float_distance(w, y);
+  std::cout << "Schroder ";
+  if (abs(fd) < 214748000.)
+  {
+    std::cout << " Distance = "<< static_cast(fd);
+  }
+  else
+  {
+    std::cout << "Difference w - y = " << (w - y) << ".";
+  }
+  std::cout << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+  //  Fukushima equation 18, page 6.
+  const T f0 = w - y; // f0 = w - y.
+  const T f1 = 1 + y; // f1 = df/dW
+  const T f00 = f0 * f0;
+  const T f11 = f1 * f1;
+  const T f0y = f0 * y;
+  const T result =
+    w - 4 * f0 * (6 * f1 * (f11 + f0y)  +  f00 * y) /
+    (f11 * (24 * f11 + 36 * f0y) +
+      f00 * (6 * y * y  +  8 * f1 * y  +  f0y)); // Fukushima Page 81, equation 21 from equation 20.
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+  std::cout << "Schroeder refined " << w << "  " << y << ", difference  " << w-y  << ", change " << w - result << ", to result " << result << std::endl;
+  std::cout.precision(saved_precision); // Restore.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+
+  return result;
+} // template T schroeder_update(const T w, const T y)
 
   //! \brief Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944.
   //! Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]]
@@ -94,196 +236,197 @@ namespace math
   //! are at least 21 digits precision == max_digits10 for long double.
   //! Longer decimal digits strings are rationals evaluated using Wolfram.
 
-    template
-    T lambert_w_singularity_series(const T p)
-    {
+template
+T lambert_w_singularity_series(const T p)
+{
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES
-      std::size_t saved_precision = std::cout.precision(3);
-      std::cout << "Singularity_series Lambert_w p argument = " << p << std::endl;
-      std::cout
-        //<< "Argument Type = " << typeid(T).name()
-        //<< ", max_digits10 = " << std::numeric_limits::max_digits10
-        //<< ", epsilon = " << std::numeric_limits::epsilon()
-      << std::endl;
-      std::cout.precision(saved_precision);
+  std::size_t saved_precision = std::cout.precision(3);
+  std::cout << "Singularity_series Lambert_w p argument = " << p << std::endl;
+  std::cout
+    //<< "Argument Type = " << typeid(T).name()
+    //<< ", max_digits10 = " << std::numeric_limits::max_digits10
+    //<< ", epsilon = " << std::numeric_limits::epsilon()
+    << std::endl;
+  std::cout.precision(saved_precision);
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES
 
-      static const T q[] =
-      {
-        -static_cast(1), // j0
-        +T(1), // j1
-        -T(1) / 3, // 1/3  j2
-        +T(11) / 72, // 0.152777777777777778, // 11/72 j3
-        -T(43) / 540, // 0.0796296296296296296, // 43/540 j4
-        +T(769) / 17280, // 0.0445023148148148148,  j5
-        -T(221) / 8505, // 0.0259847148736037625,  j6
-        //+T(0.0156356325323339212L), // j7
-        //+T(0.015635632532333921222810111699000587889476778365667L), // j7 from Wolfram N[680863/43545600, 50]
-        +T(680863uLL) / 43545600uLL, // +0.0156356325323339212, j7
-        //-T(0.00961689202429943171L), // j8
-        -T(1963uLL) / 204120uLL, // 0.00961689202429943171, j8
-        //-T(0.0096168920242994317068391142465216539290613364687439L), // j8 from Wolfram N[1963/204120, 50]
-        +T(226287557uLL) / 37623398400uLL, // 0.00601454325295611786, j9
-        -T(5776369uLL) / 1515591000uLL, // 0.00381129803489199923, j10
-        //+T(0.00244087799114398267L), j11 0.0024408779911439826658968585286437530215699919795550
-        +T(169709463197uLL) / 69528040243200uLL, // j11
-        // -T(0.00157693034468678425L), // j12  -0.0015769303446867842539234095399314115973161850314723
-        -T(1118511313uLL) / 709296588000uLL, // j12
-        +T(667874164916771uLL) / 650782456676352000uLL, // j13
-        //+T(0.00102626332050760715L), // j13 0.0010262633205076071544375481533906861056468041465973
-        -T(500525573uLL) / 744761417400uLL, // j14
-        // -T(0.000672061631156136204L), j14
-        //+T(1003663334225097487uLL) / 234281684403486720000uLL, // j15 0.00044247306181462090993020760858473726479232802068800 error C2177: constant too big
-        //+T(0.000442473061814620910L, // j15
-        BOOST_MATH_TEST_VALUE(T, +0.000442473061814620910), // j15
-        // -T(0.000292677224729627445L), // j16
-        BOOST_MATH_TEST_VALUE(T, -0.000292677224729627445), // j16
-        //+T(0.000194387276054539318L), // j17
-        BOOST_MATH_TEST_VALUE(T, 0.000194387276054539318), // j17
-        //-T(0.000129574266852748819L), // j18
-        BOOST_MATH_TEST_VALUE(T, -0.000129574266852748819), // j18
-        //+T(0.0000866503580520812717L), // j19 N[+1150497127780071399782389/13277465363600276402995200000, 50] 0.000086650358052081271660451590462390293190597827783288
-        BOOST_MATH_TEST_VALUE(T, +0.0000866503580520812717), // j19
-        //-T(0.0000581136075044138168L) // j20  N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913
-        // -T(2853534237182741069uLL) / 49102686267859224000000uLL  // j20 // error C2177: constant too big,
-        // so must use BOOST_MATH_TEST_VALUE(T, ) format in hope of using suffix Q for quad or decimal digits string for others.
-         //-T(0.000058113607504413816772205464778828177256611844221913L), // j20  N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913
-        BOOST_MATH_TEST_VALUE(T, -0.000058113607504413816772205464778828177256611844221913) // j20  - last used by Fukushima
-        // More terms don't seem to give any improvement (worse in fact) and are not use for many z values.
-        //BOOST_MATH_TEST_VALUE(T, +0.000039076684867439051635395583044527492132109160553593), // j21
-        //BOOST_MATH_TEST_VALUE(T, -0.000026338064747231098738584082718649443078703982217219), // j22
-        //BOOST_MATH_TEST_VALUE(T, +0.000017790345805079585400736282075184540383274460464169), // j23
-        //BOOST_MATH_TEST_VALUE(T, -0.000012040352739559976942274116578992585158113153190354), // j24
-        //BOOST_MATH_TEST_VALUE(T, +8.1635319824966121713827512573558687050675701559448E-6), // j25
-        //BOOST_MATH_TEST_VALUE(T, -5.5442032085673591366657251660804575198155559225316E-6) // j26
-       // -T(5.5442032085673591366657251660804575198155559225316E-6L) // j26
-      // 21 to 26 Added for long double.
-      }; // static const T q[]
+  static const T q[] =
+  {
+    -static_cast(1), // j0
+    +T(1), // j1
+    -T(1) / 3, // 1/3  j2
+    +T(11) / 72, // 0.152777777777777778, // 11/72 j3
+    -T(43) / 540, // 0.0796296296296296296, // 43/540 j4
+    +T(769) / 17280, // 0.0445023148148148148,  j5
+    -T(221) / 8505, // 0.0259847148736037625,  j6
+    //+T(0.0156356325323339212L), // j7
+    //+T(0.015635632532333921222810111699000587889476778365667L), // j7 from Wolfram N[680863/43545600, 50]
+    +T(680863uLL) / 43545600uLL, // +0.0156356325323339212, j7
+    //-T(0.00961689202429943171L), // j8
+    -T(1963uLL) / 204120uLL, // 0.00961689202429943171, j8
+    //-T(0.0096168920242994317068391142465216539290613364687439L), // j8 from Wolfram N[1963/204120, 50]
+    +T(226287557uLL) / 37623398400uLL, // 0.00601454325295611786, j9
+    -T(5776369uLL) / 1515591000uLL, // 0.00381129803489199923, j10
+    //+T(0.00244087799114398267L), j11 0.0024408779911439826658968585286437530215699919795550
+    +T(169709463197uLL) / 69528040243200uLL, // j11
+    // -T(0.00157693034468678425L), // j12  -0.0015769303446867842539234095399314115973161850314723
+    -T(1118511313uLL) / 709296588000uLL, // j12
+    +T(667874164916771uLL) / 650782456676352000uLL, // j13
+    //+T(0.00102626332050760715L), // j13 0.0010262633205076071544375481533906861056468041465973
+    -T(500525573uLL) / 744761417400uLL, // j14
+    // -T(0.000672061631156136204L), j14
+    //+T(1003663334225097487uLL) / 234281684403486720000uLL, // j15 0.00044247306181462090993020760858473726479232802068800 error C2177: constant too big
+    //+T(0.000442473061814620910L, // j15
+    BOOST_MATH_TEST_VALUE(T, +0.000442473061814620910), // j15
+    // -T(0.000292677224729627445L), // j16
+    BOOST_MATH_TEST_VALUE(T, -0.000292677224729627445), // j16
+    //+T(0.000194387276054539318L), // j17
+    BOOST_MATH_TEST_VALUE(T, 0.000194387276054539318), // j17
+    //-T(0.000129574266852748819L), // j18
+    BOOST_MATH_TEST_VALUE(T, -0.000129574266852748819), // j18
+    //+T(0.0000866503580520812717L), // j19 N[+1150497127780071399782389/13277465363600276402995200000, 50] 0.000086650358052081271660451590462390293190597827783288
+    BOOST_MATH_TEST_VALUE(T, +0.0000866503580520812717), // j19
+    //-T(0.0000581136075044138168L) // j20  N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913
+    // -T(2853534237182741069uLL) / 49102686267859224000000uLL  // j20 // error C2177: constant too big,
+    // so must use BOOST_MATH_TEST_VALUE(T, ) format in hope of using suffix Q for quad or decimal digits string for others.
+    //-T(0.000058113607504413816772205464778828177256611844221913L), // j20  N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913
+    BOOST_MATH_TEST_VALUE(T, -0.000058113607504413816772205464778828177256611844221913) // j20  - last used by Fukushima
+    // More terms don't seem to give any improvement (worse in fact) and are not use for many z values.
+    //BOOST_MATH_TEST_VALUE(T, +0.000039076684867439051635395583044527492132109160553593), // j21
+    //BOOST_MATH_TEST_VALUE(T, -0.000026338064747231098738584082718649443078703982217219), // j22
+    //BOOST_MATH_TEST_VALUE(T, +0.000017790345805079585400736282075184540383274460464169), // j23
+    //BOOST_MATH_TEST_VALUE(T, -0.000012040352739559976942274116578992585158113153190354), // j24
+    //BOOST_MATH_TEST_VALUE(T, +8.1635319824966121713827512573558687050675701559448E-6), // j25
+    //BOOST_MATH_TEST_VALUE(T, -5.5442032085673591366657251660804575198155559225316E-6) // j26
+    // -T(5.5442032085673591366657251660804575198155559225316E-6L) // j26
+    // 21 to 26 Added for long double.
+  }; // static const T q[]
 
-      /*
-      // Temporary copy of original double values for comparison; these are reproduced well.
-      static const T q[] =
-      {
-        -1L,  // j0
-        +1L,  // j1
-        -0.333333333333333333L, // 1/3 j2
-        +0.152777777777777778L, // 11/72 j3
-        -0.0796296296296296296L, // 43/540
-        +0.0445023148148148148L,
-        -0.0259847148736037625L,
-        +0.0156356325323339212L,
-        -0.00961689202429943171L,
-        +0.00601454325295611786L,
-        -0.00381129803489199923L,
-        +0.00244087799114398267L,
-        -0.00157693034468678425L,
-        +0.00102626332050760715L,
-        -0.000672061631156136204L,
-        +0.000442473061814620910L,
-        -0.000292677224729627445L,
-        +0.000194387276054539318L,
-        -0.000129574266852748819L,
-        +0.0000866503580520812717L,
-        -0.0000581136075044138168L // j20
-      };
-      */
+     /*
+     // Temporary copy of original double values for comparison; these are reproduced well.
+     static const T q[] =
+     {
+     -1L,  // j0
+     +1L,  // j1
+     -0.333333333333333333L, // 1/3 j2
+     +0.152777777777777778L, // 11/72 j3
+     -0.0796296296296296296L, // 43/540
+     +0.0445023148148148148L,
+     -0.0259847148736037625L,
+     +0.0156356325323339212L,
+     -0.00961689202429943171L,
+     +0.00601454325295611786L,
+     -0.00381129803489199923L,
+     +0.00244087799114398267L,
+     -0.00157693034468678425L,
+     +0.00102626332050760715L,
+     -0.000672061631156136204L,
+     +0.000442473061814620910L,
+     -0.000292677224729627445L,
+     +0.000194387276054539318L,
+     -0.000129574266852748819L,
+     +0.0000866503580520812717L,
+     -0.0000581136075044138168L // j20
+     };
+     */
 
-      // Decide how many series terms to use, increasing as z approaches the singularity,
-      // balancing run-time versus computational noise from round-off.
-      // In practice, we truncate the series expansion at a certain order.
-      // If the order is too large, not only does the amount of computation increase,
-      // but also the round-off errors accumulate.
-      // See Fukushima equation 35, page 85 for logic of choice of number of series terms.
+     // Decide how many series terms to use, increasing as z approaches the singularity,
+     // balancing run-time versus computational noise from round-off.
+     // In practice, we truncate the series expansion at a certain order.
+     // If the order is too large, not only does the amount of computation increase,
+     // but also the round-off errors accumulate.
+     // See Fukushima equation 35, page 85 for logic of choice of number of series terms.
 
-      BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs.
+  BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs.
 
-      const T absp = abs(p);
+    const T absp = abs(p);
 
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS
-      {
-        int terms = 20; // Default to using all terms.
-        if (absp < 0.001150)
-        { // Very near singularity.
-          terms = 6;
-        }
-        else if (absp < 0.0766)
-        { // Near singularity.
-          terms = 10;
-        }
-        std::streamsize saved_precision = std::cout.precision(3);
-        std::cout << "abs(p) = " << absp << ", terms = " << terms << std::endl;
-        std::cout.precision(saved_precision);
-      }
+  {
+    int terms = 20; // Default to using all terms.
+    if (absp < 0.001150)
+    { // Very near singularity.
+      terms = 6;
+    }
+    else if (absp < 0.0766)
+    { // Near singularity.
+      terms = 10;
+    }
+    std::streamsize saved_precision = std::cout.precision(3);
+    std::cout << "abs(p) = " << absp << ", terms = " << terms << std::endl;
+    std::cout.precision(saved_precision);
+  }
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS
 
-    if (absp < 0.01159)
-    { // Only 6 near-singularity series terms are useful.
-      return
-        -1 +
-        p*(1 +
-          p*(q[2] +
-            p*(q[3] +
-              p*(q[4] +
-                p*(q[5] +
-                  p*q[6]
-                  )))));
-    }
-    else if (absp < 0.0766) // Use 10 near-singularity series terms.
-    { // Use 10 near-singularity series terms.
-      return
-        -1 +
-        p*(1 +
-          p*(q[2] +
-            p*(q[3] +
-              p*(q[4] +
-                p*(q[5] +
-                  p*(q[6] +
-                    p*(q[7] +
-                      p*(q[8] +
-                        p*(q[9] +
-                          p*q[10]
-                          )))))))));
-    }
-    else
-    { // Use all 20 near-singularity series terms.
-      return
-        -1 +
-        p*(1 +
-          p*(q[2] +
-            p*(q[3] +
-              p*(q[4] +
-                p*(q[5] +
-                  p*(q[6] +
-                    p*(q[7] +
-                      p*(q[8] +
-                        p*(q[9] +
-                          p*(q[10] +
-                            p*(q[11] +
-                              p*(q[12] +
-                                p*(q[13] +
-                                  p*(q[14] +
-                                    p*(q[15] +
-                                      p*(q[16] +
-                                        p*(q[17] +
-                                          p*(q[18] +
-                                            p*(q[19] +
-                                              p*q[20] // Last Fukushima term.
-                                               )))))))))))))))))));
-      //                                                + // more terms for more precise T: long double ...
-      //// but makes almost no difference, so don't use more terms?
-      //                                          p*q[21] +
-      //                                            p*q[22] +
-      //                                              p*q[23] +
-      //                                                p*q[24] +
-      //                                                 p*q[25]
-      //                                         )))))))))))))))))));
-    }
-  } // template T lambert_w_singularity_series(const T p)
+  if (absp < 0.01159)
+  { // Only 6 near-singularity series terms are useful.
+    return
+      -1 +
+      p * (1 +
+        p * (q[2] +
+          p * (q[3] +
+            p * (q[4] +
+              p * (q[5] +
+                p * q[6]
+                )))));
+  }
+  else if (absp < 0.0766) // Use 10 near-singularity series terms.
+  { // Use 10 near-singularity series terms.
+    return
+      -1 +
+      p * (1 +
+        p * (q[2] +
+          p * (q[3] +
+            p * (q[4] +
+              p * (q[5] +
+                p * (q[6] +
+                  p * (q[7] +
+                    p * (q[8] +
+                      p * (q[9] +
+                        p * q[10]
+                        )))))))));
+  }
+  else
+  { // Use all 20 near-singularity series terms.
+    return
+      -1 +
+      p * (1 +
+        p * (q[2] +
+          p * (q[3] +
+            p * (q[4] +
+              p * (q[5] +
+                p * (q[6] +
+                  p * (q[7] +
+                    p * (q[8] +
+                      p * (q[9] +
+                        p * (q[10] +
+                          p * (q[11] +
+                            p * (q[12] +
+                              p * (q[13] +
+                                p * (q[14] +
+                                  p * (q[15] +
+                                    p * (q[16] +
+                                      p * (q[17] +
+                                        p * (q[18] +
+                                          p * (q[19] +
+                                            p * q[20] // Last Fukushima term.
+                                            )))))))))))))))))));
+    //                                                + // more terms for more precise T: long double ...
+    //// but makes almost no difference, so don't use more terms?
+    //                                          p*q[21] +
+    //                                            p*q[22] +
+    //                                              p*q[23] +
+    //                                                p*q[24] +
+    //                                                 p*q[25]
+    //                                         )))))))))))))))))));
+  }
+} // template T lambert_w_singularity_series(const T p)
 
-  /////////////////////////////////////////////////////////////////////////////////////////////
+
+ /////////////////////////////////////////////////////////////////////////////////////////////
 
   //! \brief Series expansion used near zero (abs(z) < 0.05).
-  //! \details 
+  //! \details
   //! Coefficients of the inverted series expansion of the Lambert W function around z = 0.
   //! Tosio Fukushima always uses all 17 terms of a Taylor series computed using Wolfram with
   //!   InverseSeries[Series[z Exp[z],{z,0,17}]]
@@ -295,7 +438,7 @@ namespace math
 
   //! This version is intended to allow use by user-defined types
   //! like Boost.Multiprecision quad and cpp_dec_float types.
-  //! The three specializations below for built-in float, double 
+  //! The three specializations below for built-in float, double
   //! (and perhaps long double) will be chosen in preference for these types.
 
   //! This version uses rationals computed by Wolfram as far as possible,
@@ -321,7 +464,7 @@ namespace math
   //! It assumes that max_digits10 is defined correctly or this might fail to make the correct selection.
   //! causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.
   //! Cannot switch on @c std::numeric_limits<>::max() because comparison values may overflow the compiler limit.
-  //! Cannot switch on @c std::numeric_limits::max_exponent10() 
+  //! Cannot switch on @c std::numeric_limits::max_exponent10()
   //! because both 80 and 128 bit floating-point implmentations use 11 bits for the exponent.
   //! So must rely on @c std::numeric_limits::max_digits10.
 
@@ -333,36 +476,36 @@ namespace math
   //! but for the tag_type selection to work, they all must include Policy in their signature.
 
   // Forward declaration of variants of lambert_w0_small_z.
-  template 
-  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<0> const&);   //  for float (32-bit) type.
+template 
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<0> const&);   //  for float (32-bit) type.
 
-  template 
-  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<1> const&);   //  for double (64-bit) type.
+template 
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<1> const&);   //  for double (64-bit) type.
 
-  template 
-  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<2> const&);   //  for long double (double extended 80-bit) type.
+template 
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<2> const&);   //  for long double (double extended 80-bit) type.
 
-  template 
-  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&);   //  for float128
+template 
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&);   //  for float128
 
-  template 
-  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&);   //  Generic multiprecision T.
+template 
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&);   //  Generic multiprecision T.
 
-  // Set tag_type depending on max_digits10.
-  template 
-  T lambert_w0_small_z(T x, const Policy& pol)
-  {
-    typedef boost::mpl::int_
-      <
-      std::numeric_limits::max_digits10 <= 9 ? 0 :  //  for float
-      std::numeric_limits::max_digits10 <= 17 ? 1 : //  for double 64-bit
-      std::numeric_limits::max_digits10 <= 22 ? 2 :  //  for  80-bit double extended
-      std::numeric_limits::max_digits10 < 37 ? 3 : //  for float128  128-bit quad
-      4 // Generic multiprecision types.
-      > tag_type;
-    // std::cout << "tag type = " << tag_type << std::endl; // error C2275: 'tag_type': illegal use of this type as an expression
-    return lambert_w0_small_z(x, pol, tag_type());
-  } // template  T lambert_w0_small_z(T x)
+                                                                        // Set tag_type depending on max_digits10.
+template 
+T lambert_w0_small_z(T x, const Policy& pol)
+{
+  typedef boost::mpl::int_
+    <
+    std::numeric_limits::max_digits10 <= 9 ? 0 :  //  for float
+    std::numeric_limits::max_digits10 <= 17 ? 1 : //  for double 64-bit
+    std::numeric_limits::max_digits10 <= 22 ? 2 :  //  for  80-bit double extended
+    std::numeric_limits::max_digits10 < 37 ? 3 : //  for float128  128-bit quad
+    4 // Generic multiprecision types.
+    > tag_type;
+  // std::cout << "tag type = " << tag_type << std::endl; // error C2275: 'tag_type': illegal use of this type as an expression
+  return lambert_w0_small_z(x, pol, tag_type());
+} // template  T lambert_w0_small_z(T x)
 
   //! Specialization of float (32-bit) series expansion used for small z (abs(z) < 0.05).
   // Only 9 Coefficients are computed to 21 decimal digits precision, ample for 32-bit float used by most platforms.
@@ -370,1134 +513,1253 @@ namespace math
   // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
   // as proposed by Tosio Fukushima and implemented by Darko Veberic.
 
-  template 
-  T lambert_w0_small_z(T z, const Policy&, boost::mpl::int_<0> const&)
-  {
+template 
+T lambert_w0_small_z(T z, const Policy&, boost::mpl::int_<0> const&)
+{
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    std::cout << "float lambert_w0_small_z called with z = " << z << " using " << 9 << " terms of precision "
-      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+  std::cout << "float lambert_w0_small_z called with z = " << z << " using " << 9 << " terms of precision "
+    << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    return
-      z*(1 - // j1 z^1 term = 1
-        z*(1 -  // j2 z^2 term = -1
-          z*(static_cast(3uLL) / 2uLL - // 3/2 // j3 z^3 term = 1.5.
-            z*(2.6666666666666666667F -  // 8/3 // j4
-              z*(5.2083333333333333333F - // -125/24 // j5
-                z*(10.8F - // j6
-                  z*(23.343055555555555556F - // j7
-                    z*(52.012698412698412698F - // j8
-                      z*118.62522321428571429F)))))))); // j9
-  } // template    T lambert_w0_small_z(T x, mpl::int_<0> const&)
+  return
+    z * (1 - // j1 z^1 term = 1
+      z * (1 -  // j2 z^2 term = -1
+        z * (static_cast(3uLL) / 2uLL - // 3/2 // j3 z^3 term = 1.5.
+          z * (2.6666666666666666667F -  // 8/3 // j4
+            z * (5.2083333333333333333F - // -125/24 // j5
+              z * (10.8F - // j6
+                z * (23.343055555555555556F - // j7
+                  z * (52.012698412698412698F - // j8
+                    z * 118.62522321428571429F)))))))); // j9
+} // template    T lambert_w0_small_z(T x, mpl::int_<0> const&)
 
-    //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
-    // 17 Coefficients are computed to 21 decimal digits precision suitable for 64-bit double used by most platforms.
-    // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
-    // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], as proposed by Tosio Fukushima and implemented by Veberic.
+  //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
+  // 17 Coefficients are computed to 21 decimal digits precision suitable for 64-bit double used by most platforms.
+  // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
+  // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], as proposed by Tosio Fukushima and implemented by Veberic.
 
-  template 
-  T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<1> const&)
-  {
+template 
+T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<1> const&)
+{
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    std::cout << "double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision, "
-      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+  std::cout << "double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision, "
+    << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    T  result =
-      z*(1. - // j1 z^1
-        z*(1. -  // j2 z^2
-          z*(1.5 - // 3/2 // j3 z^3
-            z*(2.6666666666666666667 -  // 8/3 // j4
-              z*(5.2083333333333333333 - // -125/24 // j5
-                z*(10.8 - // j6
-                  z*(23.343055555555555556 - // j7
-                    z*(52.012698412698412698 - // j8
-                      z*(118.62522321428571429 - // j9
-                        z*(275.57319223985890653 - // j10
-                          z*(649.78717234347442681 - // j11
-                            z*(1551.1605194805194805 - // j12
-                              z*(3741.4497029592385495 - // j13
-                                z*(9104.5002411580189358 - // j14
-                                  z*(22324.308512706601434 - // j15
-                                    z*(55103.621972903835338 - // j16
-                                      z*136808.86090394293563)))))))))))))))); // j17 z^17
-    return result;
-  }  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+  T  result =
+    z * (1. - // j1 z^1
+      z * (1. -  // j2 z^2
+        z * (1.5 - // 3/2 // j3 z^3
+          z * (2.6666666666666666667 -  // 8/3 // j4
+            z * (5.2083333333333333333 - // -125/24 // j5
+              z * (10.8 - // j6
+                z * (23.343055555555555556 - // j7
+                  z * (52.012698412698412698 - // j8
+                    z * (118.62522321428571429 - // j9
+                      z * (275.57319223985890653 - // j10
+                        z * (649.78717234347442681 - // j11
+                          z * (1551.1605194805194805 - // j12
+                            z * (3741.4497029592385495 - // j13
+                              z * (9104.5002411580189358 - // j14
+                                z * (22324.308512706601434 - // j15
+                                  z * (55103.621972903835338 - // j16
+                                    z * 136808.86090394293563)))))))))))))))); // j17 z^17
+  return result;
+}  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
 
-     //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
-     // 21 Coefficients are computed to 21 decimal digits precision suitable for 80-bit long double used by some
-     // platforms including GCC and Clang when generating for Intel X86 floating-point processors with 80-bit operations enabled (the default).
-     // (This is NOT used by Microsoft Visual Studio where double and long always both use only 64-bit type.)
-  template 
-  T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<2> const&)
-  {
+   //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
+   // 21 Coefficients are computed to 21 decimal digits precision suitable for 80-bit long double used by some
+   // platforms including GCC and Clang when generating for Intel X86 floating-point processors with 80-bit operations enabled (the default).
+   // (This is NOT used by Microsoft Visual Studio where double and long always both use only 64-bit type.)
+template 
+T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<2> const&)
+{
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    std::cout << "long double (80-bit double extended) lambert_w0_small_z called with z = " << z << " using " << 21 << " terms of precision "
-      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+  std::cout << "long double (80-bit double extended) lambert_w0_small_z called with z = " << z << " using " << 21 << " terms of precision "
+    << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    T  result =
-      z*(1.L - // j1 z^1
-        z*(1.L -  // j2 z^2
-          z*(1.5L - // 3/2 // j3
-            z*(2.6666666666666666667L -  // 8/3 // j4
-              z*(5.2083333333333333333L - // -125/24 // j5
-                z*(10.800000000000000000L - // j6
-                  z*(23.343055555555555556L - // j7
-                    z*(52.012698412698412698L - // j8
-                      z*(118.62522321428571429L - // j9
-                        z*(275.57319223985890653L - // j10
-                          z*(649.78717234347442681L - // j11
-                            z*(1551.1605194805194805L - // j12
-                              z*(3741.4497029592385495L - // j13
-                                z*(9104.5002411580189358L - // j14
-                                  z*(22324.308512706601434L - // j15
-                                    z*(55103.621972903835338L - // j16
-                                      z*(136808.86090394293563L - // j17 z^17  last term used by Fukushima double.
-                                        z*(341422.050665838363317L - // z^18
-                                          z*(855992.9659966075514633L - // z^19
-                                            z*(2.154990206091088289321e6L - // z^20
-                                              z*5.4455529223144624316423e6L   // z^21
-                                              ))))))))))))))))))));
+  T  result =
+    z * (1.L - // j1 z^1
+      z * (1.L -  // j2 z^2
+        z * (1.5L - // 3/2 // j3
+          z * (2.6666666666666666667L -  // 8/3 // j4
+            z * (5.2083333333333333333L - // -125/24 // j5
+              z * (10.800000000000000000L - // j6
+                z * (23.343055555555555556L - // j7
+                  z * (52.012698412698412698L - // j8
+                    z * (118.62522321428571429L - // j9
+                      z * (275.57319223985890653L - // j10
+                        z * (649.78717234347442681L - // j11
+                          z * (1551.1605194805194805L - // j12
+                            z * (3741.4497029592385495L - // j13
+                              z * (9104.5002411580189358L - // j14
+                                z * (22324.308512706601434L - // j15
+                                  z * (55103.621972903835338L - // j16
+                                    z * (136808.86090394293563L - // j17 z^17  last term used by Fukushima double.
+                                      z * (341422.050665838363317L - // z^18
+                                        z * (855992.9659966075514633L - // z^19
+                                          z * (2.154990206091088289321e6L - // z^20
+                                            z * 5.4455529223144624316423e6L   // z^21
+                                            ))))))))))))))))))));
 
-    return result;
-  }  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+  return result;
+}  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
 
-    //! Specialization of long double (128-bit quad) series expansion used for small z (abs(z) < 0.05).
-    // 34 Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
-    // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
-    // and are suffixed by L as they are assumed of type long double.
-    // (This is NOT used for 128-bit quad which required a suffix Q
-    // nor multiprecision type cpp_bin_float_quad that can only be initialised at full precision of the type
-    // using a decimal digit string like "2.6666666666666666666666666666666666666666666666667".)
+   //! Specialization of long double (128-bit quad) series expansion used for small z (abs(z) < 0.05).
+   // 34 Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
+   // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
+   // and are suffixed by L as they are assumed of type long double.
+   // (This is NOT used for 128-bit quad which required a suffix Q
+   // nor multiprecision type cpp_bin_float_quad that can only be initialised at full precision of the type
+   // using a decimal digit string like "2.6666666666666666666666666666666666666666666666667".)
 
-  template 
-  T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&)
-  {
+template 
+T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&)
+{
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    std::cout << "long double (128-bit quad) lambert_w0_small_z called with z = " << z << " using " << 34 << " terms of precision "
-      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+  std::cout << "long double (128-bit quad) lambert_w0_small_z called with z = " << z << " using " << 34 << " terms of precision "
+    << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    T  result =
-      z*(1.L - // j1
-        z*(1.L -  // j2
-          z*(1.5L - // 3/2 // j3
-            z*(2.6666666666666666666666666666666666L -  // 8/3 // j4
-              z*(5.2052083333333333333333333333333333L - // -125/24 // j5
-                z*(-10.800000000000000000000000000000000L - // j6
-                  z*(23.343055555555555555555555555555555L - // j7
-                    z*(52.0126984126984126984126984126984126L - // j8
-                      z*(118.625223214285714285714285714285714L - // j9
-                        z*(275.57319223985890652557319223985890L - // * z ^ 10 - // j10
-                          z*(649.78717234347442680776014109347442680776014109347L - // j11
-                            z*(1551.1605194805194805194805194805194805194805194805L - // j12
-                              z*(3741.4497029592385495163272941050718828496606274384L - // j13
-                                z*(9104.5002411580189357967135744913522691300469078247L - // j14
-                                  z*(22324.308512706601434280005708577137148565719994291L - // j15
-                                    z*(55103.621972903835337697771560205422639285073147507L - // j16
-                                      z*136808.86090394293563342215789305736395683485630576L)))))))))))))))); // j17
-    return result;
-  }  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+  T  result =
+    z * (1.L - // j1
+      z * (1.L -  // j2
+        z * (1.5L - // 3/2 // j3
+          z * (2.6666666666666666666666666666666666L -  // 8/3 // j4
+            z * (5.2052083333333333333333333333333333L - // -125/24 // j5
+              z * (-10.800000000000000000000000000000000L - // j6
+                z * (23.343055555555555555555555555555555L - // j7
+                  z * (52.0126984126984126984126984126984126L - // j8
+                    z * (118.625223214285714285714285714285714L - // j9
+                      z * (275.57319223985890652557319223985890L - // * z ^ 10 - // j10
+                        z * (649.78717234347442680776014109347442680776014109347L - // j11
+                          z * (1551.1605194805194805194805194805194805194805194805L - // j12
+                            z * (3741.4497029592385495163272941050718828496606274384L - // j13
+                              z * (9104.5002411580189357967135744913522691300469078247L - // j14
+                                z * (22324.308512706601434280005708577137148565719994291L - // j15
+                                  z * (55103.621972903835337697771560205422639285073147507L - // j16
+                                    z * 136808.86090394293563342215789305736395683485630576L)))))))))))))))); // j17
+  return result;
+}  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
 
-  //! Series functor to compute series term using pow and factorial.
-  //! \details Functor is called after evaluating polynomial with the coefficients as rationals below.
-  template 
-  struct lambert_w0_small_z_series_term
-  {
-    typedef T result_type;
-    //! \param _z Lambert W argument z.
-    //! \param -term  -pow<18>(z) / 6402373705728000uLL
-    //! \param _k number of terms == initially 18
+   //! Series functor to compute series term using pow and factorial.
+   //! \details Functor is called after evaluating polynomial with the coefficients as rationals below.
+template 
+struct lambert_w0_small_z_series_term
+{
+  typedef T result_type;
+  //! \param _z Lambert W argument z.
+  //! \param -term  -pow<18>(z) / 6402373705728000uLL
+  //! \param _k number of terms == initially 18
 
-    //  Note *after* evaluating N terms, its internal state has k = N and term = (-1)^N z^N.
+  //  Note *after* evaluating N terms, its internal state has k = N and term = (-1)^N z^N.
 
-    lambert_w0_small_z_series_term(T _z, T _term, int _k)
-      : k(_k), z(_z), term(_term) { }
+  lambert_w0_small_z_series_term(T _z, T _term, int _k)
+    : k(_k), z(_z), term(_term) { }
 
-    T operator()()
-    { // Called by sum_series until needs precision set by factor (policy::get_epsilon).
-      using std::pow;
-      ++k;
-      term *= -z / k;
-      //T t = pow(z, k) * pow(T(k), -1 + k) / factorial(k); // (z^k * k(k-1)^k) / k!
-      T result = term * pow(T(k), -1 + k); // term * k^(k-1)
-                                           // std::cout << " k = " << k << ", term = " << term << ", result = " << result << std::endl;
-      return result; //
-    }
-  private:
-    int k;
-    T z;
-    T term;
-  }; // template  struct lambert_w0_small_z_series_term
+  T operator()()
+  { // Called by sum_series until needs precision set by factor (policy::get_epsilon).
+    using std::pow;
+    ++k;
+    term *= -z / k;
+    //T t = pow(z, k) * pow(T(k), -1 + k) / factorial(k); // (z^k * k(k-1)^k) / k!
+    T result = term * pow(T(k), -1 + k); // term * k^(k-1)
+                                         // std::cout << " k = " << k << ", term = " << term << ", result = " << result << std::endl;
+    return result; //
+  }
+private:
+  int k;
+  T z;
+  T term;
+}; // template  struct lambert_w0_small_z_series_term
 
-  //! Generic variant for T a User-defined types like Boost.Multiprecision.
-  template 
-  inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&)
-  {
+   //! Generic variant for T a User-defined types like Boost.Multiprecision.
+template 
+inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&)
+{
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    std::cout << "Generic lambert_w0_small_z called with z = " << z << " using as many terms needed for precision." << std::endl;
-    std::cout << "Argument z is of type " << typeid(T).name() << std::endl;
+  std::cout << "Generic lambert_w0_small_z called with z = " << z << " using as many terms needed for precision." << std::endl;
+  std::cout << "Argument z is of type " << typeid(T).name() << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
 
-    // First several terms of the series are tabulated and evaluated as a polynomial:
-    // this will save us a bunch of expensive calls to pow.
-    // Then our series functor is initialized "as if" it had already reached term 18,
-    // enough evaluation of built-in 64-bit double and float (and 80-bit long double?) types.
+  // First several terms of the series are tabulated and evaluated as a polynomial:
+  // this will save us a bunch of expensive calls to pow.
+  // Then our series functor is initialized "as if" it had already reached term 18,
+  // enough evaluation of built-in 64-bit double and float (and 80-bit long double?) types.
 
-    // Coefficients should be stored such that the coefficients for the x^i terms are in poly[i].
-    static const T coeff[] =
-    {
-      0, // z^0  Care: zeroth term needed by tools::evaluate_polynomial, but not in the Wolfram equation, so indexes are one different!
-      1, // z^1 term.
-      -1, // z^2 term
-      static_cast(3uLL) / 2uLL, // z^3 term.
-      -static_cast(8uLL) / 3uLL, // z^4
-      static_cast(125uLL) / 24uLL, // z^5
-      -static_cast(54uLL) / 5uLL, // z^6
-      static_cast(16807uLL) / 720uLL, // z^7
-      -static_cast(16384uLL) / 315uLL, // z^8
-      static_cast(531441uLL) / 4480uLL, // z^9
-      -static_cast(156250uLL) / 567uLL, // z^10
-      static_cast(2357947691uLL) / 3628800uLL, // z^11
-      -static_cast(2985984uLL) / 1925uLL, // z^12
-      static_cast(1792160394037uLL) / 479001600uLL, // z^13
-      -static_cast(7909306972uLL) / 868725uLL, // z^14
-      static_cast(320361328125uLL) / 14350336uLL, // z^15
-      -static_cast(35184372088832uLL) / 638512875uLL, // z^16
-      static_cast(2862423051509815793uLL) / 20922789888000uLL, // z^17 term
-      -static_cast(5083731656658uLL) / 14889875uLL,
-      // z^18 term. = 136808.86090394293563342215789305735851647769682393
+  // Coefficients should be stored such that the coefficients for the x^i terms are in poly[i].
+  static const T coeff[] =
+  {
+    0, // z^0  Care: zeroth term needed by tools::evaluate_polynomial, but not in the Wolfram equation, so indexes are one different!
+    1, // z^1 term.
+    -1, // z^2 term
+    static_cast(3uLL) / 2uLL, // z^3 term.
+    -static_cast(8uLL) / 3uLL, // z^4
+    static_cast(125uLL) / 24uLL, // z^5
+    -static_cast(54uLL) / 5uLL, // z^6
+    static_cast(16807uLL) / 720uLL, // z^7
+    -static_cast(16384uLL) / 315uLL, // z^8
+    static_cast(531441uLL) / 4480uLL, // z^9
+    -static_cast(156250uLL) / 567uLL, // z^10
+    static_cast(2357947691uLL) / 3628800uLL, // z^11
+    -static_cast(2985984uLL) / 1925uLL, // z^12
+    static_cast(1792160394037uLL) / 479001600uLL, // z^13
+    -static_cast(7909306972uLL) / 868725uLL, // z^14
+    static_cast(320361328125uLL) / 14350336uLL, // z^15
+    -static_cast(35184372088832uLL) / 638512875uLL, // z^16
+    static_cast(2862423051509815793uLL) / 20922789888000uLL, // z^17 term
+    -static_cast(5083731656658uLL) / 14889875uLL,
+    // z^18 term. = 136808.86090394293563342215789305735851647769682393
 
-      // z^18 is biggest that can be computed as rational using the largest possible uLL integers,
-      // so higher terms cannot be potentially compiler-computed as uLL rationals.
-      // Wolfram (5083731656658 z ^ 18) / 14889875 or
-      // -341422.05066583836331735491399356945575432970390954 z^18
+    // z^18 is biggest that can be computed as rational using the largest possible uLL integers,
+    // so higher terms cannot be potentially compiler-computed as uLL rationals.
+    // Wolfram (5083731656658 z ^ 18) / 14889875 or
+    // -341422.05066583836331735491399356945575432970390954 z^18
 
-      // See note below calling the functor to compute another term,
-      // sufficient for 80-bit long double precision.
-      // Wolfram -341422.05066583836331735491399356945575432970390954 z^19 term.
-      // (5480386857784802185939 z^19)/6402373705728000
-      // But now this variant is not used to compute long double
-      // as specializations are provided above.
-    }; // static const T coeff[]
+    // See note below calling the functor to compute another term,
+    // sufficient for 80-bit long double precision.
+    // Wolfram -341422.05066583836331735491399356945575432970390954 z^19 term.
+    // (5480386857784802185939 z^19)/6402373705728000
+    // But now this variant is not used to compute long double
+    // as specializations are provided above.
+  }; // static const T coeff[]
 
-       /*
-       Table of 19 computed coefficients:
+     /*
+     Table of 19 computed coefficients:
 
-       #0 0
-       #1 1
-       #2 -1
-       #3 1.5
-       #4 -2.6666666666666666666666666666666665382713370408509
-       #5 5.2083333333333333333333333333333330765426740817019
-       #6 -10.800000000000000000000000000000000616297582203915
-       #7 23.343055555555555555555555555555555076212991619177
-       #8 -52.012698412698412698412698412698412659282693193402
-       #9 118.62522321428571428571428571428571146835390992496
-       #10 -275.57319223985890652557319223985891400375196748314
-       #11 649.7871723434744268077601410934743969785223845882
-       #12 -1551.1605194805194805194805194805194947599566007429
-       #13 3741.4497029592385495163272941050719510009019331763
-       #14 -9104.5002411580189357967135744913524243896052869184
-       #15 22324.308512706601434280005708577137322392070452582
-       #16 -55103.621972903835337697771560205423203318720697224
-       #17 136808.86090394293563342215789305735851647769682393
-       136808.86090394293563342215789305735851647769682393   == Exactly same as Wolfram computed value.
-       #18 -341422.05066583836331735491399356947486381600607416
-       341422.05066583836331735491399356945575432970390954  z^19  Wolfram value differs at 36 decimal digit, as expected.
-       */
+     #0 0
+     #1 1
+     #2 -1
+     #3 1.5
+     #4 -2.6666666666666666666666666666666665382713370408509
+     #5 5.2083333333333333333333333333333330765426740817019
+     #6 -10.800000000000000000000000000000000616297582203915
+     #7 23.343055555555555555555555555555555076212991619177
+     #8 -52.012698412698412698412698412698412659282693193402
+     #9 118.62522321428571428571428571428571146835390992496
+     #10 -275.57319223985890652557319223985891400375196748314
+     #11 649.7871723434744268077601410934743969785223845882
+     #12 -1551.1605194805194805194805194805194947599566007429
+     #13 3741.4497029592385495163272941050719510009019331763
+     #14 -9104.5002411580189357967135744913524243896052869184
+     #15 22324.308512706601434280005708577137322392070452582
+     #16 -55103.621972903835337697771560205423203318720697224
+     #17 136808.86090394293563342215789305735851647769682393
+     136808.86090394293563342215789305735851647769682393   == Exactly same as Wolfram computed value.
+     #18 -341422.05066583836331735491399356947486381600607416
+     341422.05066583836331735491399356945575432970390954  z^19  Wolfram value differs at 36 decimal digit, as expected.
+     */
 
-    using boost::math::policies::get_epsilon; // for type T.
-    using boost::math::tools::sum_series;
-    using boost::math::tools::evaluate_polynomial;
-    // http://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/roots/rational.html
+  using boost::math::policies::get_epsilon; // for type T.
+  using boost::math::tools::sum_series;
+  using boost::math::tools::evaluate_polynomial;
+  // http://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/roots/rational.html
 
-    // std::streamsize prec = std::cout.precision(std::numeric_limits ::max_digits10);
+  // std::streamsize prec = std::cout.precision(std::numeric_limits ::max_digits10);
 
-    T result = evaluate_polynomial(coeff, z);
-    //  template 
-    //  V evaluate_polynomial(const T(&poly)[N], const V& val);
-    // Size of coeff found from N
-    //std::cout << "evaluate_polynomial(coeff, z); == " << result << std::endl;
-    //std::cout << "result = " << result << std::endl;
-    // It's an artefact of the way I wrote the functor: *after* evaluating N
-    // terms, its internal state has k = N and term = (-1)^N z^N.  So after
-    // evaluating 18 terms, we initialize the functor to the term we've just
-    // evaluated, and then when it's called, it increments itself to the next term.
-    // So 18!is 6402373705728000, which is where that comes from.
+  T result = evaluate_polynomial(coeff, z);
+  //  template 
+  //  V evaluate_polynomial(const T(&poly)[N], const V& val);
+  // Size of coeff found from N
+  //std::cout << "evaluate_polynomial(coeff, z); == " << result << std::endl;
+  //std::cout << "result = " << result << std::endl;
+  // It's an artefact of the way I wrote the functor: *after* evaluating N
+  // terms, its internal state has k = N and term = (-1)^N z^N.  So after
+  // evaluating 18 terms, we initialize the functor to the term we've just
+  // evaluated, and then when it's called, it increments itself to the next term.
+  // So 18!is 6402373705728000, which is where that comes from.
 
-    // The 19th coefficient of the polynomial is actually, 19 ^ 18 / 19!=
-    // 104127350297911241532841 / 121645100408832000 which after removing GCDs
-    // reduces down to Wolfram rational 5480386857784802185939 / 6402373705728000.
-    // Wolfram z^19 term +(5480386857784802185939 z^19) /6402373705728000
-    // +855992.96599660755146336302506332246623424823099755 z^19
+  // The 19th coefficient of the polynomial is actually, 19 ^ 18 / 19!=
+  // 104127350297911241532841 / 121645100408832000 which after removing GCDs
+  // reduces down to Wolfram rational 5480386857784802185939 / 6402373705728000.
+  // Wolfram z^19 term +(5480386857784802185939 z^19) /6402373705728000
+  // +855992.96599660755146336302506332246623424823099755 z^19
 
-    //! Evaluate Functor.
-    lambert_w0_small_z_series_term s(z, -pow<18>(z) / 6402373705728000uLL, 18);
+  //! Evaluate Functor.
+  lambert_w0_small_z_series_term s(z, -pow<18>(z) / 6402373705728000uLL, 18);
 
-    // Temporary to list the coefficients.
-    //std::cout << " Table of coefficients" << std::endl;
-    //std::streamsize saved_precision = std::cout.precision(50);
-    //for (size_t i = 0; i != 19; i++)
-    //{
-    //  std::cout << "#" << i << " " << coeff[i] << std::endl;
-    //}
-    //std::cout.precision(saved_precision);
+  // Temporary to list the coefficients.
+  //std::cout << " Table of coefficients" << std::endl;
+  //std::streamsize saved_precision = std::cout.precision(50);
+  //for (size_t i = 0; i != 19; i++)
+  //{
+  //  std::cout << "#" << i << " " << coeff[i] << std::endl;
+  //}
+  //std::cout.precision(saved_precision);
 
-    boost::uintmax_t max_iter = policies::get_max_series_iterations(); // Max iterations from policy.
-  #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-    std::cout << "max iter from policy = " << max_iter << std::endl;
-    // //   max iter from policy = 1000000 is default.
-  #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  boost::uintmax_t max_iter = policies::get_max_series_iterations(); // Max iterations from policy.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::cout << "max iter from policy = " << max_iter << std::endl;
+  // //   max iter from policy = 1000000 is default.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
 
-    result = sum_series(s, get_epsilon(), max_iter, result);
-    // result == evaluate_polynomial.
-    //sum_series(Functor& func, int bits, boost::uintmax_t& max_terms, const U& init_value)
-    // std::cout << "sum_series(s, get_epsilon(), max_iter, result); = " << result << std::endl;
+  result = sum_series(s, get_epsilon(), max_iter, result);
+  // result == evaluate_polynomial.
+  //sum_series(Functor& func, int bits, boost::uintmax_t& max_terms, const U& init_value)
+  // std::cout << "sum_series(s, get_epsilon(), max_iter, result); = " << result << std::endl;
 
-    //T epsilon = get_epsilon();
-    //std::cout << "epilson from policy = " << epsilon << std::endl;
-    // epilson from policy = 1.93e-34 for T == quad
-    //  5.35e-51 for t = cpp_bin_float_50
+  //T epsilon = get_epsilon();
+  //std::cout << "epilson from policy = " << epsilon << std::endl;
+  // epilson from policy = 1.93e-34 for T == quad
+  //  5.35e-51 for t = cpp_bin_float_50
 
-    // std::cout << " get eps = " << get_epsilon() << std::endl; // quad eps = 1.93e-34, bin_float_50 eps = 5.35e-51
-    policies::check_series_iterations("boost::math::lambert_w0_small_z<%1%>(%1%)", max_iter, pol);
+  // std::cout << " get eps = " << get_epsilon() << std::endl; // quad eps = 1.93e-34, bin_float_50 eps = 5.35e-51
+  policies::check_series_iterations("boost::math::lambert_w0_small_z<%1%>(%1%)", max_iter, pol);
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS
-    std::cout << "z = " << z << " needed  " << max_iter << " iterations." << std::endl;
+  std::cout << "z = " << z << " needed  " << max_iter << " iterations." << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS
-    //std::cout.precision(prec); // Restore.
-    return result;
-  } // template  inline T lambert_w0_small_z_series(T z, const Policy& pol)
+  //std::cout.precision(prec); // Restore.
+  return result;
+} // template  inline T lambert_w0_small_z_series(T z, const Policy& pol)
 
-  /////////////////////////////////////////////////////////////////////////////
+  //////////////////////////////////////////////////////////////////////////////////////////
 
-  // Halley refinement, if required, for precision in policy.
-  // Only perform this if the most precise value possible (usually within one epsilon) is desired.
-  // The previous Fukushima Schroeder refinement usually gives within several epsilon.
-  // Halley refinement needs to perform some evaluations of the exp function, and
-  // may nearly double the execution time.
-  // However Boost.Math prioritizes accuracy over speed,
-  // so this extra step is taken by the default policy.
+//! \brief Lambert_w0 implementations for float, double and higher precisions.
+//! 3rd parameter used to select which version is used.
 
-  // Two versions:
-  //  do_while always makes one iteration before testing against a tolerance,
-  //  while_do does a test first, perhaps avoiding an iteration if already within tolerance.
+//! /details Rational polynomials are provided for several range of argument z.
+//! For very small values of z, and for z very near the branch singularity at -e^-1 (~= -0.367879),
+//! two other series functions are used.
 
-  template
-  inline
-  T halley_update(T w0, const T z, const Policy&)
-  {
-    // Only if necessary, iterate a few times to refine estimate using Halley's method.
-    // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate
-    // since we can simplify the expressions algebraically,
-    // and don't need most of the error checking of the boilerplate version
-    // as we know in advance that the function is reasonably well-behaved,
-    // (and in any case the derivatives require evaluation of Lambert W!).
+//! float precision polynomials are used for 32-bit (usually float) precision (for speed)
+//! double precision polynomials are used for 64-bit (usually double) precision.
+//! For higher precisions, a 64-bit double approximation is computed first,
+//! and then refined using Halley interations.
 
-    //! So also do-while version.
+// Forward declarations:
 
-    BOOST_MATH_STD_USING // Aid argument dependent (ADL) lookup of abs.
+//template  T lambert_w0_small_z(T z, const Policy& pol);
+//
+//template 
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<0>&);
+//template 
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<1>&);
+//template 
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&);
 
-    using boost::math::constants::exp_minus_one; // 0.36787944
-    using boost::math::tools::max_value;
+//! Lambert_w0 @b 'float' implementation, selected when T is 32-bit precision.
+template 
+inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
+{
+   static const char* function = "boost::math::lambert_w0<%1%>"; // For error messages.
+   BOOST_MATH_STD_USING // Aid ADL of std functions.
 
-    int iterations = 0;
-   // int iterations_required = 6; // 
-    int max_iterations = 20; // Only as a check on looping.
+	 if ((boost::math::isnan)(z))
+	 {
+		 return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%", z, pol);
+	 }
 
-    T tolerance = boost::math::policies::get_epsilon();
-    T previous_diff = boost::math::tools::max_value();
-    T w1 = w0; // Refined estimate.
-    T expw0 = exp(w0); // Compute z == W * exp(W); from best Lambert W estimate so far.
-    // Hope that  w0 * expw0 == z;
-    T diff = (w0 * expw0) - z; // Difference from argument z.
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-    std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10);  // Save.
-    std::cout.precision(std::numeric_limits::max_digits10); // Show all posssibly significant digits.
-    std::ios::fmtflags flags(std::cout.flags()); // Save.
-    std::cout.setf(std::ios_base::showpoint); // Include any trailing zeros.
-    std::cout << "w = " << w0 << ", z = " << z << ", w * exp(w) = " << w0 * expw0 << ", diff = " << diff << std::endl;
-    if (diff == 0)
-    {
-      std::cout << "Exact, so no Halley refinement from " << w0 << std::endl;
-    }
-    else if(abs(diff) <= tolerance)
-    {
-      std::cout << "Within tolerance, so no Halley refinement from " << w0 << std::endl;
-    }
-    std::cout.precision(precision); // Restore.
-    std::cout.flags(flags);
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-    if (diff == 0)  // Exact result - common.
-    {
-      return w0;
-    }
-    // relative does NOT work well, so check for improvement in diff instead.
-    //else if ((abs(diff) / w0) <= tolerance) 
-    //{
-    //  return w0;
-    //}
-    // else Refine.
-    do
-    {
-      iterations++;
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-      std::cout << "Halley iteration #" << iterations << "."<< std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-      previous_diff = diff; // Remember so that can check if any new estimate is better.
-
-      // Halley's method from Luu equation 6.39, line 17.
-      // https://en.wikipedia.org/wiki/Halley%27s_method
-      // http://www.wolframalpha.com/input/?i=differentiate+productlog(x)
-      // differentiate productlog(x)  d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w)
-      // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2)
-      // f'(w) = e^w (1 + w)
-      // f''(w) = e^w (2 + w) ,
-      // f''(w)/f'(w) = (2+w) / (1+w),  Luu equation 6.38.
-
-      w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39.
-        - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2)));
-      diff = (w1 * exp(w1)) - z;
-
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-      T dis = boost::math::float_distance(w0, w1);
-      std::cout << "w = " << w0 << ", z = " << z << ", w * exp(w) = " << w0 * expw0 << ", diff = " << diff << std::endl;
-      int d = static_cast(dis);
-      if (abs(dis) < 2147483647)
+   if (z >= 0.05)
+   { // Normal ranges using several rational polynomials.
+      if (z < 2)
       {
-        std::cout << "float_distance = " << d << std::endl;
+         if (z < 0.5)
+         { // 0.05 < z < 0.5
+            // Maximum Deviation Found:                     2.993e-08
+            // Expected Error Term : 2.993e-08
+            // Maximum Relative Change in Control Points : 7.555e-04 Y offset : -8.196592331e-01
+            static const T Y = 8.196592331e-01f;
+            static const T P[] = {
+               1.803388345e-01f,
+               -4.820256838e-01f,
+               -1.068349741e+00f,
+               -3.506624319e-02f,
+            };
+            static const T Q[] = {
+               1.000000000e+00f,
+               2.871703469e+00f,
+               1.690949264e+00f,
+            };
+            return z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z));
+         }
+         else
+         { // 0.5 < z < 2
+            // Max error in interpolated form: 1.018e-08
+            static const T Y = 5.503368378e-01f;
+            static const T P[] = {
+               4.493332766e-01f,
+               2.543432707e-01f,
+               -4.808788799e-01f,
+               -1.244425316e-01f,
+            };
+            static const T Q[] = {
+               1.000000000e+00f,
+               2.780661241e+00f,
+               1.830840318e+00f,
+               2.407221031e-01f,
+            };
+            return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+         }
       }
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-
-      if (diff == 0) // Exact.
+      else if (z < 6)
       {
-        return w1; // Exact, or no improvement, so as good as it can be.
+         // 2 < z < 6
+         // Max error in interpolated form: 2.944e-08
+         static const T Y = 1.162393570e+00f;
+         static const T P[] = {
+            -1.144183394e+00f,
+            -4.712732855e-01f,
+            1.563162512e-01f,
+            1.434010911e-02f,
+         };
+         static const T Q[] = {
+            1.000000000e+00f,
+            1.192626340e+00f,
+            2.295580708e-01f,
+            5.477869455e-03f,
+         };
+         return Y + boost::math::tools::evaluate_rational(P, Q, z);
       }
-      if (abs(diff) >= abs(previous_diff)) // Latest estimate is not better, or worse, so avoid oscillating result (common when near singularity).
+      else if (z < 18)
       {
-        return w1;  // Or mean (w0 + w1)/2 ??
+         // 6 < z < 18
+         // Max error in interpolated form: 5.893e-08
+         static const T Y = 1.809371948e+00f;
+         static const T P[] = {
+            -1.689291769e+00f,
+            -3.337812742e-01f,
+            3.151434873e-02f,
+            1.134178734e-03f,
+         };
+         static const T Q[] = {
+            1.000000000e+00f,
+            5.716915685e-01f,
+            4.489521292e-02f,
+            4.076716763e-04f,
+         };
+         return Y + boost::math::tools::evaluate_rational(P, Q, z);
       }
-      if (fabs((w0 / w1) - static_cast(1)) < tolerance)
-      { // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few).
-        return w1; // Or mean (w0 + w1)/2 ??
-      }
-      w0 = w1;
-      expw0 = exp(w0);
-    }
-   // while ((iterations < iterations_required) || (iterations <= max_iterations)); // Absolute limit during testing - is looping if need this.
-    while (iterations <= max_iterations); // Absolute limit during testing - is looping if need this.
-
-    return w1;
-  } // T halley_update(T w0, const T z)
-
-
-  //! Halley update version that does one update without a check, 
-  //! and then more updates as necessary.
-  // TODO Might use a template parameter to avoid duplication?
-  template
-  inline
-  T halley_update_do_while(T w0, const T z)
-  {
-    BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
-
-    using boost::math::constants::exp_minus_one; // 0.36787944
-    using boost::math::tools::max_value;
-    T tolerance = std::numeric_limits::epsilon();
-    int iterations = 0;
-    int min_iterations = 1; // Specify a minimum number of iterations to perform.
-    int max_iterations = 6; // Should not be needed, but include to avoid risk of looping forever.
-    // (Might be necessary to increase this?)
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-    std::cout << "At least = " << min_iterations << " Halley iterations." << std::endl;
-    std::cout << "(But not more than " << max_iterations << " Halley iterations.)" << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-
-    T w1; // Refined estimate.
-    T previous_diff = boost::math::tools::max_value();
-    do
-    { // Iterate a few times to refine value using Halley's method.
-      // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate
-      // since we can simplify the expressions algebraically,
-      // and don't need most of the error checking of the boilerplate version
-      // as we know in advance that the function is reasonably well-behaved,
-      // and in any case the derivatives require evaluation of Lambert W!
-
-      // z == W * exp(W);
-      T expw0 = exp(w0); // Compute z from best Lambert W estimate so far.
-                                // Hope that  w0 * expw0 == z;
-      T diff = (w0 * expw0) - z; // Difference from argument z.
-
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-        std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
-
-      iterations++;
-      // Halley's method from Luu equation 6.39, line 17.
-      // https://en.wikipedia.org/wiki/Halley%27s_method
-      // http://www.wolframalpha.com/input/?i=differentiate+productlog(x)
-      // differentiate productlog(x)  d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w)
-      // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2)
-      // f'(w) = e^w (1 + w)
-      // f''(w) = e^w (2 + w) ,
-      // f''(w)/f'(w) = (2+w) / (1+w),  Luu equation 6.38.
-
-      w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39.
-        - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2)));
-      if ( // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few).
-        (fabs((w0 / w1) - static_cast(1)) < tolerance)
-        || // Or latest estimate is not better, or worse, so avoid oscillating result (common when near singularity).
-        (abs(diff) >= abs(previous_diff))
-        )
+      else if (z < 9897.12905874)  // 2.8 < log(z) < 9.2
       {
-        return w1; // No improvement, so as good as it can be.
+         // Max error in interpolated form: 1.771e-08
+         static const T Y = -1.402973175e+00f;
+         static const T P[] = {
+            1.966174312e+00f,
+            2.350864728e-01f,
+            -5.098074353e-02f,
+            -1.054818339e-02f,
+         };
+         static const T Q[] = {
+            1.000000000e+00f,
+            4.388208264e-01f,
+            8.316639634e-02f,
+            3.397187918e-03f,
+            -1.321489743e-05f,
+         };
+         T log_w = log(z);
+         return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
       }
-
-      w0 = w1;
-      previous_diff = diff; // Remember so that can check if any new estimate is better.
-    }
-    while (
-      (iterations < min_iterations) || // do minimum iterations.
-      (iterations <= max_iterations) // Absolute max limit during testing
-           // (unexpected looping if need this).
-    );
-    return w1; //
-  } // Halley do while
-
-  //! \brief Schroeder method, fifth-order update formula,
-  //! \details See T. Fukushima page 80-81, and
-  //! A. Householder, The Numerical Treatment of a Single Nonlinear Equation,
-  //! McGraw-Hill, New York, 1970, section 4.4.
-  //! Fukushima algorithm switches to @c schroeder_update after pre-computed bisections,
-  //! chosen to ensure that the result will be achieve the +/- 10 epsilon target.
-  //! \param w Lambert w estimate from bisection.
-  //! \param y bracketing value from bisection.
-  //! \returns Refined estimate of Lambert w.
-
-  // Schroeder refinement, called unless NOT required by precision policy.
-  template
-  inline
-  T schroeder_update(const T w, const T y)
-  {
-    // Compute derivatives using 5th order Schroeder refinement.
-    // Since this is the final step, it will always use the highest precision type T.
-    // Example of Call:
-    //   result = schroeder_update(w, y);
-    //where
-    // w is estimate of Lambert W (from bisection or series).
-    // y is z * e^-w. 
-
-    BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
-    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
-    std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-    using boost::math::float_distance;
-    T fd = float_distance(w, y);
-    std::cout << "Schroder ";
-    if (abs(fd) < 214748000.)
-    {
-      std::cout << " Distance = "<< static_cast(fd);
-    }
-    else
-    {
-      std::cout << "Difference w - y = " << (w - y) << ".";
-    }
-    std::cout << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
-    //  Fukushima equation 18, page 6.
-    const T f0 = w - y; // f0 = w - y.
-    const T f1 = 1 + y; // f1 = df/dW
-    const T f00 = f0 * f0;
-    const T f11 = f1 * f1;
-    const T f0y = f0 * y;
-    const T result =
-     w - 4 * f0 * (6 * f1 * (f11 + f0y)  +  f00 * y) /
-      (f11 * (24 * f11 + 36 * f0y) +
-        f00 * (6 * y * y  +  8 * f1 * y  +  f0y)); // Fukushima Page 81, equation 21 from equation 20.
-
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
-    std::cout << "Schroeder refined " << w << "  " << y << ", difference  " << w-y  << ", change " << w - result << ", to result " << result << std::endl;
-    std::cout.precision(saved_precision); // Restore.
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
-
-    return result;
-  } // template T schroeder_update(const T w, const T y)
-
-  /////////////  namespace detail implementations of Lambert W for W0 and W-1 branches.
- 
-  //! Compute Lambert W for W0 (or W+) branch.
-  template
-  T lambert_w0_imp(const T z, const Policy& pol)
-  {
-    // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1).
-    // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L),
-    // or static_casted integer, for example:  static_cast(1) or static_cast(1).
-    // Want to allow fixed_point types too, so do not just test for floating-point.
-    // Integral types should been promoted to double by user Lambert w functions.
-    BOOST_STATIC_ASSERT_MSG(!std::is_integral::value,
-      "Must be floating-point or fixed type (not integer type), for example: lambert_w0(1.), not lambert_w0(1)!");
-     
-    const char* function = "boost::math::lambert_w0()"; // Used for error messages.
-
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0
-    {
-      std::size_t saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-      std::cout << "Lambert_w argument = " << z << std::endl;
-      std::cout << "Argument Type = " << typeid(T).name()
-        << ", max_digits10 = " << std::numeric_limits::max_digits10
-        << std::setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() << std::endl;
-      std::cout.precision(saved_precision); // Restore precision.
-    }
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0
-
-    // Check for edge and corner cases first:
-
-    if (boost::math::isnan(z))
-    {
-      return policies::raise_domain_error(function,
-        "Argument z is NaN!",
-        z, pol);
-    } // isnan
-    if (boost::math::isinf(z))
-    {
-      if (std::numeric_limits::has_infinity)
+      else if (z < 7.896296e+13)  // 9.2 < log(z) <= 32
       {
-        return std::numeric_limits::infinity();
+         // Max error in interpolated form: 5.821e-08
+         static const T Y = -2.735729218e+00f;
+         static const T P[] = {
+            3.424903470e+00f,
+            7.525631787e-02f,
+            -1.427309584e-02f,
+            -1.435974178e-05f,
+         };
+         static const T Q[] = {
+            1.000000000e+00f,
+            2.514005579e-01f,
+            6.118994652e-03f,
+            -1.357889535e-05f,
+            7.312865624e-08f,
+         };
+         T log_w = log(z);
+         return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+      }
+      else // 32 < log(z) < 100
+      {
+         // Max error in interpolated form: 1.491e-08
+         static const T Y = -4.012863159e+00f;
+         static const T P[] = {
+            4.431629226e+00f,
+            2.756690487e-01f,
+            -2.992956930e-03f,
+            -4.912259384e-05f,
+         };
+         static const T Q[] = {
+            1.000000000e+00f,
+            2.015434591e-01f,
+            4.949426142e-03f,
+            1.609659944e-05f,
+            -5.111523436e-09f,
+         };
+         T log_w = log(z);
+         return log_w+ Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+      }
+   }
+   else // z < 0.05
+   {
+      if (z > -0.27)
+      {
+         if (z < -0.051)
+         {
+            // -0.27 < z < -0.051
+            // Max error in interpolated form: 5.080e-08
+            static const T Y = 1.255809784e+00f;
+            static const T P[] = {
+               -2.558083412e-01f,
+               -2.306524098e+00f,
+               -5.630887033e+00f,
+               -3.803974556e+00f,
+            };
+            static const T Q[] = {
+               1.000000000e+00f,
+               5.107680783e+00f,
+               7.914062868e+00f,
+               3.501498501e+00f,
+            };
+            return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+         }
+         else
+         {
+            // Very small z so use a series function.
+            return lambert_w0_small_z(z, pol);
+         }
+      }
+      else if (z > -0.3578794411714423215955237701)
+      { // Very close to branch singularity.
+         // Max error in interpolated form: 5.269e-08
+         static const T Y = 1.220928431e-01f;
+         static const T P[] = {
+            -1.221787446e-01f,
+            -6.816155875e+00f,
+            7.144582035e+01f,
+            1.128444390e+03f,
+         };
+         static const T Q[] = {
+            1.000000000e+00f,
+            6.480326790e+01f,
+            1.869145243e+02f,
+            -1.361804274e+03f,
+            1.117826726e+03f,
+         };
+         T d = z + 0.367879441171442321595523770161460867445811f;
+         return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d));
+      }
+      else if (z <= -0.3678794411714423215955237701614608674458111310f)
+      {
+         if (z < -0.3678794411714423215955237701614608674458111310f)
+            return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+         return -1;
       }
       else
-      { // Arbitrary precision type.
-        return tools::max_value();
-      }
-      // Or might opt to throw an exception?
-      //return policies::raise_domain_error(function,
-      //  "Argument z is infinite!",
-      //  z, pol);
-    } // isinf
-
-    BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
-    if (abs(z) <= static_cast(0.05))
-    { // z is near zero, so use small z/near-zero series expansion.
-      // Change to use this series approximation made by Fukushima at 0.05,
-      // found by trial and error, and may not be best for higher precision.
-      // Chose float, double, or long double, or multiprecision specializations.
-      // Higher precision types either need more terms, or change in range of abs(z),
-      // or use as an approximation?
-      return detail::lambert_w0_small_z(z, pol);
-    }
-    else if (z == -boost::math::constants::exp_minus_one())
-    { // At singularity, so return exactly minus one.
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES
-      std::cout << "At singularity. " << std::endl; // within epsilon of branch singularity 0.36.
-#endif
-      return static_cast(-1);
-    }
-    else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch (should using W1 branch instead).
-    {
-      return policies::raise_domain_error(function,
-        "Argument z = %1% out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).",
-        z, pol);
-    }
-    else if (z < static_cast(-0.35))
-    { // Near singularity/branch point at z = -0.3678794411714423215955237701614608727
-      const T p2 = 2 * (boost::math::constants::e() * z + 1);
-      if (p2 > 0)
-      { // Use near-singularity series expansion.
-         // http://www.boost.org/doc/libs/release/libs/multiprecision/doc/html/boost_multiprecision/intro.html
-         // Taking care to avoid trouble from expression templates.
-        T w_series = lambert_w_singularity_series(T(sqrt(p2)));
-        // Neither Halley nor Schroeder do not improve result for builtin,
-        // differences about 5e-15, so do NOT use refinement step below unless multiprecision.
-        // 
-        //int d2 = policies::digits(); // Precision as digits base 2 from policy.
-        //if (d2 > (std::numeric_limits::digits - 6))
-        //{ // If more (fullest) accuracy required, then use refinement.
-        //  T y = z * exp(-w_series);
-        //  T s_result = schroeder_update(w_series, y);
-        //}
-        if (std::numeric_limits::digits > 53)
-        { // Multiprecision, so try a refinement:
-          w_series = halley_update(w_series, z, pol);
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
-          std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-          std::cout << "Halley updated to " << w_series << std::endl;
-          std::cout.precision(saved_precision);
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
-        }
-        return w_series;
-      }
-    } //  z < -0.35
- // z < -1/e
-    else 
-    { //! Check if z so big that cannot use lookup table, so approximate and Halley iterate.
-     // std::cout << " lambert_w_lookup::w0zs[63] "  << lambert_w_lookup::w0zs[63] << ' ' << lambert_w_lookup::w0zs[64]  << std::endl;
-      // lambert_w_lookup::w0zs[63] = 1.4450833904658542e+29,  lambert_w_lookup::w0zs[64]=  3.9904954117194348e+29, 
-      if (z >= lambert_w_lookup::w0zs[lambert_w_lookup::noof_w0zs - 1]) // F[64] =  3.9904954117194348e+29
-      { //! z so big that cannot use lookup table, so approximate and Halley iterate.
-        T guess;
-         // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
-         // François Chapeau-Blondeau and Abdelilah Monir
-         // Numerical Evaluation of the Lambert W Function
-         // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002
-         // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf
-         // Estimate Lambert W using ln(z)  ...
-         // This is roughly the power of ten * ln(10) ~= 2.3, n ~= 10^n
-         //  and improve by adding a second term ln(ln(z))
-        T lz = log(z);
-        T llz = log(lz);
-        guess = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
-      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE
-        std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-        std::cout << "z = " << z << ", guess = " << guess << ", ln(z) = " << lz << ", ln(-ln(z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl;
-
-        // z = 3.9999999999999997e+29, guess = 64.001325187470187, ln(z) = 68.161262057947212, ln(-ln(z) = 4.2218763984580194, llz/lz = 0.061939527980993024
-        // After 3 Halley iterations: lambert_w0(3.9999999999999997e+29) = 64.002342375637951
-
-        int d10 = policies::digits_base10(); // policy template parameter digits10
-        int d2 = policies::digits(); // digits base 2 from policy.
-        std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
-          << std::endl;
-        std::cout.precision(saved_precision);
-      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE
-        if (policies::digits() < 12)
-        { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12.
-          return guess;
-        }
-        // else refine for higher precision.
-        T result = halley_update(guess, z, pol);
-        return result;
-
-        // Or could throw an exception here.
-        //// G[k=64] == g[63] ==
-        //return policies::raise_domain_error(function, 3.9999999999999997e+29
-        //  "Argument z = %1% is too small (< 3.9904954117194348e+29) !",
-        //  z, pol);
-      } // Too big for lookup table.
-
-      // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Bisection and Schroeder (and Halley).
-      if (std::numeric_limits::digits > 53)
-      { // T is more precise than 64-bit double (or long double, or ?),
-        // so recurse to compute an approximate double value using only one Schroeder refinement,
-        // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50
-        // because are next going to use Halley refinement at full/high precision using this as an approximation).
-        using boost::math::policies::precision;
-        using boost::math::policies::digits10;
-        using boost::math::policies::digits2;
-        using boost::math::policies::policy;
-        // Compute a 50-bit precision approximate W0 in a double (no Halley refinement).
-        T double_approx = static_cast(lambert_w0_imp(static_cast(z), policy >()));
-#ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
-        std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
-        // Perform additional few Halley refinement(s) to ensure that
-        // get a near as possible to correct result (usually +/- one epsilon).
-        T result = halley_update(double_approx, z, pol);
-#ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_W0__NOT_BUILTIN
-        std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-        std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl;
-        std::cout.precision(saved_precision);
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0__NOT_BUILTIN
-        return result;
-      } // digits > 53  - higher precision than double.
-      else // T is double or less precision.
       {
-        // Use a lookup table
-        using namespace boost::math::detail::lambert_w_lookup;
-        // to find the nearest integer part of Lambert W to use as starting point for Bisection,
-        // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch.
-        // Since z is probably quite small, start with lowest (n = 0),
-        // up to largest possible F[k=64] for lookup_t type).
-        int n; // Indexing W0 lookup table w0zs[n] of z.
-        for (n = 0; n <= 2; ++n)
-        { // Try 1st few.
-          if (w0zs[n] > z)
-          { //
-            goto bisect;
-          }
-        }
-        n = 2;
-        for (int j = 1; j <= 5; ++j)
-        {
-          n *= 2; // Try bigger, and bigger steps.
-          if (w0zs[n] > z) // z <= w0zs[n]
-          {
-            goto overshot; // Need to backup!
-          }
-        } // for
-        // get here if
-        //std::cout << "Too big " << z << std::endl;
-        //// else z too large :-(
-        //const char* function = "boost::math::lambert_w0()";
-        // This should not now occur (> largest lookup now handled) so should be a logic error?
-        std::cout << "W = " << n << ", w0zs[n]" << w0zs[n] << ' ' << w0zs[n+1] << ", z = " << z << std::endl;
-        return policies::raise_domain_error("boost::math::lambert_w0()",
-          "Argument z = %1% is too large! (Should not occur, please report.)",
-          z, pol);
-      overshot:
-        {
-          int nh = n / 2;
-          for (int j = 1; j <= 5; ++j)
-          {
-            nh /= 2;
-            if (nh <= 0)
-            {
-              break;
-            }
-            if (w0zs[n - nh] > z)
-            {
-              n -= nh;
-            }
-          } // for
-        }
-
-      bisect:
-        --n; // w0zs[n] is nearest below, so n is integer part of W,
-        // and w0zs[n+1] is next integral part of W.
-        // These are used as initial values for bisection.
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP
-          std::cout << "Result lookup W0(" << z <<  ") bisection between w0zs[" << n << "] = " << w0zs[n] << " and w0zs[" << n << "] = " << w0zs[n+1]
-            << ", bisect mean = " << ( w0zs[n] + w0zs[n + 1]) / 2 << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP
-
-        // Check precision specified by policy in case can return early.
-        // Use can set  precision, for example = 7 from lambert_w0(x, policy >() or lambert_w0(x, policy >()
-        int d2 = policies::digits(); // digits base 2 from policy (default 24 for float, 53 for double).
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
-        int d10 = policies::digits_base10(); // policy template parameter digits10
-        std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
-          << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
-        if (d2 <= 7)
-        { // Only 7 binary digits precision required to hold integer size of w0zs[65],
-          // so just return the mean of the two nearby integral values.
-          // This is a *very* approximate estimate, and perhaps not very useful?
-          return static_cast((w0zs[n] + w0zs[n+1]) / 2);
-        }
-
-        // Compute the number of bisections that ensure that result is close enough that
-        // a single 5th order Schroeder update is sufficient to achieve near double (53-bit) accuracy.
-        int bisections = 8; //  Assume minimum number of bisections will be needed (most common case).
-        if (z <= -0.36)
-        { // Very near singularity, so need several more bisections.
-          bisections = noof_sqrts; // 12
-        }
-        else if (z <= -0.3)
-        { // Near singularity, so need a few more bisections.
-          bisections = 11;
-        }
-        else if (n <= 0)
-        { // Very small z, so need 3 more bisections.
-          bisections = 10;
-        }
-        else if (n <= 1)
-        { // Small z, so need just 1 extra bisection.
-          bisections = 9;
-        }
-       // bisections += 2; // Try a few extras to see if this gets closer to 'best possible result'. Probably not.
-// But would need more halfs and sqrts to test worst case?
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
-        std::cout << "n = " << n << ", so " << bisections << " bisections." << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
-        lookup_t dz = static_cast(z);
-        // Only use lookup_t precision, default double, for bisection.
-        // Use Halley refinement for higher precisions.
-        // Perform the bisections fractional bisections for necessary precision.
-        // Avoid using exponential function for speed.
-        lookup_t w = static_cast(n);  // Fukushima Equation 25, Integral Lambert W.
-       // lookup_t y = dz * e[n + 1]; // Fukushima Integral +1 Lambert W.
-        lookup_t y = dz * static_cast(w0es[n + 1]); // Fukushima Equation 26, Integral +1 Lambert W.
-        for (int j = 0; j < bisections; ++j)
-        { // Equation 27.
-          const lookup_t wj = w + static_cast(halves[j]); // Add 1/2, 1/4, 1/8 ...
-          const lookup_t yj = y * static_cast(sqrtw0s[j]); // Multiply by sqrt(1/e), ...
-          if (wj < yj)
-          {
-            w = wj;
-            y = yj;
-          }
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
-          std::cout  << "#" << std::setw(2) << j << "  w = " << w << ", y =  " << y << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
-        } // for bisections
-
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
-          std::cout << "Bisection estimate =            " << w << " " << y << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
-
-        if (d2 <= 10)
-        { // Only 10 digits2 required (== digits10 ~= 3 decimal digits precision),
-          // so just return the nearest bisection.
-          // (Might make this test depend on size of T?)
-          return static_cast(w); // Bisection only.
-        }
-        else // More than 10 digits2 wanted, so continue with Fukushima's Schroeder refinement.
-        {
-          T result = static_cast(schroeder_update(w, y));
-          if (d2 <= (std::numeric_limits::digits - 3))
-          { // Only enough digits2 required, so just return the Schroeder refined value.
-            // For example, for float, if (d2 <= 22) then
-            // digits-3 returns Schroeder result if up to 3 bits might be wrong.
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
-            std::cout << "Schroeder refinement estimate = " << result << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
-            return result; // Schroeder only.
-          }
-          else // Perform additional Halley refinement(s) to ensure that
-          // get a near as possible to correct result (usually +/- epsilon).
-          {
-            result = halley_update(result, z, pol);
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
-            std::cout.precision(std::numeric_limits::max_digits10);
-            std::cout << "Halley refinement estimate =    " << result << std::endl;
-            std::cout.precision(saved_precision);
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
-            return result; // Halley
-          } // schroeder or Schroeder and Halley.
-        } // more than 10 digits2
+         // z is very close (within 0.01) of the singularity at e^-1.
+         const T p2 = 2 * (boost::math::constants::e() * z + 1);
+         const T p = sqrt(p2);
+         return lambert_w_singularity_series(p);
       }
-    } // normal range and precision.
-    throw std::logic_error("No result from lambert_w0_imp!  (Please report!)");  // Should never get here.
-  } //  T lambert_w0_imp(const T z, const Policy& pol)
- 
+   }
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit float.
+
+//! Lambert_w0 @b double implementation, selected when T is 64-bit precision.
+template 
+inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
+{
+   static const char* function = "boost::math::lamber_w0<%1%>";
+   BOOST_MATH_STD_USING // Aid ADL of std functions.
+
+   // Unusual case of 32-bit double with a wider/64-bit long double
+   BOOST_STATIC_ASSERT_MSG(std::numeric_limits::digits >= 53,
+   "Our double precision coefficients will be truncated, "
+	 "please file a bug report with details of your platform's floating point types "
+   "- or possibly edit the coefficients to have "
+   "an appropriate size-suffix for 64-bit floats on your platform - L?");
+
+     if ((boost::math::isnan)(z))
+     {
+       return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%", z, pol);
+     }
+
+   if (z >= 0.05)
+   {
+      if (z < 2)
+      {
+         if (z < 0.5)
+         {
+            // Max error in interpolated form: 2.255e-17
+            static const T offset = 8.19659233093261719e-01;
+            static const T P[] = {
+               1.80340766906685177e-01,
+               3.28178241493119307e-01,
+               -2.19153620687139706e+00,
+               -7.24750929074563990e+00,
+               -7.28395876262524204e+00,
+               -2.57417169492512916e+00,
+               -2.31606948888704503e-01
+            };
+            static const T Q[] = {
+               1.00000000000000000e+00,
+               7.36482529307436604e+00,
+               2.03686007856430677e+01,
+               2.62864592096657307e+01,
+               1.59742041380858333e+01,
+               4.03760534788374589e+00,
+               2.91327346750475362e-01
+            };
+            return z * (offset + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z));
+         }
+         else
+         {
+            // Max error in interpolated form: 3.806e-18
+            static const T offset = 5.50335884094238281e-01;
+            static const T P[] = {
+               4.49664083944098322e-01,
+               1.90417666196776909e+00,
+               1.99951368798255994e+00,
+               -6.91217310299270265e-01,
+               -1.88533935998617058e+00,
+               -7.96743968047750836e-01,
+               -1.02891726031055254e-01,
+               -3.09156013592636568e-03
+            };
+            static const T Q[] = {
+               1.00000000000000000e+00,
+               6.45854489419584014e+00,
+               1.54739232422116048e+01,
+               1.72606164253337843e+01,
+               9.29427055609544096e+00,
+               2.29040824649748117e+00,
+               2.21610620995418981e-01,
+               5.70597669908194213e-03
+            };
+            return z * (offset + boost::math::tools::evaluate_rational(P, Q, z));
+         }
+      }
+      else if (z < 6)
+      {
+         // 2 < z < 6
+         // Max error in interpolated form: 1.216e-17
+         static const T Y = 1.16239356994628906e+00;
+         static const T P[] = {
+            -1.16230494982099475e+00,
+            -3.38528144432561136e+00,
+            -2.55653717293161565e+00,
+            -3.06755172989214189e-01,
+            1.73149743765268289e-01,
+            3.76906042860014206e-02,
+            1.84552217624706666e-03,
+            1.69434126904822116e-05,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            3.77187616711220819e+00,
+            4.58799960260143701e+00,
+            2.24101228462292447e+00,
+            4.54794195426212385e-01,
+            3.60761772095963982e-02,
+            9.25176499518388571e-04,
+            4.43611344705509378e-06,
+         };
+         return Y + boost::math::tools::evaluate_rational(P, Q, z);
+      }
+      else if (z < 18)
+      {
+         // 6 < z < 18
+         // Max error in interpolated form: 1.985e-19
+         static const T offset = 1.80937194824218750e+00;
+         static const T P[] =
+         {
+            -1.80690935424793635e+00,
+            -3.66995929380314602e+00,
+            -1.93842957940149781e+00,
+            -2.94269984375794040e-01,
+            1.81224710627677778e-03,
+            2.48166798603547447e-03,
+            1.15806592415397245e-04,
+            1.43105573216815533e-06,
+            3.47281483428369604e-09
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            2.57319080723908597e+00,
+            1.96724528442680658e+00,
+            5.84501352882650722e-01,
+            7.37152837939206240e-02,
+            3.97368430940416778e-03,
+            8.54941838187085088e-05,
+            6.05713225608426678e-07,
+            8.17517283816615732e-10
+         };
+         return offset + boost::math::tools::evaluate_rational(P, Q, z);
+      }
+      else if (z < 9897.12905874)  // 2.8 < log(z) < 9.2
+      {
+         // Max error in interpolated form: 1.195e-18
+         static const T Y = -1.40297317504882812e+00;
+         static const T P[] = {
+            1.97011826279311924e+00,
+            1.05639945701546704e+00,
+            3.33434529073196304e-01,
+            3.34619153200386816e-02,
+            -5.36238353781326675e-03,
+            -2.43901294871308604e-03,
+            -2.13762095619085404e-04,
+            -4.85531936495542274e-06,
+            -2.02473518491905386e-08,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            8.60107275833921618e-01,
+            4.10420467985504373e-01,
+            1.18444884081994841e-01,
+            2.16966505556021046e-02,
+            2.24529766630769097e-03,
+            9.82045090226437614e-05,
+            1.36363515125489502e-06,
+            3.44200749053237945e-09,
+         };
+         T log_w= log(z);
+         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+      }
+      else if (z < 7.896296e+13)  // 9.2 < log(z) <= 32
+      {
+         // Max error in interpolated form: 6.529e-18
+         static const T Y = -2.73572921752929688e+00;
+         static const T P[] = {
+            3.30547638424076217e+00,
+            1.64050071277550167e+00,
+            4.57149576470736039e-01,
+            4.03821227745424840e-02,
+            -4.99664976882514362e-04,
+            -1.28527893803052956e-04,
+            -2.95470325373338738e-06,
+            -1.76662025550202762e-08,
+            -1.98721972463709290e-11,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            6.91472559412458759e-01,
+            2.48154578891676774e-01,
+            4.60893578284335263e-02,
+            3.60207838982301946e-03,
+            1.13001153242430471e-04,
+            1.33690948263488455e-06,
+            4.97253225968548872e-09,
+            3.39460723731970550e-12,
+         };
+         T log_w= log(z);
+         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+      }
+      else if (z < 2.6881171e+43) // 32 < log(z) < 100
+      {
+         // Max error in interpolated form: 2.015e-18
+         static const T Y = -4.01286315917968750e+00;
+         static const T P[] = {
+            5.07714858354309672e+00,
+            -3.32994414518701458e+00,
+            -8.61170416909864451e-01,
+            -4.01139705309486142e-02,
+            -1.85374201771834585e-04,
+            1.08824145844270666e-05,
+            1.17216905810452396e-07,
+            2.97998248101385990e-10,
+            1.42294856434176682e-13,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            -4.85840770639861485e-01,
+            -3.18714850604827580e-01,
+            -3.20966129264610534e-02,
+            -1.06276178044267895e-03,
+            -1.33597828642644955e-05,
+            -6.27900905346219472e-08,
+            -9.35271498075378319e-11,
+            -2.60648331090076845e-14,
+         };
+         T log_w= log(z);
+         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+      }
+      else // 100 < log(z) < 710
+      {
+         // Max error in interpolated form: 5.277e-18
+         static const T Y = -5.70115661621093750e+00;
+         static const T P[] = {
+            6.42275660145116698e+00,
+            1.33047964073367945e+00,
+            6.72008923401652816e-02,
+            1.16444069958125895e-03,
+            7.06966760237470501e-06,
+            5.48974896149039165e-09,
+            -7.00379652018853621e-11,
+            -1.89247635913659556e-13,
+            -1.55898770790170598e-16,
+            -4.06109208815303157e-20,
+            -2.21552699006496737e-24,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            3.34498588416632854e-01,
+            2.51519862456384983e-02,
+            6.81223810622416254e-04,
+            7.94450897106903537e-06,
+            4.30675039872881342e-08,
+            1.10667669458467617e-10,
+            1.31012240694192289e-13,
+            6.53282047177727125e-17,
+            1.11775518708172009e-20,
+            3.78250395617836059e-25,
+         };
+         T log_w= log(z);
+         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+      }
+   }
+   else
+   {
+      if (z > -0.1)
+      {
+         if (z < -0.051)
+         {
+            // -0.1 < z < -0.051
+            // Maximum Deviation Found:                     4.402e-22
+            // Expected Error Term : 4.240e-22
+            // Maximum Relative Change in Control Points : 4.115e-03
+            static const T Y = 1.08633995056152344e+00;
+            static const T P[] = {
+               -8.63399505615014331e-02,
+               -1.64303871814816464e+00,
+               -7.71247913918273738e+00,
+               -1.41014495545382454e+01,
+               -1.02269079949257616e+01,
+               -2.17236002836306691e+00,
+            };
+            static const T Q[] = {
+               1.00000000000000000e+00,
+               7.44775406945739243e+00,
+               2.04392643087266541e+01,
+               2.51001961077774193e+01,
+               1.31256080849023319e+01,
+               2.11640324843601588e+00,
+            };
+            return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+         }
+         else
+         {
+            // Very small z:
+            return lambert_w0_small_z(z, pol);
+         }
+      }
+      else if (z > -0.2)
+      {
+         // -0.2 < z < -0.1
+         // Maximum Deviation Found:                     2.898e-20
+         // Expected Error Term : 2.873e-20
+         // Maximum Relative Change in Control Points : 3.779e-04
+         static const T Y = 1.20359611511230469e+00;
+         static const T P[] = {
+            -2.03596115108465635e-01,
+            -2.95029082937201859e+00,
+            -1.54287922188671648e+01,
+            -3.81185809571116965e+01,
+            -4.66384358235575985e+01,
+            -2.59282069989642468e+01,
+            -4.70140451266553279e+00,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            9.57921436074599929e+00,
+            3.60988119290234377e+01,
+            6.73977699505546007e+01,
+            6.41104992068148823e+01,
+            2.82060127225153607e+01,
+            4.10677610657724330e+00,
+         };
+         return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+      }
+      else if (z > -0.3178794411714423215955237)
+      {
+         // Max error in interpolated form: 6.996e-18
+         static const T Y = 3.49680423736572266e-01;
+         static const T P[] = {
+            -3.49729841718749014e-01,
+            -6.28207407760709028e+01,
+            -2.57226178029669171e+03,
+            -2.50271008623093747e+04,
+            1.11949239154711388e+05,
+            1.85684566607844318e+06,
+            4.80802490427638643e+06,
+            2.76624752134636406e+06,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            1.82717661215113000e+02,
+            8.00121119810280100e+03,
+            1.06073266717010129e+05,
+            3.22848993926057721e+05,
+            -8.05684814514171256e+05,
+            -2.59223192927265737e+06,
+            -5.61719645211570871e+05,
+            6.27765369292636844e+04,
+         };
+         T d = z + 0.367879441171442321595523770161460867445811;
+         return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d));
+      }
+      else if (z > -0.3578794411714423215955237701)
+      {
+         // Max error in interpolated form: 1.404e-17
+         static const T Y = 5.00126481056213379e-02;
+         static const T  P[] = {
+            -5.00173570682372162e-02,
+            -4.44242461870072044e+01,
+            -9.51185533619946042e+03,
+            -5.88605699015429386e+05,
+            -1.90760843597427751e+06,
+            5.79797663818311404e+08,
+            1.11383352508459134e+10,
+            5.67791253678716467e+10,
+            6.32694500716584572e+10,
+         };
+         static const T Q[] = {
+            1.00000000000000000e+00,
+            9.08910517489981551e+02,
+            2.10170163753340133e+05,
+            1.67858612416470327e+07,
+            4.90435561733227953e+08,
+            4.54978142622939917e+09,
+            2.87716585708739168e+09,
+            -4.59414247951143131e+10,
+            -1.72845216404874299e+10,
+         };
+         T d = z + 0.36787944117144232159552377016146086744581113103176804;
+         // bad!
+         return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d));
+      }
+      else if (z <= -0.36787944117144232159552377016146086744581113103176804) // Precision is max_digits10(cpp_bin_float_50).
+      {
+        if (z < -0.36787944117144232159552377016146086744581113103176804)
+        {
+          return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+        }
+        return -1;
+      }
+      else
+      {  // z is very close (within 0.01) of the singularity at -e^-1,
+         // so use a series expansion from R. M. Corless et al.
+         const T p2 = 2 * (boost::math::constants::e() * z + 1);
+         const T p = sqrt(p2);
+         return lambert_w_detail::lambert_w_singularity_series(p);
+      }
+   }
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
+
+//! lambert_W0 implementation for extended precision types including
+//! long double, Boost.Multiprecision types like cpp_bin_float_quad, cpp_bin_float_50...
+
+template 
+inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
+{
+   static const char* function = "boost::math::lambert_w0<%1%>";
+   BOOST_MATH_STD_USING // Aid ADL of std functions.
+
+   // Filter out special cases first:
+   if ((boost::math::isnan)(z))
+   {
+      return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+   }
+   if (fabs(z) <= 0.05f)
+   {
+      // Very small z:
+      return lambert_w0_small_z(z, pol);
+   }
+   if (z > (std::numeric_limits::max)())
+   {
+      if ((boost::math::isinf)(z))
+      {
+         return policies::raise_overflow_error(function, 0, pol);
+         // Or might return infinity if available else max_value,
+         // but other Boost.Math special functions raise overflow.
+      }
+      // z is larger than the largest double, so cannot use the polynomial to get an approximation,
+      // so use the asymptotic approximation and Halley iterate:
+      T lz = log(z);
+      T llz = log(lz);
+      T w = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+      return lambert_w_halley_iterate(w, z);
+   }
+   if (z < -0.3578794411714423215955237701)
+   { // Very close to branch point so rational polynomials are not usable.
+      if (z <= -boost::math::constants::exp_minus_one())
+      {
+         if (z == -boost::math::constants::exp_minus_one())
+         { // Exactly at the branch point singularity.
+            return -1;
+         }
+         return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+      }
+      // z is very close (within 0.01) of the branch singularity at -e^-1
+      // so use a series approximation proposed by Corless et al.
+      const T p2 = 2 * (boost::math::constants::e() * z + 1);
+      const T p = sqrt(p2);
+      return lambert_w_detail::lambert_w_singularity_series(p);
+   }
+
+   // Whew!
+   // If we get here we are in the normal range of the function, so
+   // get a double precision approximation first, then iterate to full precision of T.
+   // We define a type that is:
+   // mpl::true_  if there are so many digits required that iteration is required.
+   // mpl::false_ if a single Halley step is sufficient.
+   // For speed, we also cast z to type double when that is possible
+   //   (boost::is_constructible() == true).
+
+   typedef typename policies::precision::type precision_type;
+   typedef mpl::bool_<
+      (precision_type::value == 0) || (precision_type::value > 113) ?
+      true // Unknown at compile-time, variable/arbitrary, or more than quad 128-bit precision.
+      : false
+   > tag_type;
+
+  // JM reused name z but Clang complains that it is hiding parameter z.
+  // T z = lambert_w0_imp(maybe_reduce_to_double(z, boost::is_constructible()), pol, mpl::int_<2>());
+  // return lambert_w_maybe_halley_iterate(z, z, tag_type());
+   T w = lambert_w0_imp(maybe_reduce_to_double(z, boost::is_constructible()), pol, mpl::int_<2>());
+
+   return lambert_w_maybe_halley_iterate(w, z, tag_type());
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)  extended precision.
+
+
+  // Lambert w-1 implementation
 
   //! Lambert W for W-1 branch, -max(z) < z <= -1/e.
   // TODO is -max(z) allowed?
-  template
-  T lambert_wm1_imp(const T z, const Policy&  pol)
+template
+T lambert_wm1_imp(const T z, const Policy&  pol)
+{
+  // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1).
+  // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L),
+  // or static_casted integer, for example:  static_cast(1) or static_cast(1).
+  // Want to allow fixed_point types too, so do not just test for floating-point.
+  // Integral types should be promoted to double by user Lambert w functions.
+  // If integral type provided to user function lambert_w0 or lambert_wm1,
+  // then should already have been promoted to double.
+  BOOST_STATIC_ASSERT_MSG(!std::is_integral::value,
+    "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!");
+
+  BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs.
+
+  const char* function = "boost::math::lambert_wm1()"; // Used for error messages.
+
+  // Check for edge and corner cases first:
+  if (boost::math::isnan(z))
   {
-    // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1).
-    // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L),
-    // or static_casted integer, for example:  static_cast(1) or static_cast(1).
-    // Want to allow fixed_point types too, so do not just test for floating-point.
-    // Integral types should be promoted to double by user Lambert w functions.
-    // If integral type provided to user function lambert_w0 or lambert_wm1,
-    // then should already have been promoted to double.
-    BOOST_STATIC_ASSERT_MSG(!std::is_integral::value,
-      "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!");
+    return policies::raise_domain_error(function,
+      "Argument z is NaN!",
+      z, pol);
+  } // isnan
 
-    BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs.
+  if (boost::math::isinf(z))
+  {
+    return policies::raise_domain_error(function,
+      "Argument z is infinite!",
+      z, pol);
+  } // isinf
 
-    const char* function = "boost::math::lambert_wm1()"; // Used for error messages.
-
-    // Check for edge and corner cases first:
-
-    if (boost::math::isnan(z))
+  if (z == static_cast(0))
+  { // z is exactly zero so return -std::numeric_limits::infinity();
+    if (std::numeric_limits::has_infinity)
     {
-      return policies::raise_domain_error(function,
-        "Argument z is NaN!",
-        z, pol);
-    } // isnan
-
-    if (boost::math::isinf(z))
+      return -std::numeric_limits::infinity();
+    }
+    else
     {
-      return policies::raise_domain_error(function,
-        "Argument z is infinite!",
-        z, pol);
-    } // isinf
-
-    if (z == static_cast(0))
-    { // z is exactly zero so return -std::numeric_limits::infinity();
-      if (std::numeric_limits::has_infinity)
-      {
-        return -std::numeric_limits::infinity();
-      }
-      else
-      { 
-        return -tools::max_value();
-      }
+      return -tools::max_value();
     }
-    if (std::numeric_limits::has_denorm)
-    { // All real types except arbitrary precision.
-      if (!boost::math::isnormal(z))
-      { // Almost zero - might also just return infinity like z == 0 or max_value?
-        return policies::raise_overflow_error(function,
-          "Argument z =  %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)",
-          z, pol);
-      }
-    }
-
-    if (z > static_cast(0))
-    { //
-      return policies::raise_domain_error(function,
-        "Argument z = %1% is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?)",
-        z, pol);
-    }
-    if (z > -(std::numeric_limits::min)())
-    { // z is denormalized, so cannot be computed.
-      // -std::numeric_limits::min() is smallest for type T,
-      // for example, for double: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634
+  }
+  if (std::numeric_limits::has_denorm)
+  { // All real types except arbitrary precision.
+    if (!boost::math::isnormal(z))
+    { // Almost zero - might also just return infinity like z == 0 or max_value?
       return policies::raise_overflow_error(function,
-        "Argument z = %1% is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch!",
+        "Argument z =  %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)",
         z, pol);
     }
-    if (z == -boost::math::constants::exp_minus_one()) // == singularity/branch point z = -exp(-1) = -3.6787944.
-    { // At singularity, so return exactly -1.
-      return -static_cast(1);
+  }
+
+  if (z > static_cast(0))
+  { //
+    return policies::raise_domain_error(function,
+      "Argument z = %1% is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?)",
+      z, pol);
+  }
+  if (z > -(std::numeric_limits::min)())
+  { // z is denormalized, so cannot be computed.
+    // -std::numeric_limits::min() is smallest for type T,
+    // for example, for double: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634
+    return policies::raise_overflow_error(function,
+      "Argument z = %1% is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch!",
+      z, pol);
+  }
+  if (z == -boost::math::constants::exp_minus_one()) // == singularity/branch point z = -exp(-1) = -3.6787944.
+  { // At singularity, so return exactly -1.
+    return -static_cast(1);
+  }
+  // z is too negative for the W-1 (or W0) branch.
+  if (z < -boost::math::constants::exp_minus_one()) // > singularity/branch point z = -exp(-1) = -3.6787944.
+  {
+    return policies::raise_domain_error(function,
+      "Argument z = %1% is out of range (z < -exp(-1) = -3.6787944... <= 0) for Lambert W-1 (or W0) branch!",
+      z, pol);
+  }
+  if (z < static_cast(-0.35))
+  { // Close to singularity/branch point z = -0.3678794411714423215955237701614608727 but on W-1 branch.
+    const T p2 = 2 * (boost::math::constants::e() * z + 1);
+    if (p2 == 0)
+    { // At the singularity at branch point.
+      return -1;
     }
-    // z is too negative for the W-1 (or W0) branch.
-    if (z < -boost::math::constants::exp_minus_one()) // > singularity/branch point z = -exp(-1) = -3.6787944.
+    if (p2 > 0)
     {
-      return policies::raise_domain_error(function,
-        "Argument z = %1% is out of range (z < -exp(-1) = -3.6787944... <= 0) for Lambert W-1 (or W0) branch!",
-        z, pol);
-    }
-    if (z < static_cast(-0.35))
-    { // Close to singularity/branch point z = -0.3678794411714423215955237701614608727 but on W-1 branch. 
-      const T p2 = 2 * (boost::math::constants::e() * z + 1);
-      if (p2 == 0)
-      { // At the singularity at branch point.
-        return -1;
-      }
-      if (p2 > 0)
-      {
-        T w_series = lambert_w_singularity_series(T(-sqrt(p2)));
-        if (std::numeric_limits::digits > 53)
-        { // Multiprecision, so try a Halley refinement.
-          w_series = halley_update(w_series, z, pol);
+      T w_series = lambert_w_singularity_series(T(-sqrt(p2)));
+      if (std::numeric_limits::digits > 53)
+      { // Multiprecision, so try a Halley refinement.
+       // w_series = halley_update(w_series, z, pol);
+        w_series = lambert_w_detail::lambert_w_halley_iterate(w_series, z);
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN
-          std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-          std::cout << "Halley updated to " << w_series << std::endl;
-          std::cout.precision(saved_precision);
+        std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+        std::cout << "Halley updated to " << w_series << std::endl;
+        std::cout.precision(saved_precision);
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN
-        }
-        return w_series;
       }
-      // Should not get here.
-      return policies::raise_domain_error(function,
-        "Argument z = %1% is out of range for Lambert W-1 branch. (Should not get here - please report!)",
-        z, pol);
+      return w_series;
+    }
+    // Should not get here.
+    return policies::raise_domain_error(function,
+      "Argument z = %1% is out of range for Lambert W-1 branch. (Should not get here - please report!)",
+      z, pol);
+  } // if (z < -0.35)
 
-      //return policies::raise_domain_error(function,
-      //  "Argument z = %1% is out of range!",
-      //  z, pol);
-    } // if (z < -0.35)
+  using lambert_w_lookup::wm1es;
+  using lambert_w_lookup::wm1zs;
+  using lambert_w_lookup::noof_wm1zs; // size == 64
 
-    using lambert_w_lookup::wm1es;
-    using lambert_w_lookup::wm1zs;
-    using lambert_w_lookup::noof_wm1zs; // size == 64 
+  // std::cout <<" Wm1zs[63] (== G[64]) = " << " " << wm1zs[63] << std::endl; // Wm1zs[63] (== G[64]) =  -1.0264389699511283e-26
+  // Check that z argument value is not smaller than lookup_table G[64]
+  // std::cout << "(z > wm1zs[63]) = " << std::boolalpha << (z > wm1zs[63]) << std::endl;
 
-    // std::cout <<" Wm1zs[63] (== G[64]) = " << " " << wm1zs[63] << std::endl; // Wm1zs[63] (== G[64]) =  -1.0264389699511283e-26
-    // Check that z argument value is not smaller than lookup_table G[64] 
-    // std::cout << "(z > wm1zs[63]) = " << std::boolalpha << (z > wm1zs[63]) << std::endl;
+  if (z >= wm1zs[63]) // wm1zs[63]  = -1.0264389699511282259046957018510946438e-26L  W = 64.00000000000000000
+  {  // z >= -1.0264389699511303e-26 (but != 0 and >= std::numeric_limits::min() and so NOT denormalized).
+    std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+    // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl;
+    // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl;
+    // -std::numeric_limits::min() = -1.1754943508222875e-38
+    // -std::numeric_limits::min() = -2.2250738585072014e-308
 
-    if (z >= wm1zs[63]) // wm1zs[63]  = -1.0264389699511282259046957018510946438e-26L  W = 64.00000000000000000
-    {  // z >= -1.0264389699511303e-26 (but != 0 and >= std::numeric_limits::min() and so NOT denormalized).
-      std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-     // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl;
-     // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl;
-      // -std::numeric_limits::min() = -1.1754943508222875e-38
-      // -std::numeric_limits::min() = -2.2250738585072014e-308
+    // N[productlog(-1, -1.1754943508222875 * 10^-38 ), 50] = -91.856775324595479509567756730093823993834155027858
+    // N[productlog(-1, -2.2250738585072014e-308 * 10^-308 ), 50] = -1424.8544521230553853558132180518404363617968042942
+    // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955
 
-      // N[productlog(-1, -1.1754943508222875 * 10^-38 ), 50] = -91.856775324595479509567756730093823993834155027858
-      // N[productlog(-1, -2.2250738585072014e-308 * 10^-308 ), 50] = -1424.8544521230553853558132180518404363617968042942
-      // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955
+    // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth,
+    // “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
+    // François Chapeau-Blondeau and Abdelilah Monir
+    // Numerical Evaluation of the Lambert W Function
+    // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002
+    // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf
+    // Estimate Lambert W using ln(-z)  ...
+    // This is roughly the power of ten * ln(10) ~= 2.3.   n ~= 10^n
+    //  and improve by adding a second term -ln(ln(-z))
+    T guess; // bisect lowest possible Gk[=64] (for lookup_t type)
+    T lz = log(-z);
+    T llz = log(-lz);
+    guess = lz - llz + (llz / lz); // Chapeau-Blondeau equation 20, page 2162.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY
+    std::cout << "z = " << z << ", guess = " << guess << ", ln(-z) = " << lz << ", ln(-ln(-z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl;
+    // z = -1.0000000000000001e-30, guess = -73.312782616731482, ln(-z) = -69.077552789821368, ln(-ln(-z) = 4.2352298269101114, llz/lz = -0.061311231447304194
+    // z = -9.9999999999999999e-91, guess = -212.56650048504233, ln(-z) = -207.23265836946410, ln(-ln(-z) = 5.3338421155782205, llz/lz = -0.025738424423764311
+    // >z = -2.2250738585072014e-308, guess = -714.95942238244606, ln(-z) = -708.39641853226408, ln(-ln(-z) = 6.5630038501819854, llz/lz = -0.0092645920821846622
+    int d10 = policies::digits_base10(); // policy template parameter digits10
+    int d2 = policies::digits(); // digits base 2 from policy.
+    std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
+      << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY
+    if (policies::digits() < 12)
+    { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12.
+      return guess;
+    }
+    T result = lambert_w_detail::lambert_w_halley_iterate(guess, z);
+    std::cout.precision(saved_precision);
+    return result;
 
-      // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth,
-      // “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
-      // François Chapeau-Blondeau and Abdelilah Monir
-      // Numerical Evaluation of the Lambert W Function
-      // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002
-      // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf
-      // Estimate Lambert W using ln(-z)  ...
-      // This is roughly the power of ten * ln(10) ~= 2.3.   n ~= 10^n
-      //  and improve by adding a second term -ln(ln(-z))
-      T guess; // bisect lowest possible Gk[=64] (for lookup_t type)
-      T lz = log(-z);
-      T llz = log(-lz);
-      guess = lz - llz + (llz / lz); // Chapeau-Blondeau equation 20, page 2162.
-    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY
-      std::cout << "z = " << z << ", guess = " << guess << ", ln(-z) = " << lz << ", ln(-ln(-z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl;
-      // z = -1.0000000000000001e-30, guess = -73.312782616731482, ln(-z) = -69.077552789821368, ln(-ln(-z) = 4.2352298269101114, llz/lz = -0.061311231447304194
-      // z = -9.9999999999999999e-91, guess = -212.56650048504233, ln(-z) = -207.23265836946410, ln(-ln(-z) = 5.3338421155782205, llz/lz = -0.025738424423764311
-      // >z = -2.2250738585072014e-308, guess = -714.95942238244606, ln(-z) = -708.39641853226408, ln(-ln(-z) = 6.5630038501819854, llz/lz = -0.0092645920821846622
-      int d10 = policies::digits_base10(); // policy template parameter digits10
-      int d2 = policies::digits(); // digits base 2 from policy.
-      std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
-        << std::endl;
-    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY
-      if (policies::digits() < 12)
-      { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12.
-        return guess;
-      }
-      T result = halley_update(guess, z, pol);
-      std::cout.precision(saved_precision);
-      return result;
-
-      // Was Fukushima
-      // G[k=64] == g[63] == -1.02643897e-26
-      //return policies::raise_domain_error(function,
-      //  "Argument z = %1% is too small (< -1.02643897e-26) ! (Should not occur, please report.",
-      //  z, pol);
-    } // Z too small so use approximation and Halley.
+    // Was Fukushima
+    // G[k=64] == g[63] == -1.02643897e-26
+    //return policies::raise_domain_error(function,
+    //  "Argument z = %1% is too small (< -1.02643897e-26) ! (Should not occur, please report.",
+    //  z, pol);
+  } // Z too small so use approximation and Halley.
     // Else Use a lookup table to find the nearest integer part of Lambert W-1 as starting point for Bisection.
 
-    if (std::numeric_limits::digits > 53)
-    { // T is more precise than 64-bit double (or long double, or ?),
-      // so compute an approximate value using only one Schroeder refinement,
-      // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50
-      // because are next going to use Halley refinement at full/high precision using this as an approximation).
-      using boost::math::policies::precision;
-      using boost::math::policies::digits10;
-      using boost::math::policies::digits2;
-      using boost::math::policies::policy;
-      // Compute a 50-bit precision approximate W0 in a double (no Halley refinement).
-      T double_approx = static_cast(lambert_wm1_imp(static_cast(z), policy >()));
-    #ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN
-      std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl;
-    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
-      // Perform additional Halley refinement(s) to ensure that
-      // get a near as possible to correct result (usually +/- one epsilon).
-      T result = halley_update(double_approx, z, pol);
-    #ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_WM1
-      std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
-      std::cout << "Result " << typeid(T).name() << " precision Halley refinement =    " << result << std::endl;
-      std::cout.precision(saved_precision);
-    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
-      return result;
-    } // digits > 53  - higher precision than double.
-    else // T is double or less precision.
+  if (std::numeric_limits::digits > 53)
+  { // T is more precise than 64-bit double (or long double, or ?),
+    // so compute an approximate value using only one Schroeder refinement,
+    // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50
+    // because are next going to use Halley refinement at full/high precision using this as an approximation).
+    using boost::math::policies::precision;
+    using boost::math::policies::digits10;
+    using boost::math::policies::digits2;
+    using boost::math::policies::policy;
+    // Compute a 50-bit precision approximate W0 in a double (no Halley refinement).
+    T double_approx = static_cast(lambert_wm1_imp(static_cast(z), policy >()));
+#ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN
+    std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+    // Perform additional Halley refinement(s) to ensure that
+    // get a near as possible to correct result (usually +/- one epsilon).
+    T result = lambert_w_halley_iterate(double_approx, z);
+#ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+    std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+    std::cout << "Result " << typeid(T).name() << " precision Halley refinement =    " << result << std::endl;
+    std::cout.precision(saved_precision);
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+    return result;
+  } // digits > 53  - higher precision than double.
+  else // T is double or less precision.
+  {
+    // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection.
+    using namespace boost::math::lambert_w_detail::lambert_w_lookup;
+    // Bracketing sequence  n = (2, 4, 8, 16, 32, 64) for W-1 branch. (0 is -infinity)
+    // Since z is probably quite small, start with lowest n (=2).
+    int n = 2;
+    if (wm1zs[n - 1] > z)
     {
-      // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection.
-      using namespace boost::math::detail::lambert_w_lookup;
-      // Bracketing sequence  n = (2, 4, 8, 16, 32, 64) for W-1 branch. (0 is -infinity)
-      // Since z is probably quite small, start with lowest n (=2).
-      int n = 2;
+      goto bisect;
+    }
+    for (int j = 1; j <= 5; ++j)
+    {
+      n *= 2;
       if (wm1zs[n - 1] > z)
       {
-        goto bisect;
+        goto overshot;
       }
+    }
+    // else z < g[63] == -1.0264389699511303e-26, so Lambert W-1 integer part > 64.
+    // This should not now occur (should be caught by test and code above) so should be a logic_error?
+    return policies::raise_domain_error(function,
+      "Argument z = %1% is too small (< -1.026439e-26) (logic error - please report!)",
+      z, pol);
+  overshot:
+    {
+      int nh = n / 2;
       for (int j = 1; j <= 5; ++j)
       {
-        n *= 2;
-        if (wm1zs[n - 1] > z)
+        nh /= 2; // halve step size.
+        if (nh <= 0)
         {
-          goto overshot;
+          break; // goto bisect;
+        }
+        if (wm1zs[n - nh - 1] > z)
+        {
+          n -= nh;
         }
       }
-      // else z < g[63] == -1.0264389699511303e-26, so Lambert W-1 integer part > 64.
-      // This should not now occur (should be caught by test and code above) so should be a logic_error?
-      return policies::raise_domain_error(function,
-        "Argument z = %1% is too small (< -1.026439e-26) (logic error - please report!)",
-        z, pol);
-    overshot:
-      {
-        int nh = n / 2;
-        for (int j = 1; j <= 5; ++j)
-        {
-          nh /= 2; // halve step size.
-          if (nh <= 0)
-          {
-            break; // goto bisect;
-          }
-          if (wm1zs[n - nh - 1] > z)
-          {
-            n -= nh;
-          }
-        }
-      }
-    bisect:
-      --n;   // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part.
-             // These are used as initial values for bisection.
-    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP
-      std::cout << "Result lookup W-1(" << z << ") bisection between wm1zs[" << n - 1 << "] = " << wm1zs[n - 1] << " and wm1zs[" << n << "] = " << wm1zs[n]
-        << ", bisect mean = " << (wm1zs[n - 1] + wm1zs[n]) / 2 << std::endl;
-    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP
+    }
+  bisect:
+    --n;   // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part.
+           // These are used as initial values for bisection.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP
+    std::cout << "Result lookup W-1(" << z << ") bisection between wm1zs[" << n - 1 << "] = " << wm1zs[n - 1] << " and wm1zs[" << n << "] = " << wm1zs[n]
+      << ", bisect mean = " << (wm1zs[n - 1] + wm1zs[n]) / 2 << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP
 
-      // W0 version
+    // W0 version
     //  // Check precision specified by policy in case can return early.
     //  // Use can set  precision, for example = 7 from lambert_w0(x, policy >() or lambert_w0(x, policy >()
     //  int d2 = policies::digits(); // digits base 2 from policy (default 24 for float, 53 for double).
@@ -1513,150 +1775,172 @@ namespace math
     //    return static_cast((w0zs[n - 1] + w0zs[n]) / 2);
     //  }
 
-      // Check precision specified by policy.
-      int d2 = policies::digits();
-    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
-      int d10 = policies::digits_base10(); // policy template parameter digits10
-      std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
-        << std::endl;
-    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
-      if (d2 < 7)
-      {   // Only 7 binary digits precision required to hold integer size of w0s[65],
-          // so just return the mean of two nearby integral values.
-           // This is a *very* approximate estimate, and perhaps not very useful?
-      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
-        std::cout << "between wm1zs[" << n << "] = " << wm1zs[n + 1] << " <= " << z << " <= " << wm1zs[n] << std::endl;
-        // TODO check this.
-      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
-        return static_cast((wm1zs[n] + wm1zs[n + 1]) / 2);
-      } // d2 < 7
+    // Check precision specified by policy.
+    int d2 = policies::digits();
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+    int d10 = policies::digits_base10(); // policy template parameter digits10
+    std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
+      << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+    if (d2 < 7)
+    {   // Only 7 binary digits precision required to hold integer size of w0s[65],
+        // so just return the mean of two nearby integral values.
+        // This is a *very* approximate estimate, and perhaps not very useful?
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+      std::cout << "between wm1zs[" << n << "] = " << wm1zs[n + 1] << " <= " << z << " <= " << wm1zs[n] << std::endl;
+      // TODO check this.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+      return static_cast((wm1zs[n] + wm1zs[n + 1]) / 2);
+    } // d2 < 7
 
       // Compute bisections is the number of bisections computed from n,
       // such that a single application of the fifth-order Schroeder update formula
       // after the bisections is enough to evaluate Lambert W-1 with (near?) 53-bit accuracy.
       // Fukushima established these by trial and error?
-      int bisections = 11; //  Assume maximum number of bisections will be needed (most common case).
-      if (n >= 8)
+    int bisections = 11; //  Assume maximum number of bisections will be needed (most common case).
+    if (n >= 8)
+    {
+      bisections = 8;
+    }
+    else if (n >= 3)
+    {
+      bisections = 9;
+    }
+    else if (n >= 2)
+    {
+      bisections = 10;
+    }
+    // Bracketing, Fukushima section 2.3, page 82:
+    // (Avoiding using exponential function for speed).
+    // Only use @c lookup_t precision, default double, for bisection (again for speed),
+    // and use later Halley refinement for higher precisions.
+    using lambert_w_lookup::halves;
+    using lambert_w_lookup::sqrtwm1s;
+    lookup_t w = -static_cast(n); // Equation 25,
+    lookup_t y = static_cast(z * wm1es[n - 1]); // Equation 26,
+                                                          // Perform the bisections fractional bisections for necessary precision.
+    for (int j = 0; j < bisections; ++j)
+    { // Equation 27.
+      lookup_t wj = w - halves[j]; // Subtract 1/2, 1/4, 1/8 ...
+      lookup_t yj = y * sqrtwm1s[j]; // Multiply by sqrt(1/e), ...
+      if (wj < yj)
       {
-        bisections = 8;
+        w = wj;
+        y = yj;
       }
-      else if (n >= 3)
-      {
-        bisections = 9;
+    } // for j
+    if (d2 <= 10)
+    { // Only 10 digits2 required (== digits10 = 3 decimal digits precision),
+      // so just return the nearest bisection.
+      // (Might make this test depend on size of T?)
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION
+      std::cout << "W-1 Bisection estimates =            " << w << " " << y << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION
+      return static_cast(w); // Bisection only.
+    }
+    else // More than 10 digits2 precision wanted, so continue with Fukushima's Schroeder refinement.
+    {
+      T result = static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement.
+      if (d2 <= (std::numeric_limits::digits - 3))
+      { // Only enough digits2 required, so just return the Schroeder refined value.
+        // For example, for float, if (d2 <= 22) then
+        // digits-3 returns Schroeder result up to 3 bits might be wrong.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+        std::cout << "Schroeder refinement estimate = " << result << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+        return result; // Schroeder only.
       }
-      else if (n >= 2)
-      {
-        bisections = 10;
-      }
-      // Bracketing, Fukushima section 2.3, page 82:
-      // (Avoiding using exponential function for speed).
-      // Only use @c lookup_t precision, default double, for bisection (again for speed),
-      // and use later Halley refinement for higher precisions.
-      using lambert_w_lookup::halves;
-      using lambert_w_lookup::sqrtwm1s;
-      lookup_t w = -static_cast(n); // Equation 25,
-      lookup_t y = static_cast(z * wm1es[n - 1]); // Equation 26,
-      // Perform the bisections fractional bisections for necessary precision.
-      for (int j = 0; j < bisections; ++j)
-      { // Equation 27.
-        lookup_t wj = w - halves[j]; // Subtract 1/2, 1/4, 1/8 ...
-        lookup_t yj = y * sqrtwm1s[j]; // Multiply by sqrt(1/e), ...
-        if (wj < yj)
-        {
-          w = wj;
-          y = yj;
-        }
-      } // for j
-      if (d2 <= 10)
-      { // Only 10 digits2 required (== digits10 = 3 decimal digits precision),
-        // so just return the nearest bisection.
-        // (Might make this test depend on size of T?)
-      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION
-        std::cout << "W-1 Bisection estimates =            " << w << " " << y << std::endl;
-      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION
-        return static_cast(w); // Bisection only.
-      }
-      else // More than 10 digits2 precision wanted, so continue with Fukushima's Schroeder refinement.
-      {
-        T result = static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement.
-        if (d2 <= (std::numeric_limits::digits - 3))
-        { // Only enough digits2 required, so just return the Schroeder refined value.
-          // For example, for float, if (d2 <= 22) then
-          // digits-3 returns Schroeder result up to 3 bits might be wrong.
-        #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1
-          std::cout << "Schroeder refinement estimate = " << result << std::endl;
-        #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
-          return result; // Schroeder only.
-        }
       else // Perform additional Halley refinement(s) to ensure that
            // get a near as possible to correct result (usually +/- epsilon).
       {
-        result = halley_update(result, z, pol);
-      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+        result = lambert_w_halley_iterate(result, z);
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
         std::cout.precision(std::numeric_limits::max_digits10);
         std::cout << "Halley refinement estimate =    " << result << std::endl;
         std::cout.precision(saved_precision);
-      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
         return result; // Halley
       } // schroeder or Schroeder and Halley.
-      } // more than 10 digits2
-    } // template T lambert_wm1_imp(const T z)
-  }
-} // namespace detail ////////////////////////////////////////////////////////////
+    } // more than 10 digits2
+  } 
+} // template T lambert_wm1_imp(const T z)
+} // namespace lambert_w_detail
 
-  // User Lambert W0 and Lambert W-1 functions.
+/////////////////////  User Lambert w functions. //////////////////////////
 
-  //! W0 branch, -1/e <= z < max(z)
-  //! W-1 branch -1/e >= z > min(z)
+//! Lambert W0 using User-defined policy.
+template 
+inline
+typename tools::promote_args::type
+lambert_w0(T z, const Policy& pol)
+{
+   // Promote integer or expression template arguments to double,
+   // without doing any other internal promotion like float to double.
+   typedef typename tools::promote_args::type result_type;
+   //
+   // Work out what precision has been selected, based on the Policy and the
+   // number type,
+   typedef typename policies::precision::type precision_type;
+   // and then select the correct implementation based on that (not the type T):
+   typedef mpl::int_<
+      (precision_type::value == 0) || (precision_type::value > 53) ?
+      0  // either variable precision (0), or greater than 64-bit precision.
+      : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
+      : 2  // 64-bit (probably double) precision.
+   > tag_type;
 
-  //! Lambert W0 using User-defined policy.
-  template 
-  inline
-  typename tools::promote_args::type
-  lambert_w0(T z, const Policy& pol)
-  {
-    // Promote integer or expression template arguments to double,
-    // without doing any other internal promotion like float to double.
-    typedef typename tools::promote_args::type result_type;
-    return detail::lambert_w0_imp(result_type(z), pol); //
-  } // lambert_w0(T z, const Policy& pol)
+   return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type());
+} // lambert_w0(T z, const Policy& pol)
 
   //! Lambert W0 using default policy.
-  template 
-  inline
-  typename tools::promote_args::type
-  lambert_w0(T z)
-  {
-    typedef typename tools::promote_args::type result_type;
-    return detail::lambert_w0_imp(result_type(z), policies::policy<>());
-  } // lambert_w0(T z)
+template  >
+inline
+typename tools::promote_args::type
+lambert_w0(T z)
+{
+  // Promote integer or expression template arguments to double,
+  // without doing any other internal promotion like float to double.
+   typedef typename tools::promote_args::type result_type;
 
+   // Work out what precision has been selected, based on the Policy and the number type.
+   // For the default policy version, we want the *default policy* precision for T.
+   typedef typename policies::precision::type precision_type;
+   // and then select the correct implementation based on that (not the type T):
+   typedef mpl::int_<
+     (precision_type::value == 0) || (precision_type::value > 53) ?
+     0  // either variable precision (0), or greater than 64-bit precision.
+     : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
+     : 2  // 64-bit (probably double) precision.
+   > tag_type;
+
+   return lambert_w_detail::lambert_w0_imp(result_type(z), policies::policy<>(), tag_type()); //
+} // lambert_w0(T z)
 
   //! W-1 branch (-max(z) < z <= -1/e).
 
   //! Lambert W-1 using User-defined policy.
-  template 
-  inline
-  typename tools::promote_args::type
-  lambert_wm1(T z, const Policy& pol)
-  {
-    // Promote integer or expression template arguments to double,
-    // without doing any other internal promotion like float to double.
-    typedef typename tools::promote_args::type result_type;
-    return detail::lambert_wm1_imp(result_type(z), pol); //
-  }
+template 
+inline
+typename tools::promote_args::type
+lambert_wm1(T z, const Policy& pol)
+{
+  // Promote integer or expression template arguments to double,
+  // without doing any other internal promotion like float to double.
+  typedef typename tools::promote_args::type result_type;
+  return lambert_w_detail::lambert_wm1_imp(result_type(z), pol); //
+}
 
-  //! Lambert W-1 using default policy.
-  template 
-  inline
-  typename tools::promote_args::type
-  lambert_wm1(T z)
-  {
-    typedef typename tools::promote_args::type result_type;
-    return detail::lambert_wm1_imp(result_type(z), policies::policy<>());
-  } // lambert_wm1(T z)
+//! Lambert W-1 using default policy.
+template 
+inline
+typename tools::promote_args::type
+lambert_wm1(T z)
+{
+  typedef typename tools::promote_args::type result_type;
+  return lambert_w_detail::lambert_wm1_imp(result_type(z), policies::policy<>());
+} // lambert_wm1(T z)
 
-  } // namespace math
-} // namespace boost
 
-#endif //  #ifndef BOOST_MATH_SF_LAMBERT_W_HPP
+}} //boost::math namespaces
+
+#endif // #ifdef BOOST_MATH_LAMBERTW0_HPP
diff --git a/include/boost/math/special_functions/lambert_w_lookup_table.ipp b/include/boost/math/special_functions/lambert_w_lookup_table.ipp
index c2fbb8b3c..718c73498 100644
--- a/include/boost/math/special_functions/lambert_w_lookup_table.ipp
+++ b/include/boost/math/special_functions/lambert_w_lookup_table.ipp
@@ -1,23 +1,24 @@
+// Copyright Paul A. Bristow 2017.
+// 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)
+
 // I:/modular-boost/libs/math/include/boost/math/special_functions/lambert_w_lookup_table.ipp
-// A collection of 128-bit precision integral Lambert W values computed using 37 decimal digits precision.
+
+// A collection of 128-bit precision integral z argument Lambert W values computed using 37 decimal digits precision.
 // C++ floating-point precision is 128-bit long double.
 // Output as 53 decimal digits, suffixed L.
 
 // C++ floating-point type is provided by lambert_w.hpp typedef.
 // For example: typedef lookup_t double; (or float or long double)
 
-// Written by I:\modular-boost\libs\math\test\lambert_w_lookup_table_generator.cpp Fri Nov  3 11:56:21 2017
-
-// Copyright Paul A. Bristow 2017.
-// 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)
+// Written by I:\modular-boost\libs\math\test\lambert_w_lookup_table_generator.cpp Thu Jan 25 16:52:07 2018
 
 // Sizes of arrays of z values for Lambert W[0], W[1] ... W[64]"nand W[-1], W[-2] ... W[-64].
 
 namespace boost {
 namespace math {
-namespace detail {
+namespace lambert_w_detail {
 namespace lambert_w_lookup
 { 
 BOOST_STATIC_CONSTEXPR std::size_t  noof_sqrts = 12;
diff --git a/include/boost/math/special_functions/lambert_w_pb.hpp b/include/boost/math/special_functions/lambert_w_pb.hpp
new file mode 100644
index 000000000..74eac4943
--- /dev/null
+++ b/include/boost/math/special_functions/lambert_w_pb.hpp
@@ -0,0 +1,1662 @@
+// Copyright Paul A. Bristow 2016, 2017.
+
+// 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).
+
+/*
+Implementation of the Fukushima algorithm for the Lambert W0 and W-1 real-only functions.
+
+This code is based on the algorithm by
+Toshio Fukushima, 
+"Precise and fast computation of Lambert W-functions without transcendental function evaluations",
+J. Comp. Appl. Math. 244 (2013) 77-89,
+and its author's FORTRAN code,
+and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si
+based on the algorithm and a FORTRAN version of Toshio Fukushima.
+
+Some macros that will show some (or much) diagnostic values if #defined.
+//[boost_math_instrument_lambert_w_macros
+
+// #define-able macros
+BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics.
+BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics.
+BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics.
+BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION // Precision.
+BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_W0 // Halley refinement diagnostics only for W0 branch.
+BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_WM1 // Halley refinement diagnostics only for W-1 branch.
+BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26
+BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE // K > 64, z > 3.9904954117194348e+29
+BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics.
+BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series.
+BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement.
+BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate.
+BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity.
+BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS  // Show evaluation of series for small z.
+BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from W0 lookup table.
+BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table.
+//] [/boost_math_instrument_lambert_w_macros]
+*/
+
+#ifndef BOOST_MATH_SF_LAMBERT_W_HPP
+#define BOOST_MATH_SF_LAMBERT_W_HPP
+
+#ifdef _MSC_VER
+#  pragma warning (disable: 4127) // warning C4127: conditional expression is constant
+#endif // _MSC_VER
+
+#include 
+#include 
+#include 
+#include 
+#include  // for log (1 + x)
+#include  // For exp_minus_one == 3.67879441171442321595523770161460867e-01.
+#include  // for float_distance
+#include  // Link fails for pow without this, even though uses std::pow.
+#include  // series functor.
+#include   // polynomial.
+#include   // evaluate_polynomial.
+#include 
+#include 
+#include  // boost::math::tools::max_value().
+#include  //  Macro BOOST_MATH_TEST_VALUE.
+
+#include 
+#include 
+#include 
+#include 
+
+// Needed for testing and diagnostics only.
+#include 
+#include 
+#include   // For float_distance.
+//#include  // For create_test_value and macro BOOST_MATH_TEST_VALUE.
+
+typedef double lookup_t; // Type for lookup table (double or float, or even long double?)
+
+//#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp"
+ #include "lambert_w_lookup_table.ipp" // Boost.Math version.
+
+namespace boost
+{
+namespace math
+{
+  namespace detail
+  {
+
+  //! \brief Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944.
+  //! Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]]
+  //! Wolfram command used to obtain 40 series terms at 50 decimal digit precision was
+  //! N[InverseSeries[Series[Sqrt[2(p Exp[1 + p] + 1)], { p,-1,40 }]], 50]
+  //! -1+p-p^2/3+(11 p^3)/72-(43 p^4)/540+(769 p^5)/17280-(221 p^6)/8505+(680863 p^7)/43545600 ...
+  //! Decimal values of specifications for built-in floating-point types below
+  //! are at least 21 digits precision == max_digits10 for long double.
+  //! Longer decimal digits strings are rationals evaluated using Wolfram.
+
+    template
+    T lambert_w_singularity_series(const T p)
+    {
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES
+      std::size_t saved_precision = std::cout.precision(3);
+      std::cout << "Singularity_series Lambert_w p argument = " << p << std::endl;
+      std::cout
+        //<< "Argument Type = " << typeid(T).name()
+        //<< ", max_digits10 = " << std::numeric_limits::max_digits10
+        //<< ", epsilon = " << std::numeric_limits::epsilon()
+      << std::endl;
+      std::cout.precision(saved_precision);
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES
+
+      static const T q[] =
+      {
+        -static_cast(1), // j0
+        +T(1), // j1
+        -T(1) / 3, // 1/3  j2
+        +T(11) / 72, // 0.152777777777777778, // 11/72 j3
+        -T(43) / 540, // 0.0796296296296296296, // 43/540 j4
+        +T(769) / 17280, // 0.0445023148148148148,  j5
+        -T(221) / 8505, // 0.0259847148736037625,  j6
+        //+T(0.0156356325323339212L), // j7
+        //+T(0.015635632532333921222810111699000587889476778365667L), // j7 from Wolfram N[680863/43545600, 50]
+        +T(680863uLL) / 43545600uLL, // +0.0156356325323339212, j7
+        //-T(0.00961689202429943171L), // j8
+        -T(1963uLL) / 204120uLL, // 0.00961689202429943171, j8
+        //-T(0.0096168920242994317068391142465216539290613364687439L), // j8 from Wolfram N[1963/204120, 50]
+        +T(226287557uLL) / 37623398400uLL, // 0.00601454325295611786, j9
+        -T(5776369uLL) / 1515591000uLL, // 0.00381129803489199923, j10
+        //+T(0.00244087799114398267L), j11 0.0024408779911439826658968585286437530215699919795550
+        +T(169709463197uLL) / 69528040243200uLL, // j11
+        // -T(0.00157693034468678425L), // j12  -0.0015769303446867842539234095399314115973161850314723
+        -T(1118511313uLL) / 709296588000uLL, // j12
+        +T(667874164916771uLL) / 650782456676352000uLL, // j13
+        //+T(0.00102626332050760715L), // j13 0.0010262633205076071544375481533906861056468041465973
+        -T(500525573uLL) / 744761417400uLL, // j14
+        // -T(0.000672061631156136204L), j14
+        //+T(1003663334225097487uLL) / 234281684403486720000uLL, // j15 0.00044247306181462090993020760858473726479232802068800 error C2177: constant too big
+        //+T(0.000442473061814620910L, // j15
+        BOOST_MATH_TEST_VALUE(T, +0.000442473061814620910), // j15
+        // -T(0.000292677224729627445L), // j16
+        BOOST_MATH_TEST_VALUE(T, -0.000292677224729627445), // j16
+        //+T(0.000194387276054539318L), // j17
+        BOOST_MATH_TEST_VALUE(T, 0.000194387276054539318), // j17
+        //-T(0.000129574266852748819L), // j18
+        BOOST_MATH_TEST_VALUE(T, -0.000129574266852748819), // j18
+        //+T(0.0000866503580520812717L), // j19 N[+1150497127780071399782389/13277465363600276402995200000, 50] 0.000086650358052081271660451590462390293190597827783288
+        BOOST_MATH_TEST_VALUE(T, +0.0000866503580520812717), // j19
+        //-T(0.0000581136075044138168L) // j20  N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913
+        // -T(2853534237182741069uLL) / 49102686267859224000000uLL  // j20 // error C2177: constant too big,
+        // so must use BOOST_MATH_TEST_VALUE(T, ) format in hope of using suffix Q for quad or decimal digits string for others.
+         //-T(0.000058113607504413816772205464778828177256611844221913L), // j20  N[2853534237182741069/49102686267859224000000, 50] 0.000058113607504413816772205464778828177256611844221913
+        BOOST_MATH_TEST_VALUE(T, -0.000058113607504413816772205464778828177256611844221913) // j20  - last used by Fukushima
+        // More terms don't seem to give any improvement (worse in fact) and are not use for many z values.
+        //BOOST_MATH_TEST_VALUE(T, +0.000039076684867439051635395583044527492132109160553593), // j21
+        //BOOST_MATH_TEST_VALUE(T, -0.000026338064747231098738584082718649443078703982217219), // j22
+        //BOOST_MATH_TEST_VALUE(T, +0.000017790345805079585400736282075184540383274460464169), // j23
+        //BOOST_MATH_TEST_VALUE(T, -0.000012040352739559976942274116578992585158113153190354), // j24
+        //BOOST_MATH_TEST_VALUE(T, +8.1635319824966121713827512573558687050675701559448E-6), // j25
+        //BOOST_MATH_TEST_VALUE(T, -5.5442032085673591366657251660804575198155559225316E-6) // j26
+       // -T(5.5442032085673591366657251660804575198155559225316E-6L) // j26
+      // 21 to 26 Added for long double.
+      }; // static const T q[]
+
+      /*
+      // Temporary copy of original double values for comparison; these are reproduced well.
+      static const T q[] =
+      {
+        -1L,  // j0
+        +1L,  // j1
+        -0.333333333333333333L, // 1/3 j2
+        +0.152777777777777778L, // 11/72 j3
+        -0.0796296296296296296L, // 43/540
+        +0.0445023148148148148L,
+        -0.0259847148736037625L,
+        +0.0156356325323339212L,
+        -0.00961689202429943171L,
+        +0.00601454325295611786L,
+        -0.00381129803489199923L,
+        +0.00244087799114398267L,
+        -0.00157693034468678425L,
+        +0.00102626332050760715L,
+        -0.000672061631156136204L,
+        +0.000442473061814620910L,
+        -0.000292677224729627445L,
+        +0.000194387276054539318L,
+        -0.000129574266852748819L,
+        +0.0000866503580520812717L,
+        -0.0000581136075044138168L // j20
+      };
+      */
+
+      // Decide how many series terms to use, increasing as z approaches the singularity,
+      // balancing run-time versus computational noise from round-off.
+      // In practice, we truncate the series expansion at a certain order.
+      // If the order is too large, not only does the amount of computation increase,
+      // but also the round-off errors accumulate.
+      // See Fukushima equation 35, page 85 for logic of choice of number of series terms.
+
+      BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs.
+
+      const T absp = abs(p);
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS
+      {
+        int terms = 20; // Default to using all terms.
+        if (absp < 0.001150)
+        { // Very near singularity.
+          terms = 6;
+        }
+        else if (absp < 0.0766)
+        { // Near singularity.
+          terms = 10;
+        }
+        std::streamsize saved_precision = std::cout.precision(3);
+        std::cout << "abs(p) = " << absp << ", terms = " << terms << std::endl;
+        std::cout.precision(saved_precision);
+      }
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS
+
+    if (absp < 0.01159)
+    { // Only 6 near-singularity series terms are useful.
+      return
+        -1 +
+        p*(1 +
+          p*(q[2] +
+            p*(q[3] +
+              p*(q[4] +
+                p*(q[5] +
+                  p*q[6]
+                  )))));
+    }
+    else if (absp < 0.0766) // Use 10 near-singularity series terms.
+    { // Use 10 near-singularity series terms.
+      return
+        -1 +
+        p*(1 +
+          p*(q[2] +
+            p*(q[3] +
+              p*(q[4] +
+                p*(q[5] +
+                  p*(q[6] +
+                    p*(q[7] +
+                      p*(q[8] +
+                        p*(q[9] +
+                          p*q[10]
+                          )))))))));
+    }
+    else
+    { // Use all 20 near-singularity series terms.
+      return
+        -1 +
+        p*(1 +
+          p*(q[2] +
+            p*(q[3] +
+              p*(q[4] +
+                p*(q[5] +
+                  p*(q[6] +
+                    p*(q[7] +
+                      p*(q[8] +
+                        p*(q[9] +
+                          p*(q[10] +
+                            p*(q[11] +
+                              p*(q[12] +
+                                p*(q[13] +
+                                  p*(q[14] +
+                                    p*(q[15] +
+                                      p*(q[16] +
+                                        p*(q[17] +
+                                          p*(q[18] +
+                                            p*(q[19] +
+                                              p*q[20] // Last Fukushima term.
+                                               )))))))))))))))))));
+      //                                                + // more terms for more precise T: long double ...
+      //// but makes almost no difference, so don't use more terms?
+      //                                          p*q[21] +
+      //                                            p*q[22] +
+      //                                              p*q[23] +
+      //                                                p*q[24] +
+      //                                                 p*q[25]
+      //                                         )))))))))))))))))));
+    }
+  } // template T lambert_w_singularity_series(const T p)
+
+  /////////////////////////////////////////////////////////////////////////////////////////////
+
+  //! \brief Series expansion used near zero (abs(z) < 0.05).
+  //! \details 
+  //! Coefficients of the inverted series expansion of the Lambert W function around z = 0.
+  //! Tosio Fukushima always uses all 17 terms of a Taylor series computed using Wolfram with
+  //!   InverseSeries[Series[z Exp[z],{z,0,17}]]
+  //! Tosio Fukushima / Journal of Computational and Applied Mathematics 244 (2013) page 86.
+
+  //! Decimal values of specifications for built-in floating-point types below
+  //! are 21 digits precision == max_digits10 for long double.
+  //! Care Some coefficients might overflow some fixed_point types.
+
+  //! This version is intended to allow use by user-defined types
+  //! like Boost.Multiprecision quad and cpp_dec_float types.
+  //! The three specializations below for built-in float, double 
+  //! (and perhaps long double) will be chosen in preference for these types.
+
+  //! This version uses rationals computed by Wolfram as far as possible,
+  //! limited by maximum size of uLL integers.
+  //! For higher term, uses decimal digit strings computed by Wolfram up to the maximum possible using uLL rationals,
+  //! and then higher coefficients are computed as necessary using function lambert_w0_small_z_series_term
+  //! until the precision required by the policy is achieved.
+  //! InverseSeries[Series[z Exp[z],{z,0,34}]] also computed.
+
+  // Series evaluation for LambertW(z) as z -> 0.
+  // See http://functions.wolfram.com/ElementaryFunctions/ProductLog/06/01/01/0003/
+  //  http://functions.wolfram.com/ElementaryFunctions/ProductLog/06/01/01/0003/MainEq1.L.gif
+
+  //! \brief  lambert_w0_small_z uses a tag_type to select a variant depending on the size of the type.
+  //! The Lambert W is computed by lambert_w0_small_z for small z.
+  //! The cutoff for z smallness determined by Tosio Fukushima by trial and error is (abs(z) < 0.05),
+  //! but the optimum might be a function of the size of the type of z.
+
+  //! \details
+  //! The tag_type selection is based on the value @c std::numeric_limits::max_digits10.
+  //! This allows distinguishing between long double types that commonly vary between 64 and 80-bits,
+  //! and also compilers that have a float type using 64 bits and/or long double using 128-bits.
+  //! It assumes that max_digits10 is defined correctly or this might fail to make the correct selection.
+  //! causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.
+  //! Cannot switch on @c std::numeric_limits<>::max() because comparison values may overflow the compiler limit.
+  //! Cannot switch on @c std::numeric_limits::max_exponent10() 
+  //! because both 80 and 128 bit floating-point implmentations use 11 bits for the exponent.
+  //! So must rely on @c std::numeric_limits::max_digits10.
+
+  //! Specialization of float zero series expansion used for small z (abs(z) < 0.05).
+  //! Specializations of lambert_w0_small_z for built-in types.
+  //! These specializations should be chosen in preference to T version.
+  //! For example: lambert_w0_small_z(0.001F) should use the float version.
+  //! (Parameter Policy is not used by built-in types when all terms are used during an inline computation,
+  //! but for the tag_type selection to work, they all must include Policy in their signature.
+
+  // Forward declaration of variants of lambert_w0_small_z.
+  template 
+  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<0> const&);   //  for float (32-bit) type.
+
+  template 
+  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<1> const&);   //  for double (64-bit) type.
+
+  template 
+  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<2> const&);   //  for long double (double extended 80-bit) type.
+
+  template 
+  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&);   //  for float128
+
+  template 
+  T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&);   //  Generic multiprecision T.
+
+  // Set tag_type depending on max_digits10.
+  template 
+  T lambert_w0_small_z(T x, const Policy& pol)
+  {
+    typedef boost::mpl::int_
+      <
+      std::numeric_limits::max_digits10 <= 9 ? 0 :  //  for float
+      std::numeric_limits::max_digits10 <= 17 ? 1 : //  for double 64-bit
+      std::numeric_limits::max_digits10 <= 22 ? 2 :  //  for  80-bit double extended
+      std::numeric_limits::max_digits10 < 37 ? 3 : //  for float128  128-bit quad
+      4 // Generic multiprecision types.
+      > tag_type;
+    // std::cout << "tag type = " << tag_type << std::endl; // error C2275: 'tag_type': illegal use of this type as an expression
+    return lambert_w0_small_z(x, pol, tag_type());
+  } // template  T lambert_w0_small_z(T x)
+
+  //! Specialization of float (32-bit) series expansion used for small z (abs(z) < 0.05).
+  // Only 9 Coefficients are computed to 21 decimal digits precision, ample for 32-bit float used by most platforms.
+  // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
+  // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
+  // as proposed by Tosio Fukushima and implemented by Darko Veberic.
+
+  template 
+  T lambert_w0_small_z(T z, const Policy&, boost::mpl::int_<0> const&)
+  {
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    std::cout << "float lambert_w0_small_z called with z = " << z << " using " << 9 << " terms of precision "
+      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    return
+      z*(1 - // j1 z^1 term = 1
+        z*(1 -  // j2 z^2 term = -1
+          z*(static_cast(3uLL) / 2uLL - // 3/2 // j3 z^3 term = 1.5.
+            z*(2.6666666666666666667F -  // 8/3 // j4
+              z*(5.2083333333333333333F - // -125/24 // j5
+                z*(10.8F - // j6
+                  z*(23.343055555555555556F - // j7
+                    z*(52.012698412698412698F - // j8
+                      z*118.62522321428571429F)))))))); // j9
+  } // template    T lambert_w0_small_z(T x, mpl::int_<0> const&)
+
+    //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
+    // 17 Coefficients are computed to 21 decimal digits precision suitable for 64-bit double used by most platforms.
+    // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
+    // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], as proposed by Tosio Fukushima and implemented by Veberic.
+
+  template 
+  T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<1> const&)
+  {
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    std::cout << "double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision, "
+      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    T  result =
+      z*(1. - // j1 z^1
+        z*(1. -  // j2 z^2
+          z*(1.5 - // 3/2 // j3 z^3
+            z*(2.6666666666666666667 -  // 8/3 // j4
+              z*(5.2083333333333333333 - // -125/24 // j5
+                z*(10.8 - // j6
+                  z*(23.343055555555555556 - // j7
+                    z*(52.012698412698412698 - // j8
+                      z*(118.62522321428571429 - // j9
+                        z*(275.57319223985890653 - // j10
+                          z*(649.78717234347442681 - // j11
+                            z*(1551.1605194805194805 - // j12
+                              z*(3741.4497029592385495 - // j13
+                                z*(9104.5002411580189358 - // j14
+                                  z*(22324.308512706601434 - // j15
+                                    z*(55103.621972903835338 - // j16
+                                      z*136808.86090394293563)))))))))))))))); // j17 z^17
+    return result;
+  }  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+
+     //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
+     // 21 Coefficients are computed to 21 decimal digits precision suitable for 80-bit long double used by some
+     // platforms including GCC and Clang when generating for Intel X86 floating-point processors with 80-bit operations enabled (the default).
+     // (This is NOT used by Microsoft Visual Studio where double and long always both use only 64-bit type.)
+  template 
+  T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<2> const&)
+  {
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    std::cout << "long double (80-bit double extended) lambert_w0_small_z called with z = " << z << " using " << 21 << " terms of precision "
+      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    T  result =
+      z*(1.L - // j1 z^1
+        z*(1.L -  // j2 z^2
+          z*(1.5L - // 3/2 // j3
+            z*(2.6666666666666666667L -  // 8/3 // j4
+              z*(5.2083333333333333333L - // -125/24 // j5
+                z*(10.800000000000000000L - // j6
+                  z*(23.343055555555555556L - // j7
+                    z*(52.012698412698412698L - // j8
+                      z*(118.62522321428571429L - // j9
+                        z*(275.57319223985890653L - // j10
+                          z*(649.78717234347442681L - // j11
+                            z*(1551.1605194805194805L - // j12
+                              z*(3741.4497029592385495L - // j13
+                                z*(9104.5002411580189358L - // j14
+                                  z*(22324.308512706601434L - // j15
+                                    z*(55103.621972903835338L - // j16
+                                      z*(136808.86090394293563L - // j17 z^17  last term used by Fukushima double.
+                                        z*(341422.050665838363317L - // z^18
+                                          z*(855992.9659966075514633L - // z^19
+                                            z*(2.154990206091088289321e6L - // z^20
+                                              z*5.4455529223144624316423e6L   // z^21
+                                              ))))))))))))))))))));
+
+    return result;
+  }  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+
+    //! Specialization of long double (128-bit quad) series expansion used for small z (abs(z) < 0.05).
+    // 34 Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
+    // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
+    // and are suffixed by L as they are assumed of type long double.
+    // (This is NOT used for 128-bit quad which required a suffix Q
+    // nor multiprecision type cpp_bin_float_quad that can only be initialised at full precision of the type
+    // using a decimal digit string like "2.6666666666666666666666666666666666666666666666667".)
+
+  template 
+  T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&)
+  {
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    std::cout << "long double (128-bit quad) lambert_w0_small_z called with z = " << z << " using " << 34 << " terms of precision "
+      << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    T  result =
+      z*(1.L - // j1
+        z*(1.L -  // j2
+          z*(1.5L - // 3/2 // j3
+            z*(2.6666666666666666666666666666666666L -  // 8/3 // j4
+              z*(5.2052083333333333333333333333333333L - // -125/24 // j5
+                z*(-10.800000000000000000000000000000000L - // j6
+                  z*(23.343055555555555555555555555555555L - // j7
+                    z*(52.0126984126984126984126984126984126L - // j8
+                      z*(118.625223214285714285714285714285714L - // j9
+                        z*(275.57319223985890652557319223985890L - // * z ^ 10 - // j10
+                          z*(649.78717234347442680776014109347442680776014109347L - // j11
+                            z*(1551.1605194805194805194805194805194805194805194805L - // j12
+                              z*(3741.4497029592385495163272941050718828496606274384L - // j13
+                                z*(9104.5002411580189357967135744913522691300469078247L - // j14
+                                  z*(22324.308512706601434280005708577137148565719994291L - // j15
+                                    z*(55103.621972903835337697771560205422639285073147507L - // j16
+                                      z*136808.86090394293563342215789305736395683485630576L)))))))))))))))); // j17
+    return result;
+  }  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+
+  //! Series functor to compute series term using pow and factorial.
+  //! \details Functor is called after evaluating polynomial with the coefficients as rationals below.
+  template 
+  struct lambert_w0_small_z_series_term
+  {
+    typedef T result_type;
+    //! \param _z Lambert W argument z.
+    //! \param -term  -pow<18>(z) / 6402373705728000uLL
+    //! \param _k number of terms == initially 18
+
+    //  Note *after* evaluating N terms, its internal state has k = N and term = (-1)^N z^N.
+
+    lambert_w0_small_z_series_term(T _z, T _term, int _k)
+      : k(_k), z(_z), term(_term) { }
+
+    T operator()()
+    { // Called by sum_series until needs precision set by factor (policy::get_epsilon).
+      using std::pow;
+      ++k;
+      term *= -z / k;
+      //T t = pow(z, k) * pow(T(k), -1 + k) / factorial(k); // (z^k * k(k-1)^k) / k!
+      T result = term * pow(T(k), -1 + k); // term * k^(k-1)
+                                           // std::cout << " k = " << k << ", term = " << term << ", result = " << result << std::endl;
+      return result; //
+    }
+  private:
+    int k;
+    T z;
+    T term;
+  }; // template  struct lambert_w0_small_z_series_term
+
+  //! Generic variant for T a User-defined types like Boost.Multiprecision.
+  template 
+  inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&)
+  {
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    std::cout << "Generic lambert_w0_small_z called with z = " << z << " using as many terms needed for precision." << std::endl;
+    std::cout << "Argument z is of type " << typeid(T).name() << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+
+    // First several terms of the series are tabulated and evaluated as a polynomial:
+    // this will save us a bunch of expensive calls to pow.
+    // Then our series functor is initialized "as if" it had already reached term 18,
+    // enough evaluation of built-in 64-bit double and float (and 80-bit long double?) types.
+
+    // Coefficients should be stored such that the coefficients for the x^i terms are in poly[i].
+    static const T coeff[] =
+    {
+      0, // z^0  Care: zeroth term needed by tools::evaluate_polynomial, but not in the Wolfram equation, so indexes are one different!
+      1, // z^1 term.
+      -1, // z^2 term
+      static_cast(3uLL) / 2uLL, // z^3 term.
+      -static_cast(8uLL) / 3uLL, // z^4
+      static_cast(125uLL) / 24uLL, // z^5
+      -static_cast(54uLL) / 5uLL, // z^6
+      static_cast(16807uLL) / 720uLL, // z^7
+      -static_cast(16384uLL) / 315uLL, // z^8
+      static_cast(531441uLL) / 4480uLL, // z^9
+      -static_cast(156250uLL) / 567uLL, // z^10
+      static_cast(2357947691uLL) / 3628800uLL, // z^11
+      -static_cast(2985984uLL) / 1925uLL, // z^12
+      static_cast(1792160394037uLL) / 479001600uLL, // z^13
+      -static_cast(7909306972uLL) / 868725uLL, // z^14
+      static_cast(320361328125uLL) / 14350336uLL, // z^15
+      -static_cast(35184372088832uLL) / 638512875uLL, // z^16
+      static_cast(2862423051509815793uLL) / 20922789888000uLL, // z^17 term
+      -static_cast(5083731656658uLL) / 14889875uLL,
+      // z^18 term. = 136808.86090394293563342215789305735851647769682393
+
+      // z^18 is biggest that can be computed as rational using the largest possible uLL integers,
+      // so higher terms cannot be potentially compiler-computed as uLL rationals.
+      // Wolfram (5083731656658 z ^ 18) / 14889875 or
+      // -341422.05066583836331735491399356945575432970390954 z^18
+
+      // See note below calling the functor to compute another term,
+      // sufficient for 80-bit long double precision.
+      // Wolfram -341422.05066583836331735491399356945575432970390954 z^19 term.
+      // (5480386857784802185939 z^19)/6402373705728000
+      // But now this variant is not used to compute long double
+      // as specializations are provided above.
+    }; // static const T coeff[]
+
+       /*
+       Table of 19 computed coefficients:
+
+       #0 0
+       #1 1
+       #2 -1
+       #3 1.5
+       #4 -2.6666666666666666666666666666666665382713370408509
+       #5 5.2083333333333333333333333333333330765426740817019
+       #6 -10.800000000000000000000000000000000616297582203915
+       #7 23.343055555555555555555555555555555076212991619177
+       #8 -52.012698412698412698412698412698412659282693193402
+       #9 118.62522321428571428571428571428571146835390992496
+       #10 -275.57319223985890652557319223985891400375196748314
+       #11 649.7871723434744268077601410934743969785223845882
+       #12 -1551.1605194805194805194805194805194947599566007429
+       #13 3741.4497029592385495163272941050719510009019331763
+       #14 -9104.5002411580189357967135744913524243896052869184
+       #15 22324.308512706601434280005708577137322392070452582
+       #16 -55103.621972903835337697771560205423203318720697224
+       #17 136808.86090394293563342215789305735851647769682393
+       136808.86090394293563342215789305735851647769682393   == Exactly same as Wolfram computed value.
+       #18 -341422.05066583836331735491399356947486381600607416
+       341422.05066583836331735491399356945575432970390954  z^19  Wolfram value differs at 36 decimal digit, as expected.
+       */
+
+    using boost::math::policies::get_epsilon; // for type T.
+    using boost::math::tools::sum_series;
+    using boost::math::tools::evaluate_polynomial;
+    // http://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/roots/rational.html
+
+    // std::streamsize prec = std::cout.precision(std::numeric_limits ::max_digits10);
+
+    T result = evaluate_polynomial(coeff, z);
+    //  template 
+    //  V evaluate_polynomial(const T(&poly)[N], const V& val);
+    // Size of coeff found from N
+    //std::cout << "evaluate_polynomial(coeff, z); == " << result << std::endl;
+    //std::cout << "result = " << result << std::endl;
+    // It's an artefact of the way I wrote the functor: *after* evaluating N
+    // terms, its internal state has k = N and term = (-1)^N z^N.  So after
+    // evaluating 18 terms, we initialize the functor to the term we've just
+    // evaluated, and then when it's called, it increments itself to the next term.
+    // So 18!is 6402373705728000, which is where that comes from.
+
+    // The 19th coefficient of the polynomial is actually, 19 ^ 18 / 19!=
+    // 104127350297911241532841 / 121645100408832000 which after removing GCDs
+    // reduces down to Wolfram rational 5480386857784802185939 / 6402373705728000.
+    // Wolfram z^19 term +(5480386857784802185939 z^19) /6402373705728000
+    // +855992.96599660755146336302506332246623424823099755 z^19
+
+    //! Evaluate Functor.
+    lambert_w0_small_z_series_term s(z, -pow<18>(z) / 6402373705728000uLL, 18);
+
+    // Temporary to list the coefficients.
+    //std::cout << " Table of coefficients" << std::endl;
+    //std::streamsize saved_precision = std::cout.precision(50);
+    //for (size_t i = 0; i != 19; i++)
+    //{
+    //  std::cout << "#" << i << " " << coeff[i] << std::endl;
+    //}
+    //std::cout.precision(saved_precision);
+
+    boost::uintmax_t max_iter = policies::get_max_series_iterations(); // Max iterations from policy.
+  #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+    std::cout << "max iter from policy = " << max_iter << std::endl;
+    // //   max iter from policy = 1000000 is default.
+  #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+
+    result = sum_series(s, get_epsilon(), max_iter, result);
+    // result == evaluate_polynomial.
+    //sum_series(Functor& func, int bits, boost::uintmax_t& max_terms, const U& init_value)
+    // std::cout << "sum_series(s, get_epsilon(), max_iter, result); = " << result << std::endl;
+
+    //T epsilon = get_epsilon();
+    //std::cout << "epilson from policy = " << epsilon << std::endl;
+    // epilson from policy = 1.93e-34 for T == quad
+    //  5.35e-51 for t = cpp_bin_float_50
+
+    // std::cout << " get eps = " << get_epsilon() << std::endl; // quad eps = 1.93e-34, bin_float_50 eps = 5.35e-51
+    policies::check_series_iterations("boost::math::lambert_w0_small_z<%1%>(%1%)", max_iter, pol);
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS
+    std::cout << "z = " << z << " needed  " << max_iter << " iterations." << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS
+    //std::cout.precision(prec); // Restore.
+    return result;
+  } // template  inline T lambert_w0_small_z_series(T z, const Policy& pol)
+
+  /////////////////////////////////////////////////////////////////////////////
+
+  // Halley refinement, if required, for precision in policy.
+  // Only perform this if the most precise value possible (usually within one epsilon) is desired.
+  // The previous Fukushima Schroeder refinement usually gives within several epsilon.
+  // Halley refinement needs to perform some evaluations of the exp function, and
+  // may nearly double the execution time.
+  // However Boost.Math prioritizes accuracy over speed,
+  // so this extra step is taken by the default policy.
+
+  // Two versions:
+  //  do_while always makes one iteration before testing against a tolerance,
+  //  while_do does a test first, perhaps avoiding an iteration if already within tolerance.
+
+  template
+  inline
+  T halley_update(T w0, const T z, const Policy&)
+  {
+    // Only if necessary, iterate a few times to refine estimate using Halley's method.
+    // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate
+    // since we can simplify the expressions algebraically,
+    // and don't need most of the error checking of the boilerplate version
+    // as we know in advance that the function is reasonably well-behaved,
+    // (and in any case the derivatives require evaluation of Lambert W!).
+
+    //! So also do-while version.
+
+    BOOST_MATH_STD_USING // Aid argument dependent (ADL) lookup of abs.
+
+    using boost::math::constants::exp_minus_one; // 0.36787944
+    using boost::math::tools::max_value;
+
+    int iterations = 0;
+   // int iterations_required = 6; // 
+    int max_iterations = 20; // Only as a check on looping.
+
+    T tolerance = boost::math::policies::get_epsilon();
+    T previous_diff = boost::math::tools::max_value();
+    T w1 = w0; // Refined estimate.
+    T expw0 = exp(w0); // Compute z == W * exp(W); from best Lambert W estimate so far.
+    // Hope that  w0 * expw0 == z;
+    T diff = (w0 * expw0) - z; // Difference from argument z.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+    std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10);  // Save.
+    std::cout.precision(std::numeric_limits::max_digits10); // Show all posssibly significant digits.
+    std::ios::fmtflags flags(std::cout.flags()); // Save.
+    std::cout.setf(std::ios_base::showpoint); // Include any trailing zeros.
+    std::cout << "w = " << w0 << ", z = " << z << ", w * exp(w) = " << w0 * expw0 << ", diff = " << diff << std::endl;
+    if (diff == 0)
+    {
+      std::cout << "Exact, so no Halley refinement from " << w0 << std::endl;
+    }
+    else if(abs(diff) <= tolerance)
+    {
+      std::cout << "Within tolerance, so no Halley refinement from " << w0 << std::endl;
+    }
+    std::cout.precision(precision); // Restore.
+    std::cout.flags(flags);
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+    if (diff == 0)  // Exact result - common.
+    {
+      return w0;
+    }
+    // relative does NOT work well, so check for improvement in diff instead.
+    //else if ((abs(diff) / w0) <= tolerance) 
+    //{
+    //  return w0;
+    //}
+    // else Refine.
+    do
+    {
+      iterations++;
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+      std::cout << "Halley iteration #" << iterations << "."<< std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+      previous_diff = diff; // Remember so that can check if any new estimate is better.
+
+      // Halley's method from Luu equation 6.39, line 17.
+      // https://en.wikipedia.org/wiki/Halley%27s_method
+      // http://www.wolframalpha.com/input/?i=differentiate+productlog(x)
+      // differentiate productlog(x)  d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w)
+      // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2)
+      // f'(w) = e^w (1 + w)
+      // f''(w) = e^w (2 + w) ,
+      // f''(w)/f'(w) = (2+w) / (1+w),  Luu equation 6.38.
+
+      w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39.
+        - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2)));
+      diff = (w1 * exp(w1)) - z;
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+      T dis = boost::math::float_distance(w0, w1);
+      std::cout << "w = " << w0 << ", z = " << z << ", w * exp(w) = " << w0 * expw0 << ", diff = " << diff << std::endl;
+      int d = static_cast(dis);
+      if (abs(dis) < 2147483647)
+      {
+        std::cout << "float_distance = " << d << std::endl;
+      }
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+
+      if (diff == 0) // Exact.
+      {
+        return w1; // Exact, or no improvement, so as good as it can be.
+      }
+      if (abs(diff) >= abs(previous_diff)) // Latest estimate is not better, or worse, so avoid oscillating result (common when near singularity).
+      {
+        return w1;  // Or mean (w0 + w1)/2 ??
+      }
+      if (fabs((w0 / w1) - static_cast(1)) < tolerance)
+      { // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few).
+        return w1; // Or mean (w0 + w1)/2 ??
+      }
+      w0 = w1;
+      expw0 = exp(w0);
+    }
+   // while ((iterations < iterations_required) || (iterations <= max_iterations)); // Absolute limit during testing - is looping if need this.
+    while (iterations <= max_iterations); // Absolute limit during testing - is looping if need this.
+
+    return w1;
+  } // T halley_update(T w0, const T z)
+
+
+  //! Halley update version that does one update without a check, 
+  //! and then more updates as necessary.
+  // TODO Might use a template parameter to avoid duplication?
+  template
+  inline
+  T halley_update_do_while(T w0, const T z)
+  {
+    BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
+
+    using boost::math::constants::exp_minus_one; // 0.36787944
+    using boost::math::tools::max_value;
+    T tolerance = std::numeric_limits::epsilon();
+    int iterations = 0;
+    int min_iterations = 1; // Specify a minimum number of iterations to perform.
+    int max_iterations = 6; // Should not be needed, but include to avoid risk of looping forever.
+    // (Might be necessary to increase this?)
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+    std::cout << "At least = " << min_iterations << " Halley iterations." << std::endl;
+    std::cout << "(But not more than " << max_iterations << " Halley iterations.)" << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+
+    T w1; // Refined estimate.
+    T previous_diff = boost::math::tools::max_value();
+    do
+    { // Iterate a few times to refine value using Halley's method.
+      // Inline Halley iteration, rather than calling boost::math::tools::halley_iterate
+      // since we can simplify the expressions algebraically,
+      // and don't need most of the error checking of the boilerplate version
+      // as we know in advance that the function is reasonably well-behaved,
+      // and in any case the derivatives require evaluation of Lambert W!
+
+      // z == W * exp(W);
+      T expw0 = exp(w0); // Compute z from best Lambert W estimate so far.
+                                // Hope that  w0 * expw0 == z;
+      T diff = (w0 * expw0) - z; // Difference from argument z.
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+        std::cout << "w = " << w0 << ", z = " << z << ", exp(w) = " << expw0 << ", diff = " << diff << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY
+
+      iterations++;
+      // Halley's method from Luu equation 6.39, line 17.
+      // https://en.wikipedia.org/wiki/Halley%27s_method
+      // http://www.wolframalpha.com/input/?i=differentiate+productlog(x)
+      // differentiate productlog(x)  d/dx(W(x)) = (W(x))/(x W(x) + x) = e^w (1 + w)
+      // Wolfram Alpha (d^2 )/(dw^2)(w exp(w) - z) = e^w (w + 2)
+      // f'(w) = e^w (1 + w)
+      // f''(w) = e^w (2 + w) ,
+      // f''(w)/f'(w) = (2+w) / (1+w),  Luu equation 6.38.
+
+      w1 = w0 // Refine a new estimate using Halley's method using Luu equation 6.39.
+        - diff / ((expw0 * (w0 + 1) - (w0 + 2) * diff / (w0 + w0 + 2)));
+      if ( // Reached estimate of Lambert W within relative tolerance (usually an epsilon or few).
+        (fabs((w0 / w1) - static_cast(1)) < tolerance)
+        || // Or latest estimate is not better, or worse, so avoid oscillating result (common when near singularity).
+        (abs(diff) >= abs(previous_diff))
+        )
+      {
+        return w1; // No improvement, so as good as it can be.
+      }
+
+      w0 = w1;
+      previous_diff = diff; // Remember so that can check if any new estimate is better.
+    }
+    while (
+      (iterations < min_iterations) || // do minimum iterations.
+      (iterations <= max_iterations) // Absolute max limit during testing
+           // (unexpected looping if need this).
+    );
+    return w1; //
+  } // Halley do while
+
+  //! \brief Schroeder method, fifth-order update formula,
+  //! \details See T. Fukushima page 80-81, and
+  //! A. Householder, The Numerical Treatment of a Single Nonlinear Equation,
+  //! McGraw-Hill, New York, 1970, section 4.4.
+  //! Fukushima algorithm switches to @c schroeder_update after pre-computed bisections,
+  //! chosen to ensure that the result will be achieve the +/- 10 epsilon target.
+  //! \param w Lambert w estimate from bisection.
+  //! \param y bracketing value from bisection.
+  //! \returns Refined estimate of Lambert w.
+
+  // Schroeder refinement, called unless NOT required by precision policy.
+  template
+  inline
+  T schroeder_update(const T w, const T y)
+  {
+    // Compute derivatives using 5th order Schroeder refinement.
+    // Since this is the final step, it will always use the highest precision type T.
+    // Example of Call:
+    //   result = schroeder_update(w, y);
+    //where
+    // w is estimate of Lambert W (from bisection or series).
+    // y is z * e^-w. 
+
+    BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
+    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+    std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+    using boost::math::float_distance;
+    T fd = float_distance(w, y);
+    std::cout << "Schroder ";
+    if (abs(fd) < 214748000.)
+    {
+      std::cout << " Distance = "<< static_cast(fd);
+    }
+    else
+    {
+      std::cout << "Difference w - y = " << (w - y) << ".";
+    }
+    std::cout << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+    //  Fukushima equation 18, page 6.
+    const T f0 = w - y; // f0 = w - y.
+    const T f1 = 1 + y; // f1 = df/dW
+    const T f00 = f0 * f0;
+    const T f11 = f1 * f1;
+    const T f0y = f0 * y;
+    const T result =
+     w - 4 * f0 * (6 * f1 * (f11 + f0y)  +  f00 * y) /
+      (f11 * (24 * f11 + 36 * f0y) +
+        f00 * (6 * y * y  +  8 * f1 * y  +  f0y)); // Fukushima Page 81, equation 21 from equation 20.
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+    std::cout << "Schroeder refined " << w << "  " << y << ", difference  " << w-y  << ", change " << w - result << ", to result " << result << std::endl;
+    std::cout.precision(saved_precision); // Restore.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+
+    return result;
+  } // template T schroeder_update(const T w, const T y)
+
+  /////////////  namespace detail implementations of Lambert W for W0 and W-1 branches.
+ 
+  //! Compute Lambert W for W0 (or W+) branch.
+  template
+  T lambert_w0_imp(const T z, const Policy& pol)
+  {
+    // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1).
+    // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L),
+    // or static_casted integer, for example:  static_cast(1) or static_cast(1).
+    // Want to allow fixed_point types too, so do not just test for floating-point.
+    // Integral types should been promoted to double by user Lambert w functions.
+    BOOST_STATIC_ASSERT_MSG(!std::is_integral::value,
+      "Must be floating-point or fixed type (not integer type), for example: lambert_w0(1.), not lambert_w0(1)!");
+     
+    const char* function = "boost::math::lambert_w0()"; // Used for error messages.
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0
+    {
+      std::size_t saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+      std::cout << "Lambert_w argument = " << z << std::endl;
+      std::cout << "Argument Type = " << typeid(T).name()
+        << ", max_digits10 = " << std::numeric_limits::max_digits10
+        << std::setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() << std::endl;
+      std::cout.precision(saved_precision); // Restore precision.
+    }
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0
+
+    // Check for edge and corner cases first:
+
+    if (boost::math::isnan(z))
+    {
+      return policies::raise_domain_error(function,
+        "Argument z is NaN!",
+        z, pol);
+    } // isnan
+    if (boost::math::isinf(z))
+    {
+      if (std::numeric_limits::has_infinity)
+      {
+        return std::numeric_limits::infinity();
+      }
+      else
+      { // Arbitrary precision type.
+        return tools::max_value();
+      }
+      // Or might opt to throw an exception?
+      //return policies::raise_domain_error(function,
+      //  "Argument z is infinite!",
+      //  z, pol);
+    } // isinf
+
+    BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
+    if (abs(z) <= static_cast(0.05))
+    { // z is near zero, so use small z/near-zero series expansion.
+      // Change to use this series approximation made by Fukushima at 0.05,
+      // found by trial and error, and may not be best for higher precision.
+      // Chose float, double, or long double, or multiprecision specializations.
+      // Higher precision types either need more terms, or change in range of abs(z),
+      // or use as an approximation?
+      return detail::lambert_w0_small_z(z, pol);
+    }
+    else if (z == -boost::math::constants::exp_minus_one())
+    { // At singularity, so return exactly minus one.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES
+      std::cout << "At singularity. " << std::endl; // within epsilon of branch singularity 0.36.
+#endif
+      return static_cast(-1);
+    }
+    else if (z < -boost::math::constants::exp_minus_one()) // z < -1/e so out of range of W0 branch (should using W1 branch instead).
+    {
+      return policies::raise_domain_error(function,
+        "Argument z = %1% out of range (-1/e <= z < (std::numeric_limits::max)()) for Lambert W0 branch (use W-1 branch?).",
+        z, pol);
+    }
+    else if (z < static_cast(-0.35))
+    { // Near singularity/branch point at z = -0.3678794411714423215955237701614608727
+      const T p2 = 2 * (boost::math::constants::e() * z + 1);
+      if (p2 > 0)
+      { // Use near-singularity series expansion.
+         // http://www.boost.org/doc/libs/release/libs/multiprecision/doc/html/boost_multiprecision/intro.html
+         // Taking care to avoid trouble from expression templates.
+        T w_series = lambert_w_singularity_series(T(sqrt(p2)));
+        // Neither Halley nor Schroeder do not improve result for builtin,
+        // differences about 5e-15, so do NOT use refinement step below unless multiprecision.
+        // 
+        //int d2 = policies::digits(); // Precision as digits base 2 from policy.
+        //if (d2 > (std::numeric_limits::digits - 6))
+        //{ // If more (fullest) accuracy required, then use refinement.
+        //  T y = z * exp(-w_series);
+        //  T s_result = schroeder_update(w_series, y);
+        //}
+        if (std::numeric_limits::digits > 53)
+        { // Multiprecision, so try a refinement:
+          w_series = halley_update(w_series, z, pol);
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
+          std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+          std::cout << "Halley updated to " << w_series << std::endl;
+          std::cout.precision(saved_precision);
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
+        }
+        return w_series;
+      }
+    } //  z < -0.35
+ // z < -1/e
+    else 
+    { //! Check if z so big that cannot use lookup table, so approximate and Halley iterate.
+     // std::cout << " lambert_w_lookup::w0zs[63] "  << lambert_w_lookup::w0zs[63] << ' ' << lambert_w_lookup::w0zs[64]  << std::endl;
+      // lambert_w_lookup::w0zs[63] = 1.4450833904658542e+29,  lambert_w_lookup::w0zs[64]=  3.9904954117194348e+29, 
+      if (z >= lambert_w_lookup::w0zs[lambert_w_lookup::noof_w0zs - 1]) // F[64] =  3.9904954117194348e+29
+      { //! z so big that cannot use lookup table, so approximate and Halley iterate.
+        T guess;
+         // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
+         // François Chapeau-Blondeau and Abdelilah Monir
+         // Numerical Evaluation of the Lambert W Function
+         // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002
+         // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf
+         // Estimate Lambert W using ln(z)  ...
+         // This is roughly the power of ten * ln(10) ~= 2.3, n ~= 10^n
+         //  and improve by adding a second term ln(ln(z))
+        T lz = log(z);
+        T llz = log(lz);
+        guess = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE
+        std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+        std::cout << "z = " << z << ", guess = " << guess << ", ln(z) = " << lz << ", ln(-ln(z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl;
+
+        // z = 3.9999999999999997e+29, guess = 64.001325187470187, ln(z) = 68.161262057947212, ln(-ln(z) = 4.2218763984580194, llz/lz = 0.061939527980993024
+        // After 3 Halley iterations: lambert_w0(3.9999999999999997e+29) = 64.002342375637951
+
+        int d10 = policies::digits_base10(); // policy template parameter digits10
+        int d2 = policies::digits(); // digits base 2 from policy.
+        std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
+          << std::endl;
+        std::cout.precision(saved_precision);
+      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE
+        if (policies::digits() < 12)
+        { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12.
+          return guess;
+        }
+        // else refine for higher precision.
+        T result = halley_update(guess, z, pol);
+        return result;
+
+        // Or could throw an exception here.
+        //// G[k=64] == g[63] ==
+        //return policies::raise_domain_error(function, 3.9999999999999997e+29
+        //  "Argument z = %1% is too small (< 3.9904954117194348e+29) !",
+        //  z, pol);
+      } // Too big for lookup table.
+
+      // Argument z is in the 'normal' range and float or double precision, so use Lookup, Bracket, Bisection and Schroeder (and Halley).
+      if (std::numeric_limits::digits > 53)
+      { // T is more precise than 64-bit double (or long double, or ?),
+        // so recurse to compute an approximate double value using only one Schroeder refinement,
+        // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50
+        // because are next going to use Halley refinement at full/high precision using this as an approximation).
+        using boost::math::policies::precision;
+        using boost::math::policies::digits10;
+        using boost::math::policies::digits2;
+        using boost::math::policies::policy;
+        // Compute a 50-bit precision approximate W0 in a double (no Halley refinement).
+        T double_approx = static_cast(lambert_w0_imp(static_cast(z), policy >()));
+#ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
+        std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN
+        // Perform additional few Halley refinement(s) to ensure that
+        // get a near as possible to correct result (usually +/- one epsilon).
+        T result = halley_update(double_approx, z, pol);
+#ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_W0__NOT_BUILTIN
+        std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+        std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl;
+        std::cout.precision(saved_precision);
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0__NOT_BUILTIN
+        return result;
+      } // digits > 53  - higher precision than double.
+      else // T is double or less precision.
+      {
+        // Use a lookup table
+        using namespace boost::math::detail::lambert_w_lookup;
+        // to find the nearest integer part of Lambert W to use as starting point for Bisection,
+        // Test sequence is n is (0, 1, 2, 4, 8, 16, 32, 64) for W0 branch.
+        // Since z is probably quite small, start with lowest (n = 0),
+        // up to largest possible F[k=64] for lookup_t type).
+        int n; // Indexing W0 lookup table w0zs[n] of z.
+        for (n = 0; n <= 2; ++n)
+        { // Try 1st few.
+          if (w0zs[n] > z)
+          { //
+            goto bisect;
+          }
+        }
+        n = 2;
+        for (int j = 1; j <= 5; ++j)
+        {
+          n *= 2; // Try bigger, and bigger steps.
+          if (w0zs[n] > z) // z <= w0zs[n]
+          {
+            goto overshot; // Need to backup!
+          }
+        } // for
+        // get here if
+        //std::cout << "Too big " << z << std::endl;
+        //// else z too large :-(
+        //const char* function = "boost::math::lambert_w0()";
+        // This should not now occur (> largest lookup now handled) so should be a logic error?
+        std::cout << "W = " << n << ", w0zs[n]" << w0zs[n] << ' ' << w0zs[n+1] << ", z = " << z << std::endl;
+        return policies::raise_domain_error("boost::math::lambert_w0()",
+          "Argument z = %1% is too large! (Should not occur, please report.)",
+          z, pol);
+      overshot:
+        {
+          int nh = n / 2;
+          for (int j = 1; j <= 5; ++j)
+          {
+            nh /= 2;
+            if (nh <= 0)
+            {
+              break;
+            }
+            if (w0zs[n - nh] > z)
+            {
+              n -= nh;
+            }
+          } // for
+        }
+
+      bisect:
+        --n; // w0zs[n] is nearest below, so n is integer part of W,
+        // and w0zs[n+1] is next integral part of W.
+        // These are used as initial values for bisection.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP
+          std::cout << "Result lookup W0(" << z <<  ") bisection between w0zs[" << n << "] = " << w0zs[n] << " and w0zs[" << n << "] = " << w0zs[n+1]
+            << ", bisect mean = " << ( w0zs[n] + w0zs[n + 1]) / 2 << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP
+
+        // Check precision specified by policy in case can return early.
+        // Use can set  precision, for example = 7 from lambert_w0(x, policy >() or lambert_w0(x, policy >()
+        int d2 = policies::digits(); // digits base 2 from policy (default 24 for float, 53 for double).
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+        int d10 = policies::digits_base10(); // policy template parameter digits10
+        std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
+          << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+        if (d2 <= 7)
+        { // Only 7 binary digits precision required to hold integer size of w0zs[65],
+          // so just return the mean of the two nearby integral values.
+          // This is a *very* approximate estimate, and perhaps not very useful?
+          return static_cast((w0zs[n] + w0zs[n+1]) / 2);
+        }
+
+        // Compute the number of bisections that ensure that result is close enough that
+        // a single 5th order Schroeder update is sufficient to achieve near double (53-bit) accuracy.
+        int bisections = 8; //  Assume minimum number of bisections will be needed (most common case).
+        if (z <= -0.36)
+        { // Very near singularity, so need several more bisections.
+          bisections = noof_sqrts; // 12
+        }
+        else if (z <= -0.3)
+        { // Near singularity, so need a few more bisections.
+          bisections = 11;
+        }
+        else if (n <= 0)
+        { // Very small z, so need 3 more bisections.
+          bisections = 10;
+        }
+        else if (n <= 1)
+        { // Small z, so need just 1 extra bisection.
+          bisections = 9;
+        }
+       // bisections += 2; // Try a few extras to see if this gets closer to 'best possible result'. Probably not.
+// But would need more halfs and sqrts to test worst case?
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
+        std::cout << "n = " << n << ", so " << bisections << " bisections." << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
+        lookup_t dz = static_cast(z);
+        // Only use lookup_t precision, default double, for bisection.
+        // Use Halley refinement for higher precisions.
+        // Perform the bisections fractional bisections for necessary precision.
+        // Avoid using exponential function for speed.
+        lookup_t w = static_cast(n);  // Fukushima Equation 25, Integral Lambert W.
+       // lookup_t y = dz * e[n + 1]; // Fukushima Integral +1 Lambert W.
+        lookup_t y = dz * static_cast(w0es[n + 1]); // Fukushima Equation 26, Integral +1 Lambert W.
+        for (int j = 0; j < bisections; ++j)
+        { // Equation 27.
+          const lookup_t wj = w + static_cast(halves[j]); // Add 1/2, 1/4, 1/8 ...
+          const lookup_t yj = y * static_cast(sqrtw0s[j]); // Multiply by sqrt(1/e), ...
+          if (wj < yj)
+          {
+            w = wj;
+            y = yj;
+          }
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
+          std::cout  << "#" << std::setw(2) << j << "  w = " << w << ", y =  " << y << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
+        } // for bisections
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
+          std::cout << "Bisection estimate =            " << w << " " << y << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION
+
+        if (d2 <= 10)
+        { // Only 10 digits2 required (== digits10 ~= 3 decimal digits precision),
+          // so just return the nearest bisection.
+          // (Might make this test depend on size of T?)
+          return static_cast(w); // Bisection only.
+        }
+        else // More than 10 digits2 wanted, so continue with Fukushima's Schroeder refinement.
+        {
+          T result = static_cast(schroeder_update(w, y));
+          if (d2 <= (std::numeric_limits::digits - 3))
+          { // Only enough digits2 required, so just return the Schroeder refined value.
+            // For example, for float, if (d2 <= 22) then
+            // digits-3 returns Schroeder result if up to 3 bits might be wrong.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+            std::cout << "Schroeder refinement estimate = " << result << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
+            return result; // Schroeder only.
+          }
+          else // Perform additional Halley refinement(s) to ensure that
+          // get a near as possible to correct result (usually +/- epsilon).
+          {
+            result = halley_update(result, z, pol);
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+            std::cout.precision(std::numeric_limits::max_digits10);
+            std::cout << "Halley refinement estimate =    " << result << std::endl;
+            std::cout.precision(saved_precision);
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+            return result; // Halley
+          } // schroeder or Schroeder and Halley.
+        } // more than 10 digits2
+      }
+    } // normal range and precision.
+    throw std::logic_error("No result from lambert_w0_imp!  (Please report!)");  // Should never get here.
+  } //  T lambert_w0_imp(const T z, const Policy& pol)
+ 
+
+  //! Lambert W for W-1 branch, -max(z) < z <= -1/e.
+  // TODO is -max(z) allowed?
+  template
+  T lambert_wm1_imp(const T z, const Policy&  pol)
+  {
+    // Catch providing an integer value as parameter x to lambert_w, for example, lambert_w(1).
+    // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L),
+    // or static_casted integer, for example:  static_cast(1) or static_cast(1).
+    // Want to allow fixed_point types too, so do not just test for floating-point.
+    // Integral types should be promoted to double by user Lambert w functions.
+    // If integral type provided to user function lambert_w0 or lambert_wm1,
+    // then should already have been promoted to double.
+    BOOST_STATIC_ASSERT_MSG(!std::is_integral::value,
+      "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!");
+
+    BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs.
+
+    const char* function = "boost::math::lambert_wm1()"; // Used for error messages.
+
+    // Check for edge and corner cases first:
+
+    if (boost::math::isnan(z))
+    {
+      return policies::raise_domain_error(function,
+        "Argument z is NaN!",
+        z, pol);
+    } // isnan
+
+    if (boost::math::isinf(z))
+    {
+      return policies::raise_domain_error(function,
+        "Argument z is infinite!",
+        z, pol);
+    } // isinf
+
+    if (z == static_cast(0))
+    { // z is exactly zero so return -std::numeric_limits::infinity();
+      if (std::numeric_limits::has_infinity)
+      {
+        return -std::numeric_limits::infinity();
+      }
+      else
+      { 
+        return -tools::max_value();
+      }
+    }
+    if (std::numeric_limits::has_denorm)
+    { // All real types except arbitrary precision.
+      if (!boost::math::isnormal(z))
+      { // Almost zero - might also just return infinity like z == 0 or max_value?
+        return policies::raise_overflow_error(function,
+          "Argument z =  %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)",
+          z, pol);
+      }
+    }
+
+    if (z > static_cast(0))
+    { //
+      return policies::raise_domain_error(function,
+        "Argument z = %1% is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?)",
+        z, pol);
+    }
+    if (z > -(std::numeric_limits::min)())
+    { // z is denormalized, so cannot be computed.
+      // -std::numeric_limits::min() is smallest for type T,
+      // for example, for double: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634
+      return policies::raise_overflow_error(function,
+        "Argument z = %1% is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch!",
+        z, pol);
+    }
+    if (z == -boost::math::constants::exp_minus_one()) // == singularity/branch point z = -exp(-1) = -3.6787944.
+    { // At singularity, so return exactly -1.
+      return -static_cast(1);
+    }
+    // z is too negative for the W-1 (or W0) branch.
+    if (z < -boost::math::constants::exp_minus_one()) // > singularity/branch point z = -exp(-1) = -3.6787944.
+    {
+      return policies::raise_domain_error(function,
+        "Argument z = %1% is out of range (z < -exp(-1) = -3.6787944... <= 0) for Lambert W-1 (or W0) branch!",
+        z, pol);
+    }
+    if (z < static_cast(-0.35))
+    { // Close to singularity/branch point z = -0.3678794411714423215955237701614608727 but on W-1 branch. 
+      const T p2 = 2 * (boost::math::constants::e() * z + 1);
+      if (p2 == 0)
+      { // At the singularity at branch point.
+        return -1;
+      }
+      if (p2 > 0)
+      {
+        T w_series = lambert_w_singularity_series(T(-sqrt(p2)));
+        if (std::numeric_limits::digits > 53)
+        { // Multiprecision, so try a Halley refinement.
+          w_series = halley_update(w_series, z, pol);
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN
+          std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+          std::cout << "Halley updated to " << w_series << std::endl;
+          std::cout.precision(saved_precision);
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN
+        }
+        return w_series;
+      }
+      // Should not get here.
+      return policies::raise_domain_error(function,
+        "Argument z = %1% is out of range for Lambert W-1 branch. (Should not get here - please report!)",
+        z, pol);
+
+      //return policies::raise_domain_error(function,
+      //  "Argument z = %1% is out of range!",
+      //  z, pol);
+    } // if (z < -0.35)
+
+    using lambert_w_lookup::wm1es;
+    using lambert_w_lookup::wm1zs;
+    using lambert_w_lookup::noof_wm1zs; // size == 64 
+
+    // std::cout <<" Wm1zs[63] (== G[64]) = " << " " << wm1zs[63] << std::endl; // Wm1zs[63] (== G[64]) =  -1.0264389699511283e-26
+    // Check that z argument value is not smaller than lookup_table G[64] 
+    // std::cout << "(z > wm1zs[63]) = " << std::boolalpha << (z > wm1zs[63]) << std::endl;
+
+    if (z >= wm1zs[63]) // wm1zs[63]  = -1.0264389699511282259046957018510946438e-26L  W = 64.00000000000000000
+    {  // z >= -1.0264389699511303e-26 (but != 0 and >= std::numeric_limits::min() and so NOT denormalized).
+      std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+     // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl;
+     // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl;
+      // -std::numeric_limits::min() = -1.1754943508222875e-38
+      // -std::numeric_limits::min() = -2.2250738585072014e-308
+
+      // N[productlog(-1, -1.1754943508222875 * 10^-38 ), 50] = -91.856775324595479509567756730093823993834155027858
+      // N[productlog(-1, -2.2250738585072014e-308 * 10^-308 ), 50] = -1424.8544521230553853558132180518404363617968042942
+      // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955
+
+      // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth,
+      // “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
+      // François Chapeau-Blondeau and Abdelilah Monir
+      // Numerical Evaluation of the Lambert W Function
+      // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002
+      // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf
+      // Estimate Lambert W using ln(-z)  ...
+      // This is roughly the power of ten * ln(10) ~= 2.3.   n ~= 10^n
+      //  and improve by adding a second term -ln(ln(-z))
+      T guess; // bisect lowest possible Gk[=64] (for lookup_t type)
+      T lz = log(-z);
+      T llz = log(-lz);
+      guess = lz - llz + (llz / lz); // Chapeau-Blondeau equation 20, page 2162.
+    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY
+      std::cout << "z = " << z << ", guess = " << guess << ", ln(-z) = " << lz << ", ln(-ln(-z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl;
+      // z = -1.0000000000000001e-30, guess = -73.312782616731482, ln(-z) = -69.077552789821368, ln(-ln(-z) = 4.2352298269101114, llz/lz = -0.061311231447304194
+      // z = -9.9999999999999999e-91, guess = -212.56650048504233, ln(-z) = -207.23265836946410, ln(-ln(-z) = 5.3338421155782205, llz/lz = -0.025738424423764311
+      // >z = -2.2250738585072014e-308, guess = -714.95942238244606, ln(-z) = -708.39641853226408, ln(-ln(-z) = 6.5630038501819854, llz/lz = -0.0092645920821846622
+      int d10 = policies::digits_base10(); // policy template parameter digits10
+      int d2 = policies::digits(); // digits base 2 from policy.
+      std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
+        << std::endl;
+    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY
+      if (policies::digits() < 12)
+      { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12.
+        return guess;
+      }
+      T result = halley_update(guess, z, pol);
+      std::cout.precision(saved_precision);
+      return result;
+
+      // Was Fukushima
+      // G[k=64] == g[63] == -1.02643897e-26
+      //return policies::raise_domain_error(function,
+      //  "Argument z = %1% is too small (< -1.02643897e-26) ! (Should not occur, please report.",
+      //  z, pol);
+    } // Z too small so use approximation and Halley.
+    // Else Use a lookup table to find the nearest integer part of Lambert W-1 as starting point for Bisection.
+
+    if (std::numeric_limits::digits > 53)
+    { // T is more precise than 64-bit double (or long double, or ?),
+      // so compute an approximate value using only one Schroeder refinement,
+      // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50
+      // because are next going to use Halley refinement at full/high precision using this as an approximation).
+      using boost::math::policies::precision;
+      using boost::math::policies::digits10;
+      using boost::math::policies::digits2;
+      using boost::math::policies::policy;
+      // Compute a 50-bit precision approximate W0 in a double (no Halley refinement).
+      T double_approx = static_cast(lambert_wm1_imp(static_cast(z), policy >()));
+    #ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN
+      std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl;
+    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+      // Perform additional Halley refinement(s) to ensure that
+      // get a near as possible to correct result (usually +/- one epsilon).
+      T result = halley_update(double_approx, z, pol);
+    #ifdef  BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+      std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+      std::cout << "Result " << typeid(T).name() << " precision Halley refinement =    " << result << std::endl;
+      std::cout.precision(saved_precision);
+    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+      return result;
+    } // digits > 53  - higher precision than double.
+    else // T is double or less precision.
+    {
+      // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection.
+      using namespace boost::math::detail::lambert_w_lookup;
+      // Bracketing sequence  n = (2, 4, 8, 16, 32, 64) for W-1 branch. (0 is -infinity)
+      // Since z is probably quite small, start with lowest n (=2).
+      int n = 2;
+      if (wm1zs[n - 1] > z)
+      {
+        goto bisect;
+      }
+      for (int j = 1; j <= 5; ++j)
+      {
+        n *= 2;
+        if (wm1zs[n - 1] > z)
+        {
+          goto overshot;
+        }
+      }
+      // else z < g[63] == -1.0264389699511303e-26, so Lambert W-1 integer part > 64.
+      // This should not now occur (should be caught by test and code above) so should be a logic_error?
+      return policies::raise_domain_error(function,
+        "Argument z = %1% is too small (< -1.026439e-26) (logic error - please report!)",
+        z, pol);
+    overshot:
+      {
+        int nh = n / 2;
+        for (int j = 1; j <= 5; ++j)
+        {
+          nh /= 2; // halve step size.
+          if (nh <= 0)
+          {
+            break; // goto bisect;
+          }
+          if (wm1zs[n - nh - 1] > z)
+          {
+            n -= nh;
+          }
+        }
+      }
+    bisect:
+      --n;   // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part.
+             // These are used as initial values for bisection.
+    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP
+      std::cout << "Result lookup W-1(" << z << ") bisection between wm1zs[" << n - 1 << "] = " << wm1zs[n - 1] << " and wm1zs[" << n << "] = " << wm1zs[n]
+        << ", bisect mean = " << (wm1zs[n - 1] + wm1zs[n]) / 2 << std::endl;
+    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP
+
+      // W0 version
+    //  // Check precision specified by policy in case can return early.
+    //  // Use can set  precision, for example = 7 from lambert_w0(x, policy >() or lambert_w0(x, policy >()
+    //  int d2 = policies::digits(); // digits base 2 from policy (default 24 for float, 53 for double).
+    //#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+    //  int d10 = policies::digits_base10(); // policy template parameter digits10
+    //  std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
+    //    << std::endl;
+    //#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+    //  if (d2 <= 7)
+    //  { // Only 7 binary digits precision required to hold integer size of w0zs[65],
+    //    // so just return the mean of two nearby integral values.
+    //    // This is a *very* approximate estimate, and perhaps not very useful?
+    //    return static_cast((w0zs[n - 1] + w0zs[n]) / 2);
+    //  }
+
+      // Check precision specified by policy.
+      int d2 = policies::digits();
+    #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+      int d10 = policies::digits_base10(); // policy template parameter digits10
+      std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
+        << std::endl;
+    #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+      if (d2 < 7)
+      {   // Only 7 binary digits precision required to hold integer size of w0s[65],
+          // so just return the mean of two nearby integral values.
+           // This is a *very* approximate estimate, and perhaps not very useful?
+      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+        std::cout << "between wm1zs[" << n << "] = " << wm1zs[n + 1] << " <= " << z << " <= " << wm1zs[n] << std::endl;
+        // TODO check this.
+      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION
+        return static_cast((wm1zs[n] + wm1zs[n + 1]) / 2);
+      } // d2 < 7
+
+      // Compute bisections is the number of bisections computed from n,
+      // such that a single application of the fifth-order Schroeder update formula
+      // after the bisections is enough to evaluate Lambert W-1 with (near?) 53-bit accuracy.
+      // Fukushima established these by trial and error?
+      int bisections = 11; //  Assume maximum number of bisections will be needed (most common case).
+      if (n >= 8)
+      {
+        bisections = 8;
+      }
+      else if (n >= 3)
+      {
+        bisections = 9;
+      }
+      else if (n >= 2)
+      {
+        bisections = 10;
+      }
+      // Bracketing, Fukushima section 2.3, page 82:
+      // (Avoiding using exponential function for speed).
+      // Only use @c lookup_t precision, default double, for bisection (again for speed),
+      // and use later Halley refinement for higher precisions.
+      using lambert_w_lookup::halves;
+      using lambert_w_lookup::sqrtwm1s;
+      lookup_t w = -static_cast(n); // Equation 25,
+      lookup_t y = static_cast(z * wm1es[n - 1]); // Equation 26,
+      // Perform the bisections fractional bisections for necessary precision.
+      for (int j = 0; j < bisections; ++j)
+      { // Equation 27.
+        lookup_t wj = w - halves[j]; // Subtract 1/2, 1/4, 1/8 ...
+        lookup_t yj = y * sqrtwm1s[j]; // Multiply by sqrt(1/e), ...
+        if (wj < yj)
+        {
+          w = wj;
+          y = yj;
+        }
+      } // for j
+      if (d2 <= 10)
+      { // Only 10 digits2 required (== digits10 = 3 decimal digits precision),
+        // so just return the nearest bisection.
+        // (Might make this test depend on size of T?)
+      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION
+        std::cout << "W-1 Bisection estimates =            " << w << " " << y << std::endl;
+      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION
+        return static_cast(w); // Bisection only.
+      }
+      else // More than 10 digits2 precision wanted, so continue with Fukushima's Schroeder refinement.
+      {
+        T result = static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement.
+        if (d2 <= (std::numeric_limits::digits - 3))
+        { // Only enough digits2 required, so just return the Schroeder refined value.
+          // For example, for float, if (d2 <= 22) then
+          // digits-3 returns Schroeder result up to 3 bits might be wrong.
+        #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+          std::cout << "Schroeder refinement estimate = " << result << std::endl;
+        #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+          return result; // Schroeder only.
+        }
+      else // Perform additional Halley refinement(s) to ensure that
+           // get a near as possible to correct result (usually +/- epsilon).
+      {
+        result = halley_update(result, z, pol);
+      #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+        std::cout.precision(std::numeric_limits::max_digits10);
+        std::cout << "Halley refinement estimate =    " << result << std::endl;
+        std::cout.precision(saved_precision);
+      #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+        return result; // Halley
+      } // schroeder or Schroeder and Halley.
+      } // more than 10 digits2
+    } // template T lambert_wm1_imp(const T z)
+  }
+} // namespace detail ////////////////////////////////////////////////////////////
+
+  // User Lambert W0 and Lambert W-1 functions.
+
+  //! W0 branch, -1/e <= z < max(z)
+  //! W-1 branch -1/e >= z > min(z)
+
+  //! Lambert W0 using User-defined policy.
+  template 
+  inline
+  typename tools::promote_args::type
+  lambert_w0(T z, const Policy& pol)
+  {
+    // Promote integer or expression template arguments to double,
+    // without doing any other internal promotion like float to double.
+    typedef typename tools::promote_args::type result_type;
+    return detail::lambert_w0_imp(result_type(z), pol); //
+  } // lambert_w0(T z, const Policy& pol)
+
+  //! Lambert W0 using default policy.
+  template 
+  inline
+  typename tools::promote_args::type
+  lambert_w0(T z)
+  {
+    typedef typename tools::promote_args::type result_type;
+    return detail::lambert_w0_imp(result_type(z), policies::policy<>());
+  } // lambert_w0(T z)
+
+
+  //! W-1 branch (-max(z) < z <= -1/e).
+
+  //! Lambert W-1 using User-defined policy.
+  template 
+  inline
+  typename tools::promote_args::type
+  lambert_wm1(T z, const Policy& pol)
+  {
+    // Promote integer or expression template arguments to double,
+    // without doing any other internal promotion like float to double.
+    typedef typename tools::promote_args::type result_type;
+    return detail::lambert_wm1_imp(result_type(z), pol); //
+  }
+
+  //! Lambert W-1 using default policy.
+  template 
+  inline
+  typename tools::promote_args::type
+  lambert_wm1(T z)
+  {
+    typedef typename tools::promote_args::type result_type;
+    return detail::lambert_wm1_imp(result_type(z), policies::policy<>());
+  } // lambert_wm1(T z)
+
+  } // namespace math
+} // namespace boost
+
+#endif //  #ifndef BOOST_MATH_SF_LAMBERT_W_HPP
diff --git a/minimax/Jamfile.v2 b/minimax/Jamfile.v2
index adb924eb0..81790f9a6 100644
--- a/minimax/Jamfile.v2
+++ b/minimax/Jamfile.v2
@@ -1,29 +1,29 @@
 # Copyright John Maddock 2010
-# Distributed under the Boost Software License, Version 1.0. 
-# (See accompanying file LICENSE_1_0.txt or copy at 
+# Copyright Paul A. Bristow 2018
+# 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.
-# \math_toolkit\libs\math\test\jamfile.v2
-# Runs all math toolkit tests, functions & distributions,
-# and build math examples.
+# \math_toolkit\libs\math\minimax\jamfile.v2
+# Runs minimax using multiprecision, (rather than gmp and mpfr)
 
-# bring in the rules for testing
+# bring in the rules for testing.
 import modules ;
 import path ;
 
-project  
-    : requirements 
+project
+    : requirements
       gcc:-Wno-missing-braces
       darwin:-Wno-missing-braces
       acc:+W2068,2461,2236,4070,4069
-      intel-win:-nologo 
-      intel-win:-nologo 
+      intel-win:-nologo
+      intel-win:-nologo
       msvc:all
       msvc:on
       msvc:/wd4996
-      msvc:/wd4512 
-      msvc:/wd4610 
-      msvc:/wd4510 
-      msvc:/wd4127 
+      msvc:/wd4512
+      msvc:/wd4610
+      msvc:/wd4510
+      msvc:/wd4127
       msvc:/wd4701 # needed for lexical cast - temporary.
       static
       borland:static
@@ -32,15 +32,15 @@ project
       BOOST_UBLAS_UNSUPPORTED_COMPILER=0
       .
       ../include_private
-      $(ntl-path)/include
+      #$(ntl-path)/include
     ;
 
+#lib mpfr : gmp : mpfr ;
 
-lib mpfr : gmp : mpfr ;
+#lib gmp : : gmp ;
 
-lib gmp : : gmp ;
-
-exe minimax : f.cpp main.cpp gmp mpfr ;
+# exe minimax : f.cpp main.cpp gmp mpfr ;
+exe minimax : f.cpp main.cpp ;
 
 install bin : minimax ;
 
diff --git a/minimax/f.cpp b/minimax/f.cpp
index 11d4be7bb..6ea405800 100644
--- a/minimax/f.cpp
+++ b/minimax/f.cpp
@@ -359,6 +359,7 @@ mp_type f(const mp_type& x, int variant)
       mp_type xx = 1 / x;
       return boost::math::cyl_bessel_k(1, xx) * sqrt(xx) * exp(xx);
    }
+   // Lambert W0
    case 40:
       return boost::math::lambert_w0(x);
    case 41:
diff --git a/test/lambert_w_lookup_table_generator.cpp b/test/lambert_w_lookup_table_generator.cpp
index 0961b3376..7918e812f 100644
--- a/test/lambert_w_lookup_table_generator.cpp
+++ b/test/lambert_w_lookup_table_generator.cpp
@@ -9,8 +9,15 @@
 //! to 34 decimal digits precision to cater for platforms that have 128-bit long double.
 //! The function bisection can then use any built-in floating-point type,
 //! which may have different precision and speed on different platforms.
-// The actual builtin floating-point type of the arrays is chosen by a typedef in lambert_W.hpp,
-// by default, for example: typedef double lookup_t; 
+//! The actual builtin floating-point type of the arrays is chosen by a 
+//! typedef in \modular-boost\libs\math\include\boost\math\special_functions\lambert_w.hpp
+//! by default, for example: typedef double lookup_t; 
+
+
+// This includes lookup tables for both branches W0 and W-1.
+// Only W-1 is needed by current code that uses JM rational Polynomials,
+// but W0 is kept (for now) to allow comparison with the previous FKDVPB version
+// that uses lookup for W0 branch as well as W-1. 
 
 #include 
 #include  // For exp_minus_one == 3.67879441171442321595523770161460867e-01.
@@ -106,14 +113,14 @@ a: 1.6487212181091309 1.2840254306793213 1.1331484317779541 1.0644944906234741 1
 // These are common to both W0 and W-1
 b: 0.5 0.25 0.125 0.0625 0.03125 0.015625 0.0078125 0.00390625 0.001953125 0.0009765625 0.00048828125 0.000244140625
 
-
 */
 
 // Creates if no file exists, & uses default overwrite/ ios::replace.
-const char filename[] = // "lambert_w_lookup_table.ipp";
-"I:/modular-boost/libs/math/include/boost/math/special_functions/lambert_w_lookup_table.ipp";
+//const char filename[] = // "lambert_w_lookup_table.ipp";  // Write to same folder as generator:
+//"I:/modular-boost/libs/math/include/boost/math/special_functions/lambert_w_lookup_table.ipp";
+const char filename[] = "lambert_w_lookup_table.ipp";
 
-std::ofstream fout(filename, std::ios::out);
+std::ofstream fout(filename, std::ios::out); // File output stream.
 
 // 128-bit precision type (so that full precision if long double type uses 128-bit).
 // typedef cpp_bin_float_quad table_lookup_t; // Output using max_digits10 for 37 decimal digit precision.
@@ -126,7 +133,7 @@ typedef cpp_bin_float_50 table_lookup_t; // Compute tables to 50 decimla digit p
 
 int main()
 {
-  std::cout << "Lambert W table lookup values to file." << std::endl;
+  std::cout << "Lambert W table lookup values." << std::endl;
   if (!fout.is_open())
   {  // File failed to open OK.
     std::cerr << "Open file " << filename << " failed!" << std::endl;
@@ -139,8 +146,13 @@ int main()
     int output_precision = std::numeric_limits::max_digits10; // 37 decimal digits.
     fout.precision(output_precision);
     fout <<
-      "// " << filename << "\n"
-      "// A collection of 128-bit precision integral Lambert W values computed using "
+      "// Copyright Paul A. Bristow 2017." 	"\n"
+      "// Distributed under the Boost Software License, Version 1.0." "\n"
+      "// (See accompanying file LICENSE_1_0.txt" "\n"
+      "// or copy at http://www.boost.org/LICENSE_1_0.txt)" "\n"
+      "\n"
+      "// " << filename << "\n\n"
+      "// A collection of 128-bit precision integral z argument Lambert W values computed using "
       << output_precision << " decimal digits precision.\n"
       "// C++ floating-point precision is 128-bit long double.\n"
       "// Output as "
@@ -152,18 +164,12 @@ int main()
 
       "\n"
       "// Written by " << __FILE__ << " " << __TIMESTAMP__ << "\n"
-
-      "\n"
-      "// Copyright Paul A. Bristow 2017." 	"\n"
-      "// Distributed under the Boost Software License, Version 1.0." "\n"
-      "// (See accompanying file LICENSE_1_0.txt" "\n"
-      "// or copy at http://www.boost.org/LICENSE_1_0.txt)" "\n"
       << std::endl;
 
     fout << "// Sizes of arrays of z values for Lambert W[0], W[1] ... W[64]"
       "\"n""and W[-1], W[-2] ... W[-64]." << std::endl;
 
-    fout << "\nnamespace boost {\nnamespace math {\nnamespace detail {\nnamespace lambert_w_lookup\n{ \n";
+    fout << "\nnamespace boost {\nnamespace math {\nnamespace lambert_w_detail {\nnamespace lambert_w_lookup\n{ \n";
 
     BOOST_STATIC_CONSTEXPR std::size_t noof_sqrts = 12;
     BOOST_STATIC_CONSTEXPR std::size_t noof_halves = 12;
@@ -430,13 +436,12 @@ int main()
       }
       fout << "\n}; // wm1zs" << std::endl;
 
-      fout << "} // namespace lambert_w_lookup\n} // namespace detail\n} // namespace math\n} // namespace boost" << std::endl;
+      fout << "} // namespace lambert_w_lookup\n} // namespace lambert_w_detail\n} // namespace math\n} // namespace boost" << std::endl;
     }
     catch (std::exception& ex)
     {
       std::cout << "Exception " << ex.what() << std::endl;
     }
-
     fout.close();
     return 0;
 
@@ -446,11 +451,8 @@ int main()
 
 Original arrays as output by Veberic/Fukushima code:
 
-
 w0 branch
 
-
-
 W-1 branch 
 
 e: 2.7182818284590451 7.3890560989306495 20.085536923187664 54.598150033144229 148.41315910257657 403.42879349273500 1096.6331584284583 2980.9579870417274 8103.0839275753815 22026.465794806707 59874.141715197788 162754.79141900383 442413.39200892020 1202604.2841647759 3269017.3724721079 8886110.5205078647 24154952.753575277 65659969.137330450 178482300.96318710 485165195.40978980 1318815734.4832134 3584912846.1315880 9744803446.2488918 26489122129.843441 72004899337.385788 195729609428.83853 532048240601.79797 1446257064291.4734 3931334297144.0371 10686474581524.447 29048849665247.383 78962960182680.578 214643579785915.75 583461742527454.00 1586013452313428.3 4311231547115188.5 11719142372802592. 31855931757113704. 86593400423993600. 2.3538526683701958e+17 6.3984349353005389e+17 1.7392749415204982e+18 4.7278394682293381e+18 1.2851600114359284e+19 3.4934271057485025e+19 9.4961194206024286e+19 2.5813128861900616e+20 7.0167359120976157e+20 1.9073465724950953e+21 5.1847055285870605e+21 1.4093490824269355e+22 3.8310080007165677e+22 1.0413759433029062e+23 2.8307533032746866e+23 7.6947852651419974e+23 2.0916594960129907e+24 5.6857199993359170e+24 1.5455389355900996e+25 4.2012104037905024e+25 1.1420073898156810e+26 3.1042979357019109e+26 8.4383566687414291e+26 2.2937831594696028e+27 6.2351490808115970e+27
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index afe60782a..30611d733 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -30,15 +30,19 @@ using boost::multiprecision::cpp_dec_float_50;
 #include 
 //#include  // If available.
 #include  // isnan, ifinite.
+#include  // float_next, float_prior
+using boost::math::float_next;
+using boost::math::float_prior;
+
 #include   // for create_test_value and macro BOOST_MATH_TEST_VALUE.
 #include 
 using boost::math::policies::digits2;
 #include  // For Lambert W lambert_w function.
-//using boost::math::lambert_w0; // Use jm version instead
-using boost::math::lambert_wm1;
 
-// #include "C:\Users\Paul\Desktop\lambert_w0 - Copy before amalgamation.hpp"  // JM latest providing jm_lambert_w0 and jm_lambert_wm1
-#include "C:\Users\Paul\Desktop\lambert_w0.hpp"  // JM latest providing jm_lambert_w0 and jm_lambert_wm1
+// #include "C:\Users\Paul\Desktop\lambert_w0 - Copy before amalgamation.hpp"  // JM latest providing jm_lambert_w0 and lambert_wm1
+//#include "C:\Users\Paul\Desktop\lambert_w0.hpp"  // JM latest providing jm_lambert_w0 and lambert_wm1
+using boost::math::lambert_wm1;
+using boost::math::lambert_w0; // Use jm version instead.
 
 #include 
 #include 
@@ -116,7 +120,7 @@ void test_spots(RealType)
   // (Unused Parameter value, arbitrarily zero, only communicates the floating point type).
   // test_spots(0.F); test_spots(0.); test_spots(0.L);
 
-  using boost::math::jm_lambert_w0;
+  using boost::math::lambert_w0;
   using boost::math::lambert_wm1;
   using boost::math::constants::exp_minus_one;
   using boost::math::constants::e;
@@ -135,11 +139,11 @@ void test_spots(RealType)
 
 //  Test some bad parameters to the function, with default policy and with ignore_all policy.
 #ifndef BOOST_NO_EXCEPTIONS
-  BOOST_CHECK_THROW(jm_lambert_w0(-1.), std::domain_error);
+  BOOST_CHECK_THROW(lambert_w0(-1.), std::domain_error);
   BOOST_CHECK_THROW(lambert_wm1(-1.), std::domain_error);
-  BOOST_CHECK_THROW(jm_lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN.
+  BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN.
   // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Was if infinity should throw, now infinity.
-  BOOST_CHECK_THROW(jm_lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex.
+  BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex.
 #else // No exceptions so set policy to ignore and check result is NaN
   BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits > :
     // Error in function boost::math::lambert_w0() : Argument z is infinite!
-    //BOOST_CHECK_EQUAL(jm_lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // If infinity allowed.
+    //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // If infinity allowed.
     BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::infinity()), std::domain_error); // Infinity NOT allowed.
   }
   if (std::numeric_limits::has_quiet_NaN)
   { // Argument Z == NaN is always an throwable error for both branches.
-    // BOOST_CHECK_EQUAL(jm_lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
+    // BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
     // Error in function boost::math::lambert_w0(): Argument z is NaN!
-    BOOST_CHECK_THROW(jm_lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error);
+    BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error);
     BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error);
   }
 
@@ -280,14 +284,14 @@ void test_spots(RealType)
 
     // Just using series approximation (switch at -0.35).
     // N[productlog(-0.351), 50] = -0.72398644140937651483634596143951001600417138085814
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
       BOOST_MATH_TEST_VALUE(RealType, -0.72398644140937651483634596143951001600417138085814),
       // 2 * tolerance); // Note 2 * tolerance for PB fukushima
     // got -0.723986441409376931150560229265736446 without Halley
     // exp -0.72398644140937651483634596143951001
     // got -0.72398644140937651483634596143951029 with Halley
-      // -0.723987103 JM 4.7126390815771382  3.13946001911235553672 3.13946001911235553658372193565165217
-     2 * tolerance); // expect -0.72398644140937651 but get 4.7126390815771382 for  JM????
+     10 * tolerance); // expect -0.72398644140937651 float -0.723987103 needs 10 * tolerance
+     // 2 * tolerance is fine for double and up.
     // Float is OK
 
     // Same for W-1 branch
@@ -366,33 +370,140 @@ void test_spots(RealType)
   }
   if (std::numeric_limits::has_quiet_NaN)
   {
-    // BOOST_CHECK_EQUAL(jm_lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
+    // BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN()), +std::numeric_limits::infinity()); // message is:
     // Error in function boost::math::lambert_w0(): Argument z is NaN!
     BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::quiet_NaN()), std::domain_error);
   }
 
    // W0 Tests for too big and too small to use lookup table.
    // Exactly W = 64, not enough to be OK for lookup.
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348050619127737142206366920907815909119e+29)),
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.9904954117194348050619127737142206366920907815909119e+29)),
     BOOST_MATH_TEST_VALUE(RealType, 64.0),
     tolerance);
 
     // Just below z for F[64]
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.99045411719434e+29)),
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.99045411719434e+29)),
      BOOST_MATH_TEST_VALUE(RealType, 63.999989810930513468726486827408823607175844852495), tolerance);
     // Fails for quad_float -1.22277013397850595265
     //                      -1.22277013397850595319
 
   // Just too big, so using log approx and Halley refinement.
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29)),
     BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677),
     tolerance);
 
   // Check at reduced precision.
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29), policy >()),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 4e+29), policy >()),
     BOOST_MATH_TEST_VALUE(RealType, 64.002342375637950350970694519073803643686041499677),
     0.00002);  // 0.00001 fails.
 
+  // Tests to ensure that all JM rational polynomials are being checked.
+
+  // 1st polynomal if (z < 0.5)   // 0.05 < z < 0.5
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.49)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.3465058086974944293540338951489158955895910665452626949),
+    tolerance);
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.051)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.04858156174600359264950777241723801201748517590507517888),
+    tolerance);
+
+
+
+  // 2st polynomal if 0.5 < z < 2
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.51)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.3569144916935871518694242462560450385494399307379277704),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.9)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.8291763302658400337004358009672187071638421282477162293),
+    tolerance);
+
+  // 3rd polynomials 2 < z < 6
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 2.1)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.8752187586805470099843211502166029752154384079916131962),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 5.9)),
+    BOOST_MATH_TEST_VALUE(RealType, 1.422521411785098213935338853943459424120416844150520831),
+    tolerance);
+
+  // 4th polynomials 6 < z < 18
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 6.1)),
+    BOOST_MATH_TEST_VALUE(RealType, 1.442152194116056579987235881273412088690824214100254315),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 17.9)),
+    BOOST_MATH_TEST_VALUE(RealType, 2.129100923757568114366514708174691237123820852409339147),
+    tolerance);
+
+  // 5th polynomials if (z < 9897.12905874)  // 2.8 < log(z) < 9.2
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 18.1)),
+    BOOST_MATH_TEST_VALUE(RealType, 2.136665501382339778305178680563584563343639180897328666),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 9897.)),
+    BOOST_MATH_TEST_VALUE(RealType, 7.222751047988674263127929506116648714752441161828893633),
+    tolerance);
+
+  // 6th polynomials if (z < 7.896296e+13)  // 9.2 < log(z) <= 32
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 9999.)),
+    BOOST_MATH_TEST_VALUE(RealType, 7.231758181708737258902175236106030961433080976032516996),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 7.7e+13)),
+    BOOST_MATH_TEST_VALUE(RealType, 28.62069643025822480911439831021393125282095606713326376),
+    tolerance);
+
+  // 7th polynomial // 32 < log(z) < 100
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 8.0e+18)),
+    BOOST_MATH_TEST_VALUE(RealType, 39.84107480517853176296156400093560722439428484537515586),
+    tolerance);
+
+  // Largest 32-bit float. (Larger values for other types tested using max())
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.e38)),
+    BOOST_MATH_TEST_VALUE(RealType, 83.07844821316409592720410446942538465411465113447713574),
+    tolerance);
+
+  // Small z < 0.05  if (z < -0.051)  -0.27 < z < -0.051
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.28)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.4307588745271127579165306568413721388196459822705155385),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.05)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.05270598355154634795995650617915721289427674396592395160),
+    tolerance);
+
+  // Using z small series function < 0.05
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.049)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.04676143671340832342497289393737051868103596756298863555),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.049)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.05159448479219405354564920228913331280713177046648170658),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1e-6)),
+    BOOST_MATH_TEST_VALUE(RealType, 9.999990000014999973333385416558666900096702096424344715e-7),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -1e-6)),
+    BOOST_MATH_TEST_VALUE(RealType, -1.000001000001500002666671875010800023343107568372593753e-6),
+    tolerance);
+
+  // Near Smallest float.
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1e-38)),
+    BOOST_MATH_TEST_VALUE(RealType, 9.99999999999999999999999999999999999990000000000000000e-39),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -1e-38)),
+    BOOST_MATH_TEST_VALUE(RealType, -1.000000000000000000000000000000000000010000000000000000e-38),
+    tolerance);
+
+
+
+
+
   // Similar too near zero tests for W-1 branch
   // lambert_wm1(-1.0264389699511283e-26) = -64.000000000000000
   // Exactly z for W=-64
@@ -438,7 +549,7 @@ void test_spots(RealType)
   BOOST_CHECK_THROW(lambert_wm1(-0.5), std::domain_error);
 
   // This fails for fixed_point type used for other tests because out of range?
-    //BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
+    //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
     //BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019),
     //// Output from https://www.wolframalpha.com/input/?i=lambert_w0(1e6)
     //// tolerance * 1000); // fails for fixed_point type exceeds 0.00015258789063
@@ -448,7 +559,7 @@ void test_spots(RealType)
   // So need to use some spot tests for specific types, or use a bigger fixed_point type.
 
   // Check zero.
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0)),
     BOOST_MATH_TEST_VALUE(RealType, 0.0),
     tolerance);
   // these fail for cpp_dec_float_50
@@ -494,7 +605,7 @@ BOOST_AUTO_TEST_CASE(test_types)
 BOOST_AUTO_TEST_CASE(test_range_of_double_values)
 {
   using boost::math::constants::exp_minus_one;
-  using boost::math::jm_lambert_w0;
+  using boost::math::lambert_w0;
 
   BOOST_TEST_MESSAGE("\nTest Lambert W function type double for range of values.");
 
@@ -508,25 +619,25 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
   //  tolerance);
   // So this section just tests a single type, say IEEE 64-bit double, for a range of spot values.
 
-  typedef double RealType;
+  typedef double RealType; // Some tests assume type is double.
 
   int epsilons = 1;
   RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction.
   std::cout << "Tolerance " << epsilons  << " * epsilon == " << tolerance << std::endl;
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)),
     BOOST_MATH_TEST_VALUE(RealType, 9.9999900000149999733333854165586669000967020964243e-7),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[1e-6],50])
     tolerance);
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0001)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.0001)),
     BOOST_MATH_TEST_VALUE(RealType, 0.000099990001499733385405869000452213835767629477903460),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50])
     tolerance);
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.001)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.001)),
     BOOST_MATH_TEST_VALUE(RealType, 0.00099900149733853088995782787410778559957065467928884),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.001],50])
     tolerance);
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.01)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.01)),
     BOOST_MATH_TEST_VALUE(RealType, 0.0099014738435950118853363268165701079536277464949174),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50])
     tolerance * 25);  // <<< Needs a much bigger tolerance???
@@ -539,58 +650,58 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
   // 0.00990728209160670  approx
   // 0.00990147384359511  previous
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.05)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.05)),
     BOOST_MATH_TEST_VALUE(RealType, 0.047672308600129374726388900514160870747062965933891),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50])
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)),
     BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50])
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.)),
     BOOST_MATH_TEST_VALUE(RealType, 0.56714329040978387299996866221035554975381578718651),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[1],50])
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 2.)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 2.)),
     BOOST_MATH_TEST_VALUE(RealType, 0.852605502013725491346472414695317466898453300151403508772),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(2.)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 3.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.049908894964039959988697070552897904589466943706341452932),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(3.)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 5.)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 5.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.326724665242200223635099297758079660128793554638047479789),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.5)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 6.)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 6.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.432404775898300311234078007212058694786434608804302025655),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(6)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 10.)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 10.)),
     BOOST_MATH_TEST_VALUE(RealType, 1.7455280027406993830743012648753899115352881290809),
     // Output from https://www.wolframalpha.com/input/ N[lambert_w[10],50])
     tolerance);
 
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 100.)),
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 100.)),
     BOOST_MATH_TEST_VALUE(RealType, 3.3856301402900501848882443645297268674916941701578),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(100)
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1000.)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1000.)),
     BOOST_MATH_TEST_VALUE(RealType, 5.2496028524015962271260563196973062825214723860596),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1000)
     tolerance);
 
   // This fails for fixed_point type used for other tests because out of range of the type?
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)),
     BOOST_MATH_TEST_VALUE(RealType, 11.383358086140052622000156781585004289033774706019),
     // Output from https://www.wolframalpha.com/input/?i=lambert_w0(1e6)
     tolerance); //
@@ -609,36 +720,37 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     // unknown location : fatal error : in "test_range_of_values": class boost::exception_detail::clone_impl >: Error in function boost::math::lambert_w0(): Argument z = %1 too large.
     // I:\modular - boost\libs\math\test\test_lambert_w.cpp(456) : last checkpoint
 
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(1.7976931348623157e+308 / 2), // max_value/2 for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(1.7976931348623157e+308 / 2), // max_value/2 for IEEE 64-bit double.
       static_cast(702.53487067487671916110655783739076368512998658347L),
       // N[productlog[0, 1.7976931348623157*10^308 /2],50] == 702.53487067487671916110655783739076368512998658347
       tolerance);
 
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(1.7976931348623157e+308 /4), // near max_value/4 for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(1.7976931348623157e+308 /4), // near max_value/4 for IEEE 64-bit double.
       static_cast(701.8427092142920014223182853764045476L),
       // N[productlog(0, 1.7976931348623157* 10^308 /4 ), 37] =701.8427092142920014223182853764045476
       // N[productlog(0, 0.25 * 1.7976931348623157*10^307), 37]
       tolerance);
 
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(4.4942328371557893e+307), // max_value/4 for IEEE 64-bit double.
       static_cast(701.84270921429200143342782556643059L),
       // N[lambert_w[4.4942328371557893e+307], 35]  == 701.8427092142920014334278255664305887
       // as a double == 701.83341468208209
-      //                              Lambert computed 702.02379914670587
+      // Lambert computed 702.02379914670587
       0.000003); // OK Much less precise at the max edge???
 
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0((std::numeric_limits::max)()), // max_value for IEEE 64-bit double.
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0((std::numeric_limits::max)()), // max_value for IEEE 64-bit double.
       static_cast(703.2270331047701868711791887193075930),
       // N[productlog(0, 1.7976931348623157* 10^308), 37] = 703.2270331047701868711791887193075930
       //                                                    703.22700325995515 lambert W
       //                                                    703.22703310477016  Wolfram
       tolerance * 2e8); // OK but much less accurate near max.
 
-    // This test value is one epsilon close to the singularity at -exp(1) * x
+  // Compare precisions very close to the singularity.
+    // This test value is one epsilon close to the singularity at -exp(-1) * x
     // (below which the result has a non-zero imaginary part).
     RealType test_value = -exp_minus_one();
     test_value += (std::numeric_limits::epsilon() * 1);
-    BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(test_value),
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(test_value),
       BOOST_MATH_TEST_VALUE(RealType, -0.99999996349975895),
       tolerance * 1000000000);
     // -0.99999996788201051
@@ -646,30 +758,64 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     // Would not expect to get a result closer than sqrt(epsilon)?
   } //  if (std::numeric_limits::is_specialized)
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36)),
+  // Can only compare float_next for specific type T = double.
+  // Comparison with Wolfram N[productlog(0,-0.36787944117144228 ), 17]
+  // Note big loss of precision and big tolerance needed to pass.
+  BOOST_CHECK_CLOSE_FRACTION(  // Check float_next(-exp(-1) )
+    lambert_w0(BOOST_MATH_TEST_VALUE(double, -0.36787944117144228)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.99999998496215738),
+    1e8 * tolerance); // diff 6.03558e-09 v 2.2204460492503131e-16
+
+   BOOST_CHECK_CLOSE_FRACTION(  // Check  float_next(float_next(-exp(-1) ))
+    lambert_w0(BOOST_MATH_TEST_VALUE(double, -0.36787944117144222)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.99999997649828679),
+    2e7 * tolerance);// diff 2.30785e-09 v 2.2204460492503131e-16
+
+  // Compare with previous PB/FK computations at double precision.
+  BOOST_CHECK_CLOSE_FRACTION(  // Check float_next(-exp(-1) )
+    lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144228)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.99999997892657588),
+    tolerance); // diff 6.03558e-09 v 2.2204460492503131e-16
+
+  BOOST_CHECK_CLOSE_FRACTION(  // Check  float_next(float_next(-exp(-1) ))
+    lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144222)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.99999997419043196),
+    tolerance);// diff 2.30785e-09 v 2.2204460492503131e-16
+
+  // Comparison with Wolfram N[productlog(0,-0.36787944117144228 ), 17]
+  // Using conversion from double to higher precision cpp_bin_float_quad
+  using boost::multiprecision::cpp_bin_float_quad;
+  BOOST_CHECK_CLOSE_FRACTION(  // Check float_next(-exp(-1) )
+    lambert_w0(BOOST_MATH_TEST_VALUE(cpp_bin_float_quad, -0.36787944117144228)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.99999998496215738),
+    tolerance); // OK
+
+  BOOST_CHECK_CLOSE_FRACTION(  // Check  float_next(float_next(-exp(-1) ))
+    lambert_w0(BOOST_MATH_TEST_VALUE(cpp_bin_float_quad, -0.36787944117144222)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.99999997649828679),
+    tolerance);// OK
+
+  // z increasingly close to singularity.
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36)),
     BOOST_MATH_TEST_VALUE(RealType, -0.8060843159708177782855213616209920019974599683466713016),
     2 * tolerance); // -0.806084335
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.365)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.365)),
     BOOST_MATH_TEST_VALUE(RealType, -0.8798200914159538111724840007674053239388642469453350954),
     5 * tolerance); // Note 5 * tolerance
 
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.3678)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.3678)),
     BOOST_MATH_TEST_VALUE(RealType, -0.9793607149578284774761844434886481686055949229547379368),
    15 * tolerance); // Note 15 * tolerance when this close to singularity.
 
-
-
   // Just using series approximation (Fukushima switch at -0.35, but JM at 0.01 of singularity < -0.3679).
   // N[productlog(-0.351), 50] = -0.72398644140937651483634596143951001600417138085814
   // N[productlog(-0.351), 55] = -0.7239864414093765148363459614395100160041713808581379727
-  BOOST_CHECK_CLOSE_FRACTION(jm_lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)),
     BOOST_MATH_TEST_VALUE(RealType, -0.72398644140937651483634596143951001600417138085814),
     10 * tolerance); // Note was 2 * tolerance
-  // fails for JM version.
 
-
-   // Not using near_singularity series approximation.
+   // Check value just not using near_singularity series approximation (and using rational polynomial instead).
     BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)),
       BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545),
       // Output from https://www.wolframalpha.com/input/

From 5e78b298dad8d249655e7298521b820a39ac909b Mon Sep 17 00:00:00 2001
From: Nick Thompson 
Date: Fri, 2 Feb 2018 21:33:54 -0600
Subject: [PATCH 34/71] [ci skip] Use Unix-style paths. Add tests for lambert-W
 testing integrals of the Lambert-W function.

---
 .../math/special_functions/lambert_w.hpp      | 10 +++---
 test/test_lambert_w.cpp                       | 34 ++++++++++++++++++-
 2 files changed, 37 insertions(+), 7 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index d8514ab4d..28b84d58c 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -16,8 +16,6 @@
 #  pragma warning (disable: 4127) // warning C4127: conditional expression is constant.
 #endif // _MSC_VER
 
-//#include 
-
 /*
 Implementation of an algorithm for the Lambert W0 and W-1 real-only functions.
 
@@ -83,7 +81,7 @@ typedef double lookup_t; // Type for lookup table (double or float, or even long
 
 //#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp"
 // #include "lambert_w_lookup_table.ipp" // Boost.Math version.
-#include 
+#include 
 
 namespace boost {
 namespace math {
@@ -1649,8 +1647,8 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955
 
     // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth,
-    // “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
-    // François Chapeau-Blondeau and Abdelilah Monir
+    // On the Lambert W function, Adv.Comput.Math., vol. 5, pp. 329-359, 1996.
+    // Francois Chapeau-Blondeau and Abdelilah Monir
     // Numerical Evaluation of the Lambert W Function
     // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002
     // https://pdfs.semanticscholar.org/7a5a/76a9369586dd0dd34dda156d8f2779d1fd59.pdf
@@ -1862,7 +1860,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
         return result; // Halley
       } // schroeder or Schroeder and Halley.
     } // more than 10 digits2
-  } 
+  }
 } // template T lambert_wm1_imp(const T z)
 } // namespace lambert_w_detail
 
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index 30611d733..c2798a55e 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -13,7 +13,9 @@
 #include    // for BOOST_MSVC definition.
 #include    // for BOOST_MSVC versions.
 #include  // for real_concept
-
+#include  // for integral tests
+#include  // for integral tests
+#include  // for integral tests
 // Boost macros
 #define BOOST_TEST_MAIN
 #define BOOST_LIB_DIAGNOSTIC "on" // Report library file details.
@@ -891,5 +893,35 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
   */
 
 
+template
+void test_integrals()
+{
+    // Integral of the Lambert W function:
+    // https://en.wikipedia.org/wiki/Lambert_W_function
+    using boost::math::quadrature::tanh_sinh;
+    using boost::math::quadrature::exp_sinh;
+    using std::sqrt;
+    Real tol = std::numeric_limits::epsilon();
+    tanh_sinh ts;
+    Real a = 0;
+    Real b = boost::math::constants::e();
+    Real x = ts.integrate)>(lambert_w0, a, b);
+    BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::e() -1, tol);
+
+    exp_sinh es;
+    auto f = [](Real x)->Real { return lambert_w0(x)/(x*sqrt(x)); };
+    x = es.integrate(f);
+    BOOST_CHECK_CLOSE_FRACTION(x, 2*boost::math::constants::root_two_pi(), tol);
 
 
+    f = [](Real x)->Real { return lambert_w0(1/(x*x)); };
+    x = es.integrate(f);
+    BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol);
+}
+
+BOOST_AUTO_TEST_CASE(test_integrals)
+{
+    test_integrals();
+    test_integrals();
+    test_integrals();
+}

From 8a7539c70793bbda6619e7ff04496ba272d2592b Mon Sep 17 00:00:00 2001
From: Nick Thompson 
Date: Fri, 9 Feb 2018 13:57:25 -0600
Subject: [PATCH 35/71] [ci skip] Pick the low hanging fruit of the Lambert-W
 derivative. Remove a few typos from the documentation.

---
 doc/sf/lambert_w.qbk                          | 22 +++++----
 .../math/special_functions/lambert_w.hpp      | 45 +++++++++++++++++++
 include/boost/math/tools/test_value.hpp       |  4 +-
 3 files changed, 60 insertions(+), 11 deletions(-)

diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk
index b939eeb61..13e0a2ac5 100644
--- a/doc/sf/lambert_w.qbk
+++ b/doc/sf/lambert_w.qbk
@@ -11,12 +11,18 @@
    template 
    ``__sf_result`` lambert_w0(T z); // W0 branch, default precision.
 
+   template 
+   ``__sf_result`` lambert_w0_prime(T z); // W0 branch derivative
+
    template 
    ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy controlled precision.
 
-    template 
+   template 
    ``__sf_result`` lambert_wm1(T z); // W-1 branch.
 
+   template 
+   ``__sf_result`` lambert_wm1_prime(T z); //W -1 branch derivative
+
    template 
    ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy controlled precision.
    // Use `lambert_wm1(z, policy >())` // If speed is more important than last-digit precision.
@@ -32,7 +38,7 @@ It is also called the Omega function, the inverse function of ['f(W) = W e[super
 
 On the z-interval \[0, [infin]\] there is just one real solution.
 On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-.
-Two principal branches functions called `lambert_W0` and `lambert_Wm1` are provided by this real-only implementation.
+Two principal branches functions called `lambert_w0` and `lambert_wm1` are provided by Boost's real-only implementation.
 
 In the graphs below, the red line is the W0 branch, and the blue line the W-1 branch.
 
@@ -45,7 +51,7 @@ In the graphs below, the red line is the W0 branch, and the blue line the W-1 br
 There is a singularity where the branches meet at argument [^z = -1/e] [cong] [^ -0.367879...] and [^W = -1].
 
 This implementation computes the two real (not complex) branches W0 and W-1
-with the functions `lambert_w0` and `lambert_wm2` from the first [^z] argument.
+with the functions `lambert_w0` and `lambert_wm1` from the first [^z] argument.
 
 For C++ types `float` the maximum z argument `(std::numeric_limits<>::max)()`
 Lambert_w0(3.2e+38) = 84.29,
@@ -61,7 +67,7 @@ Refer to __policy_section for more details and see examples below.
 
 The Lambert W function has a myriad of applications.
 Corless et al. provide a comprehensive description of the range of applications,
-from the mathematical, like interated exponentiation and asymptotic roots of trinomials,
+from the mathematical, like iterated exponentiation and asymptotic roots of trinomials,
 to the real-world such as the range of a jet plane, enzyme kinetics, water movement in soil,
 epidemics, and diode current (an example replicated [@../../example/lambert_w_diode.cpp here]).
 Since the publication of their landmark paper, there have been many more applications, and
@@ -414,10 +420,10 @@ We also considered using __newton method.
   if (f(w) / f'(w) -1 < tolerance
   w1 = w0 - (expw0 * (w0 + 1)); // Refine new Newton/Raphson estimate.
 ``
-but concluded that since Newton/Raphson's method takes typically 6 iterations to converge within tolerance,
+but concluded that since the Newton-Raphson method takes typically 6 iterations to converge within tolerance,
 whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ulp,
-so Newton/Raphson's method unlikely to be quicker
-than the additional cost of computating the 2nd derivative for Halley's method,
+so the Newton-Raphson method is unlikely to be quicker
+than the additional cost of computing the 2nd derivative for Halley's method,
 in this case requiring an expensive exponential function evaluation on each step.
 
 
@@ -514,7 +520,7 @@ Here we use the first two terms of equation 4.19:
 This gives a useful precision, and this guess can be returned by setting the precision to `digits2 == 11` or less.
 
   using boost::math::policies::digits2;
-  double z = z = 4.e+29;
+  double z = 4.e+29;
   r = lambert_w0(z, policy >());
   // lambert_wm1(3.9999999999999997e+29, policy >() ) = 64.001325187470187
 
diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 28b84d58c..87b8734c9 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -1939,6 +1939,51 @@ lambert_wm1(T z)
 } // lambert_wm1(T z)
 
 
+template 
+typename tools::promote_args::type
+lambert_w0_prime(T z)
+{
+    typedef typename tools::promote_args::type result_type;
+    using std::numeric_limits;
+    if (z == 0)
+    {
+        return static_cast(1);
+    }
+
+    // This is the sensible choice if we regard the Lambert-W function as complex analytic.
+    // Of course on the real line, it's just undefined.
+    if (z == - boost::math::constants::exp_minus_one())
+    {
+        return numeric_limits::infinity();
+    }
+    // if z < -1/e, we'll let lambert_w0 do the error handling:
+    result_type w = lambert_w0(result_type(z));
+    // If w ~ -1, then presumably this can get inaccurate.
+    // Is there an accurate way to evaluate 1 + W(-1/e + eps)? Yes: This is discussed in the Princeton Companion to Applied Mathmatics, 'The Lambert-W function', Section 1.3: Series and Generating Functions.
+    // 1 + W(-1/e + x) ~ sqrt(2ex). I am not convinced this formula is more accurate than the naive one.
+    // However, for z != -1/e, we never get rounded to w = -1 in any precision I've tested (up to cpp_bin_float_100).
+    return w/(z*(1+w));
+}
+
+template 
+typename tools::promote_args::type
+lambert_wm1_prime(T z)
+{
+    using std::numeric_limits;
+    typedef typename tools::promote_args::type result_type;
+    if (z == 0)
+    {
+        return static_cast(1);
+    }
+    if (z == - boost::math::constants::exp_minus_one())
+    {
+        return -numeric_limits::infinity();
+    }
+    result_type w = lambert_wm1(z);
+    return w/(z*(1+w));
+}
+
+
 }} //boost::math namespaces
 
 #endif // #ifdef BOOST_MATH_LAMBERTW0_HPP
diff --git a/include/boost/math/tools/test_value.hpp b/include/boost/math/tools/test_value.hpp
index aba66cf6b..e9feb6281 100644
--- a/include/boost/math/tools/test_value.hpp
+++ b/include/boost/math/tools/test_value.hpp
@@ -32,7 +32,7 @@
 #include 
 
 // Built-in/fundamental GCC float128 or Intel Quad 128-bit type, if available.
-#ifdef __GNUC__
+#ifdef BOOST_HAS_FLOAT128
 #include  // Not available for MSVC.
 // sets BOOST_MP_USE_FLOAT128 for GCC
 using boost::multiprecision::float128;
@@ -123,5 +123,3 @@ inline T create_test_value(largest_float, const char* str, const boost::mpl::fal
     boost::is_constructible::value>()\
 )
 #endif // TEST_VALUE_HPP
-
-

From 0a8d5bfb3703e3fc6653080dbf88b94565b75c12 Mon Sep 17 00:00:00 2001
From: Nick Thompson 
Date: Fri, 9 Feb 2018 14:36:05 -0600
Subject: [PATCH 36/71] [ci skip] Fix derivative at singularity at z = 0 of
 Lambert W -1.

---
 include/boost/math/special_functions/lambert_w.hpp | 8 ++------
 1 file changed, 2 insertions(+), 6 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 87b8734c9..bdd1c029f 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -1971,11 +1971,7 @@ lambert_wm1_prime(T z)
 {
     using std::numeric_limits;
     typedef typename tools::promote_args::type result_type;
-    if (z == 0)
-    {
-        return static_cast(1);
-    }
-    if (z == - boost::math::constants::exp_minus_one())
+    if (z == 0 || z == - boost::math::constants::exp_minus_one())
     {
         return -numeric_limits::infinity();
     }
@@ -1986,4 +1982,4 @@ lambert_wm1_prime(T z)
 
 }} //boost::math namespaces
 
-#endif // #ifdef BOOST_MATH_LAMBERTW0_HPP
+#endif // #ifdef BOOST_MATH_LAMBERTW_HPP

From de4d578fc56ff548d1222834fc0555b2ebd8122d Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Mon, 19 Feb 2018 16:54:52 +0000
Subject: [PATCH 37/71] deconflict lambert_w.hpp

---
 doc/background/remez.qbk                      |  76 +++----
 doc/html/index.html                           |   2 +-
 doc/html/indexes/s01.html                     |  10 +-
 doc/html/indexes/s02.html                     |   2 +-
 doc/html/indexes/s03.html                     |   2 +-
 doc/html/indexes/s04.html                     |   2 +-
 doc/html/indexes/s05.html                     |  12 +-
 doc/html/math_toolkit/conventions.html        |   2 +-
 doc/html/math_toolkit/navigation.html         |   2 +-
 .../pol_tutorial/what_is_a_policy.html        |   8 +-
 doc/html/math_toolkit/remez.html              |   2 +-
 doc/math.qbk                                  |   9 +-
 doc/sf/lambert_w.qbk                          | 115 ++++++----
 example/lambert_w_simple_examples.cpp         |   7 -
 .../math/special_functions/lambert_w.hpp      | 197 ++++++++++--------
 .../lambert_w_lookup_table.ipp                | 154 +++++++-------
 .../math/special_functions/lambert_w_pb.hpp   |  67 +++---
 test/test_lambert_w.cpp                       |  27 +--
 18 files changed, 384 insertions(+), 312 deletions(-)

diff --git a/doc/background/remez.qbk b/doc/background/remez.qbk
index 6dd2718d2..f7ebe4019 100644
--- a/doc/background/remez.qbk
+++ b/doc/background/remez.qbk
@@ -8,9 +8,9 @@ should consult your favorite textbook.
 
 Imagine that you want to approximate some function f(x) by way of a rational
 function R(x), where R(x) may be either a polynomial P(x) or a ratio of two
-polynomials P(x)/Q(x) (a rational function).  Initially we'll concentrate on the 
-polynomial case, as it's by far the easier to deal with, later we'll extend 
-to the full rational function case.  
+polynomials P(x)/Q(x) (a rational function).  Initially we'll concentrate on the
+polynomial case, as it's by far the easier to deal with, later we'll extend
+to the full rational function case.
 
 We want to find the "best" rational approximation, where
 "best" is defined to be the approximation that has the least deviation
@@ -61,11 +61,11 @@ the range \[-1, 1\].
 
 Before we can begin the Remez method, we must obtain an initial value
 for the location of the extrema of the error function.  We could "guess"
-these, but a much closer first approximation can be obtained by first  
+these, but a much closer first approximation can be obtained by first
 constructing an interpolated polynomial approximation to f(x).
 
 In order to obtain the N+1 coefficients of the interpolated polynomial
-we need N+1 points (x[sub 0]...x[sub N]): with our interpolated form 
+we need N+1 points (x[sub 0]...x[sub N]): with our interpolated form
 passing through each of those points
 that yields N+1 simultaneous equations:
 
@@ -73,12 +73,12 @@ f(x[sub i]) = P(x[sub i]) = c[sub 0] + c[sub 1]x[sub i] ... + c[sub N]x[sub i][s
 
 Which can be solved for the coefficients c[sub 0]...c[sub N] in P(x).
 
-Obviously this is not a minimax solution, indeed our only guarantee is that f(x) and 
+Obviously this is not a minimax solution, indeed our only guarantee is that f(x) and
 P(x) touch at N+1 locations, away from those points the error may be arbitrarily
 large.  However, we would clearly like this initial approximation to be as close to
 f(x) as possible, and it turns out that using the zeros of an orthogonal polynomial
-as the initial interpolation points is a good choice.  In our example we'll use the 
-zeros of a Chebyshev polynomial as these are particularly easy to calculate, 
+as the initial interpolation points is a good choice.  In our example we'll use the
+zeros of a Chebyshev polynomial as these are particularly easy to calculate,
 interpolating for a polynomial of degree 4, and measuring /relative error/
 we get the following error function:
 
@@ -86,7 +86,7 @@ we get the following error function:
 
 Which has a peak relative error of 1.2x10[super -3].
 
-While this is a pretty good approximation already, judging by the 
+While this is a pretty good approximation already, judging by the
 shape of the error function we can clearly do better.  Before starting
 on the Remez method propper, we have one more step to perform: locate
 all the extrema of the error function, and store
@@ -101,7 +101,7 @@ achieve, and typically is very close to the minimax solution.
 
 However, if we want to optimise for /relative error/, or if the approximation
 is a rational function, then the initial Chebyshev solution can be quite far
-from the ideal minimax solution.  
+from the ideal minimax solution.
 
 A more technical discussion of the theory involved can be found in this
 [@http://math.fullerton.edu/mathews/n2003/ChebyshevPolyMod.html online course].]
@@ -118,7 +118,7 @@ To obtain the error term E, and the coefficients of the polynomial P(x).
 
 This gives us a new approximation to f(x) that has the same error /E/ at
 each of the control points, and whose error function ['alternates in sign]
-at the control points.  This is still not necessarily the minimax 
+at the control points.  This is still not necessarily the minimax
 solution though: since the control points may not be at the extrema of the error
 function.  After this first step here's what our approximation's error
 function looks like:
@@ -131,10 +131,10 @@ dropped to 5.6x10[super -4].
 
 [h4 Remez Step 2]
 
-The second step is to locate the extrema of the new approximation, which we do 
+The second step is to locate the extrema of the new approximation, which we do
 in two stages:  first, since the error function changes sign at each
 control point, we must have N+1 roots of the error function located between
-each pair of N+2 control points.  Once these roots are found by standard root finding 
+each pair of N+2 control points.  Once these roots are found by standard root finding
 techniques, we know that N extrema are bracketed between each pair of
 roots, plus two more between the endpoints of the range and the first and last roots.
 The N+2 extrema can then be found using standard function minimisation techniques.
@@ -195,10 +195,10 @@ polynomial alternatives.  For example, if we takes our previous example
 of an approximation to e[super x], we obtained 5x10[super -4] accuracy
 with an order 4 polynomial.  If we move two of the unknowns into the denominator
 to give a pair of order 2 polynomials, and re-minimise, then the peak relative error drops
-to 8.7x10[super -5].  That's a 5 fold increase in accuracy, for the same number 
+to 8.7x10[super -5].  That's a 5 fold increase in accuracy, for the same number
 of terms overall.
 
-[h4 Practical Considerations]
+[h4:remez_practical Practical Considerations]
 
 Most treatises on approximation theory stop at this point.  However, from
 a practical point of view, most of the work involves finding the right
@@ -211,12 +211,12 @@ f(x) = R(x)
 
 But this will converge to a useful approximation only if f(x) is smooth.  In
 addition round-off errors when evaluating the rational form mean that this
-will never get closer than within a few epsilon of machine precision.  
+will never get closer than within a few epsilon of machine precision.
 Therefore this form of direct approximation is often reserved for situations
 where we want efficiency, rather than accuracy.
 
 The first step in improving the situation is generally to split f(x) into
-a dominant part that we can compute accurately by another method, and a 
+a dominant part that we can compute accurately by another method, and a
 slowly changing remainder which can be approximated by a rational approximation.
 We might be tempted to write:
 
@@ -235,7 +235,7 @@ to the constant /c/, that error will effectively get wiped out when R(x) is adde
 
 The difficult part is obviously finding the right g(x) to extract from your
 function: often the asymptotic behaviour of the function will give a clue, so
-for example the function __erfc becomes proportional to 
+for example the function __erfc becomes proportional to
 e[super -x[super 2]]\/x as x becomes large.  Therefore using:
 
 erfc(z) = (C + R(x)) e[super -x[super 2]]/x
@@ -262,15 +262,15 @@ the roots, the approximation is nonetheless useless.
 Assuming that the approximation does not have any fatal errors, and that the only
 issue is converging adequately on the minimax solution, the aim is to
 get as close as possible to the minimax solution before beginning the Remez method.
-Using the zeros of a Chebyshev polynomial for the initial interpolation is a 
+Using the zeros of a Chebyshev polynomial for the initial interpolation is a
 good start, but may not be ideal when dealing with relative errors and\/or
 rational (rather than polynomial) approximations.  One approach is to skew
 the initial interpolation points to one end: for example if we raise the
-roots of the Chebyshev polynomial to a positive power greater than 1 
-then the roots will be skewed towards the middle of the \[-1,1\] interval, 
+roots of the Chebyshev polynomial to a positive power greater than 1
+then the roots will be skewed towards the middle of the \[-1,1\] interval,
 while 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 
+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[super x][space] over \[-1,1\], the initial
 interpolated form was some way from the minimax solution:
 
@@ -287,7 +287,7 @@ our desired minimax solution (5x10[super -4]).
 
 [h4 Remez Method Checklist]
 
-The following lists some of the things to check if the Remez method goes wrong, 
+The following lists some of the things to check if the Remez method goes wrong,
 it is by no means an exhaustive list, but is provided in the hopes that it will
 prove useful.
 
@@ -312,7 +312,7 @@ location, try starting from a different location.
 * If a rational function won't converge, one can minimise a polynomial
 (which presents no problems), then rotate one term from the numerator to
 the denominator and minimise again.  In theory one can continue moving
-terms one at a time from numerator to denominator, and then re-minimising, 
+terms one at a time from numerator to denominator, and then re-minimising,
 retaining the last set of control points at each stage.
 * Try using a smaller interval.  It may also be possible to optimise over
 one (small) interval, rescale the control points over a larger interval,
@@ -325,41 +325,41 @@ over, say \[0, b\], for some smallish value /b/.
 The original references for the Remez Method and it's extension
 to rational functions are unfortunately in Russian:
 
-Remez, E.Ya., ['Fundamentals of numerical methods for Chebyshev approximations], 
+Remez, E.Ya., ['Fundamentals of numerical methods for Chebyshev approximations],
 "Naukova Dumka", Kiev, 1969.
 
-Remez, E.Ya., Gavrilyuk, V.T., ['Computer development of certain approaches 
-to the approximate construction of solutions of Chebyshev problems 
+Remez, E.Ya., Gavrilyuk, V.T., ['Computer development of certain approaches
+to the approximate construction of solutions of Chebyshev problems
 nonlinearly depending on parameters], Ukr. Mat. Zh. 12 (1960), 324-338.
 
-Gavrilyuk, V.T., ['Generalization of the first polynomial algorithm of 
-E.Ya.Remez for the problem of constructing rational-fractional 
+Gavrilyuk, V.T., ['Generalization of the first polynomial algorithm of
+E.Ya.Remez for the problem of constructing rational-fractional
 Chebyshev approximations], Ukr. Mat. Zh. 16 (1961), 575-585.
 
 Some English language sources include:
 
-Fraser, W., Hart, J.F., ['On the computation of rational approximations 
+Fraser, W., Hart, J.F., ['On the computation of rational approximations
 to continuous functions], Comm. of the ACM 5 (1962), 401-403, 414.
 
-Ralston, A., ['Rational Chebyshev approximation by Remes' algorithms], 
+Ralston, A., ['Rational Chebyshev approximation by Remes' algorithms],
 Numer.Math. 7 (1965), no. 4, 322-330.
 
-A. Ralston, ['Rational Chebyshev approximation, Mathematical 
-Methods for Digital Computers v. 2] (Ralston A., Wilf H., eds.), 
+A. Ralston, ['Rational Chebyshev approximation, Mathematical
+Methods for Digital Computers v. 2] (Ralston A., Wilf H., eds.),
 Wiley, New York, 1967, pp. 264-284.
 
 Hart, J.F. e.a., ['Computer approximations], Wiley, New York a.o., 1968.
 
-Cody, W.J., Fraser, W., Hart, J.F., ['Rational Chebyshev approximation 
+Cody, W.J., Fraser, W., Hart, J.F., ['Rational Chebyshev approximation
 using linear equations], Numer.Math. 12 (1968), 242-251.
 
-Cody, W.J., ['A survey of practical rational and polynomial 
+Cody, W.J., ['A survey of practical rational and polynomial
 approximation of functions], SIAM Review 12 (1970), no. 3, 400-423.
 
-Barrar, R.B., Loeb, H.J., ['On the Remez algorithm for non-linear 
+Barrar, R.B., Loeb, H.J., ['On the Remez algorithm for non-linear
 families], Numer.Math. 15 (1970), 382-391.
 
-Dunham, Ch.B., ['Convergence of the Fraser-Hart algorithm for rational 
+Dunham, Ch.B., ['Convergence of the Fraser-Hart algorithm for rational
 Chebyshev approximation], Math. Comp. 29 (1975), no. 132, 1078-1082.
 
 G. L. Litvinov, ['Approximate construction of rational
@@ -368,7 +368,7 @@ Russian Journal of Mathematical Physics, vol.1, No. 3, 1994.
 
 [endsect][/section:remez The Remez Method]
 
-[/ 
+[/
   Copyright 2006 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
diff --git a/doc/html/index.html b/doc/html/index.html
index 9cdba317b..cf86d0e63 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -120,7 +120,7 @@ This manual is also available in 
        
-
+
        Last revised: December 18, 2017 at 18:05:20 GMT
        Last revised: February 01, 2018 at 15:50:54 GMT
        		
 
        		
 
        
 
        
diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html
index 8f19b405c..6de54b099 100644
--- a/doc/html/indexes/s01.html
+++ b/doc/html/indexes/s01.html
@@ -24,7 +24,7 @@
 
 
        
 
        
-Function Index
        
+Function Index
        
 
        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
        
 
        
 
        
@@ -420,6 +420,10 @@
 
        
 
 
      • 
+
        close
        
+
        
+
        • 
+
      • 
 
        complement
        
 
        
 
        • 
 
      • 
+
        step
        
+
        
+
        • 
+
      • 
 
        subtraction
        
 
        
 
        • 
diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html
index 969845731..b3279a834 100644
--- a/doc/html/indexes/s02.html
+++ b/doc/html/indexes/s02.html
@@ -24,7 +24,7 @@
 
        
 
        
 
        
-Class Index
        
+Class Index
        
 
        A B C D E F G H I L M N O P Q R S T U W
        
 
        
 
        
diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html
index 99dca7502..4fa43be01 100644
--- a/doc/html/indexes/s03.html
+++ b/doc/html/indexes/s03.html
@@ -24,7 +24,7 @@
 
        
 
        
 
        
-Typedef Index
        
+Typedef Index
        
 
        A B C D E F G H I L N O P R S T U V W
        
 
        
 
        
diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html
index 77f3997ec..6f07c37ca 100644
--- a/doc/html/indexes/s04.html
+++ b/doc/html/indexes/s04.html
@@ -24,7 +24,7 @@
 
        
 
        
 
        
-Macro Index
        
+Macro Index
        
 
        B F
        
 
        
 
        
diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html
index 2dcaf5d10..edac1cc56 100644
--- a/doc/html/indexes/s05.html
+++ b/doc/html/indexes/s05.html
@@ -23,7 +23,7 @@
 
        
 
        
 
        
-Index
        
+Index
        
 
        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
        
 
        
 
        
@@ -1662,6 +1662,10 @@
 
 
      • chi_squared_distribution
        • 
 
      • 
+
        close
        
+
        
+
        • 
+
      • 
 
        Comparing Different Compilers
        
 
        
 
        • 
@@ -4851,6 +4855,7 @@
 
      • refinement
        • 
 
      • required
        • 
 
      • small
        • 
+
      • step
        • 
 
      • W
        • 
 
      • zero
        • 
 
        
@@ -5074,6 +5079,7 @@
 
        
 
 
      • 
+
        step
        
+
        
+
        • 
+
      • 
 
        Students t Distribution
        
 
          
 
        • accuracy
          • 
diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html
index 84747b896..8ff3da6d2 100644
--- a/doc/html/math_toolkit/conventions.html
+++ b/doc/html/math_toolkit/conventions.html
@@ -27,7 +27,7 @@
 Document Conventions
 
        
 
        
-      
+      
     
        
 
        
       This documentation aims to use of the following naming and formatting conventions.
diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html
index 955b0fcb3..2d5689a3e 100644
--- a/doc/html/math_toolkit/navigation.html
+++ b/doc/html/math_toolkit/navigation.html
@@ -27,7 +27,7 @@
 Navigation
 
 
        
-      
+      
     
        
 
        
       Boost.Math documentation is provided in both HTML and PDF formats.
diff --git a/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html b/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html
index cb7e338b0..b7cf9df0c 100644
--- a/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html
+++ b/doc/html/math_toolkit/pol_tutorial/what_is_a_policy.html
@@ -62,13 +62,13 @@
         of user-selected policies (sometimes called a type-list).
       
        
 
        
-        Many policy
+        Over a dozen policy
         defaults are provided, so most of the time you can ignore the policy
-        framework, but you can overwrite with your own policies to give detailed
-        control, for example:
+        framework, but you can overwrite the defaults with your own policies to give
+        detailed control, for example:
       
        
 
        using namespace boost::math::policies;
-//
+
 // Define a policy that sets ::errno on overflow,
 // and does not promote double to long double internally,
 // and only aims for precision of only 3 decimal digits,
diff --git a/doc/html/math_toolkit/remez.html b/doc/html/math_toolkit/remez.html
index 118bee043..76a8bb907 100644
--- a/doc/html/math_toolkit/remez.html
+++ b/doc/html/math_toolkit/remez.html
@@ -297,7 +297,7 @@
     
        
 
        
 
-      Practical
+      Practical
       Considerations
     
        
 
        
diff --git a/doc/math.qbk b/doc/math.qbk
index 9165e08cb..d3288d3ea 100644
--- a/doc/math.qbk
+++ b/doc/math.qbk
@@ -113,7 +113,7 @@ and use the function's name as the link text.]
 [def __brent_minima_example [link math_toolkit.roots.brent_minima.example Brent's method example]]
 [def __newton [link math_toolkit.roots.roots_deriv.newton Newton-Raphson iteration]]
 [def __halley [link math_toolkit.roots.roots_deriv.halley Halley]]
-[def __schroder [link math_toolkit.roots.roots_deriv.schroder Schr'''ö'''der]]
+[def __schroder [link math_toolkit.roots.roots_deriv.schroder Schr'''ö'''der]] [/ link should really be __schroeder]
 [def __brent_minima_example [link math_toolkit.roots.brent_minima.example Brent minima finding example]]
 [def __bisection [link math_toolkit.roots.roots_noderiv.bisect bisection]]
 [def __bisect [link math_toolkit.roots.roots_noderiv.bisect bisect]]
@@ -222,7 +222,7 @@ and use the function's name as the link text.]
 [def __lambert_w_precision[link math_toolkit.lambert_w.precision precision]]
 [def __lambert_w_examples [link math_toolkit.lambert_w.examples examples]]
 [def __lambert_w_wm1_near_zero [link math_toolkit.lambert_w.wm1_near_zero wm1_near_zero]]
-
+[def __lambert_w_references [link math_toolkit.lambert_w.references references]]
 
 
 [/Airy Functions]
@@ -388,6 +388,8 @@ and use the function's name as the link text.]
 
 [def __real_concept [link math_toolkit.real_concepts  real concept]]
 [def __next_float [link math_toolkit.next_float Adjacent Floating-Point Values]]
+[def __remez_practical [link math_toolkit.remez.practical remez_practical]]
+
 
 [/ External links]
 [def __gsl [@http://www.gnu.org/software/gsl/ GSL-1.9]]
@@ -443,7 +445,8 @@ and use the function's name as the link text.]
 [def __Lambert_W [@http://en.wikipedia.org/wiki/Lambert_W_function Lambert W function]]
 [def __CUDA [@https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html#c-cplusplus-language-support CUDA NVidia GPU C/C++ language support]]
 [def __Luu_thesis [@http://discovery.ucl.ac.uk/1482128/1/Luu_thesis.pdf Thomas Luu, Thesis, University College London (2015)]]
-
+[def __rational_function [@https://en.wikipedia.org/wiki/Rational_function rational function]]
+[def __remez [@http://en.wikipedia.org/wiki/Remez_algorithm Remez algorithm]]
 
 [/ Some composite templates]
 [template super[x]''''''[x]'''''']
diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk
index 13e0a2ac5..0c07ec710 100644
--- a/doc/sf/lambert_w.qbk
+++ b/doc/sf/lambert_w.qbk
@@ -127,7 +127,7 @@ at least to thousands of decimal digits, but not shown here for brevity.
 See [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp]
 ).
 
-Policies can be used to control precision (a tiny less precision gives a significant speedup):
+Policies can be used to control precision (a tiny bit less precision gives a significant speed-up):
 
 [lambert_w_simple_examples_precision_policies]
 
@@ -139,8 +139,8 @@ and to control what action to take on errors:
 
 [lambert_w_simple_examples_error_message_1]
 
-Show error reporting if passing a value to `lambert_w0` that is out of range,
-and probably was meant to be passed to `lambert_wm1` instead.
+Show error reporting if a value is passed to `lambert_w0` that is out of range,
+and was probably meant to be passed to `lambert_wm1` instead.
 
 [lambert_w_simple_examples_out_of_range]
 
@@ -208,7 +208,7 @@ The symbolic algebra program __Maple also computes Lambert W to an arbitrary pre
 
 [h4:precision Controlling the compromise between Precision and Speed]
 
-The compromise between precision and speed can be controlled using __precision_policy.
+This implementation allows the compromise between precision and speed to be controlled using __precision_policy.
 
 Using the default policy, all the functions usually return values within a few __ulp
 for the floating-point type, except for very small arguments very near zero,
@@ -216,10 +216,10 @@ and for arguments very close to the singularity at the branch point.
 
 By default, this implementation provides the best possible precision
 (adding a __halley refinement, but without using __multiprecision higher precision types)
-making it nearly twice as slow as Fukushima's algorithm,
+making it slower than Fukushima's or other algorithms,
 (Boost.Math generally prefers accuracy over speed).
 However, it will return at intermediate stages if the precision specified in the policy has been met,
-usually at least halving the execution time.
+usually at least halving the execution time, and so is, we believe, the fastest algorithm now available.
 
 It is convenient to define some `using` statements when using __policy_section to control precision.
 
@@ -229,7 +229,7 @@ It is convenient to define some `using` statements when using __policy_section t
     using boost::math::policies::digits10; // Precision as decimal digits.
 
 [tip Because some macros and metaprogramming are used by the implementation of policies,
-some ways of expressing these items may confuse the compiler and Visual Studio Intellisense.]
+some ways of naming these items may confuse Visual Studio Intellisense and the compiler.]
 
 Precision targets can be specified in bits using `digits2` or decimal using `digits10`.
 These are related by `digits10 = log10(2) * digits2 where log10(2) = 0.30103`.
@@ -271,10 +271,10 @@ The final Schroeder refinement is skipped by this implementation if
 `(digits2 <= (std::numeric_limits::digits - 3))`
 3 bits less than the maximum for the type `std::numeric_limits::digits`.
 
-For type `double`, the switch is at `policy `,
+For type `double`, the switch is at `policy`,
 so this is recommended for general use when speed is important.
 
-[tip Use `lambert_w0(z, policy >())` if speed is more important than the ultimate precision,
+[tip Use `lambert_w0(z, policy >())` or `lambert_w0(z, policy >())`  if speed is more important than the ultimate precision,
 for example, Monte Carlo applications.]
 
 If speed is [*very] important then `digits2<10>` only using Bisection alone might suffice:
@@ -293,7 +293,7 @@ the precision gain from the Schroeder and Halley is small.
 
 For floating-point types with precision greater than __fundamental_types,
 a `double` evaluation is used as a first approximation followed by Halley refinement,
-so that there is is little to gain trying to control precision.
+so that there is is little to gain in trying to control precision.
 Higher precision types are always going to be [*very, very much slower].
 
 For more examples of controlling precision, see
@@ -341,7 +341,7 @@ and anyway it only covers a tiny fraction of the range of possible z arguments v
 
 [h4:compilers Compilers]
 
-The code has been tested on VS 15.5.2, Clang 5.0.0 and GCC 7.1.0 but it is expected to work on all C++ compilers.
+The code has been tested on VS 15.5.5, Clang 5.0.0 and GCC 7.2.0 but it is expected to work on all C++ compilers.
 
 [h5:diagnostics Diagnostics Macros]
 
@@ -366,20 +366,21 @@ or defined in a jamfile.v2:  `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS`
 
 ['First be right, then be fast.]
 
-There are many previous implementations with increasing accuracy and speed. See references below.
+There are many previous implementations, each with increasing accuracy and speed.
+See __lambert_w_references below.
 
 For most of the range of ['z] arguments, some initial approximation is followed by a single refinement,
-often using Halley or similar method, and gives a useful precision.
-To get a better precision, additional refinements, probably iterative, may be needed
-for example, using __halley or __schroder methods.
-For speed, several implementations avoid evaluation of a test
-using the exponential function calculating that a single refinement step will suffice,
+often using Halley or similar method, gives a useful precision.
+For speed, several implementations avoid evaluation of a test using the exponential function,
+estimating that a single refinement step will suffice,
 but these rarely get to the best result possible.
+To get a better precision, additional refinements, probably iterative, are needed
+for example, using __halley or __schroder methods.
 
-For the most precise results possible, for C++, closest to the nearest representation for the type,
+For C++, the most precise results possible, closest to the nearest __representable for the C++ type being used,
 it is usually necessary to use a higher precision type for intermediate computation,
 finally casting back to the smaller desired result type.
-This strategy is used by Maple and Wolfram, for example, using arbitrary precision arithmetic,
+This strategy is used by __Maple and WolframAlpha, for example, using arbitrary precision arithmetic,
 and some of their high-precision values are used for testing this library.
 This method is also used to provide __boost_test values using __multiprecision,
 typically, a 50 decimal digit type like `cpp_dec_float_50`
@@ -391,27 +392,26 @@ At extreme arguments near to zero or the singularity at the branch point,
 even this fails and the only method to achieve a really close result is to cast from a higher precision type.
 
 In practical applications, the increased computation required
-(often towards a thousand fold slower and requiring the additional code for multiprecision)
+(often towards a thousand-fold slower and requiring the additional code for multiprecision)
 is not justified and the algorithms here do not implement this.
 But because the Boost.Lambert_W algorithm has been tested using __multiprecision,
 users who require this can always easily achieve the nearest representation for the __fundamental_types
 if the application justifies the very large extra computation cost.
 
-One real-only implementation was based on an algorithm by __Luu_thesis,
+One compact real-only implementation was based on an algorithm by __Luu_thesis,
 (see routine 11 on page 98 for his Lambert W algorithm)
-and his Halley refinement is used iteratively in this implementation when required.
-
-This implementation is based on Thomas Luu's code posted at
+and his Halley refinement is used iteratively when required.
+A first implementation was based on Thomas Luu's code posted at
 [@https://svn.boost.org/trac/boost/ticket/11027 Boost Trac \#11027].
-
 It has been implemented from Luu's algorithm but templated on `RealType` parameter and result
 and handles both __fundamental_types (`float, double, long double`), __multiprecision,
-and also has been tested with a proposed fixed_point type.
+and also has been tested successfully with a proposed fixed_point type.
 
 A first approximation was computed using the method of Barry et al (see references 5 & 6 below).
-(For users only requiring an accuracy of relative accuracy of 0.02%, this function might suffice).
 This was extended to the widely used [@https://people.sc.fsu.edu/~jburkardt/f_src/toms443/toms443.html TOMS443]
 FORTRAN and C++ versions by John Burkardt using Schroeder refinement(s).
+(For users only requiring an accuracy of relative accuracy of 0.02%, Barry's function alone might suffice,
+but a better __rational_function approximation method has since been developed for this implementation).
 
 We also considered using __newton method.
 ``
@@ -422,11 +422,17 @@ We also considered using __newton method.
 ``
 but concluded that since the Newton-Raphson method takes typically 6 iterations to converge within tolerance,
 whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ulp,
+<<<<<<< HEAD
 so the Newton-Raphson method is unlikely to be quicker
 than the additional cost of computing the 2nd derivative for Halley's method,
 in this case requiring an expensive exponential function evaluation on each step.
 
 
+=======
+so Newton/Raphson's method unlikely to be quicker
+than the additional cost of computating the 2nd derivative for Halley's method,
+each iteration step requiring an expensive exponential function evaluation.
+>>>>>>> before trying to switch to develop to add test_value.hpp
 
 [h4:compact_implementation Implementing Compact Algorithms]
 
@@ -438,16 +444,16 @@ followed by Halley iteration (but is also slowest and least precise near zero an
 More recently, the Tosio Fukushima has developed an even faster algorithm,
 avoiding any transcendental function calls as these are necessarily expensive.
 The current implementation is based on his algorithm
-starting with a translation from FORTRAN into C++ by Darko Veberic.
+starting with a translation from Fukushima's FORTRAN into C++ by Darko Veberic.
 
 Many applications of the Lambert W function make many repeated evaluations for Monte Carlo methods;
 for these applications speed is very important.
-Luu and Chapeau-Blondeau and Monir provide typical usage examples.
+Luu, and Chapeau-Blondeau and Monir provide typical usage examples.
 
 Fukushima improves the important observation that much of the execution time of all
-previous iterative algorithms was spent evaluating transcendental functions, mainly `exp`.
+previous iterative algorithms was spent evaluating transcendental functions, usually `exp`.
 He has put a lot of work into avoiding any slow transcendental functions by using lookup tables and
-bisection, and finally by a single Schroeder refinement,
+bisection, finishing with a single Schroeder refinement,
 without any check on the precision of the result (necessarily evaluating an expensive exponential).
 
 Theoretical and practical tests confirm that this gives Lambert W estimates
@@ -457,22 +463,41 @@ However, though these give results within several __epsilon of the nearest repre
 they do not get as close as is very often possible with further refinement,
 usually to within one or two __epsilon.
 A mean difference was computed to express the typical error and is often about 0.5 epsilon,
-the theoretical minimum.
+the theoretical minimum.  Using the __float_distance, we can also express this as the number of
+bits that are different from the nearest representable or 'exact' value.
 
-A disadvantage is that the distribution of differences from the references value is reasonably random and unbiased,
-whereas the Schroeder stage is significantly biased.
+For this implementation of Lambert W-1, John Maddock used the Boost.Math `minimax.exe` __remez method program
+to devise a __rational_function for several ranges of argument z for the W0 branch of Lambert W0 function.
+These minimax rational approximations are combined for an algorithm that is both smaller and faster.
+Sadly it has not proved __remez_practical to use the same method for Lambert W-1 branch
+and so the Fukushima algorithm is retained for this branch.
 
+[h5:bias Bias]
 
-For speed during the bisection, Fukushima produces lookup tables of powers of e and z for integral Lambert W.
+An advantage of both minimax rational approximations and Halley iterated estimates
+is that the [*distribution] from the references value is reasonably random and unbiased,
+whereas any using the Schroeder refinement is significantly biased.
+Bias might have bad effects on statistical computations.
+For example, a test of 5000 values of argument z covering the main range of possible values,
+computed using the Fukushima method with Schroeder refinement gave about 1/3 lambert_w0 values that are
+one bit different from the best representation, and about 1% that are a few bits 'wrong'.
+If a Halley refinement step is added, only 1 in 30 are even one bit different, and none more than one bit 'wrong'.
+Starting with the rational approximation method, there is insignificant bias.
+Adding a Halley step (or iteration) reduces the number that are one bit different from about a third down to one in 30.
+This is unavoidable 'computational noise'.
+
+[h5:lookup_tables.
+
+For speed during the bisection, Fukushima computes lookup tables of powers of e and z for integral Lambert W.
 There are 64 elements in these tables. The FORTRAN version (and the C++ translation by Veberic)
 computed these (once) as `static` data. This is slower, may cause trouble with multithreading, and
 is slightly inaccurate because of rounding errors from repeated(64) multiplications. In this implementation
-the values have been computed using __multiprecision 50 decimal digit
-and output as C++ arrays 37 decimal digit long literals using
+the array values have been computed using __multiprecision 50 decimal digit
+and output as C++ arrays 37 decimal digit `long double` literals using `max_digits10` precision
 
   std::cout.precision(std::numeric_limits::max_digits10);
 
-The arrays are as const and static as possible (for the compiler version),
+The arrays are as const and constexpr and static as possible (for the compiler version),
 using BOOST_STATIC_CONSTEXPR macro.
 (See [@../../test/lambert_w_lookup_table_generator.cpp  lambert_w_lookup_table_generator.cpp]
 The precision was chosen to ensure that if used as `long double` arrays,
@@ -484,16 +509,16 @@ will be the nearest representable value for the type chose by a `typedef` in
   typedef double lookup_t; // Type for lookup table (`double` or `float`, or even `long double`?)
 
 This is to allow for future use at higher precision, up to platforms that use 128-bit
-(hardware or software) for `long double`.
+(hardware or software) for their `long double` type.
 
 The accuracy of the tables was confirmed using __WolframAlpha and agrees at the 37th decimal place,
-so ensuring that the value is read into even 128-bit `long double` to the nearest representation.
+so ensuring that the value is exactly read into even 128-bit `long double` to the nearest representation.
 
 [h5:higher_precision Higher precision]
 
 For types more precise than `double`, Fukushima showed that it is best to use the `double` estimate
-as a starting point followed by refinement using __halley iterations or other methods
-and our experience confirms this.
+as a starting point, followed by refinement using __halley iterations or other methods;
+our experience confirms this.
 
 Using __multiprecision it is simple to compute very high precision values of Lambert
 W at least to thousands of decimal digits over most of the range of z arguments.
@@ -632,7 +657,7 @@ only provides the precision of the built-in type, like `double`, only 17 decimal
 
 [tip Be exceeding careful not to silently lose precision by constructing multiprecision types from literal decimal types, usually [^double].  See examples.]
 
-Fukushima implmentation used 20 series terms and it was confirmed that using more terms does not usefully increase accuracy.
+Fukushima's implementation used 20 series terms; it was confirmed that using more terms does not usefully increase accuracy.
 
 [h5:wm1_near_zero Lambert W-1 arguments values very near zero.]
 
@@ -671,7 +696,7 @@ the computational cost of the log functions was easily paid by far fewer iterati
    double r = lambert_wm1(z, policy >());
    // lambert_wm1(-1.0000000000000000e-26) = -64.026509628385895
 
-[h5:halley]
+[h5:halley Halley refinement]
 
 After obtaining a double approximation, for `double` and quad 128-bit precision,
 a single iteration should suffice because
@@ -680,8 +705,6 @@ Halley iteration should triple the precision with each step
 and since we have at least half of the bits correct already,
 one Halley step is ample to get to 128-bit precision.
 
-
-
 [h4:testing Testing]
 
 Initial testing of the algorithm was done using a small number of spot tests.
diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp
index e3e7d6cda..265aad14c 100644
--- a/example/lambert_w_simple_examples.cpp
+++ b/example/lambert_w_simple_examples.cpp
@@ -27,13 +27,6 @@
 #include  // For exp_minus_one == 3.67879441171442321595523770161460867e-01.
 #include 
 
-// Built-in/fundamental GCC float128 or Intel Quad 128-bit type, if available.
-#ifdef __GNUC__
-#include  // Not available for MSVC.
-// sets BOOST_MP_USE_FLOAT128 for GCC
-using boost::multiprecision::float128;
-#endif //# __GNUC__ and NOT _MSC_VER
-
 #include  // boost::multiprecision::cpp_dec_float_50
 using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type.
 using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type.
diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index bdd1c029f..3f2c0e8e9 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -5,12 +5,8 @@
 // (See accompanying file LICENSE_1_0.txt or
 //  copy at http ://www.boost.org/LICENSE_1_0.txt).
 
-#ifndef BOOST_MATH_LAMBERTW0_HPP
-#define BOOST_MATH_LAMBERTW0_HPP
-
-// TODO change name of include file after PB/TF/DV version replaced fully.
-//#ifndef BOOST_MATH_SF_LAMBERT_W_HPP
-//#define BOOST_MATH_SF_LAMBERT_W_HPP
+#ifndef BOOST_MATH_SF_LAMBERT_W_HPP
+#define BOOST_MATH_SF_LAMBERT_W_HPP
 
 #ifdef _MSC_VER
 #  pragma warning (disable: 4127) // warning C4127: conditional expression is constant.
@@ -38,7 +34,7 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics.
 BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics.
 BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION // Precision.
 BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_W0 // Halley refinement diagnostics only for W0 branch.
-BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_WM1 // Halley refinement diagnostics only for W-1 branch.
+BOOST_MATH_INSTRUMENT_LAMBERT_WM1_HALLEY // Halley refinement diagnostics only for W-1 branch.
 BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26
 BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE // K > 64, z > 3.9904954117194348e+29
 BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics.
@@ -1054,7 +1050,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
 template 
 inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
 {
-   static const char* function = "boost::math::lamber_w0<%1%>";
+   static const char* function = "boost::math::lambert_w0<%1%>";
    BOOST_MATH_STD_USING // Aid ADL of std functions.
 
    // Unusual case of 32-bit double with a wider/64-bit long double
@@ -1064,10 +1060,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
    "- or possibly edit the coefficients to have "
    "an appropriate size-suffix for 64-bit floats on your platform - L?");
 
-     if ((boost::math::isnan)(z))
-     {
-       return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%", z, pol);
-     }
+    if ((boost::math::isnan)(z))
+    {
+      return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%", z, pol);
+    }
 
    if (z >= 0.05)
    {
@@ -1207,7 +1203,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             1.36363515125489502e-06,
             3.44200749053237945e-09,
          };
-         T log_w= log(z);
+         T log_w = log(z);
          return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
       else if (z < 7.896296e+13)  // 9.2 < log(z) <= 32
@@ -1236,7 +1232,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             4.97253225968548872e-09,
             3.39460723731970550e-12,
          };
-         T log_w= log(z);
+         T log_w = log(z);
          return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
       else if (z < 2.6881171e+43) // 32 < log(z) < 100
@@ -1265,7 +1261,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             -9.35271498075378319e-11,
             -2.60648331090076845e-14,
          };
-         T log_w= log(z);
+         T log_w = log(z);
          return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
       else // 100 < log(z) < 710
@@ -1298,7 +1294,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             1.11775518708172009e-20,
             3.78250395617836059e-25,
          };
-         T log_w= log(z);
+         T log_w = log(z);
          return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
    }
@@ -1419,7 +1415,6 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             -1.72845216404874299e+10,
          };
          T d = z + 0.36787944117144232159552377016146086744581113103176804;
-         // bad!
          return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d));
       }
       else if (z <= -0.36787944117144232159552377016146086744581113103176804) // Precision is max_digits10(cpp_bin_float_50).
@@ -1491,11 +1486,11 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
       return lambert_w_detail::lambert_w_singularity_series(p);
    }
 
-   // Whew!
+   // Phew!
    // If we get here we are in the normal range of the function, so
    // get a double precision approximation first, then iterate to full precision of T.
    // We define a type that is:
-   // mpl::true_  if there are so many digits required that iteration is required.
+   // mpl::true_  if there are so many digits precision wanted that iteration is necessary.
    // mpl::false_ if a single Halley step is sufficient.
    // For speed, we also cast z to type double when that is possible
    //   (boost::is_constructible() == true).
@@ -1507,12 +1502,12 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
       : false
    > tag_type;
 
-  // JM reused name z but Clang complains that it is hiding parameter z.
-  // T z = lambert_w0_imp(maybe_reduce_to_double(z, boost::is_constructible()), pol, mpl::int_<2>());
-  // return lambert_w_maybe_halley_iterate(z, z, tag_type());
    T w = lambert_w0_imp(maybe_reduce_to_double(z, boost::is_constructible()), pol, mpl::int_<2>());
 
    return lambert_w_maybe_halley_iterate(w, z, tag_type());
+
+ //  result = lambert_w_halley_iterate(result, z);
+
 } // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)  extended precision.
 
 
@@ -1843,20 +1838,20 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
       { // Only enough digits2 required, so just return the Schroeder refined value.
         // For example, for float, if (d2 <= 22) then
         // digits-3 returns Schroeder result up to 3 bits might be wrong.
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
         std::cout << "Schroeder refinement estimate = " << result << std::endl;
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
         return result; // Schroeder only.
       }
       else // Perform additional Halley refinement(s) to ensure that
            // get a near as possible to correct result (usually +/- epsilon).
       {
         result = lambert_w_halley_iterate(result, z);
-#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_HALLEY
         std::cout.precision(std::numeric_limits::max_digits10);
         std::cout << "Halley refinement estimate =    " << result << std::endl;
         std::cout.precision(saved_precision);
-#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W0_HALLEY
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1_HALLEY
         return result; // Halley
       } // schroeder or Schroeder and Halley.
     } // more than 10 digits2
@@ -1867,76 +1862,106 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
 /////////////////////  User Lambert w functions. //////////////////////////
 
 //! Lambert W0 using User-defined policy.
-template 
-inline
-typename tools::promote_args::type
-lambert_w0(T z, const Policy& pol)
-{
-   // Promote integer or expression template arguments to double,
-   // without doing any other internal promotion like float to double.
-   typedef typename tools::promote_args::type result_type;
-   //
-   // Work out what precision has been selected, based on the Policy and the
-   // number type,
-   typedef typename policies::precision::type precision_type;
-   // and then select the correct implementation based on that (not the type T):
-   typedef mpl::int_<
+  template 
+  inline
+    typename tools::promote_args::type
+    lambert_w0(T z, const Policy& pol)
+  {
+     // Promote integer or expression template arguments to double,
+     // without doing any other internal promotion like float to double.
+    typedef typename tools::promote_args::type result_type;
+    
+    // Work out what precision has been selected, 
+    // based on the Policy and the number type.
+    typedef typename policies::precision::type precision_type;
+    // and then select the correct implementation based on that (not the type T):
+    typedef mpl::int_<
       (precision_type::value == 0) || (precision_type::value > 53) ?
       0  // either variable precision (0), or greater than 64-bit precision.
       : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
       : 2  // 64-bit (probably double) precision.
-   > tag_type;
+      > tag_type;
 
-   return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type());
-} // lambert_w0(T z, const Policy& pol)
+    // Optionally, if policy is all T's digits (default), return after a extra Halley step.
+    // (Might be better with mpl?)
+    int p = precision_type::value;
+    int d = std::numeric_limits::digits;
 
-  //! Lambert W0 using default policy.
-template  >
-inline
-typename tools::promote_args::type
-lambert_w0(T z)
-{
-  // Promote integer or expression template arguments to double,
-  // without doing any other internal promotion like float to double.
-   typedef typename tools::promote_args::type result_type;
+    T result = lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type()); // Pre-Halley.
 
-   // Work out what precision has been selected, based on the Policy and the number type.
-   // For the default policy version, we want the *default policy* precision for T.
-   typedef typename policies::precision::type precision_type;
-   // and then select the correct implementation based on that (not the type T):
-   typedef mpl::int_<
-     (precision_type::value == 0) || (precision_type::value > 53) ?
-     0  // either variable precision (0), or greater than 64-bit precision.
-     : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
-     : 2  // 64-bit (probably double) precision.
-   > tag_type;
+    bool quick = (precision_type::value < std::numeric_limits::digits);
 
-   return lambert_w_detail::lambert_w0_imp(result_type(z), policies::policy<>(), tag_type()); //
-} // lambert_w0(T z)
+    if (quick || (result == -1) || (result == 0) || (!boost::math::isnormal(result)) || (z < -0.3578))
+    {
+      return result;
+    }
+    else
+    {
+      result = lambert_w_detail::lambert_w_halley_step(result, z);
+    }
+    return result;
+    // return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type());
+  } // lambert_w0(T z, const Policy& pol)
 
-  //! W-1 branch (-max(z) < z <= -1/e).
+    //! Lambert W0 using default policy.
+  template  >
+  inline
+    typename tools::promote_args::type
+    lambert_w0(T z)
+  {
+    // Promote integer or expression template arguments to double,
+    // without doing any other internal promotion like float to double.
+    typedef typename tools::promote_args::type result_type;
 
-  //! Lambert W-1 using User-defined policy.
-template 
-inline
-typename tools::promote_args::type
-lambert_wm1(T z, const Policy& pol)
-{
-  // Promote integer or expression template arguments to double,
-  // without doing any other internal promotion like float to double.
-  typedef typename tools::promote_args::type result_type;
-  return lambert_w_detail::lambert_wm1_imp(result_type(z), pol); //
-}
+    // Work out what precision has been selected, based on the Policy and the number type.
+    // For the default policy version, we want the *default policy* precision for T.
+    typedef typename policies::precision::type precision_type;
+    // and then select the correct implementation based on that (not the type T):
+    typedef mpl::int_<
+      (precision_type::value == 0) || (precision_type::value > 53) ?
+      0  // either variable precision (0), or greater than 64-bit precision.
+      : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
+      : 2  // 64-bit (probably double) precision.
+    > tag_type;
+    // Always add Halley step for default policy.
+    T result = lambert_w_detail::lambert_w0_imp(result_type(z),  policies::policy<>(), tag_type()); // Pre-Halley.
+    if ((z < -0.3578) // Using singularity series.
+      || (!boost::math::isnormal(result))  // NaN, infinity or denormal.
+      || (result == -1) || (result == 0)) // exact
+    {
+      return result;
+    }
+    result = lambert_w_detail::lambert_w_halley_step(result, z);
+    return result;
+    // TODO this ugliness is because JM rationals return rather than result = ...
+    // and should use existing checks for -1, 0, singularity series and small_z series inside _imp
+    // to avoid repeating here.
+//    return lambert_w_detail::lambert_w0_imp(result_type(z), policies::policy<>(), tag_type()); //
+  } // lambert_w0(T z)
 
-//! Lambert W-1 using default policy.
-template 
-inline
-typename tools::promote_args::type
-lambert_wm1(T z)
-{
-  typedef typename tools::promote_args::type result_type;
-  return lambert_w_detail::lambert_wm1_imp(result_type(z), policies::policy<>());
-} // lambert_wm1(T z)
+    //! W-1 branch (-max(z) < z <= -1/e).
+
+    //! Lambert W-1 using User-defined policy.
+  template 
+  inline
+    typename tools::promote_args::type
+    lambert_wm1(T z, const Policy& pol)
+  {
+    // Promote integer or expression template arguments to double,
+    // without doing any other internal promotion like float to double.
+    typedef typename tools::promote_args::type result_type;
+    return lambert_w_detail::lambert_wm1_imp(result_type(z), pol); //
+  }
+
+  //! Lambert W-1 using default policy.
+  template 
+  inline
+    typename tools::promote_args::type
+    lambert_wm1(T z)
+  {
+    typedef typename tools::promote_args::type result_type;
+    return lambert_w_detail::lambert_wm1_imp(result_type(z), policies::policy<>());
+  } // lambert_wm1(T z)
 
 
 template 
@@ -1982,4 +2007,4 @@ lambert_wm1_prime(T z)
 
 }} //boost::math namespaces
 
-#endif // #ifdef BOOST_MATH_LAMBERTW_HPP
+#endif // #ifdef BOOST_MATH_SF_LAMBERT_W_HPP
diff --git a/include/boost/math/special_functions/lambert_w_lookup_table.ipp b/include/boost/math/special_functions/lambert_w_lookup_table.ipp
index 718c73498..4c48cdff5 100644
--- a/include/boost/math/special_functions/lambert_w_lookup_table.ipp
+++ b/include/boost/math/special_functions/lambert_w_lookup_table.ipp
@@ -14,13 +14,13 @@
 
 // Written by I:\modular-boost\libs\math\test\lambert_w_lookup_table_generator.cpp Thu Jan 25 16:52:07 2018
 
-// Sizes of arrays of z values for Lambert W[0], W[1] ... W[64]"nand W[-1], W[-2] ... W[-64].
+// Sizes of arrays of z values for Lambert W[0], W[1] ... W[64]" and W[-1], W[-2] ... W[-64].
 
 namespace boost {
 namespace math {
 namespace lambert_w_detail {
 namespace lambert_w_lookup
-{ 
+{
 BOOST_STATIC_CONSTEXPR std::size_t  noof_sqrts = 12;
 BOOST_STATIC_CONSTEXPR std::size_t  noof_halves = 12;
 BOOST_STATIC_CONSTEXPR std::size_t  noof_w0es = 65;
@@ -28,104 +28,104 @@ BOOST_STATIC_CONSTEXPR std::size_t  noof_w0zs = 65;
 BOOST_STATIC_CONSTEXPR std::size_t  noof_wm1es = 64;
 BOOST_STATIC_CONSTEXPR std::size_t  noof_wm1zs = 64;
 
-BOOST_STATIC_CONSTEXPR lookup_t halves[noof_halves] = 
+BOOST_STATIC_CONSTEXPR lookup_t halves[noof_halves] =
 { // Common to Lambert W0 and W-1 (and exactly representable).
   0.5L, 0.25L, 0.125L, 0.0625L, 0.03125L, 0.015625L, 0.0078125L, 0.00390625L, 0.001953125L, 0.0009765625L, 0.00048828125L, 0.000244140625L
 }; // halves, 0.5, 0.25, ... 0.000244140625, common to W0 and W-1.
 
-BOOST_STATIC_CONSTEXPR lookup_t sqrtw0s[noof_sqrts] = 
+BOOST_STATIC_CONSTEXPR lookup_t sqrtw0s[noof_sqrts] =
 {  // For Lambert W0 only.
   0.6065306597126334242631173765403218567L, 0.77880078307140486866846070009071995L, 0.882496902584595403104717592968701829L, 0.9394130628134757862473572557999761753L, 0.9692332344763440819139583751755278177L, 0.9844964370054084060204319075254540376L, 0.9922179382602435121227899136829802692L, 0.996101369470117490071323985506950379L, 0.9980487811074754727142805899944244847L, 0.9990239141819756622368328253791383317L, 0.9995118379398893653889967919448497792L, 0.9997558891748972165136242351259789505L
 }; // sqrtw0s
 
-BOOST_STATIC_CONSTEXPR lookup_t sqrtwm1s[noof_sqrts] = 
+BOOST_STATIC_CONSTEXPR lookup_t sqrtwm1s[noof_sqrts] =
 { // For Lambert W-1 only.
   1.648721270700128146848650787814163572L, 1.284025416687741484073420568062436458L, 1.133148453066826316829007227811793873L, 1.064494458917859429563390594642889673L, 1.031743407499102670938747815281507144L, 1.015747708586685747458535072082351749L, 1.007843097206447977693453559760123579L, 1.003913889338347573443609603903460282L, 1.001955033591002812046518898047477216L, 1.000977039492416535242845292611606506L, 1.000488400478694473126173623807163354L, 1.000244170429747854937005233924135774L
 }; // sqrtwm1s
 
-BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0zs] = 
+BOOST_STATIC_CONSTEXPR lookup_t w0es[noof_w0zs] =
 { // Fukushima e powers array e[0] = 2.718, 1., e[2] = e^-1 = 0.135, e[3] = e^-2 = 0.133 ... e[64] = 4.3596100000630809736231248158884615452e-28.
-  2.7182818284590452353602874713526624978e+00L, 
-  1.0000000000000000000000000000000000000e+00L, 3.6787944117144232159552377016146086745e-01L, 1.3533528323661269189399949497248440341e-01L, 4.9787068367863942979342415650061776632e-02L, 
-  1.8315638888734180293718021273241242212e-02L, 6.7379469990854670966360484231484242488e-03L, 2.4787521766663584230451674308166678915e-03L, 9.1188196555451620800313608440928262647e-04L, 
-  3.3546262790251183882138912578086101931e-04L, 1.2340980408667954949763669073003382607e-04L, 4.5399929762484851535591515560550610238e-05L, 1.6701700790245659312635517360580879078e-05L, 
-  6.1442123533282097586823081788055323112e-06L, 2.2603294069810543257852772905386894694e-06L, 8.3152871910356788406398514256526229461e-07L, 3.0590232050182578837147949770228963937e-07L, 
-  1.1253517471925911451377517906012719164e-07L, 4.1399377187851666596510277189552806229e-08L, 1.5229979744712628436136629233517431862e-08L, 5.6027964375372675400129828162064630798e-09L, 
-  2.0611536224385578279659403801558209764e-09L, 7.5825604279119067279417432412681264430e-10L, 2.7894680928689248077189130306442932077e-10L, 1.0261879631701890303927527840612497760e-10L, 
-  3.7751345442790977516449695475234067792e-11L, 1.3887943864964020594661763746086856910e-11L, 5.1090890280633247198744001934792157666e-12L, 1.8795288165390832947582704184221926212e-12L, 
-  6.9144001069402030094125846587414092712e-13L, 2.5436656473769229103033856148576816666e-13L, 9.3576229688401746049158322233787067450e-14L, 3.4424771084699764583923893328515572846e-14L, 
-  1.2664165549094175723120904155965096382e-14L, 4.6588861451033973641842455436101684114e-15L, 1.7139084315420129663027203425760492412e-15L, 6.3051167601469893856390211922465427614e-16L, 
-  2.3195228302435693883122636097380800411e-16L, 8.5330476257440657942780498229412441658e-17L, 3.1391327920480296287089646522319196491e-17L, 1.1548224173015785986262442063323868655e-17L, 
-  4.2483542552915889953292347828586580179e-18L, 1.5628821893349887680908829951058341550e-18L, 5.7495222642935598066643808805734234249e-19L, 2.1151310375910804866314010070226514702e-19L, 
-  7.7811322411337965157133167292798981918e-20L, 2.8625185805493936444701216291839372068e-20L, 1.0530617357553812378763324449428108806e-20L, 3.8739976286871871129314774972691278293e-21L, 
-  1.4251640827409351062853210280340602263e-21L, 5.2428856633634639371718053028323436716e-22L, 1.9287498479639177830173428165270125748e-22L, 7.0954741622847041389832693878080734877e-23L, 
-  2.6102790696677048047026953153318648093e-23L, 9.6026800545086760302307696700074909076e-24L, 3.5326285722008070297353928101772088374e-24L, 1.2995814250075030736007134060714855303e-24L, 
-  4.7808928838854690812771770423179628939e-25L, 1.7587922024243116489558751288034363178e-25L, 6.4702349256454603261540395529264893765e-26L, 2.3802664086944006058943245888024963309e-26L, 
-  8.7565107626965203384887328007391660366e-27L, 3.2213402859925160890012477758489437534e-27L, 1.1850648642339810062850307390972809891e-27L, 4.3596100000630809736231248158884596428e-28L, 
-  
+  2.7182818284590452353602874713526624978e+00L,
+  1.0000000000000000000000000000000000000e+00L, 3.6787944117144232159552377016146086745e-01L, 1.3533528323661269189399949497248440341e-01L, 4.9787068367863942979342415650061776632e-02L,
+  1.8315638888734180293718021273241242212e-02L, 6.7379469990854670966360484231484242488e-03L, 2.4787521766663584230451674308166678915e-03L, 9.1188196555451620800313608440928262647e-04L,
+  3.3546262790251183882138912578086101931e-04L, 1.2340980408667954949763669073003382607e-04L, 4.5399929762484851535591515560550610238e-05L, 1.6701700790245659312635517360580879078e-05L,
+  6.1442123533282097586823081788055323112e-06L, 2.2603294069810543257852772905386894694e-06L, 8.3152871910356788406398514256526229461e-07L, 3.0590232050182578837147949770228963937e-07L,
+  1.1253517471925911451377517906012719164e-07L, 4.1399377187851666596510277189552806229e-08L, 1.5229979744712628436136629233517431862e-08L, 5.6027964375372675400129828162064630798e-09L,
+  2.0611536224385578279659403801558209764e-09L, 7.5825604279119067279417432412681264430e-10L, 2.7894680928689248077189130306442932077e-10L, 1.0261879631701890303927527840612497760e-10L,
+  3.7751345442790977516449695475234067792e-11L, 1.3887943864964020594661763746086856910e-11L, 5.1090890280633247198744001934792157666e-12L, 1.8795288165390832947582704184221926212e-12L,
+  6.9144001069402030094125846587414092712e-13L, 2.5436656473769229103033856148576816666e-13L, 9.3576229688401746049158322233787067450e-14L, 3.4424771084699764583923893328515572846e-14L,
+  1.2664165549094175723120904155965096382e-14L, 4.6588861451033973641842455436101684114e-15L, 1.7139084315420129663027203425760492412e-15L, 6.3051167601469893856390211922465427614e-16L,
+  2.3195228302435693883122636097380800411e-16L, 8.5330476257440657942780498229412441658e-17L, 3.1391327920480296287089646522319196491e-17L, 1.1548224173015785986262442063323868655e-17L,
+  4.2483542552915889953292347828586580179e-18L, 1.5628821893349887680908829951058341550e-18L, 5.7495222642935598066643808805734234249e-19L, 2.1151310375910804866314010070226514702e-19L,
+  7.7811322411337965157133167292798981918e-20L, 2.8625185805493936444701216291839372068e-20L, 1.0530617357553812378763324449428108806e-20L, 3.8739976286871871129314774972691278293e-21L,
+  1.4251640827409351062853210280340602263e-21L, 5.2428856633634639371718053028323436716e-22L, 1.9287498479639177830173428165270125748e-22L, 7.0954741622847041389832693878080734877e-23L,
+  2.6102790696677048047026953153318648093e-23L, 9.6026800545086760302307696700074909076e-24L, 3.5326285722008070297353928101772088374e-24L, 1.2995814250075030736007134060714855303e-24L,
+  4.7808928838854690812771770423179628939e-25L, 1.7587922024243116489558751288034363178e-25L, 6.4702349256454603261540395529264893765e-26L, 2.3802664086944006058943245888024963309e-26L,
+  8.7565107626965203384887328007391660366e-27L, 3.2213402859925160890012477758489437534e-27L, 1.1850648642339810062850307390972809891e-27L, 4.3596100000630809736231248158884596428e-28L,
+
 }; // w0es
 
-BOOST_STATIC_CONSTEXPR lookup_t w0zs[noof_w0zs] = 
-{ // z values for W[0], W[1], W[2] ... W[64] (Fukushima array Fk). 
-  0.0000000000000000000000000000000000000e+00L, 
-  2.7182818284590452353602874713526624978e+00L, 1.4778112197861300454460854921150015626e+01L, 6.0256610769563003222785588963745153691e+01L, 2.1839260013257695631244104481144351361e+02L, 
-  7.4206579551288301710557790020276139812e+02L, 2.4205727609564107356503230832603296776e+03L, 7.6764321089992101948460416680168500271e+03L, 2.3847663896333826197948736795623109390e+04L, 
-  7.2927755348178456069389970204894839685e+04L, 2.2026465794806716516957900645284244366e+05L, 6.5861555886717600300859134371483559776e+05L, 1.9530574970280470496960624587818413980e+06L, 
-  5.7513740961159665432393360873381476632e+06L, 1.6836459978306874888489314790750032292e+07L, 4.9035260587081659589527825691375819733e+07L, 1.4217776832812596218820837985250320561e+08L, 
-  4.1063419681078006965118239806655900596e+08L, 1.1818794444719492004981570586630806042e+09L, 3.3911637183005579560532906419857313738e+09L, 9.7033039081958055593821366108308111737e+09L, 
-  2.7695130424147508641409976558651358487e+10L, 7.8868082614895014356985518811525255163e+10L, 2.2413047926372475980079655175092843139e+11L, 6.3573893111624333505933989166748517618e+11L, 
-  1.8001224834346468131040337866531539479e+12L, 5.0889698451498078710141863447784789126e+12L, 1.4365302496248562650461177217211790925e+13L, 4.0495197800161304862957327843914007993e+13L, 
-  1.1400869461717722015726999684446230289e+14L, 3.2059423744573386440971405952224204950e+14L, 9.0051433962267018216365614546207459567e+14L, 2.5268147258457822451512967243234631750e+15L, 
-  7.0832381329352301326018261305316090522e+15L, 1.9837699245933465967698692976753294646e+16L, 5.5510470830970075484537561902113104381e+16L, 1.5520433569614702817608320254284931407e+17L, 
-  4.3360826779369661842459877227403719730e+17L, 1.2105254067703227363724895246493485480e+18L, 3.3771426165357561311906703760513324357e+18L, 9.4154106734807994163159964299613921804e+18L, 
-  2.6233583234732252918129199544138403574e+19L, 7.3049547543861043990576614751671879498e+19L, 2.0329709713386190214340167519800405595e+20L, 5.6547040503180956413560918381429636734e+20L, 
-  1.5720421975868292906615658755032744790e+21L, 4.3682149334771264822761478593874428627e+21L, 1.2132170565093316762294432610117848880e+22L, 3.3680332378068632345542636794533635462e+22L, 
-  9.3459982052259884835729892206738573922e+22L, 2.5923527642935362320437266614667426924e+23L, 7.1876803203773878618909930893087860822e+23L, 1.9921241603726199616378561653688236827e+24L, 
-  5.5192924995054165325072406547517121131e+24L, 1.5286067837683347062387143159276002521e+25L, 4.2321318958281094260005100745711666956e+25L, 1.1713293177672778461879598480402173158e+26L, 
-  3.2408603996214813669049988277609543829e+26L, 8.9641258264226027960478448084812796397e+26L, 2.4787141382364034104243901241243054434e+27L, 6.8520443388941057019777430988685937812e+27L, 
+BOOST_STATIC_CONSTEXPR lookup_t w0zs[noof_w0zs] =
+{ // z values for W[0], W[1], W[2] ... W[64] (Fukushima array Fk).
+  0.0000000000000000000000000000000000000e+00L,
+  2.7182818284590452353602874713526624978e+00L, 1.4778112197861300454460854921150015626e+01L, 6.0256610769563003222785588963745153691e+01L, 2.1839260013257695631244104481144351361e+02L,
+  7.4206579551288301710557790020276139812e+02L, 2.4205727609564107356503230832603296776e+03L, 7.6764321089992101948460416680168500271e+03L, 2.3847663896333826197948736795623109390e+04L,
+  7.2927755348178456069389970204894839685e+04L, 2.2026465794806716516957900645284244366e+05L, 6.5861555886717600300859134371483559776e+05L, 1.9530574970280470496960624587818413980e+06L,
+  5.7513740961159665432393360873381476632e+06L, 1.6836459978306874888489314790750032292e+07L, 4.9035260587081659589527825691375819733e+07L, 1.4217776832812596218820837985250320561e+08L,
+  4.1063419681078006965118239806655900596e+08L, 1.1818794444719492004981570586630806042e+09L, 3.3911637183005579560532906419857313738e+09L, 9.7033039081958055593821366108308111737e+09L,
+  2.7695130424147508641409976558651358487e+10L, 7.8868082614895014356985518811525255163e+10L, 2.2413047926372475980079655175092843139e+11L, 6.3573893111624333505933989166748517618e+11L,
+  1.8001224834346468131040337866531539479e+12L, 5.0889698451498078710141863447784789126e+12L, 1.4365302496248562650461177217211790925e+13L, 4.0495197800161304862957327843914007993e+13L,
+  1.1400869461717722015726999684446230289e+14L, 3.2059423744573386440971405952224204950e+14L, 9.0051433962267018216365614546207459567e+14L, 2.5268147258457822451512967243234631750e+15L,
+  7.0832381329352301326018261305316090522e+15L, 1.9837699245933465967698692976753294646e+16L, 5.5510470830970075484537561902113104381e+16L, 1.5520433569614702817608320254284931407e+17L,
+  4.3360826779369661842459877227403719730e+17L, 1.2105254067703227363724895246493485480e+18L, 3.3771426165357561311906703760513324357e+18L, 9.4154106734807994163159964299613921804e+18L,
+  2.6233583234732252918129199544138403574e+19L, 7.3049547543861043990576614751671879498e+19L, 2.0329709713386190214340167519800405595e+20L, 5.6547040503180956413560918381429636734e+20L,
+  1.5720421975868292906615658755032744790e+21L, 4.3682149334771264822761478593874428627e+21L, 1.2132170565093316762294432610117848880e+22L, 3.3680332378068632345542636794533635462e+22L,
+  9.3459982052259884835729892206738573922e+22L, 2.5923527642935362320437266614667426924e+23L, 7.1876803203773878618909930893087860822e+23L, 1.9921241603726199616378561653688236827e+24L,
+  5.5192924995054165325072406547517121131e+24L, 1.5286067837683347062387143159276002521e+25L, 4.2321318958281094260005100745711666956e+25L, 1.1713293177672778461879598480402173158e+26L,
+  3.2408603996214813669049988277609543829e+26L, 8.9641258264226027960478448084812796397e+26L, 2.4787141382364034104243901241243054434e+27L, 6.8520443388941057019777430988685937812e+27L,
   1.8936217407781711443114787060753312270e+28L, 5.2317811346197017832254642778313331353e+28L, 1.4450833904658542238325922893692265683e+29L, 3.9904954117194348050619127737142206367e+29L
-  
+
 }; // w0zs
 
-BOOST_STATIC_CONSTEXPR lookup_t wm1es[noof_wm1es] = 
+BOOST_STATIC_CONSTEXPR lookup_t wm1es[noof_wm1es] =
 { // Fukushima e array e[0] = e^1 = 2.718, e[1] = e^2 = 7.39 ... e[64] = 4.60718e+28.
-  2.7182818284590452353602874713526624978e+00L, 
-  7.3890560989306502272304274605750078132e+00L, 2.0085536923187667740928529654581717897e+01L, 5.4598150033144239078110261202860878403e+01L, 1.4841315910257660342111558004055227962e+02L, 
-  4.0342879349273512260838718054338827961e+02L, 1.0966331584284585992637202382881214324e+03L, 2.9809579870417282747435920994528886738e+03L, 8.1030839275753840077099966894327599650e+03L, 
-  2.2026465794806716516957900645284244366e+04L, 5.9874141715197818455326485792257781614e+04L, 1.6275479141900392080800520489848678317e+05L, 4.4241339200892050332610277594908828178e+05L, 
-  1.2026042841647767777492367707678594494e+06L, 3.2690173724721106393018550460917213155e+06L, 8.8861105205078726367630237407814503508e+06L, 2.4154952753575298214775435180385823880e+07L, 
-  6.5659969137330511138786503259060033569e+07L, 1.7848230096318726084491003378872270388e+08L, 4.8516519540979027796910683054154055868e+08L, 1.3188157344832146972099988837453027851e+09L, 
-  3.5849128461315915616811599459784206892e+09L, 9.7448034462489026000346326848229752776e+09L, 2.6489122129843472294139162152811882341e+10L, 7.2004899337385872524161351466126157915e+10L, 
-  1.9572960942883876426977639787609534279e+11L, 5.3204824060179861668374730434117744166e+11L, 1.4462570642914751736770474229969288569e+12L, 3.9313342971440420743886205808435276858e+12L, 
-  1.0686474581524462146990468650741401650e+13L, 2.9048849665247425231085682111679825667e+13L, 7.8962960182680695160978022635108224220e+13L, 2.1464357978591606462429776153126088037e+14L, 
-  5.8346174252745488140290273461039101900e+14L, 1.5860134523134307281296446257746601252e+15L, 4.3112315471151952271134222928569253908e+15L, 1.1719142372802611308772939791190194522e+16L, 
-  3.1855931757113756220328671701298646000e+16L, 8.6593400423993746953606932719264934250e+16L, 2.3538526683701998540789991074903480451e+17L, 6.3984349353005494922266340351557081888e+17L, 
-  1.7392749415205010473946813036112352261e+18L, 4.7278394682293465614744575627442803708e+18L, 1.2851600114359308275809299632143099258e+19L, 3.4934271057485095348034797233406099533e+19L, 
-  9.4961194206024488745133649117118323102e+19L, 2.5813128861900673962328580021527338043e+20L, 7.0167359120976317386547159988611740546e+20L, 1.9073465724950996905250998409538484474e+21L, 
-  5.1847055285870724640874533229334853848e+21L, 1.4093490824269387964492143312370168789e+22L, 3.8310080007165768493035695487861993899e+22L, 1.0413759433029087797183472933493796440e+23L, 
-  2.8307533032746939004420635480140745409e+23L, 7.6947852651420171381827455901293939921e+23L, 2.0916594960129961539070711572146737782e+24L, 5.6857199993359322226403488206332533034e+24L, 
-  1.5455389355901039303530766911174620068e+25L, 4.2012104037905142549565934307191617684e+25L, 1.1420073898156842836629571831447656302e+26L, 3.1042979357019199087073421411071003721e+26L, 
+  2.7182818284590452353602874713526624978e+00L,
+  7.3890560989306502272304274605750078132e+00L, 2.0085536923187667740928529654581717897e+01L, 5.4598150033144239078110261202860878403e+01L, 1.4841315910257660342111558004055227962e+02L,
+  4.0342879349273512260838718054338827961e+02L, 1.0966331584284585992637202382881214324e+03L, 2.9809579870417282747435920994528886738e+03L, 8.1030839275753840077099966894327599650e+03L,
+  2.2026465794806716516957900645284244366e+04L, 5.9874141715197818455326485792257781614e+04L, 1.6275479141900392080800520489848678317e+05L, 4.4241339200892050332610277594908828178e+05L,
+  1.2026042841647767777492367707678594494e+06L, 3.2690173724721106393018550460917213155e+06L, 8.8861105205078726367630237407814503508e+06L, 2.4154952753575298214775435180385823880e+07L,
+  6.5659969137330511138786503259060033569e+07L, 1.7848230096318726084491003378872270388e+08L, 4.8516519540979027796910683054154055868e+08L, 1.3188157344832146972099988837453027851e+09L,
+  3.5849128461315915616811599459784206892e+09L, 9.7448034462489026000346326848229752776e+09L, 2.6489122129843472294139162152811882341e+10L, 7.2004899337385872524161351466126157915e+10L,
+  1.9572960942883876426977639787609534279e+11L, 5.3204824060179861668374730434117744166e+11L, 1.4462570642914751736770474229969288569e+12L, 3.9313342971440420743886205808435276858e+12L,
+  1.0686474581524462146990468650741401650e+13L, 2.9048849665247425231085682111679825667e+13L, 7.8962960182680695160978022635108224220e+13L, 2.1464357978591606462429776153126088037e+14L,
+  5.8346174252745488140290273461039101900e+14L, 1.5860134523134307281296446257746601252e+15L, 4.3112315471151952271134222928569253908e+15L, 1.1719142372802611308772939791190194522e+16L,
+  3.1855931757113756220328671701298646000e+16L, 8.6593400423993746953606932719264934250e+16L, 2.3538526683701998540789991074903480451e+17L, 6.3984349353005494922266340351557081888e+17L,
+  1.7392749415205010473946813036112352261e+18L, 4.7278394682293465614744575627442803708e+18L, 1.2851600114359308275809299632143099258e+19L, 3.4934271057485095348034797233406099533e+19L,
+  9.4961194206024488745133649117118323102e+19L, 2.5813128861900673962328580021527338043e+20L, 7.0167359120976317386547159988611740546e+20L, 1.9073465724950996905250998409538484474e+21L,
+  5.1847055285870724640874533229334853848e+21L, 1.4093490824269387964492143312370168789e+22L, 3.8310080007165768493035695487861993899e+22L, 1.0413759433029087797183472933493796440e+23L,
+  2.8307533032746939004420635480140745409e+23L, 7.6947852651420171381827455901293939921e+23L, 2.0916594960129961539070711572146737782e+24L, 5.6857199993359322226403488206332533034e+24L,
+  1.5455389355901039303530766911174620068e+25L, 4.2012104037905142549565934307191617684e+25L, 1.1420073898156842836629571831447656302e+26L, 3.1042979357019199087073421411071003721e+26L,
   8.4383566687414544890733294803731179601e+26L, 2.2937831594696098790993528402686136005e+27L, 6.2351490808116168829092387089284697448e+27L
 }; // wm1es
 
-BOOST_STATIC_CONSTEXPR lookup_t wm1zs[noof_wm1zs] = 
+BOOST_STATIC_CONSTEXPR lookup_t wm1zs[noof_wm1zs] =
 { // Fukushima G array of z values for integral K, (Fukushima Gk) g[0] (k = -1) = 1 ... g[64] = -1.0264389699511303e-26.
-  -3.6787944117144232159552377016146086745e-01L, 
-  -2.7067056647322538378799898994496880682e-01L, -1.4936120510359182893802724695018532990e-01L, -7.3262555554936721174872085092964968848e-02L, -3.3689734995427335483180242115742121244e-02L, 
-  -1.4872513059998150538271004584900007349e-02L, -6.3831737588816134560219525908649783853e-03L, -2.6837010232200947105711130062468881545e-03L, -1.1106882367801159454787302165703044346e-03L, 
-  -4.5399929762484851535591515560550610238e-04L, -1.8371870869270225243899069096638966986e-04L, -7.3730548239938517104187698145666387735e-05L, -2.9384282290753706235208604777002963102e-05L, 
-  -1.1641402067449950376895791995913672125e-05L, -4.5885348075273868255721924655343445906e-06L, -1.8005627955081458322204028649620350662e-06L, -7.0378941219347833214067471222239770590e-07L, 
-  -2.7413963540482731185045932620331377352e-07L, -1.0645313231320808326024667350792279852e-07L, -4.1223072448771156559318807603116419528e-08L, -1.5923376898615004128677660806663065530e-08L, 
-  -6.1368298043116345769816086674174450569e-09L, -2.3602323152914347699033314033408744848e-09L, -9.0603229062698346039479269140561762700e-10L, -3.4719859662410051486654409365217142276e-10L, 
-  -1.3283631472964644271673440503045960993e-10L, -5.0747278046555248958473301297399200773e-11L, -1.9360320299432568426355237044475945959e-11L, -7.3766303773930764398798182830872768331e-12L, 
-  -2.8072868906520523814747496670136120235e-12L, -1.0671679036256927021016406931839827582e-12L, -4.0525329757101362313986893299088308423e-13L, -1.5374324278841211301808010293913555758e-13L, 
-  -5.8272886672428440854292491647585674200e-14L, -2.2067908660514462849736574172862899665e-14L, -8.3502821888768497979241489950570881481e-15L, -3.1572276215253043438828784344882603413e-15L, 
-  -1.1928704609782512589094065678481294667e-15L, -4.5038074274761565346423524046963087756e-16L, -1.6993417021166355981316939131434632072e-16L, -6.4078169762734539491726202799339200356e-17L, 
-  -2.4147993510032951187990399698408378385e-17L, -9.0950634616416460925150243301974013218e-18L, -3.4236981860988704669138593608831552044e-18L, -1.2881333612472271400115547331327717431e-18L, 
-  -4.8440839844747536942311292467369300505e-19L, -1.8207788854829779430777944237164900798e-19L, -6.8407875971564885101695409345634890862e-20L, -2.5690139750480973292141845983878483991e-20L, 
-  -9.6437492398195889150867140826350628738e-21L, -3.6186918227651991108814673877821174787e-21L, -1.3573451162272064984454015639725697008e-21L, -5.0894204288895982960223079251039701810e-22L, 
-  -1.9076194289884357960571121174956927722e-22L, -7.1476978375412669048039237333931704166e-23L, -2.6773000149758626855152191436980592206e-23L, -1.0025115553818576399048488234179587012e-23L, 
-  -3.7527362568743669891693429406973638384e-24L, -1.4043571811296963574776515073934728352e-24L, -5.2539064576179122030932396804434996219e-25L, -1.9650175744554348142907611432678556896e-25L, 
+  -3.6787944117144232159552377016146086745e-01L,
+  -2.7067056647322538378799898994496880682e-01L, -1.4936120510359182893802724695018532990e-01L, -7.3262555554936721174872085092964968848e-02L, -3.3689734995427335483180242115742121244e-02L,
+  -1.4872513059998150538271004584900007349e-02L, -6.3831737588816134560219525908649783853e-03L, -2.6837010232200947105711130062468881545e-03L, -1.1106882367801159454787302165703044346e-03L,
+  -4.5399929762484851535591515560550610238e-04L, -1.8371870869270225243899069096638966986e-04L, -7.3730548239938517104187698145666387735e-05L, -2.9384282290753706235208604777002963102e-05L,
+  -1.1641402067449950376895791995913672125e-05L, -4.5885348075273868255721924655343445906e-06L, -1.8005627955081458322204028649620350662e-06L, -7.0378941219347833214067471222239770590e-07L,
+  -2.7413963540482731185045932620331377352e-07L, -1.0645313231320808326024667350792279852e-07L, -4.1223072448771156559318807603116419528e-08L, -1.5923376898615004128677660806663065530e-08L,
+  -6.1368298043116345769816086674174450569e-09L, -2.3602323152914347699033314033408744848e-09L, -9.0603229062698346039479269140561762700e-10L, -3.4719859662410051486654409365217142276e-10L,
+  -1.3283631472964644271673440503045960993e-10L, -5.0747278046555248958473301297399200773e-11L, -1.9360320299432568426355237044475945959e-11L, -7.3766303773930764398798182830872768331e-12L,
+  -2.8072868906520523814747496670136120235e-12L, -1.0671679036256927021016406931839827582e-12L, -4.0525329757101362313986893299088308423e-13L, -1.5374324278841211301808010293913555758e-13L,
+  -5.8272886672428440854292491647585674200e-14L, -2.2067908660514462849736574172862899665e-14L, -8.3502821888768497979241489950570881481e-15L, -3.1572276215253043438828784344882603413e-15L,
+  -1.1928704609782512589094065678481294667e-15L, -4.5038074274761565346423524046963087756e-16L, -1.6993417021166355981316939131434632072e-16L, -6.4078169762734539491726202799339200356e-17L,
+  -2.4147993510032951187990399698408378385e-17L, -9.0950634616416460925150243301974013218e-18L, -3.4236981860988704669138593608831552044e-18L, -1.2881333612472271400115547331327717431e-18L,
+  -4.8440839844747536942311292467369300505e-19L, -1.8207788854829779430777944237164900798e-19L, -6.8407875971564885101695409345634890862e-20L, -2.5690139750480973292141845983878483991e-20L,
+  -9.6437492398195889150867140826350628738e-21L, -3.6186918227651991108814673877821174787e-21L, -1.3573451162272064984454015639725697008e-21L, -5.0894204288895982960223079251039701810e-22L,
+  -1.9076194289884357960571121174956927722e-22L, -7.1476978375412669048039237333931704166e-23L, -2.6773000149758626855152191436980592206e-23L, -1.0025115553818576399048488234179587012e-23L,
+  -3.7527362568743669891693429406973638384e-24L, -1.4043571811296963574776515073934728352e-24L, -5.2539064576179122030932396804434996219e-25L, -1.9650175744554348142907611432678556896e-25L,
   -7.3474021582506822389671905824031421322e-26L, -2.7465543000397410133825686340097295749e-26L, -1.0264389699511282259046957018510946438e-26L
 }; // wm1zs
 } // namespace lambert_w_lookup
diff --git a/include/boost/math/special_functions/lambert_w_pb.hpp b/include/boost/math/special_functions/lambert_w_pb.hpp
index 74eac4943..ed82f3259 100644
--- a/include/boost/math/special_functions/lambert_w_pb.hpp
+++ b/include/boost/math/special_functions/lambert_w_pb.hpp
@@ -8,7 +8,7 @@
 Implementation of the Fukushima algorithm for the Lambert W0 and W-1 real-only functions.
 
 This code is based on the algorithm by
-Toshio Fukushima, 
+Toshio Fukushima,
 "Precise and fast computation of Lambert W-functions without transcendental function evaluations",
 J. Comp. Appl. Math. 244 (2013) 77-89,
 and its author's FORTRAN code,
@@ -39,8 +39,8 @@ BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table.
 //] [/boost_math_instrument_lambert_w_macros]
 */
 
-#ifndef BOOST_MATH_SF_LAMBERT_W_HPP
-#define BOOST_MATH_SF_LAMBERT_W_HPP
+#ifndef BOOST_MATH_FKDVPB_LAMBERT_W_HPP
+#define BOOST_MATH_FKDVPB_LAMBERT_W_HPP
 
 #ifdef _MSC_VER
 #  pragma warning (disable: 4127) // warning C4127: conditional expression is constant
@@ -75,8 +75,8 @@ BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table.
 
 typedef double lookup_t; // Type for lookup table (double or float, or even long double?)
 
-//#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp"
- #include "lambert_w_lookup_table.ipp" // Boost.Math version.
+#include "J:\Cpp\Misc\lambert_w_lookup_table_generator\lambert_w_lookup_table.ipp" // BOTH w0 and wm1 version in namespace detail.
+// #include "lambert_w_lookup_table.ipp" // Boost.Math version.  Only Wm1 needed using namespace lambert_w_detail
 
 namespace boost
 {
@@ -85,6 +85,7 @@ namespace math
   namespace detail
   {
 
+
   //! \brief Series expansion used near the singularity/branch point z = -exp(-1) = -3.6787944.
   //! Wolfram InverseSeries[Series[sqrt[2(p Exp[1 + p] + 1)], {p,-1, 20}]]
   //! Wolfram command used to obtain 40 series terms at 50 decimal digit precision was
@@ -283,7 +284,7 @@ namespace math
   /////////////////////////////////////////////////////////////////////////////////////////////
 
   //! \brief Series expansion used near zero (abs(z) < 0.05).
-  //! \details 
+  //! \details
   //! Coefficients of the inverted series expansion of the Lambert W function around z = 0.
   //! Tosio Fukushima always uses all 17 terms of a Taylor series computed using Wolfram with
   //!   InverseSeries[Series[z Exp[z],{z,0,17}]]
@@ -295,7 +296,7 @@ namespace math
 
   //! This version is intended to allow use by user-defined types
   //! like Boost.Multiprecision quad and cpp_dec_float types.
-  //! The three specializations below for built-in float, double 
+  //! The three specializations below for built-in float, double
   //! (and perhaps long double) will be chosen in preference for these types.
 
   //! This version uses rationals computed by Wolfram as far as possible,
@@ -321,7 +322,7 @@ namespace math
   //! It assumes that max_digits10 is defined correctly or this might fail to make the correct selection.
   //! causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.
   //! Cannot switch on @c std::numeric_limits<>::max() because comparison values may overflow the compiler limit.
-  //! Cannot switch on @c std::numeric_limits::max_exponent10() 
+  //! Cannot switch on @c std::numeric_limits::max_exponent10()
   //! because both 80 and 128 bit floating-point implmentations use 11 bits for the exponent.
   //! So must rely on @c std::numeric_limits::max_digits10.
 
@@ -699,7 +700,7 @@ namespace math
     using boost::math::tools::max_value;
 
     int iterations = 0;
-   // int iterations_required = 6; // 
+   // int iterations_required = 6; //
     int max_iterations = 20; // Only as a check on looping.
 
     T tolerance = boost::math::policies::get_epsilon();
@@ -730,7 +731,7 @@ namespace math
       return w0;
     }
     // relative does NOT work well, so check for improvement in diff instead.
-    //else if ((abs(diff) / w0) <= tolerance) 
+    //else if ((abs(diff) / w0) <= tolerance)
     //{
     //  return w0;
     //}
@@ -788,7 +789,7 @@ namespace math
   } // T halley_update(T w0, const T z)
 
 
-  //! Halley update version that does one update without a check, 
+  //! Halley update version that does one update without a check,
   //! and then more updates as necessary.
   // TODO Might use a template parameter to avoid duplication?
   template
@@ -881,7 +882,7 @@ namespace math
     //   result = schroeder_update(w, y);
     //where
     // w is estimate of Lambert W (from bisection or series).
-    // y is z * e^-w. 
+    // y is z * e^-w.
 
     BOOST_MATH_STD_USING // Aid argument dependent lookup of abs.
     #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER
@@ -919,7 +920,7 @@ namespace math
   } // template T schroeder_update(const T w, const T y)
 
   /////////////  namespace detail implementations of Lambert W for W0 and W-1 branches.
- 
+
   //! Compute Lambert W for W0 (or W+) branch.
   template
   T lambert_w0_imp(const T z, const Policy& pol)
@@ -931,7 +932,7 @@ namespace math
     // Integral types should been promoted to double by user Lambert w functions.
     BOOST_STATIC_ASSERT_MSG(!std::is_integral::value,
       "Must be floating-point or fixed type (not integer type), for example: lambert_w0(1.), not lambert_w0(1)!");
-     
+
     const char* function = "boost::math::lambert_w0()"; // Used for error messages.
 
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W0
@@ -1002,7 +1003,7 @@ namespace math
         T w_series = lambert_w_singularity_series(T(sqrt(p2)));
         // Neither Halley nor Schroeder do not improve result for builtin,
         // differences about 5e-15, so do NOT use refinement step below unless multiprecision.
-        // 
+        //
         //int d2 = policies::digits(); // Precision as digits base 2 from policy.
         //if (d2 > (std::numeric_limits::digits - 6))
         //{ // If more (fullest) accuracy required, then use refinement.
@@ -1022,11 +1023,14 @@ namespace math
       }
     } //  z < -0.35
  // z < -1/e
-    else 
+    else
     { //! Check if z so big that cannot use lookup table, so approximate and Halley iterate.
      // std::cout << " lambert_w_lookup::w0zs[63] "  << lambert_w_lookup::w0zs[63] << ' ' << lambert_w_lookup::w0zs[64]  << std::endl;
-      // lambert_w_lookup::w0zs[63] = 1.4450833904658542e+29,  lambert_w_lookup::w0zs[64]=  3.9904954117194348e+29, 
-      if (z >= lambert_w_lookup::w0zs[lambert_w_lookup::noof_w0zs - 1]) // F[64] =  3.9904954117194348e+29
+
+      using namespace boost::math::detail::lambert_w_lookup;
+
+      // lambert_w_lookup::w0zs[63] = 1.4450833904658542e+29,  lambert_w_lookup::w0zs[64]=  3.9904954117194348e+29,
+      if (z >= w0zs[noof_w0zs - 1]) // F[64] =  3.9904954117194348e+29
       { //! z so big that cannot use lookup table, so approximate and Halley iterate.
         T guess;
          // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth, “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
@@ -1252,7 +1256,7 @@ namespace math
     } // normal range and precision.
     throw std::logic_error("No result from lambert_w0_imp!  (Please report!)");  // Should never get here.
   } //  T lambert_w0_imp(const T z, const Policy& pol)
- 
+
 
   //! Lambert W for W-1 branch, -max(z) < z <= -1/e.
   // TODO is -max(z) allowed?
@@ -1296,7 +1300,7 @@ namespace math
         return -std::numeric_limits::infinity();
       }
       else
-      { 
+      {
         return -tools::max_value();
       }
     }
@@ -1336,7 +1340,7 @@ namespace math
         z, pol);
     }
     if (z < static_cast(-0.35))
-    { // Close to singularity/branch point z = -0.3678794411714423215955237701614608727 but on W-1 branch. 
+    { // Close to singularity/branch point z = -0.3678794411714423215955237701614608727 but on W-1 branch.
       const T p2 = 2 * (boost::math::constants::e() * z + 1);
       if (p2 == 0)
       { // At the singularity at branch point.
@@ -1366,12 +1370,12 @@ namespace math
       //  z, pol);
     } // if (z < -0.35)
 
-    using lambert_w_lookup::wm1es;
-    using lambert_w_lookup::wm1zs;
-    using lambert_w_lookup::noof_wm1zs; // size == 64 
+    using boost::math::detail::lambert_w_lookup::wm1es;
+    using boost::math::detail::lambert_w_lookup::wm1zs;
+    using boost::math::detail::lambert_w_lookup::noof_wm1zs; // size == 64
 
     // std::cout <<" Wm1zs[63] (== G[64]) = " << " " << wm1zs[63] << std::endl; // Wm1zs[63] (== G[64]) =  -1.0264389699511283e-26
-    // Check that z argument value is not smaller than lookup_table G[64] 
+    // Check that z argument value is not smaller than lookup_table G[64]
     // std::cout << "(z > wm1zs[63]) = " << std::boolalpha << (z > wm1zs[63]) << std::endl;
 
     if (z >= wm1zs[63]) // wm1zs[63]  = -1.0264389699511282259046957018510946438e-26L  W = 64.00000000000000000
@@ -1452,7 +1456,7 @@ namespace math
     else // T is double or less precision.
     {
       // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection.
-      using namespace boost::math::detail::lambert_w_lookup;
+      using boost::math::detail::lambert_w_lookup::wm1zs;
       // Bracketing sequence  n = (2, 4, 8, 16, 32, 64) for W-1 branch. (0 is -infinity)
       // Since z is probably quite small, start with lowest n (=2).
       int n = 2;
@@ -1552,8 +1556,8 @@ namespace math
       // (Avoiding using exponential function for speed).
       // Only use @c lookup_t precision, default double, for bisection (again for speed),
       // and use later Halley refinement for higher precisions.
-      using lambert_w_lookup::halves;
-      using lambert_w_lookup::sqrtwm1s;
+      using detail::lambert_w_lookup::halves;
+      using detail::lambert_w_lookup::sqrtwm1s;
       lookup_t w = -static_cast(n); // Equation 25,
       lookup_t y = static_cast(z * wm1es[n - 1]); // Equation 26,
       // Perform the bisections fractional bisections for necessary precision.
@@ -1604,6 +1608,9 @@ namespace math
   }
 } // namespace detail ////////////////////////////////////////////////////////////
 
+// Put user functions in a separate namespace.
+
+namespace FKDVPB {
   // User Lambert W0 and Lambert W-1 functions.
 
   //! W0 branch, -1/e <= z < max(z)
@@ -1656,7 +1663,9 @@ namespace math
     return detail::lambert_wm1_imp(result_type(z), policies::policy<>());
   } // lambert_wm1(T z)
 
+  } // namespace FKDVPB {
+
   } // namespace math
 } // namespace boost
 
-#endif //  #ifndef BOOST_MATH_SF_LAMBERT_W_HPP
+#endif //  #ifndef BOOST_MATH_FKDVPB_LAMBERT_W_HPP
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index c2798a55e..90e53fb78 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -40,9 +40,6 @@ using boost::math::float_prior;
 #include 
 using boost::math::policies::digits2;
 #include  // For Lambert W lambert_w function.
-
-// #include "C:\Users\Paul\Desktop\lambert_w0 - Copy before amalgamation.hpp"  // JM latest providing jm_lambert_w0 and lambert_wm1
-//#include "C:\Users\Paul\Desktop\lambert_w0.hpp"  // JM latest providing jm_lambert_w0 and lambert_wm1
 using boost::math::lambert_wm1;
 using boost::math::lambert_w0; // Use jm version instead.
 
@@ -109,7 +106,7 @@ std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION <<
   message << "\n  STL " << BOOST_STDLIB;
   message << "\n  Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100;
 
-#ifdef BOOST_HAS_FLOAT
+#ifdef BOOST_HAS_FLOAT128
   message << ",  BOOST_HAS_FLOAT128" << std::endl;
 #endif
   message << std::endl;
@@ -129,6 +126,7 @@ void test_spots(RealType)
   using boost::math::policies::policy;
 
   /*  Example of an exception-free 'ignore_all' policy (possibly ill-advised?).
+  */
   typedef policy <
     boost::math::policies::domain_error,
     boost::math::policies::overflow_error,
@@ -137,19 +135,24 @@ void test_spots(RealType)
     boost::math::policies::pole_error,
     boost::math::policies::evaluation_error
   > ignore_all_policy;
-  */
 
-//  Test some bad parameters to the function, with default policy and with ignore_all policy.
+//  Test some bad parameters to the function, with default policy and also with ignore_all policy.
 #ifndef BOOST_NO_EXCEPTIONS
   BOOST_CHECK_THROW(lambert_w0(-1.), std::domain_error);
   BOOST_CHECK_THROW(lambert_wm1(-1.), std::domain_error);
   BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN.
+  //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy()), std::numeric_limits::quiet_NaN()); // Should be NaN.
+  // Fails as NaN != NaN by definition.
+  BOOST_CHECK(boost::math::isnan(lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy())));
+  //BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::infinity(), ignore_all_policy()), std::numeric_limits(std::numeric_limits::infinity()), std::domain_error); // Was if infinity should throw, now infinity.
   BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex.
-#else // No exceptions so set policy to ignore and check result is NaN
-  BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy), std::numeric_limits(std::numeric_limits::quiet_NaN(), ignore_all_policy()), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy()), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy()), std::numeric_limits
Date: Mon, 19 Feb 2018 17:30:57 +0000
Subject: [PATCH 38/71] Restore current files after merge went wrong.

---
 .../math/special_functions/lambert_w.hpp      |  96 ++++-----
 test/test_lambert_w.cpp                       | 202 ++++++++++++++----
 2 files changed, 199 insertions(+), 99 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 3f2c0e8e9..6621bba8f 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -803,6 +803,19 @@ inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&)
   return result;
 } // template  inline T lambert_w0_small_z_series(T z, const Policy& pol)
 
+// Approximate lambert_w0 (used for z values that are outside range of lookup table or rational functions)
+// Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+template 
+inline
+T lambert_w0_approx(T z)
+{
+  T lz = log(z);
+  T llz = log(lz);
+  T w = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+  return w;
+  // std::cout << "w max " << max_w << std::endl; // double 703.227
+}
+
   //////////////////////////////////////////////////////////////////////////////////////////
 
 //! \brief Lambert_w0 implementations for float, double and higher precisions.
@@ -839,6 +852,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
 	 {
 		 return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%", z, pol);
 	 }
+   if ((boost::math::isinf)(z))
+   {
+     return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%", z, pol);
+   }
 
    if (z >= 0.05)
    { // Normal ranges using several rational polynomials.
@@ -1062,9 +1079,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
 
     if ((boost::math::isnan)(z))
     {
-      return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%", z, pol);
+      return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%.", z, pol);
     }
 
+
    if (z >= 0.05)
    {
       if (z < 2)
@@ -1464,9 +1482,11 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
       }
       // z is larger than the largest double, so cannot use the polynomial to get an approximation,
       // so use the asymptotic approximation and Halley iterate:
-      T lz = log(z);
-      T llz = log(lz);
-      T w = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+
+     T w = lambert_w0_approx(z);  // Make an inline function as also used elsewhere.
+      //T lz = log(z);
+      //T llz = log(lz);
+      //T w = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
       return lambert_w_halley_iterate(w, z);
    }
    if (z < -0.3578794411714423215955237701)
@@ -1642,7 +1662,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955
 
     // R.M.Corless, G.H.Gonnet, D.E.G.Hare, D.J.Jeffrey, and D.E.Knuth,
-    // On the Lambert W function, Adv.Comput.Math., vol. 5, pp. 329-359, 1996.
+    // “On the Lambert W function, ” Adv.Comput.Math., vol. 5, pp. 329–359, 1996.
     // Francois Chapeau-Blondeau and Abdelilah Monir
     // Numerical Evaluation of the Lambert W Function
     // IEEE Transactions On Signal Processing, VOL. 50, NO. 9, Sep 2002
@@ -1855,7 +1875,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
         return result; // Halley
       } // schroeder or Schroeder and Halley.
     } // more than 10 digits2
-  }
+  } 
 } // template T lambert_wm1_imp(const T z)
 } // namespace lambert_w_detail
 
@@ -1884,15 +1904,13 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
 
     // Optionally, if policy is all T's digits (default), return after a extra Halley step.
     // (Might be better with mpl?)
-    int p = precision_type::value;
-    int d = std::numeric_limits::digits;
 
     T result = lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type()); // Pre-Halley.
 
     bool quick = (precision_type::value < std::numeric_limits::digits);
 
     if (quick || (result == -1) || (result == 0) || (!boost::math::isnormal(result)) || (z < -0.3578))
-    {
+    { // Don't try to refine using a Halley step.
       return result;
     }
     else
@@ -1903,7 +1921,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type());
   } // lambert_w0(T z, const Policy& pol)
 
-    //! Lambert W0 using default policy.
+  //! Lambert W0 using default policy.
   template  >
   inline
     typename tools::promote_args::type
@@ -1913,6 +1931,17 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // without doing any other internal promotion like float to double.
     typedef typename tools::promote_args::type result_type;
 
+    // Perhaps Deal with other special cases here??????????????
+    // (TODO NaN, zero? 
+    if ((boost::math::isinf)(z))
+    {
+      //return std::numeric_limits::infinity();  
+      //return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
+      // return boost::math::tools::max_value(); // far too big! 1.7e+308
+      // for double max possible is 703.227...
+      return boost::math::lambert_w_detail::lambert_w0_approx(lambert_w0(boost::math::tools::max_value()));
+    }
+
     // Work out what precision has been selected, based on the Policy and the number type.
     // For the default policy version, we want the *default policy* precision for T.
     typedef typename policies::precision::type precision_type;
@@ -1923,11 +1952,12 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
       : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
       : 2  // 64-bit (probably double) precision.
     > tag_type;
-    // Always add Halley step for default policy.
     T result = lambert_w_detail::lambert_w0_imp(result_type(z),  policies::policy<>(), tag_type()); // Pre-Halley.
+    // Always add Halley step for default policy, 
+    // unless these special cases where unlikely to improve.
     if ((z < -0.3578) // Using singularity series.
       || (!boost::math::isnormal(result))  // NaN, infinity or denormal.
-      || (result == -1) || (result == 0)) // exact
+      || (result == -1) || (result == 0)) // exact.
     {
       return result;
     }
@@ -1964,47 +1994,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
   } // lambert_wm1(T z)
 
 
-template 
-typename tools::promote_args::type
-lambert_w0_prime(T z)
-{
-    typedef typename tools::promote_args::type result_type;
-    using std::numeric_limits;
-    if (z == 0)
-    {
-        return static_cast(1);
-    }
-
-    // This is the sensible choice if we regard the Lambert-W function as complex analytic.
-    // Of course on the real line, it's just undefined.
-    if (z == - boost::math::constants::exp_minus_one())
-    {
-        return numeric_limits::infinity();
-    }
-    // if z < -1/e, we'll let lambert_w0 do the error handling:
-    result_type w = lambert_w0(result_type(z));
-    // If w ~ -1, then presumably this can get inaccurate.
-    // Is there an accurate way to evaluate 1 + W(-1/e + eps)? Yes: This is discussed in the Princeton Companion to Applied Mathmatics, 'The Lambert-W function', Section 1.3: Series and Generating Functions.
-    // 1 + W(-1/e + x) ~ sqrt(2ex). I am not convinced this formula is more accurate than the naive one.
-    // However, for z != -1/e, we never get rounded to w = -1 in any precision I've tested (up to cpp_bin_float_100).
-    return w/(z*(1+w));
-}
-
-template 
-typename tools::promote_args::type
-lambert_wm1_prime(T z)
-{
-    using std::numeric_limits;
-    typedef typename tools::promote_args::type result_type;
-    if (z == 0 || z == - boost::math::constants::exp_minus_one())
-    {
-        return -numeric_limits::infinity();
-    }
-    result_type w = lambert_wm1(z);
-    return w/(z*(1+w));
-}
-
-
 }} //boost::math namespaces
 
 #endif // #ifdef BOOST_MATH_SF_LAMBERT_W_HPP
+
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index 90e53fb78..e87dfd4d0 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -13,9 +13,7 @@
 #include    // for BOOST_MSVC definition.
 #include    // for BOOST_MSVC versions.
 #include  // for real_concept
-#include  // for integral tests
-#include  // for integral tests
-#include  // for integral tests
+
 // Boost macros
 #define BOOST_TEST_MAIN
 #define BOOST_LIB_DIAGNOSTIC "on" // Report library file details.
@@ -30,6 +28,7 @@
 using boost::multiprecision::cpp_dec_float_50;
 
 #include 
+using boost::multiprecision::cpp_bin_float_quad;
 //#include  // If available.
 #include  // isnan, ifinite.
 #include  // float_next, float_prior
@@ -43,6 +42,63 @@ using boost::math::policies::digits2;
 using boost::math::lambert_wm1;
 using boost::math::lambert_w0; // Use jm version instead.
 
+#define BOOST_MATH_LAMBERT_W_INTEGRALS
+
+#ifdef BOOST_MATH_LAMBERT_W_INTEGRALS
+
+// Added code and test for Integral of the Lambert W function: by Nick Thompson.
+// https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals
+
+#include  // for integral tests
+#include  // for integral tests
+#include  // for integral tests
+
+template
+void test_integrals()
+{
+  // Integral of the Lambert W function:
+  // https://en.wikipedia.org/wiki/Lambert_W_function
+  using boost::math::quadrature::tanh_sinh;
+  using boost::math::quadrature::exp_sinh;
+  // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html
+  using std::sqrt;
+
+  Real tol = std::numeric_limits::epsilon();
+  { //  // Integrate for function lambert_W0(z);
+    tanh_sinh ts;
+    Real a = 0;
+    Real b = boost::math::constants::e();
+    auto f = [](Real z)->Real
+    {
+      return lambert_w0(z);
+    };
+    Real z = ts.integrate(f, a, b); // OK without any decltype(f)
+    BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::e() - 1, tol);
+  }
+  {
+    // Integrate for function lambert_W0(z/(z sqrt(z)).
+    exp_sinh es;
+    auto f = [](Real z)->Real
+    {
+      return lambert_w0(z)/(z * sqrt(z));
+    };
+    Real z = es.integrate(f); // OK
+    BOOST_CHECK_CLOSE_FRACTION(z, 2 * boost::math::constants::root_two_pi(), tol);
+  }
+  {
+    // Integrate for function lambert_W0(1/z^2).
+    exp_sinh es;
+    auto f = [](Real z)->Real
+    {
+      return lambert_w0(1 / (z * z));
+    };
+    Real z = es.integrate(f);
+    BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol);
+  }
+} // template void test_integrals()
+
+#endif // BOOST_MATH_LAMBERT_W_INTEGRALS
+
 #include 
 #include 
 #include 
@@ -149,7 +205,7 @@ void test_spots(RealType)
   // BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::domain_error); // Was if infinity should throw, now infinity.
   BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex.
 
-#else // No exceptions so set policy to ignore and check result is NaN.
+#else // No exceptions, so set policy to ignore and check result is NaN.
   BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy()), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy()), std::numeric_limits(std::numeric_limits::infinity(), ignore_all_policy()), std::numeric_limits > :
+    // Error in "test_types": class boost::exception_detail::clone_impl > :
     // Error in function boost::math::lambert_w0() : Argument z is infinite!
     //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // If infinity allowed.
     BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::infinity()), std::domain_error); // Infinity NOT allowed.
@@ -503,11 +559,7 @@ void test_spots(RealType)
     BOOST_MATH_TEST_VALUE(RealType, -1.000000000000000000000000000000000000010000000000000000e-38),
     tolerance);
 
-
-
-
-
-  // Similar too near zero tests for W-1 branch
+  // Similar 'too near zero' tests for W-1 branch.
   // lambert_wm1(-1.0264389699511283e-26) = -64.000000000000000
   // Exactly z for W=-64
   BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.026438969951128225904695701851094643838952857740385870e-26)),
@@ -710,9 +762,8 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     tolerance); //
 
   // Tests for double only near the max and the singularity where Lambert_w estimates are less precise.
-  //
   if (std::numeric_limits::is_specialized)
-  {
+  { // is_specialized means that can use numeric_limits for tests.
     // Check near std::numeric_limits<>::max() for type.
     //std::cout << std::setprecision(std::numeric_limits::max_digits10)
     //  << (std::numeric_limits::max)()          // == 1.7976931348623157e+308
@@ -723,6 +774,11 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     // unknown location : fatal error : in "test_range_of_values": class boost::exception_detail::clone_impl >: Error in function boost::math::lambert_w0(): Argument z = %1 too large.
     // I:\modular - boost\libs\math\test\test_lambert_w.cpp(456) : last checkpoint
 
+    BOOST_CHECK_CLOSE_FRACTION(lambert_w0(1.7976931348623157e+308 ), // max_value for IEEE 64-bit double.
+      static_cast(703.2270331047701868711791887193075929608934699575820028L),
+      // N[productlog[0, 1.7976931348623157*10^308 /2],50] == 702.53487067487671916110655783739076368512998658347
+      tolerance);
+
     BOOST_CHECK_CLOSE_FRACTION(lambert_w0(1.7976931348623157e+308 / 2), // max_value/2 for IEEE 64-bit double.
       static_cast(702.53487067487671916110655783739076368512998658347L),
       // N[productlog[0, 1.7976931348623157*10^308 /2],50] == 702.53487067487671916110655783739076368512998658347
@@ -749,7 +805,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
       tolerance * 2e8); // OK but much less accurate near max.
 
   // Compare precisions very close to the singularity.
-    // This test value is one epsilon close to the singularity at -exp(-1) * x
+    // This test value is one epsilon close to the singularity at -exp(-1) * z
     // (below which the result has a non-zero imaginary part).
     RealType test_value = -exp_minus_one();
     test_value += (std::numeric_limits::epsilon() * 1);
@@ -883,8 +939,92 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
       BOOST_CHECK_EQUAL(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, 0.)),
         -std::numeric_limits::infinity());
     }
+} // BOOST_AUTO_TEST_CASE(test_range_of_double_values)
 
-} // BOOST_AUTO_TEST_CASE( test_main )
+#ifdef BOOST_MATH_LAMBERT_W_INTEGRALS
+
+BOOST_AUTO_TEST_CASE( integrals )
+{
+  BOOST_TEST_MESSAGE("\nTest Lambert W integrals.");
+  try
+  {
+  // using statements needed to change precision policy.
+  using boost::math::policies::policy;
+  using boost::math::policies::make_policy;
+  using boost::math::policies::precision;
+  using boost::math::policies::digits2;
+  using boost::math::policies::digits10;
+
+  // using statements needed for changing error handling policy.
+  using boost::math::policies::evaluation_error;
+  using boost::math::policies::domain_error;
+  using boost::math::policies::overflow_error;
+  using boost::math::policies::ignore_error;
+  using boost::math::policies::throw_on_error;
+
+  typedef policy<
+    domain_error,
+    overflow_error
+  > throw_policy;
+
+  double inf = std::numeric_limits::infinity();
+  double max = (std::numeric_limits::max)();
+  // With check in 
+  std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308
+  std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, throw_policy()) << std::endl; // inf
+  std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227
+  //std::cout << lambert_w0(inf) << std::endl; // inf - will throw.
+  std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0
+  std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324
+  std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308
+
+  // Approximate the largest lambert_w you can get for type T?
+  float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+  std::cout << "w max_f " << max_w_f << std::endl; // 84.2879
+  double max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+  std::cout << "w max " << max_w << std::endl; // 703.227
+
+  std::cout << "test integral 1/z^2" << std::endl;
+
+
+typedef double Real;
+Real tol = std::numeric_limits::epsilon();
+Real x;
+{
+    using boost::math::quadrature::exp_sinh;
+    exp_sinh es;
+    auto f = [](Real z)->Real
+    {
+      Real zz = 1 / (z * z);
+      //if (zz >= boost::math::tools::max_value())
+      //{
+      //  zz = boost::math::tools::max_value();
+      //}
+
+      return lambert_w0(zz); // 
+      //return lambert_w0(zz,  throw_policy()); // still fails because returns inf.
+
+
+    };
+    x = es.integrate(f);
+    std::cout << x << std::endl;
+    BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol);
+    // root_two_pi();
+  test_integrals();
+  //test_integrals();
+  test_integrals();
+  }
+  catch (std::exception& ex)
+  {
+    std::cout << ex.what() << std::endl;
+  }
+
+}
+
+#endif //  BOOST_MATH_LAMBERT_W_INTEGRALS
 
   /*
 
@@ -894,35 +1034,5 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
   */
 
 
-template
-void test_integrals()
-{
-    // Integral of the Lambert W function:
-    // https://en.wikipedia.org/wiki/Lambert_W_function
-    using boost::math::quadrature::tanh_sinh;
-    using boost::math::quadrature::exp_sinh;
-    using std::sqrt;
-    Real tol = std::numeric_limits::epsilon();
-    tanh_sinh ts;
-    Real a = 0;
-    Real b = boost::math::constants::e();
-    Real x = ts.integrate)>(lambert_w0, a, b);
-    BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::e() -1, tol);
-
-    exp_sinh es;
-    auto f = [](Real x)->Real { return lambert_w0(x)/(x*sqrt(x)); };
-    x = es.integrate(f);
-    BOOST_CHECK_CLOSE_FRACTION(x, 2*boost::math::constants::root_two_pi(), tol);
 
 
-    f = [](Real x)->Real { return lambert_w0(1/(x*x)); };
-    x = es.integrate(f);
-    BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol);
-}
-
-BOOST_AUTO_TEST_CASE(test_integrals)
-{
-    test_integrals();
-    test_integrals();
-    test_integrals();
-}

From 036dbae137ee8cb60fe210b75471bbf7241aebba Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Tue, 20 Feb 2018 17:03:26 +0000
Subject: [PATCH 39/71] Return to overflow on inf and tested OK using
 test_integrals

---
 .../math/special_functions/lambert_w.hpp      | 31 ++++++++++---------
 1 file changed, 17 insertions(+), 14 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 6621bba8f..5c378ac44 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -428,7 +428,7 @@ T lambert_w_singularity_series(const T p)
 
   //! Decimal values of specifications for built-in floating-point types below
   //! are 21 digits precision == max_digits10 for long double.
-  //! Care Some coefficients might overflow some fixed_point types.
+  //! Care! Some coefficients might overflow some fixed_point types.
 
   //! This version is intended to allow use by user-defined types
   //! like Boost.Multiprecision quad and cpp_dec_float types.
@@ -1081,7 +1081,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
     {
       return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%.", z, pol);
     }
-
+    if ((boost::math::isinf)(z))
+    {
+      return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%", z, pol);
+    }
 
    if (z >= 0.05)
    {
@@ -1222,7 +1225,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             3.44200749053237945e-09,
          };
          T log_w = log(z);
-         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+         return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
       else if (z < 7.896296e+13)  // 9.2 < log(z) <= 32
       {
@@ -1251,7 +1254,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             3.39460723731970550e-12,
          };
          T log_w = log(z);
-         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+         return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
       else if (z < 2.6881171e+43) // 32 < log(z) < 100
       {
@@ -1280,7 +1283,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             -2.60648331090076845e-14,
          };
          T log_w = log(z);
-         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+         return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
       else // 100 < log(z) < 710
       {
@@ -1313,7 +1316,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
             3.78250395617836059e-25,
          };
          T log_w = log(z);
-         return log_w+ Y + boost::math::tools::evaluate_rational(P, Q, log_w);
+         return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w);
       }
    }
    else
@@ -1933,14 +1936,14 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
 
     // Perhaps Deal with other special cases here??????????????
     // (TODO NaN, zero? 
-    if ((boost::math::isinf)(z))
-    {
-      //return std::numeric_limits::infinity();  
-      //return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
-      // return boost::math::tools::max_value(); // far too big! 1.7e+308
-      // for double max possible is 703.227...
-      return boost::math::lambert_w_detail::lambert_w0_approx(lambert_w0(boost::math::tools::max_value()));
-    }
+    //if ((boost::math::isinf)(z))
+    //{
+    // // return std::numeric_limits::infinity();  
+    //  static const char* function = "boost::math::lambert_w0<%1%>";
+    //  return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, policies::policy<>());
+    //  // for double max possible is 703.227... so this would return this value.
+    //  // return boost::math::lambert_w_detail::lambert_w0_approx(lambert_w0(boost::math::tools::max_value()));
+    //}
 
     // Work out what precision has been selected, based on the Policy and the number type.
     // For the default policy version, we want the *default policy* precision for T.

From 1e1059f37f53c3dc5801875619c99ffeac75869e Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Tue, 20 Feb 2018 17:04:28 +0000
Subject: [PATCH 40/71] tested OK using test_integrals

---
 test/test_lambert_w.cpp | 40 +++++++++++++++++++++-------------------
 1 file changed, 21 insertions(+), 19 deletions(-)

diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index e87dfd4d0..8088958c0 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -90,7 +90,12 @@ void test_integrals()
     exp_sinh es;
     auto f = [](Real z)->Real
     {
-      return lambert_w0(1 / (z * z));
+      Real zz = 1 / (z * z);
+      if (zz >= boost::math::tools::max_value())
+      {
+        zz = boost::math::tools::max_value();
+      }
+      return lambert_w0(zz);
     };
     Real z = es.integrate(f);
     BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol);
@@ -308,12 +313,12 @@ void test_spots(RealType)
 
   if (std::numeric_limits::has_infinity)
   {
-    BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::overflow_error); // If should throw exception.
+    BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::infinity()), std::overflow_error); // If should throw exception for infinity.
     //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // message is:
     // Error in "test_types": class boost::exception_detail::clone_impl > :
     // Error in function boost::math::lambert_w0() : Argument z is infinite!
     //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::infinity()), +std::numeric_limits::infinity()); // If infinity allowed.
-    BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::infinity()), std::domain_error); // Infinity NOT allowed.
+    BOOST_CHECK_THROW(lambert_wm1(std::numeric_limits::infinity()), std::domain_error); // Infinity NOT allowed at all (not an edge case).
   }
   if (std::numeric_limits::has_quiet_NaN)
   { // Argument Z == NaN is always an throwable error for both branches.
@@ -965,13 +970,13 @@ BOOST_AUTO_TEST_CASE( integrals )
   typedef policy<
     domain_error,
     overflow_error
-  > throw_policy;
+  > no_throw_policy;
 
   double inf = std::numeric_limits::infinity();
   double max = (std::numeric_limits::max)();
-  // With check in 
-  std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308
-  std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, throw_policy()) << std::endl; // inf
+  std::cout.precision(std::numeric_limits::max_digits10);
+  //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308
+  std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf
   std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227
   //std::cout << lambert_w0(inf) << std::endl; // inf - will throw.
   std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0
@@ -984,27 +989,24 @@ BOOST_AUTO_TEST_CASE( integrals )
   double max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
   std::cout << "w max " << max_w << std::endl; // 703.227
 
+  std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // 
   std::cout << "test integral 1/z^2" << std::endl;
 
-
 typedef double Real;
 Real tol = std::numeric_limits::epsilon();
 Real x;
 {
     using boost::math::quadrature::exp_sinh;
     exp_sinh es;
+
+    // Function to be integrated, lambert_w0(1/z^2).
     auto f = [](Real z)->Real
-    {
-      Real zz = 1 / (z * z);
-      //if (zz >= boost::math::tools::max_value())
-      //{
-      //  zz = boost::math::tools::max_value();
-      //}
-
-      return lambert_w0(zz); // 
-      //return lambert_w0(zz,  throw_policy()); // still fails because returns inf.
-
-
+    { 
+      Real zz = z * z;
+      // Avoid divide unity by zero giving infinity.
+      //Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
+      //return lambert_w0(one_div_zz); // 
+      return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); // 
     };
     x = es.integrate(f);
     std::cout << x << std::endl;

From 3105912ba7e10335a4c6c4127c4d6369355abff4 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Thu, 22 Feb 2018 18:15:29 +0000
Subject: [PATCH 41/71] Docs tidy and typos etc

---
 doc/sf/lambert_w.qbk | 23 +++++++++--------------
 1 file changed, 9 insertions(+), 14 deletions(-)

diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk
index 0c07ec710..f72ce1ddb 100644
--- a/doc/sf/lambert_w.qbk
+++ b/doc/sf/lambert_w.qbk
@@ -12,7 +12,7 @@
    ``__sf_result`` lambert_w0(T z); // W0 branch, default precision.
 
    template 
-   ``__sf_result`` lambert_w0_prime(T z); // W0 branch derivative
+   ``__sf_result`` lambert_w0_prime(T z); // W0 branch 1st derivative.
 
    template 
    ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy controlled precision.
@@ -21,7 +21,7 @@
    ``__sf_result`` lambert_wm1(T z); // W-1 branch.
 
    template 
-   ``__sf_result`` lambert_wm1_prime(T z); //W -1 branch derivative
+   ``__sf_result`` lambert_wm1_prime(T z); //W -1 branch 1st derivative.
 
    template 
    ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy controlled precision.
@@ -422,17 +422,8 @@ We also considered using __newton method.
 ``
 but concluded that since the Newton-Raphson method takes typically 6 iterations to converge within tolerance,
 whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ulp,
-<<<<<<< HEAD
 so the Newton-Raphson method is unlikely to be quicker
 than the additional cost of computing the 2nd derivative for Halley's method,
-in this case requiring an expensive exponential function evaluation on each step.
-
-
-=======
-so Newton/Raphson's method unlikely to be quicker
-than the additional cost of computating the 2nd derivative for Halley's method,
-each iteration step requiring an expensive exponential function evaluation.
->>>>>>> before trying to switch to develop to add test_value.hpp
 
 [h4:compact_implementation Implementing Compact Algorithms]
 
@@ -647,7 +638,8 @@ Some integer constants overflow, so use largest size available, suffixed by `uLL
 Above the 14th term, the rationals exceed the range of `unsigned long long` and are replaced
 by pre-computed decimal values at least 21 digits precision == `max_digits10` for `long double`.
 
-A macro `BOOST_MATH_TEST_VALUE` taking a decimal floating-point literal was used
+A macro `BOOST_MATH_TEST_VALUE` (defined in [@../../test/test_value.hpp  test_value.hpp])
+taking a decimal floating-point literal was used
 to allow testing with both built-in floating-point types like `double`
 which have contructors taking literal decimal values like `3.14`,
 [*and] also multiprecision and other User-defined Types that only provide full-precision construction
@@ -692,7 +684,7 @@ the computational cost of the log functions was easily paid by far fewer iterati
 
    using boost::math::policies::digits2;
    // Very close to z = -1.0264389699511303e-26 when W = 64, when effect of ln(ln(-z) term and ratio L1/L2 is greatest.
-   double z = z = -1e-26;
+   double z = -1e-26;
    double r = lambert_wm1(z, policy >());
    // lambert_wm1(-1.0000000000000000e-26) = -64.026509628385895
 
@@ -799,10 +791,13 @@ Mathematics, 244 (2013) 77-89.
 Exact analytical solution for current flow through diode with series resistance.
 [@http://dx.doi.org/10.1049/el:20000301]
 
+# Princeton Companion to Applied Mathmatics,
+'The Lambert-W function', Section 1.3: Series and Generating Functions.
+
 [endsect] [/section:lambert_w Lambert W function]
 
 [/
-  Copyright 2016 John Maddock, Paul A. Bristow, Thomas Luu.
+  Copyright 2016 John Maddock, Paul A. Bristow, Thomas Luu, Nicholas Thompson.
   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).

From 05474951a3e1f7ced2ec3d10e0a02bf1440b9702 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Thu, 22 Feb 2018 18:16:52 +0000
Subject: [PATCH 42/71] demo of a diagnosing integrating bad functions and
 tests of primes

---
 test/test_lambert_w.cpp | 145 ++++++++++++++++++++++++++++++++++++----
 1 file changed, 132 insertions(+), 13 deletions(-)

diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index 8088958c0..f56b6bad5 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -53,6 +53,62 @@ using boost::math::lambert_w0; // Use jm version instead.
 #include  // for integral tests
 #include  // for integral tests
 
+  using boost::math::policies::policy;
+  using boost::math::policies::make_policy;
+
+// using statements needed for changing error handling policy.
+using boost::math::policies::evaluation_error;
+using boost::math::policies::domain_error;
+using boost::math::policies::overflow_error;
+using boost::math::policies::ignore_error;
+using boost::math::policies::throw_on_error;
+
+typedef policy<
+  domain_error,
+  overflow_error
+> no_throw_policy;
+
+
+// Assumes that function has a throw policy, for example NOT lambert_w0(1 / (x * x), no_throw_policy());
+// Error in function boost::math::quadrature::exp_sinh::integrate: 
+// The exp_sinh quadrature evaluated your function at a singular point and resulted in inf.
+// Please ensure your function evaluates to a finite number of its entire domain.
+template 
+T debug_integration_proc(T x)
+{
+   T result; // warning C4701: potentially uninitialized local variable 'result' used
+  // T result = 0 ; // But result may not be assigned below?
+  try
+  {
+   // Assign function call to result in here...
+    result = lambert_w0(1 / (x * x)); 
+   // result = lambert_w0(1 / (x * x), no_throw_policy());  // Bad idea, less helpful diagnostic message is
+    // Error in function boost::math::quadrature::exp_sinh::integrate: 
+    // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf.
+    // Please ensure your function evaluates to a finite number of its entire domain.
+
+  } // try
+  catch (const std::exception& e)
+  {
+    std::cout << "Exception " << e.what() << std::endl;
+    // set breakpoint here:
+    std::cout << "Unexpected exception thrown in integration code at abscissa: " << x << "." << std::endl;
+    if (!std::isfinite(result))
+    {
+      // set breakpoint here:
+      std::cout << "Unexpected non-finite result in integration code at abscissa: " << x << "." << std::endl;
+    }
+    if (std::isnan(result))
+    {
+      // set breakpoint here:
+      std::cout << "Unexpected non-finite result in integration code at abscissa: " << x << "." << std::endl;
+    }
+  } // catch
+  return result;
+} // T debug_integration_proc(T x)
+
+
+
 template
 void test_integrals()
 {
@@ -90,12 +146,8 @@ void test_integrals()
     exp_sinh es;
     auto f = [](Real z)->Real
     {
-      Real zz = 1 / (z * z);
-      if (zz >= boost::math::tools::max_value())
-      {
-        zz = boost::math::tools::max_value();
-      }
-      return lambert_w0(zz);
+      Real zz = z * z; //  warning C4756: overflow in constant arithmetic.
+      return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz);
     };
     Real z = es.integrate(f);
     BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol);
@@ -946,6 +998,50 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     }
 } // BOOST_AUTO_TEST_CASE(test_range_of_double_values)
 
+BOOST_AUTO_TEST_CASE(derivatives_of_lambert_w)
+{
+
+  BOOST_TEST_MESSAGE("\nTest Lambert W function 1st differentials.");
+
+  using boost::math::constants::exp_minus_one;
+  using boost::math::lambert_w0_prime;
+  using boost::math::lambert_wm1_prime;
+
+  // Derivatives
+  // https://www.wolframalpha.com/input/?i=derivative+of+productlog(0,+x)
+  //  d/dx(W_0(x)) = W(x)/(x W(x) + x)
+  // https://www.wolframalpha.com/input/?i=derivative+of+productlog(-1,+x)
+  // d/dx(W_(-1)(x)) = (W_(-1)(x))/(x W_(-1)(x) + x)
+
+  typedef double RealType;
+
+  int epsilons = 1;
+  RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction.
+
+  //derivative of productlog(-1, x)   at x = -0.1 == -13.8803
+  // (derivative of productlog(-1, x) ) at x = N[-0.1, 55] - but the result disappears!
+  // (derivative of N[productlog(-1, x), 55] ) at x = N[-0.1, 55]
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.1)),
+    BOOST_MATH_TEST_VALUE(RealType, -13.880252213229781),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)),
+    BOOST_MATH_TEST_VALUE(RealType, -8.2411940564179051),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)),
+    BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218362),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, 10.)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.063577133469345098),
+    tolerance);
+
+
+}; // BOOST_AUTO_TEST_CASE("derivatives of lambert_w")
+
+
 #ifdef BOOST_MATH_LAMBERT_W_INTEGRALS
 
 BOOST_AUTO_TEST_CASE( integrals )
@@ -953,6 +1049,9 @@ BOOST_AUTO_TEST_CASE( integrals )
   BOOST_TEST_MESSAGE("\nTest Lambert W integrals.");
   try
   {
+
+
+
   // using statements needed to change precision policy.
   using boost::math::policies::policy;
   using boost::math::policies::make_policy;
@@ -992,6 +1091,8 @@ BOOST_AUTO_TEST_CASE( integrals )
   std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // 
   std::cout << "test integral 1/z^2" << std::endl;
 
+
+  // Experiment with better diagnostics.
 typedef double Real;
 Real tol = std::numeric_limits::epsilon();
 Real x;
@@ -1000,16 +1101,34 @@ Real x;
     exp_sinh es;
 
     // Function to be integrated, lambert_w0(1/z^2).
+
+    //  // Avoid divide unity by zero giving infinity.
+    // Commented out for test of try'n'catch diagnostics against this.
+    //auto f = [](Real z)->Real
+    //{ 
+    //  Real zz = z * z;
+    //  //Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
+    //  //return lambert_w0(one_div_zz); // 
+    //  return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); // 
+    //};
+
+    //auto f = [](Real z)->Real
+    //{ // Naive - no protection against underflow and subsequent divide by zero.
+    //  return lambert_w0(1 / (z * z));
+    //};
+    // Diagnostic is:
+    // Error in function boost::math::lambert_w0: Expected a finite value but got inf
+
+
     auto f = [](Real z)->Real
-    { 
-      Real zz = z * z;
-      // Avoid divide unity by zero giving infinity.
-      //Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
-      //return lambert_w0(one_div_zz); // 
-      return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); // 
+    { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things.
+      return debug_integration_proc(z);
     };
+    // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf.
+    // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163.
+
     x = es.integrate(f);
-    std::cout << x << std::endl;
+    std::cout << "es.integrate(f) = " << x << std::endl;
     BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol);
     // root_two_pi
Date: Thu, 22 Feb 2018 18:18:34 +0000
Subject: [PATCH 43/71] Added lost prime functions and a ref

---
 .../math/special_functions/lambert_w.hpp      | 67 ++++++++++++++++---
 1 file changed, 59 insertions(+), 8 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 5c378ac44..fdaa3b2e3 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -1,5 +1,6 @@
 // Copyright John Maddock 2017.
 // Copyright Paul A. Bristow 2016, 2017.
+// Copyright Nicholas Thompson 2018
 
 // Distributed under the Boost Software License, Version 1.0.
 // (See accompanying file LICENSE_1_0.txt or
@@ -21,6 +22,9 @@ Toshio Fukushima,
 J.Comp.Appl.Math. 244 (2013) 77-89,
 and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si
 based on the algorithm and a FORTRAN version of Toshio Fukushima's algorithm.
+
+First derivative of Lambert_w is derived from
+Princeton Companion to Applied Mathmatics, 'The Lambert-W function', Section 1.3: Series and Generating Functions.
 */
 
 /*
@@ -850,11 +854,11 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
 
 	 if ((boost::math::isnan)(z))
 	 {
-		 return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%", z, pol);
+		 return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%.", z, pol);
 	 }
    if ((boost::math::isinf)(z))
    {
-     return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%", z, pol);
+     return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
    }
 
    if (z >= 0.05)
@@ -1050,7 +1054,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
       else if (z <= -0.3678794411714423215955237701614608674458111310f)
       {
          if (z < -0.3678794411714423215955237701614608674458111310f)
-            return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+            return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol);
          return -1;
       }
       else
@@ -1083,7 +1087,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
     }
     if ((boost::math::isinf)(z))
     {
-      return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%", z, pol);
+      return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
     }
 
    if (z >= 0.05)
@@ -1442,7 +1446,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
       {
         if (z < -0.36787944117144232159552377016146086744581113103176804)
         {
-          return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+          return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol);
         }
         return -1;
       }
@@ -1468,7 +1472,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
    // Filter out special cases first:
    if ((boost::math::isnan)(z))
    {
-      return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+      return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol);
    }
    if (fabs(z) <= 0.05f)
    {
@@ -1500,7 +1504,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
          { // Exactly at the branch point singularity.
             return -1;
          }
-         return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%", z, pol);
+         return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol);
       }
       // z is very close (within 0.01) of the branch singularity at -e^-1
       // so use a series approximation proposed by Corless et al.
@@ -1533,7 +1537,6 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
 
 } // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)  extended precision.
 
-
   // Lambert w-1 implementation
 
   //! Lambert W for W-1 branch, -max(z) < z <= -1/e.
@@ -1996,6 +1999,54 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     return lambert_w_detail::lambert_wm1_imp(result_type(z), policies::policy<>());
   } // lambert_wm1(T z)
 
+  // First derivative of Lambert W0 and W-1.
+  template 
+  typename tools::promote_args::type
+  lambert_w0_prime(T z)
+  {
+    typedef typename tools::promote_args::type result_type;
+    using std::numeric_limits;
+    if (z == 0)
+    {
+        return static_cast(1);
+    }
+    // This is the sensible choice if we regard the Lambert-W function as complex analytic.
+    // Of course on the real line, it's just undefined.
+    if (z == - boost::math::constants::exp_minus_one())
+    {
+        return numeric_limits::infinity();
+    }
+    // if z < -1/e, we'll let lambert_w0 do the error handling:
+    result_type w = lambert_w0(result_type(z));
+    // If w ~ -1, then presumably this can get inaccurate.
+    // Is there an accurate way to evaluate 1 + W(-1/e + eps)?
+    //  Yes: This is discussed in the Princeton Companion to Applied Mathematics,
+    // 'The Lambert-W function', Section 1.3: Series and Generating Functions.
+    // 1 + W(-1/e + x) ~ sqrt(2ex).
+    // Nick is not convinced this formula is more accurate than the naive one.
+    // However, for z != -1/e, we never get rounded to w = -1 in any precision I've tested (up to cpp_bin_float_100).
+    return w / (z * (1 + w));
+  } // lambert_w0_prime(T z)
+
+  template 
+  typename tools::promote_args::type
+  lambert_wm1_prime(T z)
+  {
+    using std::numeric_limits;
+    typedef typename tools::promote_args::type result_type;
+    //if (z == 0)
+    //{
+    //      return static_cast(1);
+    //}
+    //if (z == - boost::math::constants::exp_minus_one())
+    if (z == 0 || z == - boost::math::constants::exp_minus_one())
+    {
+        return -numeric_limits::infinity();
+    }
+
+    result_type w = lambert_wm1(z);
+    return w/(z*(1+w));
+  } // lambert_wm1_prime(T z)
 
 }} //boost::math namespaces
 

From 3f1e3602ba80feede480018cf7073c5928724163 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Tue, 27 Feb 2018 13:20:37 +0000
Subject: [PATCH 44/71] Quadrature error diagnosis improved

---
 doc/sf/lambert_w.qbk                          |   3 +
 .../quadrature/detail/exp_sinh_detail.hpp     |  45 +++++--
 test/test_lambert_w.cpp                       |  83 +++++++-----
 test/test_value.hpp                           | 120 ------------------
 4 files changed, 90 insertions(+), 161 deletions(-)
 delete mode 100644 test/test_value.hpp

diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk
index f72ce1ddb..57845884d 100644
--- a/doc/sf/lambert_w.qbk
+++ b/doc/sf/lambert_w.qbk
@@ -794,6 +794,9 @@ Exact analytical solution for current flow through diode with series resistance.
 # Princeton Companion to Applied Mathmatics,
 'The Lambert-W function', Section 1.3: Series and Generating Functions.
 
+# Cleve Moler, Mathworks blog [@https://blogs.mathworks.com/cleve/2013/09/02/the-lambert-w-function/#bfba4e2d-e049-45a6-8285-fe8b51d69ce7 The Lambert W Function]
+
+# Digital Library of Mathematical Function, [@https://dlmf.nist.gov/4.13 Lambert W function].
 [endsect] [/section:lambert_w Lambert W function]
 
 [/
diff --git a/include/boost/math/quadrature/detail/exp_sinh_detail.hpp b/include/boost/math/quadrature/detail/exp_sinh_detail.hpp
index 3ce7a2d21..f3782deb6 100644
--- a/include/boost/math/quadrature/detail/exp_sinh_detail.hpp
+++ b/include/boost/math/quadrature/detail/exp_sinh_detail.hpp
@@ -15,6 +15,9 @@
 #include 
 #include 
 
+// #define BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+// to get some diagnostic info.
+
 namespace boost{ namespace math{ namespace quadrature { namespace detail{
 
 
@@ -158,20 +161,33 @@ Real exp_sinh_detail::integrate(const F& f, Real* error, Real* L1,
     {
        return policies::raise_domain_error(function, "The function you are trying to integrate does not go to zero at infinity, and instead evaluates to %1%", y_max, Policy());
     }
-
-    //std::cout << std::setprecision(5*std::numeric_limits::digits10);
-
+#ifdef BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+    std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10);
+#endif 
     // Get the party started with two estimates of the integral:
     Real I0 = 0;
     Real L1_I0 = 0;
     for(size_t i = 0; i < m_abscissas[0].size(); ++i)
     {
+      // TODO tidy this up?
+#ifdef BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+        Real z = m_abscissas[0][i];
+        std::cout << "m_abscissas[0][" << i << "] = " << z << std::endl;
+        Real w = f(z);
+        std::cout << "w = " << w << std::endl;
+#endif
+
         Real y = f(m_abscissas[0][i]);
         I0 += y*m_weights[0][i];
         L1_I0 += abs(y)*m_weights[0][i];
+#ifdef BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+        std::cout << "I0 = " << I0 << ", L1_I0 = " << L1_I0 << std::endl;
+#endif
     }
 
-    //std::cout << "First estimate : " << I0 << std::endl;
+#ifdef BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+    std::cout << "First estimate : " << I0 << std::endl;
+#endif
     Real I1 = I0;
     Real L1_I1 = L1_I0;
     for (size_t i = 0; i < m_abscissas[1].size(); ++i)
@@ -184,7 +200,9 @@ Real exp_sinh_detail::integrate(const F& f, Real* error, Real* L1,
     I1 *= half();
     L1_I1 *= half();
     Real err = abs(I0 - I1);
-    //std::cout << "Second estimate: " << I1 << " Error estimate at level " << 1 << " = " << err << std::endl;
+#ifdef BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+    std::cout << "Second estimate: " << I1 << " Error estimate at level " << 1 << " = " << err << std::endl;
+#endif
 
     size_t i = 2;
     for(; i < m_abscissas.size(); ++i)
@@ -225,10 +243,12 @@ Real exp_sinh_detail::integrate(const F& f, Real* error, Real* L1,
         I1 += sum*h;
         L1_I1 += absum*h;
         err = abs(I0 - I1);
-        //std::cout << "Estimate:        " << I1 << " Error estimate at level " << i  << " = " << err << std::endl;
+#ifdef BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+        std::cout << "Estimate:        " << I1 << " Error estimate at level " << i  << " = " << err << std::endl;
+#endif
         if (!isfinite(I1))
         {
-            return policies::raise_evaluation_error(function, "The exp_sinh quadrature evaluated your function at a singular point and resulted in %1%. Please ensure your function evaluates to a finite number of its entire domain.", I1, Policy());
+            return policies::raise_evaluation_error(function, "The exp_sinh quadrature evaluated your function at a singular point and resulted in %1%. Please ensure your function evaluates to a finite number over its entire domain.", I1, Policy());
         }
         if (err <= tolerance*L1_I1)
         {
@@ -251,9 +271,12 @@ Real exp_sinh_detail::integrate(const F& f, Real* error, Real* L1,
        *levels = i;
     }
 
+#ifdef BOOST_MATH_INSTRUMENT_QUADRATURE_EXP_SINH
+    std::cout << "Exp_sinh Quadrature " << function << " returns " << I1 << std::endl;
+    std::cout.precision(saved_precision); // Restore.
+#endif
     return I1;
-}
-
+} // Real exp_sinh_detail::integrate
 
 template
 void exp_sinh_detail::init(const mpl::int_<0>&)
@@ -466,10 +489,10 @@ void exp_sinh_detail::init(const mpl::int_<4>&)
       m_max_refinements = m_abscissas.size() - 1;
    }
 }
-#endif
+#endif // BOOST_HAS_FLOAT128
 
 }
 }
 }
 }
-#endif
+#endif // BOOST_MATH_QUADRATURE_DETAIL_EXP_SINH_DETAIL_HPP
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index f56b6bad5..60257f489 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -10,9 +10,12 @@
 //! \brief Basic sanity tests for Lambert W function plog productlog
 //! or lambert_w using algorithm informed by Thomas Luu, Veberic and Tosio Fukushima.
 
-#include    // for BOOST_MSVC definition.
+
+
+#include  // For float_64_t, float128_t. Must be first include!
+// Needs gnu++17 for BOOST_HAS_FLOAT128
+#include    // for BOOST_MSVC definition etc.
 #include    // for BOOST_MSVC versions.
-#include  // for real_concept
 
 // Boost macros
 #define BOOST_TEST_MAIN
@@ -29,7 +32,19 @@ using boost::multiprecision::cpp_dec_float_50;
 
 #include 
 using boost::multiprecision::cpp_bin_float_quad;
+
+#include 
+
+#ifdef BOOST_HAS_FLOAT128
+// Including this header without float128 triggers:
+// fatal error C1189: #error:  "Sorry compiler is neither GCC, not Intel, don't know how to configure this header."
+#include 
+using boost::multiprecision::float128;
+#endif
+
 //#include  // If available.
+
+#include  // for real_concept tests.
 #include  // isnan, ifinite.
 #include  // float_next, float_prior
 using boost::math::float_next;
@@ -40,7 +55,14 @@ using boost::math::float_prior;
 using boost::math::policies::digits2;
 #include  // For Lambert W lambert_w function.
 using boost::math::lambert_wm1;
-using boost::math::lambert_w0; // Use jm version instead.
+using boost::math::lambert_w0;
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
 
 #define BOOST_MATH_LAMBERT_W_INTEGRALS
 
@@ -49,9 +71,9 @@ using boost::math::lambert_w0; // Use jm version instead.
 // Added code and test for Integral of the Lambert W function: by Nick Thompson.
 // https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals
 
-#include  // for integral tests
-#include  // for integral tests
-#include  // for integral tests
+#include  // for integral tests.
+#include  // for integral tests.
+#include  // for integral tests.
 
   using boost::math::policies::policy;
   using boost::math::policies::make_policy;
@@ -68,9 +90,8 @@ typedef policy<
   overflow_error
 > no_throw_policy;
 
-
 // Assumes that function has a throw policy, for example NOT lambert_w0(1 / (x * x), no_throw_policy());
-// Error in function boost::math::quadrature::exp_sinh::integrate: 
+// Error in function boost::math::quadrature::exp_sinh::integrate:
 // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf.
 // Please ensure your function evaluates to a finite number of its entire domain.
 template 
@@ -81,9 +102,9 @@ T debug_integration_proc(T x)
   try
   {
    // Assign function call to result in here...
-    result = lambert_w0(1 / (x * x)); 
+    result = lambert_w0(1 / (x * x));
    // result = lambert_w0(1 / (x * x), no_throw_policy());  // Bad idea, less helpful diagnostic message is
-    // Error in function boost::math::quadrature::exp_sinh::integrate: 
+    // Error in function boost::math::quadrature::exp_sinh::integrate:
     // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf.
     // Please ensure your function evaluates to a finite number of its entire domain.
 
@@ -107,8 +128,6 @@ T debug_integration_proc(T x)
   return result;
 } // T debug_integration_proc(T x)
 
-
-
 template
 void test_integrals()
 {
@@ -156,13 +175,6 @@ void test_integrals()
 
 #endif // BOOST_MATH_LAMBERT_W_INTEGRALS
 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-
 //! Build a message of information about build, architecture, address model, platform, ...
 std::string show_versions()
 {
@@ -220,7 +232,7 @@ std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION <<
   message << "\n  Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100;
 
 #ifdef BOOST_HAS_FLOAT128
-  message << ",  BOOST_HAS_FLOAT128" << std::endl;
+  message << ",  BOOST_HAS_FLOAT128." << std::endl;
 #endif
   message << std::endl;
   return message.str();
@@ -681,7 +693,7 @@ void test_spots(RealType)
 
  } //template void test_spots(RealType)
 
-BOOST_AUTO_TEST_CASE(test_types)
+BOOST_AUTO_TEST_CASE( test_types )
 {
   BOOST_MATH_CONTROL_FP;
   // BOOST_TEST_MESSAGE output only appears if command line has --log_level="message"
@@ -702,8 +714,20 @@ BOOST_AUTO_TEST_CASE(test_types)
   test_spots(static_cast(0));
   test_spots(static_cast(0));
   test_spots(static_cast(0));
-  //test_spots(static_cast(0));
 
+#ifdef BOOST_HAS_FLOAT128
+  // Requires link to libquadmath library,
+  // http://www.boost.org/doc/libs/release/libs/multiprecision/doc/html/boost_multiprecision/tut/floats/float128.html
+  //  for example:
+  // C:\Program Files\mingw-w64\x86_64-7.2.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\7.2.0\libquadmath.a
+
+  using boost::multiprecision::float128;
+  std::cout << "BOOST_HAS_FLOAT128" << std::endl;
+
+  std::cout.precision(std::numeric_limits::max_digits10);
+
+  test_spots(static_cast(0));
+#endif // BOOST_HAS_FLOAT128
 
   // Fixed-point types:
   // Some fail 0.1 to 1.0 ???
@@ -712,9 +736,9 @@ BOOST_AUTO_TEST_CASE(test_types)
 
   //test_spots(boost::math::concepts::real_concept(0.1));  // "real_concept" - was OK.
 
-} // BOOST_AUTO_TEST_CASE( test_types)
+} // BOOST_AUTO_TEST_CASE( test_types )
 
-BOOST_AUTO_TEST_CASE(test_range_of_double_values)
+BOOST_AUTO_TEST_CASE( test_range_of_double_values )
 {
   using boost::math::constants::exp_minus_one;
   using boost::math::lambert_w0;
@@ -998,7 +1022,7 @@ BOOST_AUTO_TEST_CASE(test_range_of_double_values)
     }
 } // BOOST_AUTO_TEST_CASE(test_range_of_double_values)
 
-BOOST_AUTO_TEST_CASE(derivatives_of_lambert_w)
+BOOST_AUTO_TEST_CASE( derivatives_of_lambert_w )
 {
 
   BOOST_TEST_MESSAGE("\nTest Lambert W function 1st differentials.");
@@ -1088,7 +1112,7 @@ BOOST_AUTO_TEST_CASE( integrals )
   double max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
   std::cout << "w max " << max_w << std::endl; // 703.227
 
-  std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // 
+  std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; //
   std::cout << "test integral 1/z^2" << std::endl;
 
 
@@ -1105,11 +1129,11 @@ Real x;
     //  // Avoid divide unity by zero giving infinity.
     // Commented out for test of try'n'catch diagnostics against this.
     //auto f = [](Real z)->Real
-    //{ 
+    //{
     //  Real zz = z * z;
     //  //Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
-    //  //return lambert_w0(one_div_zz); // 
-    //  return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); // 
+    //  //return lambert_w0(one_div_zz); //
+    //  return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); //
     //};
 
     //auto f = [](Real z)->Real
@@ -1142,7 +1166,6 @@ Real x;
   {
     std::cout << ex.what() << std::endl;
   }
-
 }
 
 #endif //  BOOST_MATH_LAMBERT_W_INTEGRALS
diff --git a/test/test_value.hpp b/test/test_value.hpp
deleted file mode 100644
index c10596209..000000000
--- a/test/test_value.hpp
+++ /dev/null
@@ -1,120 +0,0 @@
-// Copyright Paul A. Bristow 2017.
-// Copyright John Maddock 2017.
-
-// 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)
-
-// test_value.hpp
-
-#ifndef TEST_VALUE_HPP
-#define TEST_VALUE_HPP
-
-// BOOST_MATH_TEST_VALUE is used to create a test value of suitable type from a decimal digit string.
-// Two parameters, both a floating-point literal double like 1.23 (not long double so no suffix L)
-// and a decimal digit string const char* like "1.23" must be provided.
-// The decimal value represented must be the same of course, with at least enough precision for long double.
-//   Note there are two gotchas to this approach:
-// * You need all values to be real floating-point values
-// * and *MUST* include a decimal point (to avoid confusion with an integer literal).
-// * It's slow to compile compared to a simple literal.
-
-// Speed is not an issue for a few test values,
-// but it's not generally usable in large tables
-// where you really need everything to be statically initialized.
-
-// Macro BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE provides a global diagnostic value for create_type.
-
-#include  // For float_64_t, float128_t. Must be first include!
-#include 
-#include 
-#include 
-
-#ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE
-// global int create_type(0); must be defined before including this file.
-#endif
-
-#ifdef BOOST_HAS_FLOAT128
-typedef __float128 largest_float;
-#define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##Q
-#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS std::numeric_limits::digits
-#else
-typedef long double largest_float;
-#define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##L
-#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS std::numeric_limits::digits
-#endif
-
-template 
-inline T create_test_value(largest_float val, const char*, const boost::mpl::true_&, const T2&)
-{ // Construct from long double or quad parameter val (ignoring string/const char* str).
-  // (This is case for MPL parameters = true_ and T2 == false_,
-  // and  MPL parameters = true_ and T2 == true_  cpp_bin_float)
-  // All built-in/fundamental floating-point types,
-  // and other User-Defined Types that can be constructed without loss of precision
-  // from long double suffix L (or quad suffix Q),
-  //
-  // Choose this method, even if can be constructed from a string,
-  // because it will be faster, and more likely to be the closest representation.
-  // (This is case for MPL parameters = mpl::true_ and T2 == mpl::true_).
-  #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE
-  create_type = 1;
-  #endif
-  return static_cast(val);
-}
-
-template 
-inline T create_test_value(largest_float, const char* str, const boost::mpl::false_&, const boost::mpl::true_&)
-{ // Construct from decimal digit string const char* @c str (ignoring long double parameter).
-  // For example, extended precision or other User-Defined types which ARE constructible from a string
-  // (but not from double, or long double without loss of precision).
-  // (This is case for MPL parameters = mpl::false_ and T2 == mpl::true_).
-  #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE
-  create_type = 2;
-  #endif
-  return T(str);
-}
-
-template 
-inline T create_test_value(largest_float, const char* str, const boost::mpl::false_&, const boost::mpl::false_&)
-{ // Create test value using from lexical cast of decimal digit string const char* str.
-  // For example, extended precision or other User-Defined types which are NOT constructible from a string
-  // (NOR constructible from a long double).
-    // (This is case T1 = mpl::false and T2 == mpl::false).
-  #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE
-  create_type = 3;
-  #endif
-  return boost::lexical_cast(str);
-}
-
-// T real type, x a decimal digits representation of a floating-point, for example: 12.34.
-// It must include a decimal point (or it would be interpreted as an integer).
-
-//  x is converted to a long double by appending the letter L (to suit long double fundamental type), 12.34L.
-//  x is also passed as a const char* or string representation "12.34"
-//  (to suit most other types that cannot be constructed from long double without possible loss).
-
-// BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) makes a long double or quad version, with
-// suffix a letter L (or Q) to suit long double (or quad) fundamental type, 12.34L or 12.34Q.
-// #x makes a decimal digit string version to suit multiprecision and fixed_point constructors, "12.34".
-// (Constructing from double or long double (or quad) could lose precision for multiprecision or fixed-point).
-
-// The matching create_test_value function above is chosen depending on the T1 and T2 mpl bool truths.
-// The string version from #x is used if the precision of T is greater than long double.
-
-// Example: long double test_value = BOOST_MATH_TEST_VALUE(double, 1.23456789);
-
-#define BOOST_MATH_TEST_VALUE(T, x) create_test_value(\
-  BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x),\
-  #x,\
-  boost::mpl::bool_<\
-    std::numeric_limits::is_specialized &&\
-      (std::numeric_limits::radix == 2)\
-        && (std::numeric_limits::digits <= BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS)\
-        && boost::is_convertible::value>(),\
-  boost::mpl::bool_<\
-    boost::is_constructible::value>()\
-)
-#endif // TEST_VALUE_HPP
-
-

From 23ecd1a1c09d047648ad86437c18ce5cd298acff Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Tue, 15 May 2018 14:00:34 +0100
Subject: [PATCH 45/71] All changes before getting develop up-to-date.

---
 doc/fp_utilities/float_next.qbk               |  24 +-
 doc/math.qbk                                  |   1 +
 doc/roots/elliptic_table_100_gcc_X64_SSE2.qbk |  12 +-
 doc/roots/root_comparison_tables_gcc.qbk      |  12 +-
 doc/roots/root_comparison_tables_msvc.qbk     |  12 +-
 doc/roots/roots_table_100_gcc_X64_SSE2.qbk    |  30 +-
 example/Jamfile.v2                            |  15 +-
 .../math/special_functions/lambert_w.hpp      | 321 ++++++++++++------
 test/Jamfile.v2                               |   1 +
 test/test_lambert_w.cpp                       |  92 +++--
 10 files changed, 360 insertions(+), 160 deletions(-)

diff --git a/doc/fp_utilities/float_next.qbk b/doc/fp_utilities/float_next.qbk
index 4c9de91a5..a3daa8541 100644
--- a/doc/fp_utilities/float_next.qbk
+++ b/doc/fp_utilities/float_next.qbk
@@ -20,6 +20,26 @@ __multiprecision __cpp_dec_float and__cpp_bin_float  are fixed at runtime,
 but [*not] a type that extends the representation to provide an exact representation
 for any number, for example [@http://keithbriggs.info/xrc.html XRC eXact Real in C].
 
+The accuracy of mathematical functions can be assessed and displayed in terms of __ULP,
+often as a ulps plot or by binning the differences as a histogram.
+Samples are evaluated using the implementation under test and compared with 'known good'
+representation obtained using a more accurate method.  Other implementations, often using
+arbitrary precision arithmetic, for example __WolframAlpha are one source of references
+values.  The other method, used widely in Boost.Math special functions, it to carry out
+the same algorithm, but using a higher precision type, typically using Boost.Multiprecision
+types like `cpp_bin_float_quad` for 128-bit (about 35 decimal digit precision), or
+`cpp_bin_float_50` (for 50 decimal digit precision).
+
+When converted to a particular machine representation, say `double`, say using a `static_cast`,
+the value is the nearest representation possible for the `double` type.  This value
+cannot be 'wrong' by more than half a __ulp, and can be obtained using the Boost.Math function `ulp`.
+(Unless the algorithm is fundamentally flawed, something that should be revealed by 'sanity'
+checks using some independent sources).
+
+See some discussion and example plots by Cleve Moler of Mathworks
+[@https://blogs.mathworks.com/cleve/2017/01/23/ulps-plots-reveal-math-function-accurary/
+ulps plots reveal math-function accuracy].
+
 [section:nextafter Finding the Next Representable Value in a Specific Direction (nextafter)]
 
 [h4 Synopsis]
@@ -220,13 +240,13 @@ Function `ulp` gives the size of a unit-in-the-last-place for a specified floati
 
 Returns one [@http://en.wikipedia.org/wiki/Unit_in_the_last_place unit in the last place] of ['x].
 
-Corner cases are handled as followes:
+Corner cases are handled as follows:
 
 * If the argument is a NaN, then raises a __domain_error.
 * If the argument is an infinity, then raises an __overflow_error.
 * If the argument is zero then returns the smallest representable value: for example for type
 `double` this would be either `std::numeric_limits::min()` or `std::numeric_limits::denorm_min()`
-depending whether denormals are supported (which have the values 2.`2250738585072014e-308` and `4.9406564584124654e-324` respectively).
+depending whether denormals are supported (which have the values `2.2250738585072014e-308` and `4.9406564584124654e-324` respectively).
 * If the result is too small to represent, then returns the smallest representable value.
 * Always returns a positive value such that `ulp(x) == ulp(-x)`.
 
diff --git a/doc/math.qbk b/doc/math.qbk
index d3288d3ea..4f3b815ad 100644
--- a/doc/math.qbk
+++ b/doc/math.qbk
@@ -447,6 +447,7 @@ and use the function's name as the link text.]
 [def __Luu_thesis [@http://discovery.ucl.ac.uk/1482128/1/Luu_thesis.pdf Thomas Luu, Thesis, University College London (2015)]]
 [def __rational_function [@https://en.wikipedia.org/wiki/Rational_function rational function]]
 [def __remez [@http://en.wikipedia.org/wiki/Remez_algorithm Remez algorithm]]
+[def __ULP [@https://en.wikipedia.org/wiki/Unit_in_the_last_place Unit in the Last Place]]
 
 [/ Some composite templates]
 [template super[x]''''''[x]'''''']
diff --git a/doc/roots/elliptic_table_100_gcc_X64_SSE2.qbk b/doc/roots/elliptic_table_100_gcc_X64_SSE2.qbk
index 4087704f4..6b4818f75 100644
--- a/doc/roots/elliptic_table_100_gcc_X64_SSE2.qbk
+++ b/doc/roots/elliptic_table_100_gcc_X64_SSE2.qbk
@@ -1,4 +1,4 @@
-[/./../../../libs/math/doc/roots/elliptic_table_100_gcc_X64_SSE2.qbk
+[/..\example/../../../libs/math/doc/roots/elliptic_table_100_gcc_X64_SSE2.qbk
 Copyright 2015 Paul A. Bristow.
 Copyright 2015 John Maddock.
 Distributed under the Boost Software License, Version 1.0.
@@ -8,13 +8,13 @@ http://www.boost.org/LICENSE_1_0.txt).
 
 
 [h6 Program [@../../example/root_elliptic_finding.cpp root_elliptic_finding.cpp],
- GNU C++ version 4.9.2, GNU libstdc++ version 20141030, Win32
+ GNU C++ version 7.2.0, GNU libstdc++ version 20170814, Win32
 Compiled in optimise mode., _X64_SSE2]
 [table:elliptic root with radius 28 and arc length 300) for float, double, long double and cpp_bin_float_50 types, using _X64_SSE2
 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]]
 [[Algo     ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]]
-[[TOMS748  ][  5][  328][1.31][ -1][ ][  8][  875][1.51][  0][ ][  8][ 1109][1.69][  4][ ][ 11][479687][1.49][ -3][ ]]
-[[Newton   ][  3][  328][1.31][ -1][ ][  4][  671][1.16][  1][ ][  4][  781][1.19][  1][ ][  5][387500][1.20][  0][ ]]
-[[Halley   ][  2][  250][[role blue 1.00]][  0][ ][  3][  578][[role blue 1.00]][  1][ ][  3][  656][[role blue 1.00]][  7][ ][  4][321875][[role blue 1.00]][  0][ ]]
-[[Schr'''ö'''der][  3][  375][1.50][ -1][ ][  4][  734][1.27][  0][ ][  4][  828][1.26][  3][ ][  5][414062][1.29][ -2][ ]]
+[[TOMS748  ][  5][  437][1.17][ -1][ ][  8][ 1234][1.08][  0][ ][  8][ 2562][1.48][  4][ ][ 11][657812][1.49][ -3][ ]]
+[[Newton   ][  3][  437][1.17][ -1][ ][  4][ 1421][1.25][  1][ ][  4][ 2031][1.17][  1][ ][  5][550000][1.25][  0][ ]]
+[[Halley   ][  2][  375][[role blue 1.00]][  0][ ][  3][ 1140][[role blue 1.00]][  1][ ][  3][ 1734][[role blue 1.00]][  7][ ][  4][440625][[role blue 1.00]][  0][ ]]
+[[Schr'''ö'''der][  3][  500][1.33][ -1][ ][  4][ 1484][1.30][  0][ ][  4][ 2156][1.24][  3][ ][  5][535937][1.22][ -2][ ]]
 ] [/end of table root]
diff --git a/doc/roots/root_comparison_tables_gcc.qbk b/doc/roots/root_comparison_tables_gcc.qbk
index f73bd6b9d..5de0275d5 100644
--- a/doc/roots/root_comparison_tables_gcc.qbk
+++ b/doc/roots/root_comparison_tables_gcc.qbk
@@ -7,13 +7,13 @@ http://www.boost.org/LICENSE_1_0.txt).
 ]
 
 
-[h5 Program root_finding_algorithms.cpp, GNU C++ version 4.9.2, GNU libstdc++ version 20141030, Win32, x64[br]1000000 evaluations of each of 5 root_finding algorithms.]
+[h5 Program root_finding_algorithms.cpp, GNU C++ version 7.2.0, GNU libstdc++ version 20170814, Win32, x64[br]1000000 evaluations of each of 5 root_finding algorithms.]
 [table:cbrt_4 Cube root(28) for float, double, long double and cpp_bin_float_50
 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]]
 [[Algorithm][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]]
-[[cbrt     ][  0][46875][[role blue 1.0]][  0][ ][  0][46875][[role blue 1.0]][  0][ ][  0][46875][[role blue 1.0]][  0][ ][  0][3500000][1.1][  0][ ]]
-[[TOMS748  ][  8][187500][4.0][ -1][ ][ 11][406250][[role red 8.7]][  2][ ][ 10][609375][[role red 13.]][ -1][ ][  7][44531250][[role red 14.]][ -2][ ]]
-[[Newton   ][  5][93750][2.0][  0][ ][  6][109375][2.3][  0][ ][  6][171875][3.7][  0][ ][  2][3140625][[role blue 1.0]][ -1][ ]]
-[[Halley   ][  3][93750][2.0][  0][ ][  4][125000][2.7][  0][ ][  4][218750][[role red 4.7]][  0][ ][  2][7171875][2.3][  0][ ]]
-[[Schr'''ö'''der][  4][109375][2.3][  0][ ][  5][171875][3.7][  0][ ][  5][281250][[role red 6.0]][  0][ ][  2][8703125][2.8][  0][ ]]
+[[cbrt     ][  0][46875][[role blue 1.0]][  0][ ][  0][125000][[role blue 1.0]][  0][ ][  0][109375][[role blue 1.0]][  0][ ][  0][3875000][[role blue 1.0]][  0][ ]]
+[[TOMS748  ][  8][281250][[role red 6.0]][ -1][ ][ 11][453125][3.6][  2][ ][ 10][1750000][[role red 16.]][ -1][ ][  6][30312500][[role red 7.8]][ -2][ ]]
+[[Newton   ][  5][109375][2.3][  0][ ][  6][140625][1.1][  0][ ][  6][281250][2.6][  0][ ][  2][4125000][1.1][ -1][ ]]
+[[Halley   ][  3][125000][2.7][  0][ ][  4][140625][1.1][  0][ ][  4][515625][[role red 4.7]][  0][ ][  2][9171875][2.4][  0][ ]]
+[[Schr'''ö'''der][  4][140625][3.0][  0][ ][  5][171875][1.4][  0][ ][  5][671875][[role red 6.1]][  0][ ][  2][10578125][2.7][  0][ ]]
 ] [/end of table cbrt_4]
diff --git a/doc/roots/root_comparison_tables_msvc.qbk b/doc/roots/root_comparison_tables_msvc.qbk
index ce39f06c3..53e401439 100644
--- a/doc/roots/root_comparison_tables_msvc.qbk
+++ b/doc/roots/root_comparison_tables_msvc.qbk
@@ -7,13 +7,13 @@ http://www.boost.org/LICENSE_1_0.txt).
 ]
 
 
-[h5 Program root_finding_algorithms.cpp, Microsoft Visual C++ version 14.0, Dinkumware standard library version 650, Win32, x86[br]1000000 evaluations of each of 5 root_finding algorithms.]
+[h5 Program root_finding_algorithms.cpp, Clang version 6.0.0 (tags/RELEASE_600/final), Dinkumware standard library version 650, Win32, x64[br]1000000 evaluations of each of 5 root_finding algorithms.]
 [table:cbrt_4 Cube root(28) for float, double, long double and cpp_bin_float_50
 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]]
 [[Algorithm][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]]
-[[cbrt     ][  0][203125][[role blue 1.0]][  0][ ][  0][234375][[role blue 1.0]][  1][ ][  0][203125][[role blue 1.0]][  1][ ][  0][10281250][[role blue 1.0]][  0][ ]]
-[[TOMS748  ][  8][843750][[role red 4.2]][ -1][ ][ 11][1125000][[role red 4.8]][  2][ ][ 11][1203125][[role red 5.9]][  2][ ][  6][71765625][[role red 7.1]][ -2][ ]]
-[[Newton   ][  5][593750][2.9][  0][ ][  6][578125][2.5][  0][ ][  6][625000][3.1][  0][ ][  2][10062500][[role blue 1.0]][  0][ ]]
-[[Halley   ][  3][593750][2.9][  0][ ][  4][609375][2.6][  0][ ][  4][593750][2.9][  0][ ][  2][20859375][2.1][  0][ ]]
-[[Schr'''ö'''der][  4][593750][2.9][  0][ ][  5][593750][2.5][  0][ ][  5][609375][3.0][  0][ ][  2][25171875][2.5][  0][ ]]
+[[cbrt     ][  0][62500][[role blue 1.0]][  0][ ][  0][46875][[role blue 1.0]][  1][ ][  0][62500][[role blue 1.0]][  1][ ][  0][5750000][1.1][  0][ ]]
+[[TOMS748  ][  8][343750][[role red 5.5]][ -1][ ][ 11][531250][[role red 11.]][  2][ ][ 11][531250][[role red 8.5]][  2][ ][  6][40031250][[role red 7.4]][ -2][ ]]
+[[Newton   ][  5][171875][2.8][  0][ ][  6][187500][4.0][  0][ ][  6][187500][3.0][  0][ ][  2][5406250][[role blue 1.0]][  0][ ]]
+[[Halley   ][  3][187500][3.0][  0][ ][  4][218750][[role red 4.7]][  0][ ][  4][203125][3.3][  0][ ][  2][12968750][2.4][  0][ ]]
+[[Schr'''ö'''der][  4][203125][3.3][  0][ ][  5][250000][[role red 5.3]][  0][ ][  5][218750][3.5][  0][ ][  2][15984375][3.0][  0][ ]]
 ] [/end of table cbrt_4]
diff --git a/doc/roots/roots_table_100_gcc_X64_SSE2.qbk b/doc/roots/roots_table_100_gcc_X64_SSE2.qbk
index f8ee069c7..871ccc7d4 100644
--- a/doc/roots/roots_table_100_gcc_X64_SSE2.qbk
+++ b/doc/roots/roots_table_100_gcc_X64_SSE2.qbk
@@ -1,4 +1,4 @@
-[/./../../../libs/math/doc/roots/roots_table_100_gcc_X64_SSE2.qbk
+[/..\example/../../../libs/math/doc/roots/roots_table_100_gcc_X64_SSE2.qbk
 Copyright 2015 Paul A. Bristow.
 Copyright 2015 John Maddock.
 Distributed under the Boost Software License, Version 1.0.
@@ -7,31 +7,31 @@ http://www.boost.org/LICENSE_1_0.txt).
 ]
 
 
-[h6 Program root_n_finding_algorithms.cpp,
- GNU C++ version 4.9.2, GNU libstdc++ version 20141030, Win32
+[h6 Program ..\example\root_n_finding_algorithms.cpp,
+ GNU C++ version 7.2.0, GNU libstdc++ version 20170814, Win32
 Compiled in optimise mode., _X64_SSE2]
 Fraction of full accuracy 1
 [table:root_5 5th root(28) for float, double, long double and cpp_bin_float_50 types, using _X64_SSE2
 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]]
 [[Algo     ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]]
-[[TOMS748  ][  7][  193][2.14][  0][ ][ 11][  432][3.86][  1][ ][  9][  579][3.83][  0][ ][ 12][59062][[role red 7.56]][  0][ ]]
-[[Newton   ][  3][   90][[role blue 1.00]][  0][ ][  4][  112][[role blue 1.00]][ -1][ ][  5][  151][[role blue 1.00]][  0][ ][  6][ 7812][[role blue 1.00]][  0][ ]]
-[[Halley   ][  2][   98][1.09][  0][ ][  3][  135][1.21][  0][ ][  3][  201][1.33][  0][ ][  4][13750][1.76][  0][ ]]
-[[Schr'''ö'''der][  2][  112][1.24][  0][ ][  3][  142][1.27][ -1][ ][  3][  206][1.36][  0][ ][  4][17031][2.18][  0][ ]]
+[[TOMS748  ][  7][  260][2.26][  0][ ][ 11][  481][3.51][  1][ ][  9][ 1526][[role red 6.78]][  0][ ][ 12][70937][[role red 8.11]][  0][ ]]
+[[Newton   ][  3][  115][[role blue 1.00]][  0][ ][  4][  137][[role blue 1.00]][ -1][ ][  5][  225][[role blue 1.00]][  0][ ][  6][ 8750][[role blue 1.00]][  0][ ]]
+[[Halley   ][  2][  135][1.17][  0][ ][  3][  162][1.18][  0][ ][  3][  412][1.83][  0][ ][  4][14687][1.68][  0][ ]]
+[[Schr'''ö'''der][  2][  135][1.17][  0][ ][  3][  170][1.24][ -1][ ][  3][  425][1.89][  0][ ][  4][18906][2.16][  0][ ]]
 ] [/end of table root]
 [table:root_7 7th root(28) for float, double, long double and cpp_bin_float_50 types, using _X64_SSE2
 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]]
 [[Algo     ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]]
-[[TOMS748  ][ 12][  351][1.97][  1][ ][ 15][  621][3.18][  2][ ][ 13][  906][3.61][  0][ ][ 14][75468][[role red 7.10]][  0][ ]]
-[[Newton   ][  5][  178][[role blue 1.00]][  0][ ][  6][  195][[role blue 1.00]][  0][ ][  7][  251][[role blue 1.00]][  0][ ][  8][10625][[role blue 1.00]][  0][ ]]
-[[Halley   ][  4][  196][1.10][  0][ ][  5][  242][1.24][  0][ ][  5][  345][1.37][  0][ ][  6][21093][1.99][  0][ ]]
-[[Schr'''ö'''der][  5][  225][1.26][  0][ ][  6][  270][1.38][  0][ ][  6][  384][1.53][  0][ ][  7][29062][2.74][  0][ ]]
+[[TOMS748  ][ 12][  465][3.39][  1][ ][ 15][  662][[role red 4.24]][  2][ ][ 13][ 2304][[role red 8.17]][  0][ ][ 14][91093][[role red 7.29]][  0][ ]]
+[[Newton   ][  5][  137][[role blue 1.00]][  0][ ][  6][  156][[role blue 1.00]][  0][ ][  7][  282][[role blue 1.00]][  0][ ][  8][12500][[role blue 1.00]][  0][ ]]
+[[Halley   ][  4][  181][1.32][  0][ ][  5][  210][1.35][  0][ ][  5][  540][1.91][  0][ ][  6][24062][1.92][  0][ ]]
+[[Schr'''ö'''der][  5][  201][1.47][  0][ ][  6][  242][1.55][  0][ ][  6][  660][2.34][  0][ ][  7][35625][2.85][  0][ ]]
 ] [/end of table root]
 [table:root_11 11th root(28) for float, double, long double and cpp_bin_float_50 types, using _X64_SSE2
 [[][float][][][] [][double][][][] [][long d][][][] [][cpp50][][]]
 [[Algo     ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ][Its][Times][Norm][Dis][ ]]
-[[TOMS748  ][ 12][  429][2.22][ -2][ ][ 14][  679][3.02][  2][ ][ 14][ 1098][3.94][  1][ ][ 17][114531][[role red 8.83]][  2][ ]]
-[[Newton   ][  6][  193][[role blue 1.00]][  0][ ][  7][  225][[role blue 1.00]][  0][ ][  7][  279][[role blue 1.00]][  0][ ][  9][12968][[role blue 1.00]][  0][ ]]
-[[Halley   ][  4][  196][[role blue 1.02]][ -1][ ][  5][  248][1.10][  0][ ][  5][  348][1.25][  0][ ][  6][21718][1.67][  0][ ]]
-[[Schr'''ö'''der][  6][  254][1.32][  0][ ][  7][  323][1.44][  0][ ][  7][  453][1.62][  0][ ][  8][35625][2.75][  0][ ]]
+[[TOMS748  ][ 12][  562][3.53][ -2][ ][ 14][  701][3.85][  2][ ][ 14][ 2665][[role red 9.10]][  1][ ][ 17][137968][[role red 9.60]][  2][ ]]
+[[Newton   ][  6][  159][[role blue 1.00]][  0][ ][  7][  182][[role blue 1.00]][  0][ ][  7][  293][[role blue 1.00]][  0][ ][  9][14375][[role blue 1.00]][  0][ ]]
+[[Halley   ][  4][  185][1.16][ -1][ ][  5][  220][1.21][  0][ ][  5][  757][2.58][  0][ ][  6][26093][1.82][  0][ ]]
+[[Schr'''ö'''der][  6][  246][1.55][  0][ ][  7][  279][1.53][  0][ ][  7][ 1135][3.87][  0][ ][  8][41093][2.86][  0][ ]]
 ] [/end of table root]
diff --git a/example/Jamfile.v2 b/example/Jamfile.v2
index 232bdbce5..5660d58f1 100644
--- a/example/Jamfile.v2
+++ b/example/Jamfile.v2
@@ -17,10 +17,10 @@ project
       intel:-Qwd264,239
       msvc:all
       msvc:on
-		msvc:_CRT_SECURE_NO_DEPRECATE
-		msvc:_SCL_SECURE_NO_DEPRECATE
-		msvc:_SCL_SECURE_NO_WARNINGS
-		msvc:_CRT_SECURE_NO_WARNINGS
+      msvc:_CRT_SECURE_NO_DEPRECATE
+      msvc:_SCL_SECURE_NO_DEPRECATE
+      msvc:_SCL_SECURE_NO_WARNINGS
+      msvc:_CRT_SECURE_NO_WARNINGS
       msvc:/wd4996
       msvc:/wd4512
       msvc:/wd4610
@@ -32,11 +32,14 @@ project
       msvc:/wd4459
       #-msvc:/Za # nonfinite Serialization examples fail link if disable MS extensions,
       #  because serialization library is built with MS extensions enabled (default).
+      clang:-Wno-unknown-pragmas
+      clang:-Wno-language-extension-token
+
       ../../..
       ../include_private
       off:../test//no_eh
     ;
-    
+
 test-suite examples :
    [ run bessel_zeros_example_1.cpp : : : off:no  ]
    [ run bessel_zeros_interator_example.cpp : : : off:no  ]
@@ -122,7 +125,7 @@ test-suite examples :
    [ run root_finding_algorithms.cpp /boost/timer : : : release static  [ requires cxx11_hdr_tuple cxx11_unified_initialization_syntax ] freebsd:"-lrt" linux:"-lrt -lpthread" ]
    [ run root_n_finding_algorithms.cpp /boost/timer : : : release static  [ requires cxx11_unified_initialization_syntax cxx11_defaulted_functions ] freebsd:"-lrt" linux:"-lrt -lpthread" ]
 
-   [ explicit root_elliptic_finding  ] 
+   [ explicit root_elliptic_finding  ]
    [ explicit root_finding_algorithms  ]
    [ explicit root_n_finding_algorithms  ]
 
diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index fdaa3b2e3..1a1736d28 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -463,7 +463,7 @@ T lambert_w_singularity_series(const T p)
   //! causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.
   //! Cannot switch on @c std::numeric_limits<>::max() because comparison values may overflow the compiler limit.
   //! Cannot switch on @c std::numeric_limits::max_exponent10()
-  //! because both 80 and 128 bit floating-point implmentations use 11 bits for the exponent.
+  //! because both 80 and 128 bit floating-point implementations use 11 bits for the exponent.
   //! So must rely on @c std::numeric_limits::max_digits10.
 
   //! Specialization of float zero series expansion used for small z (abs(z) < 0.05).
@@ -484,24 +484,26 @@ template 
 T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<2> const&);   //  for long double (double extended 80-bit) type.
 
 template 
-T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&);   //  for float128
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&);   //  for long double (128-bit) type.
 
 template 
-T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&);   //  Generic multiprecision T.
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<4> const&);   //  for float128 quadmath Q type.
 
+template 
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<5> const&);   //  Generic multiprecision T.
                                                                         // Set tag_type depending on max_digits10.
 template 
 T lambert_w0_small_z(T x, const Policy& pol)
-{
+{ //std::numeric_limits::max_digits10 == 36 ? 3 : // 128-bit long double.
   typedef boost::mpl::int_
     <
-    std::numeric_limits::max_digits10 <= 9 ? 0 :  //  for float
-    std::numeric_limits::max_digits10 <= 17 ? 1 : //  for double 64-bit
-    std::numeric_limits::max_digits10 <= 22 ? 2 :  //  for  80-bit double extended
-    std::numeric_limits::max_digits10 < 37 ? 3 : //  for float128  128-bit quad
-    4 // Generic multiprecision types.
+    std::numeric_limits::max_digits10 <=  9 ? 0 : // for float 32-bit.
+    std::numeric_limits::max_digits10 <= 17 ? 1 : // for double 64-bit.
+    std::numeric_limits::max_digits10 <= 22 ? 2 : // for 80-bit double extended.
+    std::numeric_limits::max_digits10 <  37 ? 4  // for both 128-bit long double (3) and 128-bit quad suffix Q type (4).
+      :  5                                            // All Generic multiprecision types.
     > tag_type;
-  // std::cout << "tag type = " << tag_type << std::endl; // error C2275: 'tag_type': illegal use of this type as an expression
+  // std::cout << "\ntag type = " << tag_type << std::endl; // error C2275: 'tag_type': illegal use of this type as an expression.
   return lambert_w0_small_z(x, pol, tag_type());
 } // template  T lambert_w0_small_z(T x)
 
@@ -515,10 +517,11 @@ template 
 T lambert_w0_small_z(T z, const Policy&, boost::mpl::int_<0> const&)
 {
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-  std::cout << "float lambert_w0_small_z called with z = " << z << " using " << 9 << " terms of precision "
+  std::streamsize prec = std::cout.precision(std::numeric_limits::max_digits10); // Save.
+  std::cout << "\ntag_type 0 float lambert_w0_small_z called with z = " << z << " using " << 9 << " terms of precision "
     << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-  return
+  T result =
     z * (1 - // j1 z^1 term = 1
       z * (1 -  // j2 z^2 term = -1
         z * (static_cast(3uLL) / 2uLL - // 3/2 // j3 z^3 term = 1.5.
@@ -528,9 +531,16 @@ T lambert_w0_small_z(T z, const Policy&, boost::mpl::int_<0> const&)
                 z * (23.343055555555555556F - // j7
                   z * (52.012698412698412698F - // j8
                     z * 118.62522321428571429F)))))))); // j9
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::cout << "return w = " << result << std::endl;
+  std::cout.precision(prec); // Restore.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+
+  return result;
 } // template    T lambert_w0_small_z(T x, mpl::int_<0> const&)
 
-  //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
+  //! Specialization of double (64-bit double) series expansion used for small z (abs(z) < 0.05).
   // 17 Coefficients are computed to 21 decimal digits precision suitable for 64-bit double used by most platforms.
   // Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
   // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50], as proposed by Tosio Fukushima and implemented by Veberic.
@@ -539,10 +549,11 @@ template 
 T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<1> const&)
 {
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-  std::cout << "double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision, "
+  std::streamsize prec = std::cout.precision(std::numeric_limits::max_digits10); // Save.
+  std::cout << "\ntag_type 1 double lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision, "
     << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-  T  result =
+  T result =
     z * (1. - // j1 z^1
       z * (1. -  // j2 z^2
         z * (1.5 - // 3/2 // j3 z^3
@@ -560,60 +571,97 @@ T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<1> const&)
                                 z * (22324.308512706601434 - // j15
                                   z * (55103.621972903835338 - // j16
                                     z * 136808.86090394293563)))))))))))))))); // j17 z^17
-  return result;
-}  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
 
-   //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
-   // 21 Coefficients are computed to 21 decimal digits precision suitable for 80-bit long double used by some
-   // platforms including GCC and Clang when generating for Intel X86 floating-point processors with 80-bit operations enabled (the default).
-   // (This is NOT used by Microsoft Visual Studio where double and long always both use only 64-bit type.)
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::cout << "return w = " << result << std::endl;
+  std::cout.precision(prec); // Restore.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+
+  return result;
+} // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+
+  //! Specialization of long double (80-bit double extended) series expansion used for small z (abs(z) < 0.05).
+  // 21 Coefficients are computed to 21 decimal digits precision suitable for 80-bit long double used by some
+  // platforms including GCC and Clang when generating for Intel X86 floating-point processors with 80-bit operations enabled (the default).
+  // (This is NOT used by Microsoft Visual Studio where double and long always both use only 64-bit type.
+  // Nor used for 128-bit float128.)
 template 
 T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<2> const&)
 {
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-  std::cout << "long double (80-bit double extended) lambert_w0_small_z called with z = " << z << " using " << 21 << " terms of precision "
+  std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10); // Save.
+  std::cout << "\ntag_type 2 long double (80-bit double extended) lambert_w0_small_z called with z = " << z << " using " << 21 << " terms of precision, "
     << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-  T  result =
-    z * (1.L - // j1 z^1
-      z * (1.L -  // j2 z^2
-        z * (1.5L - // 3/2 // j3
-          z * (2.6666666666666666667L -  // 8/3 // j4
-            z * (5.2083333333333333333L - // -125/24 // j5
-              z * (10.800000000000000000L - // j6
-                z * (23.343055555555555556L - // j7
-                  z * (52.012698412698412698L - // j8
-                    z * (118.62522321428571429L - // j9
-                      z * (275.57319223985890653L - // j10
-                        z * (649.78717234347442681L - // j11
-                          z * (1551.1605194805194805L - // j12
-                            z * (3741.4497029592385495L - // j13
-                              z * (9104.5002411580189358L - // j14
-                                z * (22324.308512706601434L - // j15
-                                  z * (55103.621972903835338L - // j16
-                                    z * (136808.86090394293563L - // j17 z^17  last term used by Fukushima double.
-                                      z * (341422.050665838363317L - // z^18
-                                        z * (855992.9659966075514633L - // z^19
-                                          z * (2.154990206091088289321e6L - // z^20
-                                            z * 5.4455529223144624316423e6L   // z^21
-                                            ))))))))))))))))))));
+//  T  result =
+//    z * (1.L - // j1 z^1
+//      z * (1.L -  // j2 z^2
+//        z * (1.5L - // 3/2 // j3
+//          z * (2.6666666666666666667L -  // 8/3 // j4
+//            z * (5.2083333333333333333L - // -125/24 // j5
+//              z * (10.800000000000000000L - // j6
+//                z * (23.343055555555555556L - // j7
+//                  z * (52.012698412698412698L - // j8
+//                    z * (118.62522321428571429L - // j9
+//                      z * (275.57319223985890653L - // j10
+//                        z * (649.78717234347442681L - // j11
+//                          z * (1551.1605194805194805L - // j12
+//                            z * (3741.4497029592385495L - // j13
+//                              z * (9104.5002411580189358L - // j14
+//                                z * (22324.308512706601434L - // j15
+//                                  z * (55103.621972903835338L - // j16
+//                                    z * (136808.86090394293563L - // j17 z^17  last term used by Fukushima double.
+//                                      z * (341422.050665838363317L - // z^18
+//                                        z * (855992.9659966075514633L - // z^19
+//                                          z * (2.154990206091088289321e6L - // z^20
+//                                            z * 5.4455529223144624316423e6L   // z^21
+//                                              ))))))))))))))))))));
+//
 
+  T result =
+z * (1.L - // z j1
+z * (1.L - // z^2
+z * (1.500000000000000000000000000000000L - // z^3
+z * (2.666666666666666666666666666666666L - // z ^ 4
+z * (5.208333333333333333333333333333333L - // z ^ 5
+z * (10.80000000000000000000000000000000L - // z ^ 6
+z * (23.34305555555555555555555555555555L - //  z ^ 7
+z * (52.01269841269841269841269841269841L - // z ^ 8
+z * (118.6252232142857142857142857142857L - // z ^ 9
+z * (275.5731922398589065255731922398589L - // z ^ 10
+z * (649.7871723434744268077601410934744L - // z ^ 11
+z * (1551.160519480519480519480519480519L - // z ^ 12
+z * (3741.449702959238549516327294105071L - //z ^ 13
+z * (9104.500241158018935796713574491352L - //  z ^ 14
+z * (22324.308512706601434280005708577137L - //  z ^ 15
+z * (55103.621972903835337697771560205422L - //  z ^ 16
+z * (136808.86090394293563342215789305736L - // z ^ 17
+z * (341422.05066583836331735491399356945L - //  z^18
+z * (855992.9659966075514633630250633224L - // z^19
+z * (2.154990206091088289321708745358647e6L // z^20 distance -5 without term 20
+))))))))))))))))))));
+
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::cout << "return w = " << result << std::endl;
+  std::cout.precision(precision); // Restore.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
   return result;
-}  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+}  // long double lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
 
-   //! Specialization of long double (128-bit quad) series expansion used for small z (abs(z) < 0.05).
-   // 34 Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
-   // N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
-   // and are suffixed by L as they are assumed of type long double.
-   // (This is NOT used for 128-bit quad which required a suffix Q
-   // nor multiprecision type cpp_bin_float_quad that can only be initialised at full precision of the type
-   // using a decimal digit string like "2.6666666666666666666666666666666666666666666666667".)
+//! Specialization of 128-bit long double series expansion used for small z (abs(z) < 0.05).
+// 34 Taylor series coefficients used are computed by Wolfram to 50 decimal digits using instruction
+// N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
+// and are suffixed by L as they are assumed of type long double.
+// (This is NOT used for 128-bit quad boost::multiprecision::float128 type which required a suffix Q
+// nor multiprecision type cpp_bin_float_quad that can only be initialised at full precision of the type
+// constructed with a decimal digit string like "2.6666666666666666666666666666666666666666666666667".)
 
 template 
 T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&)
 {
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
-  std::cout << "long double (128-bit quad) lambert_w0_small_z called with z = " << z << " using " << 34 << " terms of precision "
+  std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10); // Save.
+  std::cout << "\ntag_type 3 long double (128-bit) lambert_w0_small_z called with z = " << z << " using " << 17 << " terms of precision,  "
     << std::numeric_limits::max_digits10 << " decimal digits. " << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
   T  result =
@@ -622,7 +670,7 @@ T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&)
         z * (1.5L - // 3/2 // j3
           z * (2.6666666666666666666666666666666666L -  // 8/3 // j4
             z * (5.2052083333333333333333333333333333L - // -125/24 // j5
-              z * (-10.800000000000000000000000000000000L - // j6
+              z * (10.800000000000000000000000000000000L - // j6
                 z * (23.343055555555555555555555555555555L - // j7
                   z * (52.0126984126984126984126984126984126L - // j8
                     z * (118.625223214285714285714285714285714L - // j9
@@ -633,12 +681,84 @@ T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&)
                               z * (9104.5002411580189357967135744913522691300469078247L - // j14
                                 z * (22324.308512706601434280005708577137148565719994291L - // j15
                                   z * (55103.621972903835337697771560205422639285073147507L - // j16
-                                    z * 136808.86090394293563342215789305736395683485630576L)))))))))))))))); // j17
-  return result;
-}  // T lambert_w0_small_z(const T z, boost::mpl::int_<1> const&)
+                                    z * 136808.86090394293563342215789305736395683485630576L    // j17
+                                      ))))))))))))))));
 
-   //! Series functor to compute series term using pow and factorial.
-   //! \details Functor is called after evaluating polynomial with the coefficients as rationals below.
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::cout << "return w = " << result << std::endl;
+  std::cout.precision(precision); // Restore.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  return result;
+}  // T lambert_w0_small_z(const T z, boost::mpl::int_<3> const&)
+
+//! Specialization of 128-bit quad series expansion used for small z (abs(z) < 0.05).
+// 34 Taylor series coefficients used were computed by Wolfram to 50 decimal digits using instruction
+//   N[InverseSeries[Series[z Exp[z],{z,0,34}]],50],
+// and are suffixed by Q as they are assumed of type quad.
+// This could be used for 128-bit quad (which requires a suffix Q for full precision).
+// But experiments with GCC 7.2.0 show that while this gives full 128-bit precision
+// when the -f-ext-numeric-literals option is in force and the libquadmath library available,
+// over the range -0.049 to +0.049, 
+// it is slightly slower than getting a double approximation followed by a single Halley step.
+
+#ifdef BOOST_HAS_FLOAT128
+template 
+T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<4> const&)
+{
+#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10); // Save.
+  std::cout << "\ntag_type 4 128-bit quad float128 lambert_w0_small_z called with z = " << z << " using " << 34 << " terms of precision, "
+    << std::numeric_limits::max_digits10 << " max decimal digits." << std::endl;
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  T  result =
+    z * (1.Q - // z j1
+      z * (1.Q - // z^2
+        z * (1.500000000000000000000000000000000Q - // z^3
+          z * (2.666666666666666666666666666666666Q - // z ^ 4
+            z * (5.208333333333333333333333333333333Q - // z ^ 5
+              z * (10.80000000000000000000000000000000Q - // z ^ 6
+                z * (23.34305555555555555555555555555555Q - //  z ^ 7
+                  z * (52.01269841269841269841269841269841Q - // z ^ 8
+                    z * (118.6252232142857142857142857142857Q - // z ^ 9
+                      z * (275.5731922398589065255731922398589Q - // z ^ 10
+                        z * (649.7871723434744268077601410934744Q - // z ^ 11
+                          z * (1551.160519480519480519480519480519Q - // z ^ 12
+                            z * (3741.449702959238549516327294105071Q - //z ^ 13
+                              z * (9104.500241158018935796713574491352Q - //  z ^ 14
+                                z * (22324.308512706601434280005708577137Q - //  z ^ 15
+                                  z * (55103.621972903835337697771560205422Q - //  z ^ 16
+                                    z * (136808.86090394293563342215789305736Q - // z ^ 17
+                                      z * (341422.05066583836331735491399356945Q - //  z^18
+                                        z * (855992.9659966075514633630250633224Q - // z^19
+                                          z * (2.154990206091088289321708745358647e6Q - //  20
+                                            z * (5.445552922314462431642316420035073e6Q - // 21
+                                              z * (1.380733000216662949061923813184508e7Q - // 22
+                                                z * (3.511704498513923292853869855945334e7Q - // 23
+                                                  z * (8.956800256102797693072819557780090e7Q - // 24
+                                                    z * (2.290416846187949813964782641734774e8Q - // 25
+                                                      z * (5.871035041171798492020292225245235e8Q - // 26
+                                                        z * (1.508256053857792919641317138812957e9Q - // 27
+                                                          z * (3.882630161293188940385873468413841e9Q - // 28
+                                                            z * (1.001394313665482968013913601565723e10Q - // 29
+                                                              z * (2.587356736265760638992878359024929e10Q - // 30
+                                                                z * (6.696209709358073856946120522333454e10Q - // 31
+                                                                  z * (1.735711659599198077777078238043644e11Q - // 32
+                                                                    z * (4.505680465642353886756098108484670e11Q - // 33
+                                                                      z * (1.171223178256487391904047636564823e12Q  //z^34
+                                                                        ))))))))))))))))))))))))))))))))));
+
+
+ #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::cout << "return w = " << result << std::endl;
+  std::cout.precision(precision); // Restore.
+#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+
+  return result;
+}  // T lambert_w0_small_z(const T z, boost::mpl::int_<4> const&) float128
+#endif // BOOST_HAS_FLOAT128
+
+//! Series functor to compute series term using pow and factorial.
+//! \details Functor is called after evaluating polynomial with the coefficients as rationals below.
 template 
 struct lambert_w0_small_z_series_term
 {
@@ -670,9 +790,10 @@ private:
 
    //! Generic variant for T a User-defined types like Boost.Multiprecision.
 template 
-inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&)
+inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<5> const&)
 {
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
+  std::streamsize precision = std::cout.precision(std::numeric_limits::max_digits10); // Save.
   std::cout << "Generic lambert_w0_small_z called with z = " << z << " using as many terms needed for precision." << std::endl;
   std::cout << "Argument z is of type " << typeid(T).name() << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES
@@ -740,9 +861,9 @@ inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&)
      #15 22324.308512706601434280005708577137322392070452582
      #16 -55103.621972903835337697771560205423203318720697224
      #17 136808.86090394293563342215789305735851647769682393
-     136808.86090394293563342215789305735851647769682393   == Exactly same as Wolfram computed value.
+         136808.86090394293563342215789305735851647769682393   == Exactly same as Wolfram computed value.
      #18 -341422.05066583836331735491399356947486381600607416
-     341422.05066583836331735491399356945575432970390954  z^19  Wolfram value differs at 36 decimal digit, as expected.
+          341422.05066583836331735491399356945575432970390954  z^19  Wolfram value differs at 36 decimal digit, as expected.
      */
 
   using boost::math::policies::get_epsilon; // for type T.
@@ -802,8 +923,8 @@ inline T lambert_w0_small_z(T z, const Policy& pol, boost::mpl::int_<4> const&)
   policies::check_series_iterations("boost::math::lambert_w0_small_z<%1%>(%1%)", max_iter, pol);
 #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS
   std::cout << "z = " << z << " needed  " << max_iter << " iterations." << std::endl;
+  std::cout.precision(prec); // Restore.
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS
-  //std::cout.precision(prec); // Restore.
   return result;
 } // template  inline T lambert_w0_small_z_series(T z, const Policy& pol)
 
@@ -839,30 +960,33 @@ T lambert_w0_approx(T z)
 //template  T lambert_w0_small_z(T z, const Policy& pol);
 //
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<0>&);
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<0>&); // 32 bit usually float
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<1>&);
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<1>&); //  64 bit usually double
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&);
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&); // 80-bit long double
+
+
 
 //! Lambert_w0 @b 'float' implementation, selected when T is 32-bit precision.
 template 
 inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
 {
-   static const char* function = "boost::math::lambert_w0<%1%>"; // For error messages.
-   BOOST_MATH_STD_USING // Aid ADL of std functions.
+  static const char* function = "boost::math::lambert_w0<%1%>"; // For error messages.
+  BOOST_MATH_STD_USING // Aid ADL of std functions.
 
-	 if ((boost::math::isnan)(z))
-	 {
-		 return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%.", z, pol);
-	 }
-   if ((boost::math::isinf)(z))
-   {
-     return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
-   }
+	if ((boost::math::isnan)(z))
+	{
+	  return boost::math::policies::raise_domain_error(function, "Expected a value > -e^-1 (-0.367879...) but got %1%.", z, pol);
+	}
+  if ((boost::math::isinf)(z))
+  {
+    return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
+  }
 
-   if (z >= 0.05)
-   { // Normal ranges using several rational polynomials.
+   //if (z >= 0.05)
+   if (z >= 0.045) // 34 terms makes 128-bit 'exact' below 0.045.
+    { // Normal ranges using several rational polynomials.
       if (z < 2)
       {
          if (z < 0.5)
@@ -1074,7 +1198,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
    static const char* function = "boost::math::lambert_w0<%1%>";
    BOOST_MATH_STD_USING // Aid ADL of std functions.
 
-   // Unusual case of 32-bit double with a wider/64-bit long double
+   // Detect unusual case of 32-bit double with a wider/64-bit long double
    BOOST_STATIC_ASSERT_MSG(std::numeric_limits::digits >= 53,
    "Our double precision coefficients will be truncated, "
 	 "please file a bug report with details of your platform's floating point types "
@@ -1354,7 +1478,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
          }
          else
          {
-            // Very small z:
+            // Very small z > 0.051:
             return lambert_w0_small_z(z, pol);
          }
       }
@@ -1461,7 +1585,8 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
 } // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
 
 //! lambert_W0 implementation for extended precision types including
-//! long double, Boost.Multiprecision types like cpp_bin_float_quad, cpp_bin_float_50...
+//! long double (80-bit and 128-bit), ???
+//! quad float128, Boost.Multiprecision types like cpp_bin_float_quad, cpp_bin_float_50...
 
 template 
 inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
@@ -1513,22 +1638,22 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
       return lambert_w_detail::lambert_w_singularity_series(p);
    }
 
-   // Phew!
-   // If we get here we are in the normal range of the function, so
-   // get a double precision approximation first, then iterate to full precision of T.
-   // We define a type that is:
+   // Phew!  If we get here we are in the normal range of the function,
+   // so get a double precision approximation first, then iterate to full precision of T.
+   // We define a tag_type that is:
    // mpl::true_  if there are so many digits precision wanted that iteration is necessary.
    // mpl::false_ if a single Halley step is sufficient.
-   // For speed, we also cast z to type double when that is possible
-   //   (boost::is_constructible() == true).
+
 
    typedef typename policies::precision::type precision_type;
    typedef mpl::bool_<
       (precision_type::value == 0) || (precision_type::value > 113) ?
-      true // Unknown at compile-time, variable/arbitrary, or more than quad 128-bit precision.
-      : false
+      true // Unknown at compile-time, variable/arbitrary, or more than float128 or cpp_bin_quad 128-bit precision.
+      : false // float, double, float128, cpp_bin_quad 128-bit, so single Halley step.
    > tag_type;
 
+   // For speed, we also cast z to type double when that is possible
+   //   if (boost::is_constructible() == true).
    T w = lambert_w0_imp(maybe_reduce_to_double(z, boost::is_constructible()), pol, mpl::int_<2>());
 
    return lambert_w_maybe_halley_iterate(w, z, tag_type());
@@ -1881,7 +2006,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
         return result; // Halley
       } // schroeder or Schroeder and Halley.
     } // more than 10 digits2
-  } 
+  }
 } // template T lambert_wm1_imp(const T z)
 } // namespace lambert_w_detail
 
@@ -1896,14 +2021,14 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
      // Promote integer or expression template arguments to double,
      // without doing any other internal promotion like float to double.
     typedef typename tools::promote_args::type result_type;
-    
-    // Work out what precision has been selected, 
+
+    // Work out what precision has been selected,
     // based on the Policy and the number type.
     typedef typename policies::precision::type precision_type;
-    // and then select the correct implementation based on that (not the type T):
+    // and then select the correct implementation based on that precision (not the type T):
     typedef mpl::int_<
       (precision_type::value == 0) || (precision_type::value > 53) ?
-      0  // either variable precision (0), or greater than 64-bit precision.
+        0  // either variable precision (0), or greater than 64-bit precision.
       : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
       : 2  // 64-bit (probably double) precision.
       > tag_type;
@@ -1938,10 +2063,10 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     typedef typename tools::promote_args::type result_type;
 
     // Perhaps Deal with other special cases here??????????????
-    // (TODO NaN, zero? 
+    // (TODO NaN, zero?
     //if ((boost::math::isinf)(z))
     //{
-    // // return std::numeric_limits::infinity();  
+    // // return std::numeric_limits::infinity();
     //  static const char* function = "boost::math::lambert_w0<%1%>";
     //  return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, policies::policy<>());
     //  // for double max possible is 703.227... so this would return this value.
@@ -1959,7 +2084,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
       : 2  // 64-bit (probably double) precision.
     > tag_type;
     T result = lambert_w_detail::lambert_w0_imp(result_type(z),  policies::policy<>(), tag_type()); // Pre-Halley.
-    // Always add Halley step for default policy, 
+    // Always add Halley step for default policy,
     // unless these special cases where unlikely to improve.
     if ((z < -0.3578) // Using singularity series.
       || (!boost::math::isnormal(result))  // NaN, infinity or denormal.
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index fded1fd04..709274e71 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -53,6 +53,7 @@ project
       msvc:/wd4189 # local variable is initialized but not referenced
       msvc-7.1:../vc71_fix//vc_fix
       msvc-7.1:off
+      clang-6.0.0:off  # added to see effect.
       gcc,windows:off
       borland:static
       # msvc:/wd4506 has no effect?
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index 60257f489..b122bb613 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -10,9 +10,13 @@
 //! \brief Basic sanity tests for Lambert W function plog productlog
 //! or lambert_w using algorithm informed by Thomas Luu, Veberic and Tosio Fukushima.
 
+// #define BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES // Diagnostics for z near zero.
+// #define BOOST_MATH_TEST_MULTIPRECISION  // Add tests for several multiprecision types (not just built-in).
+// #defin BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17  and quadmath library).
 
-
+#ifdef BOOST_MATH_TEST_FLOAT128
 #include  // For float_64_t, float128_t. Must be first include!
+#endif // #ifdef #ifdef BOOST_MATH_TEST_FLOAT128
 // Needs gnu++17 for BOOST_HAS_FLOAT128
 #include    // for BOOST_MSVC definition etc.
 #include    // for BOOST_MSVC versions.
@@ -20,27 +24,32 @@
 // Boost macros
 #define BOOST_TEST_MAIN
 #define BOOST_LIB_DIAGNOSTIC "on" // Report library file details.
-#include  // Boost.Test
+#include  // Boost.Test
+// #include  // Boost.Test
 #include 
 
 #include 
 #include 
 #include 
 
+#ifdef BOOST_MATH_TEST_MULTIPRECISION
 #include  // boost::multiprecision::cpp_dec_float_50
 using boost::multiprecision::cpp_dec_float_50;
 
 #include 
 using boost::multiprecision::cpp_bin_float_quad;
 
-#include 
+#ifdef BOOST_MATH_TEST_FLOAT128
 
 #ifdef BOOST_HAS_FLOAT128
-// Including this header without float128 triggers:
+// Including this header below without float128 triggers:
 // fatal error C1189: #error:  "Sorry compiler is neither GCC, not Intel, don't know how to configure this header."
 #include 
 using boost::multiprecision::float128;
-#endif
+#endif // ifdef BOOST_HAS_FLOAT128
+#endif // #ifdef #ifdef BOOST_MATH_TEST_FLOAT128
+
+#endif //   #ifdef BOOST_MATH_TEST_MULTIPRECISION
 
 //#include  // If available.
 
@@ -49,10 +58,12 @@ using boost::multiprecision::float128;
 #include  // float_next, float_prior
 using boost::math::float_next;
 using boost::math::float_prior;
+#include   // ulp
 
 #include   // for create_test_value and macro BOOST_MATH_TEST_VALUE.
 #include 
 using boost::math::policies::digits2;
+using boost::math::policies::digits10;
 #include  // For Lambert W lambert_w function.
 using boost::math::lambert_wm1;
 using boost::math::lambert_w0;
@@ -64,7 +75,9 @@ using boost::math::lambert_w0;
 #include 
 #include 
 
-#define BOOST_MATH_LAMBERT_W_INTEGRALS
+std::string show_versions(void);
+
+//#define BOOST_MATH_LAMBERT_W_INTEGRALS
 
 #ifdef BOOST_MATH_LAMBERT_W_INTEGRALS
 
@@ -176,7 +189,7 @@ void test_integrals()
 #endif // BOOST_MATH_LAMBERT_W_INTEGRALS
 
 //! Build a message of information about build, architecture, address model, platform, ...
-std::string show_versions()
+std::string show_versions(void)
 {
   // Some of this information can also be obtained from running with a Custom Post-build step
   // adding the option --build_info=yes
@@ -191,10 +204,8 @@ std::string show_versions()
   message << "\nBuildInfo:\n" "  Platform " << BOOST_PLATFORM;
   // http://stackoverflow.com/questions/1505582/determining-32-vs-64-bit-in-c
 #if defined(__LP64__) || defined(_WIN64) || (defined(__x86_64__) && !defined(__ILP32__) ) || defined(_M_X64) || defined(__ia64) || defined (_M_IA64) || defined(__aarch64__) || defined(__powerpc64__)
-#define IS64BIT 1
   message << ", 64-bit.";
 #else
-#define IS32BIT 1
   message << ", 32-bit.";
 #endif
 
@@ -231,12 +242,19 @@ std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION <<
   message << "\n  STL " << BOOST_STDLIB;
   message << "\n  Boost version " << BOOST_VERSION / 100000 << "." << BOOST_VERSION / 100 % 1000 << "." << BOOST_VERSION % 100;
 
+#ifdef BOOST_MATH_TEST_MULTIPRECISION
+  message << "\nBOOST_MATH_TEST_MULTIPRECISION defined for multiprecision tests. " << std::endl;
+#else
+ message << "\nBOOST_MATH_TEST_MULTIPRECISION not defined so NO multiprecision tests. " << std::endl;
+#endif // BOOST_MATH_TEST_MULTIPRECISION
+
 #ifdef BOOST_HAS_FLOAT128
-  message << ",  BOOST_HAS_FLOAT128." << std::endl;
-#endif
+  message << "BOOST_HAS_FLOAT128 is defined." << std::endl;
+#endif // ifdef BOOST_HAS_FLOAT128
+
   message << std::endl;
   return message.str();
-} // std::string versions()
+} // std::string show_versions()
 
 template 
 void test_spots(RealType)
@@ -288,14 +306,14 @@ void test_spots(RealType)
   }
   RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction.
   std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl;
-  std::cout << "Precision " << std::numeric_limits::digits10 << " decimal digits." << std::endl;
+  std::cout << "Precision " << std::numeric_limits::digits10 << " decimal digits, max_digits10 = " << std::numeric_limits ::max_digits10<< std::endl;
   // std::cout.precision(std::numeric_limits::digits10);
   std::cout.precision(std::numeric_limits ::max_digits10);
   std::cout.setf(std::ios_base::showpoint);  // show trailing significant zeros.
   std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl;
 
   // Test at singularity.
-  //RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527);
+  // RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527);
   RealType singular_value = -exp_minus_one();
   // -exp(-1) = -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527
   // lambert_w0[-0.367879441171442321595523770161460867445811131031767834] == -1
@@ -592,21 +610,40 @@ void test_spots(RealType)
     BOOST_MATH_TEST_VALUE(RealType, 83.07844821316409592720410446942538465411465113447713574),
     tolerance);
 
-  // Small z < 0.05  if (z < -0.051)  -0.27 < z < -0.051
+  // Using z small series function if z < 0.05  if (z < -0.051)  -0.27 < z < -0.051
 
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.28)),
     BOOST_MATH_TEST_VALUE(RealType, -0.4307588745271127579165306568413721388196459822705155385),
     tolerance);
 
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.25)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.3574029561813889030688111040559047533165905550760120436),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, +0.25)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.2038883547022401644431818313271398701493524772101596350),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.051)), // just above 0.05 cutoff
+    BOOST_MATH_TEST_VALUE(RealType, -0.05382002772543396036830469500362485089791914689728115249),
+    tolerance);
+
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.05)),
     BOOST_MATH_TEST_VALUE(RealType, -0.05270598355154634795995650617915721289427674396592395160),
     tolerance);
 
-  // Using z small series function < 0.05
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.049)),
     BOOST_MATH_TEST_VALUE(RealType, 0.04676143671340832342497289393737051868103596756298863555),
     tolerance);
 
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.01)),
+    BOOST_MATH_TEST_VALUE(RealType, 0.009901473843595011885336326816570107953627746494917415483),
+    tolerance);
+
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.01)),
+    BOOST_MATH_TEST_VALUE(RealType, -0.01010152719853875327292018767138623973670903993475235877),
+    tolerance);
+
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.049)),
     BOOST_MATH_TEST_VALUE(RealType, -0.05159448479219405354564920228913331280713177046648170658),
     tolerance);
@@ -691,7 +728,7 @@ void test_spots(RealType)
   // : no appropriate default constructor available
   // TODO ???????????
 
- } //template void test_spots(RealType)
+ } // template void test_spots(RealType)
 
 BOOST_AUTO_TEST_CASE( test_types )
 {
@@ -710,15 +747,21 @@ BOOST_AUTO_TEST_CASE( test_types )
     test_spots(0.0L); // long double
   }
 
+  #ifdef BOOST_MATH_TEST_MULTIPRECISION
   // Multiprecision types:
   test_spots(static_cast(0));
   test_spots(static_cast(0));
   test_spots(static_cast(0));
+  #endif // ifdef BOOST_MATH_TEST_MULTIPRECISION
+
+  #ifdef BOOST_MATH_TEST_FLOAT128
+   std::cout << "\nBOOST_MATH_TEST_FLOAT128 defined for float128 tests." << std::endl;
 
 #ifdef BOOST_HAS_FLOAT128
-  // Requires link to libquadmath library,
+  //  GCC and Intel only.
+  // Requires link to libquadmath library, see
   // http://www.boost.org/doc/libs/release/libs/multiprecision/doc/html/boost_multiprecision/tut/floats/float128.html
-  //  for example:
+  // for example:
   // C:\Program Files\mingw-w64\x86_64-7.2.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\7.2.0\libquadmath.a
 
   using boost::multiprecision::float128;
@@ -728,6 +771,9 @@ BOOST_AUTO_TEST_CASE( test_types )
 
   test_spots(static_cast(0));
 #endif // BOOST_HAS_FLOAT128
+#else
+  std::cout << "\nBOOST_MATH_TEST_FLOAT128 NOT defined so NO float128 tests." << std::endl;
+#endif // #ifdef BOOST_MATH_TEST_FLOAT128
 
   // Fixed-point types:
   // Some fail 0.1 to 1.0 ???
@@ -738,6 +784,7 @@ BOOST_AUTO_TEST_CASE( test_types )
 
 } // BOOST_AUTO_TEST_CASE( test_types )
 
+/*
 BOOST_AUTO_TEST_CASE( test_range_of_double_values )
 {
   using boost::math::constants::exp_minus_one;
@@ -1064,7 +1111,7 @@ BOOST_AUTO_TEST_CASE( derivatives_of_lambert_w )
 
 
 }; // BOOST_AUTO_TEST_CASE("derivatives of lambert_w")
-
+*/
 
 #ifdef BOOST_MATH_LAMBERT_W_INTEGRALS
 
@@ -1114,7 +1161,10 @@ BOOST_AUTO_TEST_CASE( integrals )
 
   std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; //
   std::cout << "test integral 1/z^2" << std::endl;
-
+  std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16
+  std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16
+  std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16
+  std::cout << "epsilon =  " << std::numeric_limits::epsilon() << std::endl; //
 
   // Experiment with better diagnostics.
 typedef double Real;

From 6ef20016818fd612d805aa0d6fc5ea9be1afea69 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Tue, 29 May 2018 17:51:30 +0100
Subject: [PATCH 46/71] 1st try at MP maybe_halley in float only

---
 .../math/special_functions/lambert_w.hpp      | 129 +++++++++++++-----
 test/test_lambert_w.cpp                       |  11 +-
 2 files changed, 97 insertions(+), 43 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 1a1736d28..2b411d3f9 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -130,6 +130,25 @@ inline
   return w_new;
 } // template  lambert_w_halley_iterate(T w_est, T z)
 
+  // Two function versions that either
+  // return w estimate unchanged, (if mpl::false_ using precision digits2)
+  // or improve by iteration (if mpl::true_).
+  // Selected at compile-time using parameter 3.
+
+// TODO might also decide if more than one step is needed?
+template 
+inline
+T lambert_w_maybe_improve(T w, T z, mpl::false_ const&)
+{
+  return w; // No refinement - just return current estimate of w; 
+}
+
+template 
+inline
+T lambert_w_maybe_improve(T w, T z, mpl::true_ const&)
+{
+  return lambert_w_halley_step(w, z); // Improve with a single Halley step.
+}
 
 // Two Halley function versions that either
 // single step (if mpl::false_) or iterate (if mpl::true_).
@@ -155,14 +174,14 @@ T lambert_w_maybe_halley_iterate(T z, T w, mpl::true_ const&)
 
 template 
 inline
-double maybe_reduce_to_double(const T& z, const mpl::true_&)
+double maybe_reduce_to_double(const T& z, mpl::true_ const&)
 {
   return static_cast(z); // Reduce to double precision.
 }
 
 template 
 inline
-T maybe_reduce_to_double(const T& z, const mpl::false_&)
+T maybe_reduce_to_double(const T& z, mpl::false_ const&)
 { // Don't reduce to double.
   return z;
 }
@@ -475,13 +494,13 @@ T lambert_w_singularity_series(const T p)
 
   // Forward declaration of variants of lambert_w0_small_z.
 template 
-T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<0> const&);   //  for float (32-bit) type.
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<0> const&);   //  for (32-bit) type, usually float.
 
 template 
-T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<1> const&);   //  for double (64-bit) type.
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<1> const&);   //  for (64-bit) type, usually double.
 
 template 
-T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<2> const&);   //  for long double (double extended 80-bit) type.
+T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<2> const&);   //  for  (double extended 80-bit) long double type.
 
 template 
 T lambert_w0_small_z(T x, const Policy&, boost::mpl::int_<3> const&);   //  for long double (128-bit) type.
@@ -700,6 +719,7 @@ T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<3> const&)
 // when the -f-ext-numeric-literals option is in force and the libquadmath library available,
 // over the range -0.049 to +0.049, 
 // it is slightly slower than getting a double approximation followed by a single Halley step.
+// So this version is not used for small_z.
 
 #ifdef BOOST_HAS_FLOAT128
 template 
@@ -944,7 +964,7 @@ T lambert_w0_approx(T z)
   //////////////////////////////////////////////////////////////////////////////////////////
 
 //! \brief Lambert_w0 implementations for float, double and higher precisions.
-//! 3rd parameter used to select which version is used.
+//! 3rd parameter used to select which variant is used.
 
 //! /details Rational polynomials are provided for several range of argument z.
 //! For very small values of z, and for z very near the branch singularity at -e^-1 (~= -0.367879),
@@ -952,7 +972,7 @@ T lambert_w0_approx(T z)
 
 //! float precision polynomials are used for 32-bit (usually float) precision (for speed)
 //! double precision polynomials are used for 64-bit (usually double) precision.
-//! For higher precisions, a 64-bit double approximation is computed first,
+//! For all higher precisions, a 64-bit double approximation is computed first,
 //! and then refined using Halley interations.
 
 // Forward declarations:
@@ -960,13 +980,13 @@ T lambert_w0_approx(T z)
 //template  T lambert_w0_small_z(T z, const Policy& pol);
 //
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<0>&); // 32 bit usually float
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<1>&); // 32 bit usually float.
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<1>&); //  64 bit usually double
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&); // 64 bit usually double.
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&); // 80-bit long double
-
-
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<3>&); // 80-bit always long double.
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<3>&); // for float128 quadmath Q type.
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<3>&); // Generic multiprecision types.
 
 //! Lambert_w0 @b 'float' implementation, selected when T is 32-bit precision.
 template 
@@ -983,6 +1003,16 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
   {
     return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
   }
+  // Improve estimate with a single Halley step if high precision Policy template value.
+  typedef mpl::bool_
+    <
+     (policies::digits() > 12) ?
+       true  // full float precision wanted so improve with iteration.
+     :
+       false  // No improvement wanted.
+    > digits_tag_type;
+
+  T result;
 
    //if (z >= 0.05)
    if (z >= 0.045) // 34 terms makes 128-bit 'exact' below 0.045.
@@ -1006,7 +1036,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
                2.871703469e+00f,
                1.690949264e+00f,
             };
-            return z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z));
+            //return z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z));
+            result = z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z));
+            // return result; // No Halley step.
+            return lambert_w_maybe_improve(result, z, digits_tag_type() );
          }
          else
          { // 0.5 < z < 2
@@ -1024,7 +1057,9 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
                1.830840318e+00f,
                2.407221031e-01f,
             };
-            return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+            //return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+            result = z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+            return lambert_w_maybe_improve(result, z, digits_tag_type() );
          }
       }
       else if (z < 6)
@@ -1044,7 +1079,9 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             2.295580708e-01f,
             5.477869455e-03f,
          };
-         return Y + boost::math::tools::evaluate_rational(P, Q, z);
+        // return Y + boost::math::tools::evaluate_rational(P, Q, z);
+         result =  Y + boost::math::tools::evaluate_rational(P, Q, z);
+         return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
       else if (z < 18)
       {
@@ -1063,7 +1100,9 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             4.489521292e-02f,
             4.076716763e-04f,
          };
-         return Y + boost::math::tools::evaluate_rational(P, Q, z);
+       //  return Y + boost::math::tools::evaluate_rational(P, Q, z);
+         result = Y + boost::math::tools::evaluate_rational(P, Q, z);
+         return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
       else if (z < 9897.12905874)  // 2.8 < log(z) < 9.2
       {
@@ -1083,7 +1122,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             -1.321489743e-05f,
          };
          T log_w = log(z);
-         return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+       //  return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+         result = log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+         return lambert_w_maybe_improve(result, z, digits_tag_type() );
+
       }
       else if (z < 7.896296e+13)  // 9.2 < log(z) <= 32
       {
@@ -1103,7 +1145,9 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             7.312865624e-08f,
          };
          T log_w = log(z);
-         return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+   //      return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+         result = log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+         return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
       else // 32 < log(z) < 100
       {
@@ -1123,7 +1167,9 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             -5.111523436e-09f,
          };
          T log_w = log(z);
-         return log_w+ Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+         //return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+         result =  log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
+         return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
    }
    else // z < 0.05
@@ -1147,12 +1193,16 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
                7.914062868e+00f,
                3.501498501e+00f,
             };
-            return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+         //   return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+            result = z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
+            return lambert_w_maybe_improve(result, z, digits_tag_type() );
          }
          else
          {
             // Very small z so use a series function.
-            return lambert_w0_small_z(z, pol);
+            //return lambert_w0_small_z(z, pol);
+            result = lambert_w0_small_z(z, pol);
+            return lambert_w_maybe_improve(result, z, digits_tag_type() );
          }
       }
       else if (z > -0.3578794411714423215955237701)
@@ -1173,7 +1223,9 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             1.117826726e+03f,
          };
          T d = z + 0.367879441171442321595523770161460867445811f;
-         return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d));
+        // return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d));
+         result = -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d));
+         return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
       else if (z <= -0.3678794411714423215955237701614608674458111310f)
       {
@@ -1187,9 +1239,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
          const T p2 = 2 * (boost::math::constants::e() * z + 1);
          const T p = sqrt(p2);
          return lambert_w_singularity_series(p);
+         // TODO do not use a Halley step here?
       }
    }
-} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit float.
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit (usually float).
 
 //! Lambert_w0 @b double implementation, selected when T is 64-bit precision.
 template 
@@ -1589,7 +1642,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
 //! quad float128, Boost.Multiprecision types like cpp_bin_float_quad, cpp_bin_float_50...
 
 template 
-inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
+inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<3>&)
 {
    static const char* function = "boost::math::lambert_w0<%1%>";
    BOOST_MATH_STD_USING // Aid ADL of std functions.
@@ -1641,18 +1694,20 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
    // Phew!  If we get here we are in the normal range of the function,
    // so get a double precision approximation first, then iterate to full precision of T.
    // We define a tag_type that is:
-   // mpl::true_  if there are so many digits precision wanted that iteration is necessary.
+   // mpl::true_  if there are so many digits precision wanted that Halley iteration is necessary.
    // mpl::false_ if a single Halley step is sufficient.
 
-
    typedef typename policies::precision::type precision_type;
-   typedef mpl::bool_<
-      (precision_type::value == 0) || (precision_type::value > 113) ?
-      true // Unknown at compile-time, variable/arbitrary, or more than float128 or cpp_bin_quad 128-bit precision.
-      : false // float, double, float128, cpp_bin_quad 128-bit, so single Halley step.
+   typedef mpl::bool_
+   <
+    (precision_type::value == 0) || (precision_type::value > 113) ?
+      true // Unknown at compile-time, variable/arbitrary,
+           // or more than float128 or cpp_bin_quad 128-bit precision, so Halley iterate.
+    :
+      false // float, double, float128, cpp_bin_quad 128-bit, so single Halley step.
    > tag_type;
 
-   // For speed, we also cast z to type double when that is possible
+   // For speed, we also cast z to type double when that is possible, that is
    //   if (boost::is_constructible() == true).
    T w = lambert_w0_imp(maybe_reduce_to_double(z, boost::is_constructible()), pol, mpl::int_<2>());
 
@@ -1660,7 +1715,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
 
  //  result = lambert_w_halley_iterate(result, z);
 
-} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)  extended precision.
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)  extended precision types.
 
   // Lambert w-1 implementation
 
@@ -1811,7 +1866,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // z = -9.9999999999999999e-91, guess = -212.56650048504233, ln(-z) = -207.23265836946410, ln(-ln(-z) = 5.3338421155782205, llz/lz = -0.025738424423764311
     // >z = -2.2250738585072014e-308, guess = -714.95942238244606, ln(-z) = -708.39641853226408, ln(-ln(-z) = 6.5630038501819854, llz/lz = -0.0092645920821846622
     int d10 = policies::digits_base10(); // policy template parameter digits10
-    int d2 = policies::digits(); // digits base 2 from policy.
+    int d2 = policies::digits(); // bits = digits base 2 from policy.
     std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5
       << std::endl;
 #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY
@@ -2028,7 +2083,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // and then select the correct implementation based on that precision (not the type T):
     typedef mpl::int_<
       (precision_type::value == 0) || (precision_type::value > 53) ?
-        0  // either variable precision (0), or greater than 64-bit precision.
+        3  // either variable precision (0), or greater than 64-bit precision.
       : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
       : 2  // 64-bit (probably double) precision.
       > tag_type;
@@ -2055,8 +2110,8 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
   //! Lambert W0 using default policy.
   template  >
   inline
-    typename tools::promote_args::type
-    lambert_w0(T z)
+  typename tools::promote_args::type
+  lambert_w0(T z)
   {
     // Promote integer or expression template arguments to double,
     // without doing any other internal promotion like float to double.
@@ -2079,7 +2134,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // and then select the correct implementation based on that (not the type T):
     typedef mpl::int_<
       (precision_type::value == 0) || (precision_type::value > 53) ?
-      0  // either variable precision (0), or greater than 64-bit precision.
+        3  // either variable precision (0), or all types greater than 64-bit precision.
       : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
       : 2  // 64-bit (probably double) precision.
     > tag_type;
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index b122bb613..0502b77c2 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -12,7 +12,8 @@
 
 // #define BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES // Diagnostics for z near zero.
 // #define BOOST_MATH_TEST_MULTIPRECISION  // Add tests for several multiprecision types (not just built-in).
-// #defin BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17  and quadmath library).
+// #define BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17  and quadmath library).
+// #define BOOST_MATH_LAMBERT_W_INTEGRALS // Add test using quadrature.
 
 #ifdef BOOST_MATH_TEST_FLOAT128
 #include  // For float_64_t, float128_t. Must be first include!
@@ -25,7 +26,7 @@
 #define BOOST_TEST_MAIN
 #define BOOST_LIB_DIAGNOSTIC "on" // Report library file details.
 #include  // Boost.Test
-// #include  // Boost.Test
+ //#include  // Boost.Test
 #include 
 
 #include 
@@ -40,14 +41,13 @@ using boost::multiprecision::cpp_dec_float_50;
 using boost::multiprecision::cpp_bin_float_quad;
 
 #ifdef BOOST_MATH_TEST_FLOAT128
-
 #ifdef BOOST_HAS_FLOAT128
 // Including this header below without float128 triggers:
 // fatal error C1189: #error:  "Sorry compiler is neither GCC, not Intel, don't know how to configure this header."
 #include 
 using boost::multiprecision::float128;
 #endif // ifdef BOOST_HAS_FLOAT128
-#endif // #ifdef #ifdef BOOST_MATH_TEST_FLOAT128
+#endif // #ifdef BOOST_MATH_TEST_FLOAT128
 
 #endif //   #ifdef BOOST_MATH_TEST_MULTIPRECISION
 
@@ -349,7 +349,7 @@ void test_spots(RealType)
 
     BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.1)),
     BOOST_MATH_TEST_VALUE(RealType, 0.091276527160862264299895721423179568653119224051472),
-    // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.2)
+    // Output from https://www.wolframalpha.com/input/?i=lambert_w0(0.1)
     tolerance);
 
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.2)),
@@ -729,7 +729,6 @@ void test_spots(RealType)
   // TODO ???????????
 
  } // template void test_spots(RealType)
-
 BOOST_AUTO_TEST_CASE( test_types )
 {
   BOOST_MATH_CONTROL_FP;

From d803b8e0b74ab66d887311cc9206051af2d68740 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Thu, 31 May 2018 16:25:43 +0100
Subject: [PATCH 47/71] Added diagnostics that must be removed.

---
 .../math/special_functions/lambert_w.hpp      | 25 ++++++++++++++++---
 1 file changed, 21 insertions(+), 4 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 2b411d3f9..8d217116a 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -95,7 +95,11 @@ namespace lambert_w_detail {
 //! \tparam T floating-point (or fixed-point) type.
 //! \param w_est Lambert W estimate.
 //! \param z Argument z for Lambert_w function.
-//! \returns New estimate of Lambert W, hopefully improved.
+//! \returns New estimate of Lambert W, hopefully improved, but
+  //! \note A Halley step may make less accurate by one bit from float_distance from
+  //! closest representation from a higher precision typestatic_casted to a lower precision type,
+  //! say double wd = static_cast(lambert_w0(z));
+  //! 
 //!
 template 
 inline T lambert_w_halley_step(T w_est, const T z)
@@ -140,6 +144,7 @@ template 
 inline
 T lambert_w_maybe_improve(T w, T z, mpl::false_ const&)
 {
+  std::cout << "No Halley step result " << w << std::endl;
   return w; // No refinement - just return current estimate of w; 
 }
 
@@ -147,7 +152,12 @@ template 
 inline
 T lambert_w_maybe_improve(T w, T z, mpl::true_ const&)
 {
-  return lambert_w_halley_step(w, z); // Improve with a single Halley step.
+  T result;
+  std::cout << "Halley step from " << w << std::endl;
+  result = lambert_w_halley_step(w, z); // Try to improve with a single Halley step.
+  // This may make less accurate by one bit.
+  std::cout << "Halley step result " << result << std::endl;
+  return result;
 }
 
 // Two Halley function versions that either
@@ -1059,8 +1069,15 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             };
             //return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
             result = z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
-            return lambert_w_maybe_improve(result, z, digits_tag_type() );
-         }
+            std::cout << "Pre-Halley Rational Polynomial = "  << result << std::endl;
+
+ //           return lambert_w_maybe_improve(result, z, digits_tag_type() );
+            result = lambert_w_maybe_improve(result, z, digits_tag_type() );
+            std::cout << "Post may step = " << result << std::endl;
+
+
+             return result;
+        }
       }
       else if (z < 6)
       {

From ce5bd9f3b392c70e3248984080a6015337033f74 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Wed, 11 Jul 2018 09:39:22 +0100
Subject: [PATCH 48/71] Last before radical simplication (restored version
 15May2018).

---
 .../math/special_functions/lambert_w.hpp      | 37 +++++++++----------
 test/test_lambert_w.cpp                       | 17 ++++++---
 2 files changed, 30 insertions(+), 24 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 8d217116a..b60aef7b9 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -142,9 +142,9 @@ inline
 // TODO might also decide if more than one step is needed?
 template 
 inline
-T lambert_w_maybe_improve(T w, T z, mpl::false_ const&)
+T lambert_w_maybe_improve(T w, T /* z */, mpl::false_ const&)
 {
-  std::cout << "No Halley step result " << w << std::endl;
+ // std::cout << "No Halley step result " << w << std::endl;
   return w; // No refinement - just return current estimate of w; 
 }
 
@@ -153,10 +153,10 @@ inline
 T lambert_w_maybe_improve(T w, T z, mpl::true_ const&)
 {
   T result;
-  std::cout << "Halley step from " << w << std::endl;
+ // std::cout << "Halley step from " << w << std::endl;
   result = lambert_w_halley_step(w, z); // Try to improve with a single Halley step.
   // This may make less accurate by one bit.
-  std::cout << "Halley step result " << result << std::endl;
+//  std::cout << "Halley step result " << result << std::endl;
   return result;
 }
 
@@ -1026,7 +1026,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
 
    //if (z >= 0.05)
    if (z >= 0.045) // 34 terms makes 128-bit 'exact' below 0.045.
-    { // Normal ranges using several rational polynomials.
+   { // Normal ranges using several rational polynomials.
       if (z < 2)
       {
          if (z < 0.5)
@@ -1049,7 +1049,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             //return z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z));
             result = z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z));
             // return result; // No Halley step.
-            return lambert_w_maybe_improve(result, z, digits_tag_type() );
+           // return lambert_w_maybe_improve(result, z, digits_tag_type() );
          }
          else
          { // 0.5 < z < 2
@@ -1069,11 +1069,11 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
             };
             //return z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
             result = z * (Y + boost::math::tools::evaluate_rational(P, Q, z));
-            std::cout << "Pre-Halley Rational Polynomial = "  << result << std::endl;
+            //std::cout << "Pre-Halley Rational Polynomial = "  << result << std::endl;
 
  //           return lambert_w_maybe_improve(result, z, digits_tag_type() );
-            result = lambert_w_maybe_improve(result, z, digits_tag_type() );
-            std::cout << "Post may step = " << result << std::endl;
+           // result = lambert_w_maybe_improve(result, z, digits_tag_type() );
+            // std::cout << "Post may step = " << result << std::endl;
 
 
              return result;
@@ -1098,7 +1098,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
          };
         // return Y + boost::math::tools::evaluate_rational(P, Q, z);
          result =  Y + boost::math::tools::evaluate_rational(P, Q, z);
-         return lambert_w_maybe_improve(result, z, digits_tag_type() );
+       //  return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
       else if (z < 18)
       {
@@ -1119,7 +1119,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
          };
        //  return Y + boost::math::tools::evaluate_rational(P, Q, z);
          result = Y + boost::math::tools::evaluate_rational(P, Q, z);
-         return lambert_w_maybe_improve(result, z, digits_tag_type() );
+       //  return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
       else if (z < 9897.12905874)  // 2.8 < log(z) < 9.2
       {
@@ -1141,7 +1141,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
          T log_w = log(z);
        //  return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
          result = log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
-         return lambert_w_maybe_improve(result, z, digits_tag_type() );
+       //  return lambert_w_maybe_improve(result, z, digits_tag_type() );
 
       }
       else if (z < 7.896296e+13)  // 9.2 < log(z) <= 32
@@ -1164,7 +1164,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
          T log_w = log(z);
    //      return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
          result = log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
-         return lambert_w_maybe_improve(result, z, digits_tag_type() );
+        // return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
       else // 32 < log(z) < 100
       {
@@ -1186,8 +1186,8 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
          T log_w = log(z);
          //return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
          result =  log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w);
-         return lambert_w_maybe_improve(result, z, digits_tag_type() );
       }
+      return lambert_w_maybe_improve(result, z, digits_tag_type() );
    }
    else // z < 0.05
    {
@@ -1711,7 +1711,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<3>&)
    // Phew!  If we get here we are in the normal range of the function,
    // so get a double precision approximation first, then iterate to full precision of T.
    // We define a tag_type that is:
-   // mpl::true_  if there are so many digits precision wanted that Halley iteration is necessary.
+   // mpl::true_ if there are so many digits precision wanted that Halley iteration is necessary.
    // mpl::false_ if a single Halley step is sufficient.
 
    typedef typename policies::precision::type precision_type;
@@ -1745,8 +1745,8 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
   // Need to ensure it is a floating-point type (of the desired type, float 1.F, double 1., or long double 1.L),
   // or static_casted integer, for example:  static_cast(1) or static_cast(1).
   // Want to allow fixed_point types too, so do not just test for floating-point.
-  // Integral types should be promoted to double by user Lambert w functions.
-  // If integral type provided to user function lambert_w0 or lambert_wm1,
+  // Integral types should be promoted to double by user Lambert  functions.
+  // If an integral type provided to user function lambert_w0 or lambert_wm1,
   // then should already have been promoted to double.
   BOOST_STATIC_ASSERT_MSG(!std::is_integral::value,
     "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!");
@@ -2110,8 +2110,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
 
     T result = lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type()); // Pre-Halley.
 
-    bool quick = (precision_type::value < std::numeric_limits::digits);
-
+    const bool quick = (precision_type::value < std::numeric_limits::digits);
     if (quick || (result == -1) || (result == 0) || (!boost::math::isnormal(result)) || (z < -0.3578))
     { // Don't try to refine using a Halley step.
       return result;
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index 0502b77c2..1c3cb8cd0 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -15,6 +15,8 @@
 // #define BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17  and quadmath library).
 // #define BOOST_MATH_LAMBERT_W_INTEGRALS // Add test using quadrature.
 
+//#define BOOST_MATH_LAMBERT_W_INTEGRALS
+
 #ifdef BOOST_MATH_TEST_FLOAT128
 #include  // For float_64_t, float128_t. Must be first include!
 #endif // #ifdef #ifdef BOOST_MATH_TEST_FLOAT128
@@ -84,10 +86,17 @@ std::string show_versions(void);
 // Added code and test for Integral of the Lambert W function: by Nick Thompson.
 // https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals
 
+#ifdef BOOST_MATH_NO_ATOMIC_INT
+#error "Ooops"
+#endif
+
+#undef BOOST_MATH_NO_ATOMIC_INT
+
 #include  // for integral tests.
 #include  // for integral tests.
 #include  // for integral tests.
 
+
   using boost::math::policies::policy;
   using boost::math::policies::make_policy;
 
@@ -1119,9 +1128,6 @@ BOOST_AUTO_TEST_CASE( integrals )
   BOOST_TEST_MESSAGE("\nTest Lambert W integrals.");
   try
   {
-
-
-
   // using statements needed to change precision policy.
   using boost::math::policies::policy;
   using boost::math::policies::make_policy;
@@ -1164,6 +1170,7 @@ BOOST_AUTO_TEST_CASE( integrals )
   std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16
   std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16
   std::cout << "epsilon =  " << std::numeric_limits::epsilon() << std::endl; //
+  std::cout << "End of info on limits.\n" << std::endl;
 
   // Experiment with better diagnostics.
 typedef double Real;
@@ -1203,10 +1210,10 @@ Real x;
     x = es.integrate(f);
     std::cout << "es.integrate(f) = " << x << std::endl;
     BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol);
-    // root_two_pi = 2.506628274631000502
   }
 
-  test_integrals();
+  //test_integrals(); // Error in function boost::math::lambert_w0: Expected a finite value but got inf.
   test_integrals();
   //test_integrals();
   test_integrals();

From 691f2a5852d47321165ea1d95e4a04fe9bddbd3d Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Wed, 11 Jul 2018 15:42:19 +0100
Subject: [PATCH 49/71] Integration tests improved with simpler lambert W

---
 .../math/special_functions/lambert_w.hpp      |  82 +++-----------
 test/test_lambert_w.cpp                       | 106 ++++++++++++------
 2 files changed, 88 insertions(+), 100 deletions(-)

diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp
index 1a1736d28..927eeda3f 100644
--- a/include/boost/math/special_functions/lambert_w.hpp
+++ b/include/boost/math/special_functions/lambert_w.hpp
@@ -1,5 +1,5 @@
 // Copyright John Maddock 2017.
-// Copyright Paul A. Bristow 2016, 2017.
+// Copyright Paul A. Bristow 2016, 2017, 2018.
 // Copyright Nicholas Thompson 2018
 
 // Distributed under the Boost Software License, Version 1.0.
@@ -9,10 +9,6 @@
 #ifndef BOOST_MATH_SF_LAMBERT_W_HPP
 #define BOOST_MATH_SF_LAMBERT_W_HPP
 
-#ifdef _MSC_VER
-#  pragma warning (disable: 4127) // warning C4127: conditional expression is constant.
-#endif // _MSC_VER
-
 /*
 Implementation of an algorithm for the Lambert W0 and W-1 real-only functions.
 
@@ -24,10 +20,12 @@ and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si
 based on the algorithm and a FORTRAN version of Toshio Fukushima's algorithm.
 
 First derivative of Lambert_w is derived from
-Princeton Companion to Applied Mathmatics, 'The Lambert-W function', Section 1.3: Series and Generating Functions.
+Princeton Companion to Applied Mathematics, 'The Lambert-W function', Section 1.3: Series and Generating Functions.
+
 */
 
 /*
+TODO revise this list of macros.
 Some macros that will show some (or much) diagnostic values if #defined.
 //[boost_math_instrument_lambert_w_macros
 
@@ -958,15 +956,12 @@ T lambert_w0_approx(T z)
 // Forward declarations:
 
 //template  T lambert_w0_small_z(T z, const Policy& pol);
-//
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<0>&); // 32 bit usually float
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<0>&); // 32 bit usually float.
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<1>&); //  64 bit usually double
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<1>&); //  64 bit usually double.
 //template 
-//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&); // 80-bit long double
-
-
+//T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&); // 80-bit long double.
 
 //! Lambert_w0 @b 'float' implementation, selected when T is 32-bit precision.
 template 
@@ -984,8 +979,8 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
     return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, pol);
   }
 
-   //if (z >= 0.05)
-   if (z >= 0.045) // 34 terms makes 128-bit 'exact' below 0.045.
+   if (z >= 0.05) // Fukushima switch point.
+  // if (z >= 0.045) // 34 terms makes 128-bit 'exact' below 0.045.
     { // Normal ranges using several rational polynomials.
       if (z < 2)
       {
@@ -1189,9 +1184,9 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&)
          return lambert_w_singularity_series(p);
       }
    }
-} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit float.
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit usually float.
 
-//! Lambert_w0 @b double implementation, selected when T is 64-bit precision.
+//! Lambert_w0 @b 'double' implementation, selected when T is 64-bit precision.
 template 
 inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
 {
@@ -1582,7 +1577,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
          return lambert_w_detail::lambert_w_singularity_series(p);
       }
    }
-} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&)
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&) 64-bit precision, usually double.
 
 //! lambert_W0 implementation for extended precision types including
 //! long double (80-bit and 128-bit), ???
@@ -1644,7 +1639,6 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
    // mpl::true_  if there are so many digits precision wanted that iteration is necessary.
    // mpl::false_ if a single Halley step is sufficient.
 
-
    typedef typename policies::precision::type precision_type;
    typedef mpl::bool_<
       (precision_type::value == 0) || (precision_type::value > 113) ?
@@ -1658,11 +1652,10 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)
 
    return lambert_w_maybe_halley_iterate(w, z, tag_type());
 
- //  result = lambert_w_halley_iterate(result, z);
-
-} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)  extended precision.
+} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&)  all extended precision types.
 
   // Lambert w-1 implementation
+// ==============================================================================================
 
   //! Lambert W for W-1 branch, -max(z) < z <= -1/e.
   // TODO is -max(z) allowed?
@@ -2010,7 +2003,7 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
 } // template T lambert_wm1_imp(const T z)
 } // namespace lambert_w_detail
 
-/////////////////////  User Lambert w functions. //////////////////////////
+/////////////////////////////  User Lambert w functions. //////////////////////////////
 
 //! Lambert W0 using User-defined policy.
   template 
@@ -2033,22 +2026,8 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
       : 2  // 64-bit (probably double) precision.
       > tag_type;
 
-    // Optionally, if policy is all T's digits (default), return after a extra Halley step.
-    // (Might be better with mpl?)
+    return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type()); // 
 
-    T result = lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type()); // Pre-Halley.
-
-    bool quick = (precision_type::value < std::numeric_limits::digits);
-
-    if (quick || (result == -1) || (result == 0) || (!boost::math::isnormal(result)) || (z < -0.3578))
-    { // Don't try to refine using a Halley step.
-      return result;
-    }
-    else
-    {
-      result = lambert_w_detail::lambert_w_halley_step(result, z);
-    }
-    return result;
     // return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type());
   } // lambert_w0(T z, const Policy& pol)
 
@@ -2062,17 +2041,6 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
     // without doing any other internal promotion like float to double.
     typedef typename tools::promote_args::type result_type;
 
-    // Perhaps Deal with other special cases here??????????????
-    // (TODO NaN, zero?
-    //if ((boost::math::isinf)(z))
-    //{
-    // // return std::numeric_limits::infinity();
-    //  static const char* function = "boost::math::lambert_w0<%1%>";
-    //  return boost::math::policies::raise_overflow_error(function, "Expected a finite value but got %1%.", z, policies::policy<>());
-    //  // for double max possible is 703.227... so this would return this value.
-    //  // return boost::math::lambert_w_detail::lambert_w0_approx(lambert_w0(boost::math::tools::max_value()));
-    //}
-
     // Work out what precision has been selected, based on the Policy and the number type.
     // For the default policy version, we want the *default policy* precision for T.
     typedef typename policies::precision::type precision_type;
@@ -2083,22 +2051,8 @@ T lambert_wm1_imp(const T z, const Policy&  pol)
       : (precision_type::value <= 24) ? 1 // 32-bit (probably float) precision.
       : 2  // 64-bit (probably double) precision.
     > tag_type;
-    T result = lambert_w_detail::lambert_w0_imp(result_type(z),  policies::policy<>(), tag_type()); // Pre-Halley.
-    // Always add Halley step for default policy,
-    // unless these special cases where unlikely to improve.
-    if ((z < -0.3578) // Using singularity series.
-      || (!boost::math::isnormal(result))  // NaN, infinity or denormal.
-      || (result == -1) || (result == 0)) // exact.
-    {
-      return result;
-    }
-    result = lambert_w_detail::lambert_w_halley_step(result, z);
-    return result;
-    // TODO this ugliness is because JM rationals return rather than result = ...
-    // and should use existing checks for -1, 0, singularity series and small_z series inside _imp
-    // to avoid repeating here.
-//    return lambert_w_detail::lambert_w0_imp(result_type(z), policies::policy<>(), tag_type()); //
-  } // lambert_w0(T z)
+    return lambert_w_detail::lambert_w0_imp(result_type(z),  policies::policy<>(), tag_type());
+  } // lambert_w0(T z) using default policy.
 
     //! W-1 branch (-max(z) < z <= -1/e).
 
diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index b122bb613..d08c9bf5b 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -103,7 +103,8 @@ typedef policy<
   overflow_error
 > no_throw_policy;
 
-// Assumes that function has a throw policy, for example NOT lambert_w0(1 / (x * x), no_throw_policy());
+// Assumes that function has a throw policy, for example:
+//    NOT lambert_w0(1 / (x * x), no_throw_policy());
 // Error in function boost::math::quadrature::exp_sinh::integrate:
 // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf.
 // Please ensure your function evaluates to a finite number of its entire domain.
@@ -115,8 +116,15 @@ T debug_integration_proc(T x)
   try
   {
    // Assign function call to result in here...
-    result = lambert_w0(1 / (x * x));
-   // result = lambert_w0(1 / (x * x), no_throw_policy());  // Bad idea, less helpful diagnostic message is
+    if (x <= sqrt(boost::math::tools::min_value()) )
+    {
+      result = 0;
+    }
+    else
+    {
+      result = lambert_w0(1 / (x * x));
+    }
+   // result = lambert_w0(1 / (x * x), no_throw_policy());  // Bad idea, less helpful diagnostic message is:
     // Error in function boost::math::quadrature::exp_sinh::integrate:
     // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf.
     // Please ensure your function evaluates to a finite number of its entire domain.
@@ -126,16 +134,16 @@ T debug_integration_proc(T x)
   {
     std::cout << "Exception " << e.what() << std::endl;
     // set breakpoint here:
-    std::cout << "Unexpected exception thrown in integration code at abscissa: " << x << "." << std::endl;
+    std::cout << "Unexpected exception thrown in integration code at abscissa (x): " << x << "." << std::endl;
     if (!std::isfinite(result))
     {
       // set breakpoint here:
-      std::cout << "Unexpected non-finite result in integration code at abscissa: " << x << "." << std::endl;
+      std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl;
     }
     if (std::isnan(result))
     {
       // set breakpoint here:
-      std::cout << "Unexpected non-finite result in integration code at abscissa: " << x << "." << std::endl;
+      std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl;
     }
   } // catch
   return result;
@@ -151,6 +159,8 @@ void test_integrals()
   // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html
   using std::sqrt;
 
+  std::cout << "Integration of type " << typeid(Real).name()  << std::endl;
+
   Real tol = std::numeric_limits::epsilon();
   { //  // Integrate for function lambert_W0(z);
     tanh_sinh ts;
@@ -178,8 +188,24 @@ void test_integrals()
     exp_sinh es;
     auto f = [](Real z)->Real
     {
-      Real zz = z * z; //  warning C4756: overflow in constant arithmetic.
-      return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz);
+
+      //if (!boost::math::isfinite(z)) // sqrt max_value so z^2 would overflow.
+      //{
+      //  return Real(0);
+      //  // Error in function boost::math::quadrature::exp_sinh::integrate: 
+      //  // The function you are trying to integrate does not go to zero at infinity, and instead evaluates to 3.40282347e+38
+      //}
+      //Real zz = z * z;
+      //Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
+      // return lambert_w0(one_div_zz); //
+      if (z <= sqrt(boost::math::tools::min_value()) )
+      { // would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0
+        return static_cast(0);
+      }
+      else
+      {
+        return lambert_w0(1 / (z * z));
+      }
     };
     Real z = es.integrate(f);
     BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol);
@@ -299,7 +325,7 @@ void test_spots(RealType)
 #endif
 
   std::cout << "\nTesting type " << typeid(RealType).name() << std::endl;
-  int epsilons = 1;
+  int epsilons = 2;
   if (std::numeric_limits::digits > 53)
   { // Multiprecision types.
     epsilons *= 8; // (Perhaps needed because need slightly longer (55) reference values?).
@@ -1108,8 +1134,6 @@ BOOST_AUTO_TEST_CASE( derivatives_of_lambert_w )
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, 10.)),
     BOOST_MATH_TEST_VALUE(RealType, 0.063577133469345098),
     tolerance);
-
-
 }; // BOOST_AUTO_TEST_CASE("derivatives of lambert_w")
 */
 
@@ -1120,9 +1144,6 @@ BOOST_AUTO_TEST_CASE( integrals )
   BOOST_TEST_MESSAGE("\nTest Lambert W integrals.");
   try
   {
-
-
-
   // using statements needed to change precision policy.
   using boost::math::policies::policy;
   using boost::math::policies::make_policy;
@@ -1142,21 +1163,26 @@ BOOST_AUTO_TEST_CASE( integrals )
     overflow_error
   > no_throw_policy;
 
-  double inf = std::numeric_limits::infinity();
-  double max = (std::numeric_limits::max)();
-  std::cout.precision(std::numeric_limits::max_digits10);
+  /*
+  */
+  // Experiment with better diagnostics.
+  typedef float Real;
+
+  Real inf = std::numeric_limits::infinity();
+  Real max = (std::numeric_limits::max)();
+  std::cout.precision(std::numeric_limits::max_digits10);
   //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308
   std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf
   std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227
   //std::cout << lambert_w0(inf) << std::endl; // inf - will throw.
   std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0
-  std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324
-  std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308
+  std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324
+  std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308
 
   // Approximate the largest lambert_w you can get for type T?
   float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
   std::cout << "w max_f " << max_w_f << std::endl; // 84.2879
-  double max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
+  Real max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162.
   std::cout << "w max " << max_w << std::endl; // 703.227
 
   std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; //
@@ -1164,26 +1190,28 @@ BOOST_AUTO_TEST_CASE( integrals )
   std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16
   std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16
   std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16
-  std::cout << "epsilon =  " << std::numeric_limits::epsilon() << std::endl; //
+  std::cout << "epsilon =  " << std::numeric_limits::epsilon() << std::endl; //
+  std::cout << "sqrt(max) =  " << sqrt(boost::math::tools::max_value() ) << std::endl; // sqrt(max) =  1.8446742974197924e+19
+  std::cout << "sqrt(min) =  " << sqrt(boost::math::tools::min_value() ) << std::endl; // sqrt(min) =  1.0842021724855044e-19
+
+
+
 
-  // Experiment with better diagnostics.
-typedef double Real;
 Real tol = std::numeric_limits::epsilon();
 Real x;
 {
-    using boost::math::quadrature::exp_sinh;
-    exp_sinh es;
+  using boost::math::quadrature::exp_sinh;
+  exp_sinh es;
+  // Function to be integrated, lambert_w0(1/z^2).
 
-    // Function to be integrated, lambert_w0(1/z^2).
-
-    //  // Avoid divide unity by zero giving infinity.
-    // Commented out for test of try'n'catch diagnostics against this.
+  // Avoid divide unity by zero giving infinity.
+  // (Was commented out for test of try'n'catch diagnostics against this - see below).
     //auto f = [](Real z)->Real
     //{
     //  Real zz = z * z;
-    //  //Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
-    //  //return lambert_w0(one_div_zz); //
-    //  return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); //
+    //  Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
+    //  return lambert_w0(one_div_zz); //
+    //  //return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); //
     //};
 
     //auto f = [](Real z)->Real
@@ -1191,26 +1219,27 @@ Real x;
     //  return lambert_w0(1 / (z * z));
     //};
     // Diagnostic is:
-    // Error in function boost::math::lambert_w0: Expected a finite value but got inf
-
+    // Error in function boost::math::lambert_w0: Expected a finite value but got inf
 
     auto f = [](Real z)->Real
     { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things.
       return debug_integration_proc(z);
     };
     // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf.
-    // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163.
 
+    // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163.
+    // Unexpected exception thrown in integration code at abscissa (x): 3.478765835953569e-23.
     x = es.integrate(f);
     std::cout << "es.integrate(f) = " << x << std::endl;
     BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol);
     // root_two_pi();
   test_integrals();
   //test_integrals();
   test_integrals();
+  test_integrals(); // Error in function boost::math::lambert_w0: Expected a finite value but got inf
   }
   catch (std::exception& ex)
   {
@@ -1225,6 +1254,11 @@ Real x;
   Output:
 
 
+  Test Lambert W integrals.
+  Error in function boost::math::quadrature::exp_sinh::integrate: 
+  The function you are trying to integrate does not go to zero at infinity, 
+  and instead evaluates to 84.2885895
+
   */
 
 

From cf525018420ebc0e0edcb57a8701a8cef17c7479 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Wed, 11 Jul 2018 18:26:25 +0100
Subject: [PATCH 50/71] Tests pass for VS, GCC8.1, integrals and derivatives,
 Clang 600 without integrals and without derivatives.

---
 test/test_lambert_w.cpp | 123 ++++++++++++++++++++++++++--------------
 1 file changed, 79 insertions(+), 44 deletions(-)

diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp
index d08c9bf5b..140bcd9e5 100644
--- a/test/test_lambert_w.cpp
+++ b/test/test_lambert_w.cpp
@@ -186,25 +186,17 @@ void test_integrals()
   {
     // Integrate for function lambert_W0(1/z^2).
     exp_sinh es;
+    //const Real sqrt_min = sqrt(boost::math::tools::min_value()); // 1.08420217e-19 fo 32-bit float.
+    // error C3493: 'sqrt_min' cannot be implicitly captured because no default capture mode has been specified
     auto f = [](Real z)->Real
     {
-
-      //if (!boost::math::isfinite(z)) // sqrt max_value so z^2 would overflow.
-      //{
-      //  return Real(0);
-      //  // Error in function boost::math::quadrature::exp_sinh::integrate: 
-      //  // The function you are trying to integrate does not go to zero at infinity, and instead evaluates to 3.40282347e+38
-      //}
-      //Real zz = z * z;
-      //Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
-      // return lambert_w0(one_div_zz); //
       if (z <= sqrt(boost::math::tools::min_value()) )
-      { // would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0
+      { // Too small would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0 z parameter.
         return static_cast(0);
       }
       else
       {
-        return lambert_w0(1 / (z * z));
+        return lambert_w0(1 / (z * z)); // warning C4756: overflow in constant arithmetic, even though cannot happen.
       }
     };
     Real z = es.integrate(f);
@@ -650,17 +642,17 @@ void test_spots(RealType)
     BOOST_MATH_TEST_VALUE(RealType, 0.2038883547022401644431818313271398701493524772101596350),
     tolerance);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.051)), // just above 0.05 cutoff
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.051)), // just above 0.05 cutoff.
     BOOST_MATH_TEST_VALUE(RealType, -0.05382002772543396036830469500362485089791914689728115249),
-    tolerance);
+    tolerance * 4);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.05)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.05)), // at cutoff.
     BOOST_MATH_TEST_VALUE(RealType, -0.05270598355154634795995650617915721289427674396592395160),
-    tolerance);
+    tolerance * 8);
 
-  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.049)),
+  BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.049)), // Just below cutoff.
     BOOST_MATH_TEST_VALUE(RealType, 0.04676143671340832342497289393737051868103596756298863555),
-    tolerance);
+    tolerance * 4);
 
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 0.01)),
     BOOST_MATH_TEST_VALUE(RealType, 0.009901473843595011885336326816570107953627746494917415483),
@@ -672,7 +664,7 @@ void test_spots(RealType)
 
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.049)),
     BOOST_MATH_TEST_VALUE(RealType, -0.05159448479219405354564920228913331280713177046648170658),
-    tolerance);
+    tolerance * 8);
 
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1e-6)),
     BOOST_MATH_TEST_VALUE(RealType, 9.999990000014999973333385416558666900096702096424344715e-7),
@@ -810,7 +802,7 @@ BOOST_AUTO_TEST_CASE( test_types )
 
 } // BOOST_AUTO_TEST_CASE( test_types )
 
-/*
+
 BOOST_AUTO_TEST_CASE( test_range_of_double_values )
 {
   using boost::math::constants::exp_minus_one;
@@ -1095,9 +1087,10 @@ BOOST_AUTO_TEST_CASE( test_range_of_double_values )
     }
 } // BOOST_AUTO_TEST_CASE(test_range_of_double_values)
 
-BOOST_AUTO_TEST_CASE( derivatives_of_lambert_w )
+#ifdef BOOST_MATH_LAMBERT_W_DERIVATIVES
+BOOST_AUTO_TEST_CASE( Derivatives_of_lambert_w )
 {
-
+  std::cout << "Macro BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined." << std::endl;
   BOOST_TEST_MESSAGE("\nTest Lambert W function 1st differentials.");
 
   using boost::math::constants::exp_minus_one;
@@ -1128,19 +1121,20 @@ BOOST_AUTO_TEST_CASE( derivatives_of_lambert_w )
     tolerance);
 
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)),
-    BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218362),
+    BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218355),
     tolerance);
 
   BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, 10.)),
     BOOST_MATH_TEST_VALUE(RealType, 0.063577133469345098),
     tolerance);
-}; // BOOST_AUTO_TEST_CASE("derivatives of lambert_w")
-*/
+}; // BOOST_AUTO_TEST_CASE("Derivatives of lambert_w")
+
+#endif // BOOST_MATH_LAMBERT_W_DERIVATIVES
 
 #ifdef BOOST_MATH_LAMBERT_W_INTEGRALS
-
 BOOST_AUTO_TEST_CASE( integrals )
 {
+  std::cout << "Macro BOOST_MATH_LAMBERT_W_INTEGRALS is defined." << std::endl;
   BOOST_TEST_MESSAGE("\nTest Lambert W integrals.");
   try
   {
@@ -1164,7 +1158,6 @@ BOOST_AUTO_TEST_CASE( integrals )
   > no_throw_policy;
 
   /*
-  */
   // Experiment with better diagnostics.
   typedef float Real;
 
@@ -1196,7 +1189,7 @@ BOOST_AUTO_TEST_CASE( integrals )
 
 
 
-
+// Demo debug version.
 Real tol = std::numeric_limits::epsilon();
 Real x;
 {
@@ -1204,16 +1197,6 @@ Real x;
   exp_sinh es;
   // Function to be integrated, lambert_w0(1/z^2).
 
-  // Avoid divide unity by zero giving infinity.
-  // (Was commented out for test of try'n'catch diagnostics against this - see below).
-    //auto f = [](Real z)->Real
-    //{
-    //  Real zz = z * z;
-    //  Real one_div_zz = (zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz;
-    //  return lambert_w0(one_div_zz); //
-    //  //return lambert_w0((zz == Real(0)) ? boost::math::tools::max_value() : 1 / zz); //
-    //};
-
     //auto f = [](Real z)->Real
     //{ // Naive - no protection against underflow and subsequent divide by zero.
     //  return lambert_w0(1 / (z * z));
@@ -1234,12 +1217,12 @@ Real x;
     BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol);
     // root_two_pi();
   test_integrals();
-  //test_integrals();
+  test_integrals();
   test_integrals();
-  test_integrals(); // Error in function boost::math::lambert_w0: Expected a finite value but got inf
   }
   catch (std::exception& ex)
   {
@@ -1253,11 +1236,63 @@ Real x;
 
   Output:
 
+  Running 4 test cases...
+
+  Test Lambert W function for several types.
+  Program: i:\modular-boost\libs\math\test\test_lambert_w.cpp
+  Wed Jul 11 17:57:07 2018
+  BuildInfo:
+  Platform Win32, 64-bit.
+  Compiler Microsoft Visual C++ version 14.1
+  STL Dinkumware standard library version 650
+  Boost version 1.68.0
+  BOOST_MATH_TEST_MULTIPRECISION defined for multiprecision tests.
+
+
+
+  Testing type float
+  Tolerance 2 * epsilon == 2.38419e-07
+  Precision 6 decimal digits, max_digits10 = 9
+  -exp(-1) = -0.367879450
+
+  Testing type double
+  Tolerance 2 * epsilon == 4.44089e-16
+  Precision 15 decimal digits, max_digits10 = 17
+  -exp(-1) = -0.36787944117144233
+
+  Testing type class boost::multiprecision::number,0>
+  Tolerance 16 * epsilon == 1.73472e-18
+  Precision 18 decimal digits, max_digits10 = 22
+  -exp(-1) = -0.3678794411714423215831
+
+  Testing type class boost::multiprecision::number,0>
+  Tolerance 16 * epsilon == 3.08149e-33
+  Precision 33 decimal digits, max_digits10 = 37
+  -exp(-1) = -0.3678794411714423215955237701614608727
+
+  Testing type class boost::multiprecision::number,0>
+  Tolerance 16 * epsilon == 8.55285e-50
+  Precision 50 decimal digits, max_digits10 = 53
+  -exp(-1) = -0.36787944117144232159552377016146086744581113103176804
+
+  BOOST_MATH_TEST_FLOAT128 NOT defined so NO float128 tests.
+
+  Test Lambert W function type double for range of values.
+  Tolerance 1 * epsilon == 2.22045e-16
+  (std::numeric_limits::min)() 2.2250738585072014e-308
+  Macro BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined.
+
+  Test Lambert W function 1st differentials.
+  Macro BOOST_MATH_LAMBERT_W_INTEGRALS is defined.
 
   Test Lambert W integrals.
-  Error in function boost::math::quadrature::exp_sinh::integrate: 
-  The function you are trying to integrate does not go to zero at infinity, 
-  and instead evaluates to 84.2885895
+  Integration of type float
+  Integration of type double
+  Integration of type long double
+  Integration of type class boost::multiprecision::number,0>
+
+  *** No errors detected
+  Press any key to continue . . .
 
   */
 

From aaa38c3fee98970c836373ca011934bd861e2663 Mon Sep 17 00:00:00 2001
From: pabristow 
Date: Tue, 17 Jul 2018 17:39:27 +0100
Subject: [PATCH 51/71] first draft of no-precision policy version.

---
 doc/html/index.html                           |   2 +-
 doc/html/indexes/s01.html                     |  21 +-
 doc/html/indexes/s02.html                     |   2 +-
 doc/html/indexes/s03.html                     |   2 +-
 doc/html/indexes/s04.html                     |   6 +-
 doc/html/indexes/s05.html                     |  81 +-
 doc/html/math_toolkit/conventions.html        |   2 +-
 doc/html/math_toolkit/expint/expint_i.html    |   2 +-
 doc/html/math_toolkit/expint/expint_n.html    |   2 +-
 doc/html/math_toolkit/navigation.html         |   2 +-
 doc/html/math_toolkit/next_float.html         |  28 +
 doc/html/math_toolkit/next_float/ulp.html     |   4 +-
 doc/html/math_toolkit/owens_t.html            |   2 +-
 doc/html/math_toolkit/powers/cbrt.html        |   2 +-
 doc/html/math_toolkit/powers/cos_pi.html      |   2 +-
 doc/html/math_toolkit/powers/expm1.html       |   2 +-
 doc/html/math_toolkit/powers/log1p.html       |   2 +-
 doc/html/math_toolkit/powers/powm1.html       |   2 +-
 doc/html/math_toolkit/powers/sin_pi.html      |   2 +-
 doc/html/math_toolkit/powers/sqrt1pm1.html    |   2 +-
 .../root_comparison/cbrt_comparison.html      | 224 ++--
 .../root_comparison/elliptic_comparison.html  |  56 +-
 .../root_comparison/root_n_comparison.html    | 212 ++--
 doc/html/math_toolkit/zetas/zeta.html         |   2 +-
 doc/sf/lambert_w.qbk                          | 320 +++---
 example/lambert_w_precision_example.cpp       | 964 ++----------------
 example/lambert_w_simple_examples.cpp         | 105 +-
 .../math/special_functions/lambert_w.hpp      | 145 +--
 test/test_lambert_w.cpp                       |  10 +-
 29 files changed, 652 insertions(+), 1556 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index cf86d0e63..ddfda1a9d 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -120,7 +120,7 @@ This manual is also available in

        • Last revised: February 01, 2018 at 15:50:54 GMT

        Last revised: July 17, 2018 at 16:28:57 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 6de54b099..36426d121 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -327,10 +327,6 @@
      • -

        branch

        -
        -
        • -

      • brent_find_minima

        • @@ -1037,8 +1033,8 @@

      • C99 and C++ TR1 C-style Functions

      • C99 and TR1 C Functions Overview

      • Error Logs For Error Rate Tables

        • -

      • Error rates for expint (Ei)

        • -

      • Error rates for expint (En)

        • +

      • Error rates for expint (Ei)

        • +

      • Error rates for expint (En)

      • Exponential Integral Ei

      • Exponential Integral En

      • TR1 C Functions Quick Reference

        • @@ -1767,10 +1763,18 @@
      • +

        lambert_w0_prime

        +
        +
        • +

      • lambert_wm1

      • +

        lambert_wm1_prime

        +
        +
        • +

      • ldexp

        • @@ -2814,7 +2818,7 @@

      • Calculating confidence intervals on the mean with the Students-t distribution

      • Error rates for non central t CDF

      • Error rates for non central t CDF complement

        • -

      • Error rates for owens_t

        • +

      • Error rates for owens_t

      • Implementation

      • Known Issues, and TODO List

      • Polynomial and Rational Function Evaluation

        • @@ -3130,7 +3134,6 @@

      • Geometric Distribution

      • Handling functions with large features near an endpoint with tanh-sinh quadrature

      • History and What's New

        • -

      • Lambert W function

      • Negative Binomial Sales Quota Example.

      • Sign Manipulation Functions

        • diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index b3279a834..7ac6cf598 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 4fa43be01..4de886e97 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 6f07c37ca..a9059d584 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        @@ -183,10 +183,6 @@
      • -

        BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP

        -
        -
        • -

      • BOOST_MATH_INSTRUMENT_VARIABLE

        • diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index edac1cc56..bc4ae9331 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -121,6 +121,7 @@

      • FAQs

      • Find mean and standard deviation example

      • Finding the Cubed Root With and Without Derivatives

        • +

      • Floating-Point Representation Distance (ULP), and Finding Adjacent Floating-Point Values

      • Frequently Asked Questions FAQ

      • Gamma

      • Gamma (and Erlang) Distribution

        • @@ -860,10 +861,6 @@
      • -

        BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP

        -
        -
        • -

      • BOOST_MATH_INSTRUMENT_VARIABLE

        • @@ -1004,10 +1001,6 @@
      • -

        branch

        -
        -
        • -

      • brent_find_minima

        • @@ -1579,7 +1572,7 @@

      • Error Functions

      • Error Logs For Error Rate Tables

      • Error rates for beta

        • -

      • Error rates for cbrt

        • +

      • Error rates for cbrt

      • Error rates for cyl_bessel_i

      • Error rates for cyl_bessel_i (integer orders)

      • Error rates for cyl_bessel_j

        • @@ -1591,8 +1584,8 @@

      • Error rates for ellint_2

      • Error rates for erf

      • Error rates for erfc

        • -

      • Error rates for expint (Ei)

        • -

      • Error rates for expm1

        • +

      • Error rates for expint (Ei)

        • +

      • Error rates for expm1

      • Error rates for gamma_p

      • Error rates for gamma_q

      • Error rates for ibeta

        • @@ -1602,9 +1595,9 @@

      • Error rates for jacobi_dn

      • Error rates for jacobi_sn

      • Error rates for lgamma

        • -

      • Error rates for log1p

        • +

      • Error rates for log1p

      • Error rates for tgamma

        • -

      • Error rates for zeta

        • +

      • Error rates for zeta

      • FAQs

      • Frequently Asked Questions FAQ

      • Incomplete Beta Functions

        • @@ -2727,7 +2720,7 @@

      • Error rates for cbrt

        -
        +

      • Error rates for cyl_bessel_i

        @@ -2903,23 +2896,23 @@

      • Error rates for expint (Ei)

      • Error rates for expint (En)

      • Error rates for expm1

      • @@ -3041,8 +3034,8 @@

      • Error rates for log1p

      • @@ -3077,7 +3070,7 @@

      • Error rates for owens_t

        -
        +

      • Error rates for polygamma

        @@ -3130,8 +3123,8 @@

      • Error rates for zeta

      • @@ -3226,8 +3219,8 @@

      • C99 and C++ TR1 C-style Functions

      • C99 and TR1 C Functions Overview

      • Error Logs For Error Rate Tables

        • -

      • Error rates for expint (Ei)

        • -

      • Error rates for expint (En)

        • +

      • Error rates for expint (Ei)

        • +

      • Error rates for expint (En)

      • Exponential Integral Ei

      • Exponential Integral En

      • TR1 C Functions Quick Reference

        • @@ -3641,6 +3634,10 @@
      • +

        Floating-Point Representation Distance (ULP), and Finding Adjacent Floating-Point Values

        +
        +
        • +

      • float_advance

        • @@ -4033,8 +4030,8 @@

      • Error rates for ellint_rj

      • Error rates for erf

      • Error rates for erfc

        • -

      • Error rates for expint (Ei)

        • -

      • Error rates for expint (En)

        • +

      • Error rates for expint (Ei)

        • +

      • Error rates for expint (En)

      • Error rates for gamma_p

      • Error rates for gamma_q

      • Error rates for ibeta

        • @@ -4054,7 +4051,7 @@

      • Error rates for tgamma (incomplete)

      • Error rates for tgamma_lower

      • Error rates for trigamma

        • -

      • Error rates for zeta

        • +

      • Error rates for zeta

      • Exponential Integral Ei

      • Incomplete Beta Functions

      • Incomplete Gamma Functions

        • @@ -4838,16 +4835,16 @@

      • al

      • alpha

      • bisection

        • -

      • BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP

      • BOOST_MATH_TEST_VALUE

        • -

      • branch

      • constants

      • expression

      • float

      • I

      • interval

      • lambert_w0

        • +

      • lambert_w0_prime

      • lambert_wm1

        • +

      • lambert_wm1_prime

      • ln

      • lookup_t

      • message

        • @@ -4857,7 +4854,6 @@

      • small

      • step

      • W

        • -

      • zero

      • @@ -4865,10 +4861,18 @@
      • +

        lambert_w0_prime

        +
        +
        • +

      • lambert_wm1

      • +

        lambert_wm1_prime

        +
        +
        • +

      • Lanczos approximation

        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index 8ff3da6d2..b300c694b 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/expint/expint_i.html b/doc/html/math_toolkit/expint/expint_i.html index 536bfc30e..db30dd7fc 100644 --- a/doc/html/math_toolkit/expint/expint_i.html +++ b/doc/html/math_toolkit/expint/expint_i.html @@ -85,7 +85,7 @@ zero error.

        -

        Table 6.75. Error rates for expint (Ei)

        +

        Table 6.78. Error rates for expint (Ei)

        diff --git a/doc/html/math_toolkit/expint/expint_n.html b/doc/html/math_toolkit/expint/expint_n.html index 7636f0bce..d5369f786 100644 --- a/doc/html/math_toolkit/expint/expint_n.html +++ b/doc/html/math_toolkit/expint/expint_n.html @@ -84,7 +84,7 @@ zero error.

        -

        Table 6.74. Error rates for expint (En)

        +

        Table 6.77. Error rates for expint (En)

        diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 2d5689a3e..c0c032b68 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/next_float.html b/doc/html/math_toolkit/next_float.html index dd95ae363..6dc5109dc 100644 --- a/doc/html/math_toolkit/next_float.html +++ b/doc/html/math_toolkit/next_float.html @@ -68,6 +68,34 @@ for example XRC eXact Real in C.

        +

        + The accuracy of mathematical functions can be assessed and displayed in terms + of Unit in + the Last Place, often as a ulps plot or by binning the differences + as a histogram. Samples are evaluated using the implementation under test and + compared with 'known good' representation obtained using a more accurate method. + Other implementations, often using arbitrary precision arithmetic, for example + Wolfram Alpha are one source + of references values. The other method, used widely in Boost.Math special functions, + it to carry out the same algorithm, but using a higher precision type, typically + using Boost.Multiprecision types like cpp_bin_float_quad + for 128-bit (about 35 decimal digit precision), or cpp_bin_float_50 + (for 50 decimal digit precision). +

        +

        + When converted to a particular machine representation, say double, + say using a static_cast, the value + is the nearest representation possible for the double + type. This value cannot be 'wrong' by more than half a Unit + in the last place (ULP), and can be obtained using the Boost.Math function + ulp. (Unless the algorithm + is fundamentally flawed, something that should be revealed by 'sanity' checks + using some independent sources). +

        +

        + See some discussion and example plots by Cleve Moler of Mathworks ulps + plots reveal math-function accuracy. +

        diff --git a/doc/html/math_toolkit/next_float/ulp.html b/doc/html/math_toolkit/next_float/ulp.html index 50be46604..110eec2b9 100644 --- a/doc/html/math_toolkit/next_float/ulp.html +++ b/doc/html/math_toolkit/next_float/ulp.html @@ -57,7 +57,7 @@ in the last place of x.

        - Corner cases are handled as followes: + Corner cases are handled as follows:

        • @@ -70,7 +70,7 @@ If the argument is zero then returns the smallest representable value: for example for type double this would be either std::numeric_limits<double>::min() or std::numeric_limits<double>::denorm_min() depending whether denormals are supported - (which have the values 2.2250738585072014e-308 + (which have the values 2.2250738585072014e-308 and 4.9406564584124654e-324 respectively).
          • diff --git a/doc/html/math_toolkit/owens_t.html b/doc/html/math_toolkit/owens_t.html index 2f4ad4b4a..0df17c3b1 100644 --- a/doc/html/math_toolkit/owens_t.html +++ b/doc/html/math_toolkit/owens_t.html @@ -120,7 +120,7 @@ Over the built-in types and range tested, errors are less than 10 * std::numeric_limits<RealType>::epsilon().

          -

          Table 6.83. Error rates for owens_t

          +

          Table 6.86. Error rates for owens_t

        diff --git a/doc/html/math_toolkit/powers/cbrt.html b/doc/html/math_toolkit/powers/cbrt.html index fb8ceec91..df475dea6 100644 --- a/doc/html/math_toolkit/powers/cbrt.html +++ b/doc/html/math_toolkit/powers/cbrt.html @@ -70,7 +70,7 @@ should have approximately 2 epsilon accuracy.

        -

        Table 6.80. Error rates for cbrt

        +

        Table 6.83. Error rates for cbrt

        diff --git a/doc/html/math_toolkit/powers/cos_pi.html b/doc/html/math_toolkit/powers/cos_pi.html index 34be07503..70809d079 100644 --- a/doc/html/math_toolkit/powers/cos_pi.html +++ b/doc/html/math_toolkit/powers/cos_pi.html @@ -57,7 +57,7 @@ computing the cosine of πx.

        -

        Table 6.77. Error rates for cos_pi

        +

        Table 6.80. Error rates for cos_pi

        diff --git a/doc/html/math_toolkit/powers/expm1.html b/doc/html/math_toolkit/powers/expm1.html index b662e1af8..bf8aee775 100644 --- a/doc/html/math_toolkit/powers/expm1.html +++ b/doc/html/math_toolkit/powers/expm1.html @@ -79,7 +79,7 @@ should have approximately 1 epsilon accuracy.

        -

        Table 6.79. Error rates for expm1

        +

        Table 6.82. Error rates for expm1

        diff --git a/doc/html/math_toolkit/powers/log1p.html b/doc/html/math_toolkit/powers/log1p.html index 68da0c87d..ba6331e70 100644 --- a/doc/html/math_toolkit/powers/log1p.html +++ b/doc/html/math_toolkit/powers/log1p.html @@ -93,7 +93,7 @@ should have approximately 1 epsilon accuracy.

        -

        Table 6.78. Error rates for log1p

        +

        Table 6.81. Error rates for log1p

        diff --git a/doc/html/math_toolkit/powers/powm1.html b/doc/html/math_toolkit/powers/powm1.html index 3591163aa..fccbac680 100644 --- a/doc/html/math_toolkit/powers/powm1.html +++ b/doc/html/math_toolkit/powers/powm1.html @@ -72,7 +72,7 @@ Should have approximately 2-3 epsilon accuracy.

        -

        Table 6.82. Error rates for powm1

        +

        Table 6.85. Error rates for powm1

        diff --git a/doc/html/math_toolkit/powers/sin_pi.html b/doc/html/math_toolkit/powers/sin_pi.html index df214e845..3b3e4b46f 100644 --- a/doc/html/math_toolkit/powers/sin_pi.html +++ b/doc/html/math_toolkit/powers/sin_pi.html @@ -57,7 +57,7 @@ computing the sine of πx.

        -

        Table 6.76. Error rates for sin_pi

        +

        Table 6.79. Error rates for sin_pi

        diff --git a/doc/html/math_toolkit/powers/sqrt1pm1.html b/doc/html/math_toolkit/powers/sqrt1pm1.html index 20517c6b3..4ef24a4b9 100644 --- a/doc/html/math_toolkit/powers/sqrt1pm1.html +++ b/doc/html/math_toolkit/powers/sqrt1pm1.html @@ -75,7 +75,7 @@ should have approximately 3 epsilon accuracy.

        -

        Table 6.81. Error rates for sqrt1pm1

        +

        Table 6.84. Error rates for sqrt1pm1

        diff --git a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html index 9ee6c427b..f3066043f 100644 --- a/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/cbrt_comparison.html @@ -248,9 +248,9 @@
        Program - root_finding_algorithms.cpp, Microsoft Visual C++ version 14.0, Dinkumware - standard library version 650, Win32, x86
        1000000 evaluations of each - of 5 root_finding algorithms.         + root_finding_algorithms.cpp, Clang version 6.0.0 (tags/RELEASE_600/final), + Dinkumware standard library version 650, Win32, x64
        1000000 evaluations + of each of 5 root_finding algorithms.

        Table 12.1. Cube root(28) for float, double, long double and cpp_bin_float_50

        @@ -441,7 +441,7 @@
        - - - - - + + + + + - - - - - + + + + + - - - - - + + + + + - +

        - 203125 + 62500

        		@@ -463,7 +463,7 @@

        - 234375 + 46875

        		@@ -485,7 +485,7 @@

        - 203125 + 62500

        		@@ -507,12 +507,12 @@

        - 10281250 + 5750000

        - 1.0 + 1.1

        		@@ -536,12 +536,12 @@

        - 843750 + 343750

        - 4.2 + 5.5

        		@@ -558,12 +558,12 @@

        - 1125000 + 531250

        - 4.8 + 11.

        		@@ -580,12 +580,12 @@

        - 1203125 + 531250

        - 5.9 + 8.5

        		@@ -602,12 +602,12 @@

        - 71765625 + 40031250

        - 7.1 + 7.4

        		@@ -631,12 +631,12 @@

        - 593750 + 171875

        - 2.9 + 2.8

        		@@ -653,12 +653,12 @@

        - 578125 + 187500

        - 2.5 + 4.0

        		@@ -675,12 +675,12 @@

        - 625000 + 187500

        - 3.1 + 3.0

        		@@ -697,7 +697,7 @@

        - 10062500 + 5406250

        		@@ -726,12 +726,12 @@

        - 593750 + 187500

        - 2.9 + 3.0

        		@@ -748,12 +748,12 @@

        - 609375 + 218750

        - 2.6 + 4.7

        		@@ -770,12 +770,12 @@

        - 593750 + 203125

        - 2.9 + 3.3

        		@@ -792,12 +792,12 @@

        - 20859375 + 12968750

        - 2.1 + 2.4

        		@@ -821,12 +821,12 @@

        - 593750 + 203125

        - 2.9 + 3.3

        		@@ -843,12 +843,12 @@

        - 593750 + 250000

        - 2.5 + 5.3

        		@@ -865,12 +865,12 @@

        - 609375 + 218750

        - 3.0 + 3.5

        		@@ -887,12 +887,12 @@

        - 25171875 + 15984375

        - 2.5 + 3.0

        		@@ -909,8 +909,8 @@
        Program - root_finding_algorithms.cpp, GNU C++ version 4.9.2, GNU libstdc++ version - 20141030, Win32, x64
        1000000 evaluations of each of 5 root_finding + root_finding_algorithms.cpp, GNU C++ version 7.2.0, GNU libstdc++ version + 20170814, Win32, x64
        1000000 evaluations of each of 5 root_finding algorithms.
        @@ -1124,7 +1124,7 @@

        - 46875 + 125000

        		@@ -1146,7 +1146,7 @@

        - 46875 + 109375

        		@@ -1168,12 +1168,12 @@

        - 3500000 + 3875000

        - 1.1 + 1.0

        		@@ -1197,12 +1197,12 @@

        - 187500 + 281250

        - 4.0 + 6.0

        		@@ -1219,12 +1219,12 @@

        - 406250 + 453125

        - 8.7 + 3.6

        		@@ -1241,12 +1241,12 @@

        - 609375 + 1750000

        - 13. + 16.

        		@@ -1258,17 +1258,17 @@

        - 7 + 6

        - 44531250 + 30312500

        - 14. + 7.8

        		@@ -1290,28 +1290,6 @@ 5

        		-

        - 93750 -

        -         		-

        - 2.0 -

        -         		-

        - 0 -

        -         		- -

        - 6 -

        -

        109375 @@ -1336,12 +1314,34 @@

        - 171875 + 140625

        - 3.7 + 1.1 +

        +         		+

        + 0 +

        +         		+ +

        + 6 +

        +         		+

        + 281250 +

        +         		+

        + 2.6

        		@@ -1358,12 +1358,12 @@

        - 3140625 + 4125000

        - 1.0 + 1.1

        		@@ -1385,28 +1385,6 @@ 3

        		-

        - 93750 -

        -         		-

        - 2.0 -

        -         		-

        - 0 -

        -         		- -

        - 4 -

        -

        125000 @@ -1431,7 +1409,29 @@

        - 218750 + 140625 +

        +         		+

        + 1.1 +

        +         		+

        + 0 +

        +         		+ +

        + 4 +

        +         		+

        + 515625

        		@@ -1453,12 +1453,12 @@

        - 7171875 + 9171875

        - 2.3 + 2.4

        		@@ -1482,12 +1482,12 @@

        - 109375 + 140625

        - 2.3 + 3.0

        		@@ -1509,7 +1509,7 @@

        - 3.7 + 1.4

        		@@ -1526,12 +1526,12 @@

        - 281250 + 671875

        - 6.0 + 6.1

        		@@ -1548,12 +1548,12 @@

        - 8703125 + 10578125

        - 2.8 + 2.7

        		diff --git a/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html b/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html index 588a40dee..44771f9f7 100644 --- a/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/elliptic_comparison.html @@ -1266,7 +1266,7 @@ Program root_elliptic_finding.cpp, - GNU C++ version 4.9.2, GNU libstdc++ version 20141030, Win32 Compiled in + GNU C++ version 7.2.0, GNU libstdc++ version 20170814, Win32 Compiled in optimise mode., _X64_SSE2
        @@ -1460,12 +1460,12 @@

        - 328 + 437

        - 1.31 + 1.17

        		@@ -1482,12 +1482,12 @@

        - 875 + 1234

        - 1.51 + 1.08

        		@@ -1504,12 +1504,12 @@

        - 1109 + 2562

        - 1.69 + 1.48

        		@@ -1526,7 +1526,7 @@

        - 479687 + 657812

        		@@ -1555,12 +1555,12 @@

        - 328 + 437

        - 1.31 + 1.17

        		@@ -1577,12 +1577,12 @@

        - 671 + 1421

        - 1.16 + 1.25

        		@@ -1599,12 +1599,12 @@

        - 781 + 2031

        - 1.19 + 1.17

        		@@ -1621,12 +1621,12 @@

        - 387500 + 550000

        - 1.20 + 1.25

        		@@ -1650,7 +1650,7 @@

        - 250 + 375

        		@@ -1672,7 +1672,7 @@

        - 578 + 1140

        		@@ -1694,7 +1694,7 @@

        - 656 + 1734

        		@@ -1716,7 +1716,7 @@

        - 321875 + 440625

        		@@ -1745,12 +1745,12 @@

        - 375 + 500

        - 1.50 + 1.33

        		@@ -1767,12 +1767,12 @@

        - 734 + 1484

        - 1.27 + 1.30

        		@@ -1789,12 +1789,12 @@

        - 828 + 2156

        - 1.26 + 1.24

        		@@ -1811,12 +1811,12 @@

        - 414062 + 535937

        - 1.29 + 1.22

        		diff --git a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html index c2ad7635b..d0c2cd770 100644 --- a/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html +++ b/doc/html/math_toolkit/roots/root_comparison/root_n_comparison.html @@ -3506,9 +3506,9 @@
        - Program - root_n_finding_algorithms.cpp, GNU C++ version 4.9.2, GNU libstdc++ version - 20141030, Win32 Compiled in optimise mode., _X64_SSE2 + Program + ..\example\root_n_finding_algorithms.cpp, GNU C++ version 7.2.0, GNU libstdc++ + version 20170814, Win32 Compiled in optimise mode., _X64_SSE2

        Fraction of full accuracy 1 @@ -3704,12 +3704,12 @@

        - 193 + 260

        - 2.14 + 2.26

        		@@ -3726,12 +3726,12 @@

        - 432 + 481

        - 3.86 + 3.51

        		@@ -3748,12 +3748,12 @@

        - 579 + 1526

        - 3.83 + 6.78

        		@@ -3770,12 +3770,12 @@

        - 59062 + 70937

        - 7.56 + 8.11

        		@@ -3799,7 +3799,7 @@

        - 90 + 115

        		@@ -3821,7 +3821,7 @@

        - 112 + 137

        		@@ -3843,7 +3843,7 @@

        - 151 + 225

        		@@ -3865,7 +3865,7 @@

        - 7812 + 8750

        		@@ -3892,28 +3892,6 @@ 2

        		-

        - 98 -

        -         		-

        - 1.09 -

        -         		-

        - 0 -

        -         		- -

        - 3 -

        -

        135 @@ -3921,7 +3899,7 @@

        - 1.21 + 1.17

        		@@ -3938,12 +3916,34 @@

        - 201 + 162

        - 1.33 + 1.18 +

        +         		+

        + 0 +

        +         		+ +

        + 3 +

        +         		+

        + 412 +

        +         		+

        + 1.83

        		@@ -3960,12 +3960,12 @@

        - 13750 + 14687

        - 1.76 + 1.68

        		@@ -3989,12 +3989,12 @@

        - 112 + 135

        - 1.24 + 1.17

        		@@ -4011,12 +4011,12 @@

        - 142 + 170

        - 1.27 + 1.24

        		@@ -4033,12 +4033,12 @@

        - 206 + 425

        - 1.36 + 1.89

        		@@ -4055,12 +4055,12 @@

        - 17031 + 18906

        - 2.18 + 2.16

        		@@ -4265,12 +4265,12 @@

        - 351 + 465

        - 1.97 + 3.39

        		@@ -4287,12 +4287,12 @@

        - 621 + 662

        - 3.18 + 4.24

        		@@ -4309,12 +4309,12 @@

        - 906 + 2304

        - 3.61 + 8.17

        		@@ -4331,12 +4331,12 @@

        - 75468 + 91093

        - 7.10 + 7.29

        		@@ -4360,7 +4360,7 @@

        - 178 + 137

        		@@ -4382,7 +4382,7 @@

        - 195 + 156

        		@@ -4404,7 +4404,7 @@

        - 251 + 282

        		@@ -4426,7 +4426,7 @@

        - 10625 + 12500

        		@@ -4455,12 +4455,12 @@

        - 196 + 181

        - 1.10 + 1.32

        		@@ -4477,12 +4477,12 @@

        - 242 + 210

        - 1.24 + 1.35

        		@@ -4499,12 +4499,12 @@

        - 345 + 540

        - 1.37 + 1.91

        		@@ -4521,12 +4521,12 @@

        - 21093 + 24062

        - 1.99 + 1.92

        		@@ -4550,12 +4550,12 @@

        - 225 + 201

        - 1.26 + 1.47

        		@@ -4572,12 +4572,12 @@

        - 270 + 242

        - 1.38 + 1.55

        		@@ -4594,12 +4594,12 @@

        - 384 + 660

        - 1.53 + 2.34

        		@@ -4616,12 +4616,12 @@

        - 29062 + 35625

        - 2.74 + 2.85

        		@@ -4826,12 +4826,12 @@

        - 429 + 562

        - 2.22 + 3.53

        		@@ -4848,12 +4848,12 @@

        - 679 + 701

        - 3.02 + 3.85

        		@@ -4870,12 +4870,12 @@

        - 1098 + 2665

        - 3.94 + 9.10

        		@@ -4892,12 +4892,12 @@

        - 114531 + 137968

        - 8.83 + 9.60

        		@@ -4921,7 +4921,7 @@

        - 193 + 159

        		@@ -4943,7 +4943,7 @@

        - 225 + 182

        		@@ -4965,7 +4965,7 @@

        - 279 + 293

        		@@ -4987,7 +4987,7 @@

        - 12968 + 14375

        		@@ -5016,12 +5016,12 @@

        - 196 + 185

        - 1.02 + 1.16

        		@@ -5038,12 +5038,12 @@

        - 248 + 220

        - 1.10 + 1.21

        		@@ -5060,12 +5060,12 @@

        - 348 + 757

        - 1.25 + 2.58

        		@@ -5082,12 +5082,12 @@

        - 21718 + 26093

        - 1.67 + 1.82

        		@@ -5111,12 +5111,12 @@

        - 254 + 246

        - 1.32 + 1.55

        		@@ -5133,12 +5133,12 @@

        - 323 + 279

        - 1.44 + 1.53

        		@@ -5155,12 +5155,12 @@

        - 453 + 1135

        - 1.62 + 3.87

        		@@ -5177,12 +5177,12 @@

        - 35625 + 41093

        - 2.75 + 2.86

        		diff --git a/doc/html/math_toolkit/zetas/zeta.html b/doc/html/math_toolkit/zetas/zeta.html index 7fe263b02..72604507c 100644 --- a/doc/html/math_toolkit/zetas/zeta.html +++ b/doc/html/math_toolkit/zetas/zeta.html @@ -89,7 +89,7 @@ zero error.

        -

        Table 6.73. Error rates for zeta

        +

        Table 6.76. Error rates for zeta

        diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 57845884d..0dd9bb0b3 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -9,23 +9,22 @@ namespace boost { namespace math { template - ``__sf_result`` lambert_w0(T z); // W0 branch, default precision. + ``__sf_result`` lambert_w0(T z); // W0 branch, default policy. template ``__sf_result`` lambert_w0_prime(T z); // W0 branch 1st derivative. template - ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy controlled precision. + ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy. template - ``__sf_result`` lambert_wm1(T z); // W-1 branch. + ``__sf_result`` lambert_wm1(T z); // W-1 branch, default policy. template - ``__sf_result`` lambert_wm1_prime(T z); //W -1 branch 1st derivative. + ``__sf_result`` lambert_wm1_prime(T z); // W-1 branch 1st derivative. template - ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy controlled precision. - // Use `lambert_wm1(z, policy >())` // If speed is more important than last-digit precision. + ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy. } // namespace boost } // namespace math @@ -38,7 +37,8 @@ It is also called the Omega function, the inverse function of ['f(W) = W e[super On the z-interval \[0, [infin]\] there is just one real solution. On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-. -Two principal branches functions called `lambert_w0` and `lambert_wm1` are provided by Boost's real-only implementation. +Two principal branches functions called `lambert_w0` and `lambert_wm1` +are provided by Boost's real-only implementation. In the graphs below, the red line is the W0 branch, and the blue line the W-1 branch. @@ -58,8 +58,7 @@ Lambert_w0(3.2e+38) = 84.29, and for `double`, lambert_w0(1.797e+308) = 703.3. The final __Policy argument is optional and can be used to control the behaviour of the function: -how it handles errors and what level of precision can be traded for speed. -By default, the best possible precision is computed. +how it handles errors. Refer to __policy_section for more details and see examples below. @@ -77,7 +76,7 @@ also many new implementations of the function, upon which this implementation bu [import ../../example/lambert_w_simple_examples.cpp] -You will usually need the following include and `using` statements: +You will usually need the following `#include` and `using` statements: [lambert_w_simple_examples_includes] @@ -85,10 +84,11 @@ Some examples follow: [lambert_w_simple_examples_0] -Other floating-point types can be used too, here `float`. -It is convenient to use function `show_value` -to display all potentially significant decimal digits -(`std::numeric_limits<>::max_digits10`) for the type. +Other floating-point types can be used too, here `float`, +including user defined types like __multiprecision. +It is convenient to use a function like `show_value` +to display all (and only) potentially significant decimal digits, including any significant trailing zeros, +(`std::numeric_limits<>::max_digits10`) for the type `T`. [lambert_w_simple_examples_1] @@ -97,12 +97,13 @@ showing that an 'int' literal is correctly promoted to a `double`. [lambert_w_simple_examples_2] -Using multiprecision types to get much higher precision is painless. +Using __multiprecision types to get much higher precision is painless. [lambert_w_simple_examples_3] -[warning When using multiprecision, take great care not to -construct or assign non-integers from `double`, `float`... silently losing precision.] +[warning When using multiprecision, take very great care not to +construct or assign non-integers from `double`, `float` ... silently losing precision. +Use `"1.2345678901234567890123456789"` rather than `1.2345678901234567890123456789`.] Using multiprecision types, it is all too easy to get multiprecision precision wrong! @@ -127,11 +128,7 @@ at least to thousands of decimal digits, but not shown here for brevity. See [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] ). -Policies can be used to control precision (a tiny bit less precision gives a significant speed-up): - -[lambert_w_simple_examples_precision_policies] - -and to control what action to take on errors: +Policies can be used to control what action to take on errors: [lambert_w_simple_examples_error_policies] @@ -140,7 +137,7 @@ and to control what action to take on errors: [lambert_w_simple_examples_error_message_1] Show error reporting if a value is passed to `lambert_w0` that is out of range, -and was probably meant to be passed to `lambert_wm1` instead. +(and was probably meant to be passed to `lambert_wm1` instead). [lambert_w_simple_examples_out_of_range] @@ -191,58 +188,40 @@ for details of the calculation. [h5:implementations Existing implementations] -The function is described in Wolfram Mathworld as = +The function is described in Wolfram Mathworld as [@http://mathworld.wolfram.com/LambertW-Function.html [^Lambert W function]]. -The principal value of the Lambert W-function is implemented in the Wolfram Language as ['ProductLog\[z\]]. - -__WolframAlpha has provided some reference values for testing. +The principal value of the Lambert W function is implemented in the Wolfram Language as ['ProductLog\[k, z\]] +where k is the branch, by default zero, but also the negative branch when k = -1. +__WolframAlpha has provided many reference values for testing. For example, the output from [@https://www.wolframalpha.com/input/?i=productlog(1)] is 0.56714329040978387299996866221035554975381578718651... Also the [@https://www.wolframalpha.com Wolfram language] command: [^N\[ProductLog\[-1\], 50\]] -produces the same output to 50 decimal digit precision. +produces the same output to the specified 50 decimal digit precision. The symbolic algebra program __Maple also computes Lambert W to an arbitrary precision. [h4:precision Controlling the compromise between Precision and Speed] -This implementation allows the compromise between precision and speed to be controlled using __precision_policy. +This implementation provides good precision and excellent speed. -Using the default policy, all the functions usually return values within a few __ulp +All the functions usually return values within a few __ulp for the floating-point type, except for very small arguments very near zero, and for arguments very close to the singularity at the branch point. -By default, this implementation provides the best possible precision -(adding a __halley refinement, but without using __multiprecision higher precision types) -making it slower than Fukushima's or other algorithms, -(Boost.Math generally prefers accuracy over speed). -However, it will return at intermediate stages if the precision specified in the policy has been met, -usually at least halving the execution time, and so is, we believe, the fastest algorithm now available. +By default, this implementation provides the best possible speed. +Very slightly higher precision and less bias can be obtained by adding a __halley step refinement, +but at the cost of more than doubling the run time. -It is convenient to define some `using` statements when using __policy_section to control precision. - - using boost::math::policies::policy; - using boost::math::policies::precision; - using boost::math::policies::digits2; // Precision as bits. - using boost::math::policies::digits10; // Precision as decimal digits. - -[tip Because some macros and metaprogramming are used by the implementation of policies, -some ways of naming these items may confuse Visual Studio Intellisense and the compiler.] - -Precision targets can be specified in bits using `digits2` or decimal using `digits10`. -These are related by `digits10 = log10(2) * digits2 where log10(2) = 0.30103`. -Specifying `digits10` is a coarser measure and is roughly a third of `digits2`, -but may be slightly more intuitive than specifying precision in bits. +The 'best' evaluation (the nearest __representable) can be achieved by `static_cast`ing from a +higher precision type, typically a __multiprecision type like `cpp_bin_float_50`, +at the cost of increasing run-time >100-fold; +this has been used here to provide reference values for testing. [import ../../example/lambert_w_precision_example.cpp] -To show the various stages the example below shows `float` evaluation of Lambert W at varying precisions -specified using a policy with `digits10` increasing from 1 to 9. - -For `float`, this covers the full precision range as `max_digits10 = 9`: - [lambert_w_precision_1] The output for ['z = 1.F] is: @@ -254,59 +233,19 @@ we need a Halley refinement (or few) to get the last bit or two correct. [lambert_w_precision_output_1a] -For `float`, the full code for all possible 23 `digits2` precisions is too long to show here, -but if the policy precision is specified using `digits2` (= 23 for 32-bit `float` type), -one can see the small improvement from Halley at 22 bits: - - std::cout << lambert_w0(z, policy >()) ... - - Lambert W (10.0000000, digits2<21>) = 1.74552798 << Schroeder. - Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley. - -For `double`, `max_digits10 == 17` and `digits == 53`, so the table is much too long to show here. -(See the full code with typical output as comments at -[@../../example/lambert_w_precision_example.cpp lambert_w_precision_example.cpp]). - -The final Schroeder refinement is skipped by this implementation if -`(digits2 <= (std::numeric_limits::digits - 3))` -3 bits less than the maximum for the type `std::numeric_limits::digits`. - -For type `double`, the switch is at `policy`, -so this is recommended for general use when speed is important. - -[tip Use `lambert_w0(z, policy >())` or `lambert_w0(z, policy >())` if speed is more important than the ultimate precision, -for example, Monte Carlo applications.] - -If speed is [*very] important then `digits2<10>` only using Bisection alone might suffice: - - Lambert W (10.0000000, digits2<10>) = 1.74414063 << Bisection only. - -Setting digits2 <= 10 (about 3 decimal digits precision) will return the results from bisection. - -the precision gain from the Schroeder and Halley is small. - - Lambert W (10.0000000, digits2<11>) = 1.74552798 << Schroeder. - ... - Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley. - [h5:big_floats Floating-point types larger than double] -For floating-point types with precision greater than __fundamental_types, +For floating-point types with precision greater than `double` and `float` __fundamental_types, a `double` evaluation is used as a first approximation followed by Halley refinement, -so that there is is little to gain in trying to control precision. +using a single step where it can be predicted that this will be sufficient, +only using __Halley iteration when necessary. Higher precision types are always going to be [*very, very much slower]. -For more examples of controlling precision, see -[@../../example/lambert_w_precision_example.cpp lambert_w_precision_example.cpp]. - -The implementation details of algorithm switch points are in -[@../../include/boost/math/special_functions/lambert_w.hpp lambert_w.hpp] - [h4:edge_cases Edge and Corner cases] [h5:w0_edges w0 Branch] -The range mathematically is -1/e <= z <= +[infin], but numerically, (for the type T) +The range mathematically is -1/e <= z <= +[infin], but numerically, (for the floating-point type T) * `z == -1/e` returns exactly -1. * `z < -1/e` throws a `domain_error`, and/or returns `NaN` according to the policy. @@ -314,9 +253,9 @@ Provided that there is a `catch` clause, an error message (similar to that below * `z == (std::numeric_limits::max)()` returns W for the floating_point type T, (for example, for `double`, 703.22703310477018L) * `z == std::numeric_limits::infinity()` throws a `overflow_error`. -(An argument z passed as infinity probably indicates an error has already occured, +(An argument z passed as infinity probably indicates an error has already occurred, but if it is desired to return infinity, -this case can be handled before calling `lambert_w0`). +this case should be handled before calling `lambert_w0`). [h5:wm1_edges w-1 Branch] @@ -336,21 +275,22 @@ and will give a message like: Argument z = -4.9406564584124654e-324 is too small (z < -std::numeric_limits::min so denormalized) for Lambert W-1 branch! -Denormalized values of z are not supported for Lambert W-1 (because not all floating-point types denormalize), +Denormalized values of z are not supported for Lambert W-1 (because not all floating-point types denormalize), and anyway it only covers a tiny fraction of the range of possible z arguments values. [h4:compilers Compilers] -The code has been tested on VS 15.5.5, Clang 5.0.0 and GCC 7.2.0 but it is expected to work on all C++ compilers. +The code has been tested on VS 15.7.5, Clang 6.0.0 and GCC 8.1.0; it is expected to work on all C++ compilers. +As expected, debug mode is very much slower. The release version optimisation also varied. [h5:diagnostics Diagnostics Macros] Several macros are provided to output diagnostic information (potentially [*much] output). -These can be statements like +These can be statements, for example: `#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` -placed [*before] the include statement +placed [*before] the `lambert_w` include statement `#include `, @@ -364,14 +304,12 @@ or defined in a jamfile.v2: `BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS` [h4:implementation Implementation] -['First be right, then be fast.] - -There are many previous implementations, each with increasing accuracy and speed. +There are many previous implementations, each with increasing accuracy and/or speed. See __lambert_w_references below. -For most of the range of ['z] arguments, some initial approximation is followed by a single refinement, +For most of the range of ['z] arguments, some initial approximation followed by a single refinement, often using Halley or similar method, gives a useful precision. -For speed, several implementations avoid evaluation of a test using the exponential function, +For speed, several implementations avoid evaluation of a iteration test using the exponential function, estimating that a single refinement step will suffice, but these rarely get to the best result possible. To get a better precision, additional refinements, probably iterative, are needed @@ -379,25 +317,27 @@ for example, using __halley or __schroder methods. For C++, the most precise results possible, closest to the nearest __representable for the C++ type being used, it is usually necessary to use a higher precision type for intermediate computation, -finally casting back to the smaller desired result type. +finally static-casting back to the smaller desired result type. This strategy is used by __Maple and WolframAlpha, for example, using arbitrary precision arithmetic, and some of their high-precision values are used for testing this library. This method is also used to provide __boost_test values using __multiprecision, typically, a 50 decimal digit type like `cpp_dec_float_50` `static_cast` to a `float`, `double` or `long double` type. -For ['z] argument values near the singularity and near zero, other approximations may be used, -possibly followed by refinement or increasing series terms until a desired precision is achieved. +For ['z] argument values near the singularity and near zero, other approximations may be used, +possibly followed by refinement or increasing number of series terms until a desired precision is achieved. At extreme arguments near to zero or the singularity at the branch point, even this fails and the only method to achieve a really close result is to cast from a higher precision type. In practical applications, the increased computation required -(often towards a thousand-fold slower and requiring the additional code for multiprecision) +(often towards a thousand-fold slower and requiring much additional code for __multiprecision) is not justified and the algorithms here do not implement this. -But because the Boost.Lambert_W algorithm has been tested using __multiprecision, +But because the Boost.Lambert_W algorithms has been tested using __multiprecision, users who require this can always easily achieve the nearest representation for the __fundamental_types if the application justifies the very large extra computation cost. +[h5 Evolution of this implementation] + One compact real-only implementation was based on an algorithm by __Luu_thesis, (see routine 11 on page 98 for his Lambert W algorithm) and his Halley refinement is used iteratively when required. @@ -423,7 +363,12 @@ We also considered using __newton method. but concluded that since the Newton-Raphson method takes typically 6 iterations to converge within tolerance, whereas Halley usually takes only 1 to 3 iterations to achieve an result within 1 __ulp, so the Newton-Raphson method is unlikely to be quicker -than the additional cost of computing the 2nd derivative for Halley's method, +than the additional cost of computing the 2nd derivative for Halley's method. + +Halley refinement uses the simplified formulae obtained from +[@http://www.wolframalpha.com/input/?i=%5B2(z+exp(z)-w)+d%2Fdx+(z+exp(z)-w)%5D+%2F+%5B2+(d%2Fdx+(z+exp(z)-w))%5E2+-+(z+exp(z)-w)+d%5E2%2Fdx%5E2+(z+exp(z)-w)%5D Wolfram Alpha] + + [2(z exp(z)-w) d/dx (z exp(z)-w)] / [2 (d/dx (z exp(z)-w))^2 - (z exp(z)-w) d^2/dx^2 (z exp(z)-w)] [h4:compact_implementation Implementing Compact Algorithms] @@ -447,43 +392,81 @@ He has put a lot of work into avoiding any slow transcendental functions by usin bisection, finishing with a single Schroeder refinement, without any check on the precision of the result (necessarily evaluating an expensive exponential). -Theoretical and practical tests confirm that this gives Lambert W estimates +Theoretical and practical tests confirm that Fukushima's algorithm gives Lambert W estimates with a known small error bound (several __ulp) over nearly all the range of ['z] argument. -However, though these give results within several __epsilon of the nearest representable result, -they do not get as close as is very often possible with further refinement, -usually to within one or two __epsilon. A mean difference was computed to express the typical error and is often about 0.5 epsilon, the theoretical minimum. Using the __float_distance, we can also express this as the number of -bits that are different from the nearest representable or 'exact' value. +bits that are different from the nearest representable or 'exact' or 'best' value. +The number and distribution of these few bits differences was studied by binning, including their sign. +Bins for (signed) 0, 1, 2 and 3 and 4 bits proved suitable. -For this implementation of Lambert W-1, John Maddock used the Boost.Math `minimax.exe` __remez method program +However, though these give results within a few __epsilon of the nearest representable result, +they do not get as close as is very often possible with further refinement, +nrealy always to within one or two __epsilon. + +More significantly, the evaluations of the sum of all signed differences using the Fukshima algorithm +show a slight bias, being more likely to be a bit or few below the nearest representation than above; +bias might have unwanted effects on some statistical computations. + +Fukushima's method also does not cover the full range of z arguments of 'float' precision and above. + +For this implementation of Lambert W0, John Maddock used the Boost.Math `minimax.exe` __remez method program to devise a __rational_function for several ranges of argument z for the W0 branch of Lambert W0 function. These minimax rational approximations are combined for an algorithm that is both smaller and faster. -Sadly it has not proved __remez_practical to use the same method for Lambert W-1 branch + +Sadly it has not proved __remez practical to use the same method for Lambert W-1 branch and so the Fukushima algorithm is retained for this branch. -[h5:bias Bias] +An advantage of both minimax rational __remez approximations +is that the [*distribution] from the references value is reasonably random and insignificantly biased. -An advantage of both minimax rational approximations and Halley iterated estimates -is that the [*distribution] from the references value is reasonably random and unbiased, -whereas any using the Schroeder refinement is significantly biased. -Bias might have bad effects on statistical computations. -For example, a test of 5000 values of argument z covering the main range of possible values, -computed using the Fukushima method with Schroeder refinement gave about 1/3 lambert_w0 values that are -one bit different from the best representation, and about 1% that are a few bits 'wrong'. -If a Halley refinement step is added, only 1 in 30 are even one bit different, and none more than one bit 'wrong'. -Starting with the rational approximation method, there is insignificant bias. -Adding a Halley step (or iteration) reduces the number that are one bit different from about a third down to one in 30. -This is unavoidable 'computational noise'. +For example, table below a test of Lambert W0 10000 values of argument z covering the main range of possible values, +10000 comparisons from z = 0.0501 to 703, in 0.001 step factor 1.05 when module 7 == 0 -[h5:lookup_tables. +[table:lambert_w0_Fukushima Fukushima Lambert W0 and typical improvement from a single Halley step. +[[Method] [Exact] [One_bit] [Two_bits] [Few_bits] [inexact] [bias]] +[[Schroeder W0] [8804 ] [ 1154 ] [ 37 ] [ 5 ] [1243 ] [-1193]] +[[after Halley step] [ 9710 ] [ 288 ] [ 2 ] [0] [ 292 ] [22]] +] [/table:lambert_w0_Fukushima W0] -For speed during the bisection, Fukushima computes lookup tables of powers of e and z for integral Lambert W. + +Lambert W0 values computed using the Fukushima method with Schroeder refinement gave about 1/6 lambert_w0 values that are +one bit different from the 'best', and < 1% that are a few bits 'wrong'. +If a Halley refinement step is added, only 1 in 30 are even one bit different, and only 2 two bits 'wrong'. + + +[table:lambert_w0_plus_halley Rational polynomial Lambert W0 and typical improvement from a single Halley step. +[[Method] [Exact] [One_bit] [Two_bits] [Few_bits] [inexact] [bias]] +[[rational/polynomial] [7135] [ 2863 ] [ 2 ] [0] [ 2867 ] [ -59] ] +[[after Halley step ] [ 9724 ] [273] [ 3 ] [0] [ 279 ] [5] ] +] [/table:lambert_w0_plus_halley] + + +With the rational polynomial approximation method, there are a third one bit from the best and none more than two bits. +Adding a Halley step (or iteration) reduces the number that are one bit different from about a third down to one in 30; +this is unavoidable 'computational noise'. +An extra Halley step would double the runtime for a tiny gain and so is not chosen for this implementation, +but remains a option, as detailed above. + +For the Lambert W-1 branch, the Fukushima algorithm is used. + +[table:lambert_wm1_fukushima Lambert W-1 using Fukushima algorithm. +[[Method] [Exact] [One_bit] [Two_bits] [Few_bits] [inexact] [bias]] +[[Fukushima W-1] [ 7167] [2704 ] [ 129 ] [0] [2962 ] [-160]] +[[plus Halley step] [ 7379 ] [ 2529 ] [92 ] [0] [ 2713 ] [ 549]] +] [/table:lambert_wm1_fukushima] + +[/ generated using PAB j:\Cpp\Misc\lambert_w_compare_jm2\lambert_w_compare_jm2.cpp] + +[h5:lookup_tables Lookup tables] + +For speed during the bisection, Fukushima's algorithm computes lookup tables of powers of e and z for integral Lambert W. There are 64 elements in these tables. The FORTRAN version (and the C++ translation by Veberic) computed these (once) as `static` data. This is slower, may cause trouble with multithreading, and -is slightly inaccurate because of rounding errors from repeated(64) multiplications. In this implementation -the array values have been computed using __multiprecision 50 decimal digit +is slightly inaccurate because of rounding errors from repeated(64) multiplications. + +In this implementation the array values have been computed using __multiprecision 50 decimal digit and output as C++ arrays 37 decimal digit `long double` literals using `max_digits10` precision std::cout.precision(std::numeric_limits::max_digits10); @@ -533,26 +516,17 @@ Here we use the first two terms of equation 4.19: T llz = log(lz); guess = lz - llz + (llz / lz); -This gives a useful precision, and this guess can be returned by setting the precision to `digits2 == 11` or less. +This gives a useful precision suitable for Halley refinement. - using boost::math::policies::digits2; - double z = 4.e+29; - r = lambert_w0(z, policy >()); - // lambert_wm1(3.9999999999999997e+29, policy >() ) = 64.001325187470187 - -Similarly, for Lambert W-1 branch, tiny values very near zero, W > 64 cannot be computed using the lookup table. +Similarly, for Lambert W-1 branch, tiny values very near zero, +W > 64 cannot be computed using the lookup table. For this region, an approximation followed by a few (usually 3) Halley refinements. See __lambert_w_wm1_near_zero. -So, as usual, there are compromises to consider between execution speed and accuracy. -This implementation allows users to get closer to zero (W-1) or larger (W0) than Fukushima, -at some small loss of speed (but does not guarantee the nearest representable result) -or to get faster but less precise evaluations controlled by __precision_policy. - For the less well-behaved regions for Lambert W0 ['z] arguments near zero, and near the branch singularity at ['-1/e], some series functions are used. -[h5:small_z Small values of argument z near zero] +[h5:small_z Small values of argument z near zero] When argument ['z] is small and near zero, cancellation errors mean that precision is lost, so other series function variants of `lambert_w0_small_z` are used. @@ -571,13 +545,14 @@ To provide higher precision constants (34 decimal digits) for types larger than InverseSeries[Series[z Exp[z],{z,0,34}]] -were also computed. +were also computed, but for current hardware it was found that evaluating a `double` precision +and then refining with Halley's method was quicker and more accurate. Decimal values of specifications for built-in floating-point types below are 21 digits precision == `std::numeric_limits::max_digits10` for `long double`. Specializations for `lambert_w0_small_z` are provided for -`float`, `double`, `long double`, `float128` and for __multiprecision types like . +`float`, `double`, `long double`, `float128` and for __multiprecision types. The tag_type selection is based on the value `std::numeric_limits::max_digits10` (and [*not] on the floating-point type T). @@ -596,7 +571,7 @@ causing very small differences in computing lambert_w that would be very difficu [warning The use of `doubledouble` types is untested and may give unexpected precision.] As noted in the __lambert_w_implementation section above, -it is only possible ensure the nearest representable value by casting from a higher precision type, +it is only possible to ensure the nearest representable value by casting from a higher precision type, computed at very, very much greater cost. For multiprecision types, first several terms of the series are tabulated and evaluated as a polynomial: @@ -647,7 +622,7 @@ from decimal digit strings like `"3.14"`. (Construction of multiprecision types from built-in floating-point types only provides the precision of the built-in type, like `double`, only 17 decimal digits). -[tip Be exceeding careful not to silently lose precision by constructing multiprecision types from literal decimal types, usually [^double]. See examples.] +[tip Be exceeding careful not to silently lose precision by constructing multiprecision types from literal decimal types, usually [^double]. Use decimal digit strings like "3.1459" instead. See examples.] Fukushima's implementation used 20 series terms; it was confirmed that using more terms does not usefully increase accuracy. @@ -656,41 +631,33 @@ Fukushima's implementation used 20 series terms; it was confirmed that using mor The lookup tables of Fukushima have only 64 elements, so that the z argument nearest zero is -1.0264389699511303e-26, that corresponds to a maximum Lambert W-1 value of 64.0. -His implementation did not cater for z argument values that are smaller (nearer to zero), +Fukushima's implementation did not cater for z argument values that are smaller (nearer to zero), but this implementation adds code to accept smaller (but not denormalised) values of z. A crude approximation for these very small values is to take the exponent and multiply by ln[10] ~= 2.3. We also tried the approximation first proposed by Corless et al. using ln(-z), (equation 4.19 page 349) and then tried improving by a 2nd term -ln(ln(-z)), and finally the ratio term -ln(ln(-z))/ln(-z). For a z very close to z = -1.0264389699511303e-26 when W = 64, when effect of ln(ln(-z) term, and ratio L1/L2 is greatest, -the possible 'guessed' are +the possible 'guesses' are z = -1.e-26, w = -64.02, guess = -64.0277, ln(-z) = -59.8672, ln(-ln(-z) = 4.0921, llz/lz = -0.0684 whereas at the minimum (unnormalized) z -z = -2.2250e-308, w = -714.9, guess = -714.9687, ln(-z) = -708.3964, ln(-ln(-z) = 6.5630, llz/lz = -0.0092 + z = -2.2250e-308, w = -714.9, guess = -714.9687, ln(-z) = -708.3964, ln(-ln(-z) = 6.5630, llz/lz = -0.0092 Although the addition of the 3rd ratio term did not reduce the number of Halley iterations needed, -it allows return of a better low precision estimate [*without any Halley iterations] using the __precision_policy. -For the worst case near w = 64, the error in the 'guess' is 0.008, ratio 0.0001 or 1 in 10,000 digits 10 ~= 4, -so we opt to skip Halley iterations and return the 'guess' if digits2 < 12. +it might allow return of a better low precision estimate [*without any Halley iterations]. +For the worst case near w = 64, the error in the 'guess' is 0.008, ratio 0.0001 or 1 in 10,000 digits 10 ~= 4. Two log evalutations are still needed, but is probably over an order of magnitude faster. Halley's method was then used to refine the estimate of Lambert W-1 from this guess. Experiments showed that although all approximations reached with __ulp of the closest representable value, the computational cost of the log functions was easily paid by far fewer iterations -(typically from 8 down to 4 iterations for double or float). For example: - - using boost::math::policies::digits2; - // Very close to z = -1.0264389699511303e-26 when W = 64, when effect of ln(ln(-z) term and ratio L1/L2 is greatest. - double z = -1e-26; - double r = lambert_wm1(z, policy >()); - // lambert_wm1(-1.0000000000000000e-26) = -64.026509628385895 - +(typically from 8 down to 4 iterations for double or float). [h5:halley Halley refinement] -After obtaining a double approximation, for `double` and quad 128-bit precision, +After obtaining a double approximation, for `double`, `long double` and `quad` 128-bit precision, a single iteration should suffice because Halley iteration should triple the precision with each step (as long as the function is well behaved - and it is), @@ -726,6 +693,16 @@ technique of evaluating reference values using a __multiprecision `cpp_dec_float For extremely small z arguments, near zero, and those extremely near the singularity at the branch point, precision can be much lower, as might be expected. +[@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] +[@../../test/test_lambert_w.cpp test_lambert_w.cpp] contains routine tests using __boost_test. + +Two macros provide optional tests if #defined before BOOST_TEST_MAIN. + +* BOOST_MATH_TEST_MULTIPRECISION Adds test for __multiprecision types. + +* BOOST_MATH_TEST_FLOAT128 Adds test using __float128 type (GCC only, needing gnu++17 and quadmath library). + +* BOOST_MATH_LAMBERT_W_INTEGRALS Adds quadrature tests that cover the whole range of the Lambert W0 function. [h5 Other implementations] @@ -797,6 +774,7 @@ Exact analytical solution for current flow through diode with series resistance. # Cleve Moler, Mathworks blog [@https://blogs.mathworks.com/cleve/2013/09/02/the-lambert-w-function/#bfba4e2d-e049-45a6-8285-fe8b51d69ce7 The Lambert W Function] # Digital Library of Mathematical Function, [@https://dlmf.nist.gov/4.13 Lambert W function]. + [endsect] [/section:lambert_w Lambert W function] [/ diff --git a/example/lambert_w_precision_example.cpp b/example/lambert_w_precision_example.cpp index c9d31095f..0f553a532 100644 --- a/example/lambert_w_precision_example.cpp +++ b/example/lambert_w_precision_example.cpp @@ -1,11 +1,10 @@ -// Copyright Paul A. Bristow 2016. +// Copyright Paul A. Bristow 2016, 2018. // 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). -//! Lambert W examples of controlling precision using Boost.Math policies -//! (and thus also trading less precision for shorter run time). +//! Lambert W examples of controlling precision // #define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for (much) diagnostic output. @@ -37,8 +36,6 @@ using boost::multiprecision::cpp_bin_float_quad; // using boost::math::lambert_wm1; #include -// using std::cout; -// using std::endl; #include #include #include @@ -59,7 +56,6 @@ int main() // Error handling policy examples. using namespace boost::math::policies; - using boost::math::policies::make_policy; using boost::math::policies::policy; using boost::math::policies::evaluation_error; @@ -68,510 +64,96 @@ int main() using boost::math::policies::domain_error; using boost::math::policies::throw_on_error; - // Define an error handling policy: - // typedef policy< - // domain_error, - // overflow_error - // > throw_policy; +//[lambert_w_precision_0 + std::cout.precision(std::numeric_limits::max_digits10); // Show all potentially significant decimal digits, + std::cout << std::showpoint << std::endl; // and show any significant trailing zeros too. - //float x = 0.3F; - // std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.00990147 - // std::cout << "\nLambert W (" << x << ") = " << lambert_w0(x, throw_policy()) << std::endl; - // std::cout << "Lambert W (" << x << ") = " << lambert_w(x, throw_policy()) << std::endl; + double x = 10.; + std::cout << "Lambert W (" << x << ") = " << lambert_w0(x) << std::endl; + // - // Examples of controlling precision using policies. - using boost::math::policies::policy; - using boost::math::policies::precision; - using boost::math::policies::digits10; - using boost::math::policies::digits2; - // Creating a policy using an integer literal. - // typedef policy > my_pol_3_dec; // Define a new, non-default, policy to calculate to accuracy of approximately 3 decimal digits. - // Creating a policy using an integer variable (must be const integral, usually const int !). - // "a variable with non-static storage duration cannot be used as a non-type argument" - - // typedef policy > my_pol_3_dec; - // Define a new, non-default, policy to calculate to accuracy of approximately 3 decimal digits. - const int decimal_digits = 3; - typedef policy > my_pol_3_dec; // Define a custom, non-default, policy to calculate to accuracy of approximately 3 decimal digits. - - std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; - - std::cout.precision(std::numeric_limits::max_digits10); - double x = 1.; - std::cout << "lambert_w0(x, my_pol_3_dec()) = " << lambert_w0(x, my_pol_3_dec()) <<"\n" << std::endl; // = 0.56714329040978395 - - // Can also specify precision using bits, for example: - typedef policy > my_prec_11_bits; // Policy to require only approximately 11 bits of precision. - - std::cout << "lambert_w0(x, my_prec_11_bits()) = " << lambert_w0(x, my_prec_11_bits()) <<"\n" << std::endl; // 0.56714329040978395 - - { // Show various precisions that show varying improvements. - // Specify precision as n bits, base-2, policy >() - - std::cout << std::setprecision(3) - << "\nstd::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() - << "\nstd::numeric_limits::digits = " << std::numeric_limits::digits - << "\nstd::numeric_limits::digits10 = " << std::numeric_limits::digits10 - << "\nstd::numeric_limits::max_digits10 = " << std::numeric_limits::max_digits10 - << std::endl; - -////[lambert_w_precision_0 -// float z(10.F); -// float r = 0; -// std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant decimal digits. -// std::cout << std::showpoint << std::endl; // Show any trailing zeros. -// -// r = lambert_w0(z, policy >()); // -// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.000000000 (nearest using lookup). -// -// r = lambert_w0(z, policy >()); // // Just using bisection. -// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.566406250 (nearest using bisection). -// -// r = lambert_w0(z, policy >()); // digits10 = 6, digits2 = 22 - so just using Schroeder refinement. -// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.567143261 -// -// // Can also specify precision as decimal base-10 digits using policy >(). -// r = lambert_w0(z, policy >()); // digits10 = 5, digits2 = 22 Using Schroeder. -// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.567143261 -// -// r = lambert_w0(z, policy >()); // digits10 = 7, digits2 = 23 - so using Halley as well (but no improvement). -// std::cout << "lambert_w0(z, policy >()) = " << r << std::endl; // 0.567143261 -// -// r = lambert_w0(z, policy<>()); // Default policy (using lookup, bisection, Schroeder, and Halley). -// std::cout << "lambert_w0(z, policy<>()) = " << r << std::endl; // 0.567143261 -// -////] [/lambert_w_precision_0] +//] [/lambert_w_precision_0] /* //[lambert_w_precision_output_0 - lambert_w0(z, policy >()) = 0.000000000 // Nearby integer is zero from lookup table. - lambert_w0(z, policy >()) = 0.566406250 // Just using bisection from lookup integral values. - lambert_w0(z, policy >()) = 0.567143261 // digits10 = 6, digits2 = 22 - so using Schroeder refinement. - lambert_w0(z, policy >()) = 0.567143261 // digits10 = 5, digits2 = 19 Using Schroeder. - lambert_w0(z, policy >()) = 0.567143261 // digits10 = 7, digits2 = 23 - so using Halley as well (but no improvement). - lambert_w0(z, policy<>()) = 0.567143261 + //] [/lambert_w_precision_output_0] */ - } - - { - // Test evaluation of Lambert W at varying precisions specified using a policy with digits10 increasing from 1 to 9. - // For float this covers the full precision range as max_digits10 = 9. - float z = 10.F; - std::cout << "\nTest evaluation of float Lambert W (" << z << ") at varying precisions" - "\nspecified using a policy with digits10 increasing from 1 to 9. " - << std::endl; //[lambert_w_precision_1 - std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " - << std::numeric_limits::epsilon() << std::endl; - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Lambert W (" << z << ", digits10<0>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<1>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<2>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<3>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<4>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<5>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<6>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<7>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<8>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits10<9>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; + using boost::math::lambert_w_detail::lambert_w_halley_step; + + double z = 10.; + double w = lambert_w0(z); + std::cout << "Lambert W (" << x << ") = " << lambert_w0(z) << std::endl; + double ww = lambert_w_halley_step(lambert_w0(z), z); + std::cout << "Lambert W (" << x << ") = " << lambert_w_halley_step(lambert_w0(z), z) << std::endl; + + std::cout << "difference from Halley step " << w - ww << std::endl; //] [/lambert_w_precision_1] /* //[lambert_w_precision_output_1 - Test evaluation of float Lambert W at varying precisions - specified using a policy with digits10 increasing from 1 to 9. - std::numeric_limits::epsilon() = 1.19e-07 - z = 1.F - note that gets to 'exact' result immediately using Schroeder refinement, - so no advantage using Halley. - - Lambert W (1.00000000, digits10<1>) = 0.000000000 << using lookup. - Lambert W (1.00000000, digits10<2>) = 0.000000000 << using lookup and bisection. - Lambert W (1.00000000, digits10<3>) = 0.567143261 << Schroeder refinement, and is sufficient. - Lambert W (1.00000000, digits10<4>) = 0.567143261 - Lambert W (1.00000000, digits10<5>) = 0.567143261 << Halley refinement, but no improvement. - Lambert W (1.00000000, digits10<6>) = 0.567143261 - Lambert W (1.00000000, digits10<7>) = 0.567143261 - Lambert W (1.00000000, digits10<8>) = 0.567143261 - Lambert W (1.00000000, digits10<9>) = 0.567143261 - Lambert W (1.00000000) = 0.567143261 //] [/lambert_w_precision_output_1] // z = 10.F needs Halley to get the last bit or two correct. //[lambert_w_precision_output_1a - z = 10.F needs Halley to get the last bit or two correct. - Lambert W (10.0000000, digits10<1>) = 1.35914087 << bisection. - Lambert W (10.0000000, digits10<2>) = 1.35914087 - Lambert W (10.0000000, digits10<3>) = 1.74552798 << Schroeder refinement. - Lambert W (10.0000000, digits10<4>) = 1.74552798 - Lambert W (10.0000000, digits10<5>) = 1.74552798 - Lambert W (10.0000000, digits10<6>) = 1.74552810 << Halley refinement. - Lambert W (10.0000000, digits10<7>) = 1.74552810 - Lambert W (10.0000000, digits10<8>) = 1.74552810 - Lambert W (10.0000000, digits10<9>) = 1.74552810 - Lambert W (10.0000000) = 1.74552810 //] [/lambert_w_precision_output_1a] */ - } - { // similar example using float but specifying with digits2 + + // Similar example using cpp_bin_float_quad (128-bit floating-point types). - float z = 10.; - std::cout << "\nTest evaluation of float Lambert W (" << z << ") at varying precisions" - "\nspecified using a policy with (base_2) digits increasing from 1 to 24. " - << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::digits = " << std::numeric_limits::digits << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Lambert W (" << z << ", digits2<0> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<1> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<2> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<3> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<4> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<5> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<6> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<7> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<8> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<9> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<10>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<11>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<12>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<13>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<14>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<15>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<16>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<17>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<18>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<19>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<20>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<21>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<22>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<23>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<24>) = " << lambert_w0(z, policy >()) << std::endl; + cpp_bin_float_quad zq = 10.; + std::cout << "\nTest evaluation of cpp_bin_float_quad Lambert W(" << zq << ")" + << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::digits = " << std::numeric_limits::digits << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::max_digits10 = " << std::numeric_limits::max_digits10 << std::endl; + std::cout << std::setprecision(3) << "std::numeric_limits::digits10 = " << std::numeric_limits::digits10 << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + // All are same precision because double precision first approximation used before Halley. - std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; // Default policy. - - /* This example shows a tiny improvement using Halley after Schroeder. - Lambert W (10.0000000, digits2<1>) = 1.35914087 - Lambert W (10.0000000, digits2<2>) = 1.35914087 - Lambert W (10.0000000, digits2<3>) = 1.35914087 - Lambert W (10.0000000, digits2<4>) = 1.35914087 - Lambert W (10.0000000, digits2<5>) = 1.35914087 - Lambert W (10.0000000, digits2<6>) = 1.35914087 - Lambert W (10.0000000, digits2<7>) = 1.35914087 - Lambert W (10.0000000, digits2<8>) = 1.35914087 - Lambert W (10.0000000, digits2<9>) = 1.35914087 - Lambert W (10.0000000, digits2<10>) = 1.74414063 << Bisection. - Lambert W (10.0000000, digits2<11>) = 1.74552798 << Schroeder. - Lambert W (10.0000000, digits2<12>) = 1.74552798 - Lambert W (10.0000000, digits2<13>) = 1.74552798 - Lambert W (10.0000000, digits2<14>) = 1.74552798 - Lambert W (10.0000000, digits2<15>) = 1.74552798 - Lambert W (10.0000000, digits2<16>) = 1.74552798 - Lambert W (10.0000000, digits2<17>) = 1.74552798 - Lambert W (10.0000000, digits2<18>) = 1.74552798 - Lambert W (10.0000000, digits2<19>) = 1.74552798 - Lambert W (10.0000000, digits2<20>) = 1.74552798 - Lambert W (10.0000000, digits2<21>) = 1.74552798 - Lambert W (10.0000000, digits2<22>) = 1.74552810 << Halley. - Lambert W (10.0000000, digits2<23>) = 1.74552810 - Lambert W (10.0000000, digits2<24>) = 1.74552810 - Lambert W (10.0000000) = 1.74552810 << default policy precision. - */ - } - - { // Similar example using double but specifying with digits2. - double z = 10.; - std::cout << "\nTest evaluation of double Lambert W (" << z << ") at varying precisions" - "\nspecified using a policy with (base_2) digits increasing from 1 to 54. " - << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::digits = " << std::numeric_limits::digits << std::endl; - - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Lambert W (" << z << ", digits2<1> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<2> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<3> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<4> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<5> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<6> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<7> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<8> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<9> ) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<10>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<11>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<12>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<13>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<14>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<15>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<16>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<17>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<18>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<19>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<20>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<21>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<22>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<23>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<24>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<25>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<26>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<27>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<28>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<29>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<30>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<31>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<32>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<33>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<34>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<35>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<36>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<37>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<38>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<39>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<40>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<41>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<42>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<43>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<44>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<45>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<46>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<47>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<48>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<49>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<50>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<51>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<52>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<53>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<54>) = " << lambert_w0(z, policy >()) << std::endl; - - std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; // Default policy. - - /* - Test evaluation of double Lambert W at varying precisions - specified using a policy with (base_2) digits increasing from 1 to 54. - std::numeric_limits::epsilon() = 2.22e-16 - Lambert W (10.000000000000000, digits2<1>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<2>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<3>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<4>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<5>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<6>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<7>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<8>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<9>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<10>) = 1.7441406250000000 - Lambert W (10.000000000000000, digits2<11>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<12>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<13>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<14>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<15>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<16>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<17>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<18>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<19>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<20>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<21>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<22>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<23>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<24>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<25>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<26>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<27>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<28>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<29>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<30>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<31>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<32>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<33>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<34>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<35>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<36>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<37>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<38>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<39>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<40>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<41>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<42>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<43>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<44>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<45>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<46>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<47>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<48>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<49>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<50>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<51>) = 1.7455280027406992 - Lambert W (10.000000000000000, digits2<52>) = 1.7455280027406992 - Lambert W (10.000000000000000, digits2<53>) = 1.7455280027406992 - Lambert W (10.000000000000000, digits2<54>) = 1.7455280027406992 - Lambert W (10.000000000000000) default = 1.7455280027406992 - - // cpp_dec_float_50 reference value: - lambert_w0(10.000000000000000) = 1.7455280027406993830743012648753899115352881290809 + /* */ - } - { // Similar example using cpp_bin_float_quad (128-bit floating-point types). - // multiprecision type to show use of Schroeder double approximation before Halley refinement. - // Specifying precision with digits2 not digits10. - cpp_bin_float_quad z = 10.; - std::cout << "\nTest evaluation of cpp_bin_float_quad Lambert W(" << z << ") at varying precisions" - "\nspecified using a policy with (base_2) digits increasing from 1 to 54. " - << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::digits = " << std::numeric_limits::digits << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::epsilon() = " << std::numeric_limits::epsilon() << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::max_digits10 = " << std::numeric_limits::max_digits10 << std::endl; - std::cout << std::setprecision(3) << "std::numeric_limits::digits10 = " << std::numeric_limits::digits10 << std::endl; - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Lambert W (" << z << ", digits2<1>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<2>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "..." << std::endl; - std::cout << "Lambert W (" << z << ", digits2<52>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<53>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ", digits2<54>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "..." << std::endl; - std::cout << "Lambert W (" << z << ", digits2<113>) = " << lambert_w0(z, policy >()) << std::endl; - std::cout << "Lambert W (" << z << ") default = " << lambert_w0(z) << std::endl; // Default policy. - // All are same precision because double precision first approximation used before Halley. + { // Reference value for lambert_w0(10) + cpp_dec_float_50 z("10"); + cpp_dec_float_50 r; + std::cout.precision(std::numeric_limits::digits10); + r = lambert_w0(z); // Default policy. + std::cout << "lambert_w0(z) cpp_dec_float_50 = " << r << std::endl; // 0.56714329040978387299996866221035554975381578718651 + std::cout.precision(std::numeric_limits::max_digits10); - /* + std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (max_digits10(" << std::numeric_limits::max_digits10 << + " ) = " << static_cast(r) << std::endl; // 1.7455280027406993830743012648753899115352881290809 + std::cout.precision(std::numeric_limits::digits10); // 1.745528002740699383074301264875389837 + std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (digits10(" << std::numeric_limits::digits10 << + " ) = " << static_cast(r) << std::endl; // 1.74552800274069938307430126487539 + std::cout.precision(std::numeric_limits::digits10 + 1); // - Test evaluation of cpp_bin_float_quad Lambert W at varying precisions - specified using a policy with (base_2) digits increasing from 1 to 113. - std::numeric_limits::epsilon() = 1.93e-34 - Lambert W (10.00000000000000000000000000000000000, digits2<1>) = 1.745528002740699383074301264875390030 - Lambert W (10.00000000000000000000000000000000000, digits2<2>) = 1.745528002740699383074301264875390030 - ... - Lambert W (10.00000000000000000000000000000000000) default = 1.745528002740699383074301264875390030 - lambert_w0(z) cpp_dec_float_50 = 1.7455280027406993830743012648753899115352881290809 // For comparison. + std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (digits10(" << std::numeric_limits::digits10 << + " ) = " << static_cast(r) << std::endl; // 1.74552800274069938307430126487539 - */ + // [N[productlog[10], 50]] == 1.7455280027406993830743012648753899115352881290809 + + // [N[productlog[10], 37]] == 1.745528002740699383074301264875389912 + // [N[productlog[10], 34]] == 1.745528002740699383074301264875390 + // [N[productlog[10], 33]] == 1.74552800274069938307430126487539 + + // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.745528002740699383074301264875389837 + + // lambert_w0(z) cpp_dec_float_50 = 1.7455280027406993830743012648753899115352881290809 + // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.745528002740699383074301264875389837 + // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.74552800274069938307430126487539 } - { // Reference value for lambert_w(1) - cpp_dec_float_50 z("10"); - cpp_dec_float_50 r; - std::cout.precision(std::numeric_limits::digits10); - r = lambert_w0(z); // Default policy. - std::cout << "lambert_w0(z) cpp_dec_float_50 = " << r << std::endl; // 0.56714329040978387299996866221035554975381578718651 - std::cout.precision(std::numeric_limits::max_digits10); - - std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (max_digits10(" << std::numeric_limits::max_digits10 << - " ) = " << static_cast(r) << std::endl; // 1.7455280027406993830743012648753899115352881290809 - std::cout.precision(std::numeric_limits::digits10); // 1.745528002740699383074301264875389837 - std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (digits10(" << std::numeric_limits::digits10 << - " ) = " << static_cast(r) << std::endl; // 1.74552800274069938307430126487539 - std::cout.precision(std::numeric_limits::digits10 +1); // - - std::cout << "lambert_w0(z) cpp_dec_float_50 cast to quad (digits10(" << std::numeric_limits::digits10 << - " ) = " << static_cast(r) << std::endl; // 1.74552800274069938307430126487539 - - // [N[productlog[10], 50]] == 1.7455280027406993830743012648753899115352881290809 - - // [N[productlog[10], 37]] == 1.745528002740699383074301264875389912 - // [N[productlog[10], 34]] == 1.745528002740699383074301264875390 - // [N[productlog[10], 33]] == 1.74552800274069938307430126487539 - - // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.745528002740699383074301264875389837 - - // lambert_w0(z) cpp_dec_float_50 = 1.7455280027406993830743012648753899115352881290809 - // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.745528002740699383074301264875389837 - // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.74552800274069938307430126487539 - - - } - - - // Examples of values near singularity when only a final Halley refinement is available. - - //using boost::math::detail::lambert_w_singularity_series; - //std::cout << series(z) << std::endl; - - //std::cout << lambert_w_singularity_series(z) << std::endl; - - /* - 1> Lambert W example single spot tests! - 1> epsilon 2.2204460492503131e-16 - 1> digits2 53 - 1> digits10 15 - 1> digits () 53 - 1> Lambert W (0.29999999999999999) = 0.23675531078855933 - 1> epsilon 3.814697265625e-06 - 1> digits2 19 - 1> digits10 5 - 1> digits () 53 - 1> Lambert W (0.29999999999999999) = 0.2367553107885593 - - - for (double xd = 0.001; xd < 1e20; xd *= 10) - { - - // 1. 0.56714329040978387 - // 0.56714329040978384 - - // 10 1.7455280027406994 - // 1.7455280027406994 - - // 100 3.3856301402900502 - // 3.3856301402900502 - // 1000 5.2496028524015959 - // 5.249602852401596227126056319697306282521472386059592844451465483991362228320942832739693150854347718 - - // 1e19 40.058769161984308 - // 40.05876916198431163898797971203180915622644925765346546858291325452428038208071849105889199253335063 - std::cout << "Lambert W (" << xd << ") = " << lambert_w(xd) << std::endl; // - - - 1> Iteration #0, w0 0.0099072820916067030, w1 = 0.0099014738435951096, difference = -5.8082480115934088e-06, relative 0.00058660438873459064, float distance = 3415046080725.0000 - 1> f'(x) = 5.8082144415180436e-06, f''(x) = -5.8082480115936214e-06 - 1> Iteration #1, w0 0.0099014738435951096, w1 = 0.0099014738435950107, difference = -9.8879238130678004e-17, relative 9.9920072216264089e-15, float distance = 58.000000000000000 - 1> f'(x) = 9.8645911007260505e-17, f''(x) = -9.8645911007260505e-17 - 1> Iteration #2, w0 0.0099014738435950107, w1 = 0.0099014738435950125, difference = 1.7347234759768071e-18, relative -2.2204460492503131e-16, float distance = 1.0000000000000000 - 1> f'(x) = -1.7007915690906991e-18, f''(x) = 1.7007915690906991e-18 - 1> - 1> Return refined 0.0099014738435950125 after 3 iterations, difference = -2.2204460492503131e-16, Float distance = 1.0000000000000000 - 1> Lambert W (0.010000000000000000) = 0.0099014738435950125 - - - 1> Iteration #0, w0 0.091722597168998055, w1 = 0.091276527200431806, difference = -0.00044606996856624836, relative 0.0048870173115453941, float distance = 38445375960087.000 - 1> f'(x) = 0.00044587943029702348, f''(x) = -0.00044606996856624685 - 1> Iteration #1, w0 0.091276527200431806, w1 = 0.091276527160862264, difference = -3.9569542087392051e-11, relative 4.3351278122827352e-10, float distance = 3408918.0000000000 - 1> f'(x) = 3.9569548190331561e-11, f''(x) = -3.9569548191831827e-11 - 1> Iteration #2, w0 0.091276527160862264, w1 = 0.091276527160862264, exact. - 1> f'(x) = 0.00000000000000000, f''(x) = -0.00000000000000000 - 1> - - - 1> Iteration #0, w0 0.87095897919507137, w1 = 0.85260701286390628, difference = -0.018351966331165093, relative 0.021524531295515459, float distance = 182161642476426.00 - 1> f'(x) = 0.018097151008287501, f''(x) = -0.018351966331165141 - 1> Iteration #1, w0 0.85260701286390628, w1 = 0.85260550201372554, difference = -1.5108501807414854e-06, relative 1.7720389760000899e-06, float distance = 14784835581.000000 - 1> f'(x) = 1.5108484233744529e-06, f''(x) = -1.5108501807757508e-06 - 1> Iteration #2, w0 0.85260550201372554, w1 = 0.85260550201372554, exact. - 1> f'(x) = 0.00000000000000000, f''(x) = -0.00000000000000000 - 1> - 1> Return refined 0.85260550201372554 after 3 iterations, exact. - 1> Lambert W (2.0000000000000000) = 0.85260550201372554 - - 1> Iteration #0, w0 0.87095897919507137, w1 = 0.85260701286390628, difference = -0.018351966331165093, relative 0.021524531295515459, float distance = 182161642476426.00 - 1> f'(x) = 0.018097151008287501, f''(x) = -0.018351966331165141 - 1> Iteration #1, w0 0.85260701286390628, w1 = 0.85260550201372554, difference = -1.5108501807414854e-06, relative 1.7720389760000899e-06, float distance = 14784835581.000000 - 1> f'(x) = 1.5108484233744529e-06, f''(x) = -1.5108501807757508e-06 - 1> Iteration #2, w0 0.85260550201372554, w1 = 0.85260550201372554, exact. - 1> f'(x) = 0.00000000000000000, f''(x) = -0.00000000000000000 - 1> - 1> Return refined 0.85260550201372554 after 3 iterations, exact. - 1> Lambert W (2.0000000000000000) = 0.85260550201372554 - - } - */ - + // std::cout << "Lambert W (" << xd << ") = " << lambert_w0(xd) << std::endl; // } catch (std::exception& ex) { @@ -580,435 +162,9 @@ int main() } // int main() /* - BOOST_CHECK_CLOSE_FRACTION(lambert_w(BOOST_MATH_TEST_VALUE(RealType, 0.01)), - BOOST_MATH_TEST_VALUE(RealType, 0.0099014738435950118853363268165701079536277464949174), - // Output from https://www.wolframalpha.com/input/ N[lambert_w[0.01],50]) - tolerance * 25); // <<< Needs a much bigger tolerance??? - // 0.0099014738435951096 this test max_digits10 - // 0.00990147384359511 digits10 - // 0.0099014738435950118 wolfram - // 0.00990147384359501 wolfram digits10 - // 0.0099014738435950119 N[lambert_w[0.01],17] - // 0.00990147384359501 N[lambert_w[0.01],15] which really is more different than expected. - - // 0.00990728209160670 approx - // 0.00990147384359511 previous - - after allowing iterations, get the Wolfram result - - x = 0.0100000000000000, 1st approximation = 0.00990728209160670 - 1> Iteration #0, w0 0.00990728209160670, w1 = 0.00990147384359511, difference = 0.000586604388734591, relative 0.000586604388734591 - 1> f'(x) = 5.80821444151804e-06, f''(x) = -5.80824801159362e-06 - 1> Iteration #1, w0 0.00990147384359511, w1 = 0.00990147384359501, difference = 9.99200722162641e-15, relative 9.99200722162641e-15 - 1> f'(x) = 9.86459110072605e-17, f''(x) = -9.86459110072605e-17 - 1> Iteration #2, w0 0.00990147384359501, w1 = 0.00990147384359501, difference = -2.22044604925031e-16, relative -2.22044604925031e-16 - 1> f'(x) = -1.70079156909070e-18, f''(x) = 1.70079156909070e-18 - 1> Estimate 0.00990147384359501 refined after 2 iterations. - 1> Exact. - 1> Lambert W (0.0100000000000000) = 0.00990147384359501 - - - using float_distance < 2 - - x = 0.0100000000000000, 1st approximation = 0.00990728209160670 - 1> Iteration #0, w0 0.00990728209160670, w1 = 0.00990147384359511, difference = 0.000586604388734591, relative 0.000586604388734591 - 1> f'(x) = 5.80821444151804e-06, f''(x) = -5.80824801159362e-06 - 1> Iteration #1, w0 0.00990147384359511, w1 = 0.00990147384359501, difference = 9.99200722162641e-15, relative 9.99200722162641e-15 - 1> f'(x) = 9.86459110072605e-17, f''(x) = -9.86459110072605e-17 - 1> Estimate 0.00990147384359501 refined after 1 iterations. - 1> diff = -1.73472347597681e-18, relative 0.000000000000000 - 1> Lambert W (0.0100000000000000) = 0.00990147384359501 - */ - - /* - - Output: - - 1> Lambert W example single spot tests! - 1> epsilon 0.03125 - 1> Lambert W (0.300000012, digits10<1>) = 0.239290372 - - 1> epsilon 0.00390625 - 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 - 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 - - 1> Lambert W (0.300000012, digits10<2>) = 0.236755311 - 1> epsilon 0.000244140625 - 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 - 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 - - 1> Lambert W (0.300000012, digits10<3>) = 0.236755311 - 1> epsilon 3.05175781e-05 - 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 - 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 - - 1> Lambert W (0.300000012, digits10<4>) = 0.236755311 - 1> epsilon 3.81469727e-06 - 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 - 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 - 1> Iteration #2, w0 0.236755311, w1 = 0.236755326, difference = 1.49011612e-08, relative -5.96046448e-08, float distance = 1 - 1> f'(x) = -1.90171221e-08, f''(x) = 1.90171221e-08 - 1> - 1> Return refined 0.236755326 after 2 iterations, difference = -5.96046448e-08, Float distance = 1 - - 1> Lambert W (0.300000012, digits10<5>) = 0.236755326 - 1> epsilon 2.38418579e-07 - 1> Iteration #1, w0 0.239290372, w1 = 0.236755311, difference = -0.00253506005, relative 0.0107074976, float distance = 133610 - 1> f'(x) = 0.00252926024, f''(x) = -0.00253505306 - 1> Iteration #2, w0 0.236755311, w1 = 0.236755326, difference = 1.49011612e-08, relative -5.96046448e-08, float distance = 1 - 1> f'(x) = -1.90171221e-08, f''(x) = 1.90171221e-08 - 1> - 1> Return refined 0.236755326 after 2 iterations, difference = -5.96046448e-08, Float distance = 1 - - 1> Lambert W (0.300000012, digits10<6>) = 0.236755326 - 1> epsilon 1.1920929e-07 - - 1> Lambert W (0.300000012, digits10<7>) = 0.239290372 - 1> epsilon 1.1920929e-07 - - 1> Lambert W (0.300000012, digits10<8>) = 0.239290372 - 1> epsilon 1.1920929e-07 - - 1> Lambert W (0.300000012, digits10<9>) = 0.239290372 - */ - - - /* - 1> std::numeric_limits::epsilon() = 1.19209290e-07 - 1> Lambert_w argument = 10.0000000 - 1> Argument Type = float - 1> digits10 = 1, digits2 = 5 - 1> Result Integer W between g[0] = 0.000000000 < 10.0000000 < 2.71828175 = g[1], bisect 1.35914087 - 1> - 1> Lambert_w argument = 10.0000000 - 1> Argument Type = float - 1> digits10 = 3, digits2 = 10 - 1> Result Bisection = 1.74414063 - 1> - 1> Lambert_w argument = 10.0000000 - 1> Argument Type = float - 1> digits10 = 6, digits2 = 22 - 1> Result Schroeder refinement = 1.74552798 - 1> - 1> Lambert_w argument = 10.0000000 - 1> Argument Type = float - 1> digits10 = 6, digits2 = 23 - 1> Result Halley refinement = 1.74552810 - 1> - 1> Lambert_w argument = 10.0000000 - 1> Argument Type = float - 1> digits10 = 7, digits2 = 24 - 1> Result Halley refinement = 1.74552810 - - 1> - 1> std::numeric_limits::epsilon() = 1.19209290e-07 - 1> Lambert_w argument = 10.000000000000000 - 1> Argument Type = double - 1> digits10 = 1, digits2 = 5 - 1> Result Integer W bisection between g[0] = 0.00000000000000000 < 10.000000000000000 < 2.7182818284590451 = g[1], bisect 1.3591409142295225 - 1> - 1> Lambert_w argument = 10.000000000000000 - 1> Argument Type = double - 1> digits10 = 3, digits2 = 10 - 1> Result Bisection = 1.7441406250000000 - 1> - 1> Lambert_w argument = 10.000000000000000 - 1> Argument Type = double - 1> digits10 = 6, digits2 = 22 - 1> Result Schroeder refinement = 1.7455280027406996 - 1> - 1> Lambert_w argument = 10.000000000000000 - 1> Argument Type = double - 1> digits10 = 6, digits2 = 23 - 1> Result Halley refinement = 1.7455280027406994 - 1> - 1> Lambert_w argument = 10.000000000000000 - 1> Argument Type = double - 1> digits10 = 15, digits2 = 53 - 1> Result Halley refinement = 1.7455280027406994 - - Codeblocks long double - - Lambert W example single spot tests! - - std::numeric_limits::epsilon() = 1.19209290e-007 - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 1, digits2 = 5 - Result Integer W bisection between g[0] = 0.00000000000000000000 < 10.0000000000000000000 < 2.71828182845904523543 = g[1], - bisect = 1.35914091422952261771 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 3, digits2 = 10 - Result Bisection = 1.74414062500000000000 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 6, digits2 = 22 - Result Schroeder refinement = 1.74552800274069937864 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 6, digits2 = 23 - Result Halley refinement = 1.74552800274069938309 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 19, digits2 = 64 - Result Halley refinement = 1.74552800274069938309 - - - Process returned 0 (0x0) execution time : 0.079 s - Press any key to continue. - - - After Halley reordering - - Lambert W example single spot tests! - - std::numeric_limits::epsilon() = 1.19209290e-007 - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 2, digits2 = 9 - Result Integer W bisection between g[0] = 0.00000000000000000000 < 10.0000000000000000000 < 2.71828182845904523543 = g[1], - bisect mean = 1.35914091422952261771 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 3, digits2 = 10 - Result Bisection = 1.74414062500000000000 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 6, digits2 = 21 - Result Schroeder refinement = 1.74552800274069937864 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 5, digits2 = 19 - Result Schroeder refinement = 1.74552800274069937864 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 6, digits2 = 23 - Result Schroeder refinement = 1.74552800274069937864 - - Lambert_w argument = 10.0000000000000000000 - Argument Type = e, max_digits10 = 21, epsilon = 1.08420217248550443401e-019 - digits10 = 19, digits2 = 64 - w = 1.74552800274069937864, z = 10.0000000000000000000, exp(w) = 5.72892556538694148333, diff = -6.93889390390722837765e-017 - 1 Halley iterations. - Distance = 41 - Result Halley refinement = 1.74552800274069938309 - - - Process returned 0 (0x0) execution time : 0.070 s - Press any key to continue. - - - 14 Aug 2017 using merged #include - - lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Release\lambert_w_pb_precision.exe - - lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Release\lambert_w_pb_precision.exe - lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Release\lambert_w_pb_precision.pdb (Full PDB) - Lambert W examples of precision control. - - std::numeric_limits::epsilon() = 2.22e-16 - lambert_w0(x, my_pol_3_dec()) = 0.567 - - lambert_w0(x, my_prec_10_bits()) = 0.566 - - lambert_w0(z, policy >()) = 0.000 - lambert_w0(z, policy >()) = 0.566 - lambert_w0(z, policy >()) = 0.567 - lambert_w0(z, policy >()) = 0.567 - lambert_w0(z, policy >()) = 0.567 - - Test evaluation of float Lambert W at varying precisions specified using a policy with digits10 increasing from 1 to 9. - std::numeric_limits::epsilon() = 1.19e-07 - Lambert W (10.0000000, digits10<1>) = 1.35914087 - Lambert W (10.0000000, digits10<2>) = 1.35914087 - Lambert W (10.0000000, digits10<3>) = 1.74552798 - Lambert W (10.0000000, digits10<4>) = 1.74552798 - Lambert W (10.0000000, digits10<5>) = 1.74552798 - Lambert W (10.0000000, digits10<6>) = 1.74552810 - Lambert W (10.0000000, digits10<7>) = 1.74552810 - Lambert W (10.0000000, digits10<8>) = 1.74552810 - Lambert W (10.0000000, digits10<9>) = 1.74552810 - Lambert W (10.0000000) = 1.74552810 - - Test evaluation of double Lambert W at varying precisions specified using a policy with digits10 increasing from 1 to 24. - std::numeric_limits::epsilon() = 2.22e-16 - Lambert W (10.000000000000000, digits2<1>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<2>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<3>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<4>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<5>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<6>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<7>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<8>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<9>) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<10>) = 1.7441406250000000 - Lambert W (10.000000000000000, digits2<11>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<12>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<13>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<14>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<15>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<16>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<17>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<18>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<19>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<20>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<21>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<22>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<23>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<24>) = 1.7455280027406996 - Lambert W (10.000000000000000) = 1.7455280027406992 - lambert_w0(z) = 1.7455280027406993830743012648753899115352881290809 - - - 30 Aug 2017 - - lambert_w_pb_precision.cpp - lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Debug\lambert_w_pb_precision.exe - lambert_w_pb_precision.vcxproj -> J:\Cpp\Misc\x64\Debug\lambert_w_pb_precision.pdb (Partial PDB) - Lambert W examples of precision control. - - std::numeric_limits::epsilon() = 2.22e-16 - lambert_w0(x, my_pol_3_dec()) = 0.56714329040978395 - - lambert_w0(x, my_prec_11_bits()) = 0.56714329040978395 - - - std::numeric_limits::epsilon() = 1.19e-07 - std::numeric_limits::digits = 24 - std::numeric_limits::digits10 = 6 - std::numeric_limits::max_digits10 = 9 - lambert_w0(z, policy >()) = 0.000000000 - lambert_w0(z, policy >()) = 0.566406250 - lambert_w0(z, policy >()) = 0.567143261 - lambert_w0(z, policy >()) = 0.567143261 - lambert_w0(z, policy >()) = 0.567143261 - lambert_w0(z, policy<>()) = 0.567143261 - - Test evaluation of float Lambert W at varying precisions - specified using a policy with digits10 increasing from 1 to 9. - std::numeric_limits::epsilon() = 1.19e-07 - Lambert W (1.00000000, digits10<1>) = 0.000000000 - Lambert W (1.00000000, digits10<2>) = 0.000000000 - Lambert W (1.00000000, digits10<3>) = 0.567143261 - Lambert W (1.00000000, digits10<4>) = 0.567143261 - Lambert W (1.00000000, digits10<5>) = 0.567143261 - Lambert W (1.00000000, digits10<6>) = 0.567143261 - Lambert W (1.00000000, digits10<7>) = 0.567143261 - Lambert W (1.00000000, digits10<8>) = 0.567143261 - Lambert W (1.00000000, digits10<9>) = 0.567143261 - Lambert W (1.00000000) default = 0.567143261 - - Test evaluation of float Lambert W at varying precisions - specified using a policy with (base_2) digits increasing from 1 to 24. - std::numeric_limits::epsilon() = 1.19e-07 - Lambert W (10.0000000, digits2<1> ) = 1.35914087 - Lambert W (10.0000000, digits2<2> ) = 1.35914087 - Lambert W (10.0000000, digits2<3> ) = 1.35914087 - Lambert W (10.0000000, digits2<4> ) = 1.35914087 - Lambert W (10.0000000, digits2<5> ) = 1.35914087 - Lambert W (10.0000000, digits2<6> ) = 1.35914087 - Lambert W (10.0000000, digits2<7> ) = 1.35914087 - Lambert W (10.0000000, digits2<8> ) = 1.35914087 - Lambert W (10.0000000, digits2<9> ) = 1.35914087 - Lambert W (10.0000000, digits2<10>) = 1.74414063 - Lambert W (10.0000000, digits2<11>) = 1.74552798 - Lambert W (10.0000000, digits2<12>) = 1.74552798 - Lambert W (10.0000000, digits2<13>) = 1.74552798 - Lambert W (10.0000000, digits2<14>) = 1.74552798 - Lambert W (10.0000000, digits2<15>) = 1.74552798 - Lambert W (10.0000000, digits2<16>) = 1.74552798 - Lambert W (10.0000000, digits2<17>) = 1.74552798 - Lambert W (10.0000000, digits2<18>) = 1.74552798 - Lambert W (10.0000000, digits2<19>) = 1.74552798 - Lambert W (10.0000000, digits2<20>) = 1.74552798 - Lambert W (10.0000000, digits2<21>) = 1.74552798 - Lambert W (10.0000000, digits2<22>) = 1.74552810 - Lambert W (10.0000000, digits2<23>) = 1.74552810 - Lambert W (10.0000000, digits2<24>) = 1.74552810 - Lambert W (10.0000000) default = 1.74552810 - - Test evaluation of double Lambert W at varying precisions - specified using a policy with (base_2) digits increasing from 1 to 54. - std::numeric_limits::epsilon() = 2.22e-16 - Lambert W (10.000000000000000, digits2<1> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<2> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<3> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<4> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<5> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<6> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<7> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<8> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<9> ) = 1.3591409142295225 - Lambert W (10.000000000000000, digits2<10>) = 1.7441406250000000 - Lambert W (10.000000000000000, digits2<11>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<12>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<13>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<14>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<15>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<16>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<17>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<18>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<19>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<20>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<21>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<22>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<23>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<24>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<25>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<26>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<27>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<28>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<29>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<30>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<31>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<32>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<33>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<34>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<35>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<36>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<37>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<38>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<39>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<40>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<41>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<42>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<43>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<44>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<45>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<46>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<47>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<48>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<49>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<50>) = 1.7455280027406996 - Lambert W (10.000000000000000, digits2<51>) = 1.7455280027406994 - Lambert W (10.000000000000000, digits2<52>) = 1.7455280027406994 - Lambert W (10.000000000000000, digits2<53>) = 1.7455280027406992 - Lambert W (10.000000000000000, digits2<54>) = 1.7455280027406992 - Lambert W (10.000000000000000) default = 1.7455280027406992 - - Test evaluation of cpp_bin_float_quad Lambert W at varying precisions - specified using a policy with (base_2) digits increasing from 1 to 54. - std::numeric_limits::epsilon() = 1.93e-34 - Lambert W (10.00000000000000000000000000000000000, digits2<1> ) = 1.745528002740699383074301264875389837 - Lambert W (10.00000000000000000000000000000000000, digits2<2> ) = 1.745528002740699383074301264875389837 - ... - Lambert W (10.00000000000000000000000000000000000, digits2<52>) = 1.745528002740699383074301264875389837 - Lambert W (10.00000000000000000000000000000000000, digits2<53>) = 1.745528002740699383074301264875389837 - Lambert W (10.00000000000000000000000000000000000, digits2<54>) = 1.745528002740699383074301264875390030 - Lambert W (10.00000000000000000000000000000000000) default = 1.745528002740699383074301264875390030 - lambert_w0(z) cpp_dec_float_50 = 1.7455280027406993830743012648753899115352881290809 - - + + */ diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp index 265aad14c..8fd6825e8 100644 --- a/example/lambert_w_simple_examples.cpp +++ b/example/lambert_w_simple_examples.cpp @@ -14,7 +14,6 @@ //#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. //#define BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. //#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. -//#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. //#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. //#define BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of series for small z. //#define BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from lookup table. @@ -22,7 +21,6 @@ #include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ... #include // for BOOST_MSVC versions. #include - #include // boost::exception #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include @@ -74,16 +72,11 @@ int main() { std::cout << "Lambert W simple examples." << std::endl; - using boost::math::constants::exp_minus_one; // The branch point, a singularity. + using boost::math::constants::exp_minus_one; //-1/e, the branch point, a singularity ~= -0.367879. - // using statements needed to change precision policy. + // using statements needed for changing error handling policy. using boost::math::policies::policy; using boost::math::policies::make_policy; - using boost::math::policies::precision; - using boost::math::policies::digits2; - using boost::math::policies::digits10; - - // using statements needed for changing error handling policy. using boost::math::policies::evaluation_error; using boost::math::policies::domain_error; using boost::math::policies::overflow_error; @@ -95,28 +88,28 @@ int main() std::cout.precision(std::numeric_limits::max_digits10); // Show all potentially significant decimal digits, std::cout << std::showpoint << std::endl; - // and show trailing zeros too. + // and show significant trailing zeros too. double z = 10.; - double r; - r = lambert_w0(z); // Default policy for double: digits10 = 17, digits2 = 53 + double r = lambert_w0(z); // Default policy for double. std::cout << "lambert_w0(z) = " << r << std::endl; - // lambert_w0(z) = 1.7455280027406992 + // lambert_w0(z) = 1.7455280027406994 //] [/lambert_w_simple_examples_0] } { // Other floating-point types can be used too, here float. - // It is convenient to use function `show_value` + // It is convenient to use a function like `show_value` // to display all potentially significant decimal digits - // for the type. + // for the type, including any significant trailing zeros. //[lambert_w_simple_examples_1 float z = 10.F; float r; r = lambert_w0(z); // Default policy digits10 = 7, digits2 = 24 std::cout << "lambert_w0("; show_value(z); - std::cout << ") = "; show_value(r); - std::cout << std::endl; // lambert_w0(10.0000000) = 1.74552810 + std::cout << ") = "; + show_value(r); + std::cout << std::endl; // lambert_w0(10.0000000) = 1.74552798 //] //[/lambert_w_simple_examples_1] } { @@ -124,15 +117,14 @@ int main() // showing that an integer is correctly promoted to a double. //[lambert_w_simple_examples_2 std::cout.precision(std::numeric_limits::max_digits10); - double r = lambert_w0(10); // int argument "10" that should be promoted to double argument. - std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406992 - double rp = lambert_w0(10, policy<>()); // int argument "10" that should be promoted to double argument, - // for simplicity using default boost::math::policy. - std::cout << "lambert_w0(10, policy<>()) = " << rp << std::endl; - // lambert_w0(10, policy<>()) = 1.7455280027406992 - auto rr = lambert_w0(10); // C++11 needed. + double r = lambert_w0(10); // Pass an int argument "10" that should be promoted to double argument. + std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406994 + double rp = lambert_w0(10); std::cout << "lambert_w0(10) = " << rp << std::endl; - // lambert_w0(10) = 1.7455280027406992 too, showing that rr has been promoted to double. + // lambert_w0(10) = 1.7455280027406994 + auto rr = lambert_w0(10); // C++11 needed. + std::cout << "lambert_w0(10) = " << rr << std::endl; + // lambert_w0(10) = 1.7455280027406994 too, showing that rr has been promoted to double. //] //[/lambert_w_simple_examples_2] } { @@ -140,14 +132,14 @@ int main() //[lambert_w_simple_examples_3 cpp_dec_float_50 z("10"); // Note construction using a decimal digit string "10", - // not a floating-point double literal 10. + // NOT a floating-point double literal 10. cpp_dec_float_50 r; r = lambert_w0(z); - std::cout << "lambert_w0("; show_value(z); - std::cout << ") = "; show_value(r); + std::cout << "lambert_w0("; show_value(z); std::cout << ") = "; + show_value(r); std::cout << std::endl; // lambert_w0(10.000000000000000000000000000000000000000000000000000000000000000000000000000000) = - // 1.7455280027406993830743012648753899115352881290809413313533156788409111570000000 + // 1.7455280027406993830743012648753899115352881290809413313533156980404446940000000 //] //[/lambert_w_simple_examples_3] } // Using multiprecision types to get multiprecision precision wrong! @@ -165,7 +157,7 @@ int main() std::cout << ") = "; show_value(r); std::cout << std::endl; // lambert_w0(0.77777777777777779011358916250173933804035186767578125000000000000000000000000000) - // = 0.48086152073210493501934682309060873341910109230469724725005039758139532634080894 + // = 0.48086152073210493501934682309060873341910109230469724725005039758139532631901386 //] //[/lambert_w_simple_examples_4] } { @@ -188,7 +180,6 @@ int main() { // Using multiprecision types to get multiprecision precision right! //[lambert_w_simple_examples_4b - cpp_dec_float_50 z("0.9"); // Construct from decimal digit string. cpp_dec_float_50 r; r = lambert_w0(z); @@ -197,7 +188,7 @@ int main() std::cout << ") = "; show_value(r); std::cout << std::endl; // 0.90000000000000000000000000000000000000000000000000000000000000000000000000000000) - // = 0.52983296563343441213336643954546304857788132269804249284012528304239956432480864 + // = 0.52983296563343441213336643954546304857788132269804249284012528304239956413801252 //] //[/lambert_w_simple_examples_4b] } // Getting extreme precision (1000 decimal digits) Lambert W values. @@ -205,45 +196,41 @@ int main() std::cout.precision(std::numeric_limits::digits10); cpp_dec_float_1000 z("2.0"); cpp_dec_float_1000 r; - r = lambert_w0(z); // Default policy digits10 = 1000 + r = lambert_w0(z); std::cout << "lambert_w0(z) = " << r << std::endl; // 0.8526055020137254913464724146953174668984533001514035087721073946525150656742630448965773783502494847334503972691804119834761668851953598826198984364998343940330324849743119327028383008883133161249045727544669202220292076639777316648311871183719040610274221013237163543451621208284315007250267190731048119566857455987975973474411544571619699938899354169616378479326962044241495398851839432070255805880208619490399218130868317114428351234208216131218024303904457925834743326836272959669122797896855064630871955955318383064292191644322931561534814178034773896739684452724587331245831001449498844495771266728242975586931792421997636537572767708722190588748148949667744956650966402600446780664924889043543203483210769017254907808218556111831854276511280553252641907484685164978750601216344998778097446525021666473925144772131644151718261199915247932015387685261438125313159125475113124470774926288823525823567568542843625471594347837868505309329628014463491611881381186810879712667681285740515197493390563 // Wolfram alpha command N[productlog[0, 2.0],1000] gives the identical result: // 0.8526055020137254913464724146953174668984533001514035087721073946525150656742630448965773783502494847334503972691804119834761668851953598826198984364998343940330324849743119327028383008883133161249045727544669202220292076639777316648311871183719040610274221013237163543451621208284315007250267190731048119566857455987975973474411544571619699938899354169616378479326962044241495398851839432070255805880208619490399218130868317114428351234208216131218024303904457925834743326836272959669122797896855064630871955955318383064292191644322931561534814178034773896739684452724587331245831001449498844495771266728242975586931792421997636537572767708722190588748148949667744956650966402600446780664924889043543203483210769017254907808218556111831854276511280553252641907484685164978750601216344998778097446525021666473925144772131644151718261199915247932015387685261438125313159125475113124470774926288823525823567568542843625471594347837868505309329628014463491611881381186810879712667681285740515197493390563 } { -//[lambert_w_simple_examples_precision_policies - std::cout.precision(std::numeric_limits::digits10); - double z = 5.; - // Define a new, non-default, policy to calculate to precision of approximately 3 decimal digits. - std::cout << "lambert_w0(" << z << ", policy>()) = " << lambert_w0(z, policy>()) - << std::endl; // lambert_w0(0.29999999999999999, policy>()) = 0.23675531078855935 -//] //[/lambert_w_simple_examples_precision_policies] - - //[lambert_w_simple_examples_error_policies // Define an error handling policy: typedef policy< domain_error, - overflow_error - > throw_policy; + overflow_error // possibly unwise? + > my_throw_policy; - std::cout << "Lambert W (" << z << ") = " << lambert_w0(z) - << std::endl; // 0.23675531078855930 - std::cout << "\nLambert W (" << z << ", throw_policy()) = " - << lambert_w0(z, throw_policy()) << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); + // Show all potentially significant decimal digits, + std::cout << std::showpoint << std::endl; + // and show significant trailing zeros too. + double z = +1; + std::cout << "Lambert W (" << z << ") = " << lambert_w0(z) << std::endl; + // Lambert W (1.0000000000000000) = 0.56714329040978384 + std::cout << "\nLambert W (" << z << ", my_throw_policy()) = " + << lambert_w0(z, my_throw_policy()) << std::endl; + // Lambert W (1.0000000000000000, my_throw_policy()) = 0.56714329040978384 //] //[/lambert_w_simple_example_error_policies] } { - // Show error reporting from passing a value to lambert_w0 that is out of range, - // and probably was meant to be passed to lambert_wm1 instead. + // Show error reporting from passing a value to lambert_wm1 that is out of range, + // (and probably was meant to be passed to lambert_0 instead). //[lambert_w_simple_examples_out_of_range - double z = -1.; - double r = lambert_w0(z); - std::cout << "lambert_w0(-1.) = " << r << std::endl; - // Error in function boost::math::lambert_w0(): - // Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) - // for Lambert W0 branch (use W-1 branch?). + double z = +1.; + double r = lambert_wm1(z); + std::cout << "lambert_wm1(+1.) = " << r << std::endl; + // Error in function boost::math::lambert_wm1(): + // Argument z = 1 is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?) //] [/lambert_w_simple_examples_out_of_range] } } @@ -257,10 +244,8 @@ int main() Output: //[lambert_w_simple_examples_error_message_1 - Error in function boost::math::lambert_w0(): - Argument z = %1 out of range (-1/e <= z < (std::numeric_limits::max)()) - for Lambert W0 branch - (use W-1 branch?). +Error in function boost::math::lambert_wm1(): +Argument z = 1 is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?) //] [/lambert_w_simple_examples_error_message_1] /* diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 927eeda3f..28d3e8104 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -9,6 +9,10 @@ #ifndef BOOST_MATH_SF_LAMBERT_W_HPP #define BOOST_MATH_SF_LAMBERT_W_HPP +#ifdef _MSC_VER +#pragma warning(disable : 4127) +#endif + /* Implementation of an algorithm for the Lambert W0 and W-1 real-only functions. @@ -17,7 +21,7 @@ Toshio Fukushima, "Precise and fast computation of Lambert W-functions without transcendental function evaluations", J.Comp.Appl.Math. 244 (2013) 77-89, and on a C/C++ version by Darko Veberic, darko.veberic@ijs.si -based on the algorithm and a FORTRAN version of Toshio Fukushima's algorithm. +based on the Fukushima algorithm and Toshio Fukushima's FORTRAN version of his algorithm. First derivative of Lambert_w is derived from Princeton Companion to Applied Mathematics, 'The Lambert-W function', Section 1.3: Series and Generating Functions. @@ -30,23 +34,17 @@ Some macros that will show some (or much) diagnostic values if #defined. //[boost_math_instrument_lambert_w_macros // #define-able macros -BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES -BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W0 branch diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_W0 // W1 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION // Precision. -BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY_W0 // Halley refinement diagnostics only for W0 branch. +BOOST_MATH_INSTRUMENT_LAMBERT_WM1 // W1 branch diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_WM1_HALLEY // Halley refinement diagnostics only for W-1 branch. BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26 -BOOST_MATH_INSTRUMENT_LAMBERT_W0_HUGE // K > 64, z > 3.9904954117194348e+29 +BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table. BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. -BOOST_MATH_INSTRUMENT_LAMBERT_W0_NOT_BUILTIN // higher than built-in precision types approximation and refinement. -BOOST_MATH_INSTRUMENT_LAMBERT_W0_BISECTION // Show bisection only estimate. BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of series for small z. -BOOST_MATH_INSTRUMENT_LAMBERT_W0_LOOKUP // Show results from W0 lookup table. -BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table. //] [/boost_math_instrument_lambert_w_macros] */ @@ -128,7 +126,6 @@ inline return w_new; } // template lambert_w_halley_iterate(T w_est, T z) - // Two Halley function versions that either // single step (if mpl::false_) or iterate (if mpl::true_). // Selected at compile-time using parameter 3. @@ -1749,11 +1746,10 @@ T lambert_wm1_imp(const T z, const Policy& pol) T w_series = lambert_w_singularity_series(T(-sqrt(p2))); if (std::numeric_limits::digits > 53) { // Multiprecision, so try a Halley refinement. - // w_series = halley_update(w_series, z, pol); w_series = lambert_w_detail::lambert_w_halley_iterate(w_series, z); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Halley updated to " << w_series << std::endl; + std::cout << "Lambert W-1 Halley updated to " << w_series << std::endl; std::cout.precision(saved_precision); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN } @@ -1774,13 +1770,14 @@ T lambert_wm1_imp(const T z, const Policy& pol) // std::cout << "(z > wm1zs[63]) = " << std::boolalpha << (z > wm1zs[63]) << std::endl; if (z >= wm1zs[63]) // wm1zs[63] = -1.0264389699511282259046957018510946438e-26L W = 64.00000000000000000 - { // z >= -1.0264389699511303e-26 (but != 0 and >= std::numeric_limits::min() and so NOT denormalized). - std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + { // z >= -1.0264389699511303e-26 (but z != 0 and z >= std::numeric_limits::min() and so NOT denormalized). + + // Some info on Lambert W-1 values for extreme values of z. + // std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl; // std::cout << "-std::numeric_limits::min() = " << -(std::numeric_limits::min)() << std::endl; // -std::numeric_limits::min() = -1.1754943508222875e-38 // -std::numeric_limits::min() = -2.2250738585072014e-308 - // N[productlog(-1, -1.1754943508222875 * 10^-38 ), 50] = -91.856775324595479509567756730093823993834155027858 // N[productlog(-1, -2.2250738585072014e-308 * 10^-308 ), 50] = -1424.8544521230553853558132180518404363617968042942 // N[productlog(-1, -1.4325445274604020119111357113179868158* 10^-27), 37] = -65.99999999999999999999999999999999955 @@ -1799,6 +1796,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) T llz = log(-lz); guess = lz - llz + (llz / lz); // Chapeau-Blondeau equation 20, page 2162. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "z = " << z << ", guess = " << guess << ", ln(-z) = " << lz << ", ln(-ln(-z) = " << llz << ", llz/lz = " << (llz / lz) << std::endl; // z = -1.0000000000000001e-30, guess = -73.312782616731482, ln(-z) = -69.077552789821368, ln(-ln(-z) = 4.2352298269101114, llz/lz = -0.061311231447304194 // z = -9.9999999999999999e-91, guess = -212.56650048504233, ln(-z) = -207.23265836946410, ln(-ln(-z) = 5.3338421155782205, llz/lz = -0.025738424423764311 @@ -1807,13 +1805,13 @@ T lambert_wm1_imp(const T z, const Policy& pol) int d2 = policies::digits(); // digits base 2 from policy. std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 << std::endl; + std::cout.precision(saved_precision); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY if (policies::digits() < 12) { // For the worst case near w = 64, the error in the 'guess' is ~0.008, ratio ~ 0.0001 or 1 in 10,000 digits 10 ~= 4, or digits2 ~= 12. return guess; } T result = lambert_w_detail::lambert_w_halley_iterate(guess, z); - std::cout.precision(saved_precision); return result; // Was Fukushima @@ -1835,13 +1833,15 @@ T lambert_wm1_imp(const T z, const Policy& pol) using boost::math::policies::policy; // Compute a 50-bit precision approximate W0 in a double (no Halley refinement). T double_approx = static_cast(lambert_wm1_imp(static_cast(z), policy >())); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN - std::cout << "Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl; +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "Lambert_wm1 Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl; + std::cout.precision(saved_precision); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1 // Perform additional Halley refinement(s) to ensure that // get a near as possible to correct result (usually +/- one epsilon). T result = lambert_w_halley_iterate(double_approx, z); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1 +#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1 std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Result " << typeid(T).name() << " precision Halley refinement = " << result << std::endl; std::cout.precision(saved_precision); @@ -1849,8 +1849,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) return result; } // digits > 53 - higher precision than double. else // T is double or less precision. - { - // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. + { // Use a lookup table to find the nearest integer part of Lambert W as starting point for Bisection. using namespace boost::math::lambert_w_detail::lambert_w_lookup; // Bracketing sequence n = (2, 4, 8, 16, 32, 64) for W-1 branch. (0 is -infinity) // Since z is probably quite small, start with lowest n (=2). @@ -1889,51 +1888,20 @@ T lambert_wm1_imp(const T z, const Policy& pol) } } bisect: - --n; // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part. - // These are used as initial values for bisection. + --n; + // g[n] now holds lambert W of floor integer n and g[n+1] the ceil part; + // these are used as initial values for bisection. #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP + std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Result lookup W-1(" << z << ") bisection between wm1zs[" << n - 1 << "] = " << wm1zs[n - 1] << " and wm1zs[" << n << "] = " << wm1zs[n] << ", bisect mean = " << (wm1zs[n - 1] + wm1zs[n]) / 2 << std::endl; + std::cout.precision(saved_precision); #endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP - // W0 version - // // Check precision specified by policy in case can return early. - // // Use can set precision, for example = 7 from lambert_w0(x, policy >() or lambert_w0(x, policy >() - // int d2 = policies::digits(); // digits base 2 from policy (default 24 for float, 53 for double). - //#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION - // int d10 = policies::digits_base10(); // policy template parameter digits10 - // std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 - // << std::endl; - //#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION - // if (d2 <= 7) - // { // Only 7 binary digits precision required to hold integer size of w0zs[65], - // // so just return the mean of two nearby integral values. - // // This is a *very* approximate estimate, and perhaps not very useful? - // return static_cast((w0zs[n - 1] + w0zs[n]) / 2); - // } - - // Check precision specified by policy. - int d2 = policies::digits(); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION - int d10 = policies::digits_base10(); // policy template parameter digits10 - std::cout << "digits10 = " << d10 << ", digits2 = " << d2 // For example: digits10 = 1, digits2 = 5 - << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION - if (d2 < 7) - { // Only 7 binary digits precision required to hold integer size of w0s[65], - // so just return the mean of two nearby integral values. - // This is a *very* approximate estimate, and perhaps not very useful? -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION - std::cout << "between wm1zs[" << n << "] = " << wm1zs[n + 1] << " <= " << z << " <= " << wm1zs[n] << std::endl; - // TODO check this. -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION - return static_cast((wm1zs[n] + wm1zs[n + 1]) / 2); - } // d2 < 7 - - // Compute bisections is the number of bisections computed from n, - // such that a single application of the fifth-order Schroeder update formula - // after the bisections is enough to evaluate Lambert W-1 with (near?) 53-bit accuracy. - // Fukushima established these by trial and error? + // Compute bisections is the number of bisections computed from n, + // such that a single application of the fifth-order Schroeder update formula + // after the bisections is enough to evaluate Lambert W-1 with (near?) 53-bit accuracy. + // Fukushima established these by trial and error? int bisections = 11; // Assume maximum number of bisections will be needed (most common case). if (n >= 8) { @@ -1966,41 +1934,22 @@ T lambert_wm1_imp(const T z, const Policy& pol) y = yj; } } // for j - if (d2 <= 10) - { // Only 10 digits2 required (== digits10 = 3 decimal digits precision), - // so just return the nearest bisection. - // (Might make this test depend on size of T?) -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION - std::cout << "W-1 Bisection estimates = " << w << " " << y << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_WM1_BISECTION - return static_cast(w); // Bisection only. + return static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement. + +// else // Perform additional Halley refinement(s) to ensure that +// // get a near as possible to correct result (usually +/- epsilon). +// { +// // result = lambert_w_halley_iterate(result, z); +// result = lambert_w_halley_step(result, z); // Just one Halley step should be enough. +//#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_HALLEY +// std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); +// std::cout << "Halley refinement estimate = " << result << std::endl; +// std::cout.precision(saved_precision); +//#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1_HALLEY +// return result; // Halley +// } // Schroeder or Schroeder and Halley. } - else // More than 10 digits2 precision wanted, so continue with Fukushima's Schroeder refinement. - { - T result = static_cast(schroeder_update(w, y)); // Schroeder 5th order method refinement. - if (d2 <= (std::numeric_limits::digits - 3)) - { // Only enough digits2 required, so just return the Schroeder refined value. - // For example, for float, if (d2 <= 22) then - // digits-3 returns Schroeder result up to 3 bits might be wrong. -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER - std::cout << "Schroeder refinement estimate = " << result << std::endl; -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER - return result; // Schroeder only. - } - else // Perform additional Halley refinement(s) to ensure that - // get a near as possible to correct result (usually +/- epsilon). - { - result = lambert_w_halley_iterate(result, z); -#ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_HALLEY - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "Halley refinement estimate = " << result << std::endl; - std::cout.precision(saved_precision); -#endif // BOOST_MATH_INSTRUMENT_LAMBERT_W1_HALLEY - return result; // Halley - } // schroeder or Schroeder and Halley. - } // more than 10 digits2 - } -} // template T lambert_wm1_imp(const T z) + } // template T lambert_wm1_imp(const T z) } // namespace lambert_w_detail ///////////////////////////// User Lambert w functions. ////////////////////////////// @@ -2008,7 +1957,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) //! Lambert W0 using User-defined policy. template inline - typename tools::promote_args::type + typename boost::math::tools::promote_args::type lambert_w0(T z, const Policy& pol) { // Promote integer or expression template arguments to double, @@ -2027,8 +1976,6 @@ T lambert_wm1_imp(const T z, const Policy& pol) > tag_type; return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type()); // - - // return lambert_w_detail::lambert_w0_imp(result_type(z), pol, tag_type()); } // lambert_w0(T z, const Policy& pol) //! Lambert W0 using default policy. diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 140bcd9e5..ac1020c13 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -1,4 +1,4 @@ -// Copyright Paul A. Bristow 2016, 2017. +// Copyright Paul A. Bristow 2016, 2017, 2018. // Copyright John Maddock 2016. // Use, modification and distribution are subject to the @@ -7,12 +7,12 @@ // or copy at http://www.boost.org/LICENSE_1_0.txt) // test_lambert_w.cpp -//! \brief Basic sanity tests for Lambert W function plog productlog -//! or lambert_w using algorithm informed by Thomas Luu, Veberic and Tosio Fukushima. +//! \brief Basic sanity tests for Lambert W function using algorithms +// informed by Thomas Luu, Darko Veberic and Tosio Fukushima. -// #define BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES // Diagnostics for z near zero. // #define BOOST_MATH_TEST_MULTIPRECISION // Add tests for several multiprecision types (not just built-in). -// #defin BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17 and quadmath library). +// #define BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17 and quadmath library). +// #define BOOST_MATH_LAMBERT_W_INTEGRALS // Add quadrature tests that cover the whole range of the Lambert W0 function. #ifdef BOOST_MATH_TEST_FLOAT128 #include // For float_64_t, float128_t. Must be first include! From 8d77dc0516a2870f6b89489d0fe60e335a846985 Mon Sep 17 00:00:00 2001 From: pabristow Date: Thu, 19 Jul 2018 16:48:04 +0100 Subject: [PATCH 52/71] Precision updated, quadrature notes added, need prime notes --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 2 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 2 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 106 +++++++++++++----- example/lambert_w_precision_example.cpp | 138 ++++++++++++++++++++---- 10 files changed, 205 insertions(+), 55 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index ddfda1a9d..848c5fb59 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in - +

        Last revised: July 17, 2018 at 16:28:57 GMT

        Last revised: July 19, 2018 at 15:38:32 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 36426d121..90a32c517 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 7ac6cf598..d7eeb473e 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 4de886e97..7139e0217 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index a9059d584..79b889d79 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index bc4ae9331..9a4da53d0 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index b300c694b..05fe5744d 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index c0c032b68..cfbe08d1d 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 0dd9bb0b3..26ff061b2 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -37,7 +37,7 @@ It is also called the Omega function, the inverse function of ['f(W) = W e[super On the z-interval \[0, [infin]\] there is just one real solution. On the interval (-1/e, 0) there are two real solutions on two branches called variously W0, W+, W-1, Wp, Wm, W-. -Two principal branches functions called `lambert_w0` and `lambert_wm1` +Two principal branches functions called `lambert_w0` and `lambert_wm1`, and their 1st derivative, are provided by Boost's real-only implementation. In the graphs below, the red line is the W0 branch, and the blue line the W-1 branch. @@ -126,7 +126,7 @@ Note the expected zeros for all places up to 50 - and the correct Lambert W resu (It is just as easy to compute even higher precisions, at least to thousands of decimal digits, but not shown here for brevity. See [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] -). +for comparison of an evaluation at 1000 decimal digit precision with __WolframAlpha). Policies can be used to control what action to take on errors: @@ -205,42 +205,82 @@ The symbolic algebra program __Maple also computes Lambert W to an arbitrary pre [h4:precision Controlling the compromise between Precision and Speed] -This implementation provides good precision and excellent speed. +[h5:small_floats Floating-point types `double` and `float`] +This implementation provides good precision and excellent speed for __fundamental types `float` and `double`. All the functions usually return values within a few __ulp for the floating-point type, except for very small arguments very near zero, and for arguments very close to the singularity at the branch point. By default, this implementation provides the best possible speed. -Very slightly higher precision and less bias can be obtained by adding a __halley step refinement, +Very slightly average higher precision and less bias might be obtained +by adding a __halley step refinement, but at the cost of more than doubling the run time. -The 'best' evaluation (the nearest __representable) can be achieved by `static_cast`ing from a -higher precision type, typically a __multiprecision type like `cpp_bin_float_50`, -at the cost of increasing run-time >100-fold; -this has been used here to provide reference values for testing. - -[import ../../example/lambert_w_precision_example.cpp] - -[lambert_w_precision_1] - -The output for ['z = 1.F] is: - -[lambert_w_precision_output_1] - -showing no improvement from the Halley refinement, but for ['z = 10.F] -we need a Halley refinement (or few) to get the last bit or two correct. - -[lambert_w_precision_output_1a] - [h5:big_floats Floating-point types larger than double] For floating-point types with precision greater than `double` and `float` __fundamental_types, a `double` evaluation is used as a first approximation followed by Halley refinement, using a single step where it can be predicted that this will be sufficient, -only using __Halley iteration when necessary. +and only using __halley iteration when necessary. Higher precision types are always going to be [*very, very much slower]. +The 'best' evaluation (the nearest __representable) can be achieved by `static_cast`ing from a +higher precision type, typically a __multiprecision type like `cpp_bin_float_50`, +but at the cost of increasing run-time >100-fold; +this has been used here to provide our reference values for testing. + +[import ../../example/lambert_w_precision_example.cpp] + +For example, we get a reference value using a high precision type, for example; + + `using boost::multiprecision::cpp_bin_float_50;` + +that uses Halley iteration to refine until it is as precise as possible for this `cpp_bin_float_50` type. + +As a further check we can compare this with a __WolframAlpha computation +using command [^N\[ProductLog\[10.\], 50\]] to get 50 decimal digits +and similarly [^N\[ProductLog\[10.\], 17\]] to get the nearest representable for 64-bit `double` precision. + +[lambert_w_precision_reference_w] + +giving us the same nearest representable using 64-bit `double` as `1.7455280027406994`. + +However, the rational polynomial and Fukushima Schroder approximations are so good for type `float` and `double` +that negligible improvement is gained from a `double` Halley step. + +This is shown with [@../../example/lambert_w_precision_example.cpp lambert_w_precision_example.cpp] +for Lambert W0: + +[lambert_w_precision_1] + +with this output: + +[lambert_w_precision_output_1] + +and then for W-1: + +[lambert_w_precision_2] + +with this output: + +[lambert_w_precision_output_2] + +[h5:differences_distribution Distribution of differences from 'best' `double` evaluations] + +The distribution of differences from 'best' are shown in these graphs comparing `double` precision evaluations +with reference 'best' z50 evaluations using `cpp_bin_float_50` type reduced to `double` with `static_cast // boost::exception #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. #include +#include // for float_distance. +#include // for relative and epsilon difference. // Built-in/fundamental GCC float128 or Intel Quad 128-bit type, if available. #ifdef __GNUC__ @@ -64,47 +66,144 @@ int main() using boost::math::policies::domain_error; using boost::math::policies::throw_on_error; +//[lambert_w_precision_reference_w + + using boost::multiprecision::cpp_bin_float_50; + using boost::math::float_distance; + + cpp_bin_float_50 z("10."); // Note use a decimal digit string, not a double 10. + cpp_bin_float_50 r; + std::cout.precision(std::numeric_limits::digits10); + + r = lambert_w0(z); // Default policy. + std::cout << "lambert_w0(z) cpp_bin_float_50 = " << r << std::endl; + //lambert_w0(z) cpp_bin_float_50 = 1.7455280027406993830743012648753899115352881290809 + // [N[productlog[10], 50]] == 1.7455280027406993830743012648753899115352881290809 + std::cout.precision(std::numeric_limits::max_digits10); + std::cout << "lambert_w0(z) static_cast from cpp_bin_float_50 = " + << static_cast(r) << std::endl; + // double lambert_w0(z) static_cast from cpp_bin_float_50 = 1.7455280027406994 + // [N[productlog[10], 17]] == 1.7455280027406994 + std::cout << "bits different from Wolfram = " + << static_cast(float_distance(static_cast(r), 1.7455280027406994)) + << std::endl; // 0 + + +//] [/lambert_w_precision_reference_w] + //[lambert_w_precision_0 std::cout.precision(std::numeric_limits::max_digits10); // Show all potentially significant decimal digits, std::cout << std::showpoint << std::endl; // and show any significant trailing zeros too. - double x = 10.; + float x = 10.; std::cout << "Lambert W (" << x << ") = " << lambert_w0(x) << std::endl; - // - - - //] [/lambert_w_precision_0] /* //[lambert_w_precision_output_0 - +Lambert W (10.0000000) = 1.74552800 //] [/lambert_w_precision_output_0] */ - + { // Lambert W0 Halley step example //[lambert_w_precision_1 - using boost::math::lambert_w_detail::lambert_w_halley_step; + using boost::math::epsilon_difference; + using boost::math::relative_difference; + + std::cout << std::showpoint << std::endl; // and show any significant trailing zeros too. + std::cout.precision(std::numeric_limits::max_digits10); // 17 decimal digits for double. + + cpp_bin_float_50 z50("1.23"); // Note: use a decimal digit string, not a double 1.23! + double z = static_cast(z50); + cpp_bin_float_50 w50; + w50 = lambert_w0(z50); + std::cout.precision(std::numeric_limits::max_digits10); // 50 decimal digits. + std::cout << "Reference Lambert W (" << z << ") =\n " + << w50 << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); // 17 decimal digits for double. + double wr = static_cast(w50); + std::cout << "Reference Lambert W (" << z << ") = " << wr << std::endl; - double z = 10.; double w = lambert_w0(z); - std::cout << "Lambert W (" << x << ") = " << lambert_w0(z) << std::endl; + std::cout << "Rat/poly Lambert W (" << z << ") = " << lambert_w0(z) << std::endl; + // Add a Halley step to the value obtained from rational polynomial approximation. double ww = lambert_w_halley_step(lambert_w0(z), z); - std::cout << "Lambert W (" << x << ") = " << lambert_w_halley_step(lambert_w0(z), z) << std::endl; + std::cout << "Halley Step Lambert W (" << z << ") = " << lambert_w_halley_step(lambert_w0(z), z) << std::endl; - std::cout << "difference from Halley step " << w - ww << std::endl; + std::cout << "absolute difference from Halley step = " << w - ww << std::endl; + std::cout << "relative difference from Halley step = " << relative_difference(w, ww) << std::endl; + std::cout << "epsilon difference from Halley step = " << epsilon_difference(w, ww) << std::endl; + std::cout << "epsilon for float = " << std::numeric_limits::epsilon() << std::endl; + std::cout << "bits different from Halley step = " << static_cast(float_distance(w, ww)) << std::endl; //] [/lambert_w_precision_1] + - /* +/* //[lambert_w_precision_output_1 - + Reference Lambert W (1.2299999999999999822364316059974953532218933105468750) = + 0.64520356959320237759035605255334853830173300262666480 + Reference Lambert W (1.2300000000000000) = 0.64520356959320235 + Rat/poly Lambert W (1.2300000000000000) = 0.64520356959320224 + Halley Step Lambert W (1.2300000000000000) = 0.64520356959320235 + absolute difference from Halley step = -1.1102230246251565e-16 + relative difference from Halley step = 1.7207329236029286e-16 + epsilon difference from Halley step = 0.77494921535422934 + epsilon for float = 2.2204460492503131e-16 + bits different from Halley step = 1 //] [/lambert_w_precision_output_1] +*/ + + } // Lambert W0 Halley step example + + { // Lambert W-1 Halley step example + //[lambert_w_precision_2 + using boost::math::lambert_w_detail::lambert_w_halley_step; + using boost::math::epsilon_difference; + using boost::math::relative_difference; + + std::cout << std::showpoint << std::endl; // and show any significant trailing zeros too. + std::cout.precision(std::numeric_limits::max_digits10); // 17 decimal digits for double. + + cpp_bin_float_50 z50("-0.123"); // Note: use a decimal digit string, not a double -1.234! + double z = static_cast(z50); + cpp_bin_float_50 wm1_50; + wm1_50 = lambert_wm1(z50); + std::cout.precision(std::numeric_limits::max_digits10); // 50 decimal digits. + std::cout << "Reference Lambert W-1 (" << z << ") =\n " + << wm1_50 << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); // 17 decimal digits for double. + double wr = static_cast(wm1_50); + std::cout << "Reference Lambert W-1 (" << z << ") = " << wr << std::endl; + + double w = lambert_wm1(z); + std::cout << "Rat/poly Lambert W-1 (" << z << ") = " << lambert_wm1(z) << std::endl; + // Add a Halley step to the value obtained from rational polynomial approximation. + double ww = lambert_w_halley_step(lambert_wm1(z), z); + std::cout << "Halley Step Lambert W (" << z << ") = " << lambert_w_halley_step(lambert_wm1(z), z) << std::endl; + + std::cout << "absolute difference from Halley step = " << w - ww << std::endl; + std::cout << "relative difference from Halley step = " << relative_difference(w, ww) << std::endl; + std::cout << "epsilon difference from Halley step = " << epsilon_difference(w, ww) << std::endl; + std::cout << "epsilon for float = " << std::numeric_limits::epsilon() << std::endl; + std::cout << "bits different from Halley step = " << static_cast(float_distance(w, ww)) << std::endl; + //] [/lambert_w_precision_2] + } + /* + //[lambert_w_precision_output_2 + Reference Lambert W-1 (-0.12299999999999999822364316059974953532218933105468750) = + -3.2849102557740360179084675531714935199110302996513384 + Reference Lambert W-1 (-0.12300000000000000) = -3.2849102557740362 + Rat/poly Lambert W-1 (-0.12300000000000000) = -3.2849102557740357 + Halley Step Lambert W (-0.12300000000000000) = -3.2849102557740362 + absolute difference from Halley step = 4.4408920985006262e-16 + relative difference from Halley step = 1.3519066740696092e-16 + epsilon difference from Halley step = 0.60884463935795785 + epsilon for float = 2.2204460492503131e-16 + bits different from Halley step = -1 + //] [/lambert_w_precision_output_2] + */ -// z = 10.F needs Halley to get the last bit or two correct. -//[lambert_w_precision_output_1a -//] [/lambert_w_precision_output_1a] - */ // Similar example using cpp_bin_float_quad (128-bit floating-point types). @@ -126,6 +225,7 @@ int main() cpp_dec_float_50 z("10"); cpp_dec_float_50 r; std::cout.precision(std::numeric_limits::digits10); + r = lambert_w0(z); // Default policy. std::cout << "lambert_w0(z) cpp_dec_float_50 = " << r << std::endl; // 0.56714329040978387299996866221035554975381578718651 std::cout.precision(std::numeric_limits::max_digits10); @@ -152,8 +252,6 @@ int main() // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.745528002740699383074301264875389837 // lambert_w0(z) cpp_dec_float_50 cast to quad = 1.74552800274069938307430126487539 } - - // std::cout << "Lambert W (" << xd << ") = " << lambert_w0(xd) << std::endl; // } catch (std::exception& ex) { From dcc85445782ee4c02164bc7b8a7ba3b9be4c7e6a Mon Sep 17 00:00:00 2001 From: pabristow Date: Tue, 24 Jul 2018 11:24:20 +0100 Subject: [PATCH 53/71] Major edit done and graphs now show legend lines. --- doc/graphs/diode_iv_plot.svg | 55 ++--- doc/graphs/lambert_w_graph.png | Bin 16208 -> 16269 bytes doc/graphs/lambert_w_graph.svg | 6 +- doc/graphs/lambert_w_graph_big_W.png | Bin 20562 -> 20648 bytes doc/graphs/lambert_w_graph_big_W.svg | 45 ++-- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 2 +- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 2 +- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/sf/lambert_w.qbk | 26 ++- example/lambert_w_diode_graph.cpp | 1 + example/lambert_w_graph.cpp | 281 +++++++++++++++++-------- test/test_lambert_w.cpp | 36 +++- 17 files changed, 300 insertions(+), 166 deletions(-) diff --git a/doc/graphs/diode_iv_plot.svg b/doc/graphs/diode_iv_plot.svg index 788e09227..55fc00d65 100644 --- a/doc/graphs/diode_iv_plot.svg +++ b/doc/graphs/diode_iv_plot.svg @@ -15,28 +15,28 @@ xmlns ="http://www.w3.org/2000/svg" - + - + - + - + - + - + - + -0.3 -0.4 -0.5 -0.6 -0.7 -0.8 -0.9 -1 +0.3 +0.4 +0.5 +0.6 +0.7 +0.8 +0.9 +1 0 4 @@ -49,18 +49,23 @@ xmlns ="http://www.w3.org/2000/svg" log(current) (A) -voltage (V) - - - - - - +voltage (V) + + + + + + - + - - + + + + + + + I₀(V) diff --git a/doc/graphs/lambert_w_graph.png b/doc/graphs/lambert_w_graph.png index 4049c813b1ab6a804ebccc03fc0049c3b517927a..627cda9a98a262bf2a2fc8d65ff73c19faf2c33c 100644 GIT binary patch literal 16269 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrZR>p*U{dfH1^$i?Kn>3oypyr$jVq2Idkc@89QS( zAKjF<`tPo=TS?tv_txkHdtdf44)(bsWLg*>7*pWtk`m}}?ctw)7M9mJQw<-;w4ML_ z@xj94XVvHSuovE&b9aG;28UvcfYgS-|2sG=GNfEM6kTGAL<{zZIq^9#>t5ziY+2E~ zW(%J}i@>6HlZ1qvI2KB3Dk`=J%$i6?j2pOQC3yS3i0sZP*hZm zI)33!kEC(NjSY(X_U*Hdit{1rHb^ zBO@JN3hgR-%2ogGr#dqmk4E{=lP6Cy?AWm*M8n^ASHVN3zrVgdZsxbs_&R6*etYZk zcTd)CzjsMt=7tcnD0YEcyS~kS|LyHFMEFcQz&;|MBg1zNe?>!Sm<)4U>;eiMk!Jzs^?OZ%)FG4-ZpP zQw{6?)rh!0-1&T7^2bLzSCCZfr{BW@Tkv z=2KW$c;m*63#&r4`DCqJs;aDdrOnwC%*>`OTBNjS@#6enb=+KBKc3Cbx2XD}!Qeez z@95>rlNT&dShQ%-j*5>;+F@%HR8(5x_Eyb2`}=PB{lJ)*Gl%)@b7pO;|6jK)_qJO| zh{)O5=FgYUuS@#;?Cg#mJ3gFH?iUac2+(paEHu;(Uzc)wTkex5PaeE|+q-|iJ-^)# zh2wp)kB`gOvpl%6GI-hhs|OmHKYsnHs;%9<)O)&+goMZaeYM`YS$dE>^7fl=FXR<^XaYnPRkbxoZ*_0#9`_Op9` zKbh<=;xN;;dfTPl<@rZ%-HIwKEDU5gdi{F1r>}1)8^7EdhOW(0 zO~&8f|LEn*!9Rb!UN4%RoqhDwDKAD5hnJU@c2Al+H`nan?)UqGUtL|jyrQZ~>+bII za2XkyDQdp6G&(yw(;mC^NGxPHb*PnFG(A22Xo7);qN3udmBGtJ!o$NsCK*cbbgf>! z`q8Ubt9)jgtv&Pp^o@+sT(#Jq@J3h$+h6mr_=h&o*(O#UT%_e zBS2F_W5-J)V`F2{@bK`ZaeJ${7FbwXYOY(i?$nQuk40Srr~LR)!5Z-I>-zesv#y^% z?_XG4Y&_en_?ZuDfZhK;#Y^+=@8eo<yb#@c4x{Ik)_GU z`?wbT`0+zyu2pGJPHwKKwYBxr*X#G2N$)OyAIBOXSNkRK>DBP~P#(5s&CLfB0>t#= zYChMCBqkP#xH?W0+7uwFyU?{;O!N8q`R2C!zB%65o*%!t@VeKDyLV%Eem-YC^~sZz zrAwB$NE)a0FljV4HhNW5>?r#3BG5HZO6>z@_^;>RL++%jTEcqnzaA20xu1Ul-Wb-97c}Y;$e4X2+LTRtC?!Z=L9QMQBp3Q|X-*fs4&bFE4be~jH#l6bUB6jV|fNcha29}^oJxjj!-H);!m!CPs|>TfwKQzdxV zuC0wezW4jR?zL-m}`u+Fo|If94zehMbJG<)3 zi^k>4)z$sx?0BlPsBBWL6H`F>wE33BZQbJfK|w)Ig@qq^kKZjmZyOOEJzMVfty@e5 z&*zpudhj41tIE^Ub7iW9rRBvnk;a=d4<0;dl69pcc)4GqiPXkz+stZDtdHJ)?u|o3 zx43?iiIipaHyuYu$F$Rub~P2M_r9L3tf~?c5<2wl?d_8%Pb%u^@iiZGI6u#}u(()R zL7`!;b$L)oNQ%|1wQK%5Ud{aU$k$Q{%g7$F5zICQfuLD>Kv6(@RN7NidKARXE`iZ?=E-r9e)*RSi`$&-rq_VJtNs|Q+pa9&O17SlP9 zVe;vm_4^0UpD)jxrtIEV@bgouRr$M|TX(K+PWNXBTNm@Qe|o-wMBc8>k7>WYylkF2 zRrK^U-N!dJCY$RljNF_S7!VMk`n!4E+KYc`>!!SZ?>8w1VKpCv-s)E?mlqTiJh&PjpL%~^ZQAJ*=g+Ud zlIHC1@4so&CatZHcLy$Z+me5O-sR=~%rmA2%r?s{C@WLb)#a_O{;g%X|LF1K?4aZ{ zi>vtStE)WHW@mEj@2u_U=~?1EU2l#>Vbk*Yb+^_`2o4VRz3&!3Z%V^Q$Hp|xv8 z`TKhg$;+ou!C{TEgSt54I7K4$y<&S7VM+Y~8r35gSnT)R)4J*%pt(^L2Nmtoo& ziA9SSgDNQP^Pg;fJZNtCmH6jIa{tDpqg`BQ%X25s*}s4P&0CA6P8GeoyPW+>(XM|B zdZM4ce0lQi_WS1=nb|pbcvLhrIu16o8|U8IBK@v-B~SCg1Cvy}KYaiGeEFMct-+U2opx6crcm{QYkCO#6Df?f2`f zJv}{B($a)PMO$ajmUde#Xl`z*I)gc9w7Z=4R(&MsqRF#yJl(8siQ1hMj;ZE`SnR*OWdnZf~aO;!l?Cs^%)YM$EeEH+ouTRe~ zOnz~BdH>5Sw$|2G7FO1a+w(}cqcI(ypd`h4`JnY);ce}bLO%nR_=~KqlRig82K5-sy z<6XR9LBoa(21-gwKFPgqAX8jiU1!Rs)#mbUE`NV-OaA?PI`3axT%37f0b^xl<&)>n zFE4WCKGrYq-!EtDlYNYto$tuCYty!DF>$bcwLWmMn?_gD)TyF-tG}Dc^3}bqHmUlO z@#^~e^E->5dw6><4qooJ=l{RoJ<{gq-u%_+@3kT{+ktUmA_e&sHOO7-GVf`AC)_^Wu31ui3K`! zi|J~W?)*QYERjcU;e-2oRAsHd?K(MUYw)k7B4v4ZJ-$qs80EfFjEzTwZNaQ{kJg$t z9}LJ1*SLPE@5k3AaX!b+?`JhL6VF@NqSScys-W+SKHh?pU$#f-TUp(DqjmUs(4~mY zS**!&^{F^bbTzTbky%d3qXJ&V0V5FG%;!p4*e= z7Pd9*IeqoFQ&*F3o!vIe@C|2A9#qrkzkNq0r?_~-x!qlkjY{tBT{2P$TedG>(Wvao zE4`}!?VCWY%HJIE-+xJX-QnQnU94ig@sFgJCX*WD`a6gAEc#}_{l&y~Q-{#6-+#TX z<=r|sD^xq<+2ezEFWTlCg}>dpP%a`m(s0ZFT#$d4Up{z@Yfo(L*1jNJK2_)4&(;>M zig)Gq@ozuk^7ZuzL5r%8zn`CYYUs6z=`N@&=HP0YrmMKd`p2(Tm;deJsto;UnD*K} zriuB&60JoXcTbsCFS#vL^?vVnoubLD0^3#0#r@`oaX)(zxV7Nh+veos3hL~$%vvu5 zY>hc|IPs1}#xiIocwyVxU*-DxYlFE1lb5u#tkBBL+)%78W4C7AO&O~tb&-)PQ!j7Ry;CNw`Mqa( z;qwHU=D%D0bXuP2tZUi#^O^L%UuhGs8MdfuYc@VUes$5!t=_t`_EsyZy4pU{F%hvU zYdP3_)xNg&;Jte$)qX}h%q|)17qChyRK2n)RNJb(H2w0ih_#D3yaPg(T?S*-FcTEgUINJVx-^x;vz}q6Cj!sND_t)ix z-QF)>_CAcC?ZpMgLx|8M&C_Uhs*udZIU+9uMwg1-&j`g*!i@j

        R1Ez6^!e)9 zm(6mUa&KR`bn;xAUhI|0w)bm-|6aZv{CbH~$Nq^zLR-&YUH#$t{13(W_&Oqn^X=W;;pYTbz3p*(_4Y37$Bi2b7w@V(drwYDIq^rqkN5RY z8JHAxT8>V=klb(E=HFe$)A3?esYsxtrsjv&>o=6?+RZjgo?6SQRCW06_QTfiSGaHV zeA$r|5);$Y>wDBrD12RvXI`G3vRluJXCd3u&dsshl6!kv+}NlC#9O688-Rr2u5%gbq(-|u+L zr{+5=#Vq&tx3?}XE&)M7Oa~S^w{!6GAHQ}@th~HD?fkshcdvEh_RP@V_hZqkdk&(r z4U^ekUt4?G%B}Up|D3?$pr8k*^{@W5m^bg0E|*?R!}PeO&(E(i^W3YO{pVh7;F~w6 zt*^eeqo*cP3jn{jcj^S>{XQ!rW7Zw#AI(4dR%^ICWixjziEuPR@=wXOAj zT`<3fMWK`K((?PQ9UPXkd_z{QSfOE-cPHalK!11lVhi=`PwKjS?(}Y>GPR+Be zmM}ccSz6 zg4!0Rr|BNPdw1?a=XRzIH9w1HnP#_b-)??(mg(Zu)6-<^>+YD`KQ3SIv$yK&jjh?@ zii(Oqe*Adw?%laxUtgb%`@Oi|?$G7Slb89)BJa!)NIx-`i6;$EI@9-{0Ri*ZeHHwl4Pcs?gP1fBvq~6e}-@adc#? z3}2rmyExCHj7LnjDfP61rl;+sxAy-7^K&0OSyE~hc>K$&tK8Ai(PnvfI+ib2=j7!4 z^5SCihYtmpqmF!?{fObxrArw%HY~hZH0R&1o4(%O+MmDv`Sa(;&*$?u{>$$DH#Iyi z@yUsaGBy&r_^m*(EyHpjO5TF%X`MF#c%Y7QMb z#89gH9yIJ?`~RqTynukff#2`<=SOvC-`}_QrqQjf*~cfTdT-dYX;JFwX*X`%m||7n z%&(K@`{Jm0{F8T$wOjfUcN!Tzc-(*W^n;d`73zI{GnrPd+)$+2BcaHuV)F3C3y+8h z32C#OgwxY>S=iYhKYQlZFK25}_C{jm%9Ve<-OgX;Tgc!$%S6%I`gV?G__`QF+i)>) zaq(bAMizE<=4aUfeSLjttSkW`Ax9Ruc7p<;t_q3aF*N*e);#NCOUr@7 z{D=MRPkz18vd+cT)iC{>3=)V{r>&C_}`z(&8acg z4G-S`jyP5Pb-k`ZUS3{mpR{2Ti>Ie&&7Y6QOWxd=`0#Lh_^VO}-R*z={P8-!++A$D zn#!sRCnp<}YW?_qSh;^i_`<&a@ch)jZ#D-xIF&D2wCKc%6AAzR{9GoKb#IU5ym|A^ z%(I<6&$jx}ix(ME^0KmLkM&AxYH1ny?%sBPMd<3V)P2|PU)TEg=d-_zjLfMy?;joQ z{`2E;|DJ!pUVnLUk-2^Uy8Md2bxXQl+}mqiSXh{nmKK&}XFEwq=vj|j#8xggz7{dv zE5F~@d}yq)__`+Y)l}}53oCEu?dGknuGWj)l~T5~;lqc5qN1WR-`E*_W|?%d@k)I- zBJ4k5=FF43N?-r@a@oJ~^I3C437*t_*Pfl7UHR+f@|&B}`R)JzF@C@2Ghe^`KMTFo zJCE)jJlOc_>ucludp7@mJm!z9erx*Z@ng%H9~&}_6I^{}oAov|F@gF@>-YaVwaj;R z#p7Oct=P0G1yz-h>H7cQ%gnpDcwwlvMTy7Wj2C~upI*Dhb!|d^{`nIVl{@?Tj-5Y$ z-lX=!gM%gS?#y&-W}DetURIWNcUP&3ipqs0p2BYZa%X?P-w#rKx<v2<_ ztnP27yE}NfU)tx&%F3C1Wegl#T#vrruRnhBWaq`j?#5|nB=}^lQmXdl-rlxs@t<{| zDn?FDE_I*2E~N9o7L~rzDBJvPf`d!=w6(VmY;c_T^nAeSoF9+<)%^a5cXIwdB_A_y ziOP=;&Od%-XI$f%SH&e)#qsL;|L3Roxk8(>rriN+`Ba$%z0UZ3u@ zN%-a6t+79iXT0S6!nSO>`GzQsuAq0f`d4r*Z@A_l^*|%rsr1^ty{{(b96b1H;kDD# z4mL6y)a_Zus?rj+q+yGqYRL6BHyEAUR+P)?>b1r0zM_1ejgRH0zedZ7M6qzE`E|cE z|JPM5x@Pz#{d=B-jl`kD2k*-E$pl`nyA@hCxl_O?M7CRdpHJb8@E$d#aYcb2cbtJa@uIuY-YeB=gl@D9R&+t`?Jk`)^ z^S2K@opzk>>!XFIr>}00;Z|%p_u}0qTYsC6ENi2-Cf(eW+ECT@@pk_Hv#0g|LR;@e# z?Ch)S$K_9lu4xt6+P2Q?#jV)?>tgF<3}RR9S+KxivQJg&a*bELkJxyd3Lhu@E_+t5@c|mS3}F)3d$*nl(A^uK_f2Ardlz+FaBIsuuNQO6?>x{+54Suf9Cu9IKDF*Mq6y502-1*1U@Rm+#Bd*}Y${eqWS_ zUP4rLY&~PJqLx#+s!7fb1G^s&nD14+*6r%*k}yu=nP2nCbLQtAyJ!EuHnn2eo9e^Y zt-{x@3b(znk=ZOy#d1H(wIdmGy*L#A8Qz^LaNx3pWJlD(2_^ zcV^$#FNr;SDlIoIhNlAl*hN{!8S64s1Bd?e> z@$__kVQFb^Kfk_ffq5^!yu6%qXGh>`iH0c?>|%E^UA*|J(*Ax8^S5tN>OxM}zrDG6 zxP?>L!{6V0_P}LA>)MGu8qO+cVczF2B z`}^~S)%`-=@Lt)FdU{&n_1N-ES>_D~guMLy)t~;^`HB5iXx+Z5%R4UwfSUi8terv{ zX3v(MU;ob%G-K*}`qZhUV?C04e!ttDmONcQ{@lO6zt8%0>3b(8DzY^<@=BX+D0_QL z>#VNMh89puXkO(X!?nqGq+A2_tzNxYaqqJ`mq!QJ$FETJG-;5Z{0+n@O3c{FS^Sgy?uN3 zySuwTzh1w8);w(ujRp1p|E-DK+@=}4?7`c&zBM&AuCA`2wtLCTORW0(`c~!d&b+$1 z`s_4mS=qCvrfUCu)UD6K%d4uO&~S5e`t+)|n!(F1EcF(TnCVxi4rdIJ>nMM!mis|8Vp9gri(vGb|Kcmb$pP zO`0(yW7nJTm>8Mwcgy7&85wi#?haJ~S2Y!8hUHSLx^`DsNlg8ZK#3pa80a?&coIFcFfKJu4nxbMVK<$B|pJM1z<4 z96WsZ@RpuOkCNDUBpebF6y$5a2!iH=PfgJ@{ZzYi-k)7-*`J>~xVZn&_WMoq=U>Zg zSus^fS=ms6C+E(NiHV2XHWokktNQlF6EvizDk3cG{Quuy?LGD{=2yMj`CP)b%7mf( zZmIaZdGl)i{d^8;<1910yQ}o^?EHO(v)})EE?@g45HwQz^YinMyWf3Y=-AA5`pmVOns~U4aYN5Qf9sm#a@9TTaupBc(|7%A-e33k*Ot7yvmPJspWXZN z`ug~lKi9?WJ@x77Y0IiFD_)wJU0=`1X!GF!^NpJ~86P}&kYM)g!NFz*9vO=d%WlfZ z%KEaFR0}fSRU$Ht=R9GB6 zdQ>N7$Artv{b%1b`Fz&={+@?N`=w2@LUJYFp0<4Y=*7jwUtV5rx2yg2;Q%xLgJ;i< zfw~7@rLLb^5oh~1{%nkwhqtC?*3UJO%v&F{yK?O9?&?bV_U5Ke#D<3S`L$vVX1TW> zym@ox%gf6zZ){wAbE{fyZEdzrbYkMdl?kVca_?U#zhBFKU{~pDt-n!kZ*671@;B-G z{rdW)&)0hvB{WT2=F`Y7*Kj-UvQ?*mn4*#rQ+9TCpR9FSl<=lan-*1ne>caveBH6W zuH9+JdL)-DTb5)Z1?u{QuZz+AzK)@?vT}}fd0+AKbA`XYWIj7Pn?0dy{?<<}?(V{3 zV#kWl+k*OLM~@x_bq%-7^z+wQ*Rsri{<-AE@2*<8{rvW>b!&FwuadQsIT8(HVq#w0 z*r=SBmj@btHLm4GE0@{{2fm_xTXFeu9C- zhp%6ky7$ZVNEkM4*kJH(@AtUN7xSNP+_dRYyL_F3flMBjj!c|$B*y(wQXOw+5by`5Ity{NFqSx)*TPDN<-_rH*MRdSN`_7+vndue$0@&zCM2b zudn%Uw@-V0p7)Y+_idSQ?K5*Y{q1?{Wy3UE1WKn)3GlV9mkV3lR8;22rRWl?pc-=d z+4=DIQ>wUcm$eEUy5zxmbxSMvRqrnxiY*g_Rs~jncM218am}3T!l77l@KIl1cV}nf zMWMNJrQbfEFSs6?kh`{2NU`MtYj?D;mX6Mn1q$)6CCtCQUT=^w;hJWPfRnjSo^Qs9 z35qv%R(v`<$u-K|aQaM6c0Pyu`=ZnZojC4p*kP)8_tqXstI|ou%`F0ttb&|OQ*WE? z3|J}P^rv@9fbY$n!n?|@TD1x|z37?};A>eSaBCZsdsKGD0`JJkf|o*DG8UE!DVF4^ z8F;@ISQMps;D4TSUZHBqn;VAT-rZVQ%2Ry2&(VS5M#P=%(H&Y}Yy&<@Z|}VIrhfaD z4LkgghOQ3#_*MM#mcGPyPdqd3#k>}AdNJpFeEg!k6RbJ~^Dh{mw>iA#{Jv{eZ9AW& ze3#);!&`7Uk6#TPv?GBo7m-j6EZ#`R~cT~0D4U+^KA0&x2$Qp zvBjXqHiG*UiUUXO|f$IPFc^x^?QWrAw=}B{00nS)EpCR{uAB z{i>%gd$)?-h=_dmd$Uo)+TN%8>=m_~x2t}c|NjrWYv7i?K-HYwg)2N>i#TyCwBMzx zXwGf5^YS^qPoKB?DYgjwQf|+<-q6OYXdMkv5#(fg;HIQr^oxmcP8=WoJvgs2faX$m z7~Xv+yeriH?-yb2eShO#OQcDeHoZQ#RMd&%qj-0;a8Xgwp{<3K~oH+hY6k5f2?_R;bJ>Xcb zU(%9wVC(0+%a^vCRcsNcQdSLN=3)Erv2kcee*RtM@6WwnzyI8}+}j3Hy;tXM z4Epx=w)>s;uebIEdVPLY@M#Iy=6J0TCq_obnr}DL=UA0?Eq3oWN;@M__V$)*N{Wh} zo*s{!&5ZN*|L1JBx^Zty?rpQAy1$XHC6@m9efZ^Nuup1Nez9BF(7qf2k-O|;4@YthuH`H4M zwl8y%Z)fM1d-8hyezpb4$NNCd%{$fa_ue?MJhRo(y1AQsj@8n2qMV8?D<0S_TLa@#)j2Ro2;S#btQv*LrX%wk&8;P07vm z&B)Mre7ryX<)x)dmMz;<`@2l8?nmOJ$&)3m%hs%%;&-C2e>N9i+hTV}Vkz_v_c4&* zG0D3#qm5TODL=n|>sHg&*495ipU(%4x0Jed3kor{^JRiE|ChywtV@fEif(MnmEO2< zBWM!1`g@*;tD=HJL*3tB7Z?B2ZoTA)|v zT`3`EUq8OFVc|8yyc6g7xwx-ZbDQR_ zDwR@fxe(XtwIX(R*_Q0<>vnC9uxVy=a(;M#5tOYMc20Hf<>sC0Tja!1*gGYFmz%e> znH>@!3aTN8Z*2=TKh6oRVG7^gTAA&nstT?R-bTi7o}FpjE*~2GKcDBpc z&A7HUI=teaS?;X~a~8huUKyvou=?Fat4;x@4Da%6r}?$tBqb#!c_a)Ps=mIuxU)F@ zTl9^rW|=t(EdpA1*K+RtcuacPett=#7W;ocnvZsiM_)O)DfjlF9!YSPc>6NX_r?37 zqM{Akw_mq%o65x-nx8j)_G)llIBlJG#>GXhbL?to9ha;2d94w;s;)NUUQFI=g%$zR zeU^Hrrc-}@em;GcUDg$inwlD){_yp2XTA0J9=WwO`|PsluCljR{yN3(237TnTY?{} zrlhBrAJ#66-+%J$_4xXyACJqY|NZrKOU}(rcT(*>olrh<bN z3Ekb?-|v=x_P@u>&Ijt}Y)(BrjZ0L(AuLQxTt9Bl!{XMXR=NwrHrRc;wkh`ahf9xt zui|Pw`l>9+ySDzA&K$daWxmcWEyKwQiq0ammS9lR0bd+}N3_Pu{=J|MsIM zt#0en)mnCTSrg}2GS_$Ow+NKBz4OX=c4lUj`wBs}!~gxFrV0r;T?yS~=W_efNz*4S z0;O}OOlZ5cy?t*rBsEPGx)jjPw;_K%xbUnBcq*PU)$vA#}R1m$@#JYltx#q)>+qbul|4SJc;ict{G~ns<8CQTm-c)uGn;I zgGx4|#7ik_lS8~_n{BcL>3sPvjPHL)LV`lBbxMZp;-Fhw8lBt0+1~X0qiZc$%JK0U znvKQJw}2`mQ*SR1b{@9U{TCh{24&2SS*of_gx5x&R-05%|@8gr{@mH+emPST8o}LEw=Jtpf&Z}vPiW6q6097F?EQ6e^gk*Gnx3&nB zc2Akm$HIPk)&zk?c@u>$32G`Ty2L80E>YHvKJ@Z(K*S2L(UM}}PU+|7JoGr^xHkEY zkh^<9dHWI-P|UfU-LOL_YEOls{GQKk*9`L_PfsiOvH}#>i_%_fYT@GM-dXWc$<@_$ z>b&o*;&Bf?=kHtJ7Gk>CmD{2Y)G*`-G%g8uim&}DT31*1<@I&`^78Uy{qp@6Gp<;L z^>T7GB_D@`s&l!jNx=h$bMtIZ|NHyfvgU_Dx41rN)H&+-Dns2U4^S%LyBmAp%H_+K zzkFZjJNwdxL}%X1SN0rmuqbo_mE~ZY7;fIYxn#+b4>!~23(Cozd%OMqy3!?5!V)X) zJ+ro#fAe;$pK^=9RqyGlUtX>0O2{N{zMS5U5fcXV_tSg@dBqO$wFl9?MfZk%IR zd+W=O3m1b!rFXTN=Ig1dw5*WM+SAh1+ss38@#X zJg;WGTUN>xDE+di_>QTot1D<$D)DgJRLgbQ*Vj#%vSNM=D=TZvj*3p^-`^M>ykYqI zI<)$V*42HcDa#yBFEg*RJL>tDVfW3?TVuV%BBC32Prl~4>Ud}Og)5R$H!?vD&zHY0 zyS$kCt}bU@^*hT+lO|-Qvmt9ZLimZ#$dS3|GpjVqgk zxbhgir#Bt;EsFnrzHamLY-{Q4ulLUe-Jd_z@vr%oE8o>!QeUiViL3eO3R)0fRAl7b z&IjsrMnp$v%dU1~WjXQnaf?7{^ERr!jFEgMpToUB9z7R=LDX%U#_Q~tZ<-^#12!#5Xv zi!7=hdxE#nKfaNhK5(?HN$^~_4T0o_vz*xLQ*Cf0{wmSmz4I@`}9o^ zcDlkU7Vb3d(EWHm9|5NbJ59y8pT4$&8lQ@w^yB5Ryr$;L=ax^Ozy-incQ23SudX($ z`6^gOzE*MK2&`SwQsQHFl2cJ<}s{EIfF3@yct4t9sUOaw_V~JUVs4(vKe|)H*qFoK{s`Qk<7pbZC{p zp(0PtmveSoFIft1tgULFGU43M-_Ajkz@^z!cGx--Mi;s*i-p=hI#!$ zkg2<^Q&JoX4R1u;**{HS(Ynn$Oc(OWT3ygq@&Y;Wo}84~l)oUmmb@17^7MRoT)uwI z6`Q%%=bD3v+FDrIkS<*R2Tcu@#&#oxpTU)cmwZqpvInc-qnwXq4NvNx2W=S#qpY!7DW1VZ;+f2X7t#VFmlyzIo+iyRe+u_&J z5WV!&Pd|$DGv=(Rve;?nsA)K<_NGxiXXd3V)3qaCiad$GYUMTc)b3fnb%~13?Yken zTvRF*7%d?JT876KmA(+NdgAiqB}-J^?Rd=BCu7;v-_QT`)z#e(YZMg~Wh{%1*Uh?WtCTi?k<|XT7#?o`+Joo zvEn>z&O0CX%irwJ-z;|H=5_t@9M}E%#~vjK@xNtUQ2KjA(e&9f=N-FxCuh%Jrc<)j zrslJ+d`{22x2SYya(8#PMcosIwYN&N%5@wb9lXoJw*BC-Z^!HxUr&iY`RL8bWDApm zC6O0;>sRi&H*<+g%w3y|7a{+a|7v}5`Npkliwi~n?|J$xM)9pv(ay@^;&l_M{^>9X z&#&m(9#_BgPHOiq9r1!I;hcYClaiF)-rB1DUEr;t#Gm;dE!_1?WRwVSy)wzes#s2Y^``#0Ki}PM&AGp=x8LsH zmODJRA8-G7tUm7X^sD=)T7L_Qk`lDtU99oZWoI(ut*v~|w)5`4ye0D{>xOsRxAsVX z=8&~2OFF8*`gH8OX63feCtetS>6Z(5cjN!;Uq-&RduROkA^fy&?V0nppY8CiG58!? z_p35=XY%~oU!HZp3MKRRSk4WPuUvWO<08FaZw^<-z$r4W{gWn7o+_y97E-ludVF0Z z+9na;y2GGa^c4G^YcRaWUWFLZUpUS zVMskWN%d*p*^?&&&GPTXEPOg`$`p6AL?gctuWX-90JOESJS@PxI@<9)-R5WTU7Esyf$QZ^^rQxBNb6!&mO@ zZC9rYzK7d*XIhu*Iqdx1oVEDd+uO$F?_z9hY(T3_kM&48 zpPy&@^4{Lv*8*L17rtf|ZV_;b(E56S<@E1RP^Gh0QB|cyz{xlWw7M3wy%E7lp4grd zpa1vQSI|Vvv0iE81c#r~?Jn-VawX(guk`Vm#_1AfITGvl{aSTx;wqoGIJy1*|5;~d zW^T#4y6TYnv}gsAG zWzY(RYgW@%uJ z*|Sf}*Z(>Adi{PsAD^CUg{$re``bAF{q>cTn>+d8p;i}n_u!zQMWt)B3SVAQ?US)| ziinWdw{KsMjOC>D`+j-7j#wnNLijnS?f*ZY=U5iEz2E;o?zP7M6HiV~28HI%ojW5U zBR_sTE^l1@=^9s|}Uk6%FPuIU+AbeZ4{7ztQ z_|j`Zo}Qd$X3zeour)XC*<;fy)OkuvQ#0|?lanbaDI1EOdaZpNqG@k$|Lgnv{>__> z-|zh{2U;8O;6P*4aUrYl)!rvgo#F})zaDh?|3AlEO&M8PPtXi4Xq-PGVS!txOR7fK zp(UP^Evmoi7#bShxOp>EcBR+PpFbZye}3Hd`<>>^n~gyOOvn4>uUk#Kurum!=G_g6 z&hK`=w_BThWyZO=)|-o;`(1wAD{USW6qFR`ej;+y_WO0SfBdM}mUlO+ko8Nsot<4u zYHB8EMfcWSEw5(X+?*~fBy{M>NzlNP4rn*z+NiCId}n{k_tx7|`tT6zGT+(9?v~#_ z+r-N4bNT(g-+8l4G8ZLoS~YRXlp`yHm%q5RRU0&&e7F4m({;N~?fbe%Aiy0wpi@y< znJN2NKKte-)z8n*KVP|gUJ_`PXV%p&UTHJX+JUdHuAW|0cB8q<avRwFaJhp+F`7Z(=?IXOjWXeut`mXniP6TSW1mx|NVbicg4Jsq^ASWGu6V}=h$ z;M^x&oKEF_^K3l7zq|YL>S}TC>3XJjkN9&WdS201^Wfx+-C6XM%eLyvfph2jK;u7b zyicA7ahzT6~-VZC-ZrAzcL>^e%#sJefak6 z=+_ob9a0LjAGheOiQ7BNv6&6D-(gqT+pKSQo}8S_$;o+9W2V5OsuRyF7AhY+c<{_z z>+fynEiEmt7Dy?&_)athm48wbesgjvwp^Go1r%;)L0!g{3q4fjoQXHzx_ebF7pS!D nxn*5{_lh5fV#|uk|NQz3_6gg?{W!|Nz`)??>gTe~DWM4fdJVH? literal 16208 zcmeAS@N?(olHy`uVBq!ia0y~yU|h_=z-Z0E#=yW(u;AS-1_lO}VkgfK4h{~E8jh3> z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrZR>p*U{dfH1^@fH94W>;emhD)uXvb7;FRm=Dbyv5VJ;k34Bn(kM8`GynPH zgU-*+e4q34%z{0C=Y6)lzuqq}K){JZF(hSi8KV=2qRZU<`)t`NR)lp3ICb1o6Xjq$ zbLa%~hmfT*iY)?LXU|zC?8LFqic?v!MPSur10gzdLZ(fd)^;!asx1 zz2)ZS#0S(l!kp8oRY zX7%@bzsJpdKFcik)V;mcKfmw)zt$=B(5$P0yBQYR?TtIXE%)|~&FTE%>*J2zy*u|{ zGyCOrvDTZ*($CLJ{r~Upvj39*|NVad=FU!Gb93`!eX`xlm#cRz+K_cs%PjYn%i%U& zN#iu0#>PhT+P6D)Sk(P`sebA5<(C&0GAq0H9XWSyozL!Was5w^`|T&qnBg&5&9~yq zMfZ;%J{V+g&c3eq=<#Dog9L_~H*e}hZerORcm7DHaOB=9)5^+95mC{Pm;LP-FRTh( zZS;O)NI-yq?<^BVGqY)n7Ad`X`u2Su7+qSW=vll-)!g=ZPW#2|2VPWUOLPKUY zo*gfL>uPB|`hLIu`JbPk8P>$^p0?P%Ur0j2W4d1KjhK7bF+1Gmf=332syF2Tu z)|V<<=XO5R-+%bz?R>7Ui~acdbMn)xTagCU6mU~O1q3G+Yt3|iJzP#*y@nuQZ{{8!fq@-5exP2QG45zw8wa?tD z{dO~*Yr&cM_VF+8@88d)(bw0BE z=g*f{R8?u&|NF5xDLs8T!?N}7?(WvMw6sinTmSQ^_|c0O12b=ISO~Jo!oou1-o1OL zW*VoTxn=w3!(pxke||jf@0vY(Hj~D|g9lIj{QUfE+~P0Ur>1B=tE33o(H8nJLyfj=NySwag)Uh7P#Ts3U z-rU(4%s7QpSZ&J9>-X=+XI@z`@#ePg_v_;sr>x)i%d4}i%gB1!?Ag&X&;NULwA-tl zPgcZXEqqu?R$>+Zh3FcH_lK3VIuu>6%vmZ&WCp03BW zprWDzqkP0f@OCp@0s*;(9m zFd;y$`i&uLK-AW(r6q4}1X@;nSg=T=>(j5->$Mv`eY>4MTlV<*^ZtcJML|tXO;hss z{|!5N@?_w-IhKp>6rZ={T5x8D;o&RaKxR#zJh|w+?RSlvH*a<=(m1uyxm|>vojvu# zgM(?ub$ONj{ryvaeR=7Xm9=Wp#EFSjb_NCkh2`bzKRn-F@iB=t;9kXJ-p#k-D;}~w zT|U1qh#~dXmdv!{|Eqn?gQae%`^_=9UAH^&$?Mmv@04DTJ@xMH?x}|kIi(yrkzLN9c3#&ajpyg*o7dLAyJHzVd;ji82~eVBoD#V?ZRR#v z`??rT4vv5~Z{JQm+|ECH+w``H>({Tpv?5SB_2;LjUWthdH>I7Gx?Jz!lB<{)q8(z= zlXv9oS>Mb{OFD0EyJXPS(-XqQ&Fy>JyWX(9txap@%$dvHZrr$$YeA2^{k=C9b#--J zix)2z5*JV3_V>rf$6O1xWL!M78 zUWc0X2nh*^IB@dwhl@O2AAiaI|DVm1X3SW@;Pw9A-m_W%-`D?-UYHzSDzP>H{=GHs zl}}CxvIfZ2d~m$HZEN=RS^tbD&YoR;`IeTnTlKd$fecUA?S7|q`QPpQ{h?wC+yX_qy1Vmlyj$2V zXB6wq=yRW6-fqsXudk=ytXnK?6&n+iadXqso7=9fjeh*@-MLn7@e8lN-neyZQ|@iE z0~V`t&(E`6woOx0^TpRHz1UqY-D0|D`i#@g%s92@?d(rqzp7eT%!u7xHgWds)7REU zUwm28(%$~~N-LgD4KFAwGqYV6zFv+&RaJFa?owvG zHeTtr$&-Vp?k#(H{)OB7ylo6YBMY|E97-k!HK_4Krgsw$>qv&;AYerL@mYvoc>Vsdu2 z`SQxo&#p$DKYQcGovMVKml_WB_5ZbM-)`Ar(qP0a%3xz-vtjdQWmD6wXNtFN+ZGzt zz9GkG%kF8`6(1C8e}7xLW5*0(b-#jFS2VZf+-#aXd$!isCCip2rKhLAO5C|?*CGwB z=aRzo1~ls;zTutEXjO zUw3h#GyCNa?=HpvSZdyRZ{=(M=unsU_x5hwxbflh`Soggdhgm2zs&#tr@g7ENsCi? zt{=NZzRljaoE)9-^>KR_Czrp!Cu_i`uK&JRW9`C4^Fv<>e0lA^c-pP4+0!GX74zH< zt(d0$_h>PwK-y-SeQmwUPL-~8{Iyz6_v-}BDM&?qb{ z-1F^L_Oi##8^eQtMOIZ-CMG8zo~Z18=GGmbloS=+s4WR!UtLWz4tw(C$%kjN^O-)J zF+P8%?5_R4AIki8KNO79&+U1e%<*=z!7A2WWpBMUr=2}jBWqtbXQHxu&~iUnHJ=#{ zAt53Q7cR8S}l8mC=Y8LSQx+Ex1c*rTJ}k`@ID zkB{{lZ_U2Ah_zcxS4msD+i$LwVa11pd9~jnL5Y9)a&`B9xwRj%`(!MI49=}HD177+ zwk{@e;a@NRt3QAKytpMZ_;Oivbo8#$*K88&<)_YDw@Y~6zI|Wb-JQ+M&Uax~Y4)vc zx!(Kh{?4!})ryOYD=*2BmX@BT7u(g}&;R+^*~PBiVt4BQ{{`jD$B&bDt$Y09#fc4x zhe6@|@Zm$BITjOxm;2rQvSZt}ZGS!-=HIbvmr=n3hj+W*+a2qd_s_`CxV=69`PA^Z z#0Li&x5s|JxY+&Y%jNTL?5X^mEAN~!|LyGjPs={uKG{%QncLdx>FKFxVKL*`+1bJ( zA|cOK$M3J(l6kr9!-s-Pmo9e`{a*dAWBxpUa8qM!7gS zG5!Aj{`k$CGsWX78Y@3P3tZm!bH}U+69n9PBpMfK%(1VZryaiT!Lw(_W*8>FxV)Ud z^z}8?p1r#H`T1;oG8KmtUR+wrJ#XGT6?OH=Q>M6V&%3KtlC>%EaNCU=H$EI-=ASZC z_Q1u97fmj^tPWeN^{x5m<}i8r`O?>{N?rtTadCP0`>Shcbo~7M{PTyy{2&u{m%ZKb z{a&?iZgFvOVM)o7{QLWs#feI!Up;Z+!~*wzxwPw7ZES2R-fTP$Dnx8;=e~K9^XJbW z3G+OehYuevJ74$UK%)c?n~;#uiPNW*wY0d*&CR{MyiS}uw=DhqyplIJE|%Om)+_z_ zgmQmEa`NGqmzR6`_^6neO!?X@?5r%su2=fitehoT}QMMcH5%@HZ->B0N! zYIl{t&$GI!vBp*J10#c#tD|9_50g!(wkL<8OYUSIiRwQ^v-~&|TVAR3vDa%%2)1@W1YrSZZ>(xinB5emzTMR3A^pB`g-W#!Gm9Zc%3peTNm%mEbhKX z`qt!w>*Y`E^ft*Ltp@~`5 zyt5xAy(!wX@$~6~cIxd`J1uWKeHyr2VZM;Nd)M4Knq_4RZ`|w@Qcv%i`+DK_@*Q6r z|33-zci*?%`mOa>71O%!xgik@JZ%4prGIl3a_u;u(|xt&VhgA641>g`mxX7({mr?z zL9Sk2-;HO>ojAb*dm>9Y@?M>0{;OMk?9q{u3(^V;Huv9JdS~LAnhyWw4->S0R4!R| zXrZ%!ID0$);gge(tv}%omSuG0Rmc zY56hvkG8<0vec9V2b+({onPo&&+31;?ZQIlE!ph+_BlKY!q%>O^JSL6HIG9c9bG$W zB>7|-oZAcT?Cqb%&VTSKOS1m*SZfa6){Bc5)>apkhwqM3)ah%PC{RCrLITgcz14~L z?H+%>dGpu;PTr*{4-)k3ZF|!uDn1DKD465aF?;hVgQ#selJRCQQy58fLX7%+i?#b>dX%vq$m{+xVbMWpU#Vp&^Jj#LG zl03&I=0tD%BkFK{-NC!%&Jhx4W+d_`NX96%sCi0oo(_q~u(`Ue);i}-hRxGwZ+P}r zNmkoUR+IGKfAiL=*p&i{m{fXNQZ@9e)N5UB1oVzE#cl%DNzq z!r3Z4EoLvj9+UPm&ub}t-ShDAd;W;JR!N=f+dw*5AvrC%WIoYvtNCnhTA+}m)E>)P3kMXapH=AEBqDj=LJlO`*f`KRi+ zY{oU8w_L3Prbo06XS~0+*Jb@LS=Y2b*XCG#6o0VWzK3y3>FSU3<~1@u{CvLm`>zuQ z*@{`Jt9cf0Og=6oaA)3%6LMM8m3Y{0Y-a!WgZX@X-SKZlOgu067rRON@2#v{8M{zm z`_t?3^`KT2yL?T++n~IRe}8`7sr`PpjfuspDlVND(YBbV)L2DB#%eg-KorM z=KDIIq!=!pSgw9MEk~7ASNdeFUtC`=AHFWe@U~sj5sqd4^Ygalet<R530K{&~D# zetG)&c~@2jw>LB}?ECdBx$Ws;(5i7Kny92wU{ zFg`xkxLn<5F4w(#$0im$KY#eoPmwnF1t&5s0)1zhX1n?L@JO5G807A*_^4$6|4;GE zf}c;P#~VoSyeP2(jaXb?FaP%Tc6Ck7&hz&F=RBWR-S_nL^y^=uS6o%;Ir3IpukGsU z#5WPiAI{9-)QytJce}e^{$9=H9ebJtOb=YXJb7F0?OClCudR(PEGT&J>gwt_*5&86 z*jic5`uF!Y^Rdg3M~@!;^W6Ub!Mk_ou2`XQtY7~8m6gHTe{Qw5wk}z|eERKWD^_$| zxe~HD*V585b=%*$i!@Z!)fZpCU-RgBPY+K~adG~yn!37wy03$0w@h3i<7#;C^XK#R zP4nk(WWTa$sbS5xH;tOX3o47Zt`^xE;^NX0DUo}7Td%uZCCgkt_naIZhUxn8&ptdn z%p+mIV89kU->!B=@!hW7e}8{}er08F8e^I9=VxaR-@PkqZf<^Sd%k~6%$%1yZ*ES% zyv$d6nr?L4^y%V<+xgiOetvptl6{S*yu5tRo;?}2x9LvTi#2-t{o`?YVF7^y_x4t2 zUS7r<7Z+DiUA?*XciHCa|6VNa|M30$@w<2DR(*YS@m>D^pT-hApr)Zo&J6)`b8}GB zz;QA2Zj~OFqjT)}^Y`-}Jow>+a=`w5AL|x0v-dKJh%6~MG>qrd<8;(ohF{r3M7PEJx~*s*KZrktBbpFVx^@bOVmRc-zG z`T6X==zsu+pdg`syI&f{>F1t&d3pKA&!2|L$9RHguiy8pYkFK&C%arl!oF0cFhi$O(Ib?Wab-&rOP`|bZ7_;%h>V7brCLpur|Ta>;M zIe743!$*_bpPrunxbxkzw|2F^X6*a^?VFm4O3RNQ6`PY^f2|VJkMntcZZ2c;g@4~} z=P!Hy|NH*`7dNGPKRY)!yXxh99_oUBd4F5B4L+rQ4Ifzf^WqF*$wp>eN12>rIJ= z*+4z3+uL#rOG{OCbb6AH_f4EO?bxo;*FM*~8Kg|JT*}I}-7MU+X%oZa(iNX}?A|@Q ziNS#N!qR`^IT!B$SktZtO14pE>)>+&Od396EaM-n})xF)=c+ zyUR?g|L%W%aWVTY`~Q1y{k5#{SUs6BBK3U6wKb70E_csgsIFca+x7Iq>%^yCKR!5H z)JPobG1NOQAhf6~)hWa)B}JuMO!v_7drt8PEDHs@R2wFdP{(Sz1*|Vc}zLl$bp{N(P=R~`FoyYM$SxKW5kELf$nC%9JCMRK0x? zMPy`pcJH>9ul*wU@Zm!XOUs$J?pMFxn{#8s!JI9(c9p))xVVV*Y@VU&)%(?wyUX4l zx_NWvG~MWXCG(FQajEY zT8BMC4zzL`6fP>1Y}1W?&@TVrf?~xd&lS<(Z(p_S$hEEhcI4c-z9~~gf+b#-SnVo* z?-v#}?dDgdhE8F1rVppI*H4%}{rIlZ*FXMzK0nj4_?d2e_Te^OpP5FjkB|3nE_&+q z?A+YbpU>OJKa;xhRYq2J(U$5Vw?p~I*F+w> zT75cjeVnaZpUlav+1JmkyUHVLHAOpooq(ul>a}}^4>xbkzW(XSWdBER-uNtb>z!d; zuBYtYr}MpZ&z?O$p4y8QxwY|fv-GNpdwxk*QI z?)!(N@bCNc&Rni?!T+`87dFW4eV2NuC0)|E=*L_6CqD`w+dsLwI`I%o#lOnOy{k+$ z3}wHtacuZ7b^qp1igvuWeyxl>IX7~1rFmXmtVi$tvkN-(rr!DOct9>9=%@I;s;d$n z+m&_JL@l4FrK5A?;K7Br`t-eInGZEwZut0I(^fgV{N0?7b_+^h_n5DmXUF?aY#!U8 zO_kM$Yrn6IJ<97Tu+n{kBPmy)|*4|RN~a-FL#x_J+*X6wv1g#z}uj#Yx?^S zci4&_rS2H~3*(P7}p^@d%*GG>YbgK7U z?=Z`4`u6tfIu8!TyxD2hZWAX?Tz1^w_N&Owojc#$-0XgIl}XA&rx(|F+4#-QEz@;W zY1vRP>$RjL4_jAP*BLbpo}a~iTmJt3Ui@A6-M(#EFJFH6a`~8P%eD3G`+ddrTLh+g z727Vp6w0xFzS!Q9OTpQ*7H-=VqaWMCCwt&1E1%2+1tF&h(X(HBUR_z~JlCq!!^6WM z*Sh!_kHbvMdF!t4udm;hbCXGe**D)H;evF;_GkP-!hXRC2Q9A|zO&d{o}2h}!f(qf ztCVYY1-zY<=Uun4@M@8I^;Yej#z(78Xg9I-WrY|0mU;8=%+KySwfq%kA-km%O(fhH z&dxGTzP&AX+41{zzje#X%D%j~_;}gxB}{mK4$T`RNMPp(|a!lwS{ z=7sRLMJ*T7B+kyYp04QJW{`Z0=hn8|(|>+`mNd-@*_kb}HfHCgoUO-XfA@d9vRGO2 z|M}^<#fz>?5_&SGo34c1*w(uwk$+X}L;MMg%Z-A+G0@9d+a-DkJWwXL33|MzvgMpw|n$bT-XQ`uh6#Qt#l{zCLRU$PdWkShUu7HjE zGgke6CLOU$By6qGy(?NRD@@YU)9=-Ok2TA^m2zv^tXZeFWL}vqjg;Ow8b0&ZJ3`d~PpZyjap8!J)PP?m}nwXJ=+6&zj{EV!N7W zv7~X@hu5=uZ%iwWpQM(OcBq;E(4C#fQWaVR%2kYvF6n@VD^4wNY-YHzuhyDj=FFL( zDYbupv!DGteCCYLv0iES$!fkF{QT*Ee|=r{eADL5FR!nce|>#@`lThFENpB=KRzUK zadXeKD%FbJU8bs_(D3f=?%8|SPnsn3>+5Uxk`fbcF&zaHlPM1#B<%b1>9o=Mzo)d< zUs&ob&cw|8^5*8{FN-xwe|}1J>yz)U98R_rL^2=MNu0K0K|z|HB^N5DbuW!Tkjq{aw;h?`S$HwOKU5r3hk4%cAKo`8?m>_wEFwIryxT*)#ouR@Sd)h zwtnK|$%n1q?>T&7p)=!+J(b40%igZK#lN6QrRU0oxxDA?`MJd${{8~xpsODslN-F! zW)B`dY}~)!e&4=*Ev>B|Z)L9!3&oO^_l(cm9A@UXDL8Igx-YM- zR$N>>YFkd`E6J(5E@~eB^QWfn|KIXQj~?CFeceJmwQ%E4mD$P1dJf*ZXYqN%S#KhO4e+x~{TcUPwixz6=#Kdk#s*{1Lj%fyKjUEJJ^ zl8$iXGjw&M_~bhfaI;BA|eIf-bA+XNCxHY28}&}68`UZ)(2{8 zw|8aT-lofNdt2`Ar>`>`c@kD+{{JQJGl!#2%T>x)dw=?95E(s3|4&B(28QjbJ zQt#?AU+Jc%rT`Jv=;-Kuf4@cl$@@6}qGs?igNzFbd-m-4@b&A{$^LeVdU}0|&TSi# zkM~8t;}6)L7kh0@8;%2msW+YUR6~c>b6{C>17cW#(As6 zfCWoZ18%v2? ze0t4#My0?8_Gux%N>^L=Y+1BqNz0ozIZ|dh9-f|@;`(t%u3w+NOLWe=)hkwXfLf*k z0u6r4mDSbT=gg7WytGJ5%g}J*p+io8{{G##dGqQo|3cqO2(Zmz+ryy!R`Tc1pMrO+ zmKe|}GYdTw3uc#}1b;a=R<>2Lhva?LH!&d%%`}Qp- z5043WPVeihtGm}m)zog?KWlxA@hZ*uTGqqu&C{pfn#!Tr@+>0tyhpLfQ47ge*W*{m zb_zIUO#0H3b?DsOV^gF5%iL6M5jZrbCD1ow-<=&(c1&BB$f?-U<{@#l#r|JI;^8an zoH!IsPHU}~%)POp@u>Zu7SP%p5sOl;OP6~u|L0I_*`c`ljpWnk&nHiwyS7ZyP1?-i z{k;O|%ax$P?Zm0JiyfQU0=F;Z*RG3RSEhL^Rq5SM_qSRt0#29LY)W6EX=Uw^Bk`ilS-HqmiM5fN+gRt#gemE7hOwBb!=vPbxol~K+Iut;+2)b>NPbr62@sgx0c@7w?=10d_34^pG~CQ zet&gcmU~6Yf zVCl&-CTtVWT+?k4*uLac!RD40mScUg(P_VTzu)J*+;48)>lqg>UYui9dg{xMD?eF8 zOs^YHdhP1O5tz8DW#at#@~^M0U41FJ?(T5G6 z=iXobxz*Y}tdnt)QDVKQjJI!_{d-5ht0#hjw|fUVIX%<=a;u_()Lw{YyjfMI zTCTR7K`-6GJAbS8&f2n~ZxIZ2b)~8?DptxlD=`STt9EI9pH;q??ua{fL zdzWGEs?v%Ihb-RvIod4((@tm|)=*Mvy4Y{q*xS1+|NPxp(6o!zA+5t6+BUX|nw}ub zoqntIteUvpTt)rg|1c(Ov%O@Av!FRaKW-Wp9!Krx!y}zQqj<46m-PKK|w9<&WRKE%TnPcV>oR^Nkx3 zUS3|SHXrk{uKJ=8ZGLotM%Sv+AHSVz_N-FnP;7BsQ6Ta2_wUaym(K?+T=AQ4cXqPB zoo7sp3^Nd@Cm>#?eow+xfLox5^wsn%M ztgME0e=4TwM!OXi8QK5&z?_+xY4i8XWfnHJO{u4+ty;G^=vc4x@j3kV2ako_6+JR% zZtrFT6_piHZ30di_i}yNr_7so?%UhjH}}9o14N=+?s;dU}2O`+hJrl)b%WSotZ%tyju*u2q=j^{lCx z*Lcp&2?U4!Hm-Q%SJ&6eyZ6gIt^fa9Ue>B4;ntQ+P@`_1Z8d1U&gP_}Tt>#mt2c*r zi-@p1KerNQ!HH|vrcIb202+5UFf(Hz2&5a8dC{%rUaq!8>$(>zYht8j0 zzw6c737MCdeSEk3{i1JGZVYvG$A0%rnsnf__uH%%0jJqoGH$cY^Oxn{-#2B-ln3wM z`=_L+2&?<4C@C@3*Z+UDX5%H$aL3*6Umh<^WWK7$I``fBdlOqG3OL<~Xgz%5^5x0? zc0XG>Iyj=XWCYGNy=&<1?j95KYISUz=jmw$uSCAQ0M+Fj3w=fT7GGN%eR)^u>sM=z zX0fs#?i7ZkYE^HKD-B_5du&0ANX^v}Lzttswd}9}hsN7U2CEp?MoGRm)zS*uEu`3T zL5*{8}CYDdXP1O#M*j1ugSXj7Y#}0$EGZIeD&f0tGUte3x z>3!aPd2l^jThQ95gV)wV9J*xgy2GXWe!bET3JQ`iNMQK-`ucM3>3X0+fVZ38dAz<> zv>p^JJ!;i%mzVpS*V^aYFxZxR`&jw?+T(Z2@2^b?Enile{rE#(Gowk#w*U@BlY>fi zy3d|GdGO-JiZaRaBbS9`WFJ0q-Ks6<#PRlGjl|zSpU=zK*UkC(`1tDBQ?iqTOPx3h zlUL1Iw!7@@tW3_&uWi3va5l-jbmU9L-Cd=7zFhKN6SsHPGT+(P5?Ze=4%L4A;oS-i zuxYu0sy%Psyy4*D(%Ss@S8(C$Yil2Os?SrfvYItv!h~o!Q1*XzJ-(iG!IC8{O^2Mk zy1E%PG}_ku(bD?I$70sJmtDbfbasK^{d~W8fkfBWX@BivUag94 z6nGZG30mpo)+14P`MLi*o0EUP-#_2RE3GBs0_w>vS+ZnC?&hDxOB^=FNhdy$XR+5^ zU8Bp!%4I6FqI}T?2@#$DwIZ*3nFDox)>>o~y_mG(tjW*tqEk~eD=I1q9voogld)is zcrVMv&%ghr9cYZ^rpBIFc7KD1o$d^e|1)jS8SPQ#U2w$P|Xs!yCrMk<-ewjz?1I(7X4g!_nKQ!8G z8eeIPG9PfNi&p8$inzTER4{)m50i9rb#;C6^y$jjW4v3lR6%w6qxWl!dO)l1+P-nS z#|JGc(@bSyb4pZHQC$gcbG3)IU3_zMbEN!k{@Yf!q;)cqnGYVkWG&>>@j5b9A~W`- zOex4&Dm@_z-V?YLTP!)1MYrT|F87DDcG_Deay2zS1r-!A{)aqRb)y`Tl%70W1vb06 zWg?f1Y_Id4$B(Y8bKy|ja!~6qXtK`c?+uMFRd4U6hj^`%=2Scqzs9JijaT~EXZ`(c zy}fI1Exj`(#$3p$V}C@d1S=ccC9^Hf&#oEons+B#rA45A<0*qpEV|K$Rt7`zibCR& zNtd$Sx)yQg0&d*4o;tqNWxU5D@UP7PPK%-;XlQZQE|` z@72=q04tGnyI=cV)_0ak;)w~0CV6*e7$zSJh>2NK7J2p1eR(4z1@rK?UM&JnwzGH^ z@2mYSBrkvd-{0Ss#m{)MudPXZdTMIc^ibV5Zw{RIuX1nh)x_XseV`IU`MPQFrnN$a=s;jsE_)#II7vu5!+gnMKj0v|?L#21-skE$k zYa;EIzyGh<>aev+wzhLEi=Rc5p4U)tsB!}tKh?m?!z1C%jg6_>_WypjyX4gs&IZfk zX9nr#Wc=n@xmHwIu(Gn+{CqOm+&0a}hbMhqbpOLAH!DPX*QbZ9@)VBP=md^aTSTif z;Py1#XrqJ!4A<7hM(0V?emp7;X@Z_RR^j<3N-xG|@87D`(SflRg;IQXmXt3scL=(6 zcK&veU-tj=Crn$MCtH4MfyDi8)&Dks?p|5vz)?KQ#&@{}m(^UphDnoz_++h)?EQW( z`kh_uu9AftHV7EpTU=tQ+IyJ&JM)DDf>A$1^3RqZTFC6PyXdo2Zs~(K|J&~uDoxsS zAb~+X95gCw*;=5=996M0_T<~mm!Isf37nnzY5kKenU^g}UI>5&MNd!Deety_uJ-HI zqVF?JGKD6q`5M{w-P|{S#R)lv8@C!3*KVCw;~vH0SY@T5`rt`PGn>_l#UH;12$pSI za6R(hZ;flsy`p>g6}PxdPWvIqgepE9WPf>Y@9t3kgbkaS_4Rj@a5gnx zUFXK3m^DxB@QJHer@p(pdv&Z^@2Bt64TPMo#Le3Ca;upZud-sxie8l-lSAkEg@nKz zuq%p*O9YD^uNGKj23lsZIgOXw?k7JR_s*B13ks8W)I@@#L^e#)t@PEEgZB<@I(GL| zrj?>g?y{2?OUhTp@2|UIv3v8I->O;DgA(iNKzZy+T-Z(HO)mHD9drHm=`&~mLNRMz z%S5*ux1ATe6|M5)2(jtte#nC(&^j_z zVy;c)q`4cT14Ufl25B9=9qo6SQ!z_@HP2$*=xrO`v>z4Qd?{N~UY=7~(dBK*)bEnL z^7ix6a^D-RO;6EGVQ3auv~AO=c@vj@`qZ>U1=L39n5CY$L{SKoT)hr?IPcl3sLR{c z4RPbNmWgdw)^h9VO_&5OhypjO^q7E)>?~zY<=&5%zQGQEfAFMb zP^O&RgjuV~M4dPSH?J}3QS+a7X8Y;7K4ocG`el=hU! z?3pbcvwIoDBAxs<#jH9pJ0_eLtLb!HAHI8vSN0VSBjbfDINrR4B!;%oZ$0mJz1Cyn zk!m}4?9;t@&CFL;tM3Jc)}o*HuT9sFPdnJeIyK5^PweipFI{iC{g$sjc4}4s?%jpo z@)TQE=$gp7u{Afk%T=~4pI;}{+^VZsr!HkSW!^-AMP(ODB=-LOb{n+*{;g5goc8uF zJuL!TyVDM5+}@U3^Zjml&A*?|v!(|g?IFWF3Q)=oqekl`<`1p8GFJSX|JMZmzcTb!?9lX$~^yFSp8Y>gm_$G?tc)ppV9B!*VSKbLzg~MV(01N<>ULw zaAZxC-|KJX7jNhXJU#WU$Gg@%r^GBJE$Um1`!~KmlZ*#`UPVo}mfqR+=a0;%qT(I( zSBiI7iW_Py>b|Ag8Ko)tfhmM*@uwGGt2S-gP|}UqCQ#c zq7M%oH|JVOOW(1v$$WENkvcGvNdur|59}jI=wsI_7w>Ws`+edwG zkMH;7o--%*RBrjNBZ_-!nG09Guexkzd2^5mffifLr+q8`y5r?r-km!w zV|@2GIM&JW+gNn9a@%QspWzh3&)a_S{?X&dg(W0Fqh8y#Z8Og;e|U&>U2J*Y>&xfu z9WJ%P5e zC2y|myi<0V&Hdx4)$0Z8{MXOkc5|ccG{Nuu$Cno-e|uve^6sNsf6WAUx!NAaz~)oA z=9QPax8w;Q+MzyQYyaKT`WIJ)X3wk0s@eJWS?veA%F3NS|F6$B&s}`|HRqSFY!6O! zT1c6d?9ROXzs91!r>Epz#q0Y|_r3E!U6=Cr|6lq4zdyY$y8U-gj^_XG^%r%16eaF_ zo3uSQ_1v2Bh>g2)*8inIA%!~7GBptq zc+enfEt;)*GbIo7hH~#r$a{tfg_Vb@V z?tebL+DCEK@%Y4+MGGYMPZH7f^7IUJ>ycRa;_EN3x8}vqd{_gH^~=|v-ez6?E`*DV zEAM9B_jh-_^77v4-hO*~yZ^~kr*@_8Zf57#dinC@(``3*6fS1csH>~nZgX#B=lb62a@K&lzhAFM%e_C)$h_SquC8w1rsC)4qPJ;lXsigZ zZa%mm=jJ9?LkXUz+p51_4HtEoX_9$Kw_nrct4ENRvB%`aFV{VP_^|NsLB7zH+1Ee$ zS5MjX``vEsE9-)n`-x^<-&gx{d9&8)+}qnkv#u|4?dIB=eQ!@?>n&CmmXH;(u0MZI zzwfO3^ySOW<+eiZSDjDxl)Wo^!1lbmTz_Rt3JO*PSkLuyuc)YK z%@T3aHmRNuSrhx&cJXb~oErvAOiUbnd||t%SYO&znyuzPFX!X?!^e)b_1mfU`0H{eig*$`IGn=s*W31}OodZJ2; zfKw@`E1(#H!b#uiynDU4tnAsVtHU!dEMWY8w|xGsry-}R-|s#C=xBFgY3b9==j~R1 z=v^BX6cPg3^l<;l+f7<)ckGz)_V#w;{ChTGYonHyS#Hn$`RVDK`}^mA_)q{^2W^nR zu>a4e?pvv$QI3v`>i+Xol$4rwzuz}|W$<#)7N*s)(^fpqI$P^zoOb5Hhlhv%{QLbr zYkH8Ps;a7mrRB#@r}aU@HVk*}-UZFN9o^Huzxv0+_KzPwCceA#NqyZ`k@L3SWj=oV zxCYdM40?BB_xpXPZ*9%KxgoLn*3ynB_jksZ_JG>pj~*q(RlQWbyzSlH-J3Hnt9|Vf zN-HWZUKzc8-L2F+g06v}dBoaZUjlcF1fKSk$h@-9x&6Y+k~HC(Uq63NoIQJWQs|;9 z@9ypft@*3?cvSqV-qUSw?(UwxG5NTVl$2LHpX>~)(p8|c|J);X1JI6yzu)gqzj<$e zeLWMiZh7jJLx&C--G1}tO@N4NYu1skeKMAZIs}y?b`&VuR(%QBJ?HkL_wUbl2r7dT ziG1A;#m2_Q9%*yGx0_sa(>^AqBquu`ZsR?jvt2tq(9j#SOF+bR;erJRO0-_Qy1H7d zKI+6JS=*{9D^_TL+V1!F)n3(mzOAydQczUXH6%pj-o1N1GYlHt~_}l$diLd`_dfx804ny^~HxnhNg_gX%W%}#;`}6GbH3=6T zzm(s*cTYq_Bp@hADN!Xvx&E`ssk3K$@9nKNPCX?OwLS0bt*zOe{r%}DC#hyl56eC~ z&vy2iGd`O(ZHm~Cz{s#~-##9xkbg$+ql&-23QbB*etB^*duC>)&wRVNj?HYI>!Vk! zy4Dit;lZJ&rOK9_IqUZc>FMq+E-b;zd;)jt1fIS+>vvC!fKx{Aopewp za|Sg@oX}RpgF0O;(6#dGuH8vjxe^!?b0&ZP-?GEcm6Vh~1B(y4S_Gn05>-}(CMGV- z+}0FyyifM=sj1p;?(POPS{XegIbiR2MD;gsq8aT)TGdEmcm%kgwNyc!b;*xuvA13(Lv*d3thg+_=#s zE_OF)SwSku((jkN^*83-wKB`S)v|y8 z{##Eu6iqz*E_Y^a&An}Q=3R$eVIb>dh%Y2HKuCyuEns@y=6G%m;i10K(Sg%ZV_ce{>$4Z6A-w0T_j tOZdB(?K|cPIB_iGv-DL56@~x#+g99MH}Cg}AO;2o22WQ%mvv4FO#t~{{j2~0 diff --git a/doc/graphs/lambert_w_graph.svg b/doc/graphs/lambert_w_graph.svg index 145fe99f8..e999657b9 100644 --- a/doc/graphs/lambert_w_graph.svg +++ b/doc/graphs/lambert_w_graph.svg @@ -12,9 +12,9 @@ xmlns ="http://www.w3.org/2000/svg" - + - + @@ -47,7 +47,7 @@ xmlns ="http://www.w3.org/2000/svg" W z - + diff --git a/doc/graphs/lambert_w_graph_big_W.png b/doc/graphs/lambert_w_graph_big_W.png index ffeac2c446b58bebf784188060528d02c27c1300..14c489e372ca7491ea537373246694f9b1c383bf 100644 GIT binary patch literal 20648 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYR>p{4{eS%9_0;FNFW_3P1-Cr4%&CZCB7YTcZCoKMOm!{O?x(2pNJEXcaLs$A#7{rdm4 zt3p;fMMT_?t+WmNc;~C)llSlY4<;yBTHd^~^hx2@SE1`-cc;BG>M}_=A;81NT>bss z+3zvu=h+%c@SK@%Z-2j7zV3(OwQJX6_SNh>@pXOF)~-%r^-l+w`8O0kc1t@y&$pdV z_SBkxpNc*_aO7cQUhLLuRIVw}>(<6A?Ut0JRR8BA`~N?m`Pc9LCKVP|{>T4V^UL61jNMJ z7B5zQdwcu&&vOdtX*VosdH?DtwZ|{;NOBkX!?&>HiHqNy!zqC4hee^ne zH8nPd^78LVSBuqM-Q6!QcIV&s@7L>^^H?9C z@u_k;I%VR-gSWP3-`tulURYQdvO27nk(o_EL}beHy9b-uZ|2NBQmlFgO$x7#uu!ko6iUv zK*76ruWjk8D-SO$bXHMS4cu9jdiiyFdV2Byzu(1w{avtZ_au5ZvX7+_}|~&CLiyUEqQ-$Zq(MSkH6pV z-<*5f?9Sc0m5(~rSH$iv+b7lIrdwfb# z1TXiSd2h8{?XQ5vZoERm!jZd5G{3&Oy14lHxu4f|=iD^fmVe*R&5f<})s@5#4-WqL z_3K%txV-%NO{u3dZfsDLwJuA!y)F08&*$?smR5W?$o}%i#^iH~t zj77q#;x8{QF1uS885#NK>-G4YySt`t*kMjP_vnqRY;?dD=P(1qE zeht~TzwuE=e}DSVPfum+>*hRplJe*8UrEy}5ji=z%3FW`e!m~Hr($B@Vz;C@gkuvSNySu#j*O$yT9?7QFtFz~o=H1yb zasU5+vtM6de|eEBw_Be~=ia@w^UR8$pF4W&SX<)ZwvDB)!=~v*yA>1|IJfiZeyKk7 z_qLYL?{9B8d3bbA-YzK*;945ewJZAP&!3tOs;a7@H{ac>ejjRPX0|GBZ`G>Y+uKf^ zJLeY}8M#taJM2m3_x=C>`ZK=T{eEBY+gn?MuU)%#>gv@{##86d`^WAo@%;MgsyE}Z zpLuzCT54))=c`tQtzDIMb=A_ev$K}2S-W=X)TvXML>AoIlDT+Y{Qh~%|LX7mvnVGw zcWQrsf7az?y+tJ@A#rhWub!NoTzSj(&xgZY0sH^`TD>Y{5so>h^X(_S6v6h3wL zZfs;^q^7pE_S1Lo*4?>#_v#eQ;I5i@w;qXw3|mWIhh5&o$jr9l+uPf#r^nYtGG<*} z6}s%XTc6CzJ9q9(xtO6-GWX-hk04`i-n=>Uo_cwC`PWC?`dUk;aB*`7H&i{H8vaQ) zdT&)}=-#TYHlOYOehFq>F~9DYXX(2;k&LIVUAy+>p1Z5-)6Du$Pdr2S*VVFWq^GBg ziij-9y1s60PEO90Ag{Bt&Ch??ym|9xmKCT3>Q z1*^i>uM-j${;V_q_vc@4x8I-A+}sS(8M~{*&~|^yNukvI{Pj7xxuK`0>4rKuG<^E_ z(Xcjt;>3x|wpm(QzWVumet1LHg$0dS7ZDpJJuEac0UeW`S#)AVNm+E{cwO;%honl zb7?L|Zf@??21e#jYs|};gVsiwe*O7;{_5A)*FXQs{N>xXFgrWDqjmqEote3q;p@la z^4d$c*q8YG`+vO_oxie`TU^V*caFuyFLSnU-!5g65wP*v-00W!&0Dr8K6(0dsa4sV z6@0Q*ONxq$uC#Cpi!8WT`#m=J_L?<1S9cU9v#xk}xPA6L|D_@G=Kt>$Ru@^o#xFN# zecK_Y70&H^TmkX*f464d`}p|y)cN!0Z`!&w^!K;7#%Is-D(dU&KYjdov6HiNXjs^^ zTN@IaUp9Lbu8G+h#F%wwN8!(Tudl6*-gkfR<>mgXca^@@l9raFMdLe}8^fPCNV8dWK=L+q|d6&MT_EzIyfh{r>RG z%*ojW&omVN#`8`dYkuWZe`yNk(uMd<3V(5c$t=e}#&mNSb>NMy|V zey8}nrbBCc`}54(o74SMv$JO}zdmtyqW+rp;7bBlblt7CwOx_ zoil!ad&?C7s<^J#{rmIt=dI^$6K2nzZB_WlW!^WCqvp+<*LtmN^C2gV@97serJk-i z{pZ{5e6E0gyI(6Z(wl-=h11RM@ojG6HX>;1yQ`^t{`1n|K z!7{(Ov)=D?m#b8X=U`=H(@IZIpE_}3;;iXYr!I|&iMdky{qFSiN`HU<)YR0ahYlU; z`dTaYUi4p|+h`|8@-)8F3S_Vo5v*3se7*4DnYJ->hU zY-!W%Ybr`gO>f@hT+Z0OsE>W>^6PQcy65-Rr>CboSWB9Pzgw~I-{0TQt^EqDi|XBM ztG=B09`kO`9W(RlCllRQL~qZVSE;9`r=qGl)zkLw?sEM=TidEH8k-xHA|oR~?YJE~ zEG{!lJM?cJ*RR^Mejg81RL$>Rtp8;-m>#@*+1cC6 z%gM?4bDsA4&y`)Pj$gehs;<7A>9r>J&6_uCe!X1oGv7{j@kNh>goKsU5biQLSluCBiMO7YK6sdMJc@mc@=-MhY^t`8py{N`FseIIx) zJZ?wjif_|&qd)cBIVHPSOiJq1x3{-T|FcIf^%7;!i`x^i?Dg7^l|l}U(%)8xub(t^ zYO0iDh5D0g!530%f`WrReSLMeSAhyRHJ=#=iqG4+=j7%|&K@aRNr zXxN;7UQEJi=lrVf;<|vsESB6Gf6iW87n^;{H!5o9?sz9>=k6N$qHK+KQyGfdce=Z{ zJgL?z-+pPXjiUMXc^^J}u#P)F$Fg`u++M56YQDSH@)z|=nKBvhI-eJnl$`nA$no8~ zcP4pvW+Wf)D|~dMGid*_wR`^m`>hkVXU4wT-$tdct`t?vdMhc0@R*t1iaR~qURO72 zOUITiTZ-;p6%`jh-f#aeW7fG-r;;8W>143^{buvBpX>Mi(&FRe+w=LHwTxAX#(Aqt zmoINu7c9` z|9^jva=l#_yE|xqU2WK!h=Z#_SNnWkAGbH_*UWn-{m;r;l`JTHd~8kZZnN|4)0Zq! zxmW$(mLaah~Xid3l*f-cBYvI~&wN+Ew<}Ypzx4 zj~|cwU*6iPJzX#M(aiLDih6qM&SV#rmOeeqZ@;AQ@v$Bm%Sq49&i?#-e!Wr334t~q z$)v373mln2No-x*Uax`z1KX-E4^FDjUy^=)UPVR4loyllC->X71$F&?x4Zx1V)xB8 zKR+euPT%dlF7NKHko9qQP3|8%))uxlit)nE;^#&;zsKz^%iUG-^3Xin>J`!3^+4UE zh3#@lr>1EB^efW=HC?CaL^_?FW%~2k?EDX(KQH#5Z?`4uDp!1b{N;7>>gwujd@?6q zUS6Jgc^U6w_x@);K0a<;cm39_S+3n;4<9~syuYuu@2 zu31@Hj*gBcudnsaGR>YeWlGET?dJRcev|(H`~Lr~t@D0;eQjL-ujb9$x0S!&Zhv`s zIsfHlzK?I`?_ZjDxQ(HbjgeR0ZjSlAie}yDZ2|l1YT0-s4xE^%oOyejE~q-rt&i8= z`$fo0bJCElw`N^^acgV#yxu}TKfZPA)|I@xq8JQPXRtobC>je={yG>wUTA|C1*vR%LHI92^el-anpo zb=AXn@6J6q*!)?xxv0E+dD+`rHs5X}AB_rMH#__9`@Grz{{Egkcdl<$l~rS7W6k%w z&_aH3OG`R4_qDgP``dhE z>FeuTvUKUhdGq}CR(-8_xAS?%?QLsc3g^wYtKG0|o0^@ST=PMP^>KTBjz7=I$=UIK z-|tU7U7x;vOM7x+qJ@QpfUNACc9-rS^mdAa}dPW5>wKL6ERx?%I?#lg${mhon- z>*?W%+Lq(F+;48)Pq}ALo;-N-#^?FDxu0`0R)?-WwjywGK~a&CmDQ{tKPqOK=bzh> zdAZ`*%=AxJlarI3m;252GP$I!t<4Qe)%V#m2`~l<0MnGR->Tt-m+r)?W5oaxK@^Mo(YyeBP{C zUbna9a`Nz~C@3i0U+mf~wrsv*S((|rd-qD-+_?Bf@$I{07PaI6E>_Kk%{#S)oH}lo z{rr^5#KiRB^XJD08kwKzxr@BAdZ4uXaf^WH^(QAMb8>SltE#rXd6UB@XLI7g!DdfC zziAUQMO(hKvd%zvPziuBxwEnwpx+jA!(^CGXp9!=>1=foIq5uCm|X-oCuM+x+Zo^XF&H??1U7 zU!VH&($Z&o-W-Z9mKS3EPu#jS>(|%UkDom|b~}H6Z+pA@%(%2z4#k$b7w=|Vcyn{} zOv7Y0X|tRMcXk%@NE)@wnIrS<-QC&GlUmGwzukVnqo>EjH-6_dAK(4EOtR%_mY))H zn&RM_@BfPR$Gu$(HzeFLRJ{APFM3OcU^6@av70w%y7fwJtovKFXV0D++wPLAKdv5kv1*pirjEmsa(?mtKN+nWR~yvZ=#H~wYU^y$-IhV5T)_uPS7 zx2*2xuFEg`|M&azod!>Tc7JTq`!5_W&c15*O@Z<}_np^brrFd;O)h$BBbm9qKJ%yb z%Al!H3q($aFFG6R)oHOSqkGK% zYOib&d0QAidD}C+r7o9@9^P=3xUe|s>fW@|>u$$1%ND%8UCC{`dtSO%x#E-O&yO#3 zZnvoTpm6f!$ulzy50`LOD7FYpb1he7xy7+_!GZ-ry1T2t=UrPL8F@^UQ?W&Zf0y*4 z+TGvY-ah_}H~VaCn}AbC(uGw27iBhIuLNJ&vs`np)!nt_+9FOJU56i4fkx1^_#lJk z$%VTg@B97Ey6#8ewwo zrsvF|=wf)n5Ip9dT&P&`^pvRH(O8pmNhc1)u7i)9GG1L-xyPbv2g10?YQB%Q?|<6G z>BJEz7!kw4so1i@qD0&&c$v>auc=x;bPC_RcqUIt!uTLTz+1@EAUoO z+3mt&cmB&IIXOCq+jt+(tA3|>?bE`A3(v&=sji%=-m)VyN$JQ@#~Pa>$Fkz%cd>}; zWqf}0=)oh`+&DizyYu@zlK!rHwr*F*rcIkRY}CA`R(yGxuZ(3;%k%m5`{u0Hnj2sL zcj~FB+LzbI+ZRt?v|r%U$Bze(A3ttln{&h9Ufu6pCMKq?tuT4WVA}bN zD^8F9{FH7i`nX8UNL)YbV9~>-Z!!(b)k9XZ-Me?||JBvbmzUkDk(bYn+nN=yRqOe- zH;X1o?pwM!{k&1e1%-Y8er4auD|Ch`D!t(Ox=hy$soFy(S?EL@V-^jgHrlG4s z6xGz)K<${cvr=>B&aM1-RQ%_Y$^IKQY1O!2S{1rFVnae>o^!^tGc&KO3iWn+5f-*S z?(9Tm_ZimZc^jv{yuMz(Y~4MbSc~;C+QN&NjHI?Qbaq|(*WY=u>FJ-J(wC>}W%i$% zy3mbR*Cy)sP$ozgy@Eg4i0_AH@Pv0tVl6T7I=UZQPi*H?DTy3y!UDS#zD;9o@si|4u z+AV!~=Vuw&vwvl$YBnEqcz$kf$7nfLDPtv-3~oSWv+Z*OmdS~?3_FZ}&}pZ~xl zRd0)e2Mnvj)*iZhSGK&oT+MIJi5nY}E8lLtz9MGlC*62!V`ES&BJ0YEzzpfd7d>)v zboTArx2)3B(-Sl>zPGA$&DyoxvEL50a_`u=^Wl>xArC%ZUl*%vYb&d-zn*EnzrVk_ zqT<36zfMig+x~8T{XfgCSyxXL*Q_vDxNzYdyV_eOwO^j>{G{XCVg343s;3g}Ti#u-`F6D@PMu16duyvs+#ZPw-;RMA-C0*x&AfJbbGm;} za4;t~w=rvYBB(oCeBSo>)z#r2KYe<1J-&Wv^!7XkotPaHKqJgGKa1S@<$Tl9)Hpdg zL4Dzii`|P~UD4!WV}AGU-JgHI-!GH9WB>n;^Zk9bH}_N;Cm-)iJ>Dk^ipK0~I&J*> z3;Uida_z2oKDQjyn=vypyK&=&fVjB(QZMtej=HZ`!}ol@SG{D(k_&q(i?6MZ@1H$8 zdgk8eM;D$J*j4gUD0sQw(|-GZ8ezXBjnf2#gn}Lvb7~g6D~b#Y-?wSg!xR|_o@eWp zq--iaz!2kQRIaKzd9j1$jpA!I>+`2h>$>}M^NrY!L+_GIwuvv=x<2`Qa`i`>GVw(Q zPo7MO+^gpHepX7@ch$?sr=R(i>+${zhozmVVb#xsHBldy-?4dg>i=&|uU@TZwSVmy7O}#m{*3^z@dM39I=eyt}jW%Ia`_26c7yx*reO zZ*9xKbd9sPr%L@yci=Ul&xb=FR_SxIfS-W@^ zuHW~ID?dMfSDEfTjalE`-cC+WPoLGdyQXzR?`wvFVy5)ZUyQt;rpQ!;wt0!ZVSasd zbyPvs?peDhP1-q&D|~(P{Pdq|?iW1ea&b@Wuxfw!CX(m*xg?8nKIf7t-%68|PMwy1 z`n>(q+SX5BT}wIKu1ay(nHpUC;`(>D^wDSc+l43OwVa;5AdvOf-EEpR{g-3|_t({C zU0HGP*VoseF3*i!rP{)3J_j;PJ{@G2PcV@Jjk3(ODm`@YAY;Ri9~Df@%%9gBzj#ql zT3Y(iq2~4fH=EB(m}Cere7|3B?>${l)z(&)ot?ez*Gu&|bLRYbxqQBl?QGDf zPUOAAhnq#U!)7#{Jb(WEw1ZJ{C6Z1H7cTtr?yj`6;cn)~$9hj2@6Gz`clqt!wQIMy zyC$YGSW6ddFfCVAO-^3g8sNJ6_BE+BYw{MqyAoni8&y5WaMTh|*KZ@rsP zR~N8)+PC@u`?vM>_A3IJo7d{9zWt#UYIr}t`1Pfw+@Nvk7Z(?&q@-L}6KQ+kPBY4YUHYm{|$d)KU4W3&4O*P|y-raZUs>2+($ezZedp)S zDM2kQEuh)MMT-_$l)Z^)Tz_?$uk_{X+qP|6mde;CZ|~R4#@lsgs~Bj8GJVSKK5O6U zieG-e-~agG!^C$+Ef=W{=jX1O;!6K65AQwprbuifKBLhk7K9Gw$!ReZS{3pR{?N z&c*DVJ9Y?&r$76<{^*j^0-wHr*Z;c7yHEt1m=EztS^ZCtd5mw*QaPsf} zFPR&*Uw1lsU;fpVi*1_yGAn(ruVOWS%O&>f+ScrF(1_Eg)B2TPuZA;j*uGue!eU1L zzMpMTTeB`MaAXet9k;g%G|QQkoc!_IH?}PYxz3$CSMuh@#uL|1y`B1mi=Y2^g29D7 zm7kTS&$KL715Kmvt@>(o_Wa3{nis#{T;?ln_xp{plCtv3`2BUA)An92k#yRg3@VUk zec!zEv_MtK!zM93b$_Q66&d@!=qH@3=Gd`Ljd?JydO=?7+yCzJSDBXk&E+cA>)EmO z*4Auc0f7TAFE9Vx;<3Bz?Tu}@(*3sIBIbQ-X5)R-t-mkf%ZrO=W*WD@c#&cE;{o%% zs@H367N6lN`uC@@jaT~E>h=4)qN1c8AL~tiaG=p7=f;K$sYULGL1R@57ATaxzjt=OtY>m2wLj3=gTE; z&={HPzP8=Ft(n<)7KE>lv-y6f_{gzimzMj>FY}$9mKD6zOSGxE`SV=nFR$0{|8z=w z{f8^T{vR(m^9u?JI`+%iN|@zHyuP;f@YSnRA3S(q)4b8f#)gBB&n))n!Lw(3eP^2) z=H0P~t9q#_BO}AX#bqS>epUSbx_t&&S5^p`W?$1eXdP+BGb#?FVlDC#k7_@WO{R-pPlc( zzS^h9M>Y`jtzHkC$SKDo-Nebc5bchlMV zvlebn?-#Sm%)E7V`fRh-b8{aqoxbIP=CQ9kTLeTWA8ieIeQoW|S&2u#oVPP9*JRpq zz_Lc7>}}KC-HGqx)-DfT+9hV-==kBw1j*szGz&x`z!SR!LDcPf;a*jBVssw=iAMVV{Sira@BTib$9D&n+ug&S~K|<3*Op( zT`&6c5#d|!w${6^SgIDX=e9qG;u-(ziY0%4mCl)~`&=a|HrUJhWAS0Oi2ZVAxtG?> zytY!fCd{3C_QApCnO3E%cAnm3^ZeYw zS64Tr^@`b&paU){UIZ^v9I&mc?e?IqryRpG>_a%q-_YA7HnRT6YE8oxL z)Umtc-8P5B#6+KYHZv+IHm0%uAshPoF#yke5GyJ-+_zionG$ zE-YjgR`&zVAN~Km|G#m0<*%ue7xT{j_qY7V@BFu1m;e6G-hE?N+0^VcoZJtYa#*?c zYtC7rk;C=Fi+#*g1T>cPyzZ?zH#hg=KR-V&d&zv< z@9xB^vwAi%VtOr0y$@a#l&fT^`zso?b<*kk9Nb^N?&nXGT*qw1t$5+x%ebYddS_p{ zvNE{+&6}J_lO}QTE?gPBTnOCY?7aT4CTZuCC_ST|0=0b~csAM>Gi|qj_VC|xCZ0&Q zb#^~A!qZzPTvPesws=O##|NGJ zvrb={S@B^Fi=O#gM`IP$#LXp!X2s7FL@RsNw6jh8`Z#CP?a~7mPjR__o|-LG?#sO} zOY}|C_3M|mxUc0ZOTNmZJjZ)Q#Qxjgwmn%l!_T-!C{nCq7_p)Zr6iXI>DPk(m4`%LVywQJ+~@9uKkUw2^<>l{nw z_PWV~$Rz_a2We2w>$6d|a+cF;(|FPKf zxzFsufph2XgmNmjL`KGN=tghr*~vX^#_k^Jq~wRa=3DOO=kH}bZ>K%|qM%bpedHZO zMR9TQnAp;Stg@m_Wy(9)cn_TA?UQW|kDtmQ-6PGsyZ7JvJ-t>@p|EcpNT**Xsn#gem+s+`g`=SZ@! zI_^^Owf`F4q^U<#@$NFSXhsWPPczUn8>OpS(jPIXk+Dcb_-Br9^w?#m7&e5+e zcE4UIi~ZU7=-i$NmzHb44JEehp6SKFsp!%f5yN3=X&JclldJ^GhtKCP>^86YB6wyt z`&8{4wmdBYPV6Pyt>69l_?So9Oy~R_PGPkR`|InCL%+ydS{jtCDXVTReZ64kova8B zMKAAi#VNC9dHMM8e13M;_-yu-6@eS4_jhz8THIy3_nOwlTs-&l$x?8VQ zXv*$3UTGnD`TSY?W=%PC@i04ML19CboN9gUarOC!9z68A_C|hXDZB8)JE<$8IOn{5 zf5UrPr?+R6`^C*ovU=WLm*q@X&)7X_(n$lSkffJ&+s__7c4Qe|&i8s%M;fYKqO})n@OPgf9zN<(Yyba)je7;;{8GhV z3+dHVuUUKGB%fCJhS_W5ystW~Sadb_Oxu++UE$@kOd~=Me2?zI7cVj< zO`bf{D3vRASINNw_5PzdHyGyEFhy@Wp<$ueqLIFfd*Q3AtBs4EoCwmNKV^zb(xIo9 zbZZ_m@yK!&KXc&pn;`1M5ojg)=EL{3zVmEmE|-%I`NTT4Y5BaSGdN;fQSwRgIkwX0=C^xJKD9?pu|{=l%I{sw^GT0C*aj+vSknq^ z7Y0@S&aL?1m~s8wov9p(M`DjYs&ax38h#YNu{(UX?%|7zpN3BnaOz-+jPcjd*6u!Y z=FB5~gEE~xzx67rro{(3aVT=76xuGV`}-^L`Kz;+T0iIAt@xT{QOXrpvG5PKuoK6` z{-a-8yiy*yyj5%#Y!Nu5^X{I&tsR0%Nn1WQfmR^59&NqQ!YM3q>HoiI^FNQcEB=;l zn7UevOR;5VL<~o-q;Z@6{`s*bi!U!vd>tlX`|F&DYKy=k2QhG35Ba__uw=1(eT%z1 ztN3*5V6anPTD5>y3%m9_paYqMA3 zYIemIfmFZp-H*+3ZylLm|LPLl9F>f z-&4>c4ke|gCr?s}ii#q3m+7vJ-o7kIarH@-Mp*cU|L!fESmS+jxmP zaRhSh;##<4hXoTebL7S(R_(Ag3Z|x0=gg4-_07`G%m~cj*!%n4Zb&}88nUAz^tV;Q zPp>5VpKVvTpMI6Sv+s&ehZn=_)u3S}qknI=s4btpy>F6Hnsb<$%+-(YT^x&ww%pPV zx*Iq3Y;5BN<=EDM!)?5go6~wTt&EH&E%TlIY-acbP?vH=pz`GsuPmv+^z#f4GT85} zOAsxV+dV@=t31~|b@!*0`*mE@9YoU$RwYc|yn7B08*@d-hT!#+E^lq$z8X|2oYC>v zAGGmR*_Ds?=NibzwgzO@e)hfB$N|rfw=?*+t!>qtTUdVmd;FoJs~x%QPP43DExJBW@t^nf#gB`A{`w^(B^70+eS4qmt?l}=OF>ft!n^ns z)z#H^mA#Exl-lE_EcudEW(Eg;yIJn36-J<#bG)t?B9*`Ir`q55`}NCuhpZ8Z+MXv1n#SxF(^XPbT(~EDm+s}|{^}*p758RZmt{O>JIU(ZD&Q2}CF=C= z-#^ei+O_EXhfkln&Nj>a@t~QXgP&jB+Ish%Y#qVogAE5?+26l*ZtjI$TPwMQoHznk zB((-OI4~Heoq6!)=4Q~^TlM)hlkV;=zr562{LY;_FRrhbxBv5j`QpWkPh<06%GhxD z&Yra!v{B%H;G<+GMn*=P&u5JP{QZ7kMMcFR|DH`!a&qOjo9Qbdt+9 ztoP5pAJ_L7_sg}i@tz5uAmG&DH1&rKXbKOsetBE&?PJ&0MuV1mzkK=9!piE>rd01$ zAuEIAO2uw3^`73**|*EkSu;1FDMsIqL$PFegrbO~dT;3yJ9H+eNzDEZF$vdRA|@*DlI`UhvN*BGU2et7p1C9EvV>N4XX{ zxAPgMpOaw#waI^cd|dhCVf)67D;dONEUH4P9Gy581|PLjGf6nWz$a^U@QM#jdVWzym6Vl-b%d8b@i5xD33$0^dr=jOFGFl@f6+#;~3;Hce- z$&)5IRa97HUtgE{_SV)nH#f5{6=7s#1g#bS_V)JWwbACFvG;jj?*;WrnXU-ley>+j zT>sPp7R8neE0bCSGBPy&{`#tHZ7pqYZx33PF~czV#jUN{c6N5DQ5T+_ojubmSIW@P zu%fcku`G<1zX)~zj?zV9!j=3AA$ z$@sM^Y;9DJw0YlTb$>DI7SN&?efxhb4Zdk?7M6{h@BH-UQ2gR?eLJ}LVgN0B`(~7U ztmonB_vy?DljrH}RZwiXU>G|u_t&e{>xHDGyt1;iw8PdMID2+&$m@+K&rAUANRhpq z>i=T0zn!9q$&~5wbu-V+wccF*{+`n9_`OwAZ`_Eu{Mc(z*?HyJJv@?A6j}tVmYtp# zu+(enijb8;pr-KWXJ>2v|NZ{w!(sl`ZSs~yDvFAVKc7XXrzCv&qV}w)GAw%ArCx#Q zEa5?*Hpr4c)$U){$b7yQ81&NZZQ(YizkLiTsoC#KU03byl9?sSdLfnLu8y&>aCP-> zrP~pak%giJqW?>;KW-+eeZCLo|>fEVo_dXY0`>y`} zJFd{}Qy*T-J#yE*T=C22^Y)XcPHo-4-+p!YdNm!Lp7Zwq_nb(brW-viz3S?-xnEvg z;hNpUlk@uOq2qgPwDqFHgAX2NjhTBU*7Ib_^M->CtySw8g@P2^L-*{uY^3gZ}v zgX6BDqP@Mn-yDmBb1aJkyf)VVubX9_AGfOXX3B{JpoC<6_iKw)`8&|+htnys*N*vo z_@FTvTntw4dd+!v9cUGdUF_{FVXsEMye;Z20*eyF#GU5XeB$i>AI00?sJUUCgL_`9 zz$3lnLd7R9UUYab^}5v(6d?HSpH_=Nxn?)_!r7kw9vq5a&OX}3`S9VxH8J~QW(Qb; z_7yEm7P~II>t`4rTkD%XVJ8mR%{z3zbO_HO+1G3X50E}^Tfb5Ryf^8%j#Uef zmV4Q8PQ{kK$QTaa*=D`d=gBSfJ@LXqvE_nkH}^tDX0{J+x|6qX-jr2u5!jVh_p(`^~X%e0plCq-~W6C^gEed~SM z!^0o~4#xCdJPYOP|4e*&dHLqd%W8Y}?8&?NZ=$=LqKb;je_^&A^BBX|O?RI7R7IIv zPu;m_7pP9XQ*~Z_*7m+hUZ-11l8>&wJ%jhArReIsaP{JFg)biEiXviS$3XLs7ZF)RY z|KBrN59(vTy}kWHs+fLU&&3QA-}Se5wKwjyZa&zs+1BFr^z@^t+Lp35+TnZrdoOZE zaa`4@I=}Lr%90HJc>dz>AfwEg1*U5sUDZ8O|5C3-uIhziQgX8QmY(KjWaQ%I+5ZcscX==Fi#>1inP;oC$@1{!VPG@nZr(BP!dY-qy{}`{Vi56d zyLyX&=-i`k`+mRM{r<aXJbANX%k83^`N;j&$Gzs>D{S5@VJX>%Y=&=M>0&F&0fzFmhwD9 zdS;iByJMPJKw}o$iBlJyRw(VgzM!?PZ&gKUdTR5cq^oaJ@8xwHWOVShD5MB(sx1 zM(y|i|NZg4COB0YgGx)ylc0Lgw3|=yiPkMAj)mD`he{gtKDXsu1^7??LZ9!{1K|357PM$nj z^W$Oro^Q9Zk4F9bdOiO6>Gk_Asex1a^^)ttRuvxceIvcjukb{d6+g&jF^WX7|(7KKa=&(6*k-xc%y-QCWP4h98l z>)C78&ZF9Ipog!~0R+#Y_lv_Hfmwea$b5ec20ca(l@9ehy`|UxE_rvY{$5(Yk zm$tXHO`0+#W!Al2uLaKcRZVes?@2qb+W&s%rqgF8O00Ou2kGZ565jG)P2|x#Q>XYi zb$wg$JQtGu`(j(3Z3X#t&CN~SUiWl6>~|l&vy@}*g;);Te?K12u`F)uxBn-x_~Hp? ze%mAc_WvTD8137)uX5RW^(9&HC;oy@q+1+8~K36%rQ z>wy+6{kZb@mW!+P2Bj8(a>;J)h3#@x9na%sxlah>Dz;p(zAG!dE0&Rw(Ijuy0(g4$ ze~|{xO|_eMfcCM-9Pg8XB`KY}@;i%MyMNR@<45Ecle#|@Y5(?k%mz0EV>j;**fkTJ zl|W@JIL-e`D?Hxv@8@&*XSz{bkfPfUyk_gnu}4lT{O8-*eEh-*pbamLqs;^m1O-*^)Ed~)W?*1H#I$iIaPMkW`r5U_z z!kjripmaIC{`uT;(7HCpmz>{=f~t+hhs0l{`N1!C9l3j0smkf}G+kvw z!;2<=|Mtv0BbT6~%D^DN3py8IzWH=H+g+c3UU}K7_x;C(gFP}|RcznA56zgpewjaL z`E9wnkIoifmmg(nwO<(b|KGOZf|;eICCimhi4WHoZ`{6Jf5X{hyssrqYa~iv{Se=| zPII#Tv3vI#uivZKe8KGYw!DX*H79q+_$N6ry}i9fXA`f({5abm51PO4*dF?tY5x9s zlbjNmbtA<7{Nm>0W6l5Y@7HJkY5!#pt(jk^_hsw4n4M0ur#Wt4v+_Q(?M#D@wozO4 zYMjl!eGSjNWzr$Ic%H@<-{WO#JN8XFu%uu8(jM1?2g~2yGL2$0-IwZ{8)f$Vwf^!) z@&U^)m_0tW&u#I6V?9-mRyy6*`ET7~KTR+3oBn6++|OrTs7LHInsU*8mR% zm2Ru3sjZT=E)%(_W^5e1HhTNI6J}nTqH=QU*2U}$dhyxQ(~~Qp!OPcIcgx+Q-QrjG z)&4%UWLZZ?hf;Qs*UH1~{HtHQc%gLr$M4_T4!QUD?Y&^;wm5KY?Cx*VOmpw;iHzM} z_jj79tE;Q%O*J#Ku(x-2Z$Dwi%*GSYFv~F6ZQ|QQhYsaMUY=)L9TF20GckA3qD5C8 z9&Yc>DgOJbbZh13XG*vC{QvixD?oqG2d9Z|kK9#o)oi_#>!0!E#l@%pq;#XU>`0Za zum2ytt+2Qlw5e!&&h^Fa{Yh6#wM)Bygv>sD_wL;4_j|XWFx$3mTgls7U#Gp!y1VOv zT!3d~b@lzC51xhDTIYV>T@iS3w|n>LW5?R^?(Vv~DfW1uZ2rw<7N(Vzl@Fgj4PA39 zZ>e)T-}ao#dn!LiZ~ORFx2C*APhEX^(q49_J3hw@xIsrv-2K*)=f1!0uSM}Qp2O|@ z=H;5Imv$5;r=6SAxjg+L`>d}g4jycrX`IfKke;6YEXynH)02}bs;Ytl0txSeyq>g* z$1Ny-e@}GX^N$aj`GXd_@iH+ppN;Lhz}Xz6;laoy2P$oyrtE#)&H z4GlqCu2!tju(7cL?LIj>OSGnT-KT9OFM~iwQ#?M_n}5?xSGRX(@$;fLHw@prdGq4V zPUF4R-}f_7iC5Z8=iAj=;<`~s-re1O^3%@9XR9)9>yoRZ&+D-d|VS#xL*p^wiY%4o7dr zPQ1P*^6*mc>7cdt)!*MOjXHmEvHQ*a_4fUCzcM7lHNKp9RONK=;6aeBA;Z?BEm*yPqL6}UAkwCel2vx{82ySBc0c({FM-QQg=-+aHeHX1av@=0gA z18DC|zs)C(*Voo+hy6Zs#D!1R%H{Ml-IcMs&6M4G5{~sqK8<OUP8@jd)t#lyz8EyeN&dnRykh_zWvke@rr zSyt39(eL@Q-a|WYWGtI#x{^;% zJZDbk4UdWf?dXu+b~kVPC$cy$*nYpR`pn-udFEfgfA8Pv9~&#X^6IOPJ?6`r+4+MU z9UH&wTDA<;?=U>D-Nt z^>caOzJKqYm!~HrBqSgxsJPbQLwRj&?S`ne|1*3yd@Oo?PIgW7cD|`oryjnxR@hZ= z{hm);VtO$huH9mZkB{{#NbPglq|s#{)$8Hw`_=Q=>FN51Q;a~9EbW(Hy42VI-%#5p zXUjF!t97aObR}C`S!QNtWx3anj&|Ff=4H^D$|Ya_$1o}?>Os-Y5C49@PkwuA>!lwz zH>WQQTMatlL|ILZEp2nIXSqvK81cUEG;Wjva^#rdGh28`+7Uj2?y&x z?%HKF<7`?;NXQA{2`7`a&bB;y{8&>*=S+5VNr}nI5UrU)y>E8E-?x}uuA%`nIh+~o z>B%{D$`k>?iC43h-rSsi`RnWJOFuq7-X9zoD0uY9k&3*C!zkH~bd+En@>-1*X*W1PJt(t0OWmTc} zWxfGxx|7~??tk^!E6j3lne2$sn<>PbZZ>=3^y%%ZR%xyO{IzPYT=DaBt$xc7w{nXM zh={N(zNpcwAGb&1^mKi9Cnu(DxwqTat<#(T#8iSOBPU0u)NJMT*MgFgoyU&3nV6Y5 zEeu$&b!(_pe@DlGPft%zoI17j)vGMff^hYnbN$q1_}D|VM9v8-{hI=$G-jc+o{$H3Jfn_zC3a2l#{n8aX{`+)V-=g%D$hx?_U4MUnfBfw1Yz`it zDO_nuNlMf7{;p>ntd`z+`0!zzu69#%^Tf%Mo9E1tIdb%T`GB~ZkFGCYA2{HUlA6lMU?Ro)?Ck9J zudlBw>+0qnD(*j;w)x=s^ZaU)IT;xl85%ZiGU`~=ae2A_3c4j7Xph)50U!{9K9C|TVz4qz1 zx3^E6IN^|)xiXxQ$>zVsl`PXoj~{QW{rzpXocGF*N2jK03yWSoy)pUtg93{s*N+}O z>fz;e=-S$7MusMZ2iMj{U*bvD@mgARB->ax@#CYTpe=$48zUBkt!AwF$5#LCr63C< zTQg(zw>Oez)&F*Pba3prn|I@F*?bYj$tP95zUSoPI&@lpe~g?={OV$osv3$Jw_UV~D%PyHJDlM`seiq>5#8g^Z8tCT623meM$8Y(ajTzV1#hT>aGO?=p zVQ}@@wV>QwT~iYikH_kMa~816*GvG7REu@D+WmYY{OZjc6{YjB^=^wNvaz$DOfU#2 zDEJU-o#i*>&YhU`*-m%w-Zja-rgLj|xqfMRd2n^Lb?vvC=`K%pZYzCuMp8;bV!`R@ z`j?aYZQVdg;PkG-$8M+2oLO@3UL0uGf#y^%tMYd;f`Yt!e3z8_ZJbn9Ra1;+zL=fA zZ{oVGf4|+%UvmBR$+XQEw`O10(AV#urW5&S^Xo`fR#wn@m$21S^X~2OY;A3wGI64# z%e>wHE?vH?sjS@G}0?{C>w?CC8lpA)uv z>5Lf?S(%xNn{WE?^71O*n|b5Pl_S?%{t2s9reCdp{paWBh@C~MV!BZ+6DA0ln49}| z$(bi6CW3~q3f|qZ%$yyy)-5hhjv?XfEYlgb)nWK( zieJ8baab7epx6AKLt)`Y9eekpBBMo%7cadY7#Nt5pMQLwZS{iduNMYrEXi?pcD}K{ z-d;zHJMGMjMp5msA76g5O-;>;9}n9DgM*dtJ~hj}rc?9t>GT_0v&GGF zZZym^PIp>-k>P{Q`%m|(--EUxG~a&f78E3um6i4H;^9S)7jD}oCMqg=;^fIjjjo7o zIWxb^nJ|C8yp*(bU}Plc+A!|zw|kEqae4CmIWxno*|R}{yYKehxDg@2!#4l>@~-ag z=F2Z-w(VWDiYqWM@W$S1b2fH%MGmHUmCt4-{|+-E&Qj6L6tuY|BO^niP)Apn zcj3Z?c78`BW^=@}+*tCY#H#Sg3BmQbYLhwb|NT(bi`j9&wPT}ZlYCg}_m=$qf5lFo zJbB{$`QsNCyFcwaEb)7PrCiukr6X#4@7;^D`T1nB01Kmh-H(Og#tz4B?Ct6n*v-zv z%d4oX%gfBnoRORRH1)6KY$F@j4*Q@@p4}Y*At5c=;p-NxUE9kokQ^)^u4tC|_Qpo$ z<$iOU4kkE+giN_pD3L7O;D3Ch=gPHfc|AQn1y~q0H8tasj~+eR(ceE^Q!+WH=EF-1 zvrf&aURSPN>$51^-nXb{V>SEv7K!AZlMRpnl0*rG7_d}Zw?J}_;mra;P|!&e3_9GJ zKD!6+zWr%gLXY7$`Nu1*>rJ*M_ZS|ld0#*6k*8kDSNBc^1_lOCS3j3^P6 z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYR>p*U{dfGMxHZ!$r3D=vO~3W>RI|KxWWVw~>$Q1}#@a7o z+wKJA&yGyH{w;5rx$gI0TX#O6rlh5p@vdu!!U~0sH@6M$-T*R4ikE{&=!n z(YfzB^Cc7SeYSmW{rrYTs}qM}%LavLZ*hed0jC@PzdjB;a674$L$PJY&>JxD4u%0cmOxTGdu~5j(i9=Dx?~n(FV#`ra2~Ne94HlfriY)?S>WL~X0*4-{ z^t1>#Ma*fLDB#4=J=s8rTADg0AS85Xo^5sB$$v-QdLH7)xVVVb%*<@bvSm@bM1-H8pa1;N&(G8J7RMwX z>p6JrSQ|4t-;^wAn+gLnGqalScgvUFx>x%>HYYcCXU)%|owx7rD%B2N?zhyvUv5q0 z<~D!3pDo|s-VTrcYx?xV!^1aj-1zWfaevemeN>cG`nfrZ_V)j$z45;@?~QJ3!-aXw?0f}JPl^8e`nvpZ>fytOBR3|oMsLem zn0&nN*w3oH^Ip8jU?_Wc=j4vU$3EAh_t)9VT9quQ`}^x@Uj5lwrVKvw?dIm)-4*(6 z<&_mpO-$e3-fmyKSUGlAiDBmI(A8pdtxADjeUM)W$=-sM+GG%PdfA4vK%-u zQCT-;s=%@(=_+13-|zeF)#@Jk>&r{#1JBOR_I)OARnpPZ!*f8u?fU5xClao&i~aKc z{{Oby{$5^82QFXU?DX}Hm$+Wc0{4EoGc%2sheS_S^S!Y>Up{}&$75^t-{cDk3p3{K zYjc`1VP2rBh`6}0sOZsswZC`N{4~0E?;ek=)s$;%qi5@s|N4^2Cu8C8{M_8kD=P%| z|M|piXlQt4ZS?fxa@9QY^72!H)I#Oq|%bd$%>iY_nXa<(CZ;4m23e&v$fW-2d;F_VaUdnR#qi z+W-5}ykLRCu9BBdQBhK$xb&Q?ref2>#9y_t>I>uNwu%$YV`=^I3vu^Y{NvTl4+>?bzLAy1UEYtC^cmpD;ndtxqO$)%1$5uR_i8 z@A-Ima4cN7@W`=apI)!u9~2XFW<%oP7k73R&s-nh`Qk;!w%prn2To2_?=9_R2+|D;~%9JAu9GeSDOHFS+ zJ2%%la&sE5rKM%b%S)}GXs@omy#4U}`hSw@>gsHKGAHKQR{!{VJ^tmTrQC<%3|6yoRCck+|{pAXGN zWo2P;adE3+cbA>Icrozj&z~!Q{HU1xRIcIyBkKxL?Jy00e}C2$VQZsSUS94$`_1Af zhPk)46va>f`1rWC!`mAh4_oAad2w--_jJ9iPft#A1-!n#-h7+w$0Ne4%HG~uwPC}C zGr4g)i;m{#K0e+b?xiUzE4!BA>zmEzr$uddY-U?k_xG3D=X=%fZCO|3@B8V-D`9XT zWp?T7Yr0==&9^T1+nRqrj`7sNgN|FXu6q6a^-HU|x_ar9pwG|Gn@8V2)+;?V$V=9$ z!*UBePQm(FzHfPny&(FWQ$dx-aJ$-ph zOw5%{si%FmiAqbaW-v`W#Pan)Gr!dKuc!6*Pl-Nk|No~y>x$gl+a#aQwXct}w6M@n zS69EfDb@Sxj>6=}_ubRdmYw{Sn3%{Fu>aq$)gRxl$iKhu*f;sQAC6a7g?it-d2{77 z-RMyoOYfsJuyKsE&lza<9jMUpNjo|Zt@y0BacHKp*B5YIuQw< zy7wj@=X8sbF6X(zSySli5Y|+{qxBgh4>}m#(XRoddRxf>VL2>DnApN~xCNW)E z6S>)E+vDfYm&e4$hCV*ld-c)L?odC!zOL@>VB4xM0S#4;d(C@J&$FwI0(s@@%ggSm z>FL@_r&tv{XecTv2|3)xYkV`$Q{v~ZU#sf>|GuxKtLq!PyX@?Zdm9p+pT2$_{qTDJ z!$YlH0r`8sPV;=Lzvn|!)V`XXOjmj&jeWNL|32$fkkGB=eshgx#$Pq~^!hJGDSy@?MO%0C=Y?x(NyQ}c#qen?sHzvEYuDH0^T{_->>6DZI>tkZ(6wchQt=&`g z{oPuIum66(mwqm5S>$4xb0fgg(sHG;d!NMf=`9oY@8AFF>(@~Ge?Jy$X=ntj4qqSE z@ap1X_n-Rr=3iSEyPDzatJUkLWoiH1U{d_d=kcD$$NN_wIN|dU|Ea$8`s=IH`uju9ojbSmP{zR~)}?jw_J2M& zv#!wJ|L0Q5{&(-*t@4{|b?W?i|Jwh5ziXMBho`2bO!*yiHgbR6-c8%LhdVktzWVg^ z^whZfyF4XkuE>y>8T{$x%PQ4G5kbMkPcQdB>D}qv&Zjp2-?sew>ljQ6AGu6^`{UuE?QE~BfqyHx+Djy5b4*bOa|M&a-vvsTs9yp}t=db7D;_CVAb?C(}`xCE2&3c4{ zghUpALUzip*S^1&&#yDucDMTdUN6n1eDZcV-}v|IT$Oc`wJtMx87OB{5y1HBAiKQD zIqk~N-@bnjudJ+0y%u)U;MU&i?Mxxt^X_`-{y%GeU&F!n-;c+~DpeChmix(;{`pZj z`RU$0d%SFqZ<-?N_WS$$@CGhkUfr$d9v$r#T_9KaMDX#RNd}+9?E zP5XB5-o0t_=HS4b!D*o&fU9b*IW=#{l}$jnI6KLnVG4gsycDfBqoQz zz==1X9_x`zE{Z#T@uFbE!^7>fWyJMo=D*{f`|jO4lgvv;QsQ1;Tl?|DhX-$NZhrB# zDknGh=Eh|91PPA~)!*|TZ(6x><%<$4Az@)}+0}B^WjU?$iz}I!m@+Oc;oM#JR!LvK zf5i%ooSd8&7ZmT*%PbSc%?#K z*`$QN{8}X>EbQs!_2|SzWrozc|0nOf&pz34wxgp%`kl6^=~Q8LzY7Z-nV+4Tn|RT&_LX}VEKsQW@}lr??(E5P=A4N%N;D_Hg!YpZL_$#pQ+#8 z-SwWV=DQ+(zn!I}@9(|* z`svZ>1Ra?b~M_v+c>xw3HNs{ChT&x9uu@9ke=Z zt=IegI+c}`Jo0vPil3kRcvL(-;?3dfZ(Z8T!UJ-0bZUQpb6tPE_|XwgzqwXNzrDTv z@xzA=9=0o2uC%bSlB$l7latd}dShp?`p1tSm&(=47lz$EboemijZLZC)@5%Nq@SO6 zY}>oLyO}@S&fmW=`8eO%|B2Ih8vXqI)?Ir$?aLvrL+`4tuZvy0W5x-uZ*?hZ^{N~=?*_y%2X7v0LPMvJ9YC$Wvcu+{lkvW#d8Q0d#bj`Lb zeI+6(DcRE2CS`9reb2+`HJ)G6LcawW?ydfQ?AWoksoLQ};^OIMJ%c0+}aX& za>J9RCZ@?hZ*R{xm$O^DYLd4>?u`wNj~+dez7}xtx|WHFNW{pM`Bm zvHkq~{PFwu=il6%em~^FRGEEuHY7Hm{Ig?+#pJ_R6J9X3wX_uc_>d?hB(!SJdFh#k z$!ywTYZ6XOP^|g!u-$ZJD(R66+PN|J?`<5PGPm%7haZ#h>3+&%&)7fTe5t4 z_$&TxaeJ$_(Tc@I~{`k!spZE9nYVWzb>BsNi%x$Y(r_9N| zy`xb1`~CX*seIpK@((mHf;1){@B8>__4-+JPJ4TM8}FO;_4W1R$Bwl*xATR*U|J_A zDA>}{vLWlLR^9)<<&XcYS)=oKdh-0bUoU5`+G|wx{hjaTw6ma|z-+TzqjTraoqKlw z|G)Cy>yxKWP5tv=!uVf;xZq>;KO!zh683-QC^N z)lS#vZ=Y*bs&(|}QJarPgj3SeX60zBt3OYhFLb~5yR32gxh1u~zv)D8TXV;Gjdu9D zlrJwX&iawGMa)AYc6sshb1f|`Q>x}z6gIKT*9cf!TPrCmOPXW|yuGzG`O}k=U*6oD z{N+oDn%|s=chm2#0yXpYe7luh^6Eldvkkx|1{m`OS?+5e|>*{{>#hDz0X&z zI(6<`-&F1Jp#62V&(6$rzP!vA)U0>xm$S{du%PkdhH0x;Ydg2|J^k|XGROxfC#x6# z`ts6fdv<>Q`Aw;(3(CvW4>U0LNEkMqIN@TaIL0 zTpW*_&5VbK+dp3k_P@9;)_T$6#g+elK9{tqDCm7t{pQBTl(e)<880t8N; zJXuj$xv}V}m)-wApSg0E$L=oEiP*rfH}3ot&EOZ8m-D~h_ghcC_RGYL*GvBHT(Epz zRo96V9%gxWJi5hnC5+Q}CQh9A<>lq&R}?0$s(7_>xmTOIanccvU*Fzle~Q>qu(0sv zV)y<}f4|?KU1P9w^3A;;+43doYB&pY^CMSJoixd*TTB;JryM+ZaH-tiUtbr8t`7V1 z;$ribEhg*Y_ImBF`x~(-h4b(4@6V5P3diiLnOXgQueiLtd{J?6VNubed)4nvD}(hk zGz|8gjIUp@e#MH8J$r1bzP@tZUG}!;^Y=G5o!{Tv`}5iC{2c`knKo|RxMSC@Pk%n2 z|NO9Be%h}qSC{!pyY))7#;t$;=H}*@T_v5nN?#k5y@@z<_;6uS5fjhx>wo|Jk+3L8 zSed_!x#aaVUU_->pr9ZRKfh=1cE4YDVWFqLzyF&zZzL>>mfXzVT3K0Xn0LowmU({M z#{ViAGp$TMfAZwP zqeojiIyfe;))f&KpFD9QC|$g`vT}0azW#px$H)7R-@7;O%a@W(n>TZEa6I^UTz*Zfi@9giL*2?-0IJbO0v!-InrRaJ{FzdUj7+_LoZ^GaS^IJhIWzP|pktJmX4 zk377*7S;a#R`cN?`_d{!)&1hO)!$5h?qxXqK4-RBu2#v3%?lPZJbIM$Zs+rPLE&B> zK7USrb7SL;n>Pi;#od#Vl-}Oj`uOkn`_FHt&o_+>TYh=sv8(4qqR4^xCy);qkRox8JXut>!zc;L{UNE-o$!yBdoG3wtRU z8BpbX=9|f_?fK^~``i0QL`d-4|1l_jer{>@^>sCWJ|17PWXXqf*6$_yb8g(YVNmiS zU{~pDx3DlV(8!Roa`Q6Z*+P<%p0~H<_TJuG^V4YI!iC59BSk09nBkF;p}{L{cI5Kq z%~ux3?k+oa;q<9fi~QzVmAt=qw?gChxyj5DddpK6i`2`-d$Hx&D7kVdZh3cVsx}Kd z`{gB`!kfdVh(}Fiy2AX#V6MO;v+oDl&P+w;HUTNAQ?J+W zKlkV7=d*FWQ5=dbr594ppSX5y+Pc`?j~+cb^!dDfe}8}f(RF>gEdq<4Wo}CU^7s3F z=T)Csx4GhD zQrMb^M5Fcl>J|9yO{X51Fs+2=ZDyIR?uM;f*Io#nuX~bBIwvQ0OZ@Zs*A-T;T)iS( zTv|HXA#>X~|hE!T1-ez7x0el@7FWVhNkAfZ^?IvK6@?v(8;5+ z+lHymDZASnjR~ zbAGssZkxcrg=N+Ae^G~S&0%tzapvNa3-4N5Sblwd-M)Oe`q|m$>6e%J`ph(HogP=U z^3d%YdyJ=bZ1Ahum0)?^uVMk)>b;h%t_3EXPR%;8oeJmb_*{<) zR1}v_Tv51OuX(z5#r<838SIQLBwmx#~*rb^=PgcL*>;CuGSKZiY0!|%Li%uFa9qv7`tL$ym($anzOQ$RE zXRqF=q}U>0dQ|JY-n*Nd+fDcX$#`khBH$D6T}{hGtmKR=7!#iQ6FAeu7OcJaBn*2W1R47{f+wg@b0T4U66 zYg_JV+lPYF^qe^qU05SiK?CeN_C};iq^74Ao9dpul**ylvO-}s&tiVN9}Vtqr!AEg zTXw`oq)LE_`!)CW9EPg^4a#p9_ieja|NnQqlarH|?X|Vh=`Sy}>@XG)O`Jb7^QG1i zS(nN2Rk8*N48F5W4E>fbU;g<gvY<1=j$)63SG^$cK+na&ThxHO0Dwa=sk6&gF45i2ca((vo+!Ta)m{w#>KKD__>S^N4&YnILr+-g<*O=sf7iF^M4`weOg zKezvWr})XUXPXiZGCkhIEw1}XvVXUcN6mAkFM)61yEH)xV#j$TZ|9vkNcCOH`#Q`>kIEhKi8x4ZQ&h_gLx z6CUnuFWsGSWrbk%_jjphXPF)|(9+OIIM~E0A}03fqPu+H?rjgR?ascwPSw&<(%js< ztE)@GrozC{(Q%G_{k)bI7B)Vaj>(gSgO~eleGJSSJY-}}9wtZZ9} zrPGz3KQ$Kh|JHA?tiLB#zoO{dUUd?A;HQ!k+-QA~ozsH7zxVX8o-Me=$Rd4a-mmc2UprZU(Wo2b$ zN^0uE*RP}BeG3i_E-WuUe(>PIoa(YNv!h3k?%2J1cCNmTj*7N+_pZ{{_de{rBI5i1 zS>3Of%XjSBWmNOygS6i6)YD@7{{6~+ocwmZ{oN+6))ftFbS!El!qzsOw`-mrcj*1e zz=|&~(>SI^ZC&6mKf_M;+8RTh`}=Hd{+iVM)}3RQ%dzH1#f@#e({vgwixWMis{r=Z6m;zPYuvd(R#lhDD1ONm!L=$jQmQxwBK)faUnJv$J2`-*3d{zu&&Gu~EjN;J}W1t3p?Q`1C31{k^?+O0UQM`0?Yx%aXZ^Ul6hWuT}Tg z1qOfS-`6s0WwnU4=ziR~*+Om3LBo$SeV)&GFN>c`nm*Mr@Nb*QFZQ4t1``f79DDLr z!XxmoL)TyFz! p1uhA#>dsz68)`&;ls+}?C<5PTiV-$0|FdMN=yU=1>fA**v!bx zHevGQWFFAWz?7gbFD^1Sw6w5DnPenvlC7_=PmZpfGN9|v{Z932^7zI?go*Q?ck-q-&(=DSl=RP+dx6|29$d-DAG<-OJApvkp;|L++X ztlqF;!j~^4a&-b!n-0<+q#Zl^>6aOByDzfF@cVJ#3eM_V4$5bt@~W@bK_H zIoqzebLVc{w>A5E(XTI=pvjG}FtOU--%>w5I_l!)7It`btmQ1;#rpexFo}zcxA8~@ zEqrQS{x0Xw7Ul_6rp8}(c4?5&(6$jj$5Dp_t)1iFE6vZySp<41qE?%avI+BJGpb|lP6D#zCVBU>Qo!A zbWi)Iw6n8Z-{0GNb6f80jn7#P>i^YPmApup^X}5p?vLs0?CiVB-ky4RxZOLq{@a_I z$CN>nNlAZyeLc3V^7FHY@7|sJ|L?nf^4{zD;s=f&Z!dj)P13*FB;!Iu@$++2f6vM4 zN;{nK_SRM&34;SFM^77x!!wf3)ddD7c{x9}XQxXTOF20yXmCiYtDlk! z51lnv*Wy<8|F2uj%*@Qbyt_MFH+q}I{X4g}<(|H}I((*Gt(AM9Oyb{PU)7W!)YR0R zICswMre9c?*a6=2Pj~FxIde{M*1bKJ4A0NcmP^XGxoPRiEkRvZSBHb@gh^AT9BE`` z_i>Y$uJLkjqvDn+LC0POFZa8+EjKz@VCLne-r|!#f2_ZMZ0(Yp22q<*JZGxkZdtKu zi-|=km)|^-Kh>|MD3zkk1X=xDciZ|>Bri;0E3 z+xPF@>5k6MgV(NIdotn9{g)+H`+mLBw)^wJnT=P9C1maKOKYRe_x<_gEhHqQB|B@{ zf|~}rB&E%A5)OvPN9^JWyv)V@pKDg~@dq~yYx-r5>-`g{sBl;vc3~0gmR#<|?$U?U z4FcTe-hDXBJil-MetS<(&o6IoUbe8;(dqg7`}^k;%KbBR{$FtB{|M@nNJ^gk^YgQ1 z@iU(M{eR8=|GK_E&ti?Wo!vb3c@<61=T-Oh^zg)0zcqF1l}asYown0nC(oW$)z)5p=WyQj-`Ds5JG%XT-RTDhn`fG4i`~0-@5qrO26=aO zNPjz{b5QGW#-$~mChrTTf1ERM$Jv)(+diAM^BtV1T<~SZ!@^fn9_}_>8zm|C_g7)= zA(2l`Q9>6&s_SzWHJzK+x~lKlEE~x-zP%5V9v|yXK0Qsh`uh5J?%bJSl*$DfBlXW~LLnYYNEQ?Q&Hefs5S)Wo3OUDlC-U`%(_K@m5q-U0NBe z{^srfD(>$eKQ0VjzW?6mn%df%+j6CYm;0sO*-^M-$BqjdliiQ?%kzVVq`hPtvo0^| zEnMveN8~%f~+CzrOZi`{yq4%L`XXFrEIFw@_`)E}pn`4`Mg+?-Ua(ejri# zt=GfvPcu8)w0etGTg)4;9=Lbvy@j!`S^l~|RSdFL5^OWCOlWFinltB=WShR$3yll1 z9n3t>lh+7tFPf|K^lKy*0Th#~Q9DxlTw{ERAE{?srOY z{XGt4WoBh%Wq%&a|4(>#XXiA%*WXH>a;=GGUmbopf4`*OLgNg9J^$^#yvdX((`^wD zTXNFi*W-SB3F|VQ)nRLubaZ&;`W=6HdAatUf9qm*|M>a8ZrwqyeCEQ!510KvoYrsC zmj3dF^ZQ-)&FRfEe=p)tY*EcL>iPG1{(pm-9|ez}-hBJ^ZRW*AuC3SoeSDr=`Iu}P zIGV!OJ%lJ@xwb_O|=)Z*MC< z9Aw|P_QB4cz{PG4pUNM~e;szcV5wBWAB!~+i4{whORszR^@MfvT1D9p7geRQ|{e(LRQxo2jZpTD#;^YGKt8*(ITzRRkp z95^xY!%^`ItEb0Y_swY0F5t?@ed*MaHZ!gyY;xk0M~@C|NIYEe^=ddH2Pfyk?Ca~! z%(Io|=jY%2`pA(Z6DCYZm}6IS>6G0>Q4xuA|8=5RZf}=nQ`qxUjYlG3$Ac9Dvy8r; zZx?v#Y4~r+Ndqnpjsv%Uua~}Ll6y;JsmS$pvD(I<>4ekZ)@JPKR_;vGpjW=ZTqQ>f zel-0odp_CyL(D#g{`q3T5?5NjTogX>BSG`%*8h869ef%coW9Yhhf9C8-&zeVHj$KP zk-H{+5`CedF0U86xkU9@=1)8CLspqaJ#PJSXJ?sa&#Jx57)&fZVke{pdY{CLSOv+ozv?H$1)wieTxdiO8R zzdFmxL6-Z<%wUFaqpiQKrg@xYnk)Az`wy3^_@xDYx&`|G*IgBRoWag%9_Q1MwfLmL zEQ>-V?`b-TA08asl7D~R)6>&GUk#6+YTb}{tVi<948y|~u|>Bq0FjrP8~`tB@?xwfpv_69v2(snY}))?Mta^z5a zCoqdg*?=cW!nUep>NQ_4uSZupZ$GGZ+qlu<%pBM5Ug?J~JuC{Dq)axHggS8)o{oI# zdLnF1#KAS@%OiL7Y?8I%INav=|KE$-yqnQ76>@q(OhHHW1?<)wZQd_UhINMzOa=#4*8ORivxyhmXfEEMk4~?9j!f{;^3QDmyb z-Rk#yZHyE@U3*_~SuNx8v4XxACj={=Ngg(jY87yra$1Z3^4%g=*AJggZz$0`Gdo>k z8)!W4kV;S9wV$62%5*HOr1J8@*Uww3E#%a3yDwC3*=)mPw&ugTum9=u(z`7zmnX4A z!BM3}AT()e;+Ip}>o+|4pY=g+z1P7rGYt}%bmH@NtePwlXVz5V>n>E~zN*}1jy^E1&ndo#0X_pgP1PTcjU=CFokdisyI z=7;w?aVV~8RXfbV6Ccyt(XryvuH*gk>FHOtz0zK$(vfwwX{t7_@^g@hpm08M{(Sn| zTU%9BLjFBF4jMVm-}Bq?t4L5l!j6Y?StbfNU6Jr@o7mpYo_wq)@n93{mdwj-Cnu{f zp0ev}s|KsT4db?LLM~1mfz2kBGuFlJt*ZHWRGi_+@#Df$QeNxh_DWb5rObQ{8X221 zC1uXP$1Z=)iW}ALdf2r5;zg)FNw@3Vkh12;kt0*2-8QG6Hgeh@5|5mN} z!FJ!Z+wym@iR;X*ikpjGhflfG?8omuId9JzRngZA1D5}_;x29D%PnhMs;wCxxA5V_ z80Y=r=BwAuUaBonE_Jp&FfmcFu(0q>`Tg3bde^sP2Jb3+n>FX$nR5@1Y+TH+!^-in zSIyfK?@lPj+^?HBXY1@0*H7*DDh&^r$aije*g8A!6PgWMblzT{IW3jLFTVG_k=948 zD`jlu;@;s&^CsKQ*}sBh6pgIha`)wRRd9XWoy{p;)Nk6*t&{kY#g?wu8=Rhhs4 z@3z9K&*vhP4)JWyE7-vNJxcUWWuBhRFNHnU!rON{ul^;XwPwMIg2eY+*V7%Z7j218 z_p=ib&E9`5#k!#IO5I$iJ6f}34hRSdIkof278DmJ-`bM-=H6au@#)cD1V6QkFUSl& z94gi#;B-f5)*H#ItHb-<0jlQ+mnfwDa@M z-UxKo-X2tD<}-^WzLxdgJ=5SB0!|#8*BJHOt9q?_EvIkY9k2ZTymxmUoSZ{o_Mo#CE<%kFvIDD7FZsZaOs&6e*RJJ4K^^^qTV=-nrN0U#_2G%Z8+|o5oTm z83KNCUw_u!eDq1&rjTh{UMnkio^PTPhvFHK&eqxwj5dF_+}Rk)p{R34tJ+O;(zLW4 zx<@`fp0>_~L-Acj*iGYEmc?qy?O$~37ykdt&&Jcx#+&aO=)|FTDrIV-N#P?GyPvOS ze-i)oO!{y^9%#vN`qacHPoKIn|1YYt*|@RbtyD|<{auS%1e~ULeoov{_BQI*x3}GK z>(}q=)r(|GKGrZd_G@l1hoZ~W%qj+F(72%8PZe?fI2X;(hhO{TY)|#&MxTm%uzY^P z%S%}+0yq?1N-yM`_gH`3xb9CyT;F4FRxVRW@?5Q-qyQ}o@-Me?+ zR2}b=RaR9!YVr4Yps~2!*|V*Ge=jV5KT9K)L(xSvQ?Dl|I5_j#8p+vaxk;Co`9696 zoVjiH_PS3e)l=IpM(6K63a-ObpB+3}QgC;d?EGiB7Smrditg#l^1b|eVFbUrUevBh zpI&|m2w3vhio45!v9fjAx+OK1trOxoRz^-+cf>~D+&f(1oyjcj#Sb1NnC0EcnB(W+ zpJqQOPf-?AD8&W*>OHU$MoP0!`C|tul-vqAm?ZMxiU@A)#}9V zu4P$9>e~e_ZQ2t5{A!N#j^9@{g2wVIc<;=A4 zLzk9%?<{)i<$JBWV`>Q_r_OP`&v8@759LB3k&S_X!%s6qvBWzuar1n#ky1Kof`RfA*9Jb}(kGoqM<`ohma$i6C&-I=!C5Mj&GBfFfgUg7}Oq1BEDl6;q zcPY=$&2@2i-(3Da4l?DusQCH0it6g{^0`wd&6?%)sP%LG*^ch!2MIgtCki-agtQ)h z@#f~{GqX&)U%bfZleg~+;);)t-&Owp-0b{)p5NcyeR*Z2u%DlwX=HvYXfEICD^uj> z)BSCdg@qTEbf$I-IdKFo<7&TnaTMV?(Q<3IB{al@3-4kR8%(9|F4s){Sv4byX(jl&EO9oKQ65P z{!YfaY>is>zJ->>&pw=ZkywA$qBg3^&52`SqIqf0+Pu5FuB;4ZPft&O^X83)mR8dD zcXyX8T^br*8~W+PVgBIb$LBAXt36@x_z-Kxl@p6hITc$pqL&`hP*-n{-CZX6-n8Vw z0md&?wg(R$Y-w%%c*$GeFyn%Plvz$h@Yk@8`Sax!eP{nSeSAuEMfmw5R*>%S*25XM zx8=IHxGcE*l7oXo!Nz9J$;s-Mm;1{zt@`=fdUx5|q;GF-#_T9yjE|28`NyqaE_P|| zO;J(Fcl818kIi?0nk*5mhfiF;KK;D?|2cNGzb#&8T{`2k5{@ZKFa6?>FYTdQmyGDEwY#<7?;e{k zZJOm$P+(A4SSZT3xL4YI(}&mkj2rZ|jKJGJ&R+VXtFkTszMr2TA2S=ziVs%8>V8iy zS8_9M(AJq^Amqf+d-;udSbWt>)w;i5!;OrMBllL7PSrO|i4V~*zak8h&pH3%{{MgG zudl6r{B(M}nvzn}j2SbErk_7?;=!ky!?D*BqYzgTMRdY6TKTwUOr z`^D66ug~bR?3LTZtrOc>`EILDY~zm08D>4}!XqL&+S}cCp1yJGR?_F~g2i4d?b!`j z9<8{@UH005=gZ}+TGcPFzO696FP1aq+v_b`8Lgw=Udvp5Gg<9WRHjjnn0}m(pC6y1 zqT-)_zu)KF*zmCJyGPWn5>4;vdZvE)_awbtBGlh-a~I}3@Mbr>9g0u zm6Z8Eac_-RcL?10?e!Tw2LJF6>vCUuwOnBHt^3Ex#r5dU&SIUI9iU+mJ{gOEhlzLV z)t`e(k>4gajbB|{%x+utWyQ4In_{mI1V5Ia+$!*hZ~4i27tdDx{d)c7_08N2W?uY! zd}8Z7I22tf*BJFI^PhjN|MfP8w#he(b{8tPTrgYBqnw_ee&^0V8{;)oK=GO}C$#P2 z*BtOhpU);8XPGbVr{_3Y+T^8#yXY}miOXFb5isjS#?!D{sz$zDlg zw)t*nZ|ursKEc4I*mA*U^&839^K7X*F0U4F;yAm@_}M$pSk`UC=fGdsa3lPtNWS!yR$CVI&59cN&WqQobK&|KI!nKYmo7 zFRAuKV6K2u#yquZxBBTbW_0xT`?pU2|J?rn$v;Q683RB&rWRJt;$I9}4>o6xjGFJP zkgdEPpsL|n<|l*L&Q@;mPcN6x-;{cKn)J6GE-tPMFH4TS{Ikb~VM+?9aGjTSIOF0X zS5V;!+T!y3dHLa|$NS|$yCBYNxiKM{A=C0|d~&IVUR#oF%#N&=UZ=tr7~5=#OE3HP z_G8sEQKwl=dz8Gxlj3sIA+M+4+r=rG!9RXkA3k9v zc}urN;1;O$_wHR^f4=SE7H|?dyZMxXkt%4uJt}=_V#$jOireyTF*IzN3QCo0H=i=F zDtN#!+iVT%6EPttjza4TPcFQhZCdxILdq-`lmRWh)LR6$GlG((Ke)iJ4U=~>n&ro# zxaGVS|K+o@&HK;q|HCyw+W@q<Qgw{9`rM~{wnv#_y!y5P(oTI+lX6yRqszhP)wv`A@N-d#|IrL{M& zuFme}&Bz8&badQqOgsFdQ+?h7(8Btt?{Bx?e_)YhomY{XU-Ijx_0+2s9t}(CH!tTEL@fy&iL@);MEPH(4s}g_xru-_a7g0I5ylVi{VfN z2ZgYj&x5@?=l`{Yr-vu6UwbD67%+Hk0#z30wGO|iI(6*T{6zvzcfPIpH22q&lar6U zxsy0!!aQ)M3vIi&E%$cB#uPyYuS*~u{+FG1uhud$nl!;|ZYRfUmF*J*oH}kdgnsK; zrygG=>csJO^Dl!*V9oPG<(5Tn$qYR4BpKezT*8#qsVHj#8==aW%TQfgx3 zmAbG#-X1gyDxJS4@Zr~~K`*|x?QZr2C4(*glbI#d{N{KhBq(HGTf?YeZ$IC%_*sa> zgnwVx*MI!?`~CF<(6-N2lhdl*9zJ|{?4|nrnn`o!$b5TuH+tdM`<2gSujSn21iLSf zeHOR!-Z=lnM8(F&#$%Ohqqnmun3-*Jy1ilh_Twj4KCycYPK>3qc$68et*sy1R97Fq zc;wKbLtgp*dF#|$1a2+gS?u=h+qWCHZ%>{vBV!I|Bi{jol-)Xie}7N^{q1do;)SmN zJX`nfE-!eRT>VLVe)4vgjZJ54Zahc=m0}@0m97EDZ(f=@MSnfV7p@pt-B{0`n?4=9 zC^yICyLiTf4F2hp^dE~~>TToQs}tL|gE`}qzoLpti>!5-#Pa=rzeUT)$Z&9TYZuSm zvc=@n=g;0}{k`@$yxLd$MEt79N^@ULjVq0lo0n>9&W~$ccjJTF($u3z+g9h@xP7-E zuv_a=<67MtneT42G%mJHNsVKE{!7U1(X9aL)duOd#qx1O7x*LmoL0E_!%1(OpX-zf7>TIZx) z56TGLFWcf`7HnUtt$81w2Rv^k@yRHk-zRvovp!;%NFn=$6bW8gt110< z$jPlo;^6lCbV=r5@+Y%;SEOFvkSUZbHx#8qwb>qq+(=Qp&^iy@@ z*RwNot*0NCmt%!R?_0^cJrkAP9|i2zJ8x?lw=YcvTK=)Juw2*_D$Ouu2`n#s1+52k z%9tP8c5!F%bBmG>=e^m%+kc-$KD7ibU;TJAeZI6B#IiM;(!bm(KL7E4{xqhd8Gg_# zd3`b?56E?4@@|t{!HmjtpqXTym_0lb4wryR)8%?j611Ojs&@FaS@snl68`-CySg+UvuZ~8@7Kk|ybh_nZF=(F zImY=_ygwg3iu9fyq^F)P{_4udM_yiwmU?T3zr8i@#;scuCr-?I8FcDt==J_Tdvc13 zH|xZ9MY6J1rlh9|+^aX)XZLBYZQy4eA-ApB*VC@72)w%MZ1MAR6X(r~%lbF(#aa^{ zo`YA{mPn}1>py<+q~!fy&#IGmT1LiLh`WEjwlMYG_a6^ySxhrM*G8>NyFFPyZo!TS z_vVIUX}8bMxAd&KCHhC2^>Og}#+#|<=2$t!#@pYqeKjk0|EyU)Vb4sNnrF|>y)G_Z z{NsS$t@3w)&pulSmy77Xud1l1nw@K3`bJ@=$!8M9t1tIoV6_{K5edgznsSB|H2RYYpnygZk4=f+uQ8C^4p=N znn!*zi%Ng5OMUnF%Esm&>@1I?ZvU~nba`EYuI2;jAHQ37X7+#HwNcy6ZvVSjZ>M5x+$@>DCw1H3nah=b zK7BsF;`7^?HvdwV+)S0LN)YL{VY;8=%D}+C9ds_hF9~M0S@Mte<(y1fRPOTe=JfcP zx#!QFTNb)mKuAw*`cIohu=$|X>@i!edqXsI>A4`*KU7VcKvSJ?fPH)&*H>_f3=wx4$QaR$bL5O@%8w+XUFCDr9Uk9KDEYp zORaR>pGr~3-m~==DwB_y?Ai0m=;!?Nvvcq7&({Yzvp0I%%-sKZ7oGlnJ>|_KXEf#N z>N?%ce2S~|SXZR~2-KYNaN?RRX%`o{X1%+!Gc>CF+L}nNfaGI6n#D6OFZW-4Oq@WBDb zsS_s#rd4}+by=0YiP(Aj#=hF!mtKEOyZ!Cm-PH`D0s;Zgeub}#33Tt5(=C@bG&I!G z*I$3;+m9a=QzuLaNUKguTh`UvtGoFxXj5W?lwp#~&QgxR(vz!HnoWK$4R3Ilt6bu? zU0z5iD6jhMt*xBAy1xZvL0jlg=kjwH)ORc~y0s-UIIntd)z=l_>*Hp=Eh{Vg@*?n? zqE*AS)Gu$e9A&;Q)+<6ZJL>f1uMh6fKG6y46gzOMH2`sD&w zU60vvgHDa`{oa#zY=WY*Mg2b;ewz;sOT9I(FY%l#VUTcu*ZyhLE$RF{j#*i+c&mA* zZOgc*G$m-q?%mP5rWk?d;aj=IA3b}P_A=;{sGQunL#^DLJUm-UG#~LTcnPXw6xZC0 zXO;lhSa{E%SS@pF?e*84Jw2fDE|ctQJ^B0pPO~b_``a4y_|c;uACJphmcNs!tE&TT z*D=XR_!neZzdiG^+O_rZ{(gRZz0&4shgvwz{|Kd&-q@JTZfR-x<^BErPN(bt|NZ{v z#zyA3e(tNo)>eGE=w4WAT0eK+E6^sxx<4P?KYjk3d3BX2=uC;jhZo-|<>Ka^X`U~4 zyk8!);bHgteX}nvc2CZZHlBa9#7eeXOgHKOzrPh#RYH=IkqaMQ)YR0h`Fz%Vj%~GA zczF1`-S6$*?R-8@YNcSp<72%ls;Up4Jv(+{qVno3y_?g|Zz_Eqrsgvv;Ox~->)z0B zJ-bR?9y&EuyR)Ms;ru*XliXWZluGw}zgPX@YZV)h#DP|B@fSBXDxW-=8ZZB@s`~r8 zrKPX0@yJ+ASg}Im-QMr_q}E*%03Ap1)(Cd_5S%B%VM@} zFm>+kQ*y`5wB_|ehsj*gCopp`CO zUR;|tZ+1Psv+{GAjBS;OR4-d?Z7l~kw{w2}d)xWtKR=~L=!mU}+RF9s-@k~RMXFlb z+ODS~U4T zRxX(_L!zs%Pj0K7fq?^CbK;%r8v6R`{QUfZpJw`~6%`jRUbSjfp?td8?Bj1AySq%8 zInz@+Y|Vyr8)@UTGYh!I^*FZQy?fXF>!#PQUM-q8Z(d>i^QY6}m*w8x);X#0$nyDh zR`1R)TD-XV*YDrQV{Y#%)m|I9xow&Me7!Imv!{38`I>s zuxa|2FC{urTQ~{}3m0Ge_U2}DLjyyGiImOvJH{nC@EM_`z+26i5_x84h%a^mW^UECx_P1?au;AfG zxxIV$c64_)N3C@W2oSLQ`DC(T{Nrb5XIqrNlTlJqaye}|@7lGnmbSK}r>CZV`26`W zzx|(t&2>LMB)%xIs`>Zx`J^Yw!52bqOSZPQPTakF_t{!SMa3ttUuy?0N|cn8RGEId zmG8cJ-W>&feSNFiUnYWrPoF&t3JIC=p=(^C(fSreX$L6pv;A7y3s9PzkMsawIPvt<<+dH?Rm0azkTbP zWN2+YdtS{a&#KR7%{6Uo=A;-&u8rQ_$HvCi(edIyBlD5~jT1>5CtS^1dbC^o^1Hjc zTc2OQdiCP#_51y}TAPfFjgQ~${1?vF+_-1&-jnz5&ll5)NVv>vtE=n#LgoI|tFFfB z=eE2&7aJ7h)Y;i7A|c_y&L<Y@XeajleRtnUHa_eYh>DKh zn0T1&MTylM`+B*pTepG^IAK_@W(`kVT-=X;zuyN21T-9%ufL-PDhxm-gvZy4R#sNt z*qq+4VcE&Ca^*@6e*WXx>-V-jdzPl6uFhTm|J12d51u?>SsT{<_xJb1XV0Ehd%pR+ zU3W_hi;KIvvZm(AwA@8AeAGh1!w;tzIj+9ywEp_x3=`0(jf9kxQ&N(Wk&%&rjLo+K z$76CwrtF?|?)r6cUteFd@1^DC_cuS?AMxqarw?b%?>~5Qa`K07`|kcepJ8(7;zhyw z|9{OJ9zObfEjpj`H6I^eM^6t6!;vFL4&1&ieY{Wh@T$<&Z)W8`KR0(r)mN<$EzyRD z|G)hH{aa8*rsvtSG>Kj}fr%4}udRtRd#nb^w=tE=gH~=Rc<7XKXGdT~^r^VC^YeJ+ z<>eKZcXxA}Nb$aU{d!~OWwnyh(t}AGIV{EX<8qAqoYW>es!dkZ(&CyoZ=Q#j*CFlo zdy>9uztYmy4vdWK+_ufk!ph2N@kIqKEiPAA*NVrz<`=GBZGHDHPchxesp)J+?}7yi zEUc`FUte8)@%F82Rh3m%R@R$YALHEaG5vi$zy8AY>+B33o}LG{WL^#k4`-k2*M7hL zzpQ-S55=~&wgj`;58u7(+qKJT_y3)n+mBDtc6)t&y?bP&q?MIbi==({x|oCP@-+qz zBl~15oBHj3arE}~nzeFB%#$zq{LDA!?k-WInK^f^7Zw(REVyv_a`N{cO-)S?FE63I z=g*%%o*rK(xa@UXOUr>AGi7Dv2|xfB$}i&F%{W z9M)e~*4BPKZ@p>uHJv-VO1Ybxo6GdwbaizcgED+ zxBObQH}>;getUcS9lLftS~@+>sitPn*;)Jd??3DE^x3mC&{lx@zh9@T$j?s*J`rMV ztfchm)2Brb9wbZ)^6>#b+Z63(EwrrHf>(%Q)i8=kXsodURsc+GWD( zegVnJ%A#UoT-isD9tG7BZ{NP1GG~sDoSat?jNDAp|Rlfbp7D$Y;9E)l?gF=>fJ|`yv%ytoI5)^uUxz4CMqiWV|Wy!ZUk*n6OUE0;frKGg0=qcCKY11YhOjxiv{rse$l}ol}U+Pw6?Zhxp~vGoljONJUski&W9tN!Y0Ybcut)@y?EI&wNL91{#ZQA5=((+MWx*KSb+s_|A0x~l-O-)S$BO@iZZr$4Z^Y5pbg4G58 z)hEZvUzur~zM}1x~MLTv#%$zy1ps46j zm#FrHY17oaj!l>#0BT@ZT3VhsdGg?$oyCDsQC$}<1TY*HPRP#6`tbF7{Nf!uB2oepdW`yWRDqWzxStKMM*9BueXpf`n>nY64y5sBGrb}%zfo^dqEv82SLt*!0D<9_=h#iTci$J5<%4hagH<=yG{{QUglb?f{# zMF#h5JlWhWIJ@BX_Wa}j{{Aj}bHnh&(;~3>jCRIJ!mBoJ6g+S9nWv_lRGzF+5plnABsaW=SxZh}3jP_VCwr-qV{5kKJ&7QFeD{@(#J=9z!+W gy4ii82>8c(!Xo*sm>cg|1_lNOPgg&ebxsLQ0B?xf*Z=?k diff --git a/doc/graphs/lambert_w_graph_big_W.svg b/doc/graphs/lambert_w_graph_big_W.svg index de0a4461f..4ebe560e0 100644 --- a/doc/graphs/lambert_w_graph_big_W.svg +++ b/doc/graphs/lambert_w_graph_big_W.svg @@ -12,30 +12,30 @@ xmlns ="http://www.w3.org/2000/svg" - + - - + + - + - + - - - + + + - + - + -0 -2e3 -4e3 -6e3 -8e3 -1e4 -0 +0 +2e3 +4e3 +6e3 +8e3 +1e4 +0 0 1 @@ -51,17 +51,12 @@ xmlns ="http://www.w3.org/2000/svg" W -z - +z + - - - - -W0 branch -Lambert W function for larger z. +Lambert W0 function for larger z. diff --git a/doc/html/index.html b/doc/html/index.html index 848c5fb59..d96d54964 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        Last revised: July 19, 2018 at 15:38:32 GMT

        Last revised: July 24, 2018 at 09:41:02 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 90a32c517..6e1d88cad 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index d7eeb473e..0263f8436 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 7139e0217..3126abf2d 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 79b889d79..c3086bcae 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 9a4da53d0..1376c582d 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index 05fe5744d..b8015c6ae 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index cfbe08d1d..b89a8fdf8 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 26ff061b2..8ef648f78 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -45,13 +45,16 @@ In the graphs below, the red line is the W0 branch, and the blue line the W-1 br [import ../../example/lambert_w_graph.cpp] [graph lambert_w_graph] - [graph lambert_w_graph_big_w] +[graph lambert_w0_prime_graph] +[graph lambert_wm1_prime_graph] There is a singularity where the branches meet at argument [^z = -1/e] [cong] [^ -0.367879...] and [^W = -1]. This implementation computes the two real (not complex) branches W0 and W-1 -with the functions `lambert_w0` and `lambert_wm1` from the first [^z] argument. +with the functions `lambert_w0` and `lambert_wm1`, +and their 1st derivatives, `lambert_w0_prime` and `lambert_wm1_prime`, +from the first [^z] argument. For C++ types `float` the maximum z argument `(std::numeric_limits<>::max)()` Lambert_w0(3.2e+38) = 84.29, @@ -67,7 +70,7 @@ Refer to __policy_section for more details and see examples below. The Lambert W function has a myriad of applications. Corless et al. provide a comprehensive description of the range of applications, from the mathematical, like iterated exponentiation and asymptotic roots of trinomials, -to the real-world such as the range of a jet plane, enzyme kinetics, water movement in soil, +to the real-world, such as the range of a jet plane, enzyme kinetics, water movement in soil, epidemics, and diode current (an example replicated [@../../example/lambert_w_diode.cpp here]). Since the publication of their landmark paper, there have been many more applications, and also many new implementations of the function, upon which this implementation builds. @@ -701,6 +704,11 @@ Halley iteration should triple the precision with each step and since we have at least half of the bits correct already, one Halley step is ample to get to 128-bit precision. + +[h5:lambert_w_derivatives Lambert W Derivatives] + +The derivatives are computed using the formulae in [@https://en.wikipedia.org/wiki/Lambert_W_function#Derivative Wikipedia]. + [h4:testing Testing] Initial testing of the algorithm was done using a small number of spot tests. @@ -740,20 +748,24 @@ A further method of testing over a wide range of argument z values was devised b These are definite integral formulas involving the W function that are exactly known constants, for example, LambertW0(1/(z[sup2]) == [sqrt](2[pi]), see [@https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals Definite Integrals]. -Some care was needed to avoid overflow and underflow as the function must evaluate to a finite result over the entire range. - +Some care was needed to avoid overflow and underflow as the integral function must evaluate to a finite result over the entire range. These are not routinely evaluated by the Boost testers, but can be run by defining a macro BOOST_MATH_LAMBERT_W_INTEGRALS. +If BOOST_MATH_TEST_MULTIPRECISION is also defined, +then __multiprecision types like `cpp_bin_float_quad` are also used to test quadrature. +If BOOST_MATH_TEST_FLOAT128 is defined, then `float128` is also tested. +[h5:test_macros Testing Macros] - -Three macros provide optional tests if #defined before BOOST_TEST_MAIN. +A few macros provide optional tests if #defined before BOOST_TEST_MAIN. * BOOST_MATH_TEST_MULTIPRECISION Adds test for __multiprecision types. * BOOST_MATH_TEST_FLOAT128 Adds test using __float128 type (GCC only, needing gnu++17 and quadmath library). +* BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined. + * BOOST_MATH_LAMBERT_W_INTEGRALS Adds quadrature tests that cover the whole range of the Lambert W0 function. [h5 Other implementations] diff --git a/example/lambert_w_diode_graph.cpp b/example/lambert_w_diode_graph.cpp index 8357ca338..961fe7878 100644 --- a/example/lambert_w_diode_graph.cpp +++ b/example/lambert_w_diode_graph.cpp @@ -217,6 +217,7 @@ int main() .x_size(400) .y_size(300) .legend_on(true) + .legend_lines(true) .x_label("voltage (V)") .y_label("log(current) (A)") //.x_label_on(true) diff --git a/example/lambert_w_graph.cpp b/example/lambert_w_graph.cpp index fcf597d2a..3eb43f75a 100644 --- a/example/lambert_w_graph.cpp +++ b/example/lambert_w_graph.cpp @@ -9,19 +9,27 @@ \details +Both Lambert W0 and W-1 branches can be shown on one graph. +But useful to have another graph for larger values of argument z. +Need two separate graphs for Lambert W0 and -1 prime because +the sensible ranges and axes are too different. + +One would get too small LambertW0 in top right and W-1 in bottom left. + */ #include using boost::math::lambert_w0; using boost::math::lambert_wm1; - -#include "c:\Users\Paul\Desktop\lambert_w0.hpp" // for jm_tests -using boost::math::jm_lambert_w0; +using boost::math::lambert_w0_prime; +using boost::math::lambert_wm1_prime; #include using boost::math::isfinite; #include using namespace boost::svg; +#include +using boost::svg::show_2d_plot_settings; #include // using std::cout; @@ -41,7 +49,6 @@ using std::multiset; using std::numeric_limits; #include // - /*! */ int main() @@ -52,90 +59,91 @@ int main() //[lambert_w_graph_1 //] [/lambert_w_graph_1] - - std::map w0s; // Lambert W0 branch values. - std::map wm1s; // Lambert W-1 branch values. - std::map w0s_big; // Lambert W0 branch values for large z and W. - std::map wm1s_big; // Lambert W-1 branch values for small z and large -W. - - std::cout.precision(std::numeric_limits::max_digits10); - - int count = 0; - for (double z = -0.36787944117144232159552377016146086744581113103176804; z < 2.8; z += 0.001) { - double w0 = jm_lambert_w0(z); - //double w0 = lambert_w0(z); - w0s[z] = w0; - // std::cout << "z " << z << ", w = " << w0 << std::endl; - count++; - } - std::cout << "points " << count << std::endl; + std::map wm1s; // Lambert W-1 branch values. + std::map w0s; // Lambert W0 branch values. - count = 0; - for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001) - { - double wm1 = lambert_wm1(z); - wm1s[z] = wm1; - count++; - } - std::cout << "points " << count << std::endl; + std::cout.precision(std::numeric_limits::max_digits10); - svg_2d_plot data_plot; - svg_2d_plot data_plot2; + int count = 0; + for (double z = -0.36787944117144232159552377016146086744581113103176804; z < 2.8; z += 0.001) + { + double w0 = lambert_w0(z); + w0s[z] = w0; + // std::cout << "z " << z << ", w = " << w0 << std::endl; + count++; + } + std::cout << "points " << count << std::endl; - data_plot.title("Lambert W function.") + count = 0; + for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001) + { + double wm1 = lambert_wm1(z); + wm1s[z] = wm1; + count++; + } + std::cout << "points " << count << std::endl; + + svg_2d_plot data_plot; + data_plot.title("Lambert W function.") + .x_size(400) + .y_size(300) + .legend_on(true) + .legend_lines(true) + .x_label("z") + .y_label("W") + .x_range(-1, 3.) + .y_range(-4., +1.) + .x_major_interval(1.) + .y_major_interval(1.) + .x_major_grid_on(true) + .y_major_grid_on(true) + //.x_values_on(true) + //.y_values_on(true) + .y_values_rotation(horizontal) + //.plot_window_on(true) + .x_values_precision(3) + .y_values_precision(3) + .coord_precision(4) // Needed to avoid stepping on curves. + .copyright_holder("Paul A. Bristow") + .copyright_date("2018") + //.background_border_color(black); + ; + data_plot.plot(w0s, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.plot(wm1s, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plot.write("./lambert_w_graph"); + + show_2d_plot_settings(data_plot); // For plot diagnosis only. + + } // small z Lambert W + + { // bigger argument z Lambert W + + std::map w0s_big; // Lambert W0 branch values for large z and W. + std::map wm1s_big; // Lambert W-1 branch values for small z and large -W. + int count = 0; + for (double z = -0.3678794411714423215955237701614608727; z < 10000.; z += 50.) + { + double w0 = lambert_w0(z); + w0s_big[z] = w0; + count++; + } + std::cout << "points " << count << std::endl; + + count = 0; + for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001) + { + double wm1 = lambert_wm1(z); + wm1s_big[z] = wm1; + count++; + } + std::cout << "Lambert W0 large z argument points = " << count << std::endl; + + svg_2d_plot data_plot2; + data_plot2.title("Lambert W0 function for larger z.") .x_size(400) .y_size(300) - .legend_on(true) - .x_label("z") - .y_label("W") - //.x_label_on(true) - //.y_label_on(true) - //.xy_values_on(false) - .x_range(-1, 3.) - .y_range(-4., +1.) - .x_major_interval(1.) - .y_major_interval(1.) - .x_major_grid_on(true) - .y_major_grid_on(true) - //.x_values_on(true) - //.y_values_on(true) - .y_values_rotation(horizontal) - //.plot_window_on(true) - .x_values_precision(3) - .y_values_precision(3) - .coord_precision(4) // Needed to avoid stepping on curves. - .copyright_holder("Paul A. Bristow") - .copyright_date("2017") - //.background_border_color(black); - ; - - // bigger W - for (double z = -0.3678794411714423215955237701614608727; z < 10000.; z += 50.) - { - double w0 = lambert_w0(z); - w0s_big[z] = w0; - count++; - } - std::cout << "points " << count << std::endl; - - count = 0; - for (double z = -0.3678794411714423215955237701614608727; z < -0.001; z += 0.001) - { - double wm1 = lambert_wm1(z); - wm1s_big[z] = wm1; - count++; - } - std::cout << "points " << count << std::endl; - - data_plot.plot(w0s, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1); - data_plot.plot(wm1s, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); - data_plot.write("./lambert_w_graph"); - - data_plot2.title("Lambert W function for larger z.") - .x_size(400) - .y_size(300) - .legend_on(true) + .legend_on(false) .x_label("z") .y_label("W") //.x_label_on(true) @@ -155,16 +163,115 @@ int main() .y_values_precision(3) .coord_precision(4) // Needed to avoid stepping on curves. .copyright_holder("Paul A. Bristow") - .copyright_date("2017") + .copyright_date("2018") //.background_border_color(black); - ; + ; data_plot2.plot(w0s_big, "W0 branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1); - data_plot2.plot(wm1s_big, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + // data_plot2.plot(wm1s_big, "W-1 branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + // This wouldn't show anything useful. data_plot2.write("./lambert_w_graph_big_w"); + } // Big argument z Lambert W - // bezier_on(true); // ??? - } + { // Lambert W0 Derivative plots + + // std::map wm1ps; // Lambert W-1 prime branch values. + std::map w0ps; // Lambert W0 prime branch values. + + std::cout.precision(std::numeric_limits::max_digits10); + + int count = 0; + for (double z = -0.36; z < 3.; z += 0.001) + { + double w0p = lambert_w0_prime(z); + w0ps[z] = w0p; + // std::cout << "z " << z << ", w0 = " << w0 << std::endl; + count++; + } + std::cout << "points " << count << std::endl; + + //count = 0; + //for (double z = -0.36; z < -0.1; z += 0.001) + //{ + // double wm1p = lambert_wm1_prime(z); + // std::cout << "z " << z << ", w-1 = " << wm1p << std::endl; + // wm1ps[z] = wm1p; + // count++; + //} + //std::cout << "points " << count << std::endl; + + svg_2d_plot data_plotp; + data_plotp.title("Lambert W0 prime function.") + .x_size(400) + .y_size(300) + .legend_on(false) + .x_label("z") + .y_label("W0'") + .x_range(-0.3, +1.) + .y_range(0., +5.) + .x_major_interval(0.2) + .y_major_interval(2.) + .x_major_grid_on(true) + .y_major_grid_on(true) + .y_values_rotation(horizontal) + .x_values_precision(3) + .y_values_precision(3) + .coord_precision(4) // Needed to avoid stepping on curves. + .copyright_holder("Paul A. Bristow") + .copyright_date("2018") + ; + + // derivative of N[productlog(0, x), 55] at x=0 to 10 + // Plot[D[N[ProductLog[0, x], 55], x], {x, 0, 10}] + // Plot[ProductLog[x]/(x + x ProductLog[x]), {x, 0, 10}] + data_plotp.plot(w0ps, "W0 prime branch").line_color(red).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plotp.write("./lambert_w0_prime_graph"); + } // Lambert W0 Derivative plots + + { // Lambert Wm1 Derivative plots + + std::map wm1ps; // Lambert W-1 prime branch values. + + std::cout.precision(std::numeric_limits::max_digits10); + + int count = 0; + for (double z = -0.3678; z < -0.00001; z += 0.001) + { + double wm1p = lambert_wm1_prime(z); + // std::cout << "z " << z << ", w-1 = " << wm1p << std::endl; + wm1ps[z] = wm1p; + count++; + } + std::cout << "Lambert W-1 prime points = " << count << std::endl; + + svg_2d_plot data_plotp; + data_plotp.title("Lambert W-1 prime function.") + .x_size(400) + .y_size(300) + .legend_on(false) + .x_label("z") + .y_label("W-1'") + .x_range(-0.4, +0.01) + .x_major_interval(0.1) + .y_range(-20., -5.) + .y_major_interval(5.) + .x_major_grid_on(true) + .y_major_grid_on(true) + .y_values_rotation(horizontal) + .x_values_precision(3) + .y_values_precision(3) + .coord_precision(4) // Needed to avoid stepping on curves. + .copyright_holder("Paul A. Bristow") + .copyright_date("2018") + ; + + // derivative of N[productlog(0, x), 55] at x=0 to 10 + // Plot[D[N[ProductLog[0, x], 55], x], {x, 0, 10}] + // Plot[ProductLog[x]/(x + x ProductLog[x]), {x, 0, 10}] + data_plotp.plot(wm1ps, "W-1 prime branch").line_color(blue).shape(none).line_on(true).bezier_on(false).line_width(1); + data_plotp.write("./lambert_wm1_prime_graph"); + } // Lambert W-1 prime graph + } // try catch (std::exception& ex) { std::cout << ex.what() << std::endl; diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index ac1020c13..f720b05c4 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -1103,30 +1103,39 @@ BOOST_AUTO_TEST_CASE( Derivatives_of_lambert_w ) // https://www.wolframalpha.com/input/?i=derivative+of+productlog(-1,+x) // d/dx(W_(-1)(x)) = (W_(-1)(x))/(x W_(-1)(x) + x) + // 55 decimal digit values added to allow future testing using multiprecision. + typedef double RealType; int epsilons = 1; RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. - //derivative of productlog(-1, x) at x = -0.1 == -13.8803 + // derivative of productlog(-1, x) at x = -0.1 == -13.8803 // (derivative of productlog(-1, x) ) at x = N[-0.1, 55] - but the result disappears! // (derivative of N[productlog(-1, x), 55] ) at x = N[-0.1, 55] - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.1)), - BOOST_MATH_TEST_VALUE(RealType, -13.880252213229781), + // W0 branch + BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)), + // BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218355), + BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218358355273514903396335693828167746571404), + tolerance); // 1.7491967609218358355273514903396335693828167746571404 + + BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, 10.)), + BOOST_MATH_TEST_VALUE(RealType, 0.063577133469345105142021311010780887641928338458371618), tolerance); +// W-1 branch + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.1)), + BOOST_MATH_TEST_VALUE(RealType, -13.880252213229780748699361486619519025203815492277715), + tolerance); + // Lambert W_prime -13.880252213229780748699361486619519025203815492277715, double -13.880252213229781 + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)), - BOOST_MATH_TEST_VALUE(RealType, -8.2411940564179051), + BOOST_MATH_TEST_VALUE(RealType, -8.2411940564179044961885598641955579728547896392013239), tolerance); + // Lambert W_prime -8.2411940564179044961885598641955579728547896392013239, double -8.2411940564179051 - BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)), - BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218355), - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, 10.)), - BOOST_MATH_TEST_VALUE(RealType, 0.063577133469345098), - tolerance); + // Lambert W_prime 0.063577133469345105142021311010780887641928338458371618, double 0.063577133469345098 }; // BOOST_AUTO_TEST_CASE("Derivatives of lambert_w") #endif // BOOST_MATH_LAMBERT_W_DERIVATIVES @@ -1221,8 +1230,13 @@ Real x; test_integrals(); test_integrals(); +#ifdef BOOST_MATH_TEST_MULTIPRECISION test_integrals(); +#ifdef BOOST_MATH_TEST_FLOAT128 + test_integrals(); +#endif test_integrals(); +#endif // BOOST_MATH_TEST_MULTIPRECISION } catch (std::exception& ex) { From c9f272ec1c09451366b1f5a901a26b86596261e5 Mon Sep 17 00:00:00 2001 From: pabristow Date: Wed, 1 Aug 2018 16:55:27 +0100 Subject: [PATCH 54/71] Lambert W much modified to remove control of precision with policy and docs to match --- doc/graphs/diode_iv_plot.png | Bin 35338 -> 34167 bytes doc/graphs/diode_iv_plot.svg | 96 ++++++++++++------------ doc/graphs/lambert_w0_errors_graph.png | Bin 0 -> 24501 bytes doc/graphs/lambert_w0_errors_graph.svg | 62 +++++++++++++++ doc/graphs/lambert_w0_prime_graph.png | Bin 0 -> 15824 bytes doc/graphs/lambert_w0_prime_graph.svg | 56 ++++++++++++++ doc/graphs/lambert_w_graph.png | Bin 16269 -> 16160 bytes doc/graphs/lambert_w_graph.svg | 64 ++++++++-------- doc/graphs/lambert_w_graph_big_W.png | Bin 20648 -> 19735 bytes doc/graphs/lambert_w_graph_big_W.svg | 62 +++++++-------- doc/graphs/lambert_wm1_errors_graph.png | Bin 0 -> 21411 bytes doc/graphs/lambert_wm1_errors_graph.svg | 55 ++++++++++++++ doc/graphs/lambert_wm1_prime_graph.png | Bin 0 -> 16478 bytes doc/graphs/lambert_wm1_prime_graph.svg | 54 +++++++++++++ doc/html/index.html | 2 +- doc/html/indexes/s01.html | 37 ++------- doc/html/indexes/s02.html | 2 +- doc/html/indexes/s03.html | 2 +- doc/html/indexes/s04.html | 2 +- doc/html/indexes/s05.html | 60 ++------------- doc/html/math_toolkit/conventions.html | 2 +- doc/html/math_toolkit/navigation.html | 2 +- doc/index.html | 23 ------ doc/sf/lambert_w.qbk | 67 +++++++++-------- example/lambert_w_simple_examples.cpp | 4 +- test/test_lambert_w.cpp | 21 +++--- 26 files changed, 405 insertions(+), 268 deletions(-) create mode 100644 doc/graphs/lambert_w0_errors_graph.png create mode 100644 doc/graphs/lambert_w0_errors_graph.svg create mode 100644 doc/graphs/lambert_w0_prime_graph.png create mode 100644 doc/graphs/lambert_w0_prime_graph.svg create mode 100644 doc/graphs/lambert_wm1_errors_graph.png create mode 100644 doc/graphs/lambert_wm1_errors_graph.svg create mode 100644 doc/graphs/lambert_wm1_prime_graph.png create mode 100644 doc/graphs/lambert_wm1_prime_graph.svg delete mode 100644 doc/index.html diff --git a/doc/graphs/diode_iv_plot.png b/doc/graphs/diode_iv_plot.png index 867a8bbdd7a078ad7f8e6348d8d63b0f4d5d0e3c..a956e1b8316e7571ff2b189d5b28696ea2880b74 100644 GIT binary patch literal 34167 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYR#y02|9{})_moZEDnd;j0!O4azIW*q2zeW|HM?__-izsB zTepO+-Fj)!)+_6-MEOeXj?h{)tz)i-i%{f**l#E2+?W4+ddp>V~C`%o9~SC&j5rHaOP_ZDKhkX(Z)2N#&(# zO3Dic70*darcd{A0;xZELPf=Ml8R){fOEezaq{yYKXxmDQz1uG~4fxx5lvL#CWK;o;=ulyPwpYhPbq z8=w2H{wY&Lnwpwcgsqi&_wHRApL>;;5$8+CemUEUuUErMx82=aJv}_WcB*qbpJCn| zi)}eK7u_|l`%`hOU;h7^!&AI6j&_NjnQJ|LZ}s<6Dj{rhZ7L_-+goj1{LE)&OB{m{ z=hR7AS66LJKQAX`l5ybL+UTE8Ci`!xH+X(-?&CWGwb45( zKdT)(c5F+|%}EEF*^~3~;vUFUR#v{bv9Wowx_?qqlGFOQy({AOR!uZaO-tKU_}EP^ zW=F%!nUc(GJPU%C`}LQ`USA)detw?qot?$(+1c4yS5`P~&%3)Kdb=LO{(rx;B_$Z{h_cK+j+E(taK{{DV*;$gPDdwV+f?zKJK z&c8hIaGTZf)|QrnUtcn9Y;8Ag-kkjQ*48_FDksa={a_Rp7Ji%k>$rS14{+M0!FXJ=JZR%ULG-&Zs9 z?(TA7S=rvTYjyALD!qI&e#+(L{+sjf+cBJ*Z-4&ORBgtJ&u7iI?&VEPOnh^9_w)}R z3a(_C=H=z}NEk918*gU%3QB8dXPXO)iM4fib1!!5ee~_^?U;QvGwo`B1#HaM z+?>SYeX=U*>X%mpDj(~UU48kqqAjDMfRl~LrN`2ySyLEV=Fg9xnA*lKugCE5>Gb%l z?Pq71dNU-QpJ!{8`uESDmZ?*x8km`hy?gg=QP|ojCV|pdR|L)T?_JTHJ#(g}jjb)K z!m6;fT6gZ=Z4Fu}vbXB1P=ka`#Rk8hD^_R(u8*@#%*)fewIx$|&YU?c3S#TgIIo8#ip(BEl`Eb75LxX{qS7Yu8%kxI6Y%f6v-}^ypDehc9n# z2K&sh2xK^P;)I7z{Jt0t#UrPtYO^XlJ2zMR&Ye43elK3UxK+UE$gyKxZoN{R#>U1M zm-$LReDh|F?*IJ8#zrQA$?E=Mlhu5M8Vn2#1sejirYb2YI7DB&eLH%_?AhE75s{Id zT%uYX$9kp3f6jXH>{-{TsoLGMOtZPRMy=iKzc#Gfs`M2{d3pKUZI_q(b6Z)F}audi&Z{+`F!p}+6PB8NL_YHF zW9H6{ee#uC@reHZKS~U9zdP=0XkcLM5Y-OL*nW17Ww3;#B&WBx_r+DA+JPIBTp2s! z_EvR%`BF0X@$D^{$_x`HPgZUbNc#5X=Al!kyciDMxf2tzBES)ZU0hu`6;0}$8#Zj; zE}naPo9NZm;o=Q1uB;4hte>y!-p7%hoxLzb%XPAvuS+u zv)H|&vQl(bOI+ns(ZtM5O}*G%DlGy^*4EJ#RaIQU!NG6as|v5JjaFxP_~3zp-(0Ju zcjrx>tSo0!vEc7t&q)*Z?%lg0eEmEQE-s<0tx+jyX;LZ+aO!C1m*-MfR}WkrrYk5fuiql@ z=wLHDDE}O~c{8#)*6GjWmN#$T9*xf5tNQ5iW7n{-X#uORI;{=kmX?-&`0Sb5rcIl+ z99L0Mc`@gI;pBkt@9wtl+`01`b1a9Vkgza!O~wCkH@CJ88#fB}N||bHSYQADA1Hd4 zEL+B<*m7f2YBz(+?y|RA-b+vQQoUFCT$Zt;{9dK|^B@1!6ct;3Jnpw=QAj&CC-Om! zxPF|-@9*!gA6pZ&(q((zT^5CN^K4h^PM}CplvO)8G^_|&8Puq< zrTl#yV+W_OTE^>h_5Xe5T5Y{?-Ce6ojq~Ki!lgRt}n>SBFQu5;N@_Zd#T~2Q9>Qz77d!<+p>?(a-vTc3bUMX&F z?lyjTz60BGZ+G$Hd6|`}c3pzhAE-qNABNBphU7n5G-OtoFXfR4+08IG?AdrvCi-e7>iTPtBw3 zj5|9F@9r+Yer!#M*4De5x98u#HtqI~LS=qAn}k0C?q`m%o4Z zW>?ttHUcyt|if zhOZ9OZ4qGY(>%-H8MxTZu<}z%*}FR@R|GD;v7=D==FOXX{(ig7nq*h-fT6Lmku~Yu zsZ&}Xe_mS~-QL{HZ2$L*u$`S<&CjRP|NMB||K;W7=bh^x{{4Rc_=yu8k(<*#9u<$@ zka1DT?*E@+yI(IByKif=DtX~B*Q)f!rc~~3G2KH)jZ>^Xk>wA3uI%J+*Yn5{4-nC(}|>Cr+H$ zICJLAG6feqWo6}6p{w1ZqHZbg&+uxUymGe)r{ayx>HG^apNXsQ-@Ryq{eeGEg7?)_ z&iy~_OXHP4`H$r5ekdj;CbHH&J2Nx*&BtxqwrPlP1qB72ICDnlqNR8AKhwRR&sn#| z1=oFlxcSqw+4)IHNr!%Yea+|_9<#UVYl)luv*Ujr_uGp}eeMuc_NuWnHa4!Qt=(Ds z+ibGBznY!hyt==?3g6w?xqMfj=VZ0Q=jUXn=|nbd+-P`tneXG}^Xsaf6mqpTO;mQD zG+{!+{Q2_k{c=yQt&O(w+_B^PkNw-9@83WFNCPADjSY#++F@%Ryt})5jzyu9dRxua zRiVrpf!F8n+-WH$CKeGDB_t&k^I`r?0Gu6uwaM_|JFg`k0uQ#>duWZ#WwE@2_8|+v2`)+qPw%lhsyS&HD5A zZ@2F3`ty(O%h}be_+Iz9KK}CJs3QMY_wSnbKYH+>Vf%LT<9)J^r^nYlJT+AtluWF2 zJO0f0`{&OWvBirQD|d_QKl}ZDzy62!lkb1}{eJ)PZ*OmR&t*G)>QooM-4BP`QK$ba zebrEQ>p5`ZM90_H*Tr|pv(0)Ev^_8O(c{OZ@6I$WdE}N zd)rQ&@ZgiT0~H#QmPIOFOE;ac`qX~p|Mz=|K0ZDRzYANJz3~VN5~~0AGkxPm&whWk zg+T@1-^He#pLh01r|`<4rCh7S*VjEUe0;3ed1c6_v*!0-s7%`b|KIHRx}UA9LRVkf zUtjNF%&;)=a9c}T+oq(WT)C0<_V%FSWx=~=XJ&5R|b9df-^?Bz{p6r}6N9L{hrx!0Ws=mH*t*H2+eEy?_lv$3)e7jnU z`hPa@bw5)ZT|y>hYkB?K{^WRWXpfXB*Vd@s{(k;t%a+|@jG;CSm={60=$HHDT3_5Xj*_Y?Z~^{c9mPEXz6 zU$&oWe*XUd`+aiGnw`4^0`; zEvB;|a&y|P=R19TeYZaS|9$`eg#j8fEDDtZ0|Tv|`}+FoZq;|vXSHBr8_{_&V}eurJ{FAi>Q?!bLD zm4$C^7|z|~-X|ltY}qm<0Y5*#Lnlvq&X_feD?a|dQ+vkoW5>A4%gY%%+IXeA9v*J* zc5G(j6c-o&_^@4m+KVdt9}k!rIY15geYMpOpFUMx6|!q+@Vdvk7Xa{7LMce%ew{=FE6MRk9FCEeJN2x{IfDtmkD(DCE$ z(R%eA-==5=b6p8s8Kes87i`wm((;Okj^<8IPBu(AA@K3zarx;lzMedFO6c3SZ%hK9 z`elnxLBWOGi~mu8+`8KQM@OJ?xf;#g4YdfBpNNw>Gemvm-^;Vs1ncXyYIHxv{W3d&lSiCnvOE$Pw{Pf#R< zhlg*h{au!83yPGf+TquZWhW*o*8OC$e zmZ&5pCmWiZAHRKjcH-f-%yu4e5YsI8)`ZEEoui_pu3fwK<<-@0^ZPZy)xkSGC#zjq z8QlKmOUbFJ+Q*l8PL9}=()o=o@A|sf(zcS-SF>zvY`A)+G5KnrzISh)UhJ-n{a61- z?<{&MVVuTub#?glxXCkTO2);-^+*^xNl%Vid+gAmrtr8*SL@Br`_`<{xwR#8aq;_Q zH9tRnd3SgAl`A1h$;pLfWydaG{ycGg|Hh4mS677|zIt^kr?8qx#Vt7#^ZUp9WV?HN zdB4BEudb)ZXKigASO2&4*SEK;_sUP2KHdH4si`k-ZOv|E)DROByRtHveX7^dxz^eg3N3@3f9)M*R0W*WuAX-Rp{yuU%selYlFIsuXwhvkKb>1 z?AWm*M~_aNHqGt)JlmTa5}CJVU9Ebu_4(@H<$PINrS$dn-TGuA6C9c+P84)*;{lbP zDr#y%f`W}}*Xq9C^O;XOY>mc+qEqM2Eh~I{tmO4I-`iEE_ph5XN9NJv$A;$S%j5Ug z&6qLc!uojoo}L~LZ|}uXTeEbcxAhc0K9-oB?Ojr0BB~vBrL23`jvXJ~?SB90<;#<= z*Y7`fsFl0&>D2Iu?Rm1{>tY^$K5u{h-f^ak`}=Iy@B5`ySy_2!Z}s#qUrJtGS$TMg z=j4oQYi=sD=X?C0%6-OFk%dW)DK+`ZWEIaz3sch49=&?C%D2F1d;0mgtql{Fk~*~^@$io7?|OE2c1Dc0%9~VGJTG~lJbSiRJA56(teK*p zK79(%n%X06&KDmaKev%HDD%RWmK32$DleBV30ld)$M@{qTx%6|^~Vn$IJ~~Lw!3CV z*d_CsEueAJ=850IH1lLnk4Y+?MiMY#bnXkm76BQ{q9-fWj!aSUoW!L*`GT@e zfB(5N7prTe6EvJUbd=C4iLO_`Ld*863gnawOR(7 z*Qsd!%E z_B|&X-q9th{piV)C9wtX*6;rZDjaM6d_2x0W3k~va@pHkNBQmlEck0{tuAh?9o^P9 zufZv?#np0ly3lTw)O1@F|D};uyKB4Mc3ds3JR{ZA;9b@4T{UkD^BwufS1&W3^-b1Y z=#+DNn{WEr9}At^jdE@nL~YFqePS3G7${>~6_P%?v@&|t_0r|jvXyU@=S2T#Y;an5 z;Lsu&NlE_sR^RH4w`;hUm8m_7zy4{9kMG$4?nW(h_xw_=-d;mPGevFf;QUgih^VN^ z6DKaaZsmLSY~boo0e}Cu@3GV9^$n2HJbCiuCGT3rgX*5uGklW2Z(Fitsl6j_aD%kN z!O+H~(;aO-Xl?j9bB?dtLML!ZRBmi+9JMVc@{PvMxV=>`eHi7-?I-TMU(>9lKmA`^ zZsU?g{wo3|WhObNb|;;(Y0MGMUL(qHD0H)Gwej^GN*tnU$9`4kX`NpoqopjJBT}`e zuC>WW*n02&WtPXL25K1x&U&H0^Qq?P$;%CvHwD>mEX%(?Ve|C-#}6K`L?-%2oMu0e zv-gOyZT>x$FW--T4NMWzVk|E&U$bUSm+s?Nuew&RUj6NRv|xGUo+IMI!pV1}ujqZd zamR+E^U1`ga@UV~ta$sz#nSliRmqPGKD`GoUW>~wRa@#D!(~!%<^I>ztaCW8|Ie0^ z;uqCfyCUQ5g6&rCmpVm>T`AjeEqboG(xb0o(^aOb&1~^fP*6BA z37#uN=2#ZDb=u`mo>OrD!a|SK8~OYHx@}H7TTrwv@kM~j$%GUkE!NQ0VM}+H`=8O( z;g#(Qal5;>div$%{-1xnUN3DW;%THYv&E}%@?_z^zxa>b39@6*5nU3t`sb_F>t`4y zw}CAJ<*s=fk9Lb2m%WKtv-YdGO7x_8;YOUEmyAo^-LX7#=1j)jU0WAAPh4W;sHW&y z<#y@v<;d-MvhVl(UI!L+R$CY}VcxuRZ$B99J*Tf``#dPig@jo{s zfUBvgNy09PC6j-C$|sMPu3M6i^V!(gtccpW3T%XHovJo#TwL6oKd)t`t_m?O(Fl?h z5EVVT)O&ix+pX7mWV=+RT7t@!r5PRil*4APuso-b!-XBQC> z0h-;=nw%muX-QDgrzf6o-n=O&*MBRjrTX%x>f{M3Q=6tt5i!fZcjm{($GozqxRv$w z`;cCX!AzG6rO|mF|CsY3J&c*N@L7XR5Lb#lq zoPMPIa$lmRDq$sZ(gDtYZsRJ&XzFCktlt2CGpjj zm7Bi)>H)bhCMHJ0^qH>C+9!7s^k;9_V6bS>q8C?JPhaRPtiuEv4^G`{`lXt#`A&5xPK|7@D%=`rbx%hI5Y85fn7`OnXL z5fGP^wRM*7Y_p4t-TB{|m6w-;YDmxs&Z)dxTRNxdMqgUs$jsp5>-+N7R&8nXyqal> z`>%jXeA}7U<$CY;|F>JVY?Ji2$jB`jf_Hb7E_Uyib8&HDnAP6Ac+sMaD=Q}Y-84)- zwxRre+@r^j8GSe1+EclCo9LAFiHF-*SXpf+|4;?h1Nwck)^1;4U0oT!f8Rpq%1jn^ z_RVE)qrSbre||^d<1NC6-Q3-o6Oxk`2iLv0uux;Fms##DmIEIjAKzL1UC+6l@2X~c zcD8p&h=@~1dV%O9AE%`X=H}Chi^m}3!bU}|L@J)w=XX*=g+>rjy2)&vEGvR_hi}G+2&Gwioo%LS_wQ*}f=Nn^H#eYL;EG=znOoUX5ng<1LMef@vul_5eB5+^=9JpA$V=f|(E zu5R78a_RKzS67F7dU!1Gp03x%_jIXA$_W9#xmHJ~YKKQ`Ok&O7|94y2{SywX+;nCO}6T2^LuzxKQA>FN6BB^s%xRt7KU`ujn@li%*gf*b5LvNAF= z>}st_UteQg5VX|m&7GZ-mwHcs^ytx{DVo70uc9`m@h!j1`?VXJ{MU^ZqXM!dNbBv9Rm2GV9I0$;Co(+$$J-Q|HvVozYVTnen z*Y2{nTs1FVdr#F0{qgN~e(5&T>}x&p^?x=xfTl~$a&NWt_w(2P|GWL%hM!SevqV?0 zKX`Ps`^~Mb-OcR$uk0&UdKhtvIxP$kk(j61;;=GAtP<28m^pLit^1cRT@olNxx=mb z;X|F2Sx(35)vFgePwWEC#hB&Y>F`>rb#ZfaT3VWnU5!L^^zC$kxl{br7CMEj2xx3! zxqH%m^XAPfLsy4QJnl2wj2F}<%XM>e`|~$lLH=*P6#wQfyZH=8n-cspuHY-itX|2G`DgJl=vhaU4vXRjqu(begyZ!DOm|u@CJAL-Diejy5VzIG-q2b{Z9{u-4 zR8~&WXmL2;ykO44WKCluBcl!5w=a*|Tg4-5HDzb<^Pv58wSM#MVxJgRR#vVE`M+e= z25ZBL?_ZW3U(Fox^tbQE=cms$Pw>cixoEpL!-FK1E9=(W7YjSW?8{Vi<+1piB_$o+ zjck3tRtM`o@Uhska_xSr@;5gQHuD6teXZ~9s+u$VTb$OCRL9(Q_vyMT-&QxTh}kQ7 zYK?)_mV)Xti*GaCJCO62RmIl*9?O*j*MjW)trAq*GsKTwx-_Xi+X|zDX<%>YO=q=C|Wlu7ubX{$=v?^nCb!|Nmo~k7t7#8gUw%tk-d@TeohGW%02K zi5{s(uE*D(b(gPo>6+u`GwF-hwicC_f_-wfUX#^)xy~4>d0x5~U_5aCJb$>j`lI)!w!WHQ{`uM2|{x$@)y%>b>bQ?%1tofPBmJ)i2eH0fxUXpg-8y$cIH zE^+(Td3gmXPSc4zw8V3A*W6W}la?%3pFBb3@A0#<%>!3oHOabi0<6&APF=amJ${`0B0%Nk(!jKLoUE*@pn(S` zXXnTb35?g*$3Oq~_qU3gTG8)sxn*x}wJu()9J{MTb3=+#)c=dSB& z3wyr!^z`(e|Nnl2O8xlyzf;ZcRWw(9eFd72)CyVQaCVmI%ZrQIKR-YJ{MFUfGL}Ux z^Xq<{ypZUvKLMmVZf{lQ?iyt!r43uQq`bJWaL0}v1wTKfGP`R`off>@@8YIZ@3;N! z?duYN@!`I1_m6hGNb;~I2 zj6_m$vbXNNOCf5LCd{5Koqm4a(#XweN2dupeRyz?`P-YDhg&#>=LMEr>ee$f4BYH< zxS2iY-kzCfXPZx+GNonnW@9-yxhrd1cI<@%uIm5Cy5un!7t?l{en^?Ie zOtV5(&i(xR{r>cun^OOLy&j*EntE|xZS|hLd*yFxMeQol{QK+c;oG-ozrMbH@|-z6 z`}f*F>#M6**2T`Q{ryeSO64W%r?1!J zg~h~uaEeApidU zo;+vHnOj@416PJfNdNzAICIJrmz*3OK0dyXH4z^>&rO~@`7o$nxUw>MtM>l7?{~{{ zZf)tDsvVxSyXF7uZ*On=%rs(^mzUr7=acu_GJbykKY#zOjNNTESZo;@~JrLRKXyjnKt%Z@%7OQ+Y@)`Di%?Ck8eWL|Dt8NB?` zs!(mvc%JU_SFf@TXq0j?1_la9ac$2#xYWDgolML=9yhmwKRXsG*Zf;~HEYe9H6=n9 zwq#!Z@bxPwXC66nWJB%mGB#eRFE>ir+1V#gn9#6%`SP;aD_3gHwJLpdVWG3D+Corz zx^pMyUj6^SOuyf}c_U$%#BzGNzPhEQWc2Ol>5<=!rnekAd^mD*8gKUXb*gG=Y{9|7 zt3p>F`}gg{{ySux8K5UntVP9{Tn3yD9y-Uw z#8kXqyPZc?>EXj!EXDu+*n2*I=4)Wg93H+Rm|e=WDRT1yPvI3&p~ZL3N*q4+caMC>lLGB z^5vgzx8MKq_xt@o4Uro+ZEsKP%`&~SW1**+xL(G;>UT04A{Q35K6`#O+|+Y6h{Q>;8Ipc`0dYceiqje|p$1pY>gHs+R~CDKp0B~k6LLnl1WS%-<)*8G^T%y;&q7cWlS+gsh)*QchU z;&R(Q{#J^!dIZFE6jg zYZv!#&ABP0$YP#!-`w<)Y_*n1bv*!0r zN+K?Cdn^rF7@%=uf4x1!T&q&8t9D=B~N|Ig&3-QwbvdsQ3b7#)MW_II>4+-mHb{;x4RePp+zMOl%T(}cyv-4j&-BfCx*Dzn6g(V}(S~oh2jo)WB8?W>$%@@x*+S}RR-rlaRrq*`h zLcrc@d+Yz#^~qX)b2(o3@8@%?wKM;3+P-~x^!7X}^DovVFAm(zDaYx&iTG^kAjo4GpI-RKwl6L&c3*kr?xs|4J~^9+gx_CYUY==JyX)Kcwb9#Oecki; zcz^vGeJ9tw>HGixtFCQL5lBtCHSfZOfIWNna&mKPZ=17or={;Klf*wiKIYumu<**` zQ)kYAS}ifV%X-`Sz3;8cyts(@ zdB?+C<&dKC=L7SRqX*k~4N^LM9L}9PcV|aobLs1Ag%1uiy89he_569t#rwq7t5f;y z|4h(}-F0DmemonWjK}3=zFU>2ZQ8VHN8w{Oc7C~(o10R3q|JIJD!WgsikYnLf9&+> z?!)c;(|_$;aw&AN8!xCL2c?oVk(<3r&h$!e$dSyswWLy@wgCC*j199>@r@%^w2 z-d&a}rW=*=!eGhsfSDdn4EOHc1C8{}G*16?D|`LKY17(*RvtNWq-D(-ot~ba7q_-* z&ozDt>f?bJFC=mPJoII@Ky{3YngryL#uj zq^*?S+@?S2OPwEkn_ruB;`B*nO`XmuCq(3q*{eMDv*9@7>NT zzC*>f&1h=Nr^u+NOKYRI2idy+|M!>s&T~oAERn%5K0VgLX4?jOO z0|Nne_I9P^U-y^3o_20Q=Z@cl^=b!ibaZ|5`d0Aa#cXAz zZ#EQfJ$%Kh&T>*5PpT28E%)y7_j*O~Ute84dGci9?{9A#(zZk=Bq*GnWvXq&`S;^- zd8=YyMv1@wr^s1q?GOwv(P28v+&6tux87%!O`!#^ki+i%;qBTc!p&`Bwzc9n zwLH!@-I%iIw1_K*uwk(ru^`-{-nEC^_~#00#a%>O?&dQMunXN%_wi`izmmww(od9qV~|DQ>Hvesgi zK3lV{zPPedc!A{d`BUcjq)d4hd^Lj8v|CbRdC=jtKOUX7>D*9Ju!Xf)`0rK8*-UC) zD^?uOTeZc3)UYS+JZ&WT$xuFa6Mt$OhMdHdF#7b~a-P>-L zu9e`Lvj?9EPG;oTs_-*R>El7eBlG)J?JU}=6$>?dr-oz&wVv`_{m5z|>(tp{s^MAHN)bD92EE8=JwAD4#$}iXbs#vJz`;daR$JHxm z=_~#E_kH@3=Z!v2ssaK6AMUJKqv@EFqvPHu^YG2i&v!a^_`bil_vGnj%i;sq#rOS- z`rPpH@|i1>r_OOba*;!+&#mD357~F|d;O;_3te$@r<$z&JCCc+LN}I8dAvjQW#Fk2 zp{frL7;oOZ8L~3S)jD;T;*QVV zyFZmHB0ryewXgoG-SzEvmFzyKeN10enDfx%YN_jpzPnt7qFb{r8zP zFKni#lcAwukF>Sw&)_q)$D``U$_#p%xN zF-vC5kofoEe=Og{x?_BDHXacXGssJ@_{9cFeu1nXmW9 zF5eSe`ReQ1;}3G1SKeBrwf&v;iUiJQo0j`d`m)GJW#N${F2BCKJpAM1%C zot()2?6HUIoz3rZoqH=ng?(@U^rmJVN$+ezPl3Mig^83!21(T)u^9qa~ zsx9nXcx2g8p~+&-C0QnY*ZM4OTRaXp$0!~xZWa3e$O$#&m1(iPR%N9-&Q&_cH>phZ znCaydy)7s4`nuSLw5JE_`A?rackbDXi;KU!yL&s}p=aua>i2uy=iAlZ*s##Bv2hkl z$VR0VN9|LC-YqFeddI1kzqjW%NBO;-Klsc{x#qjSi}X6@rDkF{<#Ty{;n#n@@6zun zm>5op?%aMNC^hiYCT|t)T3$Kp8>@)0@L}=znuUMwUb-|XY;BZb%83a|?8dfh|Nj0CnkZQp zx3_EKMnhTavL~O<+b>T#>VDo(R9yUc`Tg4C4-dC{dU+i>d9u^4_Lo87BNrWAdBgXY zy_fi?E(A4(6Am!!*}M1S_wV`z{x2#&KA&Iz>0tY0&pq*MV)H8f4{@ zt=Xb7_I#nM|84$%>)UFX`CF#nn!DQg;USis>|4{Sd@L(1V|JBy78^d_AyD2p;fFw; z%?`(^Jgaw8?`FnrwLH7pEZt+V;+3uIy?JL#Nk~f;>x*96v|yX_%Jv^I-abAlpa~2K zg9fY8R|QW`iPqHC-rQTgy=+rrZS?j$S>5PuDVLUbs;H`h7I6B_xAP4M2-wJfA$~_e zBd8L3_3G5__xrrRzPh@z?5&jdG@Zo5ZM-s;MN3>d-=qdCnosU)O)|i*KGaO>fS2R*MWzZvAJ(8wV z9xz;9?ys(+!&6;dz3=BUY0#Rzy>rgL`X6q2X8zfw2EV_(Ro2nznQL7x79p~^=;+iHNT={jlT0DdI^cJg z+ox)WKYH`Vr&~<7OQ-nbBUgr5CYeDm{;B!SQfPT_X{omnXCT|;3!wENuh;LlD0>qz zbFQGH(HueLW0U6YowzP`>Ynd%N8)?ZkH5Cwus;2K%LLAdu$oQM`z$LhWp)?y?3b?l zarcX|t@>O)Q>%+BtJLjsek=N}HaY5%=#pU*vY|!YrgsTDXguQQr>AqQO1t=EtzNA8 zKXux)V~5-MH*VT==;TRGb#?W*$@+17ew=W(0d4$wVA1gN^YhL1|LgcAy>q`Dgz3W_h+e`(ge^Nv{vBE{#upyC%eop===66Q+(`S$G_XqdX@+s*Vhx3~988mC=Y9j^bj4zyt)_x86N&*#|J+i{EQ zJ-M*Zc}wQyWj8kQN|`VyC@C?yyB}xzt*oRJpdoUrNPoA{^p-bo-c-Eb`~An0$^JLC zWD2{voxjiS=;g%~t{3k#b$0TLfH;YhCr{S=%G5BJ5?|lSz4~0ylg-LJze)wR?wVTj z!7(XKY4`f~&#s@|FC-$`lCJAtb?xQJMRMIM5|#J=u;FLpk#GQwwfXowIm~Z=NKJ!40I|MMRoA0NGTf3Z9Nspd-pw4MfB$A$X1>|CZMN?8?FE0%6y*y;|GQ9 zfktLfUv;v&|EoLp@2;(tzPqdR@!axz4|l)cmwaxHrG^MsQE~Cs^Gaf>`uhIA|Nr~< z544X&Slw@m1|#E)S+hXveB1bBPeteNU3&S^&8^wu>F4KNUH3zK>OmEimW1PdvJuhI z!g6wc6+7PD(VlBns`c4(1!(Mn$3{`z;Ob=g`a36V;gIDOLZ?}~bShYl;6h$tyPd>4Cm z+YE^xf1l2SNn zo;{$AkG<07$IhScFMND#W71KsDPF1{KYq0OoVIVxsTiRkt*I@ot&&zeD|vhVL3kL`h!D{Pn+95`9iulaxMcv=>>^81_RFEyt{t@Tvdo`3l3YXPaQvsqD&k{O&cJ{3K7Xo~{kDcMky4tj>bYWg>kxlgk zt7o>WwytI8JOBNT?b+Gcbv$P;T?#sP{@Wal$(|XnuB-%&_M7G20*&?;6&EvZ*tYH2 z?)Up9d%jRD_?~BTzvl9cm+S8-rkxHvCLiB+wC*U3Z!;c?$mj+Z^HFgdzan) zzJ-7Fw2r8?o;u;{4y=uy^?!e5@aO70J(EnPudlPCjQ3V&|BK#hHRZDJl9?+fOl7sX z|I>ZaJdc^)PAgZg)QR0S<@9v@$FE+ky8Qq3ix(&6T9?m@)DhQ@Q?am+aCdjNv9wS}n zFa6my(bsL-KV#d@&Vt8mPtV_5a_4M!!Alty_U2aB9lNvN9X82e`1>nU$bW6rtaYZI zle$8mO}cP*clpMxTdzufpRcc?!XiC8eKX$~(CqWJ+}j_%eM|fK=_zQ^wV9oNT1M61 zS*F>ao^24k^Xt{=bb*)M&);s}o;c-3UtZ+xm%oeS=iJJg7Z=WLdVl`EdHQ{|2Y-k? z{+aqfKVsGtr|I5#>z0`c%kVrufB53!Sz&#vwV%#;t#GGcd5l>b*p3}gJymD^l655x!(2l@yBo8 zoO$MqPfl)bXJ6kj%lciUyL+}Xw-+R?JpOCZ&MMP3S?MU_wTI+(oq6N)_up5> z4zJ#%FZqi-&v`xjG2^jGS;m_ElhxD?&9Be8#>&stG(q4jL&LMP3p0a%{Hs3ufT6fJ z>3{t#Iq#jj_Ncsco$2j#?AS5T{Gg(9+lQ0t^A`lIEGR8iwX~GX&(B}xJ3H)^p@s<8 znKNfVyLTq5`9Avf^|ghiW#HBw9~V!G+w-V!X5qF#6WJ$TufInzfB4;dzw-6>?Go2( zWH!go>|MF(MdfZU6+5{;`RhIEc4a=r_RC$lU)+)0_k$^FD^qo~ZA`CZS>=}Z~yv)%{DPIN;=*r`{nKJ=?4xtELyzy=il%5 zpSCnF&H3=)?w0xtm%Gcjs%ow?PmMZyyxlJC^U||9vRg#`r>oceFjr>glV_{1_r28F z)3Po1;neVimq8hKql)w0CoM@|ccymLvgOOO(~p1s_)&A~=a?M@j_Fl=7kFw;GXaQUpMi~vdGP8E_Zf1&-0ovd1+e3&V_q+rVE~|Jh^Az z*V3X-MI7Hamvx0sJ-*sPm-lzW-hvwIH@De&rJd&6ZAjzYlEZoQOp}i1rOm<5CI!UA z$i&6P-Pv8f{=~`)UlY&IvrS1$dzJI~)2BsQS6BV{`F#G5U%x;n8JwD~f8P9l&EXpx zlUD{W=aaQ6(bxjoDST~BBy+~H-yS|*Y9AZZD)SW;qC;OK&ieF!KKJIL`TutP^W`}4 zbN{z@);e9QyO}@aGdc~uYs->NHg3OB?f6DC zTO=twKqO#E2bag>O(i$({{Fi$@zE(gSF!SmzwP+@&)u16ogQ}g@tHe2+nG;v6+V!d ze!M?CW@Fu{bI0b_|6yciX8!Z%v5bY!i!PTX2WqEF|JwGpz4WiSb6nUyx8uoApEx|b zBY9#TSKFDp^$T)uvObMFd@y>qpv&{_lS=!I>h$)){J77S8uK7D>*~jX%B%Uo(NAR_EoBoIWExXu<)fGU5B6U^qWtLh=Y043=8L2RR(dM5Uu5XW6Sm`zMKAFzoW>Oi@J0V1E;m+dcOb`68{!*-f%eI{VL~+f3*ph)f7}%Bn+82_@434U#79janddo6?JuXr+r7~Xop5`O5p_U z%e!;uj+JkdN2l3>&z3yTrX6}zVeeD@vVFn)W`hGRC+ZD27|+dTzqaP#`IBb3QX6um zKSa9vb}f=pTj}kTV$o5J^jE0#RDH69(ZxlAwE)x=gy+}xiFqa)ocN_;rE%oJsg}PpE>&{5mCyMRpByM?P;K_#_0qc7 zpRRY8`7pldJ|yxrcG9l;o1nzQ#(U`f{{MYXo}_?wT5YNCzF1hgbj1n|S=rbVr@ZbS z*Dh4&Kfdtq>~fCiDqh=LrN{rz`PV+@P`&i~JB(_6PtJS&{iM2ohqPuYOQU-_r&cKqtpjT;S_n3g{}vhwoP{5u^YVoV1g%RhSCa{5BfWf^O>w+sv$ zxVSH7J&bv9%JW~!!g*JD&M%W%`sPgzsACuz78uyLcCGHM?fLQf$8~gdkFJg0K4Ip} z&Npvz{(QOY@3dW8Qxh~s_wmh5<1M+j#V#-RcRwv9rm?5~zumdH*6sZAb`G(zvU{t( z9@>z2Sn8}vVooESr4Npr5YAA#%mP{y<6nJZ z>GDtO>oS-Yxp?^c9({6hGH4?d3oGlx=kx2^cJ8#S`~7x%m33NRpde`0s8`xN>E517 zr|p{h`t9A_+mgt-!1#ae4`m09S`u^FDMC8nDl*4 z=7*(gSLP?bytMSk@AvyZ{`*_aBWEMwJza0D3G4J7D^{*lw6KtPe7s+L=h=0!yFWZS z%H7h^0-E}_sQqQKWy_Wg1rHBt{f^sHVaO+I)e^lu@8OM&$q_pW6#xBtt-q(@Bh${E zJ3&qF3Y&Q|&U^gwh!s+5QLwRzdEy@vGiQnOlB|_WW<2=zKD_YccNM-~8xG@Mz5}10 z{$b=$RMg=86L?86hW z5QvG1S@83Hb#_rv(T6Wzj&usE2ZV*GmCQeM$SLQ}4naFRyQ#~VE?>EF-W>2_>P%#wf8Vmv)L?dp8ins}Edo8Bssm+QIFn`x__ z+_8|me#O^r@dJn38yXn{B5LJDzN*Ugw|9%{AG&i##_B&`(!-Ax1!ZMzTeq63`OoWV zX=$n2KdYm+ckP!sx6Yj5X>D!w@bh!qUG`S%t+1qI=b}YQ6N>}Cy|~EC09pg~<^BEm zKaSplE4`gIZQ4}v>r3X+uh!-7TtY%b%<}GNG_J^cer~Syhc91TB-_;%#%j-du=gnA zi^y%qyl&rY=;mIq;DEl?_g=59!S|;dr=L@>v5}dsAMciyrluFW>&O+!)2B{31qBI# z7Hs!O7%sZBPd{$Yfm2hpSHG$M`|In4)rmL1{rOY#3R2j?*Cr6FUrY@>C&Z3AKu(Fj@efu zdF|RYpV`xo@f z$9&rx7cK}eeE9g-ec@ZtW~p1-aR@Xwt#MhZj5UKXU6v&&Ing7Y?cy z)O{%1Qu3WKCbseI?M$XcubxbguRFLk`}&3D{_>zjW|o$gKGNMs4;}3m-&pZ6NyfU2 zM@>zQgNrNaR(E&z#2GUpp8Dsmvl9^!S+I0ztN(mE&Nb^Ju3f(_zH9!%g^IgMUMhXM zcUZ*ul#MM(DLBg+UTj*#Kpvt{{Qr=2-)Vxlsr zFJ4hu$;fbTUv0PVY_rgt-!Coop2>CEG%-87`*^=R_nPW2FD5!HO-nS(xzS)(`|H8M zX7(4~Zu)$vtgMXKo+m4&8>RB8?Cy7$SCa&$pLX3}_qSzRW>yy0pVY-mg441z{an{O zy!OkA*!NfO!ftb4hbcECrKFPH-r73DrqbxnojV43cPySfd7_}L&8?=U77!NJHg~S< zJp1}{Z<6!!`sP}fcbWFRyu3X5#)d==e*X5kb7hT;j0&Ed5cHXAC2C}}DBrB~{XN;= z-`+O&_w%2dYt5dWo&Dt5v!o*(f(50eNB{i%d{k=r7Em>-t=-+y(&F{{>60f5R$W{ zm)H1nw?SiL{9dit@*q6y|FH3UzbIMFa`meiFiS0+rH*!cYX{Kae5 z@NC<*EotXc)4D$uJd#E(DZk(E|Ig>|@9*N`l5ng?^2ft=`Bi(kqW0D7beI$r6qM9w zT=5|xtv30G|Mn}YicTDCJQ5AE)@2KPr4QaZb9%Zyd;8&opPrsp6^T82;?yZ8N5@7< zvs)2MR74&}Tw_|}o6q{#$E@I+)&-7#f`R`H%Z%GL&Mw^hMOR;6|BL;KQ>RWbo$tDO z<;sQK<@p=sc2|CWmJxSWn{}>Lsnc@5xmj1@PfycrJ*OK!`EgDDlDv|bswykc`B!0U zqe8PbZ`w5Jmv|`Sg4*BTW|&s`5v5_stt;+wQF_r?(Sk$S6BCJcdu0|IAqq78sFZ! zPd8$9-SiR*5m!@#pqVWqA|e~={#LDt-!CUADH#wL*tlrXq6pBy8ZW5m+qrXR#OAbK zhv={{v2Sl~Hmm#3YdD&8@ak33y1KehzMX&WJUu=A=VbL$HTRVdKZ;LZtWhg??6^s5 z(Va>wS$@~Rt!kp@TjKUsweJ7-%lpNY*SgW$)=X*0yT7k@bNcyfKX=Txt37mWZM62< z{*DfZ!a~Ee^YeN+h1C*nZb}6m$&+;_e}COyfwKRGTcTcGvvkWeE1boC?f%L3SDnHQ z6E60MxCUOG*rjr1p))%uKj`V{ReX6d@xT=L#n&4$V2VY)Zo_%Ngo;@~Ku9{}mJiQ{|J97{7=lgdV&u8;Q#9s+o zsL{1bbLEcuLrEJqWM9{lu_$23%gYN03Tm1=SN6)4E1(5>Po6z{^!4@ij^18Si>mPb zy}kKX6JH+hmtVMW;m5Om>b+jx-hz^no&7r zZ1Nk?QNyfwMfchrMJ_gN6((MO`0UsSbFGLmXNBEk@T}Y7wK*%zL8yp}(aq|AS8)MMXsp9E=Q0o-uq% z+99B&$LwYK$hQ8|`}L3h`E;NDF?V{`$Nv(oOCQZww7>ZERPr zUQJ9%X^F4@yY-YOm#&V^KC8AncVc$z-1)HI{@;q*)t*oG$M2lV{?D+YWq)Sq?V7g_ zE3eAzepY+3Veahay1muSCr&Nw++$PGqB?D#_M{CK=l4HaJpI}EEloSl&!6yW`$COO z#ZpfXH#at6b-yF8udfHKZ%_L>O*i_%g9i-4!oqj<)k?2hx31#T6V5ej)*O*Lyv%nt zD9@cZ;o;)y%E%D4J+F7BaeCJsbpr!|WV_kA58nRnm$0glU~upgGgy%n<7_E@;?(-8 z+3P1pb8N}tGZ8*~_0%iPdPU!P?N9DbUtn6mP!e@z?|ClE)<60Qh4bwD88UZ1`tRdy z*)U6J!AhllcE&dx>NQLHuF{bRS}qQ74Xm1^YH zxG&kueQW21hc`rAJNvJwE?lxiMMOj-WR>cbWxmo8(b12ObP7joNMMYKjV*k9tk+6* zb?)tL5gU_Smws(#=NJ3Q7nm$!b&^xh^=v}rW2Q-~Dz>=>iiAc7O>c?Xn#F21yLYyE z{-K*UXGX?HM0DJ^5yA80`_U7R9zAjkEDgAnw)1Dg%h@4Q?$xk#RD`()-ghc2G)ziL znvrU1YWm{!>+YI19lpxS%8vg2^;_;8JLdMl&)w0H@zSMB6DCe%^!D~%v1-+|9}NWo1o?+ zgMyCE8oy@#6|Y)jE1M$un+on1i?Mxqq4cs~g`1wDBI8`^^0c@ReGLtV)6;Y}W?$Fa zv3vLR(}sr+9ctNkEifcR#bEA@1&+-E^75cVF>R{8aD4mr&Gc3M^K)}Sry?#`yOx)m zn_ER)U0Fea;qkHF!_#!5FKk))qUia3?v>t73>yj`yG2AtC*R(d3-ZB~sZ$?5c+ik~ zdYa+(muY8bg}$6Ncgv2duUdQd>d9Xn^C>H~9cyTQtt!jqYRD&V*R#;M zT}e}uQ`x=m$c>H3A75TpKXLUk%dV`fEDsM4fr#&^MLUY0^Bp>T_~Opu=ThIRKRj?` zVPi|Wy)Ac!RjJnIe=jdDFDNT>D=akZld%li{y>^xWld3>p_87HQq#^ew)Ow^IQ;!4 zXIteEA0OWo*mZ4ly8oR0C8AQg((jhc`~Uhe@AW4+H{y0HzYNgu(r|Wm25m&lF_V_J zuS>ZmE-s$@|KDFw5(2dh!`H`MeQBX1#+{Xw#bmD|w%V_@$U^4KTx;=j=gu*4axhqx zzw7z=`T64)7Z-PQbgZ~sD8;nW$BChyt*N7f1JrXp)XH7){oULp&Z`VvU0q+idgT}v zrloJP`s-Cv0SF zT=@N6ENHy+g?LR&jLf%pccWAPZ%#j-mKL6QX$j{nlguWw+*=Ngj*OrU(%bW7XPM{6 zEiXQC@}YnK!sW}=x9okS=U-MEW@f`xBvgbH&P)2Tz>f zu>bc%nTwm-u;__L@5E9{kwZnkXH>B{zb8zP04=y5)M{`~R5W_AxxPr(_l&)&Hsqot)4vA@pN*XgT@ zjfv1>Ir*cy-yJH-7EPWUbSd+ApX`hK`|WdbayDdL)!MOhr(vg?pC6xj{=Fk-W*R?y z{J0sk+w;Z6#TzznW zz18BA)qGc7sr&vemf_FzFZ;`brneXw8C}>@S-fy^@2nX!Ogc_qo-#!w#-^T6^=RuP zzNKM8e|{-#uJo>uyRY{$Kx37cmzUR#{q^>9=FHiUbd(Epgh!^aiOG?lpPzsH^whhe zy87_x)7*uHg$zH=CxxwxiA=r!`uckD%GqmjZ*ODx5pGcG>7*mZ-7T(vY)j^47Pr4l z4AV~^UFJL6AnlCAmV6fDtKP9fMkXdMo}QfN=2{=$Bh2!FUF*&5?flQ4Jrn9#mlhNh zRPgdqC3)lZx}nfUtJ+EP0=XN6KvkFYRMJ#nx@Q2D`|H$0#O zHg&3^iHXR@jT?8={@%94dCj!Fdu_|!-R$3Yu2xmnt2f5JN;Y_Y+`+q@rw!LMFI;kX zq11*slVp~NE~&k`@9mXaj*i>PHosjLv5{%Ie*Cc)7Z-p0^RswQ{eQW?zrHrFUacJx z5>oKvL*khkhL2abhsfJh2nY%aUbuMi;N|81h5!Ck=G@re_`vn*`i*I4rS9yh6lU0; z1KK*~H{Y&zZ}s=2)6;YdN=lA&2r4gFwk&MXA0HB1+S?cJ*&~yFe%{(m zPrOUdoINWjE!|!I{@%fJ=lE8Kt!?V;{BT|D*4FIy2M-b?q@}}e=fA(Vcjn4UCMKo} zt3?0LJruXMic@9oF@t2LZUKP>3=YPg$3Mk(`g=LXKi~JlzCfZZ|JUAAxuS#LN6P>$lITN8%@i%Qf4#*c|Y2uc`gS@j*qf zz(6Q|K7+vYxca3sJy~(Z8>7^n-#Ontz_v-1^F>~Irv?xgz%m1n$&|EX${ zS&(_2)u(4qZ++Sy#`42$)+e=G19|0Z)k65EOr4sTlf-3d`BIxHJnmfUC8PWni5UlL zOW%6U2o`bel=gM%J+n;ym(%_QJnzcids~TgEz+3PA~pH<^8CZ^T_u$MhC4=X&fClY zQq1h@)a!B5r#!~Q;Lr*Cx``zkBCdf98A7YXGcz-HR6dsS^6pZV(57A+x_0n-`D$5KkxC!8LAg9i9gQ%DdHMfdL?7>gyqZCkM&3@Z~2n%>B$KiW~{ER z26YTJZru3eFc)X`tgsB^-5>l+@xw_YpbZQumAEw){}E{twF~DoH?sAVeK6j{flD% zzL?3l1_rITc&~4@S5}tRJlpEFt=ZR|TwPgze}C`(|KHz(k3Xu&M)lsjbt~y_Tj_`S zcCxxr*`8K1U5hjp?z^qM@ZsV1$A5o+XL@a8Yy0uE{#Abeyjxo|uUx$fI$@TfVfu9O zlG4(T-|yESzIik9h26=MCo4WbLrfo}ly?cpF!o~(0!!W()1&u*{KhFIx ze)Mkh3LXtTW}~APA2!ZmE;#bz`TF&G^XfESMgPc~91zPRYbCW_t8#fuT~0 z@R{3N8t*=p*pkI)BKlaQOftv8Pb@$@nfFMOkivEko9FS30u8Y`_v{!IOvMAj7(!l$ z-HmjJ6AXya+ZQ3aB>&VQwzUfuFm!fyPMA8iwX@T6?mXV<)2BcF`uh5W>C@eRe_OQr z1lQ!bb9;B}u+Y%ZSm4~wci;DF=&Y8Og2F<_c0O6qnN~c~W<2TV<{UiIDGWNhx=21g zKK{qAUq+`zr-m{*w6U%T{kSyt+|&5jkgdMHxtm^dKHpT-v+Fa%`>vny(?UbT)~?-? zRF@iBc;wg4rl61CPAdP2KPsCZ#`yoUNc#S#F%8~FU8%~-$_dk_AKzE|`@yqkY9+rHEmA6Z zd5QJxEYrh}kN30Q(u>{2VsCH1V$~`oQ&Z7x+qPL$f798rWmR3;>`9ZFRt7JBbZMz~ zKya{gq2YhkA1i~GCp|qiH6TFXv3&t&#uaAaHEY%syu7s3>vg1#m|pz8o`wd7DO08- zoSdY3V?$yyi_)68(!0+k#hj^i@sI0%7FCjG@#^=M+P=n`1p9{ch1=+nN1B13{Rdu zeR#B6eCjsa%1z+M(K*!H-lwF^6B=_{RruTPMRaFx| zJvnJn@nOM*=?^APnzUe@o<-7;TeqYbKK%JvJn^`7?Jv-gEQtvT0V~fQKFoY}mg(xt z3Obn%^Et0JpE=`mXSejXvuzpoZbpO8mx^?TA)@Ownn3)}0>ODOmB!op(_22%BUAN2P_jv^^ z+_FU^GBPsb`ntIn$|NNvLGynnPo4~&*S}@4=L)$a$BrdE{-8mOW4f#JG=em z<>k)){`^rOY({phK9SigGi6hEJ=isu&s`JxT&iTWV=(S(LsCS^Dro zQBlzhlT0B7gYby?cC}3HhaLU=_$*}jHs|gxdkb2FmiF_?%HRnTCxYE-H0|c*^utGw zvI+_cf({wY0Ikpt2@PE>o2dSkgHdrwL%<`^?`AV4B(|zgPCK)@?6wh~qQ6jfeUJ36 zRVnKu*(bi8_?|;kV`c6B(8}4K9$tMFzt89?sHnN_sV%B(vFQ=dpWh|*!Svc>OocUs(a;_h<&{Ym-kPA7yuvZ=7?$L~{NIB|1x`pnXI@7^t`{QT_6 z+uPfnzDMq@GR?fTMf2guiulqqKR-Vg=H=y`G&%V5{x95OItsD7N>&z0%k{fgeShZ* zI(2rjgjLxak4>95&n!JZ&sO=>t5;7xJw0vOxBA&0PQ`g&FT9`5#i6M1#cM@l)cv!P z&D~uIpMS`MT7g2FlaKR7L`8wl-sIrrJ^K3k`j4me_a}UKa4;Y&40JjH=$O)FD&D!E zGWqVV(hChEIp$k{8todr`#XPG;YC-gG zy@W%b_X`@mE&uVtQ{|HeK2_B2M}lkJ6_xnFCiPoMU9Wn!^Q zrqsdzPfu%YuLUiL5qrPI)-&=?W_3wa$NKYgoD_8V4K54D&$nT+@nn(dIdWZ{;mA_v zEU$)TT|a)ENnrk|+AvYV+iot;PX1hG=@Zjb7VM7AUB2Zd*8$N3mu|`L*dTD?^yP-31{|Gk{dMgRh6justDZj=VG39l?)23$JY2k)ZMX8PtJ)jC@4bDGkq=zp3sv72 z2~9sc>tnsfsh88LTDhp=zhPUBHRFBr^ArDk=F_-%u|UMNmOVo#OJRqM zUP#^N!-c}yJN{e6U3wTG;@ZjT>%@CxTHf9TVPSn27nXyD!~&<>xS(={A?9|S(BsAL z6tg}>X{^=^-_PtC7{cs0Ilxv!PtVQE%V^mO?yG70YZFTLgT#OjEu$+y6bBc&-;H6fzg;ft;z3N(ie$jb zvfP>??RMgsCgq9?N-9B1DSc5=wxg`OTJ9uDSg}E`<6hfhl@m+{bQ%0rWI0p?SseaDjQ8>J`S9y&_Oh@)O|0A>Ua#M; zq@={eARsE*x;A?Iqpz>8U$}M+bkv=IghYpV{yhh`WxuRvu(7dy`10xCI@{{icfUP4 z+TGDr*ZSm4(TVplO$N-~IdfhGZWms%!fNHe_qwi~-ivG0t}JrpR%2xRbL+jNq~w`T z_x4s_Tpw?rk)6%V(8eR#1giaa7Q4UMC}UN^@%;Q;$7{ROcdWY1w@R+W!pt?W*L|^% z(|m1x{p0`s{x+=nQIK|bwt4=AZEx#EpFMf9+TK0-ULwz*JzEsII!viwTu7+t@$r6Uh8;0_MMXDH z{GHNyXO4^v&pw7}KEexsM_PYzvYXwjB$<1o)Mzon5$ORj>N@`yFfjr}gkey}JGA!sc7Nd@KEmb(N=x zK3}xMq2|A0V8}%$Vb;_;+|}CC{&Dm-_s`5(kvZEjP{%eX?mOT^yw2*Znv1OlZy+BUi?0u27B#oZEb9M_xJI#v$HS!+bdXBg8dNW^Km0hOjNw6%g^&E9M-PfD{?85X{r$kn z&Fxut@xyvG(c=t^DJiV|!L{=7b#gH$PMr$AocZT>LxV>of@)FR*6W(*AV_4N@^QJ@^~;=)4aZ*On28yg!>#4?iB-%GlR1NN;<~#*mV> zJ6V}AaYd-Ct^A?fF)GTqbu^Ce&Y_T!5tx14j#fk_h&e%=3`kwNYb_u-eq z$2XLH=Btx``n2HXRZ+$5?~OT&zI|b+_|@0!y!{H0JLk==1#8yu_Sb#03)OyD)YPaYBt0l$IB-U@PQqA`VeZ@AObmSQ@An=$#KhwFpOfK( zmKxXVy7)fZ_U4)P#}EFUTkznAWJX4Y(m!7vHUAHdZOg=(&d0Md$lTd2yi`?{V}_Y9 zgMjc?Ch31Mt#{d*XV|e>{%<&Z@cF`J>-ZQVc0CX;DSy>kw~m>S!TD~L^8B;M<~chW z802(s>DQd`%wBG}{@sLM5*M~x_s!kcBBpzVfuZ~P|DJh!=U&{tUz*{;p_{=KqJM>o z|8M7E*pT$G=FZMi*~rXy3p6sXX-vK_S=}Eruhk=GJ1g?~s!;7CM~*N&;NN&}Q!01W zw>O-zv9Tf|A`jl&+#LGt=2CC*l9!iUGosJ^FuZW_qT}|wZ43;hs**EiODyVFuK!u! z{jYnITW-nB(#>h-4kS#EyKwO$BZJ8E9}b?LoO}Q0UcVgDwrdm9=GwS8xw@Ig?U8<- z9na)fw`y%(_hB-BNJz+q*Y{Ind($pttvj*hbA=74eSFT=%J~20`KF)Ud0yQYwz9JN z@#CX1Lj$Y9?-why9ix3`Mm{UrIm5bK?^oIO|oSkS*%*Fpw#?sT`^-M2GVPsO4h>`1nT_-AJtv)AW= zmOIQ+vKM3hsrJ7%&2@1=T--Sw>DQS}(R0*q9M>;?aA~#n=Q$r2@0UMw_H1HuGBZQQ zr~E_Z8w}fL&Xg=Fx|MY9{ASi)KfX?ne{gBD_AJxK_cwZcozLOz?OpQfO6PycQ_~*r z-OIcAyq<5}rmTft-3mcLeF6ebTpXd1b#-=~{r&1Pe9PndjqCnYFg2`++Z&ZrD`!>G z!JzQ>_jmE=`72khWMP;%aiU=K{1$LvkoD%M2x^&H&n9M0M zu7M(|b|##jjO^^}BBG)PLHj3arKF@lXWT!q42{*)(mHhb@M5>kZdcl7&z9EF(U~#5 z`RKu8$JpfLmk_NePQ$%g$QQ zz)Pzx_Vq2+=vt)GX>Yae;`td4fg-M+e7;U1u7OjITu^ZVae2_VvWx!ms;a0cXlZeU zg@rLKRcfjH`bzZCqelytEMcjxuAX?fytt_7!+HDvpi%v~*5&I8bzZ)FIbr(r_F1!{ zmTvp>si>v3wNZdcU46M%@$1^YvuVoO-Wz&$&YL&yLamaL(u6s4dgN@Yu4K$8PD)Z* zv}n-}He-=7~589DLIn>SkLz2oBM ztysCz&>qw!+BVy!(#X)&c)rm-KOHhf>RRD&(3zgwI$OTWN;gwtk<2pceQhi zzq|-sw0NZCHOXb&Kw^fU*FE<%hf>_pIp3hMdkc_d+{4>haXNzJlrN|ZEbB-^u%M)`t|;C zd#hA8ou4vABq=r3)vZs)GbT2+bKye8%HQACo_M?8B=?p{QcjM~maSW}_wc*cR{xO{ z&Jg;=W@K#axjF6ZjLgV+w$*MSAt4@ldFw8`-5Im)z^4xn51-tUd08v>`GW@z|9-vJ zcjBn;Qe(-bxfKh^z+BZO>o-pG%p>%*=dpj%6{+Hp{v{78|#0QCYflX^VhU*qR7OHa;1RP3H}hk8${z zi%3X#)YR5ym&A#JPV<~Bp!)QOXNR5eFSb5eYc^wJ<21JxzqwWmeP^42*01jRJKb1l z%Cu==T4my*qOHsQ=No;UIA!Wo!;%*PZ|?5iek$VM_x=A5o;t{Y|oFssvZHJYy0rv;2B*Fe}8|_(rQpd?)p2=w)(-_x4H$h*CZ)j=34GQ-|h4? z-I<=ry}iAO$;r*i?tND@Kt~%NymCe4-Mjy1jbdYBdXkU#89vunR%Xu6f1hQ4`NM|- z5mC`bfuL8~b@zj^(-`@w?; zUanG_uc{p;UoaOC7iV{Nc5W=qy}j+|Z1Y9kJNDN87CU(GAZX3#m8(|`laKKX`3fbo2K?*&#KtnWhc&@aVaa?cB1b6-QDdo zjnhF#IVrS+Wc}Y1Q+2dhB5-^|SH!^e+~$NOYK%d?*T+@5)v zO-GFT1Sa#T)Z%tJ%zE z$7*sudGf@;({tsq+GWd^CqFvU3EJ7d^simNaD&4d(f#6A-!E`%2CZC^kd{vV_U0y2 zc;Ni+zn}ip*4FNRW2~>w51JQ!a&q!VP=Oj3C-?5%JEqPBda5_l&&+6C8N57f)s*Os z`K~)#x-7iCy#oUR6t=8yYGRr)Wy*m=hnSZ8&2_4(vg+z$(Y{$Hxw@x^XUdc*F2|%K zBsxIXV*UI3yW-Ce!>~0Gj1Be-O^f!Kmz3NwU$Ay>J-fE3=;FTG-;46^ z?_*%d&(HUnWx^T0K2G$-({N*D=95~`05o`czF1XS+kPf-Py_X{MxF})lpNuuV1<1 z;^4qwd@KLysi_w(Uv>@(5-N6GxOQ#tjvYIszDGX%_4Redj}MA{a<)+`*CxfA%|3g_ z>dfiW&6_rDI&m?_&dyH4JWnR=%#6m}1Spz zii(P^iQ6lcduz+VFE1|_{{HsXYkLYPb*^vO$C#a+y{GPPRKnfW;p?+(4j13wSNrkN zQSQc4S?e;E*=NNn)(Hp;D;sUBtf~UtPPt+8=H|I`WoMaYv&qWJHY)Dv>gqBuG(5OE zd_Bvroa^gid%dD0q@|r59U0~AY6K$kQ&Uwhq`SGXZQ8u~;>Kk6g@0$vnzd-dh6$1D zBE(9`1rImH#=`V zyi0SHD=dH+Pk4Z;pwJJNM_` zkxpTkz`%)?{apHSdlW$9k9T*Mw+J|acESbZyuY$Cm}&8U(Ak8ywr0C;+O&y7vE|L3 zotrOZ?Ao-+2vi@Pn`7zBp{Syx)3YVxVv}T}xU8%%6BCn1O^waw^S#pM9NkBiKoRh3 zrhwClJ3EU{URdbN*?(NQwYBxgrAw1!>}qCY&Noiy+kEEnM~~On)}EYYnmyxNBcx_rjA&FSZbOifMGIKDqUJ-xH7jjgbtKw)jv zRwX|_zbAixf1moR=Knw2mseH_Z``m!Au1{=S795zK z-nwa%(WA$Yoxgnj+S%C1`0>jZmDJQ!pWTxu3xE9fEp1x;zn|$znVFtBxw)PD_Ssoh ze_M0maqi7ctr?k_g5KWVpsIV)q)9Wj9qksMd~I#C@o5{me$X;_7jN(G8#ixG^qXrn z@%sAs@K>Mj?X3oRFd{k{q;Rr!_&S5!?Rj^Vva+(CJUrZfW>@OzX%qEgcX9NtcXD)O zEG#Zoc5`!EQu_K@%Bd-uOotEO-k$HDc6QcLo%Xi2N!xO7gHAvb3Jwl_^x}oam$~y? zyTt@^b8|24tF3KF-O+96v*lJ*DX{n*ByY`bM zfBWHszrVjs0TnRaG`m}R!@aAK;wKX&xoSmJYn1R%5Xf*8GSGV=A zsJOVYv9a*3UAwNHyWtSXE4+W60HpQIa$!*!s8QW=5#Fetaw8=*6*Mc>(b+k%L?iUn z>C>yf+?%G6VG@S!z|}O#gflSdaN1_jI>wdr;?%UYxzC+Dr=g|QG<~}Gu|8St zlHKO{_YRym!69!~)3AH@?gQ0!BCehMzD^-~Z|$ixJ~!7|{iT5fX!V#|uN14XvGJET zH-(S)%ZtxgzV^_=!|e-~Eo0;6=3W!Em20tkKU@3Zi4I3ZzSb`G>|i=D|C8H|J1IMN z?$prLO`TS0Blqa>R$hDJv}@ZuU}WUva&jI{rYqUfr`SCkB^SJczSkj$-O;I zLrZJY-{0TEEBl1i{Zx{V_lZV4fBMw*%$YMR*IL`!ge)yBCrz7nY)$muD$|$O)<&1g zE4v1ox~2Opuq%FXL2=Q71qXa|ojDXgKR>U|$H&(q;H0Fi>^WJ@cScfnjNWw6HJ=)q znuf+KH8Wc{6ptJ^vLtBY_Vn}fCLTHB;>4l2bm>x1`Sjz*4}-VW-`*$|6&0zNm`o9H z@~En^dU<#Eb_XF)X7KXz@@c*F_xE>DuVT{V$;zK(czJkO(xxi3OjsShUWkEdYMi?7 zESEcX?yzj*=Hyh=5$m2Q*0E^Cu0^hISDXjky!YwTCk`$yrUUz9%N`tH1l92j0wN+T zs;a6waeE{f_RAau?bZDBsc4Q(<)*OXuO6!JQaG>y>7D`|;yP15?wroBDU`u!z}Fz^Eg}ts}jT&(jhbR_``w&Pm8pD8;J7VOySo28 z1vNFc>Thovr%x9TKI9k~xie^^8H0wF)~eD@#`ySn8Jh}$*=D&;6%`i0zQ5PMux`zo zn70nhrKP2yIJkN9CX>CenvcM)y-iI_pi7@tt`j_9pKmrBv=;-mlwj$h`kgy>G6XEH zysy!<$};LoUy_BTCCKv;JBw67=a8}U%NgX(wJJR{QQ7^&ySvs~GB2}%$L!CX@c~`e z_a@lS&oALhtfM32xw+Qu%I=MNqPtXwC2V14|P7cV+^rOgzKjD!>w6{l_k4F>e| z_Ga5G)N~CrbzxTvm><2T!jMrRAgV#Ysi?TPbK*q7jhiKCtGRlUA0R=KmYv*qx^3Db0=C#{R!J?X)N1f$|-K8qGFb~Z6Joq3SU z(9jT6S8d6<+V$tdVSW(%$M4^h#dM<#{?`5ZG4aLAm!M9okc^Dap+kpGe0zI)=0ToA zEbQ#U!NI|ef@Pv*@9+6C2-w=%9(r1&y><8Q-P~*Uy98djzG(4d4bYX{B zc7iT2t*EY^{NY2v#OGmgaeli>UOM^BwF+IStFPZ*QBlFMcE56dfK4i!2v7T*^5@3 zzgXooWy-Gl|8}5lo}g->tE&sNa6RwtuGZ}9>lUV;pI7=0RE|G=`t-$>mBCwYr=_MU z+SthG>FJf)>A42ZU+md2DQM-&l@=v01d@`I4?ZnQ%*i=(=DSegC~DrYv5d(X~iQvhH4@Ad}KV4~?!xE8JfFpXHcc!Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYmd8v@{eR#if3?3P6JMJY$D&2cEQ(rpmaoXvo3oPl?5Q&! zpRAd`TBm&GEVXra?85q{Y`IgdsNwu=lIH7}{r2Y$uM}Rq7T2{uU}sK``eov8=WsN z^hkAylbpKPs`S-{`u}xOW;rLmy}kYO$K(FYOG`Kzw&&k}cC1(W$FE;OtHX4+ew{RV z^3AQ;;^pt|IEIH$Pdhv7;`aRbFJHfMzjfv~xX`)XqV|`Gm6cV=`+IvYeEX-VuHG(d zT~_e%k!w#+&x^~;`E{eW>0B(dt@$yb_V+hIF|oFtJ1t9JUt3!H``eCPyO;{Tya+Th zGJ0`;|NdK5=K1%YTw5ExCHJ-%J3BkWrp=pg?ytB1_U+rAZ@02#Y^$a`KHh(MxxakW z_Pn#r?EE_l9y0mPHamLqWM}T}ZH2F|>872Z*W234%CK|i&Np{FJr|-`jKHllOEzK_MZh^>KR*OiWm&?0>vA zdVA6Pd$w=hypb?U@mTm=sr=oYhrhnQ-ja2d%iG&~Th2`<4-by`nvblzcAc`nn|*y< z;g1iALPA0-A~&nW#l@Apy%oB(*S%k^@Yxy3J$v?W#X7#ZwUwKjoBPk7KUYpIUbN`O z&SG^zLBWW~$iU@(vTeN5ZPTWOO+3zD@b6EhoLx=F{Q2_JrcKK_{ps`PpFf|^Um3bu zY;DxmpsDxwR!`qs{ar{{cyZTa-`QsVcikIThp#Vsc1DsR@9wUn=jK{7Ub%O_ql2SQ z&ekg;LZY&=vZA{B@%#7veSLll-yS`7Y*X%SGbLr^(Bo2KVs0KD9CNKo7rFIHWqn;A zv-8lsz15yxUWabqo}GBOZRI!Zy$p&1r^44v@XEWhqmW5pclrCethp1F-MJjj%(IOS z-Ij2WiLqm@b@{5Rwsn7YY}mFi_SHx;tl%%*EyY@{Anb z-rg4%I5IPK{QLWx+u_UG+u>{La&p#W+}W}5!quyyy;7z^+qP|U^7i(w`TO-LSk z)!P}4?5X_Bb#(3G#mZ9Vd27PNL_}12dU{$WPMnx=Ys<=lvNExT6Q@sCzxv3nc;r~G zG^@hCU$0g>o#vCb(_z?{ch@TP=JWaWdL<<#E%WBh`|#a-Me=$gUj~3yIe=h9v$IKOiWbV zvSo`)GaIkV-Cd<1*^KM!<}w_aX`FuL)%p4M@fq3K-0JG;4<9~M1o^4Izu&{#yZYI0 zWn14h8Ydh771( z`iZk=L#LjfZSK#IbfiOYm45f{@9(?$WUWMI_UtNuugAl~b7W`n^A-W8l+@JDK3Qun zW@ctVNy(pglJ9OzZf9uOx^?R<@pL!0wvNuuz`rrGQc|+BwPRvpj%-Xm?vj?a%){Sb z-09EUo}AoV*Y$CGkKEl|?pjr~>s9TG+uPS)xO_RdHWL&{B`+_zzIgevvz=dl)wkdY zJ#*&FX<58@u|>gyh7;$`iR~_XE7b7e^XK61(r0I8G6}Tv%h$d8t<)m$e&6qP3`bT5 zFTZk%``hlMqg;wD0yAgMJaqGBq=mKh>U*DO%#Z+O|A&trDSi6(_4<8Uj~+d05jZ8hT2R@I z!@*~^nQ!jjdUa*RDV*#A#m~>_ZrRT*uGjJR_xIKJPQQ7RbCvVh*VorWzX}NnwelRmXa`MDEbJm1?KiJIPI_YAsv^k4H8?W@T zuR^ds}Tu(bRKuESUs;e|sA|RX2K@4@1(gFE3kP`OmS~ z7-013#>T}Lu3ZcJtH*6&Y1!%4DmJ0&YeFqzxvI$<6Tg8 ze!s)@b+I=$r}HoOpTEq1zTKUj#qB?SR9Ka~2zVj)ck?z`dHM6=@ihyz`1$$Sr<`w` zr)q2*{MDfT#016jcjG;`=H2}@v(}T1Uv5p6Uyy=^28SYxr>AGu@h>kfDld4EEM=B6 z;KE; z-Py5F?DN^#=Ank>+1Gq>Z#%d1>3-RB?8J$VeYL+grJtAEvv==I(`>P3c78X1|M#tZ z$sZmZtod|O-6ZQuhoo_uLD`!dNwxbJ+-G7&)0`GQI5X3D#;jSJ>i$-3O^u3*I{)|g#CiT|i@6Hk-?L@7 zbNBB2NPR;?!38Il9qH@qYcQJ0;NtFXzxCbbZM8o?r8YG;U!Asd*RDzP=l?(RH8?0J zKtp84%$X~t_%fmn8piIe+8SUl5*~hC>36y4SBBkddL#^+US3|lIsLp`8?W@Se*1qO zVPVr=b^n-e`2W*s{W%teivrHDs_Pxyn0i_)Cnx8}zu)gA?P@HFpPx&8du!{_Uq!XE z`t5#kZEelRqv9`Ky!ddp z{QkqYZ_ln?zmH2pI!{BSYk6HBx70R~nseUDy1Kpoc0XIr&Ng4XetrMy)!Lq(o~^Hz zE?L5mke>eiPVTbh%O}sB+dFNV*z0R+gQJ(NU*ErWt!`vwq=cm8RI7Kd{LJ32WBC33 zJ^O=R^LrI(w!y){4NCtDxb_`6bLI>~NbNKuW8-d7=Yu!j?tZ_|+rz_S;q^yHyXWuR z*V@V&6&1B)`Ev2<`A^qAm~pT2`CO&`l@H$RS;Ql2B@!DOYnFS9@}-QOD<5}CEb)+nf{wS9hm-ni<^3#YGKLiaBx{Ztng7A`3*-MD3o z&ZqBULPAQy7r7^$TrubGm&^V!`)X!}t&O_4E_QeNwXYvPGCsJov$%Dd=oHaAhYHKe z*rsf+ZV|{T?Y3H-b9a|1Lp#5`UdVn6P^!JN!_bL?Pu}j&nO#v)QBR&cS@Bj~Tf4iN zoqt-z{_~#}9S@N?zdPxVIy*c2pFe*r>i$^lE_?gv*4FGENn^LSV$qIg+WBO)HcQN% zJ2!G`mgwney2|?c{-vLoSA3g0dGg|I=g!;z|8pjJ^Oh|s$9g3He7l{`@aEp$-4Ppk z-+m39&Bcpu`cU*cXzk2fWU_{x2Lg|YxT+5t_qWrm0fG~j>*c(YD?DDt{F2V z^kQ~=ICEpkrHLn3%u!KO+mv!r$gNkZb?Vg6jpuZZ_eeJP_3_2m{aku0!0!6G*vIYi zbq9_eYind?XF7GeY~H+iEp2V9?jE))dn57h-@n#vcei8)Ta~{%Gt)RdVpmD#LjCtW zJw4BlndjazVX*u2!TH^tor|@^odkr17yr6>@#4fidu-Ol>|}C?iIJ)O^(FA@T}|zI z^X8SjzSjHs`T5NiA0GwDUcM|c$5dR#xv*Elkg3&a;V&f_!=#p5pA?Pe>O=jH}i%X8;t z-@1KUTzefGuhfIruTLLrW(Sqc%KDnL0U)989ie2q5 zoA2K~f3CA<{oC#E^QZO>)mgJw6b6lzxeR=PUrfVhNzI{7%^=jyjUAws0+1VGaU8~D* zaZ6_K)@Mst=UqFWadT5Ds99}cVbKw|*p0KkzCJN4ORJ~1_vppN?pI&QS(o{|c>Q|y zFO{7;cXGRspNTCe_f`S0$^s=&1`L0yF1yLU6V^vl^Ed2({H zYg*c}01c5tN0onm z7;f9PZO882k6*p&TD@BP>@3s8W!TJl^ZGhFIqT}`R&BOnh>wqt ztN&XnXJ2<_u64PGzyEUgez}}GJ0^1{I(6vq;pY7Pf2Zli z?wT-ZlGALn+$+}%jg6D9tO&eu>z0tTw6})`M^sc4sCUmJYZY?U<56VQmluwc)qGE! zI;CW0CRSTpYgP8<#D>JfA+OEz?#!?%eKldql$O3ezU1S5ph1o&PoE~{<@L>eArlemi#T5Q)mm$~v_oaPfxi+tu~-`X)>eV7Rq4 z`#8wpa5hUz%O_8sT-aAzZDVVDb(^5HwD;pSa#Gqz`l zjg4KiW=%m!Ny?`uCtds69zJ<;^Ykb8 z_e(oFJ7-;8<(ieHb@1RpP`jk$MSxk(jRn^ZxVXEw@2ma&>Bq<9prD`+pFSnMy|ooo z?!0)B5w$I60VhM|9|K4xCL>0t5nq0FYl}U zt+f6?NlA%>O@+a_b?aQ*-HU&J%kAmym9($3d3}AozR4p;Cnu(_udXf*Umurs8#FGH znVGq2S`jlFkAuH|f8F0-6DLo0c5-4eGc#KgvvbnP$?A*OulLW$&@eMI1C7T7#GUk= zV==Mp?JdKM3kuV8BAuR}oBQ+M@Ao^4pYs(zKNl(;yeav3U&*^WGkbb?pV$L#Sh=VFOS}yH;d18l8UF+Qm^?v`~H55_M2zp85K2a zne#*y&q-b@gVYyGo9AsvIVrU7&nIu+b|ueADtjBeth379+}N7g`P2UX`l>2r?=wlo zv+8HaE$zkS_iLxy)&6?${Q2^i0V|I`! zv(H_+G)Xgf*$OG$BS();oId^gok~x;|9^_NUR=r;SG$&5b~pcl-JaR6uH*(Rve>e9 zt00%FquKg^Teohx`pJdg+j4;^SGPs&+uF6fT#XkFSg%|8U3$xfYu7HFdH<_E`BZ1o zta*zyE?!KGu_j8X9V>=IDOzsduM} zh56oxwKrs$3s+8<#VR}dM#ztS?~ga_oXA`DY@O)7_xqg|ynn5GQO|}oV5isFrVf{k z=aC=xzdoTNz?5ZPzUso?d%V30OTKLGTf9e0%O+~q7o*CU6-&HgPV-5bbSS&`Wmxfe zt_u28RBS5S6w({gnX+X4`u>?SXD&NDVTqQqvU2lzyLmog)8-ruStSvwBD~+`J}wewJ!ryUM`(5dGcX)`I-Y?US2LND^oM_ye#N>)pP4!-|xTQ z@BjSqj{Ze+gDWK(la>@(T3Y(dwVIlFdD+89j~2ZwSdz8kmYTAyt!+uk>bI>6RaSzE zvC>x|c0V34$HZ#yySYcj(bUgvl8Wa1xqkEQ=6X(6d-&|xGLS|eHD%9L%Rr-&9}e?N zn&-(thPGEdOEH?XBx}WkE)4~RhBjX5EGrq$Rr^kAXli!$eA&V!%Mvsxj?IZ9?d+_h zD*_jP`1I*giNz$AkjKmJ{`>cDj#aIca&j;z3yQjN9PE)auK0Y`JoCzmiOUX8RGFGp zo%-c={(i&SZ%H?|M6WVy5jZo)axx<`+l4ie#=h;!o>{AMjV3L5<-&0=eSWRm{e88W z7ZDdl)8p)l9OrrA0toSao)pcj&c6uH7HLeqEY;yl)oY z(jZU=_W8NF+F^I^?k+F>^(Awe&rGMuYQ7c)4;&^6*Z%u@J^sy|ox<|+^3(L=&%L;~ zxU;)k`}GCwty!~s?0!BGF3bHpZ_gbWP-vy*U0mc^QC)p`Ww5$$dr<1rCr=D2Kc$H2 zL^P~hr{_D{Y-!=+V>x$rYz(-o8@=tq#$@+7bLN10Shc^tBtAPcQ>x?F)6m?>7thVL zu1vp`{^F%{hLwn?R&ad%U(;SG(?#z6a_KyDk z@TpIqJrk0UIPu}(;n39leLvOg|9%mE`SPWx*?v? z@tbcKd+uVm95`AwW?j|Fy1vf${k^@WvR+d^J#3d>6rl0r&F1qTzJFIYGZPEg*0p)# z#=zCt+1cLxa<)Gnw#$d4MsLemn16pCsGEMOr?=P8$mr3-!|kGl98;To+$M#v*8Knb z{mP2KX1m&78CFxYTsaON>y?%?%@SF+ZrzVxzcyuG*JA)xOP4QeZ#j2jqVmqFuUgaf zC;PjP;hv&qJ6B^%>SLm#Id!uAhNNCQT9fHcr%51z+OI`-7nlojJ z$fe7dH*Vd^Iwjoh;lqavS5}2~U%7I{>2=BLYrNIf)n<8jI+ib24+{(X@$=`(tAQFK zOO`DQS{=6blYNKRqFZs2v3n{ewksag5a9yF{L*cim({*}{VHjc(y`2W<)kxb&tANG zHPqAu)P{5Gm0~c-y*1^*g9lEpU%Y&2m~+EmTkh>+-|yF-pP=Y`;qUb|mliHus3Fqj zbbijN&0ceR%HG~;UB6y`{r-Pe;p<{FFYd~|w&vlJ_3bC>z1U4Xt8V7r+cR^|9-FJq z#Vg;ueDUJK*6i>;d3(RSJUvH8$CCH=WE&Kn+X`M^TdVY&yI00?(vc%B=jK|6KhfPK ztnPPVkt?^9Nk+iC;{lN&w^FvGot0wam1=2jW`6ndrAhw1Inw5NBGrGtzP@f;bm;es zm#?QMPni^ASN86Xr=K4mBO~K1zNM#DhOd`<_wL=Q`QdA$j!x5!esOE7HfVe`i*JQh z=_`Yp9|d7+A_6m{{Cqb1%e%X~FI@GHi<8q1Ta)nZ&CRFP3R8WS)~0=VxqSYm z?fLO#@9*(y*h>hj`6y^;cpRSS8T9kk)@<>UCr|cBoBLf}7~*+)x_!t$=FnE zII+uny57>%)6>4Zy2>3NAHOx#y6lZc(Ok>oXAfS#)}DR;zxUETM!QO1i=8}q5;Q*< zdTpuq^d$a=ik?%i&a|%|=FEfz+-_1C#X`R&@@6nc ziSE8X$7V;#ORbfif+a7nO@41C{#Ry^%@TV?mKjpE+p}g~yxRC=iOakfHy*wS+5D(X zCo^WLkK5X)txnokcH`|mUC{JCIx<9BOS%bCafC$D_{ z=F~G^`;Zs=xZhP|hd+296)yd$XnsQYa>YL8l=~}REeTRnuC1;8_3iEH>+$tx4>U6G zEPTu+t{0PVxQ+LG%=_>6>($ktzt>d0mdo|z!o9gQo70$mrLJig%7h> z{fi!6Q~pr6?#5rHBTJpKrhVF>ed}+8fjN^kZ;aqSQ6}9OZ8O1p`|Ib2X75*iu-COB zYr*2Wlu4hCEH3Nqy8Hg+`3y7IT7bJ3IGi4R_2}SSc|+D)DpYf_phH4}LjInQZ2R`@ zd-3X(QR%A?w_d5QXG){CWGwvl`QhZ}7gn9PZ0D)9?8lFaegA%CKhukF`;zSIuI%}A z{UtT!+}zx{zhA?B+Z8=i^|ZCSXBww}s{jAJKI3KBE&D)EEy2o21yB8nfBw`g^Phk2 z&CSglH*C02VlgQs5mZr5Kk??~W=ZqBIWlJ>SCy^GHM+I8+Fbk}kCOfV7T*^tE9dCM z@0-&nYrU%U*|a6E7Tr=?Y+e3N;I9Ug;*$>ENzdNi*(n?y9S!Pbg32waz}(3f&&)J_ zX_~;XYgcP})|4e(CBMF8Dk&*-&B=0@w5mI6c8|)-)PmpNa{1(JPFz_TY%1HOk~t;E zT+35RNM8Q@tE;Ocx8=+Pwc>jxpY)hyqF`)1d1vwSPe;Y$MP^NknzTx}a<<K<8?|*& z@$++Y>}r3_eEsz4Q^Sf6381mG&6|xcFY`To|NeaY|9^!2{r&ys*+lAn47;tpxcpva zyZgzTclMWuUtZ{O^+=zr^@h!x7Z*Q2m-SRw%_pE&ZT;G{XV*k-UJ<>0oto2>Q!}Se z7e75+pZ&p=mBF9}QS9!rkLRr4Px-lTTi)GMJBy!pbaWgzcdjq*?ykc3_iXRg|F6}H z+wR&n9`uIK4r{OXFPoNZM|O8g@Ex*v?j#>P3hxi`1x%X4yaN_7OR%6Rwg zUBf0r@5U)pMBMu2dS}m;e)sO3&kTcwS8m_mnk}Atd)v`-=lnvi?XR!bi{16*%KPkA zr-P@aYJ=JuQA$itJ1_02{OsZ7m2`TV?$W;3nO-%iU!Kpe2PKn&A0HC8?re0J`Sp08 z>}l)wdz7O&JTLvfv#)lxb35P0f`?99A1*H`nX>sSxGQ=5(4i*V>TelZJ}aBn#_krg zwY9DK{%)<-Y{O)>`oCYrZ*R+ed~&k-k>kgwSN&F0RQ&Pl*Q%*IckNm=ZRgINqEYHf zN=+>-EHyPXU3Zpk-)>%2RTZlV87nt$GR?Ecv$Y%-OS*pPqC^MTUh<%Zdz?k(D(x zHdeN=*>mD)zr4Mgs%mR^T;@x4CO7`~i{q6rwiQJr)n3d%f6ePse>hv~eyZ3axjO=Xj-}$dozdzx$sbEl4 zEcn0g)BnK0Q!HOzO#GCZ!czLm;qI;nPnOh}=JE9P1@PU^*O%4T*B8@|^J(XkeQ|HE z_3H5TVcB~wtc^Bb7q|BmXrjj`l}p+@@5z&slO-f28BeA6|F5(8GG zdV4SSo~}2G?`^A!s^(*TwEGdU8VW*Z24Q2d=ITzba+(XZF5* z`?Mst=G~n&zwQ^OV#}*-w^jx(H!wG^PrKg4$}Lv#-~eOTx|oyI@Aod(^7r;mJ~zkm z%q&yx^z`TAmVcD?1{ig9b|zk4=3DdqZaE7(dvapp!4D4)fBf`GYxR#)XJ1@g%-LCY z=I!k3rm|fjtug!S<~}^!o}8C=?(OaEh6V-)4jpPLe0=QT`}ga^t{*w#;v8rf?Z$Rz z7wi7{trrA5I@&G-Jk>T9j)|Fa^4MA5nK^8HEaBm)m4f}2TCEG6+k+On@j6t7{(igt z{T?GVI&M8TMKic-?_bT}WgD`t zYF)h=?&HIw9lkE*)D+EDxve4|US3MJwsU!<%?yg3c$_(NM#8qrgp-r=%gf8`^78U+ ze6n5{85(+eda1wOtT=K~!`^=W|9{{2=iJ!P=-kdXarW%)dGq8hFZWM>cW0-BwDk1I zf=MAa-`v>P+|t6r#wX*El%#aO{=eFtxuV67_bs1aOf=ef zrJQ~HuM1mO8{OQoOKW|>memR2mD$IH8z%=QB`L+%eifBA&r>lnnj~eK zWl;GkEjZ#wd~au%}J9cZP>bXssDVtmiG3|xwp-F)fdf?*-;%n zvqCSnsat&N|E$c$>EabtTL0hPjhMFCdbB9lm+S*&DCQ@}%3twJZ>XcenSEnIT z@Bd+E`gysa;NZ^Q-lbt{qgJK6F1@-r-Cs#r8Ps#{>+3t8`_QKTU(K`g^W#_SssI0v zLorTc+H=h^Bdhvrj&_vvZ6r;Y7At6sXg zyKgRf>IE7CDU;iiYvSLW}Q9n1+>}x4kSB3t$|NpPNb=jMQzrVhMmcQla=RbP<_^O_%c5~$B zw2zR`~)OQ+AAN%{BZr%uF%hLyp~L7k2VFJDIL{SMN2@T=6Kl*?~^*uJ9T zg{9dUx5e&Nc~>3{Zd1QHDJ0SBkH)1VM_K|GyA?h=Bbj%9pYQg(yC=?`O}(-r@W=1p zpKs^ypZa_6(fZ$CF8gzGaA;h#S{t?X(AIs`3(LMt3XwV9FQ0y-L-5D1UqbTo{{3>c zGfXmrW~wdvQ)5xjcWrIUySoQ(NmYGovH#!VH}}B}!;b#;zrP#@ZrOUYvT9Mn=wP;&!0c1ayvdQdUJR8^!59Gb?q+qHv3i9FK3%^XN~Hu z|I+e4le`{%dwV-(PsKzz+o}aim%7Hq&5Mekc&V$qS-!5p{60%`w1l-((xSu{0XwQh zm6Q@*hs`ixlrjr3bDFSZ)dC+q?w+2Wir;UyTb8~O*`9YdNIH9^jjNm6r+d}!MQ{Fc zo^df`Y)e~NJw;ac5*&HKR^BKEYp_O)~OZJ;`)cq&E1gBucGd}KJHX>Ze87n z^ZPcej7*i-(Ux)~ZGzlvzbqH6mxeEwxcz&7-+kp0_vMqtrn*)6Soyk{E&N`-cm96I zm0ntbMpAY)7QVC1Qcq3M+>(D^PF!64s=<%W&dxdZ_47dMJion(EPHn+GOv^4!RPb# z$IqSX6I6ElaR2|m?RUN@d;TwZbw%^g;lrSLt=!w&T>bs~tG>Pp++X+i`MTdP1lL5f z+yCRZdD9?)A?L;d8HFuI_jJ#lKdJsSkxP?5*rWene9_PJO`RU9wq~-qvAJht&KeXO z9Nsg{a+#^`#&zkwbGMZm6dN7hvP@HKtL_EkivvUu*So$xUfsw@NLw4U6z;><|D4YQEs;3ZD;;Xz-r6cCCDk>5zWnWNxz(?# z`1tsa967RLs^sihpO43jZ!BKn{^{~@d7Yp%Gl>_CeysH?HCR$on>*S59V`Akb?qLW zuk+)#udzKD80YvR^g-y6_3h=w|ITn;x@5ew`ZLot(>D=6uBN?tBRhX*T$0V7Ji)h^fkGn8Y($?o0^r`+K^0(q<2SZ>7hHMv{Ujm$a)-{%A1s%LbKANtX>a znI7JE%o>JygZJX{mLAj*Oe93S{~MV-HI%h zH{g5vedd=>yEwP7H8DO-o)*ME<<}|g^;1sI5j%QuZM6BW($~v=Ri2)vyC!z`x0#(B z2aX?iH(gTY=Ei1N`0>dzt>qIo7-{~TUY#LxBf24x^?vM$lg%GkR)lT~z98=Hwakdq zIx6(fzQvOc-eAztF1WJNdV0OO&JV7$v(29u&Ji`0&3^Rw;}@5b=VmpZP2b#Q&M#>V z&0g>}dujgHX)}30uGIgw`<&-lwU1>so!cLIaQZ&_*qriI+hpb*^_>wrA`)LF^|p44 zp0oQF!BcSj&e1NLXzeXuOE<1P@a$2Q)r6m4c0OLBwI=E;Z{3Rvid*NW>qVT~HPxHJ z;8OdfKBlE>S(mXT1RY$gWP38SZfE448yiBGPMXWTvvStW@)|9Pm!WU=m2MRU4a6BH zAKQ?6T5Qs!NnLmT?=1c>|G&m>hF)p*^7k6cgDV1~943AH+#jjIqRAiBu~*Lf&)SMf z&XYseZ*k9zxW4_^xzl}8yjc%!ES3vf7Z$NQGCAz@o0YtixQ;EmeB^!9s=8G!Mpb{m zUjO*v!-W!wAkoDE8b2QQ+Zz}gCx3o+HfBcwqq({HR;%ad58v5&>RRFD<<1ETGiFW8 zkNJ7?=aKte>ffq#E>2(6xlh9P%hQY!-qMZvDgC+5(Ql-0KE8K6c4o<|=*5fUIio#1 zu6j-NaO30S%POw(2#TCxoX)4Fre$P^ZR6j^|^hu%GEM8G8vx>rDbYl42o+ux;al;;t86` z35tx~Q(?Gp;lef1+xyyhr9XvpY$<5n5;DV#ci(S5HNOzEt9q*)JzAY66j(QYSWuvJ z&PAY9v1`e1&l$UJK6v%oaHxOwVS(Pd9- z^PMJXooM5g-cj?@2)rD*LtZiAb^nKt$4?nPSQj7exA?D;NF~=IJr}_`t2rBj6I=cZ z_RX6pxApdwWo55#nMhyf5&k~QCH>{Y$k#{vy(h(`srtEba&m%NZ=faaudnHb+RI8y zOILk=clO4{Moc-hUCybh1uSQMJSY{o3skj6j> zm6w%XQ+mqY+&BnY8FqP@Z{_Q?+Y3rdk6yYosi%iWNJz+{{GH6+>hGWhg*vgjL?(aQ z(HZBa<~z&9tWCypgZt%$9{Qb=)%`y`?za~b5IB&%ey>}coK7TDd<|oMZ(}O=fdwt) z$BQl%ar{(md7yl-<&Th4U76jw^}8QkJl`yL|J#8*+ho#yr+z*zUoRjk%G$7Po0*@V z-=1HuRzEd6v|pfU!2$)pITnsFF*4`Qo$HY>WQvZyowQb7R`zV4tThK8pIdnNbTQp1 zgM5r4t7wblE+fem2tM32b@5{gGOPS}%NJ>iT#O#;=nh>u2{Vmi({l=va zA3rW!_xgPi7bj=K>+9<`=iD@E7q9LdL?Lr@RiGIl#j&eRg}--%qFY zEz90WynFX<$gwuk`S;H)a_zRL z|7Wvq-MaHJ<(HTF`pmJIc&u0Y@~+bCOP4Q$MxBh)&!xP-x7Q@|(vmZeb@h+>x%En$ zKYMa=@{8B@zpq?4a-@ZoTTDPk#wRT7n)mD;m6Z+|85+jv=a%@-xBKz?_vUQz9{Ke- zs^+!3if+u??=)|3?~&b|ckWb9wyu6Zp+bLRRqX4Bwr6HD-eyY(SzJ|m#q+G6s*&lW z7hf_KU0T%P*R5t{J8Q`rl}Vc?d7kom6nINH=~A+QQ$lV^@6?H+`DQhfcgjA?vZ`U& zvuDqb&*$wKEvmj~#O^KwEg`A-b~8P7-}l#%vDNl`=<;U4FFU@Z_~-A_cX;-AW~FGo`+Mi*k4pC#>)nfz1HS(Hn({RDqsCXki!U#_EOQf@ zEa!aWF-Ov+y;@FJ5G9{RGO-PfiGa`uw@DygdEf9LuG*_D!AotJq0cSU4s& zmXn{q{#n)MXJ;4Z-Q9I&hN1J?I|mLltl#&GOJ86A+M3A2XJ#6Ei-x;uhi31(y**$2 z*HICRk{1GMYHCK3p89*QTnRbWEA75IY;DEovn#jcuYa?l>ZQ;P+te9uiYyP8AF|y4 z%jRHvbK(2P=U&I}>B~+J-||)Kx$gZKSG|jwr&xq%3wozysRU*Q-tq5HQd90)qJC=i z>?!J+H)h`ozPv?k>zV9_8P7Tv&s3J%CTB6j>Osmo7vIaXZp^;1cx|ZV{q999tgI6! zPF(mZnQcSiW4C2KGY{4O`z-(E%a@8D9};K2)z{PO(+*$v;p1_6`>lPDMZP>zCM!Ij9x*N zCr+MBJTt>^$BrErmYq%C^GmBof{|NH#CEQ8o|jm?-tI$Bd8eN^eQxp3AJ0nSZ^|a$ z=91A^KSjjJF~?1(KS=(g!BfSBCl|J;wF^y>aqxi}`#!&~FYb$oiyvPVx_U?TcRl+*ADEMm^&~zx(75WUqod=VPp7nf z=2~q%@o)-g^4H1PdH$}y*W;>tPfk`B*E)apZ0dytjyrbkGAey_W%;`KvuAt9#mSZV zTW2%9dHeR{sZ}<)YVt(78eyM85jgyRr!{BZF9Q6-@HGv zvVXbcBK$5{v^pKUu`zk$mMupv7HT%LX)Z7Qas0+^Eza%27Q6rGgm1sMpf22e*SZ&7 ztLMM=zRsbjsqHy6=AHW8aMd{%o&+qqyx8!9;eu_hxv!$G9KCvKYSp!`6^rjl?}*&_ zFzszyXWYYS>sga8UtK5DFLNp+C`icu{~zP&da;W#FE3jYzdtUwa(&$18#@Y>=USJi zU0V}b@+Z9d|Iu#o=@s*D-n_Zz>$T`5OO_P8xv??b?{IQLLc`v@wi`G4%g?pZ)9YL2 zJA0Z1pRZ=2(XE}u>Y%yk&dyHPv~Q=9-rm}(6R~ZUtbN`3mjO$-zWw|Ce)8P8?VTsx zuC2NF=u760a^{OGJ_pYEbKXQukY`-2ZhzopFdZ5`fu`*=q4%F|L9t=zpr5@TVbr*&FCs%iVUy&Hn z{LA#!>Pdd;)BP%LRzA#n+O=+*%-z*%zP`IV`{Chsa51yW2Ya$#2F4!6wm3=s+ zee2C#Znposy=TkKJ@@f^Uvc_-*{IqJUH_tgg`fD5pJ|yH)3xu&Pxt3Lg^F9FKW^VK zw?Nvs)>!JM`J#PO)pcd94L2W5v3YB=(dfznm!PY6x7q49dRT2_XQmbM)r#>;eJ5kyF#-2*!c7FL|i&&Utt*opz<=?ks&IG&xE>70?F;oc{+GUTs@_tYLx>tecIY=DM{>%Pi;`}Tnf)~RoAZ~uJRzkbpT z36FlcTRQRU-q=t1uF}8R`+QN_Nl7W*+#^qRPd419Ip2+QqvS@GR`x=}SBqYKi@NdH z;7;zH%y&0r?%&$S@`L3;>hq;ppXSVB73@5*@ukU$Q>VI0Uthbp*q#61=lTB)>i^Z) z{d%FS7q_Ql`*!o~d3O)pzP*)KHlMHZR~Qtxj{$6CVEW;HR&8@o8?**J>hV3ySmzW ze#lSI-p*ETeqr(Ly_uJ{%(RP*{P*AnGoPPL$JEuLjOk1pK5o$5T$}bhz1Z}bmiQvQ z0>fWQ=}PAWrU|*7j?%5X`ZDy_uJ5U7yJuG1s1mtZ;c#hA>gj0{XU|?8c5QEU`MTKM z%Xa;`xiOhtTrWn!#zuynojtDl?be|9R?t2GL1i})t@>-BljhH#f6K#y^?c8ryLWdM zJZy@Jt*-tZbTss$*VLYzoSY5Yx39m_siCj`ekQ-f(p3*HE%n~>|6f>AviYW*nP$rF zPH8o2?#tz#9{k9@XX6`Q8}`b5AL@*XjXAmaAAR3&-%_-!i#t$!MRH(!8sFKBcQ@u- z^mV^{Xrt@aOsUwJf2)~}GWANC2K~K%;6Q^}?yU>Ud}oW_i+_7->&nm)BHybiA%_iB}Yf>DzfmUvdA3=ok5OdM&)2 zZ?|nJ&pY3~)_zIu+-+A3R<-3WQe8R4YibWDU7wz&`|lZ%VTm8N6<>ZO$*5xhS z_A}_}gjut^Zg2bC+4*zY0f$&ADch9N$F?RfZZ>pYSDUtC>YcMcX6NkRI9E5keBzX^ z9en3xU%a_B^L*UzH%lcFqaFtZE9&tjB|W&PoSNk67q(AGcxtMl;i>Qnqu6D~pO1&BXrB7R)$)^w8rI z``5=MB`FvM&1{%7d8)I?jayB7ZLh3aDsyGM8}HNoa&o6!f+ysxSv&Ql$D~l10{FQA zT>-rRHZ6JOv@qbpo}WreN@5%GqxA&4w>LI?oPI1h?)A;dH&j#9HvBzSR=4Mya=FmE z3+ETh|G)n9|BE-5Bx7@9|8X(iJ#{&CamLS|r&@%hxD*vnEfJDj>0|Km%QXi{**_L7yDS4W@`!i^hzb@sk2Wx<+gHiU{R5gv{}xBUteFFWL|1n8N7Vb z^y$Yt1eJe$yPXf(6LZ=^_2tf6TO!Z={Vl(-ywu429`}*8-O_jWzx;RQ;ucY-gZ1zK zPcId}UijvqVO)9b-2U5jKHIDA8eCZ$vpGen#b{$o%YkP0Q%i)USL<~5{rfF8YpUpu zU0U&5vl_RX@A=sF>D96a+h)#{m5>yS?mfP2vR2&6Nr5RTD(m}5C4w&_rT!pzE^GEZ{Ksh z=36)E%&+d(k=2E|ZM)ihGVB`P|El?3w7u^1>EQjVcGkzwELpT@%K8@>PjwB<%~KZ@ z7BQu#fA|{uZ-1KaQ)9{CU|;!8715O;Co@3f;<>k{9XQ|+wkG1>+1ciyr)6YiPnYEN zr=L7^>e2T5b&o$jJ`P%Sou2+YY5nbm&g?h0?C$#TJ^tv*;K>oTKWrvS>wo&Dpa1yA zos9u|-81_m>dGvo^>PoKKimJls@|RbIiINfhs#TrYftt)`1)UMPqXt1c^Rg_hY5)b zeN6K5PKEc&ow}Xs=T~n(dEyeUSFP)M{@I>b;k59h`_%QXuTRw{Cr=I6 zXWf4B&Ycsv*Jo;Eo8PI4efn8)rI&W7QP%x^w%ua7i_*`}Tea!Rl@PnXUxJmCls9%uczTfC??GyV~ z-*fE1pZ9k82R#q|dH$r{qT;8)gKC)VR2iEAMUfNm8op&c-U*5eCyW@qW ztor&HHv(>MKXzGI%B10c`ulT_lg|COXxP6?|L*sPuNF8j)L1$}CG#Li$3MbVcRT+3hDEt`4%eg99>p3I=&vrFvGA76a@UCqAZzyHoX zw&!=<{`v2pe?GcqZcotyC4Ppr&LP_B0fw`zO10kI+skciY<#X3v~AbJ)AQk#mBAM- zWc+LYpOTXD;mgb5l#~>Q@Nn_&Hw!UldrQOw&BRp&a?IQ8is-$9Sn;W+0A{sWC??;)dud~R#t;bqu=|} z(&o2uFW2B|XgKN-69bwpXhB4usjdJ1 z{&tR!pKtg3ikpnJSnJ*Fl8>8@Req63?sL4&?&#ygqjTs`{KWc)*RA&-x_Ux%{j>c} z)l1VVCK%buR{Rp-;7|YW;ARaSOx z+R1jIxzEqfKYa8ks}9qK87xzuZi={_XE`U_YSH;ib_@+G)@YpBYbHMRj91LuBGIy6 zWxm351Qg7~Zi&k~ym_mvpwePHr?;2)!ftbea=iULo=J_ICcz(9j>h z-#?qZ$y!sBlaZ0p=B;hjmxh)W78_ez!>lVBe}27Q|KscRc*DFq7Cti!82ROF9_&7E zS^R9lf&~l=0byZnJASAbtXjpuz@v5`#Z<@LsbN)?gVTxa^R!koGA(dovAvvqPd)LN zo^HBBXsBpAzr0&wqT({&nQYU0|6WXv%YQO`YGUyTwm*OW=&vb^X|LS7S3yxtv7+wk zRe}1CGLIDb75_c3J90>l@zSM$H!oR^CAcSiEZU&6_C~tX{Oo1l7q5~^5WM(j-Rj6U z=XV$+cNayKdu?ISa(nmgT|s%ddt98{m8-L#N9|d=RyQX%_ov?e`u}#*bfeiA49v`q z-P>DjSn$9hBs|d6#o~$Ew`2Fu|2sTwL#093+qTWhaZb_u zZ11I+)coJ{abrMD1$S3})50G=>?B^z(s=c@WzxUJ0h?;XwXA0^SS2-K-Oq?r)2A1& z_STwd?7DBtQ1fK&nVmORTv$CTcbdb|6|uX^UR++zFC#0vG2^1rJVy6+UTL=4+P`X^ z6XdzMx#!qcPcvS5_3iELiMhFFw+k@7S=r$2?QOY!{hb}n%M%qD8u(tlncr41lS?9- znagRPc}K;OA!X=a&80w?IhH|L`nh-&GU6ydolub}>vol6IgfDc<9&$l-Sd`66Lr zN@;aGAt|pd--LK_3P^Co?B$Bte@^aG+7pilUosDz>$7FIbY(no=8Q|E8K| zyLQ=Jeqz%8=TA*aYN}&s=+yUn-#>bkbZ1YcaA;_#giS@kTH!Yzg{7stPn_^DnCVmU z_Lk_jZQGd6``y;zU`+gw{T5!`!(P@H0bJhOrXc3q+&D|qw z-G|5fJbhFf`;9y9KNVoyw$F#-Vphl>L1j0A4f&^q7+jp3nkp(PCahYu%I)oTz2fKR zR9CH9<>KSh^XK31_gmKq3ky4c`TEuK{=V9i3mls}y1KY_R)2pN{(bJmiH>aiaz0Cz zF752?<$Za3yMACuh>Dn)n2M3nrq2E)`xbF3dbPxs-!S!9ut`Eru5ZJJX@zcz+S=Ta zH}i7>ykD)3&^fTvS)py3d(x?^8*g;mZ%}@dK1Z&U*Za55Q^~*0-bqRi-ttOFGaIKf z&9&Y<|NqW%{)lZocl`oOH*DU_tjHp7UkBQn`{4C!Zh86nY2D>NJ|sSQ{`~V_z2uD% z1?A<(8yJ}dgoK)+x9253Jk&bFrqamE>&N{!dfM8D7dSRgm^ria$PpKt>Tf)trDz`> zGW+=WJb3h|>Bx~I&#cz439gX%`}h0(v%k6*t~eOGenI^??JxFM#W&xtRxnc+V|;w* zqWARki&=Qs3LY{&cys1m*57}&4_=>^3n;m3<=}CCf8g5gO`D9u*2nR(va-6kyBF(r z_x2vWx3_v@_4ho`y0*yA6+b>G#_g$STGo;rIIkJ(6z% z*Zlv*T~NgI%Bp$MimHn5?_|Bay+IRwez(^~Z@;kEoxi2E_2JQO@f-W=>o-3Wkd)-q z)C3(MQGCn9#3UglrKO{TW8ZC1p53);*H%0JRV!C=s;jHt*-^MSvM5iZ(aPY&>C=br z-IMF<>xpYviGIb>k|`|BQ{s^*L-^~RH}95|JoUK z{8`uImC}pVYF3|DJYmaG%k!&Xt@2Mbu^T((c2tW;>=5YaPxr6%4fK6+cDA{MRf$Gd zS64!Qe*c393G3ua!@|NW>i$@St%+y^t>U^BU&EH0n`>$NDeLlu=fI+BLCCMJ5&-+&)6UPgmv3h0fA)KG^6@^lr-@lvU7tP`t?TsG*3z0VWlBi8 z;Vi>swl8157Ctz@I4?DPU5sN|np)kzpU>HzUW#F{GCpgKZaD|F`T8m=Kikz3=vZ`5SvAB}}@{axql={beeq7t@h^ zywCJ!VZZXDLvkuI)ev>K5u&|HQJoA?DEga76d`EjEjX}%7Ky}pnd$RuX z?OG>I5<1o+c{#`O#Oc$IFD!JPVO6T7rKP2yuiu}0dmHGGjF{MM_S2_LYkPWnIy1wU zFJBCjj&SU${LJR&=Jw+Le)}g+pBBEnq#CoUgp*rL$Kn6Kzq57!{}Nasadwtz_j9Y{ zvNE%0=jZpUdQZDzc_0&Au@(bC!UXm zbz}7@-#H$;(}JDM>;KhEnLfREt8T;whOVxz3Dc&rG34CaBWa$0&m}4fyenq1y1!XQ zhFl$=j77t}z17!u<-EDE@xt}%?epi$uUfSVw8Df((x~PAJ`oWSgNzFb3=jTUQER}URyxMkVb*WzBrWq}Fb~t+c{?@W%xA3It;jha+&V2J@kwZJPkX#@? zy9=kYFfaQN|Lu8q7p!03f8fA@Wp{EnTh#n8Sa$wn)08P&Rs?4TpYr0U+j67-wOqBq z(OeTg-doHcQ%^JU^MA8l6ug|lbnE(e?Tc1ib6s${qr2OA zciG!nDweBCSFTYgF#jj}ec9V1{Oc}nJe^_o-~q#m)yxwoI(Y90aR{8^!4cAPZjR;Q z?aYTiJUnceb!CN{s_Rxe9WjHAujB5_-NVZr`#ib0F8shfxrp6j5xb_`lU}sK%x^)G zN&UYXpIJw&UAkAT(t6G&=~|n&=;{0&_F2YaRuxH~dz~I!(tq=_HA~XCd(nz*?hBHZ zELy}QICz>u>N8KDJmHu#VMET14UCJ`e40~qU8iR4v3>pi zvBy^Ru#^|c&IgJg{HaWM7ZbSLH86x*HNf!It*zRA^X+>7{Ha;@&Anev(Z)vRSV`1# zv$Nj=RJNu1AG@W(`$yzoqwSva|K~F-*XUZ+>mVzk<};(ASK9p0l`A5`>V7TTwwcB4 zuj8$+ufK8YR#Dr$1-It?|5w|-RWP~W!%UN7p`lC*7nYpL?^?9aYe5odhivrryo0At zbG!G+Fg71-m^4X9OfQBbKR>_Yay3(K(3{Ww5fx=DeD2d8RGTV4@Dq5u!XYqZFGolZ z!-DYjaU9&-%*_WK;^O2=N=jxK>A#YmJTt7d^PclZ_Y$tQ7maq zYPlXie%u_sKJMcdZ%@yUB8xtKD$2RPPqwnMviJOknSZ`skKZ9*BYWmmR^akaXMfK) zex!V!^M~py-aE=(v3{KW9~3_!%~y6ySXx^rKRGe+#->zmE^hAZ*mi-Y0|y+wyu8eA zWMsrU@A=eV~j z0+zD`NBS95T>AdQ_M70GU0+&L5(E_V^PA4jp>%^eL;auWv+T zweaB~)+0xbBpm4wOxPIF(bwnZ=*S2%_Sct86%`c| z&-`6wZ*L|3`SGzvy%w~E&aGF9)!W-U=jJ9>A2nfqIh%}dX|-VBWMfsnl)=Y)1sFA*j@2a=~MUWz%bSyvQ~X> zBM-jFF%~&BU5{BvXpvw4q7_yl;o-`Pii|#L!gH-ko0^)MRs=u#boTo}wU!6Rq{2CWIXVl{u_mMtb%u3lZZY+2jEX7T6b^m!!GXFoF9{(fnv#MBk>(9^67q3~vGhHwC*Q?LIPoF-GNxo>fYSk;z_9S6p z;ltnF-d?b3Raao1^Mb$69UX!mEN9kO<*KEr*|=|?T}^H6$B&QQ|NMMDKVnA#=xjcN zx<5bCIwM0uS|p9r5^iiroMYzf?7XftCMM>>-szDPCu7$ zVS(d>DN~MoetsUb)7iqxN=Zj&jq9013Kz^zURdb-@%jAvq;GF-&dIy`{{H^s7Z@RbA#lUBR|(@oVPHiP>AE(30@(&dw9(&K=wT|6la$18d`r zOiWzT($vDEtzF9=YHP51X}uPmwRje1iYQZ%(?7d)X^cK%6Q=$DS~^>3^2tN5udiRY zVnv5nVPVQtPcGB;Osmy$MbX9j# z6H`u34g+w1@Re12QkjbF~j z;ru+?%3JFG^LV7CrGNbRvA}z}-itdsjfI4TFRl(>@239ClC8P%>+9=>FI^IPeSQ7& zuKRnd%lF+@RaGsFU3PoJV}?HYo9qk$p$Y#@T zonLCo)_W!%KX+Cv&!%pMkJ_Whk3os%#fujSpp=x#&M()pZ=c5rnriv>{5;#{o*o{R|Ml_<*R0_Y>fN)`Ht&u_ z$%_k(t9^ZZc(}!MGCu6vXR~+eq&&szEKwUiTu2eAvR;@zPw9;CeWlr3m`}OR6?HXT zukJsuVBhgIYu5@&NuB!2vv}4lsq}&ug^!OpKI=X%b?NfuiL+;)F8?niBouS>#iysI zH8eC1tPWqlq4swf3kwTqit^X5U%gg*p`oFm!QR-oz(B^((9ntEN)88-OiEvcyt%oV z{n)W%5@tCPAt50G^78!$4mkYzaF~C>lqoJwPE4CNZAwTV3dy~~d~^CYGy@=g9>;SebJ;Qw(s*R4`_cbB_6I52F>zu&hx{e08GgaY0FKcCMR zl$P%96jncU<_yp7vbT?RsT-%AnZb5+^~|#6qD4xex#<%pJl4eQ6gu3_f4rHU|HAhCc!mS3LRW(dr}F=Qe|df?8(W=M~)vi|78I>B-pn4+k-PRjX!+(@+3-3QnFKAKW|meIf~7gJB9h^^1um38TzlLXn3iJh=>&Y`B7+LZJm6$ zjrYgf?e}*~i;j+dd~0iVKw#j($?ED>@x?0*-s~LM-x9QQNq$SIied1|U>-hHe z_Tl5l+2i8k3d+jbIy*TT7HrrcV4QyL$g0rQ1_ciexE;^r>U}k3&g99>Cr)^zq@^ti zUhene?r!rZ`zJaYndjZ<&}Iw|_Mg9EzKopi*we}8-H{QllvOJli? z&Q4I%qxY1xx%u?sLkW3#eAU&}F0QVQ{{H-be|>e%%+#DRb?V02-({dPukY?E%?{af zOlXIMtWAZ$>FN5Wiw*Pc?qapIwY{^mc=@?`d*X{f zKlAMCA&;mQ?}Wy_W+v@kHp$jS!B z#-5Fgi;2-Gc<0+DAn?s!Y~_0QemTLy!op2iSG7JpI?6q1)+{e4XXleGoWdQOHW{5f zdv@*jeJ+__m)&)7j_$YV?-bAYEw0%zCB&pK=xYFIh;sL``|q`mbE?FL^|ZYG`f#^j zn4;pxnZEM7?H(E5{OJ0ykV(;J+K0ztC}WSSIR0tw#~6EjHD!gGxGzVb(wkj}*EurH zmAraJbxY~%Fu&;E-`*ysr?X2-OaJ+PzkY^IWzl3&pH)BC${WgSEB*Oc@{w(a?kwe3 zB^q5>$t+SDrqY%L8r`SWM(Q_T1qxHHWm~VEC{x&QC=sryUX$Sv&Z{hGWhUX>4V*M zm_^HN)v8q-yu3$$eSIw`B-8|&J9>46(|fw!(OIV1QAaKa#cxhH$P~l9i<50}uAj1C z<$qSIe@1NjTYL<^o|Fw-?i?5*tzK|FueP>U#(nzW<|w|Rj)s8+c+=c z(-SMFY44i$KCb{PIvPG(*R8C~kE?kW>|B5{0~5pCt+BhmpZ$Dn&TIF=+CND>H#YfP zc^M$$dUa)Ko$&U;=iB5Cw**TU9!=y?n|}kGsuu0*5?dVhZ2#ly4>p_?ZcOu=A^E3& z#pQ(>U8}^SdZH$ZZ$Ff{BS$2!Y|9~j|M%TivR#W-R4qQbVyZ{|T&5k?k2;qzK69}Z zFSQc+dNyi%o-7-`T+hK~_T(2A7J^pRA3AhsmTp{DmKLa^(IZsNp=66Sd_TefUb(ADKl zPEP*w=ks}|+4I*O6<_@7RaQty$cNZ}|Nd6n)cz9r`SU05t@kqwlM51_yBVy~lAgWj z#8iFcC#pQ)7@^77Rs8v3IA_kB4=*k*PV1aL zVFE*LZZ4=%-`UwY!!Vi6#@4p*U(MUgyPiCMe)#TP*@FiU+T5>>-j;LlU^Dx}*RQ*0 z%#hfUe_u{dPw&L3Q>%>I>;L~1=i}oG2naZ^v-tUkS68)jZg1l?&%4vGcCD_FvGMFT z6+c(ate;~mUU~ZCzrWQ<+1cJto<8l|zTN!%r&FiAj8adDT-sTjZdCK5ASo-$tL*Kq z(D#4$SAXxT(2MfCvbE&o=NT1^MKu$hJUm++W}A6ciYf}ezwtjlG|+WjNr?LQuOcUo zzv(|KXT5sDgdb-ZDF3!)(+gn<6y;)dT zSjwFpg5+bZe1TzMYKz_b^Nw7+qBculk;{$J_SojAH_m2NRaF(Ao^ZDDN{7Av zbieL5Z)RpDXs9qHL5CH+xVSh*ULZ0uQZP+b#=88SOGO1smv+OU zmE?`C#~(PbX7P&P#Vf*=uUf^GeSKZ)jvW?hXJ#DCyuY(p9n@5uKAqju({r9vNJz+$ z?F$$hwrnvG5fRCXE&Kbc6x7WIZH0NeK5p+J{r!KM9z00U(Ej}I;mU;z85ul0Jst1w ztF?S9Dk|#X?frPRx9_`W&z^17GdDM9?>>6y_V)b5{QUFf_Pt+y#TFkq;_~F_Q^&YC zx#DMM9IL9V+IS?H^!3+={T9gXwJv|RAa-}zhRxd?F8r=I64iV7&c3@YbH!Y@YUSVC z1Dbje5)xXlWJ$|{1qw4}&McfZed^SQkB|4CICswN`nuSQtHbrzz5V|Fe*cv#A^U#6 zzr373?cAJ`m;e3xn(Z^wh*dj$9q1gzosWEHnQ(%-9M-n|yLMT*^~rRujozO0;6Nkj z+?koi=>^Zv$?j|AXL$1D2}8sC^5s*eh%h+B#m#$fH>>GHmtgZj2TxB<|J|E5eG2FH zI_taJw)$Jb=VxaV3?x89yIoyfA6~EDZ|1#E*K@vI?Sp5}+RXFs9XPONGN>2`bNBY< z2CV|_ld%MyzwqVF&B@t6{q6s@%r?(Ibm@{1Xyj`9cJrQ|9*fi0*F;`^Fys7u`}Wzh zr9rb8p#Fw#^u{FCuI}!{gan5A`g(>p-j)1vHVu3B*gWrfdSheq4BKimtFkv7tgNg) zbFD-VxA7i+eSQ7UV{h;6wPq-D?~=2v`k>?Q;nC34#B}}X{$~oCl0@X>`o6xt{&~xM z+v;h>yH57clB(952O3JdbxVo?bkM+?J3BX@OWKlq+e}1Uyg2TD^%s#dud*C3iO>9U zopZ;z1O+`kzKa(x&Uw6CW7W$QD_4RBUN&ss-oA9HDrjV9bNczBY2|Nj2!a-p%%3lB zmV1juT3Q-ZddBW5VPyF6^XJu@%xj~!=f!+KoSc;O;MJ=x(9FosPfu-Li;IdndV6zQ zm%U*)pyv`A8VcHzqot)~anvI=R(85xtW##D<_sUTDO09g*j=9g<>lq}e7(c%{Ox^x ze4sV-!96p4)c*YaYnXa!iq-jbpg5e^+{~PJcbDpgZES386DCf4IO~mnaPa5VlmEZH zyLimu({N*d;b6QsZ*e-fF4QXW!Ico z7(hcbRk0Bf9HOG4GFBxVdU|>`udj>r-MA6q;^LBUds}Wz@x;lK58to<-}~|LaZt4} zZQ8UspfjNunhzfM_V)JAy!#>hPFA~tPCTys2u~0{^yaSk_j!lE7;6{qeXkL-Q?6kL z&w}dqXZ^pI&PiIZL&o5WP~Dp)ISzq*7eo%a96EoG@!DL5LdEiZI_nrNeP%SaeRzzu zfuEH@v0KX6*w`2pJaD+PtCZWe>dOK7`ag}j(c2RK|NGm~(b2GP zpWXG^&C9;|iYYhzEttM~wf37gZ$J$IPEJl17M3eJ&mQZQ-Wj+4<{oyt-{p)y{!i~= zh&OrksKLef`^<`xpNwnji;v4XN1xdz+`z@Qd+*N2*W6-y{EQu7mHN5Y#L1I|?5vHKemnV)}iJ>Dm4`MvMaqer0g(PS(N7#Iw)u4t@@-5s_dc@4jzlf#YwvsoQj z>ff0$O+I;~TU>v^k|iw3$&cCWjYEQa^6u{JmwU#$-}1YWsKGThky#(lyoe1^>SCLz z=(kf@?Z{^L@D&LR8{gloU&$R^CKwQM&Mq&}`venc6lUrA^|!CgQ(@Z6+Zx}~b*gcT z&4EJ>I|>=UNlGd@{C-xwWl30}XQs!QiB5TGO3V7+{Qkkdpy zQ{&?Ph#!#lVo+N~{l*8_q5AYx$-1?!A3fPs&GjZS_Wz; zm%rcswteBt{E3wo9ekgi14Tl+&7yn${dmlOhigyIt5>hmdN-Fp(D3QvbbP{QZ{b&z zdo4o5HSqo_v*?~adHX(jF`f1)TS_(`{c*WgaGBk{rrDpjC;zy#@~l|)_i7^|_$9B38%Y*_l73*0NZy69rk6&@zD-w8J^#y@;+A@=#4tU#%ih-;v(oUWVi zn};uFZ@6zJzI+$|kw?-0z&)~8vmLqvg{%H*NLj@lE?AmuuEWO-YDc;T-tRH{eIYv~ zMI~sG(1EN)>+V`+-qeu0Eq!uT)DJ_eRi58G14XWeZMl&&WzL+QZgKrbcXyXxxO(;I zn#j!yR01Ur%82 zq+=(--%IVa?^?8C+p?o^%Rr~a1Vlw~rKhK>sH!fk{{HU7nKMsxK&$fh{eEW+T5<(B z(Ztow&28`Z`ZqTW&&=7r#IV}jV+u{+tLi)-3`^)sM)nBYH|J|iMO}5a)0{tNy0ddhe5&A zRFq-C;?FOAT-@E+Gcz-tX1m3>xv{-^^(r7JsAqR~FAiQDsd{%@wOYoqMUQ_wQxO+aDhvgVuvMIXUg9x+Ezf z!NBn8^XG-jm$NgRID59Wug`C8>xl~&1mx}OSPtyF5*8WC>dEPub7zn2+bL5Nb#=qn z-{Dl0u+C-NQew40L7%(lmDZWKKiPY?<#J7$6clj%%JGFgDGQITQCz=(M^Z9U)h zhLSyAQ$%WA&fjCcxKMa*)>2(TWtRW{uTN!l@LqDV=H0iqw?RGTMT-_y?8@03p)+H~ zjD+Xs=Fagh2c7zqmZs)6-|lSr{7;`gY3S=e&kDYLrLAq7+>#|J6K099cfZ?ab9*lj zf8)|#+apI+EpmTW-t_RT;#N%!l_=ZzAj)3TjxFoet$@JG53=g#Ph;`))XaEYB=4VB z#&*i9`{Kf4@pa!GE$Tn8bQ zMZp&tH$;m*z1?x^zUmRDP+wuKtXVN{GtD>=>vH2<4vo_*rf$>Lky zUECiP-^%Wq@%=&6{#k*o*Vij0Wajqk@9pAgp1G7)W$BJ;lYPCljDNqi1q6gV+7dct z`a|Cml_g7-BwRe)m;Lt)|H_1oGcFiEuyg)9V}5hfADI#}v*%g*`r3|OK{7tO3;mxT zOfvkaWyEv0+OlYC`Vw_zZDrY6R#g}B^G|Gjb9OaHiHT9`9GmY;Z(NCTl zk7{;KPS1?jh4pNoii`rH4*izwsF!WMG)YNf)(mG)*WSzL5<(R9tc31XeLFZk&b95( znN{X0s!Mm=x_`{3z0O@(V@vR(EPu}$X4llv6`2{uw>T0XKHVI^&@gqY?GaVG+Id`` ziUJ}gbo(7ki}|got?T$|_jZG~X=ksVOED7s`^RwC_gAMUXP@a-H!yt7mnj*^;1C+B zTD0k&vbi;L>{*?UHa1hzrB|7rWIOQh&ej{?A;Ge@w;s03*FD%`X<@M-dV3y21E}wM z-u}Ofg9C$I&5wqQi`^eTJ3D*B#)tOt7gmR_Kafx}i*?h66(YNS{R#*Pa`GxNa_g07 zdmdBDZ z@_))oy(jwf=g%F*{}p$Ym_FTN&&Pe#?fqAdU6tM0f9Jf(v9P@H(3k1`=kR66=6*Ez z!fCQ~hkg0|oqUIW_3l5o?)-A5Z)Wd!*}j!G&6*{(DCzNzYxnnNtDidMwXtljdHCS}6}u3QP3 z_l;lPZo-Zo7W2L}H8Fkq^wfLaw~vpH3p1qr|M&Onsi^`^^K7f#yu7?BZY3urd6boz z`Bw)834w0l%)EZ#f&zm_Nr_4L@8kXQCqF+wUwLi)s#Qu07cR7U+ae$&CFQkh)vAhH z^X=>XxVX7@-dePHF(<>Kg$oaEuJiKZ^7Qh0lzIN#IWsr?>av>(|8@6x74_$1U?cdg>I{zJ2>_ zzVBIaZSB#rgasgbcl*mqyhyd`TBPCiB*So#M%N;jJ~3si-0SbwbMWxEBqS(o*}C=N z)2FParl$K||N8YyNlA%`0kkf`XSNxykx|pxKT)BfppiCZGc&QWva$~!K0J_enKu8^ zr=mGlrCf{M``g;uj)h-e@0*sU2J%=_6H|}0Ip4W+=W4E>J$35P{{R0@Uo|Uu;2CK{NS~!J4qi7b^){lRDd>pYU#dGhr=v^h6Hnz5w z#dfAwj`zza=I8gndX;tK)~%#lTQW=iqGn8)(juxIreI+)HG zJ2FyIQUwJCp!+`Ve?5HoaAI;Yb7W-Xj-5LfE?UHte}A8-#PjEoPm{%^g1{``65z<~xAS65SuZ}$KH zIQ#heT0Z7X| zix-xbKHa^qvy=0>#01cgrlft{9*2$l-C|?svaqt6p5C`|S_>chm(YHBd$+tiyHpaM-(zpO;tk#U$PX|G2N5JlSb{tD&!t@64Gq1y4_j?z;_YJl))sYEk}f z&VlJ{*-89zHZwj~eRy!Nqqq0y>+9=T@1@sHnKI?Uv$L~pHvXJDb?Nfuk55ikm#{9= zId%FptDQ7+!|L$$prhuDSG8=}V#3BF5%B*0SJ2=!XkpByOPdaE)Q{W4AucX{PW8q- z+iItvAffVicUG3x#>U2Wbao!ReOuZ`O}MVEZiZcLRrBL(NB({KyRY=MSXWn9#kEue z2@ekshvj~AEpq$%`Z)Ob#5BxYYdgi1?Sg`X7p_}(&NOm9sM$V!|D(r`KOW|{KXC1u zSW;3F=wvCDuDO#Y9WtGn;QMCElqpfy*RNaGwtKg=S^m90SF3g6C(oM2mHXEJ^Q{#t zRyc%(Z9Dha&&$i{c%Q6c+8K#P{o6~HFK-q&BpU7R&TeUGxiwB|?M|8UKR*h2zOxguvbvt1pP&5x-d^6m=*Y;p3=KVMoV{kr5|#8*pKoPkWhMRj@o|P(uGG5t{eAcA z|Hm%4!NbNZBy?x;V^1%yMXOe=y7tvP=SIW2*xgC5uB>D_`deoI<7eWx@7f1C;nWUWbD&q+e8;xMD~>HV+QHAv%>3kOq5t+dvuB?+e*NZoNJxl5$_asr z%F2f~HYP{xF4HY4Dw<{c?b_PthwtC>o0^)gSh-Ts&~W1Aj|(?$)Yj4p2nzaiwJ~t( zmMt5yuj{Q?z505k<;3~3l7HKj<>l#3nKC8ot!9|<-5THX#+;m-J+jtf{`2jie);hI zetq-7goIO5G)vcg-+JTc&!09Mf9}0s{rz2QVlG_jeAsi})bc9mJV4M);3)~{!{PV$&;I>OaWbXrDSL* z=;h_Lqv&auL;R$3=gxsD9v zIl{7P)hZ8;3)x&#m0}`S~+4G9KKuzBjYvweauH_e(P}G<0-z7p`1+vRs;* zoBPasdwJ0Eo2}W`4T_$4?0X#)(tP1w$sgVLeRFo~+BIp(5|yG~UosahT$7qXHAVwVR5nY-sT=6m%UZ$>grN4Gz?sDBmLYQMK?D$6)mlLda)eM2Nha2RGUjlNfkXU`uQnUNm0@9)925uUEzyYtmt_0>XneZy!@m&b9|2V zNIHYJ?(ECIZA{19Npt7=etUb{ean_D9(j3r&B^U; zZ9=@fyr7#cKfSuDos^T~<2TRdWTai{DG{T>M=s}HfA|o}xxt!&fiv9G#WAGd)32}D zpB^4&-&FkEZ_)DQ?nXvNQiWgsT)bD3dvy7|k}nIdTY+|P+`D)0$G_k2FYc?Y25kk3 zih7f2rlP8vn4En0r}iX)rtItM65rq3n_x7vprGKut*zOLYHHUW><|(X+EMtJZJK^O zpSig?XpQspb8{c-T)%Lkp|_WJ$3WmD*B+~CVyVsz8cBb*VnuI`SGdw z&T5&e9bPo8{MD7t)y|GVK|lqw0Hu|k>(=Sz z2dfv$&jkJ}Eq483HUckS*MHEtrVfm1pz{Or-_ zTC_r}1*0+SmGbD(Bhc2e6DK?Zmj^BX{r$bNm6g=VlP7J?D_>18n(5)?b!fJEzJP>; z#uFaRSGV1}1yzkgLqk2hyqsKJTUP`>e0{K)eTIF#omI(;2Ko9w6W8!5F z>i$K~CVcw(^=QBSzm9%+`!0p-u3u&spZ91qUg;^x&C5HNnQSzZgM*_1l+AulX6Kg! zEoj`dX%ncGcz&Mk&v(We8XONFJ_HTq&6_9ZctN^~;@&T)t=#)ARH5-MzfH)~sD?m~&%; z)qG~_!bdD7rlywXt$L+QxlWxr_2KK+r&VGr7A#;0Umy3>$0#E+vor7Ru7@WkD#x79 z2oyOgZ)?1WrRdca&5Fv(!mW4rR0_+<$xWC#m9_imp(UP^4RUT696562!NbGt8@6r* zEob`q?(>_Qn>Dnxol{a&YHDgM9-n!8VEh`JZb>a&x^%<#?Z+P;Zl5@NcK6NA>Gh?D4h1jwOT4haan5zndMOXd%8tj3okru&~Rj7V-qSYESxlF&Y4VU+bWZp zhRJM-EfXfI`wKBVd3SgBoTu)6GKxt_Nh&rra|E0`LPA6s9pr4QjzqeLhffEcS*#tF zn5cODwO#G637Wyn3gW7(s)S-=W6xFTh;@V3k;Y6u2fFrR#*7&SZ9hPF{7sxRN$LIl z{p-K}h|m!Ot?a0)tBZNtFK@5LaH3b*+#%iV;uU>&}iJxOp$i(pb&68VOvq6i27#_U4yBoBgzk!k2;&w$vg@cn*)B7WZ zf3ENx4vvcI`thT}!_%|SmqA=YqGMz7@uF+O!otlfS886jTNk&NtG2clv@Yl0zkeQn zer(MLA6VZijf;~zb^3Ir8_)L5o116Ol&q<(W!%v2%*D(5bml&1S69{+fhEhAo4<(A zT(x%5_a2Q#P!_s-S61C`4yZVL`1&=su(0r#x3|R^CQO@l%y`?3En7@XOiZL~?gy5X zn1FVtet&;|v3tLqhnLr*JJm@WBTk$+@t{ZY#QERf-zzFBGt0}%``upP*j(|fcNJ(= z2*cJshj$Mjf>u;7Ua$Z(Rov3r%6fk9hFO-4A|fKM>KBMyZM&G{!kKfdNAkzt@ApAh zxyx9W@qB)M{<+TO>(`&pl44A#-}wCL)7sK`3qa%SJd#E%$;bO#3kpDq6V#?SS5#P7 z_~ONj4|5u8EPrP#_nW(5{d)fT`u|l&r%s;^DjLtnI5QaJ-ZEJextZC-0#W#!8`%$-3Y+0Ocx1DQ5&+0wFgt10MKuq|6mK!+r4UQ_@7Uq^TMV=a&L zb8{G*4?fsc@?Djcm37_9!^XzOpjAttAWKS0TCr-CQ(m6lb(_G&?)}GFxy3(xc<5a7 z=Z9eR_jgAdnb~)wDacxtXsnCd+cjgxj4Jv26BL~V1O*RXUblKRx4F4_MRm2ZrY7gR zckgUo+tmM)S+{Oo@2uAyi*AYBYHZBv*<1Zxhyir_X3X2GSFffV=@4{rb#1MvtehCR zIZZG#GjrX~j;z-Q9z1>O`sB%z6O&ZEPppmJ&N2CiX#Ydw-6^^SV#pyzyZWU^sI0Xe($EWJ&S!b94TNg@g!%hlgKU7i(>leNAUm&P}67 z&z`yI#qK)t{RZgZ@siR~Pghsg^G5ac^-K*sG8PlkBTGw74Gj$y85tSB)+=kS^8IzC zvC&V_(bTK1&hFpO=kh!f1`M&gN*+cXOWIiQ_LgZ&Tbq-Y7uULV>k5jB9^EW^a$@3z zYiaz-@v*VI_V)Im%J<2Mi5s?Vb*-zj11$?+0QIH5eE9-u#g@Fh#44=r_vDSft*z|T zsZ$M%j1GNzdb;rczgkeAKpQj?*V5YR==G}p?OprsrUIGcANfnnx44>^zP=!&V%M?2 zjQ#pN7yl(2b!RDOe6+N%{>9RwU$4JaT`v+T_k> zpLen~A8fxa-nOvj{`IQ8brJE?mX__FTXTQ<^Gg2P+itJzJHB|4#;<30S?2i~x3U-> z+F!o=?v>YH-^p{QM5>+tEW*-gHrsdgM*ZpC(@rn__It0)@t;Nibxv=I&?&K+Ya-Vl zEi3)PE~$mjQid;TZP=`{X|KNj?s^>2_gJG#sn>1swa3pZ*Dca`=bt}+XWaT#ucHn> z-0-!q@tv~UiwUb%O;PE*WD*)0S`-_8`Q;b);C;+Le2;K2B=lt-XJn}7Fl1twq3p)M zPz)B6U}QKWsLaq{nZ&|i;NHW)@T^0S;eZT^qIXLpZEnwHWq818dbjfX^*jcKoDZ}3 d7!uy`e&!AFt2Fgr!N9=4;OXk;vd$@?2>_LXr|AFy diff --git a/doc/graphs/diode_iv_plot.svg b/doc/graphs/diode_iv_plot.svg index 55fc00d65..8ae531a4b 100644 --- a/doc/graphs/diode_iv_plot.svg +++ b/doc/graphs/diode_iv_plot.svg @@ -15,65 +15,65 @@ xmlns ="http://www.w3.org/2000/svg" - + - + - + - - - - - - - + + + + + + + -0.3 -0.4 -0.5 -0.6 -0.7 -0.8 -0.9 -1 +0.3 +0.4 +0.5 +0.6 +0.7 +0.8 +0.9 +1 -0 -4 -0 --4 --8 --12 --16 --20 +0 +4 +0 +-4 +-8 +-12 +-16 +-20 -log(current) (A) +log(current) (A) -voltage (V) - - - - - - +voltage (V) + + + + + + - + - - - - - - - + + + + + + + -I₀(V) -Rs=0 Ω -Rs=2 Ω -Rs=10 Ω -Rs=51 Ω -Rs=249 Ω +I₀(V) +Rs=0 Ω +Rs=2 Ω +Rs=10 Ω +Rs=51 Ω +Rs=249 Ω Diode current versus voltage diff --git a/doc/graphs/lambert_w0_errors_graph.png b/doc/graphs/lambert_w0_errors_graph.png new file mode 100644 index 0000000000000000000000000000000000000000..2a18debbbd8fa0be51457ac15da995cfa68dedd9 GIT binary patch literal 24501 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z;J~}U&3=9eko-U3d6?5LqEw2a({rCTVc~+Xy%ef*7ieJQ5Hnq4ohByegG_P2_;Kidw zb>G=vtxMH?{chEY*Q-1N0}IPV1s%m!I!#cUAmAnB#MG!Fa7jJ)*BRUW_IdBl%$+uG zC&%-zHkE4M?^IX)ob$=@xj{=qgVVwQ4H3Z!h4xn&t}J3}0ddWRsu%?K2n029DRQ+s zE&RckC*-G8q@f|g)mp^t+$zxOv@pP>86w%iCh8=@)#@b3tJMNhpd=N-5vU=;T4eTFw#g?|$_#3{;@0PX{ki>A?~Lg-VXH;c zHb=fm2-tO?RJ$cBE9=9{<@3LF+-?zQX=_`wY11b6JI`rSN2At?A@Kr z`fIPh{&+S!|IPX6Z8--wpSSDQ-}i&5rNUn3@9y{eoP&ad)codj$k+W?=zd7=$(5DC zH+Glj_y5{h^)>6yyYl_a3?`3XkD6H=1l9i>k%y;&+ z#SdR)?)(3*x;ifJ&W?-fbYc%WxMU2dfb#ttYjJdEb9ON{r;^yzUCwArAwCzzPt!r6S0xWy8K;B+gqW7 z_`dykd;kBx@|u4?pIa0@V!3qr@@`!oh6R^jCYVU=e&QCL85|$aKl|)8Rr_`9>!KB} zNPYeK^~UaU{knfY)0Z#&^Yiobz~JC!?eKL8zrVfx##Hj@iRYg`pU=y2pZWOs_{Y=w z`*-+q#_XvO++Ft8DK>WQ-JbWB*REerKHew0V%4fc-uio6&fERwxq0(up3~cF(fLQu z+yCcjkglC;Rmyer=+PCcRxvTWxv`PC{7xaekD72?cXn=$4VYt7c`5GUny}Tu5nSBdf#KoppFS1k+~0Rs(~jZ7g$oU} zzrQIO8w+2(dUeH$6$d^&J-xB+Z`B-&LMDa@vu1Vm^ziJKwbQHq_NI_a`MtR!i>0OI zjqUmItDEB1UspCZ7G`B-^?RnMs95p&tT`itsHmt#^*0?3#S`bwxg{qnZ`!Z*FbnW@|q9vewm=we0=9Ugvhcg)3K{%$qlVe*gUXe>e49TA$hf{UTgcTx@%6 z|B4kH;p<`?larOt&9!D{IC1u@YjLr$-(0KK&FSZFUH<*#d}_NBU%~=U53jEn2ilKu(TtWk{BJa-`Vr@9&RaTnZ*L+)!on79+jcF}BrqnXXRdYmq9sd?y!>sP ze$HX}Wkq%MC<=bHJ<77YS?3;+E17?!S~rKPo@__<&Izxe9{OimugJMW!1cTTNn=bf{AcJ7?nBWc`b^ZU)_ zlvh_)rkt9h`K`SCZmIam6DJhR@0JM9v?|qld4IqC&(HJ!`&_zw`Q(Fx%_ra2|F3r9 zP}Dgs#PFn%T~1-Ly1&}tHeO|6bw8D`)l&tWPQ1Fh`s9y~k56tsZ|6N}^5m0Cy{B_1 zwycTSIjKk5yst;fw9Dqh0p^t7-`=X&+0E;bFl;(A+q{3q*|g;w;&zpEYE1Q7bou3p zna1fSWXtb3y7fpn*8OH6_%$NS~gA3l8OR~8%;bYhwB>^qPC-^yMu zSYKa1Y2G})f1jrB7jWX>@hbN$>o6jR>c+pD6a)T9%!p+P5VOUIhX&22fiwsg96c2?+_ExVAQ$Q?Vr^EKG>u$nWys4$K$rk4oc_maWs+Q_4M{uUccv4*Iu7H)$jMJn3_)g^L_t+Rk7|? zpZRukmn>a+^K$j=ZMiK1PU~WJIx$Q*+ATi$<>lp*@9nLg{Pgtn$(+J!6RO|uot|ML zRrKXWV1J#tiHU#{hh_OYnZVUoQ||4leDdvfzIyHNZ>s!uKNkGmEgo0V2#P_Qk4J=4 zZfrnAEYw@pZ&SJ|c$w`Ycclg%~uxqj|CV%@X-YPCggF#d%+05>u(D3PxjB7u=H+D*LH>4^uf6hb?f(7tnmRgLj@KUP5PZ^K z|3}%=&ri+0Pv+x{ch|+wwg^m+_T%8(S@e`^qSw-IPIcE~%O^@2rwL3x=`w5f>`oV@ zjp9$v&NiRy*vuyAB-4A@{CkHkqfM68ZG7UB0Shv;Ta%CkGmtzdhg95>QoTWhlXOBx~!W zh6aX7Q>VIeD5_Xm&fN3!+3dV`_bZ>zO?i83>$miU0>56ZUVmak;^B_7Y051HQ}xx< z+HT~S?G|{{dZ6F_pU0$0lWdMX1Z5$9`#&50{_His_d%nDLowy!qoZYw-W-bA*Vn0* z->Y2yxANhk)+g`l|641z2>(e;Ol%Qwx8uJ2u~j@y;s5vg|Lz=$OIEJzTyZsPcR*i9 zheEfwzM9VINsk^S9Wvm#`1-5M>Z?LqqkPTs@4XRe|MRCtNLDuYea)Tn`?XIl``fFw z2pCm=%lULGdwpfk?g>kls7#tUGqe8P_4V?Vzg{kXd;aycwaUuweOs1)zqU5oGbcwU zG4h&Ti&@SM2abm<&Mq!2ni?7kEdoZx&wM_;+x>pqtN%NTpLh7EDewRHOIxvJLRS~p zq5ut#xH!3!XV0n{8XA84aku*Y-Y1{W+pD(-6n(#2KH2Vvs%8*;HPd`09z0*f+Gq>DA0WTk)Ez2M7Dt-MX_2;iPVJD-F zZV5@7>i^f}+}OZ)_3G6PH*+@J%$aa<$C4et-|b!)ps^r8Lt(1d+s|(r8yh!7t@V4i zWZ5z%hACdEZaor>ixw%lxVSj1zy7$-`W?doU&A{!pU;+AKR(v$TvJoC`|zxJ^ZNEy ze_ym@3CsTff8Pg2MRiTp4p*|XySHzJoPfZCWwNOT5&{AO7Y%^ zd0TJhxH&sBcXf3c)c*Ryx3l!mk3ye07J@>Y=E63WpHgD>R*6p6kKgwD%?+xDkM&ABayaJZ>TZczTdSM&?#@oX`(k2ZkEX}h zF&^-}JZ0+C!~+eC3=OK@(;5;bTH4#21(>>zHf>Hne<;J`(K+k)C7;Z#t)+c^eZPGQ z3=2z(Kk@Ie{Qr*XcRShH`Q?tp|Nj-%mp=JBwJKK7E=X!Ny>af6s;? zMpE9cW{0g_V`F37<@k=El}C0IK4vHgF6HFp)X>s$a&~5xl9rzP==%QpdWHl4f7k!# zFMf9BU?Vg8hwJr0`xxMGWd zjD6i5PeI3sd7CzE+EDP&>G$U+CntYgU;lS??8BhdS0zldrr7%It@`Q|7$`Vt^5nPo zKLmIA+x=8o5~L|5Exj=8zQy#Odj(Dzx3}e1d^{@t@o~TXq5Jpc@7I2h-M-`Yl`Ab9 zHW;w5vpX*hdidhvV!z^NbDx6RnfCvG`d_(v_2K99_U<(`dtx>A{CL#O(D39*N=Rs^ zkH_V$uQ=|F+wo9Dm`~oW zr;(XmNm23Oz71#e{mQ2_v-2}O5cBk(Z`XS}f4}VC-{0Mfij3}6K9^;PVHDM4+r8*w zM#0Zdsq5cgzI=J&)TymAW=Q<_`E#NFd^-+q?!z0Cj~ATQ-Oj-9=<(x;)26l6|NniT z!J@VG!GnbA_gi$Cn3)3u0vOhYbsv|n-xFK*q{#Bwxw+l@|Gv%t#&v4-n(boCC5_V( zZg0!oQS_9H!EbBTp%%_O(apM`hC$8ev*rd8JQlUTO!obF)XjHO+^GIv&7S}NewQuf zUK{p$tK%&Ddb_Z-QK{lfe0_a$&1{(2`Hpl5Dt|boy}m(!Y4+K+S+k^;EL*l{+cq(2 zvmAy4x(V4^qZsBmc_bt#Ow)~SJ8|NKpMKc+8HUXNf8YQA=3(sKDpNJzSuGPLOz_+J zoOAQdp5)_wj1NxD^HDqe;^JbE2VcF)+Wl(B@*leK`(y+K1;2gR8Y;hM;;dO+r>E;b zzOc~wTY&@*TaUc`KHuF!oh-@6`;Lak*RpmWZOXm9&2nYU`8k%tudlCfKbX*PHtq28 z`E^~p-|v%V2roZ3-=2T<)vnmxWrIQCp|np51yK;%~-&CE%fs9lj`%2e7|4ce{r#U^_xm} zcXwr5+q;>!UccM@{@9+%&vUA-&ae5z3F;6}nIZz}yvNu7-CDcr=+u@Lmfu&z89$&M!@N5dHh;fd_VDr9a=W*)v(atw$Bgff`|aHl5)`Vwzw4c-?EdKW`u%JSpnNvJ z_M4=d|2&?C*B{;8+?W_Zg9xDHwBzr$+lCb%65ib3e_zjLY0%2a_v`BFJUl!;NVGqn zUoV%nRVpztF=A5+=eynS?W%8`N-_HK_V)FExfK;Vf)`6mNOZh-k@5Spu)j?s$p3eC z6iV3DSiIZw+3$CUfuZ5WOc(3&cQIghdV3$fu+Z5s^_0l&w)pq=_P(uDn&>fM#te>5 z7p9dVUB0u;6!rD_4Gj$?Y^zN8WUX2b9B|0Fy^Z((uj~5_5)Lr*NSU76m;d^4zx}Zf z4-a45UtfP_o~`s`HQ!G&_&$F87_c(L@BE=XzP`RkU$5Wary0B~;lu<*i=rnTw)0br zW?r_N*3iIkumGCE+;>&)X$ha6fD^`s z#KQ|NW`Ju227}U9A)s`psHhmRJx?~S;vs8wdzb$C>}zWdet3BJ<0d*Tg&IikNEjqAfGTZJbTKT?-JW)K7T9QNRAuZsAhz=}FJd%uHf$1`V0LeXvW&>3;2Z*-xK7 zefafyeYY&gkcC^CUq2Ih`{+@UPW(QZnKNhlrLO{wygj}3beDjWSU0Prq-4dfm&*@s zTJv|;eedad3*-0K`LWw@tz5mj*vj#C&PFG-@GX@Y%B@ZdW6qyQHTtpo@2!6uq<83v z2%FfCE{Fz+Qn0@vEi_=MkC{#Om!kn{b{&C7-RRTb`R-M{F^`MFQdHca?- zzwk-vpCz{qbFQ3?yZgfP7r)oRrH?in%svumDsPh`!&TJZEV@w9 z?}fF%tzB9srdNL6$!Fl;>}|Pa&k%k}Z_D38^TiXiFK)jtFvq(3(DS;_Dr)?PuYU42 zcrmNyU3p3g6UXUAyH-8^&Q;2;wUsUKBIk~P5;u|m?0k~F+^x%Rm9EY$Pco8Loa$wu zl&bW^;P;vPuai`saOt;Lty)z3;76v9_w0spyFViSx@QjLmY;Dt_E)mv&&8j%5>fA; zOkrrQVyr6)+;jXQ_kkJv8eCYuPHkH4kfI=<6|`|p7R#(2hoB|z|C&WM?9o2pTU+zq z{QS(*4)Y5X4wxGo`AxaTB*fOi{dMnsh6_0?dST3mU3NV&d97ri#5ke+Z_+cq$&>5l zTt#)B7(AXA-TrMu{`HkzW(V$`+fns3Yx(KDpaI>Yw}r7j$9Fz@{=EHYw|KWK4=9yx zIaq2b1RCBwmEZijNac!T+1p#KTj$qv&OWPE7N8-*^|Y_{Cn>d12a%gFSMwFYK-~+a>XetOG_fuVBg>K*OS;=ofZbsIBhlgiam99E}NLW;~b;*-|H#QgVKL2M)fW{PQ*^4a~WXtb7Oe_2GAu&Qn z%x9jBWbN;7Uo$I?^++-+Pl@<_(%tUsbdXOZY`O`#PI*bFI_s>pmQ0w|?s9=*SqhKCbuApPCF4 zDV>N748_mRWN!aE*Sb83cW>lWr-cDET`!auPLHpXR8>{|_I%GCn?0Y;S<99^|M2jz zgh_@#*qVsOo*o{XFBhC|Y)bXs{g$1DMM23(=u28CDB@%n^?|yJ4ZPB34~}#Sf3tN| z_n&v<{=aYA`F3vwHQN6lZsR??%y;&N)YD>TW|^*z{ig0SgJE_|^Lo4gTMpL+Ylv_y zE$+~2Io2!P{^d)_lBG)(ZER#1CQO*n@bB;M@|$ljT?+DXa8~{O|5NGf4H#H!_LMu6TJ~=s}m*gdaQZX}U~eTeLbu*l9!IV>cO_3IRq&#vT9v z{Wi?Gv4L-Q@uMT0I#F9V)cxn>OlQcNJdNpqK|_d(qJrq{`c4Zcjt5!`BMPS*JbG%Y z_-MLy8>5O);UR^zTg(k>kH&BOlOFZw+g5>3TkCBWaWC|@`^j>@{=co5P6Wf=xPEu} zS`qE=bw_S&OtyY<4wNAp8W=!Xr)=}b$HyOEbeI2{_58BG{n1&b*>BFXZ$9^6-EE6h zwyASgw@9f9NMAbWQ7RnT>kuOFKwbR!|I?)o>l5^3YkVgQa$IFtxX;?-Zs#gDJ)Wc| zdrvZ5G3yS0$FRVU-GzmLv2Ne@+sBG{7e#!`H!G@7`dPnKu7i*1Nznb@wMW0lb?LVh z6&HVexBGq4lM@peEDml=KHkU2z3}Jf=gE(bbo!-DoH%jqt%)8g6F8zGR))01EC*## ziHofl9{1b#t&QG(tMx)7Gkd}Bx7*8a%>DWKd3pH-P`Uy}sI1H^DJco+Q-_9%E?T^J z;*=>WX%j%Me&p2Xbd%MX8ie0<{c>CZnGu&}Z!S}hZosM@Rrnk(eF*m~jARPBwm zzsqDSi&(1m%87NeT9>`~P-y|`W1XpgA?WeqqAjS{Gm+oy=qI7MXq) z2s5v5{l9t5?)`_}@41=HKhNy@t(ugvB_l@WM$&Y zm$!aapsvlG5b41u%fcte;y35PKbyi23qI$2|9Bg-i{(nyPMM=u?=E(?t$*G-S$(c{ z<4Kk$&#dlz5ldV6zvj=LiPN78JY%@t@#IOt|M&Oa&a?ZYKVQzt-fzx>L*);fimOCL z8E@V^Fw^+J(QXEYqmumZIOfMbzIbc10bk9$`8GEV&2Jq(+CAqsE9-%mm(Qhs{8Op- zZr+Cn)4x37e7@t^v!a*5p-(%UGc})|KiGWk=ZWQ8UmG8oYWQ#F_TncT;eF@kGB3XF z7!=O^;dmA2X_fc=+Y5I8Qs)uQe}9No?~S@&!T#lbmN%!%*>Qxv<4iY??(Tp6erIuv z)m*!?JLk`RD_8!n`ucOR88ZBNpX<}lG3=VwJx@z(N6piZkLDe>QmpwlWtyE+iQ<%5 zv%0osUw<^wUCzw**|P6$x!~uf^50Iy5B~>gK6ror zY3IQQe|ney*uCq%?8`gB9EaaaiPzWby^~$I@#4<*922YMkq!*sb4<3`$F@9NwZ6Qk zN=jOKP>(=MG*M4}?_WJ+4dC>{4cCVEC_)zTE<5}u+*XGyA?cm7zEeBf*aBQLO z_jLz1>Fg4?wK17}ikIrY5AF63HXfHdd~w)`Qli16ok4se~_yR&+&;u(AY!j~E?1x-#bmSsC1U+y0Lbc(x#TlY~z z>jzo$>&1>Ow*7kWs=nQxbw8h}%FpcEaevnSnjMwjISS8DKKE?ma*LT~bNyGwHm63G zC~iqS%%&m2^?UQlltbU%-maD7TN=da>!6@;p>MNilqBazWof(1XVc#C7wB>P@#vUu z{+yMs|3Xjs^_;RZ%DcZ^vppz&;+@3N4nv_=Yv%7^_&CjOZ7&yt!_uO4Q|?{5b=Akh zv|_DdPkK4W!f#6gYi+;BR{s@ln^+#dvP7(GPyC_y{D0fc|GbrLEpgw)>E82a{mCbG z!j~fVS5)UtEzJLBm9)HFFqWgWz5Vfmgt$)+4mJm@46)-szQl9#huyB-bM>|*KXm1Y zTpRO@vsx~8W}mR$0j?Hl)YUVxzfH`>N?x* z)hw)*Qwl50WA9#lz4O?+5Uvq7xP>IoeJgi851T zA~xD^D#q2{-5M!7HEg%^!;Yg#53BCnZM=D=RG^N# z;g^yS*~2?iNqMialJ*Z%0XURu*;V z>!=8|m(6iuY7=kZdA!##GvmRtw?E(SVp7~Ep0RbSLqx>)-P%6Wvun9}i;^$MDP9!4 zb@`@HU(1?n?_SR-WxVL_Fq53^u*I=zMbsmw6jiLUR)qYnwXj< zetmT{wkZ5jrq`LY;_DNH{EqMR>tu*&+rD&$!qg&V=I++t^YvA(oBPW3?7OOZ+4YySIz{|gbCqdtRq0uNuiHP8q++$6p2{dLKCjuK zF*U&^_v{O;>xb5~7WjIsetTz1sk!nl0Z?m%TYpc(^|)%@Phu-&jLb9K5q{FWcCe!sW9-~OM(rZSy?Y~v z^?z6)mVdd>#z<2APL$YH$<FCs?t#YC80L)4 zg@-!cPvmxY`cp7HaZi6sg`?V3t9#x{6C$KNJT%gu`JSD!ef`z4y$+JS`^24MTlkZFr%qxcFiRD0(k1_jh-8W(F-9VP@wmIi>r^F`>dpcwchlwU_H-Z{*CG zAi$-#^2+Bn>o|ig?hYPH`9x1ong;=~hY&Kx;4RXZ>!sOj$R^2h%5zk=KE1g;F3VO_4b z@87R%1_w`1&R<_%HlLkso_uXhq}*GdxmKc}V%tXB#N!rm+pOJko?}ygoS01ikaMUcD{oLxLYSgueGqOkO=zZ_xQ&L5rdY5 zZ|ib@B;Mk=GwG`~$KeNG4k%_^VPQyckYL*=`ZR&Vu`3rl1tqgpRPa1N->$W zmM29^@`;(Wh!}THkfz?zqlc9yJLhd|U~~*A6W+UsXVP3#a(S18X=gbd77Pq;UbUehBGo8j>70hp zS!c_xesB4tZJ;SKVS|oW@?(YV5e^b;ye@qVvn7Kx1!99+XH77Oh}N1DxzJ($rl1+o zZtX>@MY*~q+3ZENl#~R6Lo@mFU0s&k<*z(_MN2y|VQSGwgOj2wIC-5bVs#G~bgWzF zRGDJ3im6F3D7t%@haO*1H>;3S!o-salRW}NwG%x-A>+Gq15QB~;1lAsfF zzuhu0*s^9dul@<=)C!hAK58!4Ll)X7ai#8k^dQ|xY1J|*ox=;(gv(4xGmhZAe2D?% zE*IAnk?GfiIDM+5g``$1Chllnv fz@-}vH@a45e7e3sN$HXtd+SXe&cwutCl$Be z4489)y>sbwh1{1DV*C0)u@SK}D5mFqZ|6<-Kq+BvPQ?k4YZZ8yy}h5GUK6k=NS0;h z*{&C9x*W=m^R<^+7^bi=9GbdzT2aI`ZNARb=>?`rr{cCf(q6Z~M2(O0>GZ_OUW(Z# zi`iJzb~1%0RV@rpWexAs6lum8CKzo{hsXw1Oo^h%-b@S;xpS zN4JYJb?>7I5mlTUr-m15n#oNSocN;lsgYOGzWL zx7@hh)3R#y4lXhArpJcaer)e{mTFXq$uji*xLjyzYFhDT;eZaeGvts0hzur$)#0oza=zhm;$#{I2emda&iotl11s z0x3pH5zCpKIlK-j3xo&vO61BaNxcrdqRqE)=W+)Lwu5ZiDq5ByV#Xz2s(*CEB9;Vc ztPL|+b#+4IS_4BN7BlO0%QtwWW+X+Ph?HKmTI=G9Amw$7WO%dc4O$LpJ$|H=xKl7| za}3|?iwrZ*wyikErlBi#Lq%wXq$QJ%nuqFvryn>L^jT*FCT>({*m^L4X|;;v3L(3oOy`soMb*@?^n3xW=7O-*np71e8ZSBQ%4J{0#+A|kl8_~Tx~ zA2D`ogf#Wsjxz8Z2nknOw1}x{rOd_B7#R~c<|R7Zd%aj!hje||73C2rCbm*!l~{e% z)$5MWmpkp<&t{e@n-ip&l%0Ly!F&GM2OAXDiur1pe(_S}X>m;m7FOC?y5UqxOme1y z!m@2*OBV`utY6jU%XTDV=hhXcb$_NzJDD);^g_X&GfQ;3Zyj*hz{4C|EbL<>`Gk%6 zOOqbOtrVxt^SK(?Y`KzvfMe0?ti*|@6ckw| zp7p(OG9_T9Psf_IZN5sb1;N5=*leA;xDt{iBzUSC1a7>_3S58D;a))hhG%M1T3rul zO;+5pf*~WX&2xSGx}BVRSFKJ+j%;~7>tXuj0}9MZt5;um^Su4SF*k!>X)l%^L{i0GDmXVRK`Qw76=d%Xn(CuF={F#UH}vfr190f~uf^qm_-EHwy39uq?aV#Tmbz+3pv|j`wyC-frJn-8fC3U9O_R`2S&fnZ78U13i)l zc9ovXI=E-=(e9lqckZ%!=eKBj+@pWb@2*(OI)tSdQbhjmpO|MN3h*^CR1tvq1w|8bW>ucME_ z0sJacuhMOw5oXFH#Ks{% zlSM^s*YwQmB^kQ8EfH()2-?+DeSdXy>D30t1N!?5zVq-(GBrzTTxarJqhP;1r*J*< zpM39H#sj|duU{_??-5|?kv{(S)z=t_$B*aUUAdNZ(j*IO-Dl7J<6P%IG@KC1^=ZW- zrjD*hbx(`d`KYQeXll;+|L|eV&C<2s4{i8Zu}WF@scHT5xF@F`E41HCS5~}uz2(>U z_x*o=e}BAs{k}t8qS^%y4m9#{D=hsl3 ztDoL8H7)F|48Jn_=a=s#V$rpGe@CTehbwInyZ7zFtlLkY@`+~q=Vfo5a3y>9b3b|i zirv-S=eZTvPOW~J@7ntLXUW>7lUG~+sakv>=9)smeDm!$cla)=naeDbeR1v7pVM}| zG3B|=u*m85jzSLgMx#1zq$72=4Qj{Z*THAM0YGSIlT7vjfq}64=uP}EiSZY z*0$HxZ4cjkntfD7==eMZ#XrBVnPgV|ayT|kSX+f{?(X_^|37Cw;$3@fq15Wn59SFp z?sU2DC9_vE;DhbCyhT?H7~XySAhQ0N$*~eEy|-I#_04zDby@g;r8nkX<;K|6rRMo- zd0v({w1|J+_U+EguQ7A>%H(8^;pX1_+F}h z?X|sn+rr+p?hn&WpMPKHUf3LjQ!weIjI!+Y-)|Yy6-(DH2q^iNaCw*2^FVKZIo>CU_nrG6=<>}o+xqM0*7qrS z3qG?i{M_Z8A*LnPG%;vfplPz0{9U6Xb{ch`+eLTMO$q~VQ ze4n?N-TKOAKkNIF%9HKJ7Bha&x4*ey@vHZT7O!5H=#u}^Z@yjc>hSeRCnu>^JnB^c za75TY;r+e6cKpZR-QE51;qUhrd10z7VaHrKIL)Vi>YbpTxFleQd61E0`muWbi3Rrs zAH88aY$4zCs%wMzl900hoQK((7dKAY^5*i3Q+ASb&qd~LS7&A2pBTRW{VzecwGY=8 zm6vT^cJs{AYJXFSb;pmE96y$p|Ka2JXZtR`h|m^Yb~XR$hS06I{xa?RR$>zK@Uz3x zM|XtQtiEN^I46LQvyekE{NQy#`pD-rsc@O!_n5W+#)=Rv7FPDdb(^(LAJR&6 zXqh_Qewq8)G7dif*&b89$`udE>nl&TWa*7MTdQ8u9RK3GTFaIwzluzgJMo^J=DinV zKm69@Xf##e@Nu>cmppZPuK2dw-PwQf32*T@8qFZ?(@`BrElVdfC-)|Yq=LLQ(MO_DRZW` zCF)(`E3+?E>)J!Y*|QTiB;Q(SEyXjlCwqylZeIEGjh||iZwG&vy4yIL@w(8$h40jb zN}k{KUU%hc={n|1H#48FGuz~~G_~iSavY9a?#rA zJvK`xZ!dZ6Q&qL;@~suer)DqR_fRTAxa!r)#zIe?Vo~cu(UO(e;;*f{K z5;-@M+_jvQ(wrZIi~eNZ++!^pDg4SaL@O`lY36#)3tKbSZS%8Vx4L+ZWu%Tm(ZoFc zw;i)e!k2qjF)iE{8eMoXAahu(9sMW#~kqOY4O`rj(uw_xolg+290a-O-F zy`B3hBU|t8Q?)C3who(=IhK9&h^}6+i@9~t<@YMpFI~R;R{ZwQS###d{P}U%ZNr+yhoU6e z)+}+o!Lj_YiB$W956fhq-?I4ZvP>Nr?(2Lo?v%dU))oZYvz9VR#f`YXv+upKbFPr z7k)N3=G@xu4<%_!4s4qDp8r#r+mj-{89UZ(s!+wQ8 zF};`$>vua2FMl}GzTWQ9FW!S&ws6j2JbXZHV!_@-MK0Fs0^8ME_Vl(~$$CC$$!?yYR_bd>|Tb9k6_`}I*$L0gKe)(y!uFgv}c>@ZAw>(X@ zA~^va&rQv*TWl5Gw(ZdA_na@e{v30kdg`Ir{Q2vO|G(w2pLkNHdJjk8kBeazQPs!4 z@7w!RT8JquZN9+c7d-;6G9({f?zERaKiS%8ca7z<*Bf4!&s+BR&mWn^x(~n4JNI7r z*U{a=GH(pRSIWp*+11Coo2|Xdp8qv~#YNaDzV4^$r_Y~19%PqKxV9#;L+niCvE#?P zMRnA5dRW#h|7+LSIQO>t6Rnm%fA21T+;HuBOHBK}yE~t|?YJf?#bv^Eho84p%%Y~| z$){_q6F=;jaUtM+7q8xZ!C>pVUsCSf``v8wP^G1bv9o>RgzPyj6{q;~D@CMEt=;SD zUS7+rzyD+4+OnJ*p{sYYoeGt7kf^)P=JlbkWyh1sh=|+YleSL#mYCRgv2%L~H!rJp z@|^A|A-6tqOYd!Uj+hs_fBMNgpB;b9y`UH0S6Sb3|KrCJQKvmhld_-p-mg|^`0$SN zv$|4~wCTx|n5rGq%CASV`6oX1^eQqJ=DgT)!S?$d&{(6gvNH2xw_c|UTg&#a9A4nF z*fGcFblbY1(svpJRVGp%Az`_K7G@Vee~$a z>e-*mii>ytj}-IpE4%i^+w)`Hlim;0+?^6uCM9q)Jg}->9#ok4T_oP|hV3%e|8IWH zp7G+w|D_>JQoK36EYA$21)e>0^I7!Mb1-j1L`C214Km!P=Nx4c5i3$} z`TXI1%j=@n)|eeXx4xfd!p;y9+PK!VxyOeoMenPg;l+7w-!`R~6g73;Z_s&j;Zvfv z?$cAO^&5&xwj`@Oi4u2lFi~7`HEUz)X|bBWU$5sWFJxq9ixFPDkZmWE+W%=UIras7 zfBE>&#N}~q%XyxfPv4f-zq~yE{rg+HWH;F=D_=jHwD-owYs?(Y&!;-`?=@%OOMKhO z*AtMF*1&S;Z=2xEGnIUMxBl36>2}$#QdwS&sR|4ctUG>ezh0aF-sb4+@Ye4wtQ*+c znbw`#J#FDNfpzU1?oRXGRCCN%)f3tF;oiNs6^oQBFLJFBy;C#C;C<}tzSY&u?Azbw zXD15uG4wW^<$C@lU)#R&R&mwIA0O}CZ*4oYfF=Cht;IWYO^Tc{FD(hXoAY_DeqP?U zrVOWyqg|pATeC#{=G*b^jeEaM?Mb#`ih;z12b;{o%YU$0hgxEZxfL4vL2lmb_))5|~?VW*`_m#$d9zTIo-ruUMM zJUu-f?d8u0?)z|vdq&0WSiZLw2mS_GgI2keXfNVixNDcyl!C7#K8+va$|+e0)4GKE8it@Ny=Gd-ebS`eh$8H8FYc=jZ1O873Zn zer-#bpRcd|@vyz(bAEmM(Mv@U%1}$)O%zS??pQD!0Il~jzh5K#P`6rgOO)=ncXzuL z51q|?oACA3)gQm_|L;pY+_rGV3Jym{#~T}y*`01x%AET1^Ru9kZ2$54?FaJQmOln9 zLrWL@Yqv1*aNEPD)8pOz{P;F)-u&_H_WMqEJ13Vd_nFyr=#W#+-Cd$PckVQp=~MCj zZu#w8dm9^>y}wnO1mAEh2d@`;8R@d$KjY*i)gK=Y^KZ<#X*9z}&1be5Z*{cVNd^Xa zDbTq9{WhOG+V6S_&1qGceA1xeL&B7)Q%f~-LR@D%Eexm%rs{AxBIE` zZvX#(VR!dbebsu!>i%^~j24^VoEmR;&=&tooByP>1jNS5PSc5el=kmV@%h9rFD^1P z96RO)a%S){AJBfti_2!~@B5*2ZEf`P6t&EqN6uxW9@ym2EVm=zCa>TNmM}4mwTv(3r16Al)2`_;vM?|*GM25iS$&mj@=2cJ?yhYi zOag6|m{`)|W4#x)-Fdh!Kx2;I^RlO)wjsNGO+vk0!JjRE-&pJvX=rKmVst6{ zxNqaRB3JH~%v~!LU$BU;ZtP%q|NZq>l~OAO58jrp8t#n}mHC?(M0p=gwPsk6!{YR( zvEg0DU8|0ZhkBWgbk%PbTyeeod3~m?fSiKg^UX)T$8{}Vv^Vv%*pw+#6zuKg#r5Nk zv~r6FgoLoHzS^a~|Ienw@7~_p$~|@J)Q+w$r;H2@Cue6{zx!LI4R`$);c6{vR=nl0 zV#f{%s_`6S;Xq;p1a`ySL}x-}jD3jscoBr7pHy`1}2S|IXs)NvEc0 zdiXps>zp=a3TV~tkMs5al*2a2TsXT*gsb(^;|?>~>#M`{-`v|PUHkjn(U+H(7k+x; z>Eh~|czs>$qL{}MCQojbufM@Dt@IA7f9MuX5w4}_g1IVN%HPMmxwBLF@-pAU&HQ#8 ztxk$z0SpYPs;U-KigBv+L5`qvE^NCpE*A!^6j|)ndkD1r@yr1jjaixQbur-fe(7WKAxd3k+!Iz9f;iHXXftw+DUzwg%!UiRSW z^!Q^-JSQLFnr2+005#cZ#g;81(q=ggSF?_OdV0F>_1f)8FD@*U-PN(qec>(8TI5TQ zJFY$QpJl?ibLUQrk{1F(!onNt{#Jo9sBzkv0}l_k*UHVCHA||hK@+rEPa?2gR_FAh zEn7rfU0qL{KkptFC&y6oin`uX|!!jP^~ zA0tqObHvR=QA9*UW!m+(i_7yjIy)>3(70}Uy+iAksfSO`4aEfk8dF}&X|+UwmcTTw zoP6w1l3BMbXxGEe#05?(TGQuMvPo}$*A(-__zh^axmy$0La`7n(Wa*6qkL?wP7Ch@ z;5v5X@h%ak*Vos(2L%b0SjFysTX6i_pL;KF$bqV>FFM!f3TWx*9O>5I*YW64(gvN| zdDWVlnmc~at5%%oQEgBHa)Mw{ET`h+lPy0#KY!fJZ}(!uUC;+nE4AwMp;=~(! ztG6F7H#Iel*pea0uwcgy3AScNhJu%uRDb`UH^Zt_>)V@~k5kkpdTe;PJAcCDQkJ8x z&p({qe*fW(&fvQu-F=Fae;-aWZJ6*)JECOu|1O4_v^+M!hgJ5SKCFkL93obq|I5bE z>B8r+Bw?-F{NHCCm{!K{u3mccdEIA^r&$}qggG|;yp!KKW%s?-tut%hnKKylhzQM; z&zbfu`+AwW(M~qA)#qMLOP}wMld)obYkh(K9b5Io>GzCU8W_$p{HcAG=^qT)y#X4y zQBXMWy8PwKmnY7gDKX;a;dA`2Xnruq?4i#!MUB599<$Akznpz)b*hH`?v5!NSLWsY z+mp*2ls}($=bfKCyZ!_p7Z8x>`LXZs+%vDURu|a)S2^al>+Z=tZ-NB5&ZQ`>3TJBT zpOs<0Jxce)osFEqX?NZm`W@&0-*cp{Sy1d{4cCv>;++YR(v#SG3yiK`3tMRLU**`& zANBhlnCOW;Rb2RTAJ~MZAg5hif#agRBrj2FAd)IMBwtrVDeWhb= zUw3ma>tgjgTwC`S&pdthr|7|jf*r5tK1r!tx<;ZjR8+z&tEqT~pN!klsX{ywR$QEV zPgxoIQu2;ZnD|&gLgrOU+=SV@_V%W~zDPewi3=^1obG+@@v_29zh`3IlKbD>>bbq_ z{_~W$%B?)hH}ff}=m;%Vzw_+NIs<)nqgJNQlg@L_tkymq7*)f!IM1)#X#34IH-2As z^O^hd-U?aU4cvd(`&~RDmfSs)wKd`Xw_b*Z+sp31U#1ZfAKqJBscw)rsXFr3=l%H; z%Z|&ONGVePEWAHWX`jE5(xSQPE_(CMx8Kb860q<4qIJuJ4!ilfl&oi2UT**Yi)_&H zJG?s&{gm4>Cwc#Z@S1p+qerY~PLI)Oh`Zn8c-YN)rnyF{grFvR=6wl6b?{+g6MgQj zz2M7d=RilhIEy*~u2!ag`<*vV-h0UWdqe*9GV|hw)g1ixzpOJ%&hcJ6{yzJn`9}G7 zvrMm_wD}&ww{M+RadGzVYw{DyKWS8bfBE){-}=jm_rLYZ{bg&I^m)1A+jZ6xjBf2@ zsNejrIO0s2&6X24XbxeUHBQC_ML! z`M>YlCg!G(CLTR^U;N2j$EQ=d-}9fx*H$zuUrdxY{;KCb!v=D z;=98Be=;ZUwDqtXefWRd`umDy?{fO<6&DC8uy~wOW)X65S;5m0xAp4BK-Tw5&+RR1 z3_b3ypJcsx&Xh&`pPy84^lWA_(B&Rp zk)-&EZ#L`g?_a+?IuzcF&)*msHeFxWxZT`-LCCcF zUhA`_i`JJvx*@mb-+OU|?@#Av?1` z4C{Qov~v&H9|q5_?-JEt)8usUefzeZE2WB`pFbSD`G@0=6ODTf?&XQ~d=LBTdnIgY z=eqZ=pT;Ye)vS3@UGx6#Z4V!>gH83%=V#2dnb*GQl6KQ`iRf8{U;lHt#IN4*qUFUe zvo)HB8vZJl2`exOmR@|^ayM^z{=T1WY;0_8f2G9r<5U=ygso=X_wHTZuHxr?FFwC| z^~$9*Iy(Af(ngLqd-v|Wa_N%NhW9r%HZugIrKz2NS75PX-MVv6cjVvS=WA2Md-v|OnSC=yje*7C zfpXE_xXwA*Cm$AYyjgc`_3EuAU*Q%VJ^R4D z>(||VeSMj#^YZi<7l_AIID$-=W@T;ddVSK_w8d?0Y!|N!MXxu{yQ9D$A|RmfOD6NB zlG26bpS~VylNGJ3e(g4wQ7hUhQ?xVYinyetW)?pmpV-!ZS!=O{3m4vxzJ2)c;iYU0 zEiEk_w_-~-$*!_{u*c3kq}M>)mr4Fh+>rnc5xv@b_wMOU4p353a(SyYHOu2yTwI)< zY0S;o+Hd>z?fdXm_Sg9b>z)}I7zA8-_xLfhyu5tl-OHDYPkgoy>1AJgec?Lm2M1qY zo!Ynh>#qe{pKz@W)6NQCebxCAXxjDA;lr-A{D-baefs>ldH($Q2i`q>`n2e+y%uM5 z|J7P29=7I#KdwL8=;Je?>D)O#8M_(@MMXsqZ|~pl)IEH>y}4JdUcE4EwV=HG{|jGV zzj_rAAJ5b1Ii?*|u%brcFX#ONAz@`BtsC#mvmCp{2#d0BVlQ$;t7D$}^lgbt=JZ zwqfC;BZ~FGa+J(9-zesd}xnmOY@ zlR)#q1cN&b#vB{xKbGKOYkp`JA&_Js!P9m-!Lj3Df`LR{Gpiz7^TC82ykad71u6S~ z%hs{yFc>`Bz3s0f=sd7HcVa+iXS}+ya`C-4>$YwcEiEnm@b#>2d_1X3+C1;UnVH5J+1bu1DJt(bt1F3!iZ0x-L*n4UgNJwR{NZ@z+OiYvZWOe&wOv$dYHe*jasK@NU%#qcTwOW)s?{cQ z9`BcLznCF%=IVuwj5j`2OnWP-Sy@@BGWn#(`s`SbaF`9RBM>>qDsuNP#vmwxx^RoBbQd>6BFiv@&*iM{+FqdM%o%J~vm_)z$UlrKR4P@9ymU^5wGs=Tov%r%s*dws_%G?eI%IlExa! z%FbJSu6{orxvia5QSeHZ>C&Z31qB2B{rOKmEvou>RNOsu^ZxzuCLED#!-7_Zl>GZs zsZ^w=5+5J`>)Gslm5Xm*zI=Gq@Arqp{F(|14XY2Pnn-!-O%DzY6%`bmI(_=&`Sa(W z{*|k|aLbk{3?JgEe|>owb76DTS`le!@8f;4lVhy)_4|c{g;^an%+04?x_o)(PXh^_ zDRbxQ&diI6k%`?`6L}>(D9GvH!GkexHzptN3k(UFlEJ&@;iP%<{MPUJ)U_f%A)z5D z3DmiEc5z8Dn(47NY`4sN4^0h?1s@+DFaG@hlDGaxzB7`Nl3Ow_tDXGvrp)@})1r4v z7Oh_0y=U*l=d|sOJKvjreO;_c<);+SEw5j{_FNcH5Vdyg+9e@cFAueHyF6KA z`TYHR|D{Wpy110QzNS0r^i#cT1HRUt9-fN|TWWq5RXy%C?>HgZ@chio!>i+GOq=Ew zy**D=>G?-3P0h}KAN%Wj5>#|JI*Xp35@m8=Wo4bCtE<~P#p~&cSG%~Js=vQeT^n|K z^U~$ZFVD{3XQ}o0$D?lj6PGVf)|T5@`@3wGS*}$6>?KQ7s{a4|u6o_B{GH6ot68t! zzgJgU)YZlH>C2ZVqH(o zQ&Y8HKDYnBQ{~t9OV_Wvb8>Qic{)A5sQ+n^+An& z3tIX&eW|i7FWaATQmE?d)$pBft*xv))Fu};CaTC-6f`_~^r&Lnnl(B`5SBc48L3rk1yQz{eJ!Yx-X061t%J3R8>?2)YjTQumAma zd*;7CKb0jqjX5?RY58qY|IdaY;n$a!b9D9e_~y=?n}>OemtR(x&Gl=4^(yP+ z)(#HqvNxcEHjnj{e)C?rYL!z+h)BM*=GRV+-{0OI2JOS%ey@s~onP+By3WwhP{)M< zAJzrFEU^j+4fR~a%fQ#pygF>{A<)5|EiEkb@)Hsmw&&e_basE-diVT%{aLeSsYoAg zC?yGxGA(_A0HKuKQd9-eaGv-@8|bBEp!M7n4t1`eSk)SiPXjW|8q~b{QFmTxe{bCR%hG?=tX{QBVe-j}qXA2!xOF)0wqML(VYqknc|!w3-tn3n zGtQ;i6IzaD<+`@YoEVl8cLO4ioV4_?1|)pR%S`PDvYnf{RX_4oJH{&=bnI)9*T z$r6=!N?#Tn%Q*MS6_0=L;^N{Tx9|UJ1Jwcya_9aqpKJd6?d|Q2nU~eh znXM>%f9w0#uSX9YV9*ikPPsL8>QoOOAD7Zn(^ach1;oXjlRlhr_WvBq;suvqCKyP7 zPQ=K)z3t(prQR_CRT97N?wxTqjX_{d>FTRp`}Wz*IGgt4$Bz#}f=j?5a6IASfokzx z7c)f8MpR3*w6-o>ytp|%J3qfX@?8CnHSzo9jvhUF;`HgqZ-0P_W+vGqDMp^l-amZU zc;`+`&6kVrpm99Vw$Yd!1&x>Y{ogzLY}&~!vuDi$ZSCH&b!+0uNvaXMuH5`v{Pfh+ z6)RRaI5;poDYDGxX||plk_Z=77GB-A*a@W+< z2nY)|zj>1*V_P-lvi#Yf@=v~Ak9YU;<9n}DZNU5`u6Fayo{h=Jl{7RwK1dyY_~+;6 z6KBtYnj?BKI~bY|Hi&A6J-D>g`;LTL_P@P*_ZI&8lF7oxmh}4C+6!4*XIK`ieShno z^Uhc8@(R%{vNitS*MD8GKw+Ke=?9)S_tt4XYhqpaTjGzUg1&zL=GeVeS5xQDyQrqB z%6ff${PWr$qN1W6ety$@k}ogw)zH#9G*Q`|C3Ci>rsj$jD<0fDb^7$gNr&as!( zve{Ain2jOf(h|=XZ{ND+=DuB#p)JBy^Xa5I=p@y!FtJOQ=jtvN*N;21^st(``sZ_f zr%#_2l#BEPDdv~T!ovLVQ8M#U1@8#wG%BrfZ-k$e& z6e=(Cnb~BVevU!lTzzt~vX!+pXfJkWT|$CFQE@ToL{ppZcZzqEyc7!GSRXLEW5?Um zr%$Wieg9t7$VkZ1(XnZ(-H*uQ$B!q!xv_Ca+1ptw>RmP*VNvAdiEd`R9zrVj%UmJFMcZ97F+vay29enb3K5=nzA#ri%ZcfvQJXBh~cIC>2 z4<00V>hW|J{{EKhm~=>eevK38(9`atPG!62is?isWOn^oFzsm4!pzIdE_&$&+R?ehIN;9$ZD-fuyT)Q(85*mEegpVFOb}4;+?XjQ5 zMMXRM)}K9lRzyn5>-o94(g!^v%I0{#di~mSZP;WVHD!K&{!=GTNR;}{KI?Yz;>D1_ zK*bMJr%ny5sj+$awdzua$)r?wK|xu|qLxLA7qixX-`20EqoXp{&%J8zyhV!_zr3{6 zd(un$&u5H91O*)n3k#QA%wS=cTzt`EbNcyZ9UUA&tFKPFx46W<{QbS9FJ5Ha>w8yV z@uJuKp2AcwS4BldP-FGtw#$bPJ}j6Jv~tOjBQ8~sI@L3-t_p4Xc88r`ZpnlR0+(Kv zOqnys=jzp~lQQ@(UAW+2oOVWGZJ2k|+G%DvHx6V^j13NUUb%9mh^Q#o$ol_vC%4G* zu`gY=?9#f}-7bG?YiqX@J@w+^wRT$Cxj8R4ZT(T;;pw^XB?T(`=XM$Z zNVG)QFJuRuxZKdt5V+I3)?&-nt&S^0`cB0@zTbNI;e$HmX}gjd@8-Femv2A)?ZJWV zoKity+7ev0wzeB?zg<*5v!6w&>10Y%(8`j?sfY8nA5PlnQKsv{v-u`ZeSQ7(?9(Ym z2hX2BuY29i+S>Zz)2F6cXIVQr(l*~ref{a*zq*LEVHdrWl$Y+_Ee+~(UpEz8xOcB? zV`JmuxUH!I-A9`YlaD2U+C%^P`uKXJ&HGL-khNR0QWo69WXsMvo?sxsWB&N*J4OQu z9(C)oHwSKRPG_{JZ;INUCkr}>)x5v!phWDA^MyRel-&{&6|b$0K7QBzP=d`oi~7Fg z`z;bZ?j5scNrB38_dc0K#*UB84Y9&W26BQrV%$c?#v6;D`>iWtZ~nOBa9v-rft=vH z`hS&Mwro*QR%T`}sQ#7{rx?rj_+!)33}cCYk?ZT@-OJ0(zeg;-=yA_=`oW44c#rq4 z`Vp{O4@0}hY~0|!eu157J)2!>50)Gaop-mO0Ttg69~2ryPSs k&ik_<=N&uz{6FKF*LrOWcy{M7FfcH9y85}Sb4q9e0LkoUvH$=8 literal 0 HcmV?d00001 diff --git a/doc/graphs/lambert_w0_errors_graph.svg b/doc/graphs/lambert_w0_errors_graph.svg new file mode 100644 index 000000000..222b7df5a --- /dev/null +++ b/doc/graphs/lambert_w0_errors_graph.svg @@ -0,0 +1,62 @@ + + + + + + + + + + + + + + + + + + + + + + + + + +0 +10 +20 +30 +40 +50 +60 +70 +80 +90 +100 +0 + +0 +2 +4 +0 +-2 +-4 + +W0 difference (bits) + +z + + + + +Lambert W0 function differences from 'best' for double. + + + diff --git a/doc/graphs/lambert_w0_prime_graph.png b/doc/graphs/lambert_w0_prime_graph.png new file mode 100644 index 0000000000000000000000000000000000000000..b6cd492b704b536290c35012849c48ae05943aec GIT binary patch literal 15824 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrZRz`%R{%8A8eIxaLxxhizz`}#P#oVUTO*AK8@rm)e9e25C zb=+Ci)1R)tir%|3v@L2{Sk}Aj&ZpC&XFcj`(%Gb`V8CAHxwxqCI(Kw*EJ@@L6r5TL>CzJ? zPab@Gdwc5ipp}mvC0STlEGT?@>}lNTlP4ROE>&H#cJ0LZ^W)!rJ#oV0$dMy2=5Z?; zux?d~(t{ZTrawO( z_utr2sI2BUM`QPztj?~kCavs;MnnvxaBs(xny^9~RupzP>K@@cjCJE5-lh@BJz!rWez3J-%Lc=gyrw z3LY{oTC_+&T)dr`o$t!IQ-6JPZ*OyTacP;78vbd+GcC>-G53|9(C`SE_SgUt25Sv>^ZfK8A)XS3=Irx0koA`f^~7W$}YYkD4xA z2v`%hS4vDwY=%+lslRK2df(pPFMq%G``jt1;i{^ttPBsHJyY8`scY|tL);aAJ|15f zw)*tmX%i+i9B$|LUeT2`dFmUcf1O4~MjHwryUnpK=i8ol*C``I!>wPAx4gW3Z`teX z>)oTGq>lB;cAq)pvnFCA)5()3JG#0Ktq5G4keb?h=8R9x&!^LORD4vLWuD*1DXezj z+O=(mo@SXyf&ARr*|}lUrbEj8HcfK2RUtRNJ)d8H?AzPhfk8n{FJ5HyNEk9rn>MW~ zS4=;S$KT)I=G%?r8{2ZF&GPT{#OkvHmipX}j-&FmLs#k0J zyh^w2w%uJ_2321&_I{VOsSp5pp@ETEKth6pK|@E!#mR}Osk!;$`gnU8`#PEIYimFm z59C1}34;ZPr26D+yL@MxJ$!X_bwPQ#`{6d;i~H;AS=iW;US3-2;qA@LpcB7O=GwJu z8JCuD%GG>uWH_*^^mW1GW4t}`_WKU~To=DzZsp3AA3l6I;LLB^GS9YpTK4z5<@X;x zJ3Cv#JWuA*rAr^aUXOo#YN~d|)m5U$`eeDYvtMg%SH7#RsL*mkyriB_)=Gt;V_)rW zshskcmsAroGd1VTnd1@?GNq%VLx91>!J*;A*|S%(e;;7x=U_;>zApCA-Mg_C78V@V z*4B&;Hh;fde)Q$##FRprPlNUJiWM3kk4fjh zcxGMwE$8FC>i3-L>gtRRH*VeHGB-DW`0SaQ-+a5+mt}#guO7O2GxEpp->;X6iivSa zOG|(J_xnA!y}kXzSFcvBc3d0A9UdNTSoI|%_Vgj2c ze`;C;9=+XuUyR|%BG+!0ii#cg%rE(b zuD^ZrW@kqS$KLNgGmTss1hm7~iReac5x92k+OFJd%Y3CLPMxZ1RrW?hM@OgRa&uGD zk+ZYSzdqYs_}DEmKVN^(o;@xlC0h!LiiFOcJ13ggT+J(M6=Gp!#l>*w+&RA;J9l#O z^Yh<*otT(-=;+av3oZ+L(+)}ii=jP@K~Sg;?lBV^Jd}w z|9*iIskqiuukB|JHnWHCQOS-CcTF&39JFL-8eM zEr0(0JzD*Kuez6)mrGdKv=5&@3yX<~DVdmr_{_J9ee(QycT*G7#Z9T+j1DooN<7W^ zb2%z2DnRM6%l`kL;0zO~jn&`t9=?00r=z2Dq*GYE-YbQ zGWV5sTDNYUl7&UYn>#x}x(a`P%T;U<0J)h#LCtSY#M|5zyeIen`{ljHpPIX60*4AXDyyrz z3m+froHIveVc2Td`F6D|41!`}YI2oN1Sd|Kq;%@ksUs&QDwi%?I(5<{r8#rwx-R#d zTk^2v=_%2NuU=_cmA(p@>#JAy>!muQ!-%#k zx_EkacJ%j)GaR|HGWhE)cNZ59ZEfv`PoJu$otvZi>C-2dxVU-m`qvw$pOd&%QxZQ# z;E|!C^5;*V4t;odI59bS@$756%kvoyJUu;KyXJg!{@&K<@pY2du3ZBaVaNMq1H;1F z43m!~9Bg7OC@5&yyVrJC>1#Fy4?jOW^ZsvdZ$ExMzuv7|OgAAhv2mVl^`oQW@h*{( zlGoP7ax-XXYaeEpuW4AYK*8qso6Wnv`^~Ws)S9~LkYJjttLu#|nZij)NePLGjMmn> zrShe7%}<}3Yt5)}ym`)?ITx1sO51!mz|8PYM*P;MRBjzz-O}5940(5Vu`YP@So&6` zdH%gMWwydY*_IjLB^th;pNMhSL3eVnlycSyKeNhgc}_5W;) zjEpYqC`{h-``zxR&uZVFFnwE-o&DqE-Q%rs6%See{Cd5eQ+0uKoS}J^4@z z=Z#IN+_$#p^MeYm-&_BFzoox>cjofDvj0La%4P40E-5kDmUDB_?X>dU-#@SDtG>TD zwq4P=?L}?et(WEX+ip4B+nz6fZl3Mx+3Wt!(Tm>~^U!d~E)ikj<~~{LSH8t1B`gbM zCbLYrzxm7=pS}9OZ%vpvvvbK36;PA(>@3sE)n`wh|L(9(=!Fe|$^kWd@DIbEHi&8vg$N zu54>7>)tPSbWP;uFZbR*ecJl@`FUk)>)m%ar$*KGC(WMC&9KXncdP4e+nU;1?V4EY*x$PsEDc&&v2UUakD~HyyILzy z!Zg%=5JH(^>wn}-rP+7Qnlr7OZN43N2kZv zbw+Q`d$~&@Hz()9LTC0rpHAyXY)opscOhr(i4z`wzTM8>QS-BC=l+(hv2)i(Z{N3G z>iyj`qfGnt^Xq7A^0cJsE5z3uD1tnqkD&zo-jeGUNu z0?*FOY-Zz?@>uIy{b~8O-%C6vtAW~42bx$+Y25#-QBoxH?NclM?=xS3wuHBLv?layM@bVU7Gjd))78aIqd6{qTt7W?m3K$uAdwV~5^5n(8$s!^mFZ@!jlm%aD?UgnM zHTZWu4__B^@X^ukhi~5WBpz;K4EW}<%x`Yj?d|!=cXkv$<$Lsh?yo<8|1xSkpZ`bp zmcXu>pGLQ~=dTyPa;xsonKM3L-re1O$8cTU-(L$uSBFLHEK)TxGAg-jo^zvN$r2Tt z|9?K$YyX(88@=rN^(=% zAmHliy6gVz)#2+G#qY11%C}&p-c+xp)`dTArq91RJKoc?Gp>P!g@wUk>$*J)=gyB> zd#p#&xa9Z(22g?P;p=5a%Os3aINW-rT34*lxI53I zw56qGLH6}^76lI&c9p(vD|~$HC98Alp~Htu8JE57y4=;*ckOLr=#|>c%*@V~78Vh4 z@x{r<`({`ctIezbS84O{i13RW8ZO^-VVOMFk zN!}d^UMZ6UEu6ydc7HoLSv~p2hD3|fS0YhcG8*MkNfcb`}N(Yj!pKr<8-jR zSb1iK;g3h%`aI{#kM&5txWC^%Y)wR?S?;ZbGcycdTw2PVc6L@PsMB+p-+oQuSyooo z8yl0^%ii2*T(oGB)cN)=k>}?1-aL@au*yEG! zI9bj2!s>AS8@F%2Ubgyb77IJOvYMLP_4jcB0S#x)`0V+1E4$*?%jJcCeiX*+trC^B zDmjoozc%dM>6oQKie_eFbFE695)&1Jf`S6V!rHdw-hQ<6`Mk@!Z#e`83WDOwZ?4tU z+j6&lW|&B&q@^9YbxR7=$6meNNKQ_UgP;HShlhv1@)_N}ef#jOTT&p?R|GCDS-kGu zv&WB{6`k82e0qBN#=ctXb@BWAE-rRYetBu>)hM$CJ!ZFe7OVgJJpX^fg$0g3KA*Rr zICpL@BQx8B)$8|ZmG4=(>Adsm6)QOSZ9Xt8TD-XQvX{5FpomDzj2RMpS9@fbNL5r< zE32uo)z#JQdYPJo#?yW735fKufK7W4r;zdXO-`DX!9yIeW2wDjm z+yGg4u`@L_^~Jrt)jQv1-s(f;FFQ@NbmcpP0^SiHQvCd{ADUtV6$BWEK~SXj90 zr&;zjo{1ADo;ZE_aIduag>|vkcUK&pG)c(C&FvNM4z2SM!_G;cxfTrTmV^>K!{Ia&K?Dx|>69!Jqg~-@m*2`1HK{F<*d5OiT<^AXa^S zRT{rsS%6^$;~v(j0s;kZJ{PcZXjJSl8s71*OgKfDtJ7%=EU%P2Et8KfZUm2T`anS1=$x_|d zRa#u1@)dV@ZeArlTf^T!zM|^q<1_K~C-jycd-LYaMWs!`eKL1+cTf3!X=AXyjP)*l zRn?=LyjO0#_IB4Jr%RqsoMTBTN_<+X;s%}Fq3WN_+w}KGwZ8cx(^Iiz`kSCEpX7%ey-SsEnXcTwJx3!ra`6!@ zhO;%V%isUXeeK5ad1DjTQjm2@uN7Qater!{?3=%&IVuL_-%|R&>{Q0-6b?xNp%>j9 zYKo;s?~5}VW;Zk2%-!=k<=?RfZ=Nt%M@zey@lTHR>P>yB-M?(#*K*meD+gYRC~PYH z8_UjMQNx)bcS*qP>yPM{M?w|OSPSrN+oZj6ru5B958G*ZS5mLNx1Zb5u_7)RbA0jL z$H)ElkFI>QUvM!aWxA6~$~Ot8?;burN2Yc^S2zV4n=I{BEa`9M7Ed~`*#E$(TW)2V zE-q>PBrgs|;J9v&VC=Gj&Y$jS9d8mB!tGt=0j`kT(Pb91{R zH>ZXE+E@Ac*}@$=BEJ9GzW4V6OeWv}16ta@G0%7olpUU6~p z=J(a#@0L%TKYzXX*}JFN84B!VPn=r+BKEufZiXEb0?j|0wcT-gP{vvCpy`d*JNfGe zO=R{e?QZ)0{kiE)(JMX8x(~AR|2&-)%Hitnu54u$_5IK0^LEaGfr6k>l;-!9 z2nktI{qJ;s`-E9Vq6`ABcuhX7`WvOcgn1obLwoYu^S2|+ZZel$bNKDHNqgnaH%toF z@)>WGcTbw79mJfzo_TF^YIsq7UmRl;3j;Xug>YRsA-rMx)Yy~vmj^N4v^*A{XZvqQ z_W9lK_pSb3b1D1t2DL;>h67Hl4xztKhpe1Z8GY^X;vy}L*Mak|A9M=+f88;Krk>ind9!`$Nl!ll%40dY~9-XCa9z1j2x(l zqs|EZ1>1WypMBrl+QhgtYb(_77jlk{js>N~?WdenK`C_eae-a#H8nQ3N~;*AO$*y_ z=Je!PKEa8R$sCdilWSbdI9*)QdKFU|&K~XFhwTMZ|~HGL(6=56qOc5 zr3l?EjB0Id{qg0p|Hm82{R^Gj`8araU7w$uD=04BzJA{?uB@$5afQt6Os}t>jkf7w~EIdxV1IAH-5q7 z$wgmV=GQSD>oxxOsk7tE1kX2|PoF=3d|{#UkN5TeqZ1hz8+Pxu2Dgyf&#V?da+ERq z+6j>BW*T-1Y}&lJdG1_Uy_g*d8}9Bbe*WOyySyco5=jYjeJjgEp;K|9!C(fL4DJ(QJGBWybT)sZx-=CiqUoN_T{B&CXwDy&wt~;mQ z`F{WO>c)-}Ju}W2F8ulV`Qei%IrH~?bZd2d{PJaI`Tbh)^S0mTw7hy}RHX9ZVvz(4|bFB{_JLXn4 z^S}Z}FNV3+>?WB?yQP#CRh><7$~f93nsIZJ>aA_L-En)XPU`1bAF zi@Uqc?S8#bj@ebhS^w{+`n;M?o-(#oBF${PP5u4+X=i7JE;pTHTP-&8Wv0NQGX;kW zA2+CazuF?Eq*R<9q*${3^mP5l{r3M3{QUfU;=Fl$TcdjC%#o3?uiN7{{r4&D^$(uQ z?`zz(q-*cGi;Jh;u2WaPo@wji^6X3sn;OWP>hJGdlaiFay}#do>xLRQh_)DYWXN>(ji||NogM~U?#h3e19nQg(z4+Rt>a zMwo-2ollO%s%+2xNfgbCm%_-qQ#oMns z1bY6BYrkaV5FEDuI%B{;`z22prrq!4ILg2v>j+v4@O4MM+gip;pBS>eZ%+MFYZg|- zbnuN+#=AQ^L1UJDG8O@A8CG?1HMsKn{nnKEtRr)6ZQJMN?;l=UA}M+lAL}m2NP<_dqtHv*TT0KR@F&VKK1-pPnArlzQOX z+fAz#m5elb6q7S<2>kd{obV<>LD{*?)Wt=uSusUtwbSyDmeX;Os(|Y|6m;FDyxFyT_ zFwr3=9+U|^58EnAMs0DpRlmRS@(sZQ7Z-zUpVX$P;+fcQcOw1+qd@}0gefY!Wt5aO zZ^)_#e*6$vpmm1r*B8dJw@il)rA&8mNeSUmys75P)YaV>x3@voy5U%FYPgF_iV2Tm zutDvvqSV%TwvD#c5-u)Z`VR_#`yL;DH#Tp`P57~B`PRHwAy1i>$L`jOEfy3!7HcOs zkws=kK|iRh+xT#CVy^PTs5g_<7>l1X-QE4!s@UaA{{ewr?j9Z-cWi7HPAY9*{_$~R z3roTcgQr!+E-q<3iYZ;czA}G%$10}7pytnJA_em1RnE2vE3R0v4eNSru5 zIaW|GaBVWjOr!k#gy((-?#gCdX0s@CDsy#l+1jO;^6Jf-22t$>N#h1N+lGF-NnquP z99PAK)il&M*ZtdBv~vEH5Rl<_&D#QMg+!Oed@!+)$haN0Q3G^njaSn#Sak7DtKwbBJoI1GwZK3s4A3F9$$;VChwj0zO$KLUt_fY%c7#jq^NkHU7l&@&Q03NN|zEj?j}DuG4aQ@)kg!S zi=5V5T2}IoC+FUpmW$`+I!snOu&2_&t?kXJjt&W@@3;0=n;+Y6B5Ss-Y?JrO*ozkr zwDBG|)_dUPEvJuL8RITsg`n10x|mPLyj3m-R#={A(#dszCi<3xsp)BlpZyaQKOp1Sa^{2rs< zyb!l5yt1oG?oOR@V%>y}GZM}nB4T0(7C4?VeW@42aBDkz+Bp^}QzkXvAiX)K-dQQF zO65`1I)9pbhFvV@ysg<&g%f{&5C1md*%`)jb0)?r3eM!zzR5bF^Yxv`N}U*vocrrq zf=Wytyzjp^Z{G!rom$l%T2tS6b*_+mG*2M3zm@gE_Vq?H6qT8Od~m)YD*AA0Z1lU5 zo4NORL}s7-8S0WE!lU@>_nNhhcC{NmPE`DH{ldfpt3pq0(F~rlZcig~<5KU&?CUAv zUM^~ViZ0)m`YdJIRT8-Cwcp&JKIN~k+1JFcmvPRz=(O|az4P|WtgM?(t11Z}7Fcvk zRE%xUk3~XGmX-&8zt_H;em?Bmq+R9gX=j^^7q9qJ_>@uOcn_Z( z%eLI$Z+(9ASZ0}rGkN~bxaPxYtYqZPqc}<3AfVFb+l)^(>h3%FFEuhB=(lHDzkglK z#)Z}8sy$XE0Zp139(i|NLb4^CzDI0I;p9_$*Sc&=NSWq;o4mYJ3)<@bzVopz<+7-e z`0?5Q!Q=j^w`bhG%^bU1i&@^PlcxL^X={2iU+)}%xDqQ zozfmwX!zlJ{DFner_Q%>zh?;!nR03F^<}&lHZ2tjI(P0ff+!obh7G*v+vw!`{R$USlJoT~H!-pIA`&}{v zf*0hj5DK%i`*f}Og?xvi%d^ubJ$Fh~{QmaqGB?*01FL$uACLWS{NE(|876xF3J6N?@j8o50`C78Wn`&O}LYr#xl$+sAO~)Rcr>C7e4d z1UV7y%icFlesD#xlYl%!b7iVDG9P`{&ZyYPDn0Td5#2GKDYFBhwlA5@%#q092 zr}5gFjO*gVzfGGodFt)RKi{M`)a(?B+Mchy@X8Lu2hW$cgdT4D#V^;cq}8tI5+ZA6 zR(@!SQfup}dBH(K1z%TfdcGxdvQW(P^URTv4c*)qmT*3Jx31))Y33rCW-hK>pD*9L zx8t>|illSL3bPxxr^|0GH&>jpclnbP1>0E8RmSO4vR^D+qEQ`OS$S$_(7}VJJooI| zcgnxKJayLg?Vm2+oauc2WR5{gM~~yupgvX8{J6^5O-!m2E?t`9Ewyy1W@72bMMaJ` zyr)mGUA;(2b&Zn~LwI-uyQ#~9rQ8>cA~-Mh>Z=7x3_@^ed|I}gU${#;9?>61ibI8ws zT3KN5;KhnJi63u>N(wr6tk_pr5a73iwV_XTVIcEL&4&CFwr@?OR6B}_rW7x}bb0FD z)w9hTPfwrft(2O=FmtBY232+DY16y}EG;#iFV)sg-K%YGu6o4AcIpN$zOYvX1p$4N zKTh%tapqA}Do)K@+0s6HwvoUht4o&~-{h!HSr-%dZB5?Ypk0jmu}pRUWlx+9U6!7v z^?zSwu;jjVyehc~nf1GNY4NkOr@lXZ)YY=>+57cAn>Vh!{nkMZG(K1U%TOF92cj(or)4}I9dU+mv>g}5G zrbJro<;qhJx=&AM+!`f0W8&PkE!WpZpK{Gv9~0=OckcA=%dHvd%iqLiHlMv5JaZkd zUVi>k?Te?qU*=u$yWTc?uB^Ysv<5{Nmrpx(Xz<6!KiSQk>iFaLeXpH6y*%#jTiX); z>c5kY?cZ~9v!d3 z?;b5Gv5bml?&~W!v#DiOsq+E0Q*m?F>KpXGOed6xa(rf!$$39(#>|x^%2~Vl8B;@&>g)odR_$TCbF*2P$)YZ1 zzwCmZI33-+#;*i-2v51SYwK2PYwf#J!os{3FqZGqW&Hc$*Znvdh8q^U82066@A+p6 zYDD??@LYTEab#li{*!vG9cLP+Pye)n`{>bAs*4#^&umdFecENTc8SZ&Ni6S5qO)$t z?OE|BdiQqr17WG0J_#Ixf`O$sZryu%Xm>ULI?u^cXWxaD$rb4A72{fMH!so6#RbRO z*xtyt05>c+rt}ch|$&`THiuND2yu9$Dk`;(B~ND?`cqd$HzgD?dNmv2yP@Awj{JBAdAu zg8JeOd%vyP%n%bBYiZHgal&Qh)dMZZdZn2eii(RL{@U-oJ3S@kz^PLovihVyjE`UMWDfN8`HmRyS}~QjkmAAyTx|*w&dT>dS~qapxk`=f6>c&(E8Dj z=l$1gIlFUn`iD0+)E~Zl+M8d0C#Rrpahq*dX>Kea-%ntUoSfo`(fU}GXB!{9KCMMS6|n)ZST)t`u5rRI@#RCRtX0d zL^OZymj5P^cCJ>sceYgAbw~cvO!sqA`i@Q3xBi$DHtd&@R`XZdx$oV#1(^8emH&USn4?|0HMHuZeLai)9Lz2Ebb zZPxaTR(HADJ(tX^x91*>Hn~&VTUqZE)u7Ew42z9?rZN zvHRkOUH>*!vzz6|^l!g!yl0(#&3|6KIo^k+gr|qzdUoroc8B~o2^ksLiR<^C51gyX z@E{}ZZXv^l!pCk~^6$%)m6ZjozWUEF2m>O0FFAuYf*H_POVg0GJ%-g#8?J2Iu z0Z~y|8|J?L?-#jg>&A6Ob(7;~bvW{WZHX5x_n%``%Ju8p8y@$!y*srE9=jO?srj!e znkmOOjf0#OPLr-I61;RSgWqz+LhKT+4|r?LdmO;%H6N0|6^j6$8E+ZudA$yRE9Kd0#$k+BCN3p{viVw0@V@+1aV2sp(lJDQZ>pq=P|$ ziHRv?dQtqEHEUQH3ZI@5y}9&C#A3Hz7KV?v^Y??w2k?^Fj~|cAg9?OuwcleI9eSip zy~;FAr%jlkz|e7TZ#78f+&o)t1`cs?ab+Ffmwm>&Z57w*#qK(x*VxgqDq)*q%Beed z?g)sBv-9)w-&}fUI;c>*wl?~htY`3PHa?k-FJDS3s>14OPF~6U{~+tumX%Muvh-|h zWC{xlUtC!^`AtyPn#99x9o^l|DJe_d1ZAB$d6KiRu+Z(VeQp`Ea7V`qy8t$|8COrP za&ZaS51E6;m_mH|=H?9EJ!}Wu%5>A-gH{XdF4tePcJ0Hw2cN7MCQO~$`uF$u$A5l) zE+{T`Zf4`{2}%7rWy+L6-O360*Y9L?|*bF@e^1x+Wwn08K(@ z=k6|lA9ry>qO)Pr5e`9VY3)0A?;f3JTip|}HgV?6nV?n7J9g~gke8QF%+1y9le5*@ zy@qS*)Ty1z=T&*RxVd$y&#Q1^VPWa8|Mz3@rEkXR=S0>5G-UnLVA)p(*O(Zfh z(rwL-B>B1@3px1s#Qg1kF8T2Jv+(Nh_3N(v-uL4XH=~1$UCoX@?KQWy<=$?YKYzZ2 zVNweRH@EQmeZN*6{I>t!uhkqpJR<$J-)4Xoi1tdGi=8}q(rwkYq;`IJF-AtlN1f{P zz*c?y_;JyiHES+?W9OF>;gvQM0SV;a-?u1mv73^v?%58}@cSnxtGkATOerWR5a<@u zH990TRa?!VrAI+u-`~R8x?9=3k3+G=qWD?QhV9$MB_$G@=Jf3etI zC5B#WuNr1tPyns}HIeESaO&vj;JCP_viM|ZXwKzjzMyr)A|fIjiY-50Ebe!?zAjcf zxBl<1(!2Y;y}dzOL1vie$IZQ->EY$o1+qk3KTgDnV`KgQx`)r6EsI`$YK~>G8w)Ed zr@z1dOU00=C@m*v=cBtyU$+Q2rKF^An46myK04CLb^HFl+UOs@e|NXEu>P2+IO+AUGC7Qr>C`Z_GeyJn=)-$(hY;ZtDCa*XK5dPd3kx^g9D5p z?Fe+<`PbB1@G=ywzRao@XfxmB5-MZ zOS!h5-m&ob+Eztpo_M|c5nkTjfiW>_$}=aOn`_O?07~+!*LbO_s=nN}hw;GW%fjc* zox6JLTl%><2k-5z{&*v~E&p`D^+}T^2}nt;GGDvu{`}0#%NAx|U)RxVTJxJH+0)C* zDIj3Ny^jLUuM3`>5Nv5{11;3<=<9R){_gI^#KUaKQ==CyS)#II$Bq}RRT&v84xWFw z_xnBPq$H)PZ*Mwp+=$ro=hNw3_HLeuyWCH_ntA0)$lbeI!$Xbil)z!@~UjC_ijYP1Q7Z*cnzOQ$6!_P-YyI)*f+&*QOR`A7b zCA0b(!R^zc+UjDud=>{{H?hy?9U7$#duQ z%59CDUl)9S<_p?1a`fm?P?=Zu_Ezgc=k}!k|NdUucjW&&tBm`}$;r&(;^H~CxA6uB z27=a!eN_^0UU6+r%ub=_=jUIaEhZ}3`tkAc!^e-aUtbq{xmwrU{Q3jiCKD;%Hhy`& z?Ck769}e?x*tTumgsSt2HogwQ-UTd?%TKT#Oc$QXHT0wd-e6V zW$UL*5jk??NW!fxnG)uCF|pGlmY%w%sHL^)(6{7cJ&w1x-S$+AHU!0 zzH#CqmK9gC*2L|-mD0w++|b&}DkCFP@Zy5v-7T@Z%MKno#I!bg`?QG2qe{xkAFs#P zznrJ8uD*E13J%?L5jW_dj)tIc#_U_512^YN(ouIEl1b1aM5Cae3e+wk|# z&(B}yt&iC$bau9R`}FXq<>_m)Cr+H`;pgX;n7HuWk2^0fFW2Usvdnk(q6G^a@@Gw+ zJo$?Kv8Zi1olQ+lF}urrx2ISA`ts7N{=NS^o6epdo-gn2N;81At_iFAC7hn7%d>EI zVM)wgZ9P4)fB*g^{r&aTi9@mM?Jdx_kHT(*8bSC(urvyS?B2=G*DcnLD?1|8-4G z&7?m+K0dmz(AkMYk&BzVb^7$_KOVNrw+NhC;i|8%|8hAKkCchWnHh%89EwM_W?yfa zK7D%L?Pt%QcYl0*y!$O^V6Mf(-(TF!%q;0}8?O_G;+3qe5(Wtk6)%@geHtcw{J(gxVUtby}i|$eSO`_xYz{@fB5=U6jbXTJb19GyeW2T*3^RHV&Um}v8z7pUAS-|Xg#sp zsx3v!{pJe!&NdTW8?{v^E-o(VXqV`&>!2XIbLUQp^N!YlfAK$l{ptc)c;JA;#*~vn zlButER()NSaeLd^jEjp}KYaQm^nUO6dGEHqd6NUGtIGKvtO{M-vVHsZjQjica&U18 zZQQu=(X+F&jl9-xi`!cznHjCEc;q*yakzO`$~5)~0Kv1{Fm z%PT7@PnHojKy)l9l z3k^WROP8v)2<&3xK%a~Q*=p5QuCkJ^Y-@k zgLYelv6vj8Y0vdE%+bZ=zk%1g6)g=DVmJi_|2qG*|MI2(=;zmm)fpHV7(8A5T-G@y GGywn<5fu;s literal 0 HcmV?d00001 diff --git a/doc/graphs/lambert_w0_prime_graph.svg b/doc/graphs/lambert_w0_prime_graph.svg new file mode 100644 index 000000000..96a0df162 --- /dev/null +++ b/doc/graphs/lambert_w0_prime_graph.svg @@ -0,0 +1,56 @@ + + + + + + + + + + + + + + + + + + + + + + + + + +0 +0.2 +0.4 +0.6 +0.8 +1 +0 +-0.2 + +0 +2 +4 +0 + +W0' + +z + + + + +Lambert W0 prime function. + + + diff --git a/doc/graphs/lambert_w_graph.png b/doc/graphs/lambert_w_graph.png index 627cda9a98a262bf2a2fc8d65ff73c19faf2c33c..0a9dd0527f88646c425d40f28789ab2720ee97dd 100644 GIT binary patch literal 16160 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrZR>n+u`tSe8>pa#ROiCx_>CEz8`G9NPj`V3|SB#>4wLfop zWxjgy&1K8$a+jOj*3mW9)iw5S+szh{cRV(DqCkklH{ZmBXaD{hT3Rx`(l~6(JpcJ) zN6YWO5-(I1-~C=1Kiw@bK){JZG2}tUpZk^vVy`;22soLjK4<*jt@wnmVnt-HfK!K> z$LcahCl19~dYp=iEdr}13J5uIER>=nCuGs}*Os-vOswYmy$xy!=xv#h5%Bib*2S^A z%d(~~+*SYo_x*~hDj_MUuHCz>gO~e-?p9F@QB=I*u{HO$Sg)J2qhsT(r86}3^p@?| z5%JbY@AbXv_pXaCZb&}fC-vH`N21Yf@xyNYeJeJ;yZ`^6dDPlzYu2neEmwbfn(m$t zhq!s_SMxWl8eEdR&$(`EoceAD|NeOZ)UQ~H=V`KBx)#341 zw{dcEGUVLbb2De>!Gwh0-`+AT`ya1mXgG0p{=S(94jecwXK!dI*zkN_bzj}zUxnvw zzZX28TOJphdu`d}mp8U#3VV8bnqJ$vYnPC;wD;?4YeQG~n1l&AE%KBw&y$&~=DTZE z?rW}v&FuU^At5YRcot5YBvkkJYj_*4blK6z^DT?n81nPquU@rWF*QBiIOBrCz1r`0 zrCuL8eE8F;*Gw~L91$;v5zbcA!7UaVJGm{?+BqR$+Qjc(b=mzVj@ zv8kL?`1n|0NXU^zuH6A5tuHSx-<)&P=+voG7haas{Cc^Zq2%SI*1WsBu11AdR9FZK z3NBf)Bp@;}bCss1Ca1f*d)}UpZhZ1~K6Q0=x=~vg5*{Dx4G9f3EO~LkYXALHr@Z$4 z`Q+UvZ_jsN`~5oagan1az(5rhm4bJ7EbD$eWWTjF+kL)W?U`?Xf4yG6a^1RT`+mPO z*0nBpz_9=CH)&2z&MkR&XT9J5f8LWPDSP(r-TD9D@6L{n6@kvBrKa}(ekg-frKYB` zu(J!x$(^(Pe&=wfu={PSdTN;IhgS>E-hITFmTxAq+=Po;+FdX3G|n&2Rtzc+9`F_V+ig z1v_@{)}Cu!9+tP`AscG|4_ou6v*!0_)Rp=9`7QgN_4n7;u0vdbK6TNNCJNd4Rlv5(EjuQp4maH>tnWhuDXpU|5wJ*OOu|GV}$b5F&ZV9J<|Nfm? zyZzp(IhMt4h7vrdj&ur(I&}8*ggkomXv*W`{n}lNH2(j(zF)*)rg3`T%|a$-W>5^M zYH4{z?krlm=<>@c#_8uYI5|1F7W{b~|KBLL`ppf)qgStnO4?LxD0+B^)iqG$>4}NT zpkz{XT6g;l+3!glTXSv(fy@gE3roA@9+>rCVE>$@-qW=jjEbN6Y`!(W@|on*-S77W zGd%tIe7^ZwZeHHdyxniNt+x7hG^$_5GHKhNC}#}?1&7Y=?qEI{iv=28i}w6_wVG?e zpZov+&d-eA8<)@3_3`oX*?Y|+BO{mD&$lY|Vw@7V*zM|yh3f=%{n%Xn`|Wn$(|+@8 zR=T*kY4!E>omv;W+vl`?TY!T@!=+WB+Noz}nR=C$Zk;q|&YBDpDOEMKXPe&7&G6|_ zRQcXAYX_&W+Kkv+ukP)&K0Di7-PU&RwYR&=-k##O|Kku4ARyIytmNm(gr8RO*8E4?HIJf))?e|f7mV`6c~8$%uM6L z(o)u**gfq0a%XmxzFx6r&6>hD$K~tiJfB}L$Is7y+3tGMfd~*d;)OV_@Fg!l{si%kM++6GSg9!_E?b>zi z?YkY1`DA2deAdsMGlyZv*K5&*<>l))-bpaHV$n8zy14nBg65l>w&mV_^!l}TRh3oM zUO9Gl_RH;m+IXeUSTW79F6Y}D=bx6Q78n?qc3jdtZw~AI(z{H|%$e8M$y%4cTe4SsKsVleNe)^6*@^Y}hZR_mWvtMp)Z)Z=ak@&VK zzW%Rh!$f8GS-I7F_5Ss+@k)gx-+gef`RulxS6*CPoOyfO+MAow&dv%93JS{K%K2MC z@ye04@%!gxUS3xCC%eo>fnHY2DinDFE1@M z-PYUDvEdi{wFX9Ji=rnSo}Qj6s;U>)#ajRQ^M|3Mzd!xsqoZ%`?w)?+h|8@lnZeoa z4Q&f9W~|%co0zD`aPZ*4uT}55&o5+UVYw3V{PE-F)vL9C{`_frEpuy;pqs?W`z>lY z$NOaO6rI+ssI2^WT)w{G!2w3IoEr_(r%%`V`sC@;hmRgLEnlvl@JAq6q;<&>6~B2l zk&m_2)Q+wC8gnbu+S2mon&Y>QdKXEX8(v>NIzKd*-*x)b zseyrk3vb<5Pn1__nYCg4zF%B>(}L(KUgp|9`))T(f4)^xux+(I)l#uWv1V z9d>S>ZFTJNeLv#V)YO7PLrafJ>1{u|RIlvm|F_%kXRX;?!MP#(`Z}?zTC>DB7pk4P zc(KCt+lh(F%Tl$&*DcwyWy+*ULL#mkPgQ>Y^y$Zw$^JgaufP7f=gTE;2AfYOl$X7o zSMiAR&fU9}ACHRP++V-{rlFRWmd>sm2?+_0z`%*F=KE@EYhPYjDZJcoE|UTG!aiB+ zOM5Ddi;9a2OH0>Ie;)1R z%M?3dX=%CayODwdgS)#spPWrasNl~k zU$^t!`hCB;4mPuYK4W}7=Cff-?qq?iCrQc4p!Uqi(l<8@)qG|&EMBbKZ~IMxnT?=X1FOKNA03aOVGbnBP9; zYMr?L$=3Gv*;~c7M(NsCe`D!+SdzKCCtFlP;=}|+XN!st3KJ(zba8bxEPCP*SNrv9 z)cc(gPKz&YsQFoR=P7M-`yyWbneO}b{k{L~ZMmKv z9t*Z?neypVkz2pq*+s715=JQ;nVFd)Vq%jfOlX)tU%qOuoV~q08;?XnS@G=zg9k5P zo@`)bK9hGwyQ^vQX5+uVz8XuL{{HdtF^`PJ1XgabfPjDl2b^?Ua21%=C8>vFT`=dWLTXJlvytNHABb3&lLd}mbt z{=a2BY|P?%F%OPO=cnA;Q`sYF+;-}e*RImnZu{&0`rLl?wd&8`zn&f*2Cvg1kAd#$RjZUVG&<~Rf1OC(>$aS0MzdRBzyh8XKl#Hs6k9g* z6)l(<(nX?kPMV<>c0tSvqlCJaXbjA*h?Frl`^);AAS~1mav) zsXiX5Womjgr$~?Wgw^!(m(TBSyLOP#y#HB-$)x9t>@?=+Ya8vYN;qRMXRglQ^j#7b z@#{l7mn{=7C~ltP>GVQt%Cu>lN?%`-Iz4&vB+kx`W##krcI?6f2{@lsQ z+xggTtGD6fCvSK%R$K~Q7274LuAXip#cL(Ka`i5+;|rDTg`~t?=4v%?edXHY z;&_eI$nURXL-fL1OJ}Ss`oL;pVR<7g_G(lT{np@H}AmNt4C)o zjXHArGIO|idS0IR$}-I~Kk){~#tmZkvZg1gt>(~LwV>2{{p#C_#=>RqT4Hx6e9wCv zUTJx!M7ZQF*W25NZ67~;Hv8b?TXNMGUh}@O-uZpjH_=1)Ol}H%`ua8X`@6eY(-m_f zU0GFB5B~p`{>RI+(KubfMyBdpOLSgicwD1itb^NKfk(4UZVCu3YCGd|V4cNj+`jc<`p-gc8Ah?5o>6ReI-%ikd*bV`A5X<^?2+{HS`cmi;yS-vCCj77 zCqrii2eQu7y{Z?{vCPxygwxflSJ!y^Jc$Wg)-qwOW$i5qGimcfyGje*$s9R$Xo2I0 z3(m)WTb-Rf`+ac8?}aS_yv|N1oZh{Ar}O`r^szg}N7LjAayIFGi~IdE{jusc=XM1n zAvXTDetWZfw?BRi-0h`!B-Mk1^Y^FY^2aXx{OIoC$L8+t;n8qht~v4Wg3|1*+9FO7 z4o)67%=X^9(V1{o>c{)~-nDaQ=eG$eKiK(P!A@>YN`;i-o2e}mHrR^mNxXmg=f`5h zimvWn+w04G4BPsBoHSe(D=Mnw9RB%vLzU^8h{QenAHU!@+H6gYy>tI)Zx3*FW!2yNMX3GzTZL7z z>RV55w7+`w*tBz-QjbmRZ)Wb1%jH?j$o%AApMY;q%LUVdvNE^Tr2)Hnc0bxv&!49~ z?a(RJW7Rg>@3MJMJ8)rPfvECKZbd0|PDSpWyLNp#wR(M#g>Lvf;a!ssIVE4H`Dgj> z_xIqNo6Yxp6}wYsU2*%`6h0@8(i10o7X4FIKV17=vU=m+{r}mO-6!p}o;v5h+QGly zy%|g$j~+c5v!mc(PGo4PXlrY$#6Pp@oXSee=jZ>M+U{JW@#f~{_Fif8prD|lqs6Id zX+{+v68K~+0_=}o-#owm-^_!}?AL$no2|vE7-)a$bmG677dI|ejUrJ+NO3>m^b^&i;HQ(&P+9bJ|6$^>({2r&uN>V*8ckP@U;GZmIX_ew19?kZs%_Q zc>hpq$*fU8S$}s@Hw`RAiQS$0KoJ?%7Ax7iSu$gE|0Ri&n&T`A!fJy8ir2X2mPb z$08i-_i-(DbIe+`@$$j7+oi1KI@IzHG%)`8bXq?oJbd;vRaI5S4Yj|^E^m7CCgI2my}!9RJ#tTl;p^+`mv6fCNABITv$Id0 zIiq54KYywB^hpyZGD=h*$h)fA69-|yGkM{mzl)z|O8bScQj*4DD%0mIq3%8V-OnkG*c-dp|M?CyV0FRw-J{c>O4-=F{J zQ4*i56=;O+a2qd=v>8vs<>mg&7Z$m4Z%+RC^XJTKvFBEWuD-E3oqy%Zl}nZ^*^qr* z59Gzox%>Y8$_`r_<(ieH)y&S%_Mra%Z+YvoHwjl)g@SsfIk&g<1~2!U`PRJtU(GVV zxn5OOR+^fcph2T|p--PbH?I3racgV#@sE#>NA51uJ>D;G&aKekZ}+ohv3vig-|zQ- zKETYsA>m-t>RM}QQBFl}OKa=T{f5aLT)9e%P1V(<4?mw4-820rpS)R_#fv+UZ%?(% z_4M#iP*rU`b;@hfq)DJ&_1)d&$1h&IC?fRq>C-Ro@5>wfJH-Cr(W9g?neg!NQ>RX? ztJwGbUUh#*2giXMLa*=bwFZqW-F~)m`MgEx=jWxJ)_ceN;Pdkk1y)wpwA((jOgcM- z)fZjN$N=>;%}$;?Ic3_kPmj9wXGO(sjoewJdhp;uhAp|bw;i*b#RYP)rKMrwAr`0n z4l~p9(n}Aw_cphFd(XdcVZjrQnxCp$G8dPn9`fUrFlgWw*Zc5#{r*`_Ck`KO_M2<9 zvG#YFkg)K}%gg&;{__tA5MXe1eP+xrCL%J!Zjb)+_y6spw`RHK<*mDEq_4kT>UZtW zr_(`$pXcUUe}1$1{I#k#VQZsi{#$c(R(;R1<;$5bJmdNwrf2K6_@B;BCQijfJ@e}p zUrV2#JC-T(?M>s+ZbhpoQ24#Rw3Peay?Z*byQX~kQd0Hx6{|x`%pA=Yy?gvj9bH{a z3Z|x4-&m|%xzZ*6@crX^_SiT%IqB^_Ykt4x@RgOpppL|i?fLSbpP%3U!$zFhNL~H- zquSX@oQjDdvAq9(_HSIexz>73Y_?3umdQQ+>aW_Ho0&oF_N^wf{#qJU)zsKzW@f&* zwe@s~J%@ss*|ZfaG{V+IBu15ec@fAbYjq^H{BG&d&#|{&ojiFm@%g#AJW?hvHvI;b z2WGjqX6Rjv-J`PN^2>F-1L%A)~Qpcd--R5d%0`|MwS^8Ew8?aMp?4 z^<~rZ58u8$d)O|ormETs8gY4h>*$M%i#`4Pj$OTab<5o^FE4lY_L|-37 z7A7PqdGgxY=$}s}`>$BD#-#Vahad^hoDpo!BoQpPKu4HMPqboqPHDr24VW$7^1cFiMDUWEVcol@1CM3<+_3 zJuNHzllb0y2Oe#$E-Wc{BF}vL;j^Td`mAyX92FjUNnZaWpFcK#pXqn26 z^75wDdopxpUrBM+(AMs5BTXA{$^VRG3Ey`Zcn6d7W)DGX1XH448FQ0$N z{Qd#)c!_jlQ74Y6H*PM^_&dY8TyNpRg+BA`=K9UGD*XTVd;HgZe0+RI%HDQuU(Xx6 zf2Y*z>&`wsAK5mhB_V)AV*Zt}|+AY4h{C(V3 z@6Ged?-}-06#V~t%<%rd8jb)C#VgmIIAxrhV=2MI7FYkbl%b7Rx~;$8f3CmV?X9b{ zW|*9;;LrG&RPj4E*tc88-u<}ZWP9Q2u(eq>Q**zco8Mme_`&x3 z376G=L{AS=Y}vr-tJm`B)2D)ew~Gzp;^I=$(^rQC{w-d+%E)i?gt@%?|7khD<50{A zo6Nm%nr?K_lM{lQQ&m+}xALV_1crr)$=Cf@_;Twa4H?@F-5uM^BiEkGei~KSSid%! znNj!Q^!O+L`UMUxGuFCzd8NhHY1tIypQ4{PB2y+rgbBH{|^N{lB)q4HQY%-=XXt z@#%o_ob%_8@7|ef+Y+_RobUGIyD@LQ&cp`v9R7AAD7I=ZW4L+w*3$xu98GrW-Ab6_ z`|--k;649-y#|dr9_So0^-?>TSHa zc5U>-pU-=P^Nt^LdStd$Tga(n^);1fr(U-_J)ao~bLtY$NNim#=)}?O$#HYDyIkW2 zgB7WAVu~#r*nPhh-Pvj+!6Rc`*0X7n(wx}4SF}@J21RV=`}Uq)UH$7T0jG}F3c8Bi zQ>RWfthk^s$^3u#-k&X>K0kc9{9&)Tf|l1@sg@1N@iiY?eak(nUM`*P;pG*yyN69t zF-1{dU*E{cSkmm3+}CHqRWDUD?n=p3`^^2!ow%@5SpCzT;`1|gfB*aa{^hN$*}Z~q z)cxjE9M#;T{}t5Wk(c)`DKR;D@?`kd^If9a5nHpahR$ESaPRkf)oCbonx(>5qP6hOgHLEM&+L`m;FIadfn)4Gp0?QHf>YM%b;7^^Xso3ulsV* zz4F=2bPr$OrK?u0x|bye>X_X-GmrQ0Z|Cptvci>)gnD~;Ja}_+vy5%kl`T4&nw;h3 z<=gV_=S6L+{G3)(Tl@0P&d;IpyK8@cD|vC@;jHY_XV0pdnu@xvtiCh3sfp>*rAt2R zSFc{}>F@viNT=|0-hHP|dG*QJdSzy2u6_Nr%2wTfo{F)t@ZPxi*Jd|w-kf7o`DxSF zo5q}q)sv>MWM7wh&MI`M@5{@}?CR?3X8HGcB>rzt9Wv_nwYU`46?tuB?8Hz)7x zG^jF(Ii6qZv|?f8=CqR6*UpMKfo9ZRUFlrt+&*dQ)YPn06*V=Zk{1`)R%V`_ru*di z^WslWJVDLT?rv^=yB`Z8yOpi2XJ1_%zB&KC9cWgR;nud?)A#mPpFDX|(b#zMrcFk6 zf4>B8PM$t(+NU$d=Rce^zdvF6boY>uDVa*X4cqV6%{ISR(LB>QJt!o^B{EX7v$Hep zc*XO%dyneS|$ z*W$WSE;%`CBGY?2Iyg2b^GKWZ>@0rHWKi>?fWdFRU2W|B&AOAOO=w-UYE{I(8q4MW zvHzrs_C{|wV4>5$rKx4EltBUmD=X`p+uP5JIMvnFZOOdcHf4&4kg)K}TU)j3>gpKQ z#O^uP7!d$vLC`!tYy}$M3tY1w! zu0BVva@zR>gMv>_Ja?77t-AS3Z*JVPM_Y`0Kkl2brA24S<(CoPzFwbWH`VKOm?Cd+ zkgK8H94%#K4r?)S@%GiLwO5C&ee~d9^OtvbZ*Qsj{q60NrAueVcJ2QA?e@;U-)>8< z*|%wv(E*E(sj(uii9bF(w6M1Re2`uK!a`^E%ijyPZi&*JH*ek?`}%*oUghd6QB6_g z=jRXm|3lgKH(&OK*~?W_9V2IcteYTEcIxWYsd0O&4D;{VELyba!}ss(J&GkSE-2Rh zd@A0?D}62D>z}>mQAI^Yb#-;7dfl)JfJ?>UPgIa4sadC0+d$r$VudRs$HIgmM-bhq`f46kQh7YUG z|GkyHJ}@fk)B?xmh@C~M+1J)QY!#1N(Vu_%-HE3b(aSYH{QZ8c+Q}*6X6^Tb4-Zd! ze|?>-PGr&3w{ATW2e;+kmN3nll6kY&{N9PR+wXZT_nYhU-A?D}!-oeKI5vOy`gQNB zw~H4odU1QZ{<(AKY(5?leoXYm_SMw)aXY4IyUd#>Ae{WO?vU7BUWtaM zVRrtO7kr|e%<><*Nmzxrof6}HG>I?L$%JF4ddll23H}cZEt=QcJzhq=2C0{jk`pby%PCjxnz%klZl&<)3#NMn2L%Omo&P)5_94Z z_27tnaj2Es#w?ZVcbRJBcguxuaz1=z71!qDRA~{=nk=wsLfC3mBdxBqd1u$}`S|t3 z+1Ar%vXxo{dL1X%Fr@zc^i(Hi$AmX;a;~k5^)4v*5c>Z0qeq9fWM2MJny+OQyYy?< znbXbo=`%zQ6}2}iZS58)TPd*Nlm5-=8Iu%EQcegcDJi|UxS0Lw)vH<4gLh97%D7ih zFX)o|i0#huGQmT6ng?uo%eJXWI_=xHFRi%r#*#}xkAM7diqP?Y%ha+XtH}RESnLjl zygW!qs4AwcF0pzksos+DMe6C(9g&;UKt0{fsfLDzdwxEfeZ6GQq)9@PCQtTV&)em6 z?j}#oAEtGy&z)YiZd#*vt3Yqu;y+WWpH2;b^|eCXe_qOw4nfmt{IaQgD$8x8SAG3j z<<+HqJGp@8=<}Y`-&4aJQblDp7T9O6{2WGbKYhsf^eH$RuBj@fEPV7RsiwB( z$NN*R8f?v1&t2YQDIy;I_Jb2gqOeMf&XcE4j~;YxmoQ1vky`upo*k#6qD!!XVv1s~ zn{z>d!MZ%TFx&q1`XV9`Uqzfa7FvPKf1RDfd9u0NspFWB(+RhoyPG!~i-@g??G$i| z=x>?8n|7h>bW+4UP3UEmBx~gVsZD;N4)2}{n zIUwP5^JbWBtANvrQ)x~wl*-G?*?6UnNayc4I8oW%qU?=?vRhBWyE{8UYx=C;?Qp*O zYtNoNC(fQuK4SlF`>SFnhQ`JTQ&X=7b11f~%E=SS-5YoQU^Ba?pWn0V@%5^zs;$Ax z{TK@l^O|4SobEqWJIA82vEZbMn-j;y7dL!3YCjxgUlX~xP1d?BAS$YB@?_!IT_uTM zUR*qK^r)b`ynjHzgj=a*D;6kNRENFQY7sb8m7~@orV|00*(@wBe*E#c{PUN~=PxUL zeJyMH(p3u-EQ;OW>Oga_eX`abo}P-9mNU2I-WHOQ@~Ww^*<1Zx&CYHfpRCo2*tF)Z zj)pBJTUQG>alGC*vyT%ru`6Ra3Dj(Q@+9Tcr%yjV9Omcb=1x92Nwwtdt*I9-1jN;T z4c+RUYoHs|u;_$DkyFR9(`imG-ru=<_v5#3$L`*hO;1k;wN}pNO?`jm_1CIz?{B*o zChog>{^^5+nuO4I+?0U=#YeX`-<;Z z9lh*t@9X5m1RC@^dD8RkCm+zjYS|wP$Z$jE*UzqQhvwT}X%$#>apO#ZUEl9jSH9hP z{l(SQ;(2*_S<{n^otz(j$%KT(hM59YUoN^|)jO!x+Hzo9E+pq9Zk82p2@DaLW3jMI z)QKZeR>;Xr&qTz?_$oMeIy;>>*4lDlXK_H_!ZKASj==vaEjl5gp+_gFdY|yIZ(O7i zWiEK{LOE zX_g2lC#TKtH=9Kw4D|YT@3y{Q``^~~7mwrOixC?y?Qdy6z1hjBLCU-_PH+CU$q3&DSfz%dX$N zc@s2LzA||Eryq~|e9Ns%6onI zZYD)3zscMSFI)(?SMj)4>h#uIyMAY6m`KIM#Q1<_Z==>S2jun&WvlY9;Zl@ZtS0W1 zdwW~zu^!2+>4_W7auXiAfl_hDud7RTXWX9L!I8uc@JPt-VxXKodc)t&yNMWDC4WkTzmxpONE9=RM+ zx@C4FgioB6-J63`QA!*-)SY%lqUo@b)So-%cND(2LbS+s_D!pVu{rtM&-g$brmUFa z?&Pf60#%iH``Qh|hm#WDvfm*zDH|I7NUOYFnao z&F@tx&x_+V=nT+}+CD8Ei6Ha@$pA5!Ue;vnOpLl2&u zWV7EY;B>{BQ<1x}va--fw^wm{Z}?M7MT52pC4K@P$-{Q((j^Uj?ZCBd2OLhEWE8FH;8t|m3o2qFBPBl;7XI1vk3DprFjL0OOF#Am zlx@>mF7DJ(^>{@YV^+l8D%0xk?_2{#l9G}nEQ?fbt*&_n>gum~lXL8jG3(rQmrhN+ z=C`=9fgzcLm33uMlYrBeZnc|2QIM5DEG#S^zFhVaa^fLQXgKgA{Db znfda(o}S*G@AseZy~#Rx?NoyqGo~GE=Rs* zPSRc2)58OrW%~B+u6IO)MDg=;p}SSOfBrtaF&UhAuP+a53-I#dO8@`OB;CP*q4xJT z)&p0sPVJMme)QxCXnlCZt`g13YQ8~>uVjk}Fzo-c2vlAd)=H&vOr1J4Fd`yj+nKv} z?|w>Bmb?2BAM{!WQIe}2-keZgxwef8Q!r+&!YjEWU6S#bHbU#t{w#jX{xtpdEu z1KTcKSm?aI>h_5f9wk(I-BdmrA|rx7b_6 zeG2|k!YZzwk)C{>f3BXvww6OtD`Go$u2D)Z*uHHce_gHfe<$UZu30f0p`oE4LBpJ> zr$oL~*%lTSu8G{t*6SAh-0tiwQ)NZPgI}WZ4L&@4et*@s4O$J`w|~6kTWGjt!$$rx z#g-jWzIrWt_U^s8A+h;Z>Xq&V3MbA?5fE~^v0m-}oC&tveAC#&S_QuOI-ThI`CHok zvX~P`wW?yu@jrhQ^!-6q(4$+P9FZ$FZJKm*b9(Wc5B~$Eu+>?-$X97;5%}ikbi#?P zx$(~)o06%bS<{_7IyNRZ2{_%*1}zxax%1<@>i31gK6g@gmzuYT=`L8{a8;;9;L$D* zj++}B7*3oG1!eCYWkOD6XU_Xq9p_YhGrMJi?B{Q0eKQnV1ipDWo#%B`G1N8~U7z+;i>g=Y1@{dvx8D-c|PMEEiTyy(12lvb3@?syHF= zC%Sb-EEmJs*@y2xdoS$7u^TiHnx3An<~PTq;t5#SF##=2aM7~EOvtHB&p_bZJc!F6 z+yGDpe>1&h!raOC3Y|Er)f7{n&oXbn6a+3svy~N7o~I;PE4J8zilNF%OXqeT#njXO zW*_HF*lj&!`s&zL0Vj~tL6fJ(Pd6U#=y;bP9J_^?X^E;z%Z7L%C$XZUqNFP;0$JMb zEGW}#C_K_q{2biVSl8P!VeaP-27F0Tv1>uqL!u?8qV@BqsXPm~zNSlyg9ngJneN@2 zFnu{FYb9E8E_8eFNYzrYWrMkpQ?JA6X_qV=ITGiCDwUuhr-A?h`}I*hNd_xo`55Zz zCd^(9*0obj-pSI^QY6yAz6>-!|LwH?7ugbPskOO#YR}F(*vbvg?$b8+`Ug&(V^cZF zEccc{{l7n}@42tODkLh}+P-|csP^Wb{{9jl0jC?w)ucg7d3L|s#a&-tztwwZ-n(}J zk)TY&k!b0@l{?_{=kxadIXOD#&YjDeUUWBV%Y z64n3xxO}}q_B9;_5!Z!_7B$6M|3BVqUi$R)`}$)iZ%PK_yS%-mRo)a;{o(4Vm`lcf zljp~u2-mI;TRZPog$cjY;)|QMzSweW>5RhfIjz@Dwk~N3&YGUIq#-WeHFB%9-9Fu` z>)be2UxrP;T~fHVF81`x%k{MadJ!8M9y~|@jrUAYbk4f_e0Ki6hwFB~TeUG}@zqBQ zN*!K52uPm0Z+cGj+6rPho=HbPsqQiUJ~`_A z_x0)XlRjLCeqp~MO=H^hsfNF%v0VGVY4f$(_AhVy;?}3%{BHkH{=%wbza~2W+LUqg z`<9G{;mLQmot2K<{>}Z_p1+Q3kJr7MS#R{{oAry!`U{Wkx>IcFv+uoLoyVP^GzbWM+)4l&MK1aQ-dU{myOV|6u z6CQ5A7E!+Rdv?bEc_HDU8*8pcMg3yG5>apa{(8^y`(LlgetBu>sd={5S+V6yzn=!}x|!0`(-U<){`~K+KcCOP z{jYQ=)&59zDuB*U#O}jcwsV)9AHX8=ijm z?)a6Q!)ba_@0JsXVvh6TH?rxuQER6aK0d~H@0r1sr-E$Xw%y7Z*N0aD(ma_pE%)RBE`FI-8vBwkqyPq{jAF0t?{xI2Q8^7c@c2w z(xr+Q3)?GRuiYN9_W2^v9=X)hVpiqv&fMEueKBim&dp7%{^w^szGb>ZJg%a#_V+hI zDXCN6-rmlv&EB-h$i~(-ly~9nyxqN1ricW0FLrL{)95-h zQQ19Y<@5LN_I&m`bm&lyTFa)*n|;@ATD3|Gw8QS-&-3-4zFhWS9X0)6g2QUlI8}XZ z?Zv65r>%+KKhLiA*NUj=0$=^-31@{|TOWV^?e_b5zZk0DY&;HHJfNzosui9#TW_z< ziziQ93JMH%ni;tNIyzro!aX}&q;O^{r!FV^K)~1-SF%^V_Q!83nza)UrY9<%|N> z=jY}wUbE&*&dk-TSNr}gt9o`ul40}3J%9iHW%Tg&UL3!_Zq=1ke!uy4XJ1@g{PTSM zKj-avcdzKNH^^F-ZK(fWXJl-A^27;;_1AB^Eay~QQtH7Gd(fHR_J}jT?UFLd=}WI>ef;nt;rhDRWvR2x^W9co z1uZQT)!rQY^XE^{UV+HXX*WX{Vo#kv-#Em^vB;$N3*Smke{knDQG`bGGy1F`a_4D^OHZ}#t z#lgFICNs11O_(~>_4>M4-}ukZ&Ia$+iK}|4dg#!h7dJPnZ``=iXP(W?wCF6SE9{ki zD<)dj{jqp{et!60#n8gHT3T8s&Ye@!(C~=bv`BDrdnjm-&P^^%)QMxE5$;v#l7@~E zy^AzNL`AReI(PZ9u)F)u*Xl08>hqZnWpQzFefa!&b!n`Z7gu3nA#cn?fkW3kI5<~l zUR=c5wP;41xQNJw)#3Vo{`~3a>*IHt-trkp32V>HWeFgJ>^i$>ETJxTJ!At{d#pZwKhIkt1B})&Ghv89y~~xswM2S z;=Dz}$}KG|SLfK*&x_9AE7~Bc9X4YvH$VS$0U;+3Z&1M`m7>M22%ZR__a5sOw2j?` zCjZ{=*##PX&PeLnxj0ZnWU98H6URlDzx9D7aSfjta-K3UFfe$!`njxgN@xNA_sc(e literal 16269 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrZR>p*U{dfH1^$i?Kn>3oypyr$jVq2Idkc@89QS( zAKjF<`tPo=TS?tv_txkHdtdf44)(bsWLg*>7*pWtk`m}}?ctw)7M9mJQw<-;w4ML_ z@xj94XVvHSuovE&b9aG;28UvcfYgS-|2sG=GNfEM6kTGAL<{zZIq^9#>t5ziY+2E~ zW(%J}i@>6HlZ1qvI2KB3Dk`=J%$i6?j2pOQC3yS3i0sZP*hZm zI)33!kEC(NjSY(X_U*Hdit{1rHb^ zBO@JN3hgR-%2ogGr#dqmk4E{=lP6Cy?AWm*M8n^ASHVN3zrVgdZsxbs_&R6*etYZk zcTd)CzjsMt=7tcnD0YEcyS~kS|LyHFMEFcQz&;|MBg1zNe?>!Sm<)4U>;eiMk!Jzs^?OZ%)FG4-ZpP zQw{6?)rh!0-1&T7^2bLzSCCZfr{BW@Tkv z=2KW$c;m*63#&r4`DCqJs;aDdrOnwC%*>`OTBNjS@#6enb=+KBKc3Cbx2XD}!Qeez z@95>rlNT&dShQ%-j*5>;+F@%HR8(5x_Eyb2`}=PB{lJ)*Gl%)@b7pO;|6jK)_qJO| zh{)O5=FgYUuS@#;?Cg#mJ3gFH?iUac2+(paEHu;(Uzc)wTkex5PaeE|+q-|iJ-^)# zh2wp)kB`gOvpl%6GI-hhs|OmHKYsnHs;%9<)O)&+goMZaeYM`YS$dE>^7fl=FXR<^XaYnPRkbxoZ*_0#9`_Op9` zKbh<=;xN;;dfTPl<@rZ%-HIwKEDU5gdi{F1r>}1)8^7EdhOW(0 zO~&8f|LEn*!9Rb!UN4%RoqhDwDKAD5hnJU@c2Al+H`nan?)UqGUtL|jyrQZ~>+bII za2XkyDQdp6G&(yw(;mC^NGxPHb*PnFG(A22Xo7);qN3udmBGtJ!o$NsCK*cbbgf>! z`q8Ubt9)jgtv&Pp^o@+sT(#Jq@J3h$+h6mr_=h&o*(O#UT%_e zBS2F_W5-J)V`F2{@bK`ZaeJ${7FbwXYOY(i?$nQuk40Srr~LR)!5Z-I>-zesv#y^% z?_XG4Y&_en_?ZuDfZhK;#Y^+=@8eo<yb#@c4x{Ik)_GU z`?wbT`0+zyu2pGJPHwKKwYBxr*X#G2N$)OyAIBOXSNkRK>DBP~P#(5s&CLfB0>t#= zYChMCBqkP#xH?W0+7uwFyU?{;O!N8q`R2C!zB%65o*%!t@VeKDyLV%Eem-YC^~sZz zrAwB$NE)a0FljV4HhNW5>?r#3BG5HZO6>z@_^;>RL++%jTEcqnzaA20xu1Ul-Wb-97c}Y;$e4X2+LTRtC?!Z=L9QMQBp3Q|X-*fs4&bFE4be~jH#l6bUB6jV|fNcha29}^oJxjj!-H);!m!CPs|>TfwKQzdxV zuC0wezW4jR?zL-m}`u+Fo|If94zehMbJG<)3 zi^k>4)z$sx?0BlPsBBWL6H`F>wE33BZQbJfK|w)Ig@qq^kKZjmZyOOEJzMVfty@e5 z&*zpudhj41tIE^Ub7iW9rRBvnk;a=d4<0;dl69pcc)4GqiPXkz+stZDtdHJ)?u|o3 zx43?iiIipaHyuYu$F$Rub~P2M_r9L3tf~?c5<2wl?d_8%Pb%u^@iiZGI6u#}u(()R zL7`!;b$L)oNQ%|1wQK%5Ud{aU$k$Q{%g7$F5zICQfuLD>Kv6(@RN7NidKARXE`iZ?=E-r9e)*RSi`$&-rq_VJtNs|Q+pa9&O17SlP9 zVe;vm_4^0UpD)jxrtIEV@bgouRr$M|TX(K+PWNXBTNm@Qe|o-wMBc8>k7>WYylkF2 zRrK^U-N!dJCY$RljNF_S7!VMk`n!4E+KYc`>!!SZ?>8w1VKpCv-s)E?mlqTiJh&PjpL%~^ZQAJ*=g+Ud zlIHC1@4so&CatZHcLy$Z+me5O-sR=~%rmA2%r?s{C@WLb)#a_O{;g%X|LF1K?4aZ{ zi>vtStE)WHW@mEj@2u_U=~?1EU2l#>Vbk*Yb+^_`2o4VRz3&!3Z%V^Q$Hp|xv8 z`TKhg$;+ou!C{TEgSt54I7K4$y<&S7VM+Y~8r35gSnT)R)4J*%pt(^L2Nmtoo& ziA9SSgDNQP^Pg;fJZNtCmH6jIa{tDpqg`BQ%X25s*}s4P&0CA6P8GeoyPW+>(XM|B zdZM4ce0lQi_WS1=nb|pbcvLhrIu16o8|U8IBK@v-B~SCg1Cvy}KYaiGeEFMct-+U2opx6crcm{QYkCO#6Df?f2`f zJv}{B($a)PMO$ajmUde#Xl`z*I)gc9w7Z=4R(&MsqRF#yJl(8siQ1hMj;ZE`SnR*OWdnZf~aO;!l?Cs^%)YM$EeEH+ouTRe~ zOnz~BdH>5Sw$|2G7FO1a+w(}cqcI(ypd`h4`JnY);ce}bLO%nR_=~KqlRig82K5-sy z<6XR9LBoa(21-gwKFPgqAX8jiU1!Rs)#mbUE`NV-OaA?PI`3axT%37f0b^xl<&)>n zFE4WCKGrYq-!EtDlYNYto$tuCYty!DF>$bcwLWmMn?_gD)TyF-tG}Dc^3}bqHmUlO z@#^~e^E->5dw6><4qooJ=l{RoJ<{gq-u%_+@3kT{+ktUmA_e&sHOO7-GVf`AC)_^Wu31ui3K`! zi|J~W?)*QYERjcU;e-2oRAsHd?K(MUYw)k7B4v4ZJ-$qs80EfFjEzTwZNaQ{kJg$t z9}LJ1*SLPE@5k3AaX!b+?`JhL6VF@NqSScys-W+SKHh?pU$#f-TUp(DqjmUs(4~mY zS**!&^{F^bbTzTbky%d3qXJ&V0V5FG%;!p4*e= z7Pd9*IeqoFQ&*F3o!vIe@C|2A9#qrkzkNq0r?_~-x!qlkjY{tBT{2P$TedG>(Wvao zE4`}!?VCWY%HJIE-+xJX-QnQnU94ig@sFgJCX*WD`a6gAEc#}_{l&y~Q-{#6-+#TX z<=r|sD^xq<+2ezEFWTlCg}>dpP%a`m(s0ZFT#$d4Up{z@Yfo(L*1jNJK2_)4&(;>M zig)Gq@ozuk^7ZuzL5r%8zn`CYYUs6z=`N@&=HP0YrmMKd`p2(Tm;deJsto;UnD*K} zriuB&60JoXcTbsCFS#vL^?vVnoubLD0^3#0#r@`oaX)(zxV7Nh+veos3hL~$%vvu5 zY>hc|IPs1}#xiIocwyVxU*-DxYlFE1lb5u#tkBBL+)%78W4C7AO&O~tb&-)PQ!j7Ry;CNw`Mqa( z;qwHU=D%D0bXuP2tZUi#^O^L%UuhGs8MdfuYc@VUes$5!t=_t`_EsyZy4pU{F%hvU zYdP3_)xNg&;Jte$)qX}h%q|)17qChyRK2n)RNJb(H2w0ih_#D3yaPg(T?S*-FcTEgUINJVx-^x;vz}q6Cj!sND_t)ix z-QF)>_CAcC?ZpMgLx|8M&C_Uhs*udZIU+9uMwg1-&j`g*!i@j

        R1Ez6^!e)9 zm(6mUa&KR`bn;xAUhI|0w)bm-|6aZv{CbH~$Nq^zLR-&YUH#$t{13(W_&Oqn^X=W;;pYTbz3p*(_4Y37$Bi2b7w@V(drwYDIq^rqkN5RY z8JHAxT8>V=klb(E=HFe$)A3?esYsxtrsjv&>o=6?+RZjgo?6SQRCW06_QTfiSGaHV zeA$r|5);$Y>wDBrD12RvXI`G3vRluJXCd3u&dsshl6!kv+}NlC#9O688-Rr2u5%gbq(-|u+L zr{+5=#Vq&tx3?}XE&)M7Oa~S^w{!6GAHQ}@th~HD?fkshcdvEh_RP@V_hZqkdk&(r z4U^ekUt4?G%B}Up|D3?$pr8k*^{@W5m^bg0E|*?R!}PeO&(E(i^W3YO{pVh7;F~w6 zt*^eeqo*cP3jn{jcj^S>{XQ!rW7Zw#AI(4dR%^ICWixjziEuPR@=wXOAj zT`<3fMWK`K((?PQ9UPXkd_z{QSfOE-cPHalK!11lVhi=`PwKjS?(}Y>GPR+Be zmM}ccSz6 zg4!0Rr|BNPdw1?a=XRzIH9w1HnP#_b-)??(mg(Zu)6-<^>+YD`KQ3SIv$yK&jjh?@ zii(Oqe*Adw?%laxUtgb%`@Oi|?$G7Slb89)BJa!)NIx-`i6;$EI@9-{0Ri*ZeHHwl4Pcs?gP1fBvq~6e}-@adc#? z3}2rmyExCHj7LnjDfP61rl;+sxAy-7^K&0OSyE~hc>K$&tK8Ai(PnvfI+ib2=j7!4 z^5SCihYtmpqmF!?{fObxrArw%HY~hZH0R&1o4(%O+MmDv`Sa(;&*$?u{>$$DH#Iyi z@yUsaGBy&r_^m*(EyHpjO5TF%X`MF#c%Y7QMb z#89gH9yIJ?`~RqTynukff#2`<=SOvC-`}_QrqQjf*~cfTdT-dYX;JFwX*X`%m||7n z%&(K@`{Jm0{F8T$wOjfUcN!Tzc-(*W^n;d`73zI{GnrPd+)$+2BcaHuV)F3C3y+8h z32C#OgwxY>S=iYhKYQlZFK25}_C{jm%9Ve<-OgX;Tgc!$%S6%I`gV?G__`QF+i)>) zaq(bAMizE<=4aUfeSLjttSkW`Ax9Ruc7p<;t_q3aF*N*e);#NCOUr@7 z{D=MRPkz18vd+cT)iC{>3=)V{r>&C_}`z(&8acg z4G-S`jyP5Pb-k`ZUS3{mpR{2Ti>Ie&&7Y6QOWxd=`0#Lh_^VO}-R*z={P8-!++A$D zn#!sRCnp<}YW?_qSh;^i_`<&a@ch)jZ#D-xIF&D2wCKc%6AAzR{9GoKb#IU5ym|A^ z%(I<6&$jx}ix(ME^0KmLkM&AxYH1ny?%sBPMd<3V)P2|PU)TEg=d-_zjLfMy?;joQ z{`2E;|DJ!pUVnLUk-2^Uy8Md2bxXQl+}mqiSXh{nmKK&}XFEwq=vj|j#8xggz7{dv zE5F~@d}yq)__`+Y)l}}53oCEu?dGknuGWj)l~T5~;lqc5qN1WR-`E*_W|?%d@k)I- zBJ4k5=FF43N?-r@a@oJ~^I3C437*t_*Pfl7UHR+f@|&B}`R)JzF@C@2Ghe^`KMTFo zJCE)jJlOc_>ucludp7@mJm!z9erx*Z@ng%H9~&}_6I^{}oAov|F@gF@>-YaVwaj;R z#p7Oct=P0G1yz-h>H7cQ%gnpDcwwlvMTy7Wj2C~upI*Dhb!|d^{`nIVl{@?Tj-5Y$ z-lX=!gM%gS?#y&-W}DetURIWNcUP&3ipqs0p2BYZa%X?P-w#rKx<v2<_ ztnP27yE}NfU)tx&%F3C1Wegl#T#vrruRnhBWaq`j?#5|nB=}^lQmXdl-rlxs@t<{| zDn?FDE_I*2E~N9o7L~rzDBJvPf`d!=w6(VmY;c_T^nAeSoF9+<)%^a5cXIwdB_A_y ziOP=;&Od%-XI$f%SH&e)#qsL;|L3Roxk8(>rriN+`Ba$%z0UZ3u@ zN%-a6t+79iXT0S6!nSO>`GzQsuAq0f`d4r*Z@A_l^*|%rsr1^ty{{(b96b1H;kDD# z4mL6y)a_Zus?rj+q+yGqYRL6BHyEAUR+P)?>b1r0zM_1ejgRH0zedZ7M6qzE`E|cE z|JPM5x@Pz#{d=B-jl`kD2k*-E$pl`nyA@hCxl_O?M7CRdpHJb8@E$d#aYcb2cbtJa@uIuY-YeB=gl@D9R&+t`?Jk`)^ z^S2K@opzk>>!XFIr>}00;Z|%p_u}0qTYsC6ENi2-Cf(eW+ECT@@pk_Hv#0g|LR;@e# z?Ch)S$K_9lu4xt6+P2Q?#jV)?>tgF<3}RR9S+KxivQJg&a*bELkJxyd3Lhu@E_+t5@c|mS3}F)3d$*nl(A^uK_f2Ardlz+FaBIsuuNQO6?>x{+54Suf9Cu9IKDF*Mq6y502-1*1U@Rm+#Bd*}Y${eqWS_ zUP4rLY&~PJqLx#+s!7fb1G^s&nD14+*6r%*k}yu=nP2nCbLQtAyJ!EuHnn2eo9e^Y zt-{x@3b(znk=ZOy#d1H(wIdmGy*L#A8Qz^LaNx3pWJlD(2_^ zcV^$#FNr;SDlIoIhNlAl*hN{!8S64s1Bd?e> z@$__kVQFb^Kfk_ffq5^!yu6%qXGh>`iH0c?>|%E^UA*|J(*Ax8^S5tN>OxM}zrDG6 zxP?>L!{6V0_P}LA>)MGu8qO+cVczF2B z`}^~S)%`-=@Lt)FdU{&n_1N-ES>_D~guMLy)t~;^`HB5iXx+Z5%R4UwfSUi8terv{ zX3v(MU;ob%G-K*}`qZhUV?C04e!ttDmONcQ{@lO6zt8%0>3b(8DzY^<@=BX+D0_QL z>#VNMh89puXkO(X!?nqGq+A2_tzNxYaqqJ`mq!QJ$FETJG-;5Z{0+n@O3c{FS^Sgy?uN3 zySuwTzh1w8);w(ujRp1p|E-DK+@=}4?7`c&zBM&AuCA`2wtLCTORW0(`c~!d&b+$1 z`s_4mS=qCvrfUCu)UD6K%d4uO&~S5e`t+)|n!(F1EcF(TnCVxi4rdIJ>nMM!mis|8Vp9gri(vGb|Kcmb$pP zO`0(yW7nJTm>8Mwcgy7&85wi#?haJ~S2Y!8hUHSLx^`DsNlg8ZK#3pa80a?&coIFcFfKJu4nxbMVK<$B|pJM1z<4 z96WsZ@RpuOkCNDUBpebF6y$5a2!iH=PfgJ@{ZzYi-k)7-*`J>~xVZn&_WMoq=U>Zg zSus^fS=ms6C+E(NiHV2XHWokktNQlF6EvizDk3cG{Quuy?LGD{=2yMj`CP)b%7mf( zZmIaZdGl)i{d^8;<1910yQ}o^?EHO(v)})EE?@g45HwQz^YinMyWf3Y=-AA5`pmVOns~U4aYN5Qf9sm#a@9TTaupBc(|7%A-e33k*Ot7yvmPJspWXZN z`ug~lKi9?WJ@x77Y0IiFD_)wJU0=`1X!GF!^NpJ~86P}&kYM)g!NFz*9vO=d%WlfZ z%KEaFR0}fSRU$Ht=R9GB6 zdQ>N7$Artv{b%1b`Fz&={+@?N`=w2@LUJYFp0<4Y=*7jwUtV5rx2yg2;Q%xLgJ;i< zfw~7@rLLb^5oh~1{%nkwhqtC?*3UJO%v&F{yK?O9?&?bV_U5Ke#D<3S`L$vVX1TW> zym@ox%gf6zZ){wAbE{fyZEdzrbYkMdl?kVca_?U#zhBFKU{~pDt-n!kZ*671@;B-G z{rdW)&)0hvB{WT2=F`Y7*Kj-UvQ?*mn4*#rQ+9TCpR9FSl<=lan-*1ne>caveBH6W zuH9+JdL)-DTb5)Z1?u{QuZz+AzK)@?vT}}fd0+AKbA`XYWIj7Pn?0dy{?<<}?(V{3 zV#kWl+k*OLM~@x_bq%-7^z+wQ*Rsri{<-AE@2*<8{rvW>b!&FwuadQsIT8(HVq#w0 z*r=SBmj@btHLm4GE0@{{2fm_xTXFeu9C- zhp%6ky7$ZVNEkM4*kJH(@AtUN7xSNP+_dRYyL_F3flMBjj!c|$B*y(wQXOw+5by`5Ity{NFqSx)*TPDN<-_rH*MRdSN`_7+vndue$0@&zCM2b zudn%Uw@-V0p7)Y+_idSQ?K5*Y{q1?{Wy3UE1WKn)3GlV9mkV3lR8;22rRWl?pc-=d z+4=DIQ>wUcm$eEUy5zxmbxSMvRqrnxiY*g_Rs~jncM218am}3T!l77l@KIl1cV}nf zMWMNJrQbfEFSs6?kh`{2NU`MtYj?D;mX6Mn1q$)6CCtCQUT=^w;hJWPfRnjSo^Qs9 z35qv%R(v`<$u-K|aQaM6c0Pyu`=ZnZojC4p*kP)8_tqXstI|ou%`F0ttb&|OQ*WE? z3|J}P^rv@9fbY$n!n?|@TD1x|z37?};A>eSaBCZsdsKGD0`JJkf|o*DG8UE!DVF4^ z8F;@ISQMps;D4TSUZHBqn;VAT-rZVQ%2Ry2&(VS5M#P=%(H&Y}Yy&<@Z|}VIrhfaD z4LkgghOQ3#_*MM#mcGPyPdqd3#k>}AdNJpFeEg!k6RbJ~^Dh{mw>iA#{Jv{eZ9AW& ze3#);!&`7Uk6#TPv?GBo7m-j6EZ#`R~cT~0D4U+^KA0&x2$Qp zvBjXqHiG*UiUUXO|f$IPFc^x^?QWrAw=}B{00nS)EpCR{uAB z{i>%gd$)?-h=_dmd$Uo)+TN%8>=m_~x2t}c|NjrWYv7i?K-HYwg)2N>i#TyCwBMzx zXwGf5^YS^qPoKB?DYgjwQf|+<-q6OYXdMkv5#(fg;HIQr^oxmcP8=WoJvgs2faX$m z7~Xv+yeriH?-yb2eShO#OQcDeHoZQ#RMd&%qj-0;a8Xgwp{<3K~oH+hY6k5f2?_R;bJ>Xcb zU(%9wVC(0+%a^vCRcsNcQdSLN=3)Erv2kcee*RtM@6WwnzyI8}+}j3Hy;tXM z4Epx=w)>s;uebIEdVPLY@M#Iy=6J0TCq_obnr}DL=UA0?Eq3oWN;@M__V$)*N{Wh} zo*s{!&5ZN*|L1JBx^Zty?rpQAy1$XHC6@m9efZ^Nuup1Nez9BF(7qf2k-O|;4@YthuH`H4M zwl8y%Z)fM1d-8hyezpb4$NNCd%{$fa_ue?MJhRo(y1AQsj@8n2qMV8?D<0S_TLa@#)j2Ro2;S#btQv*LrX%wk&8;P07vm z&B)Mre7ryX<)x)dmMz;<`@2l8?nmOJ$&)3m%hs%%;&-C2e>N9i+hTV}Vkz_v_c4&* zG0D3#qm5TODL=n|>sHg&*495ipU(%4x0Jed3kor{^JRiE|ChywtV@fEif(MnmEO2< zBWM!1`g@*;tD=HJL*3tB7Z?B2ZoTA)|v zT`3`EUq8OFVc|8yyc6g7xwx-ZbDQR_ zDwR@fxe(XtwIX(R*_Q0<>vnC9uxVy=a(;M#5tOYMc20Hf<>sC0Tja!1*gGYFmz%e> znH>@!3aTN8Z*2=TKh6oRVG7^gTAA&nstT?R-bTi7o}FpjE*~2GKcDBpc z&A7HUI=teaS?;X~a~8huUKyvou=?Fat4;x@4Da%6r}?$tBqb#!c_a)Ps=mIuxU)F@ zTl9^rW|=t(EdpA1*K+RtcuacPett=#7W;ocnvZsiM_)O)DfjlF9!YSPc>6NX_r?37 zqM{Akw_mq%o65x-nx8j)_G)llIBlJG#>GXhbL?to9ha;2d94w;s;)NUUQFI=g%$zR zeU^Hrrc-}@em;GcUDg$inwlD){_yp2XTA0J9=WwO`|PsluCljR{yN3(237TnTY?{} zrlhBrAJ#66-+%J$_4xXyACJqY|NZrKOU}(rcT(*>olrh<bN z3Ekb?-|v=x_P@u>&Ijt}Y)(BrjZ0L(AuLQxTt9Bl!{XMXR=NwrHrRc;wkh`ahf9xt zui|Pw`l>9+ySDzA&K$daWxmcWEyKwQiq0ammS9lR0bd+}N3_Pu{=J|MsIM zt#0en)mnCTSrg}2GS_$Ow+NKBz4OX=c4lUj`wBs}!~gxFrV0r;T?yS~=W_efNz*4S z0;O}OOlZ5cy?t*rBsEPGx)jjPw;_K%xbUnBcq*PU)$vA#}R1m$@#JYltx#q)>+qbul|4SJc;ict{G~ns<8CQTm-c)uGn;I zgGx4|#7ik_lS8~_n{BcL>3sPvjPHL)LV`lBbxMZp;-Fhw8lBt0+1~X0qiZc$%JK0U znvKQJw}2`mQ*SR1b{@9U{TCh{24&2SS*of_gx5x&R-05%|@8gr{@mH+emPST8o}LEw=Jtpf&Z}vPiW6q6097F?EQ6e^gk*Gnx3&nB zc2Akm$HIPk)&zk?c@u>$32G`Ty2L80E>YHvKJ@Z(K*S2L(UM}}PU+|7JoGr^xHkEY zkh^<9dHWI-P|UfU-LOL_YEOls{GQKk*9`L_PfsiOvH}#>i_%_fYT@GM-dXWc$<@_$ z>b&o*;&Bf?=kHtJ7Gk>CmD{2Y)G*`-G%g8uim&}DT31*1<@I&`^78Uy{qp@6Gp<;L z^>T7GB_D@`s&l!jNx=h$bMtIZ|NHyfvgU_Dx41rN)H&+-Dns2U4^S%LyBmAp%H_+K zzkFZjJNwdxL}%X1SN0rmuqbo_mE~ZY7;fIYxn#+b4>!~23(Cozd%OMqy3!?5!V)X) zJ+ro#fAe;$pK^=9RqyGlUtX>0O2{N{zMS5U5fcXV_tSg@dBqO$wFl9?MfZk%IR zd+W=O3m1b!rFXTN=Ig1dw5*WM+SAh1+ss38@#X zJg;WGTUN>xDE+di_>QTot1D<$D)DgJRLgbQ*Vj#%vSNM=D=TZvj*3p^-`^M>ykYqI zI<)$V*42HcDa#yBFEg*RJL>tDVfW3?TVuV%BBC32Prl~4>Ud}Og)5R$H!?vD&zHY0 zyS$kCt}bU@^*hT+lO|-Qvmt9ZLimZ#$dS3|GpjVqgk zxbhgir#Bt;EsFnrzHamLY-{Q4ulLUe-Jd_z@vr%oE8o>!QeUiViL3eO3R)0fRAl7b z&IjsrMnp$v%dU1~WjXQnaf?7{^ERr!jFEgMpToUB9z7R=LDX%U#_Q~tZ<-^#12!#5Xv zi!7=hdxE#nKfaNhK5(?HN$^~_4T0o_vz*xLQ*Cf0{wmSmz4I@`}9o^ zcDlkU7Vb3d(EWHm9|5NbJ59y8pT4$&8lQ@w^yB5Ryr$;L=ax^Ozy-incQ23SudX($ z`6^gOzE*MK2&`SwQsQHFl2cJ<}s{EIfF3@yct4t9sUOaw_V~JUVs4(vKe|)H*qFoK{s`Qk<7pbZC{p zp(0PtmveSoFIft1tgULFGU43M-_Ajkz@^z!cGx--Mi;s*i-p=hI#!$ zkg2<^Q&JoX4R1u;**{HS(Ynn$Oc(OWT3ygq@&Y;Wo}84~l)oUmmb@17^7MRoT)uwI z6`Q%%=bD3v+FDrIkS<*R2Tcu@#&#oxpTU)cmwZqpvInc-qnwXq4NvNx2W=S#qpY!7DW1VZ;+f2X7t#VFmlyzIo+iyRe+u_&J z5WV!&Pd|$DGv=(Rve;?nsA)K<_NGxiXXd3V)3qaCiad$GYUMTc)b3fnb%~13?Yken zTvRF*7%d?JT876KmA(+NdgAiqB}-J^?Rd=BCu7;v-_QT`)z#e(YZMg~Wh{%1*Uh?WtCTi?k<|XT7#?o`+Joo zvEn>z&O0CX%irwJ-z;|H=5_t@9M}E%#~vjK@xNtUQ2KjA(e&9f=N-FxCuh%Jrc<)j zrslJ+d`{22x2SYya(8#PMcosIwYN&N%5@wb9lXoJw*BC-Z^!HxUr&iY`RL8bWDApm zC6O0;>sRi&H*<+g%w3y|7a{+a|7v}5`Npkliwi~n?|J$xM)9pv(ay@^;&l_M{^>9X z&#&m(9#_BgPHOiq9r1!I;hcYClaiF)-rB1DUEr;t#Gm;dE!_1?WRwVSy)wzes#s2Y^``#0Ki}PM&AGp=x8LsH zmODJRA8-G7tUm7X^sD=)T7L_Qk`lDtU99oZWoI(ut*v~|w)5`4ye0D{>xOsRxAsVX z=8&~2OFF8*`gH8OX63feCtetS>6Z(5cjN!;Uq-&RduROkA^fy&?V0nppY8CiG58!? z_p35=XY%~oU!HZp3MKRRSk4WPuUvWO<08FaZw^<-z$r4W{gWn7o+_y97E-ludVF0Z z+9na;y2GGa^c4G^YcRaWUWFLZUpUS zVMskWN%d*p*^?&&&GPTXEPOg`$`p6AL?gctuWX-90JOESJS@PxI@<9)-R5WTU7Esyf$QZ^^rQxBNb6!&mO@ zZC9rYzK7d*XIhu*Iqdx1oVEDd+uO$F?_z9hY(T3_kM&48 zpPy&@^4{Lv*8*L17rtf|ZV_;b(E56S<@E1RP^Gh0QB|cyz{xlWw7M3wy%E7lp4grd zpa1vQSI|Vvv0iE81c#r~?Jn-VawX(guk`Vm#_1AfITGvl{aSTx;wqoGIJy1*|5;~d zW^T#4y6TYnv}gsAG zWzY(RYgW@%uJ z*|Sf}*Z(>Adi{PsAD^CUg{$re``bAF{q>cTn>+d8p;i}n_u!zQMWt)B3SVAQ?US)| ziinWdw{KsMjOC>D`+j-7j#wnNLijnS?f*ZY=U5iEz2E;o?zP7M6HiV~28HI%ojW5U zBR_sTE^l1@=^9s|}Uk6%FPuIU+AbeZ4{7ztQ z_|j`Zo}Qd$X3zeour)XC*<;fy)OkuvQ#0|?lanbaDI1EOdaZpNqG@k$|Lgnv{>__> z-|zh{2U;8O;6P*4aUrYl)!rvgo#F})zaDh?|3AlEO&M8PPtXi4Xq-PGVS!txOR7fK zp(UP^Evmoi7#bShxOp>EcBR+PpFbZye}3Hd`<>>^n~gyOOvn4>uUk#Kurum!=G_g6 z&hK`=w_BThWyZO=)|-o;`(1wAD{USW6qFR`ej;+y_WO0SfBdM}mUlO+ko8Nsot<4u zYHB8EMfcWSEw5(X+?*~fBy{M>NzlNP4rn*z+NiCId}n{k_tx7|`tT6zGT+(9?v~#_ z+r-N4bNT(g-+8l4G8ZLoS~YRXlp`yHm%q5RRU0&&e7F4m({;N~?fbe%Aiy0wpi@y< znJN2NKKte-)z8n*KVP|gUJ_`PXV%p&UTHJX+JUdHuAW|0cB8q<avRwFaJhp+F`7Z(=?IXOjWXeut`mXniP6TSW1mx|NVbicg4Jsq^ASWGu6V}=h$ z;M^x&oKEF_^K3l7zq|YL>S}TC>3XJjkN9&WdS201^Wfx+-C6XM%eLyvfph2jK;u7b zyicA7ahzT6~-VZC-ZrAzcL>^e%#sJefak6 z=+_ob9a0LjAGheOiQ7BNv6&6D-(gqT+pKSQo}8S_$;o+9W2V5OsuRyF7AhY+c<{_z z>+fynEiEmt7Dy?&_)athm48wbesgjvwp^Go1r%;)L0!g{3q4fjoQXHzx_ebF7pS!D nxn*5{_lh5fV#|uk|NQz3_6gg?{W!|Nz`)??>gTe~DWM4fdJVH? diff --git a/doc/graphs/lambert_w_graph.svg b/doc/graphs/lambert_w_graph.svg index e999657b9..817e96cd9 100644 --- a/doc/graphs/lambert_w_graph.svg +++ b/doc/graphs/lambert_w_graph.svg @@ -15,49 +15,49 @@ xmlns ="http://www.w3.org/2000/svg" - + - + - + - - - - - - - + + + + + + + -0 -1 -2 -3 -0 --1 +0 +1 +2 +3 +0 +-1 -0 -1 -0 --1 --2 --3 --4 +0 +1 +0 +-1 +-2 +-3 +-4 -W +W -z - - +z + + - - - + + + -W0 branch -W-1 branch +W0 branch +W-1 branch Lambert W function. diff --git a/doc/graphs/lambert_w_graph_big_W.png b/doc/graphs/lambert_w_graph_big_W.png index 14c489e372ca7491ea537373246694f9b1c383bf..699a23129abe885c93c23a4bb27f7701e2603f2d 100644 GIT binary patch literal 19735 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYmRE>8y>-ERK6&&9Jyf4w5X|}D}m86$@z^; z4eOQWG+E7e&bBx0a#bA{E(CmgbMx_*)GqJIc}^>Wm-|WZu=&lidHE`6m8Oo)o+tZT z?-if7mEd8!wl+Ha@lM0!V+jTlGtBejdY{KtzcuAyV|MSC+uD13N1-w&Cnt}DLBm94 z_eoQx99iNy*^`wAA};*tyQS9}n4i*qARb z^DQpboHA{iQQjR39Wie0ur&`>uiy9RUiJIZSD!wA`m|!rnvz>aN0)kGjwi3ByD0UP=dLW@@eu zU!Qh+TdwK6&)>hRTUyS%aU()JB<$|HySqL8{hv>Z&U?7)^}6IE9fE)UzOOGYjdW^P zX(`D%)WX>#Z+~yyw!go=9!@a0!m-e~ov-lO8Oa4{98;%G-I#coZQb5)QMY%zyu3U( zB;?2<*Y1qFyG;N6`{y&;tao<)zM0$aRdxUU{rz^Re^itdgQB8h+1B!9e}8{BPB|fP zuloI7sq>|;u5`Y=z5Vlzm~ZR%|2s8F)%(QBlOW&RDLgLwim6V#c<=)}*u=W$!y#_*np!R{u83VF zD|4s6YGUR7@cHxRt96f#aE7goa(#YoZuXmbzaKR7fB61A{mqSy+X|z%=cRsscb7-n ztf!-cW13#fYjrdb;L`p-}6?@#&t?QKX%h=8=TcT$qlV)y>E z^Yd)Ctv!9e?)TYmxB6r(Cw=%(aBhy};qdrc*WG1rU)(R96JVh<7RZ+XQY%vL27vp)nPxj@twbI$w*FBw`zwhALv%MD=yI zU1->vh=Z@Lu4cTkEm!*U^Yh2=-ksYitbXg(3?H?9KOS*!%e&ikGDS&KvlEnTUc7jb z_1VkcKmBNz=$8EZ^YmhOZOFK&v@QSsxn_PlkJHn1^`lPDU%Gtx=dah}i+_Ab^z!!h z^znJJZudJS1A`4wyFsbp&Yc)F|9NNL-Q69zr^4{#$B$RbH2;0Oov#zSYf4WK&#f() zhv$~xJ9(^E+SA)R`A`d|>A!7ZYom^q->-Fdb!82YuQh#qy#M&!y}#U_RKMTrUQl4L z*uDSR@Av!DpPrif<>lpe>AW2en_h1zdg>MZV!r?Wy1yP?UPVt*cWu&W4O$fu`*Pi` zS6Zwqgw_52r0zc0%&u*2Za#I!j1{}e-><8wshM&xA)s4af8Dir&HQ!&4YRDv*GZXV zOfZt_)v~aNVARsm@>;rd=}N=oV;T;utgM<2KY#sN<=oB}I@>=fX%QC>Pl)$4oj^G` zxloPpKf->totcWH?ySAcx& zmx)}wyrB(Qx3;W2b>>WnqN3udvuAxJdDujSgcdnDIbFH`|KIohHL=V5=B{GcTJ+TG z_73a!dxE#--VU?<`{goMfcJF0t+wAUIP+`j>+6Tctl7IgY)!;MhSK}B->=U2{_^s2 z(FME8-~XF#Dq~j@(c03YQC?ooy5hlu1ds)3XJ!QEN*br1TVuGkzrR20?yl0Uh5mLw zmoQy&!u}mQj4h^sF?A+Yd+Z&pgnCPXs z^x4_j%bA#&MHlSZvnOZ$+jDcRrv`cD-q{hz_-bLh+$yvC%IJVcUOJQVqKv=ufpkW@p;>;S!Lzr;j6>f|2us>Ky&H3-S4cPK7YQP z;pyYYi=CXDLVSFB-u`@iynpqzwb9xRM~@$0y?Wg)ugZ!FjrjQZuRov951)O#jaOP^ zfn3D{M$?K939K56FRr+@F823y(>t}_?{Wp~|MRIk_s;tL|5o+5E#~6l3X0ub7OES) zEuH9m`Mh7JOZPr(lg@eHTHL;B|5tyzpHK9c?=KS7UK$|eRKKa> zV^Zm-C!V(-+g5+mXg;_gC@5&v*411KJ32T_GcG9Hu6e)ze;w;_vV8 z+DoUr_5J(Wft8LOMG;vpzmLx@yrPr@5BJZoJZFK8#tnwq$PGcD!FcysoZp zRrvb2ZT6=QxASY;+uL8=o_{~<^IEQj8#Wl2W?$0@jfhxr>eQ*6^V_qodj0(M>(=j2 zEA{vP31WP8(OrIR*zYNt!B@85uZwCdG*+Jvlb;~<*O4Eov*y#|9_p1ShsEgs0_`H4hvf*BqWsMSoN+w zxT{LN$UZ*F#Xb#=Y^<57^P z)5M7rwGr_?DboptAcZ8!z|-;zpWp`R)?0pyyVK5_3zKmZ6AMs ze;>YaA&SsDCl^Le{q zwaF*V@;*H|$ra!|O$VAlc-Wdj89=`N&&E|NR&3b2|NEPpi*0OdLTYOESQS0#$ejfW zoS#2_T;W(aJ-#lI@zvGv_^rLOt;^RjUHScfe|+vvIXO8k4GoW@M~|+&x;lLIsZ*!2 z>chYNdb9aFs9eguwPoc;*I;{Ed-#R4vF z?%c=qKc9-TuDG4QfA6iDRZcG+9BjUNOy0gOMzZ%<*8PCx{`1!{Y|Xm5Dl7MRpX_QL zw&qjk&u{Nt&9(65<>m9s=gROdymKe!>9c3ctV&-knPRp3>!ys0N>is#U*6-k_|>hg ztAo5&E_UzNa@hOjlJ~Zk^Q+%kvaSe^t9-iWGd~AMKwMm0+0~%?iY5sM8nPB{s{32T zx}y61-s@)XCi~k3He}u2wszH;HG2|r``Q9R8~CNo*0}vPzgMx??e{8yuCA`2<$iNF z^=^+^d+PG#U{zJs*bUo?V>Mc?t&7dB_WhUh@6S)JfZ%058$s?pa>V6!*m~P@;!e*u zm%I#OT_GM-oB0FV#Us%%Q`FuU=g2o^3n-^n5X= zBA*vbmo8uS^z~IWHWr?IvgKmMKRX%odlkxZa&p^_huZVYT3so7^W@IQu+>|S+3eZ7 zH}m2m*R6#gKYny^cb`0MnpX74W+NIZOp!|7kzun7LzGKGWKmGydWSg8%i zxpnoGl|L(=#|H*BPM;pW_sXjk$K~ty+}c-fZ*R|_Bi5aJXPRy_!`mNIXU~q_tGoME zxmCu61ybijdsk-_uj3R}yV19wQG$o9rnYwV)i-CVKqc($*J0smlRFQ$^G}{RGxK$7 z#XjLly>7~j-TT)W?t4{!b$$H)ZoSt>I)&$0m3FnXusl0AH~Ot*etv#XaB#NI*g|EZf<4;ef{;vYP!3+3}*TqIeOGI zrC^igzJ$vfZ)Yl$Cs#;oH`T6xS)9Zr>^fTlbsLDf3!`RJGb{@hKh-ah{bKy zov;2#r@y|x-@f?yxzx9}w&vX1Gc#^))y;XY@9njIzvnaG>uYP1-`?7Kr{?q7tIO8@ zdRFo0$49BpYo)F)bZ%!`y?5QJI`)?@Uw*Z^ze?Zy`R|1D=gzIWc1-fk%ID{8uf95c zWo2;X^SR|ep4LZ~rJXoSSPcEGv6JqM}!i)&G1tz4V_@ z;MZIAf4^R@|2Zr4YQp=kZzfHi%(!;MKLe^NVk8Y&^WKVg0VABbSzXua?a|dFD*YxjB{+y~ncNH@2CTyagkC6b$fGb{QUUN+x^yIYi`sGUS@J))7`swPo6omCAUyiOl(umO``{I^vtS# zW*V`Yo14qk|0x9Zboc#yCOxm}l_ndnluJd01;e~~^BTS_eb}i!??8%?Vd0}AQm0q; zduQ$acue}tZ1a9O+o})$e!u_!^xgfRpPw6NTu_LO-Ro4Ycx7|C|19(Txa1pqtIfCH ztJ02(i?jLlVlk*iKTS9K(+TB%gM zzdZZ;I-Q6O4T*=_3@bmSMDO0Q!(y6Fq*H3Ds-~vqm-qMQcM7W;mAnWzbm-8Jr_?n9x>3^owWp~+I4?n-OzrVh!sHt7rk{SGN$78;Kf8W>Nwkydx zefjcaP`9U}gX7tmna)m5OxI(}Wlx?wX_9;EO4-}p$9koW6Amzdio$+5+ZiUAm*VHG zc=7h_*-J~kKYsn1`rtq#s8lI@eC*=JWOqIpivxFd7SG+K`sCrmgO`?ibMo+{oS2}< zBX2k7cHZvZZ*OmJE`J{fvZ-Ir_Eqgpx5X1Vh1Dj^p6w0lG2Y*AUszaJQC%%8AaLNg zeEpf*`TKLP@0m1ta^?TO-vhlqzF6FERP&?YUfu6pyI(JqZyTN|?*D4@;Q+JGJe!&C z_x`kwJaOX0g7owAN?u-Cdh5eMcKI8( zKK;1q^_b7o!;4o42?{zoI4~q1>)H5r*GeHNDX)?elkIoQqI>VvEvUT!DxQD*`0?TI z_xqcZkMrHyo_`(`%BI(2iZ7;y8_x6rRo;!v>|w8GW|&AxS{A8@ii%E|KK=5_VD)F` z=bwLYuvt@If4O_V+|_kliDt7qdwZAG|Nm!_b>)QFy{xT|UcU64Z&#afch}b3nv@ik z@;im>adB}|rcFySo1J-gm+ANW_4X%Ep4^td!~9MGbJ*&u+d?gJZW#Re`!~?*;oG;l zzng+p_4N8Uh1DKBdv>f-SpCH5(~GOWzdJMAe7)Oyx7Am>*00a+{Vtwi%O4yR^oEOb z^;NHc0D;=y-_~Aq)>cz%yPdyZmY<*BZ=Q{3UY_3FU8Rq|UXR~iTWMKt_dI%e_sXjJ zZ}0ElFYC$t@ZcZ|8(UCFh)Y0#zUF!ie!tt@zpwUp(e>E!kNf}s-oGXLdf(3C=SfC0f6V{?Q$9Mn`QU*LLFE_s_FAW= zrY>2!G;wRx%NrY&zuzs7-}=3%veMGF`di71zfq>Xv(0iduC0meUFbbsZ`=LGn>lKF zdVTlyR)fNL_w>R_Bj)qT0bHy{9sZWA7jf$FzSt?O?&0OND0+Kd&Yc|>uRi7QVyOT7 zwolk8<|in(Pt%Ro(A8bKY11TG>oS9~HxWK+lY{dk74`hKwX_I?i%dT05)d$9t^1PM zv!%tlS>xm5L4{%3nHdisakaYL7Mk=Ktjyovzo@wQ=Eh`pb^m!wwrrVltXF#Sq)AHK z*X>|AISn+}D?T9^Jk0BZdziQ6w(IZh_v;@2e!u_t<;#<$^Y>g_SKZH{*s>yi*Bzl> zpHA!Ve7EcMiSy^5Pmix#n0tHM9Gl8ZS5r9^Ti(4W^3J%or_$#CpU>N(*=1}hCiF_1 zU)y1^Siq^HZRu&;Y+9@K{^z&xgbOGknz8cq9&-n`@oB{i~Q0$HSOiw}nofJ-amX^0J(} zyQW@S8@;*kvD>j8$-`4LgDalROh0FR_Tl07)ps9;Fut5=Y4hj%bAw$wA3hduIk@1o zjkr^c;+in-r%PKIDk^srAAgZ8UD0W^x9i*b{r|d-CT+ayx~2U6J)c=7o%8Ge{cO4{ zA}YGE?(Z+D$M#j0^-u7ktVs`A@`S9UG*UHM3tGx@gnlE;2->#p! z^yoUhqc3Y}m^HL@i%KQ^p1*zDeKY4!(#n!jO~1g9Dd+z&XM6Z$`4?7pUY@pkw?Nj_ zRibRojr{h1CUgp`PntdZ^sB3@C2gy|urBxX@JKj0Np;)tu%#7Azb>aNnVa(Ef?Y+` z6y~RXEAD+=<0gM5FOEg>Q%r1Eu%^w50)B-H?(wgA1D*+bE%0YdC@t0W3w`*mdw(=% zURZ6-!>%ul9gLcD^u8?GapA$1r?2wLWe&_T&93y!^M( z&7`fD78Y|YJ?i@A{&r#c{Pk?>eq0KSU{fz%nA@{jyKo(s@t;|2b7$|`CG`Au70WKQ zhQRddIp3E%mT<8A1__=#rDmsIK^C3X_0yI{Q2=ssi!-K@Iydfigk ziQ}RG$kexQ&+d<_nRw!b1xyiig5-(9>Z_*?HnSUszIbe8>%?(!f=Y`_NKDL`1&z#> zbx#`RtkG%_C{vf#i02fsNsp512QCr_?&;s|u#wYzLiP?vao&BkLtR;Z(rx(p9Sy)*oOlSZ3^Va#FKPyD1I$VC|r|Vj- zm|`ID3{#Rzt_GHEcfkk|$PH)|C;&k(zIiK6T;^tjjwkq~&!q$1b6N}pyD7^hYLn7mT zT(yi$&9|Qq5^_I$SP|&wnaB9%RKY9n1+N9Hik@(Mes(tb{k^?q{*T|i^Si&V_Ty*% zC0ioux7&z0&2bN%@#IMe|KvF`Cr+)BGYNhB>C=KWJWR}63o@>7I61Fo_sUr#rm}FM z>3nXkqOVccxntWe{QZ9a{FRl#oc#RdrJ7D1-madUPo6yZoUJA&8W}Jr*fwF)=B*F! zIB05KJhUWGnS=YX(;_X4Lx&bPx4(LPj#tLqJbe8|@0VsR`~H55-j;j&*rwFedbi5X z&$IpV;^N|4J1$)^dNfOoaY87I*xVSeb$58uxaVjVl&YQ!&177C>3&uCNsX4%AA4Au zPqrwUODCU`cMeDg?Cy{S3b3>ciqQU}+mexQyu{JKwqf)mx zvQuoXnVpPqmd6%AN8=X(kIdS}ze1obEQ}*HlorQ@JPSS~-yoW`^dY6W}uUVLQ z>&FDQ2gM$Pn!q)0X>qx{ z>U%GqhOXZH>HBiW5CfLiFaAxvx$|87GCk)N3l=nhDr!Dis~cDEUA{c|+1c5*<)YVw z+1T#QQB-O9Aw1cWd*bEgTLn&@xWM%EPGP8Ga8Qw%g_4qjme=q7g~=X%>*TZ&6Qiyt z6&}5i%JKEp)$X{xRadj3mWu4$xidm%>era50@E8W1?jq+n{)A>zyI~NRk|~`n7l3Y z>npoptL4Sr{~|*-A}M)ccKF-pFJ5eB44(a1^HG<={z`UHF)<-wS>M!DRbQc~UAtry zU$x&{(|Y3M7_1w4>Ze|I7^|AB1N?>UcB|+(6Hd^)u;y{y}J)=oVG{VfvM4f9F zdGmaB{m%RLzb+&%OZ`ppFB2KtsM-}=bH0@5rpz+Eye&aU=s}zGmV(ay>t)kVhV|@d z0u}Lx4>!-w+tr!=Y>$epaEqH}uKCS{&ILapVF)6V<=p(ed~#TlYWNqU6P!2XA?Gqn(l#nf1u=o}HcT+`^~7S)paF zN{dX2+3d(YDV(g8mK7BhyLQP0-anI;tNm>I{Ra;mb1e!O*59vR9vf-7#iL0~S3#4r zjo<$FW|m%otxAed6egcMBL4p;e=F3Y)I#SbALVW*EK2uu(bg0 zeHo3HR!!ZOdU+}LoigcVX}UMkbDW;DSn_GO)J_s8nlOL9{ONsvg8ahv#zd^WwQ=U% z-HG?@etZqj{qeVat+T`Guv>fM+{+WfCa<^XG=_>0%bu-{#ys^zr-kcYZhb+44xSTwdn5 zyX@9aQzwq;mr^-w|9m+7=H}*h*KRREF|lLU)tx#wSA zzA!iX#f`w*yLNsJ)6H45C?p0!@&gsSP z_xsh2j3&K!k@4^M{r^cDBX)edmHl?tVXX{tgR`g4t1rFIaLU_TdPkJ3mfkg|wAW!j zex~2p=DU05&Cu}7#^TGqAO3v4wNct!{BC~)M__)5xYKgKxl9Rnb`+|pt8dP|ZT9cq z_x+zQ``Zf&2_;>(VPax3kb26zAx_4QCwg1P;ePw9*u~LXFX^qTe7p6-m&>=r`rhb? zKI&Ssdw-6(xp`4>F{uCA+0o&k>3V%#?9cD}|DO%^w=KPwsimc5QTArW+l@!FmM&U! zCsH-ua!uHc-Qs4sP4aaOywY1f7X<}vd3ZH^tMt5|KX>j5Qf!(0La!w$Ik~f=L*Y^X zWNuzI=Gfh3s-~u2n=XUq_s`9>zAh18>Z4&Qt+kdn`2EsjIgLfeGAFkz-gvd^`o7p7 zIdSdhpM9QTW3|`tG!pI%-(wNKhyiL@6G!k?tEBnW4`Wa@@2Lu^$g4I{Wa*9 z@_qMzU!SVo!E4t(_dhHO$ZTxd#J&FeRGr-%fA*}d55Lg7sOZBtmiwol`bN3Sxowy= zXMfDy)&L(Lp8DUn?@L$~sepQKzrVeGe56wtG-oD0XIbs{*yCoOB=318e>NZxB ziks7W4jF0awVzlOoKsZv;Qv4Vu=Usena^BMUoT-O5?9MP%k(h&hr-m0Ul$zWkz{?o zW_zE^`KAsAgI8~sm07w9JmNn1?Q7&NrIhD!dwgpz$8s?4`SohGPSlnT-RNx>)RW{^YdSIS2ve|RLQ5S8#V>K_SjHk`7eI$f$d9p+~W9+(=wuMg&sI{L|sbd zxataOq1t@riImKAaXGeY*POOwv%|AYH>7aZ{M}l1wNW~M$(zSVW&B@w-L{y^vO!>x zBd9dIe}BI3Y_r&z;s&O(6W>Pt_){FQPbMj8i}(FAGZw}MN^O|JsCOe@r)7tcCkN-- zJ#+i*E;XrJNgeCCcx>yW(?XnzQqx){#K~H*aEl*GpYNEd=`%;;pmIxr6{jM*sECMw ztgLTkrDdUS^p0IJ$0KxZeVkkQc}sU=pX}o1BW*x)tAJIr!Sx<*$_O^;~bJ*wPJha)NczDaayt})1@6u9i*)UOHm(beS)py?|ypMYuasJ%g2@?uFzHAXVbP`nagoPb@ z+;4ww=9UnqW~bO#ztY*}hc}IF&*fCqlNNH~Gm`2x>FYc8H)vP$ z^JizHUdUK7_1i3xegARio%Pq$S}riZ6nd(ludlz%f4*OY%a+yNjq&xZ(s>u&nOT+T z$k?uGoxn0d;E~b7)4B_f%T@P$eSQ75oV%ObrlO}_*F~SKXkwaS$}OgI!72Ts(ueQm zrJ+t74-I15E=*K*-|_F)>)h`GpT2DQ-=-+m-5R^QEHEzYR>0HP89}!=m-*W)oO^q7 z{`|65X2q5rJ}-@07-pH}dKDFII(&KRv}r}Bb+;G1dZHp9yY9%A|9-o@`1jlG%m%5aMAZD|oamFa*1KV6Z$IBO``Qh;=&6e~D2SJD zXM3}3Z<%h7JpW?%!<$lz_Vo)q>RNJI!0P&oi;FA2-z_(seYPUz!JYZZ$NLP^&diW{ z{CIX|_#C?ld}-dcqDw>sKmYSw{5@VZ_g%FJ-!8dLuQTs`J&?sZnf2SeqEgj!OGQGW zzHYx4TIb7LQg;1Yk+95pHuJe}^gn%UND!a%Z^dtcTYIa`4Gj&&c@!?>rCeVfu75k3 z_05gKGV!>a72gy?)1N;5ai^C3*nR$hZJF8&eT8=%S$ERGlQl)m>9Rq1_@kI-UKZ1q z?*GbmV?Nu*UI+d1&FhP7xDPQMh*!5(>|xW;F8o(iD(M6o;(GY-A!zXKyxs2}e)~Tk z^lz)Hs%|WN>~=f3`)btNbF2P+Eu5idF1~KRoRd?+>HZ(Fi^6w=dHqh4STNcCjFxDc zfdr`e{%7yk^6mWQ%0DVzy)J*(C2;BHZ7<`hFByv#EqZZ%z5MU*@1M6x=N05SzI=IM zIscY?{p}F~PA|IjwzvHH`r3Ve-QO(J+{#MJ&1q+qjQ^_qV?0=@|Llt9+as4RE`B)w z|C--_S_B>$Ejq2ca92@z`SovSuUvh3`NDqtJ5{S$CI~o9hjw%~pSN{)3CX#eHf1t% zGh1e~!+E=C`=gwSM^fFKPKbJWZ?&HL?d|HjHGUl6HF=I&Ky}XT0mpi~#YYN00KnxIcf*o1COav#jl!#p4>7*%L0S{ry@g>eOLB zQJ^RwAwfaif9|TXc@yr|{a}o%5!{wH_4j`cMV3w0=PEyaO1NV&!(KjWOF^lr6Gx%v z1c9Py?($c6CC`5@RpP|4Fnp8sIY*E!az-tW+rJCTWu}|Iy}CN_s@7Y-6;2$AIVs*J z9Piz`XY=>V?7IEs(o}Fi{_UEzue+4C_rf+X=TbsnD zrmFtmUS)dJm9@p}S2u&UPK){d7GCLB5i13pVs@77RQ+<8-~PkPr7 z_U+rJ6St}5#*ZWW^M1UqcYc5G!n#;lEm4s1@3ysk`t)grMWNFCnopdLj%8(f1yhbL z%4Mzn7J2wgJcr^sfnD4SkIUD~=FMd8AKl-E-P*WukDlNx&(_uteOcnVnxvQ}g7v9h)`@$;-?C`Tr;? zFa6w{hx4EBd^u-+y#j-E@WGJEvYPJe_ZELRw%f9J$-h_ouH@`(y8d?ki_*Q@Ws6H$ z*A*Jvy(((azh2zrTj{@|QgNr`<9%ztReXPU7c|fsxY#YWU{*&5hg{VQ#oNhCMY!$% zo+-0gnJnz^_v4e9#uD4tC}v!&K4QA+{j1pZD`fnhI=()(ZrzccT4z2)Tg6;Ga&@Z3 z{cXt;WY+KR-Y4(Te(a#YlgF>T<{V+zS$Qsg%{!+RW=Tm&6<@E0=l1J{X=j`LN!i`C z?IJ_S*ZhcY@;kmo^*jtuU@H7pqQ19QA$0Bfd)Ib%U0iX#)Li1r&U@#U{1*82<+A_l z^0w2{4n8^g)!JXNWrvgJG3ymemb7HI^C*6O;W#De>ijb&8|T+GEp(0zo+IEClcqOQ zcj4~$`)0Sau(a_=Iz2x(*D!9;?E~}X&AVfq%EivN{F=@2jH6sHF1x>$RBsV@v`BBJ z|F68eyEf+CwW|8|#xo>DACS! z1e{`)>CF_FWm9RCeQk}Rx%qT|`@d6e+=!T0|F2R>Svm9eHr>n1{nO9RGM(Y07CybI zE=+q({Q6jJKMuu~SiPA7s~)|6efmHnbLGQU@f-W=?b-R|Qht1RxaZ?BX&xz)7y7${ ztebDcTp!R2MXIX5@8o}Fzz zdDbj0hs(=+cRrhy9TPSGWJ=P-L#Rsy$6kB%i#2P7n`Sp7J z=A@%s+w$&u1qKSr$;p+xy3#pO+5OVq>hh{DFC0rswyZvVX70`rSd3ICyv0w zs=`jTRbL()m#;r^`}XW9Q$#>(Abx!Z&j-qUZ@ef#+F;neWB zjn*xvPMxawa?#z>-`X$Wg8cSuiz1d;rr8}qtpbm_%1*Xin4%dRv*}Ll?{Ah{y3c2r z2wh*oDJK_qtK*c{+Vne5ugs0%P}CEgo^!mVt>n=WPSA8l8=tI~rzdCro{w#JFIQDo zemo-VFCez?Zq$_t)0V}WS{rOwcnVY~PSbNfar^e{Yipw?&zW;(Rp{!7Jr#v(pQn2G zwmv)idZU$M%Y}aLwDLK|t}ZU1COX5evbU#hY)qE4tuk?RbbOv$|KI@Qu^!3f>NO3@ z?fn9xvi%Q#6rTBbRzt7Q?diJktR^q*CofZKSI^LP)cm`)eCi(|gBNeKvzM}Vo!)wX zx7?1MFTSrnEnpR%l%%9KxwEOMiMuTzGE(yQx3|{si;rCi;aWUb9^VQ-m# z_V``f-gT8rZ0Y{5>m~(qNa)>q)0MO-Bi^d(RBUW#aYeO5!|cz~SML_k($su-T)uuu z`TKjI739_5a&B$Sc8`gy*5`&U*U)L6 zyz@eo`s?VWhj{icdzrtNahqJ@wBCn8dv6vt-<;2OQBmN{>sMZL)UB`oJbfjWW9Hek ze_z+v8>XHT(Gla;)YPo``}MkM{?%H(`uch{9*KnNoQ+Z7VcZ=Yhd(|p^6}tM%4f9cr%!$AKY1Em@}DQGX}($5sUvElz$(`K{QREhWiQK$4@$;4aTKyn z5Gb0keY^SQ`IT)SRz&2s%$ELh)Y8p~Ls8GiX~nuH6%z!UuFPtg(7Yy0o1IT)!JWG>QX~L{j_q(v@Z0N0%t2SBtaVTc_ zmd{_1ws|Hix7dcVw^3YNTrX~I)$X_X#KFkOxOMhI&?Ll_S?}x|KY#jkV^b=3`MpZ@ zef##EnPJ#GzwTFO{{Fw)!afJf$yMz>+a=(1Mfz@QfQt*u`@P@iz5O`HviQZ_-R4J+ z9{utAcYFzGyq}F%?##x+zdJj6Sk3S5ZE*q(Yt;K_*xJh4+uQHiv*%6L`?qh;u8G{t z(cg2ikFyfAZNnw^rB%zO&6{W1)mj;+pF48+TwLC}ckg(lOgR2GELbJT8?jKpDduL$ zZ_ZhB=bqh=co;NQ-EaTzhwJU|u&`To+alIReb1Socgu+*kbM`=!aaLz*!bnn{P_5| z^2tPZy<2t9&&@4)cW39ZA3xI89=JQ#_-8^OZ{W+N%MbA^^YS=dj5LsLId}d3)xk5h z6qieQX@LfgD|YNmyFNqD`Ng&9{H>*D*J(d}*XP=JG>X49mTe7}$gjxzT4CB6vVZ6O zKa+Gdo+I?{zOSFG&81XY<|N(SRa*1?ZuyeVqRZNsIn2A?b#-;UD7hLcW4j~#wW2y` zyUkWL$XwB;;-ZY3dXau%qD~!FlLS_2-xPu*v{lNgaCMU=39<1@shDpScIv27P<*1` z@9+Pv{sE)YVWs~&R?Y>duW2n4nr&=sc06p8=HU4Cm?!k6ta^*URyD-D^Gf-|^)WcUvpgB?RheoMAoX zld#QU#eUG-rWdzJ_>26#jGw#|j>z*^@hoJ>|L_&mSACe*a;ivN=laj?J%2zeE*>B6 z2hUSjmG~{(vV+6MhT~&#Z0@JI;<|dofeQA8WQs1*z5I^XV3k3oYiM3I21w2#ay1!>^K)cr#Z7UIX3R^w3@bR(2*K4;21qL46{eIu+IhMs1MNc|nFNcSP zZAv>U<<-T-5OB#g8eDQKemSMRKEY^a#p|`(89;q1Mn*=PPbZYieBCcd{)F2;li)S$c5YmmA6bA78Cre`!x;ai6TUTfdxb z#P+v%%yo;O_ZhU`~yI$nxPS!Pdr#coU z>IvuXS=Kl`jOoYg^~p>JKvN;ddZi@|lUTaNbc-|^S_GV~$lrb2w;I%_-c|no-G`E= zPoIL8m!!<~Jbd1M1EZF(6UW~RPp1XMPMtO_X=_w$Y@2{n%r{WW1VxYKcBN+vSi7HEt$cWE?0(oz;q!ezE2-NCf=K!f5~Fo%GKV2P93N3 ziB{S#G)_Mk5ET`bJEy;&zgOD4EYQ`7L-E}6E^z+bSpEH7*5jz{d1tp|Ud}Sz4;uQ* zzNX`_yCJi((sFs9yqbnekN@=A?)K&C3;N&Pns<-!2kY?8Nm(>uDdCvTof)}2|b zx69-Ad=ynP+Q;2p_SQkO_O7$G$|lunu1khf#dqxzQ4gFlZR$hG8%I`pn`*Q+B{{^$ z_8A))b#!$-`tkAck>khzr`}%bJsmWddZp%2!hySIWf#w$9ea99NZ6xidG+t2*NX8- z7)ZRmoxN(xp{%VBo~8Xa(h=i!TYT|d@jRVrUI7Uu#l;y?i!c8Bc8ix;)NOI?dhILE zwqCUh=q=l~Ev%b$>6C9#mIl2C8?SFG+i!n7E;@B<*6YOQ)z`ANE?N`DYtBNJFBZM z?R_7xFaGDwyQf#o6*}<$)E%K!`L(~lJ>B_y-e%h{FT>(zJ^@|+(`$VfyCsUxZ9kck zl(AoAU-bT?@Ax-P|NoW$(QLEF%Vrj-i<@+zRlN<^SHHgvQPD&_hno4 z^|h0K9GJJ}-j1v5zA=3M|JMpMm{Iv%WcRKA$=7(Ut^L`j$!~LP#m4QoOwUf{zkj|% z+WqoofBW6HCQ7f8MbwlDNO-Zccc0L;Ad` zrYZCGO4@v}+I{Q&jcrr;?^n+@zxVUPx^K7ZeocJYZ|9NJJ#EkDhs(=+KmUCdniKK6 z-sbnA|F^EnB^+50SFV*uMaOj)-`G_+ zHTLs*{$0F^i!XY3cyz?x*HBVc{yG2u&-q!8)6ULn4eFW~d+T=Tnw6V2O#&_6_-8xm z?Z0bL1^+<9B1TXgkEkOJFcKdxThtgM9PF`JVarIy`yXbw zSkkI|TfO+@sS64pAM25|o|blY*3Mlb%ego>65ia{_~WPL`o**Is*i&(;j1>YHV`x|*7b`uhDhZba<9B`zuo8vEhmHffRKWnkc`0i6rL?djuF^1^g? z2xxg^GdsVKu(0#%YimD#{kr#sNor~;$hb3Sd}f(sIu#Xd64qK9@7^bqcz<8*kz>bh z#qPhF1={GlWZ5zyDXCMY*JGNOFHdIiw|GEJo(R`nzDCyJZGEb#>7U=Eq#5hcfkUMM~@!;c(?n#gjtTn z=jZ3QXWzQ^!XW+J9FUvJe2ufN zXxzDThl7hN>FTOb9$Bj?<@am1H)^ky_tJc~|9@TB`Z(YDcC{zYoKaCxX<_9Siz&Ia zGI)8>n;V9U7B9ZJAraJ&TobcXsGMEz*h??{yuPtL|8D@)7%-w)-B7ccs)*!3>$%#4GZQcr`1(bOid4Eqckv=dhI zd9Zwb-J)po-|H+Z>!QSScjojrv+>KVIdtgIl%q+3UYb`IxpH6KS6eL}9%_H-^5tB6 zdAphj#;oIgvSq%}U#m2hUb(c?J2WC9V(<0q7eIrpU=7=HqjxX2EZ@65_x3W#rndZ! zPp|H}%hxUeZ7oKcBPc^+|vGzem{RYYwblzc1?X&NXXv)codn zJU=&g=l6TnntFQMY`;JM%E!xF`s(Jh(vSaszb}41w_Hd>Bt^RXovWU=mltTo`^l3h zL0!b29-iC9&)01~nR4jv-MJ@Dcsv)0a}QfBy7=OWW4+Rh7KM*kK7Rbz(vl&*GSuti zt?cy^CrvsuLDBifzS`Znw~DVvYqs9Z+4tt&>-yA>kB)wMdAZ%L_Sc8A=J!LY&!rfF zTKJznoz@o?EBk28e#3WL%bW0^phXN{uSMtIJofj)VScU^?fIL{`12gAL|YNez$!7+sf5fSB0&M zSs7RT*7WLffBCIxXQjf|IIaEh^XJOz@%6F3GYlNJ=HHLITY5cK%h>qxw?8Wa7hk!u zGWhDt%ge8Rd3pKjg@w+mefQ_xwfcI_`uz$tk z>eklmt!sCHwsC^?i7s8XY?c1LA5N}rZmTX`3cCHd`un@k`8A(9rEIIV%(APk+PZe} z>4UA?TBhm8uZ!B2vyxB7Vu4xittCxOO;=7%R?j_e|Leu#tW#4oy)>8J+Vb=Nw|9C= zPJZuY{;{-p|FQ*Je{S0ObJE0ZlOiAWcuoila&LUu_|Wml23E1Mq`8qdJvm%60~9!_ zax~Q1o^n4sZD3G!v3UxY_U1P2!cBK-rd@x3z@DG?>;Kc!_oUa_8y?Z4i7>U#D0 zz0dD8&z!)KoSf|9@~Pg(#l_Ij(8cA;ySvtcs(-~~Wo1JG10BzvJ^QKtD=#nalCae; zUtC-)A|~d>%F24>&K;fl-rH}Nty`zJ>GsZu`GqH}F3FRg$7^JnF&H*c2g+h<@fHz&6+V|!T0y~g^jzj z(vQmUu`gY=EU3QTzPG>s@{b=oY{Ft=eUBbJDk3N6*Ul%av^2=GY|T_G{O!oiky=h77ghpPy3i?JCtyPf0n^zh}=L)$04^Tv$+G zAl>V>e_wQTwD{cgyu7}%X~yw83LG88S8u=LqoJwUIeF5gKfl(kT$z~m?8c3Vb7#+{ z&OUq0Y5dVL~XtT*3&`ybP_JO94jr3@1j8=F0v@2uv|nd6hU zJ-SX#PR`HK(Q!$LmZqLw-;9~FX3hHdc~<+ugaxs?%PwBHARsCt^5@;A>u)|jKAvJW zTk})>?wMhsp@HS)=A~t2K~YgsFH5Yn^!1l7TJ(Sa;*CKomo&5UU+NauH(T`P{<#E$ z3mcPbSZgz%d|4Pa8YZvyW8TxI@Jtc1L3Hd!OQ&$BO)aH{rxwqc*=;19<{Wz zTy#2W^Uj@?W>UR5Tcduyy}kX@;kRYRpAT`ZIB~*bU-9$4Kc;-`&j0>AKl}IH-QC9% z6BFN*SedVDEWLE;(xYFF~o6GdlUf1R54e_#CGs-p`RF1&N;(x%3% z>*H!`ZC{sI{d{g=Xn0Vnx6RtxdgjcZr>1JpnKeu6`-_hiPefZlPO_abYgW?YizlY* z#R^?G`byVac-8v#>1)GID=RCXIrHZ8&uM?9)ws`x_Z=0?dclOq(eRY3#*}VH&wR6pyp2dq6 zRUGe=m64Y}|Mu+%6PKaCof9c;h=F;o0d!O+El@mX{d@

        qj%}`*ChcOETP-0 z{FYCC_Wb$u+Dz9;Dw9+)FU}R&SO4E{^5n@&uD|wN8ItF+@^w~O*)$nGc1fN#)z|51 zvu4hWEO8g{oRpE2)U;^PBD1qaf2PiwH}6~YuK(3Kdm=>@Sr{0Y5`wK67zB7g>_ZAI z3=9quEdmS-9L)ku3=D|{$5|Q}o|f&Ne&_R3(7u}F>1>DZvl}ZmFoXsLIZ5@VT|At% zwM&mT;jTgp15-$Ct?kD{y1pGVS1wxAG{s95bf82@Cc|qs{o{-|OuW3jC0}2K?yCN- z_w?DbEH$vXX8f0O%XaNX0uoB z+*uiXZ#G{-CWm4}gPF0hGdrJ*!qOm5TU*-*LH2ry76Au`)924GXXlr@aCWx2=lbiX zk1t-lSW{iyJtmRib&_Js1_MR~hoi@j2iMivef|FZx9t7B)#gqd|0HH`GBPwU+&IO^ zz`)|n!N|~Hz@f;%Ai#z_Km?o^7!-J%I2agO94S{kV?rzc{i9)w3=H)%TkmitsfopK gGBEsE`j55!oA}*%IZ@9U7#J8lUHx3vIVCg!0BhU`1ONa4 literal 20648 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrYR>p{4{eS%9_0;FNFW_3P1-Cr4%&CZCB7YTcZCoKMOm!{O?x(2pNJEXcaLs$A#7{rdm4 zt3p;fMMT_?t+WmNc;~C)llSlY4<;yBTHd^~^hx2@SE1`-cc;BG>M}_=A;81NT>bss z+3zvu=h+%c@SK@%Z-2j7zV3(OwQJX6_SNh>@pXOF)~-%r^-l+w`8O0kc1t@y&$pdV z_SBkxpNc*_aO7cQUhLLuRIVw}>(<6A?Ut0JRR8BA`~N?m`Pc9LCKVP|{>T4V^UL61jNMJ z7B5zQdwcu&&vOdtX*VosdH?DtwZ|{;NOBkX!?&>HiHqNy!zqC4hee^ne zH8nPd^78LVSBuqM-Q6!QcIV&s@7L>^^H?9C z@u_k;I%VR-gSWP3-`tulURYQdvO27nk(o_EL}beHy9b-uZ|2NBQmlFgO$x7#uu!ko6iUv zK*76ruWjk8D-SO$bXHMS4cu9jdiiyFdV2Byzu(1w{avtZ_au5ZvX7+_}|~&CLiyUEqQ-$Zq(MSkH6pV z-<*5f?9Sc0m5(~rSH$iv+b7lIrdwfb# z1TXiSd2h8{?XQ5vZoERm!jZd5G{3&Oy14lHxu4f|=iD^fmVe*R&5f<})s@5#4-WqL z_3K%txV-%NO{u3dZfsDLwJuA!y)F08&*$?smR5W?$o}%i#^iH~t zj77q#;x8{QF1uS885#NK>-G4YySt`t*kMjP_vnqRY;?dD=P(1qE zeht~TzwuE=e}DSVPfum+>*hRplJe*8UrEy}5ji=z%3FW`e!m~Hr($B@Vz;C@gkuvSNySu#j*O$yT9?7QFtFz~o=H1yb zasU5+vtM6de|eEBw_Be~=ia@w^UR8$pF4W&SX<)ZwvDB)!=~v*yA>1|IJfiZeyKk7 z_qLYL?{9B8d3bbA-YzK*;945ewJZAP&!3tOs;a7@H{ac>ejjRPX0|GBZ`G>Y+uKf^ zJLeY}8M#taJM2m3_x=C>`ZK=T{eEBY+gn?MuU)%#>gv@{##86d`^WAo@%;MgsyE}Z zpLuzCT54))=c`tQtzDIMb=A_ev$K}2S-W=X)TvXML>AoIlDT+Y{Qh~%|LX7mvnVGw zcWQrsf7az?y+tJ@A#rhWub!NoTzSj(&xgZY0sH^`TD>Y{5so>h^X(_S6v6h3wL zZfs;^q^7pE_S1Lo*4?>#_v#eQ;I5i@w;qXw3|mWIhh5&o$jr9l+uPf#r^nYtGG<*} z6}s%XTc6CzJ9q9(xtO6-GWX-hk04`i-n=>Uo_cwC`PWC?`dUk;aB*`7H&i{H8vaQ) zdT&)}=-#TYHlOYOehFq>F~9DYXX(2;k&LIVUAy+>p1Z5-)6Du$Pdr2S*VVFWq^GBg ziij-9y1s60PEO90Ag{Bt&Ch??ym|9xmKCT3>Q z1*^i>uM-j${;V_q_vc@4x8I-A+}sS(8M~{*&~|^yNukvI{Pj7xxuK`0>4rKuG<^E_ z(Xcjt;>3x|wpm(QzWVumet1LHg$0dS7ZDpJJuEac0UeW`S#)AVNm+E{cwO;%honl zb7?L|Zf@??21e#jYs|};gVsiwe*O7;{_5A)*FXQs{N>xXFgrWDqjmqEote3q;p@la z^4d$c*q8YG`+vO_oxie`TU^V*caFuyFLSnU-!5g65wP*v-00W!&0Dr8K6(0dsa4sV z6@0Q*ONxq$uC#Cpi!8WT`#m=J_L?<1S9cU9v#xk}xPA6L|D_@G=Kt>$Ru@^o#xFN# zecK_Y70&H^TmkX*f464d`}p|y)cN!0Z`!&w^!K;7#%Is-D(dU&KYjdov6HiNXjs^^ zTN@IaUp9Lbu8G+h#F%wwN8!(Tudl6*-gkfR<>mgXca^@@l9raFMdLe}8^fPCNV8dWK=L+q|d6&MT_EzIyfh{r>RG z%*ojW&omVN#`8`dYkuWZe`yNk(uMd<3V(5c$t=e}#&mNSb>NMy|V zey8}nrbBCc`}54(o74SMv$JO}zdmtyqW+rp;7bBlblt7CwOx_ zoil!ad&?C7s<^J#{rmIt=dI^$6K2nzZB_WlW!^WCqvp+<*LtmN^C2gV@97serJk-i z{pZ{5e6E0gyI(6Z(wl-=h11RM@ojG6HX>;1yQ`^t{`1n|K z!7{(Ov)=D?m#b8X=U`=H(@IZIpE_}3;;iXYr!I|&iMdky{qFSiN`HU<)YR0ahYlU; z`dTaYUi4p|+h`|8@-)8F3S_Vo5v*3se7*4DnYJ->hU zY-!W%Ybr`gO>f@hT+Z0OsE>W>^6PQcy65-Rr>CboSWB9Pzgw~I-{0TQt^EqDi|XBM ztG=B09`kO`9W(RlCllRQL~qZVSE;9`r=qGl)zkLw?sEM=TidEH8k-xHA|oR~?YJE~ zEG{!lJM?cJ*RR^Mejg81RL$>Rtp8;-m>#@*+1cC6 z%gM?4bDsA4&y`)Pj$gehs;<7A>9r>J&6_uCe!X1oGv7{j@kNh>goKsU5biQLSluCBiMO7YK6sdMJc@mc@=-MhY^t`8py{N`FseIIx) zJZ?wjif_|&qd)cBIVHPSOiJq1x3{-T|FcIf^%7;!i`x^i?Dg7^l|l}U(%)8xub(t^ zYO0iDh5D0g!530%f`WrReSLMeSAhyRHJ=#=iqG4+=j7%|&K@aRNr zXxN;7UQEJi=lrVf;<|vsESB6Gf6iW87n^;{H!5o9?sz9>=k6N$qHK+KQyGfdce=Z{ zJgL?z-+pPXjiUMXc^^J}u#P)F$Fg`u++M56YQDSH@)z|=nKBvhI-eJnl$`nA$no8~ zcP4pvW+Wf)D|~dMGid*_wR`^m`>hkVXU4wT-$tdct`t?vdMhc0@R*t1iaR~qURO72 zOUITiTZ-;p6%`jh-f#aeW7fG-r;;8W>143^{buvBpX>Mi(&FRe+w=LHwTxAX#(Aqt zmoINu7c9` z|9^jva=l#_yE|xqU2WK!h=Z#_SNnWkAGbH_*UWn-{m;r;l`JTHd~8kZZnN|4)0Zq! zxmW$(mLaah~Xid3l*f-cBYvI~&wN+Ew<}Ypzx4 zj~|cwU*6iPJzX#M(aiLDih6qM&SV#rmOeeqZ@;AQ@v$Bm%Sq49&i?#-e!Wr334t~q z$)v373mln2No-x*Uax`z1KX-E4^FDjUy^=)UPVR4loyllC->X71$F&?x4Zx1V)xB8 zKR+euPT%dlF7NKHko9qQP3|8%))uxlit)nE;^#&;zsKz^%iUG-^3Xin>J`!3^+4UE zh3#@lr>1EB^efW=HC?CaL^_?FW%~2k?EDX(KQH#5Z?`4uDp!1b{N;7>>gwujd@?6q zUS6Jgc^U6w_x@);K0a<;cm39_S+3n;4<9~syuYuu@2 zu31@Hj*gBcudnsaGR>YeWlGET?dJRcev|(H`~Lr~t@D0;eQjL-ujb9$x0S!&Zhv`s zIsfHlzK?I`?_ZjDxQ(HbjgeR0ZjSlAie}yDZ2|l1YT0-s4xE^%oOyejE~q-rt&i8= z`$fo0bJCElw`N^^acgV#yxu}TKfZPA)|I@xq8JQPXRtobC>je={yG>wUTA|C1*vR%LHI92^el-anpo zb=AXn@6J6q*!)?xxv0E+dD+`rHs5X}AB_rMH#__9`@Grz{{Egkcdl<$l~rS7W6k%w z&_aH3OG`R4_qDgP``dhE z>FeuTvUKUhdGq}CR(-8_xAS?%?QLsc3g^wYtKG0|o0^@ST=PMP^>KTBjz7=I$=UIK z-|tU7U7x;vOM7x+qJ@QpfUNACc9-rS^mdAa}dPW5>wKL6ERx?%I?#lg${mhon- z>*?W%+Lq(F+;48)Pq}ALo;-N-#^?FDxu0`0R)?-WwjywGK~a&CmDQ{tKPqOK=bzh> zdAZ`*%=AxJlarI3m;252GP$I!t<4Qe)%V#m2`~l<0MnGR->Tt-m+r)?W5oaxK@^Mo(YyeBP{C zUbna9a`Nz~C@3i0U+mf~wrsv*S((|rd-qD-+_?Bf@$I{07PaI6E>_Kk%{#S)oH}lo z{rr^5#KiRB^XJD08kwKzxr@BAdZ4uXaf^WH^(QAMb8>SltE#rXd6UB@XLI7g!DdfC zziAUQMO(hKvd%zvPziuBxwEnwpx+jA!(^CGXp9!=>1=foIq5uCm|X-oCuM+x+Zo^XF&H??1U7 zU!VH&($Z&o-W-Z9mKS3EPu#jS>(|%UkDom|b~}H6Z+pA@%(%2z4#k$b7w=|Vcyn{} zOv7Y0X|tRMcXk%@NE)@wnIrS<-QC&GlUmGwzukVnqo>EjH-6_dAK(4EOtR%_mY))H zn&RM_@BfPR$Gu$(HzeFLRJ{APFM3OcU^6@av70w%y7fwJtovKFXV0D++wPLAKdv5kv1*pirjEmsa(?mtKN+nWR~yvZ=#H~wYU^y$-IhV5T)_uPS7 zx2*2xuFEg`|M&azod!>Tc7JTq`!5_W&c15*O@Z<}_np^brrFd;O)h$BBbm9qKJ%yb z%Al!H3q($aFFG6R)oHOSqkGK% zYOib&d0QAidD}C+r7o9@9^P=3xUe|s>fW@|>u$$1%ND%8UCC{`dtSO%x#E-O&yO#3 zZnvoTpm6f!$ulzy50`LOD7FYpb1he7xy7+_!GZ-ry1T2t=UrPL8F@^UQ?W&Zf0y*4 z+TGvY-ah_}H~VaCn}AbC(uGw27iBhIuLNJ&vs`np)!nt_+9FOJU56i4fkx1^_#lJk z$%VTg@B97Ey6#8ewwo zrsvF|=wf)n5Ip9dT&P&`^pvRH(O8pmNhc1)u7i)9GG1L-xyPbv2g10?YQB%Q?|<6G z>BJEz7!kw4so1i@qD0&&c$v>auc=x;bPC_RcqUIt!uTLTz+1@EAUoO z+3mt&cmB&IIXOCq+jt+(tA3|>?bE`A3(v&=sji%=-m)VyN$JQ@#~Pa>$Fkz%cd>}; zWqf}0=)oh`+&DizyYu@zlK!rHwr*F*rcIkRY}CA`R(yGxuZ(3;%k%m5`{u0Hnj2sL zcj~FB+LzbI+ZRt?v|r%U$Bze(A3ttln{&h9Ufu6pCMKq?tuT4WVA}bN zD^8F9{FH7i`nX8UNL)YbV9~>-Z!!(b)k9XZ-Me?||JBvbmzUkDk(bYn+nN=yRqOe- zH;X1o?pwM!{k&1e1%-Y8er4auD|Ch`D!t(Ox=hy$soFy(S?EL@V-^jgHrlG4s z6xGz)K<${cvr=>B&aM1-RQ%_Y$^IKQY1O!2S{1rFVnae>o^!^tGc&KO3iWn+5f-*S z?(9Tm_ZimZc^jv{yuMz(Y~4MbSc~;C+QN&NjHI?Qbaq|(*WY=u>FJ-J(wC>}W%i$% zy3mbR*Cy)sP$ozgy@Eg4i0_AH@Pv0tVl6T7I=UZQPi*H?DTy3y!UDS#zD;9o@si|4u z+AV!~=Vuw&vwvl$YBnEqcz$kf$7nfLDPtv-3~oSWv+Z*OmdS~?3_FZ}&}pZ~xl zRd0)e2Mnvj)*iZhSGK&oT+MIJi5nY}E8lLtz9MGlC*62!V`ES&BJ0YEzzpfd7d>)v zboTArx2)3B(-Sl>zPGA$&DyoxvEL50a_`u=^Wl>xArC%ZUl*%vYb&d-zn*EnzrVk_ zqT<36zfMig+x~8T{XfgCSyxXL*Q_vDxNzYdyV_eOwO^j>{G{XCVg343s;3g}Ti#u-`F6D@PMu16duyvs+#ZPw-;RMA-C0*x&AfJbbGm;} za4;t~w=rvYBB(oCeBSo>)z#r2KYe<1J-&Wv^!7XkotPaHKqJgGKa1S@<$Tl9)Hpdg zL4Dzii`|P~UD4!WV}AGU-JgHI-!GH9WB>n;^Zk9bH}_N;Cm-)iJ>Dk^ipK0~I&J*> z3;Uida_z2oKDQjyn=vypyK&=&fVjB(QZMtej=HZ`!}ol@SG{D(k_&q(i?6MZ@1H$8 zdgk8eM;D$J*j4gUD0sQw(|-GZ8ezXBjnf2#gn}Lvb7~g6D~b#Y-?wSg!xR|_o@eWp zq--iaz!2kQRIaKzd9j1$jpA!I>+`2h>$>}M^NrY!L+_GIwuvv=x<2`Qa`i`>GVw(Q zPo7MO+^gpHepX7@ch$?sr=R(i>+${zhozmVVb#xsHBldy-?4dg>i=&|uU@TZwSVmy7O}#m{*3^z@dM39I=eyt}jW%Ia`_26c7yx*reO zZ*9xKbd9sPr%L@yci=Ul&xb=FR_SxIfS-W@^ zuHW~ID?dMfSDEfTjalE`-cC+WPoLGdyQXzR?`wvFVy5)ZUyQt;rpQ!;wt0!ZVSasd zbyPvs?peDhP1-q&D|~(P{Pdq|?iW1ea&b@Wuxfw!CX(m*xg?8nKIf7t-%68|PMwy1 z`n>(q+SX5BT}wIKu1ay(nHpUC;`(>D^wDSc+l43OwVa;5AdvOf-EEpR{g-3|_t({C zU0HGP*VoseF3*i!rP{)3J_j;PJ{@G2PcV@Jjk3(ODm`@YAY;Ri9~Df@%%9gBzj#ql zT3Y(iq2~4fH=EB(m}Cere7|3B?>${l)z(&)ot?ez*Gu&|bLRYbxqQBl?QGDf zPUOAAhnq#U!)7#{Jb(WEw1ZJ{C6Z1H7cTtr?yj`6;cn)~$9hj2@6Gz`clqt!wQIMy zyC$YGSW6ddFfCVAO-^3g8sNJ6_BE+BYw{MqyAoni8&y5WaMTh|*KZ@rsP zR~N8)+PC@u`?vM>_A3IJo7d{9zWt#UYIr}t`1Pfw+@Nvk7Z(?&q@-L}6KQ+kPBY4YUHYm{|$d)KU4W3&4O*P|y-raZUs>2+($ezZedp)S zDM2kQEuh)MMT-_$l)Z^)Tz_?$uk_{X+qP|6mde;CZ|~R4#@lsgs~Bj8GJVSKK5O6U zieG-e-~agG!^C$+Ef=W{=jX1O;!6K65AQwprbuifKBLhk7K9Gw$!ReZS{3pR{?N z&c*DVJ9Y?&r$76<{^*j^0-wHr*Z;c7yHEt1m=EztS^ZCtd5mw*QaPsf} zFPR&*Uw1lsU;fpVi*1_yGAn(ruVOWS%O&>f+ScrF(1_Eg)B2TPuZA;j*uGue!eU1L zzMpMTTeB`MaAXet9k;g%G|QQkoc!_IH?}PYxz3$CSMuh@#uL|1y`B1mi=Y2^g29D7 zm7kTS&$KL715Kmvt@>(o_Wa3{nis#{T;?ln_xp{plCtv3`2BUA)An92k#yRg3@VUk zec!zEv_MtK!zM93b$_Q66&d@!=qH@3=Gd`Ljd?JydO=?7+yCzJSDBXk&E+cA>)EmO z*4Auc0f7TAFE9Vx;<3Bz?Tu}@(*3sIBIbQ-X5)R-t-mkf%ZrO=W*WD@c#&cE;{o%% zs@H367N6lN`uC@@jaT~E>h=4)qN1c8AL~tiaG=p7=f;K$sYULGL1R@57ATaxzjt=OtY>m2wLj3=gTE; z&={HPzP8=Ft(n<)7KE>lv-y6f_{gzimzMj>FY}$9mKD6zOSGxE`SV=nFR$0{|8z=w z{f8^T{vR(m^9u?JI`+%iN|@zHyuP;f@YSnRA3S(q)4b8f#)gBB&n))n!Lw(3eP^2) z=H0P~t9q#_BO}AX#bqS>epUSbx_t&&S5^p`W?$1eXdP+BGb#?FVlDC#k7_@WO{R-pPlc( zzS^h9M>Y`jtzHkC$SKDo-Nebc5bchlMV zvlebn?-#Sm%)E7V`fRh-b8{aqoxbIP=CQ9kTLeTWA8ieIeQoW|S&2u#oVPP9*JRpq zz_Lc7>}}KC-HGqx)-DfT+9hV-==kBw1j*szGz&x`z!SR!LDcPf;a*jBVssw=iAMVV{Sira@BTib$9D&n+ug&S~K|<3*Op( zT`&6c5#d|!w${6^SgIDX=e9qG;u-(ziY0%4mCl)~`&=a|HrUJhWAS0Oi2ZVAxtG?> zytY!fCd{3C_QApCnO3E%cAnm3^ZeYw zS64Tr^@`b&paU){UIZ^v9I&mc?e?IqryRpG>_a%q-_YA7HnRT6YE8oxL z)Umtc-8P5B#6+KYHZv+IHm0%uAshPoF#yke5GyJ-+_zionG$ zE-YjgR`&zVAN~Km|G#m0<*%ue7xT{j_qY7V@BFu1m;e6G-hE?N+0^VcoZJtYa#*?c zYtC7rk;C=Fi+#*g1T>cPyzZ?zH#hg=KR-V&d&zv< z@9xB^vwAi%VtOr0y$@a#l&fT^`zso?b<*kk9Nb^N?&nXGT*qw1t$5+x%ebYddS_p{ zvNE{+&6}J_lO}QTE?gPBTnOCY?7aT4CTZuCC_ST|0=0b~csAM>Gi|qj_VC|xCZ0&Q zb#^~A!qZzPTvPesws=O##|NGJ zvrb={S@B^Fi=O#gM`IP$#LXp!X2s7FL@RsNw6jh8`Z#CP?a~7mPjR__o|-LG?#sO} zOY}|C_3M|mxUc0ZOTNmZJjZ)Q#Qxjgwmn%l!_T-!C{nCq7_p)Zr6iXI>DPk(m4`%LVywQJ+~@9uKkUw2^<>l{nw z_PWV~$Rz_a2We2w>$6d|a+cF;(|FPKf zxzFsufph2XgmNmjL`KGN=tghr*~vX^#_k^Jq~wRa=3DOO=kH}bZ>K%|qM%bpedHZO zMR9TQnAp;Stg@m_Wy(9)cn_TA?UQW|kDtmQ-6PGsyZ7JvJ-t>@p|EcpNT**Xsn#gem+s+`g`=SZ@! zI_^^Owf`F4q^U<#@$NFSXhsWPPczUn8>OpS(jPIXk+Dcb_-Br9^w?#m7&e5+e zcE4UIi~ZU7=-i$NmzHb44JEehp6SKFsp!%f5yN3=X&JclldJ^GhtKCP>^86YB6wyt z`&8{4wmdBYPV6Pyt>69l_?So9Oy~R_PGPkR`|InCL%+ydS{jtCDXVTReZ64kova8B zMKAAi#VNC9dHMM8e13M;_-yu-6@eS4_jhz8THIy3_nOwlTs-&l$x?8VQ zXv*$3UTGnD`TSY?W=%PC@i04ML19CboN9gUarOC!9z68A_C|hXDZB8)JE<$8IOn{5 zf5UrPr?+R6`^C*ovU=WLm*q@X&)7X_(n$lSkffJ&+s__7c4Qe|&i8s%M;fYKqO})n@OPgf9zN<(Yyba)je7;;{8GhV z3+dHVuUUKGB%fCJhS_W5ystW~Sadb_Oxu++UE$@kOd~=Me2?zI7cVj< zO`bf{D3vRASINNw_5PzdHyGyEFhy@Wp<$ueqLIFfd*Q3AtBs4EoCwmNKV^zb(xIo9 zbZZ_m@yK!&KXc&pn;`1M5ojg)=EL{3zVmEmE|-%I`NTT4Y5BaSGdN;fQSwRgIkwX0=C^xJKD9?pu|{=l%I{sw^GT0C*aj+vSknq^ z7Y0@S&aL?1m~s8wov9p(M`DjYs&ax38h#YNu{(UX?%|7zpN3BnaOz-+jPcjd*6u!Y z=FB5~gEE~xzx67rro{(3aVT=76xuGV`}-^L`Kz;+T0iIAt@xT{QOXrpvG5PKuoK6` z{-a-8yiy*yyj5%#Y!Nu5^X{I&tsR0%Nn1WQfmR^59&NqQ!YM3q>HoiI^FNQcEB=;l zn7UevOR;5VL<~o-q;Z@6{`s*bi!U!vd>tlX`|F&DYKy=k2QhG35Ba__uw=1(eT%z1 ztN3*5V6anPTD5>y3%m9_paYqMA3 zYIemIfmFZp-H*+3ZylLm|LPLl9F>f z-&4>c4ke|gCr?s}ii#q3m+7vJ-o7kIarH@-Mp*cU|L!fESmS+jxmP zaRhSh;##<4hXoTebL7S(R_(Ag3Z|x0=gg4-_07`G%m~cj*!%n4Zb&}88nUAz^tV;Q zPp>5VpKVvTpMI6Sv+s&ehZn=_)u3S}qknI=s4btpy>F6Hnsb<$%+-(YT^x&ww%pPV zx*Iq3Y;5BN<=EDM!)?5go6~wTt&EH&E%TlIY-acbP?vH=pz`GsuPmv+^z#f4GT85} zOAsxV+dV@=t31~|b@!*0`*mE@9YoU$RwYc|yn7B08*@d-hT!#+E^lq$z8X|2oYC>v zAGGmR*_Ds?=NibzwgzO@e)hfB$N|rfw=?*+t!>qtTUdVmd;FoJs~x%QPP43DExJBW@t^nf#gB`A{`w^(B^70+eS4qmt?l}=OF>ft!n^ns z)z#H^mA#Exl-lE_EcudEW(Eg;yIJn36-J<#bG)t?B9*`Ir`q55`}NCuhpZ8Z+MXv1n#SxF(^XPbT(~EDm+s}|{^}*p758RZmt{O>JIU(ZD&Q2}CF=C= z-#^ei+O_EXhfkln&Nj>a@t~QXgP&jB+Ish%Y#qVogAE5?+26l*ZtjI$TPwMQoHznk zB((-OI4~Heoq6!)=4Q~^TlM)hlkV;=zr562{LY;_FRrhbxBv5j`QpWkPh<06%GhxD z&Yra!v{B%H;G<+GMn*=P&u5JP{QZ7kMMcFR|DH`!a&qOjo9Qbdt+9 ztoP5pAJ_L7_sg}i@tz5uAmG&DH1&rKXbKOsetBE&?PJ&0MuV1mzkK=9!piE>rd01$ zAuEIAO2uw3^`73**|*EkSu;1FDMsIqL$PFegrbO~dT;3yJ9H+eNzDEZF$vdRA|@*DlI`UhvN*BGU2et7p1C9EvV>N4XX{ zxAPgMpOaw#waI^cd|dhCVf)67D;dONEUH4P9Gy581|PLjGf6nWz$a^U@QM#jdVWzym6Vl-b%d8b@i5xD33$0^dr=jOFGFl@f6+#;~3;Hce- z$&)5IRa97HUtgE{_SV)nH#f5{6=7s#1g#bS_V)JWwbACFvG;jj?*;WrnXU-ley>+j zT>sPp7R8neE0bCSGBPy&{`#tHZ7pqYZx33PF~czV#jUN{c6N5DQ5T+_ojubmSIW@P zu%fcku`G<1zX)~zj?zV9!j=3AA$ z$@sM^Y;9DJw0YlTb$>DI7SN&?efxhb4Zdk?7M6{h@BH-UQ2gR?eLJ}LVgN0B`(~7U ztmonB_vy?DljrH}RZwiXU>G|u_t&e{>xHDGyt1;iw8PdMID2+&$m@+K&rAUANRhpq z>i=T0zn!9q$&~5wbu-V+wccF*{+`n9_`OwAZ`_Eu{Mc(z*?HyJJv@?A6j}tVmYtp# zu+(enijb8;pr-KWXJ>2v|NZ{w!(sl`ZSs~yDvFAVKc7XXrzCv&qV}w)GAw%ArCx#Q zEa5?*Hpr4c)$U){$b7yQ81&NZZQ(YizkLiTsoC#KU03byl9?sSdLfnLu8y&>aCP-> zrP~pak%giJqW?>;KW-+eeZCLo|>fEVo_dXY0`>y`} zJFd{}Qy*T-J#yE*T=C22^Y)XcPHo-4-+p!YdNm!Lp7Zwq_nb(brW-viz3S?-xnEvg z;hNpUlk@uOq2qgPwDqFHgAX2NjhTBU*7Ib_^M->CtySw8g@P2^L-*{uY^3gZ}v zgX6BDqP@Mn-yDmBb1aJkyf)VVubX9_AGfOXX3B{JpoC<6_iKw)`8&|+htnys*N*vo z_@FTvTntw4dd+!v9cUGdUF_{FVXsEMye;Z20*eyF#GU5XeB$i>AI00?sJUUCgL_`9 zz$3lnLd7R9UUYab^}5v(6d?HSpH_=Nxn?)_!r7kw9vq5a&OX}3`S9VxH8J~QW(Qb; z_7yEm7P~II>t`4rTkD%XVJ8mR%{z3zbO_HO+1G3X50E}^Tfb5Ryf^8%j#Uef zmV4Q8PQ{kK$QTaa*=D`d=gBSfJ@LXqvE_nkH}^tDX0{J+x|6qX-jr2u5!jVh_p(`^~X%e0plCq-~W6C^gEed~SM z!^0o~4#xCdJPYOP|4e*&dHLqd%W8Y}?8&?NZ=$=LqKb;je_^&A^BBX|O?RI7R7IIv zPu;m_7pP9XQ*~Z_*7m+hUZ-11l8>&wJ%jhArReIsaP{JFg)biEiXviS$3XLs7ZF)RY z|KBrN59(vTy}kWHs+fLU&&3QA-}Se5wKwjyZa&zs+1BFr^z@^t+Lp35+TnZrdoOZE zaa`4@I=}Lr%90HJc>dz>AfwEg1*U5sUDZ8O|5C3-uIhziQgX8QmY(KjWaQ%I+5ZcscX==Fi#>1inP;oC$@1{!VPG@nZr(BP!dY-qy{}`{Vi56d zyLyX&=-i`k`+mRM{r<aXJbANX%k83^`N;j&$Gzs>D{S5@VJX>%Y=&=M>0&F&0fzFmhwD9 zdS;iByJMPJKw}o$iBlJyRw(VgzM!?PZ&gKUdTR5cq^oaJ@8xwHWOVShD5MB(sx1 zM(y|i|NZg4COB0YgGx)ylc0Lgw3|=yiPkMAj)mD`he{gtKDXsu1^7??LZ9!{1K|357PM$nj z^W$Oro^Q9Zk4F9bdOiO6>Gk_Asex1a^^)ttRuvxceIvcjukb{d6+g&jF^WX7|(7KKa=&(6*k-xc%y-QCWP4h98l z>)C78&ZF9Ipog!~0R+#Y_lv_Hfmwea$b5ec20ca(l@9ehy`|UxE_rvY{$5(Yk zm$tXHO`0+#W!Al2uLaKcRZVes?@2qb+W&s%rqgF8O00Ou2kGZ565jG)P2|x#Q>XYi zb$wg$JQtGu`(j(3Z3X#t&CN~SUiWl6>~|l&vy@}*g;);Te?K12u`F)uxBn-x_~Hp? ze%mAc_WvTD8137)uX5RW^(9&HC;oy@q+1+8~K36%rQ z>wy+6{kZb@mW!+P2Bj8(a>;J)h3#@x9na%sxlah>Dz;p(zAG!dE0&Rw(Ijuy0(g4$ ze~|{xO|_eMfcCM-9Pg8XB`KY}@;i%MyMNR@<45Ecle#|@Y5(?k%mz0EV>j;**fkTJ zl|W@JIL-e`D?Hxv@8@&*XSz{bkfPfUyk_gnu}4lT{O8-*eEh-*pbamLqs;^m1O-*^)Ed~)W?*1H#I$iIaPMkW`r5U_z z!kjripmaIC{`uT;(7HCpmz>{=f~t+hhs0l{`N1!C9l3j0smkf}G+kvw z!;2<=|Mtv0BbT6~%D^DN3py8IzWH=H+g+c3UU}K7_x;C(gFP}|RcznA56zgpewjaL z`E9wnkIoifmmg(nwO<(b|KGOZf|;eICCimhi4WHoZ`{6Jf5X{hyssrqYa~iv{Se=| zPII#Tv3vI#uivZKe8KGYw!DX*H79q+_$N6ry}i9fXA`f({5abm51PO4*dF?tY5x9s zlbjNmbtA<7{Nm>0W6l5Y@7HJkY5!#pt(jk^_hsw4n4M0ur#Wt4v+_Q(?M#D@wozO4 zYMjl!eGSjNWzr$Ic%H@<-{WO#JN8XFu%uu8(jM1?2g~2yGL2$0-IwZ{8)f$Vwf^!) z@&U^)m_0tW&u#I6V?9-mRyy6*`ET7~KTR+3oBn6++|OrTs7LHInsU*8mR% zm2Ru3sjZT=E)%(_W^5e1HhTNI6J}nTqH=QU*2U}$dhyxQ(~~Qp!OPcIcgx+Q-QrjG z)&4%UWLZZ?hf;Qs*UH1~{HtHQc%gLr$M4_T4!QUD?Y&^;wm5KY?Cx*VOmpw;iHzM} z_jj79tE;Q%O*J#Ku(x-2Z$Dwi%*GSYFv~F6ZQ|QQhYsaMUY=)L9TF20GckA3qD5C8 z9&Yc>DgOJbbZh13XG*vC{QvixD?oqG2d9Z|kK9#o)oi_#>!0!E#l@%pq;#XU>`0Za zum2ytt+2Qlw5e!&&h^Fa{Yh6#wM)Bygv>sD_wL;4_j|XWFx$3mTgls7U#Gp!y1VOv zT!3d~b@lzC51xhDTIYV>T@iS3w|n>LW5?R^?(Vv~DfW1uZ2rw<7N(Vzl@Fgj4PA39 zZ>e)T-}ao#dn!LiZ~ORFx2C*APhEX^(q49_J3hw@xIsrv-2K*)=f1!0uSM}Qp2O|@ z=H;5Imv$5;r=6SAxjg+L`>d}g4jycrX`IfKke;6YEXynH)02}bs;Ytl0txSeyq>g* z$1Ny-e@}GX^N$aj`GXd_@iH+ppN;Lhz}Xz6;laoy2P$oyrtE#)&H z4GlqCu2!tju(7cL?LIj>OSGnT-KT9OFM~iwQ#?M_n}5?xSGRX(@$;fLHw@prdGq4V zPUF4R-}f_7iC5Z8=iAj=;<`~s-re1O^3%@9XR9)9>yoRZ&+D-d|VS#xL*p^wiY%4o7dr zPQ1P*^6*mc>7cdt)!*MOjXHmEvHQ*a_4fUCzcM7lHNKp9RONK=;6aeBA;Z?BEm*yPqL6}UAkwCel2vx{82ySBc0c({FM-QQg=-+aHeHX1av@=0gA z18DC|zs)C(*Voo+hy6Zs#D!1R%H{Ml-IcMs&6M4G5{~sqK8<OUP8@jd)t#lyz8EyeN&dnRykh_zWvke@rr zSyt39(eL@Q-a|WYWGtI#x{^;% zJZDbk4UdWf?dXu+b~kVPC$cy$*nYpR`pn-udFEfgfA8Pv9~&#X^6IOPJ?6`r+4+MU z9UH&wTDA<;?=U>D-Nt z^>caOzJKqYm!~HrBqSgxsJPbQLwRj&?S`ne|1*3yd@Oo?PIgW7cD|`oryjnxR@hZ= z{hm);VtO$huH9mZkB{{#NbPglq|s#{)$8Hw`_=Q=>FN51Q;a~9EbW(Hy42VI-%#5p zXUjF!t97aObR}C`S!QNtWx3anj&|Ff=4H^D$|Ya_$1o}?>Os-Y5C49@PkwuA>!lwz zH>WQQTMatlL|ILZEp2nIXSqvK81cUEG;Wjva^#rdGh28`+7Uj2?y&x z?%HKF<7`?;NXQA{2`7`a&bB;y{8&>*=S+5VNr}nI5UrU)y>E8E-?x}uuA%`nIh+~o z>B%{D$`k>?iC43h-rSsi`RnWJOFuq7-X9zoD0uY9k&3*C!zkH~bd+En@>-1*X*W1PJt(t0OWmTc} zWxfGxx|7~??tk^!E6j3lne2$sn<>PbZZ>=3^y%%ZR%xyO{IzPYT=DaBt$xc7w{nXM zh={N(zNpcwAGb&1^mKi9Cnu(DxwqTat<#(T#8iSOBPU0u)NJMT*MgFgoyU&3nV6Y5 zEeu$&b!(_pe@DlGPft%zoI17j)vGMff^hYnbN$q1_}D|VM9v8-{hI=$G-jc+o{$H3Jfn_zC3a2l#{n8aX{`+)V-=g%D$hx?_U4MUnfBfw1Yz`it zDO_nuNlMf7{;p>ntd`z+`0!zzu69#%^Tf%Mo9E1tIdb%T`GB~ZkFGCYA2{HUlA6lMU?Ro)?Ck9J zudlBw>+0qnD(*j;w)x=s^ZaU)IT;xl85%ZiGU`~=ae2A_3c4j7Xph)50U!{9K9C|TVz4qz1 zx3^E6IN^|)xiXxQ$>zVsl`PXoj~{QW{rzpXocGF*N2jK03yWSoy)pUtg93{s*N+}O z>fz;e=-S$7MusMZ2iMj{U*bvD@mgARB->ax@#CYTpe=$48zUBkt!AwF$5#LCr63C< zTQg(zw>Oez)&F*Pba3prn|I@F*?bYj$tP95zUSoPI&@lpe~g?={OV$osv3$Jw_UV~D%PyHJDlM`seiq>5#8g^Z8tCT623meM$8Y(ajTzV1#hT>aGO?=p zVQ}@@wV>QwT~iYikH_kMa~816*GvG7REu@D+WmYY{OZjc6{YjB^=^wNvaz$DOfU#2 zDEJU-o#i*>&YhU`*-m%w-Zja-rgLj|xqfMRd2n^Lb?vvC=`K%pZYzCuMp8;bV!`R@ z`j?aYZQVdg;PkG-$8M+2oLO@3UL0uGf#y^%tMYd;f`Yt!e3z8_ZJbn9Ra1;+zL=fA zZ{oVGf4|+%UvmBR$+XQEw`O10(AV#urW5&S^Xo`fR#wn@m$21S^X~2OY;A3wGI64# z%e>wHE?vH?sjS@G}0?{C>w?CC8lpA)uv z>5Lf?S(%xNn{WE?^71O*n|b5Pl_S?%{t2s9reCdp{paWBh@C~MV!BZ+6DA0ln49}| z$(bi6CW3~q3f|qZ%$yyy)-5hhjv?XfEYlgb)nWK( zieJ8baab7epx6AKLt)`Y9eekpBBMo%7cadY7#Nt5pMQLwZS{iduNMYrEXi?pcD}K{ z-d;zHJMGMjMp5msA76g5O-;>;9}n9DgM*dtJ~hj}rc?9t>GT_0v&GGF zZZym^PIp>-k>P{Q`%m|(--EUxG~a&f78E3um6i4H;^9S)7jD}oCMqg=;^fIjjjo7o zIWxb^nJ|C8yp*(bU}Plc+A!|zw|kEqae4CmIWxno*|R}{yYKehxDg@2!#4l>@~-ag z=F2Z-w(VWDiYqWM@W$S1b2fH%MGmHUmCt4-{|+-E&Qj6L6tuY|BO^niP)Apn zcj3Z?c78`BW^=@}+*tCY#H#Sg3BmQbYLhwb|NT(bi`j9&wPT}ZlYCg}_m=$qf5lFo zJbB{$`QsNCyFcwaEb)7PrCiukr6X#4@7;^D`T1nB01Kmh-H(Og#tz4B?Ct6n*v-zv z%d4oX%gfBnoRORRH1)6KY$F@j4*Q@@p4}Y*At5c=;p-NxUE9kokQ^)^u4tC|_Qpo$ z<$iOU4kkE+giN_pD3L7O;D3Ch=gPHfc|AQn1y~q0H8tasj~+eR(ceE^Q!+WH=EF-1 zvrf&aURSPN>$51^-nXb{V>SEv7K!AZlMRpnl0*rG7_d}Zw?J}_;mra;P|!&e3_9GJ zKD!6+zWr%gLXY7$`Nu1*>rJ*M_ZS|ld0#*6k*8kDSNBc^1_lOCS3j3^P6 - + - + - + - - - - - - - + + + + + + + -0 -2e3 -4e3 -6e3 -8e3 -1e4 -0 +0 +2e3 +4e3 +6e3 +8e3 +1e4 +0 -0 -1 -2 -3 -4 -5 -6 -7 -8 -0 --1 +0 +1 +2 +3 +4 +5 +6 +7 +8 +0 +-1 -W +W -z - +z + diff --git a/doc/graphs/lambert_wm1_errors_graph.png b/doc/graphs/lambert_wm1_errors_graph.png new file mode 100644 index 0000000000000000000000000000000000000000..e5169e27153bee4ec3c20838897a440c954165b7 GIT binary patch literal 21411 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z;J~}U&3=9eko-U3d6?5L~t*i-gz4rhA%Ub_SkqVqAganv6I@EL$#T^3$TmoH=vmR%B z%2+PB-|Dedzt#T2>+F&tY%JyiG7e>iD;y)0PDnMm2yL3MbaKh1x%cw_{@Zb9c3j?a z>$&glOt|v<>m%1)@7JyhF3rEb^63>zAtwiig#j8OT^uKF{$ItI;VRnVv@k#;wo{Ek zbB@rZ1}#OdR;PtqU6kQQ5}vwyVBYmXG~T-gb{m zF4Nb2)7ks-RO$YZmmyv+E-ZAuvA4S1=hMASsocwaW(rN-V<{yiwIS&!m%ybrH)`(g zDz&KnW%B>$larHwJe?jNb>{fnvgFUt&i;5Z*}ve^lapfabu~2)J~-HHn0ZOX=Ff-2 zxvL!{W}Ho{`E*jetzOT@@aOOQ z`r}i><2oN6Zh!p!etrMSoQ+GiY?)F&joMQZ8mTo&!fZg+IR8eBN#AonC2kHr?%}DXFOsm(Q;g+Ow_Tq0^q< z?{??vJq}tDthvy4wprrQE>Xjiw_lbl+PKkBtFrd**XvD{FH5X!zFrBoD0?Hpa3F8{ zWB>YJ!gl|DB>$Ude!oVz{?AAE?w{2*a&v4dh1T!+#Kk9XcjwXG>}zWdet39zWBvcS zKllItjc3`KIrGt@q?-SKzyC?^KH9`9ZRWC9CSRh>F*a8Af93Ucu`5=rU^u`R!Y5*=S5ve)lzleI2;aARZgi~IZQeNwwsv#+l^x*_rKhWh_?I?>zK+&vY# zGQ`8fgW&+*k{G@4kWaeW+K1Q0?*4JUu(0q#R;#RT{g;dGGt6?OKt|X9c`P5OIbS(y z|KGN@wgsDWS6}7YefQooBRyBEsX|$uixw&6+}$PW-Y4^LzjBL$y}f+icIkG0`D62J zs}C6P#OR5ay}i{ctnSD1BzgPojm6K;HDvP~e(>O6^N)|mbn^v2F&buMo1+I{x5zf4}edKC~B)|PvF+roYO>@s3G6fJ6g7}WiGxxB%z;N&FL z6KBq}+|4_#zyD9uj~^9Joc&w%o^`pKZ9Ab7OnHeA(Mu zPm9-X+9YIM{*GtI{$0DIqPOR{#>L6a@k@93yL$EN+IdTFzje#Z)b#T94h#%zl&|~I zxc~c~pPz4ROm;u;J3Jtu;n%OKIo9QTx3}dsA5CIBu&=%P`@63*7gk^1TU}oA{+_ME z`n$W!*-P%l{5^H*RMeXJr=K2L6}oyu$;%*+Z?tO@Culm~B&XJLlb$>p(AGETR;rsLBasQ9E+wZfi7Z(vpcz$lK zhQ9vu{f|$5udrdbk*+i4-;Ns#8wkH@4>+W-65&k%XP z>b0&>@-ZGK4n)h2hQq^3@sGe>4q#mA&i&+Y%uoHA|Nr0jJ&+mKJd(Ga``Xig zzu&7bcI#E@7SmM%x!7oC&wjI-9|fCIPm2YGg}EK;ll2CL;vCCjkGMFwnbzfcj1Hin z4O<`QE77J{{OpY4_WO0#J72HcePZkNIB$tI#TEgh;%7cZpU;|4Ub9B$)A{;;lLeek zEOPBW@#W>^lc2a-xAU3QqXG*K#TJ_%51K*2pYr6y#FT4mB310{=1rM0MZk%}vhWeh z%gf98XWG?TRlZo*egYH?9EwkNzu%`E9#^Sa`RC*DlMRf_C+_X7=2UDE5fPd2*s|yQz3L_P z|NlL?=q|5%xQ+Mme)X0K6P4X3?S8*+c1n8sHj+-`ZI&ouTvgiGMwVt7&qKYjO?(Q!CoXRI*(D3KO zVg42YC%?H?PlNX_TBMX@H1ouXiOQZ{UR*Pc)A@eBTt2_!@=Fz8Uth+j>!Y{#eR+3x zHjk{;l>dL<-`w0DQ+6{o<>DgOlv7hQQ$9U8`Dgd$ijPS}hk4B>JUrY!dHMW0D~0{X zj=4>mJJ%N!HShL*k29+IQDBsIM&jSECRXkfrq^SfDUfP}?|LLN;{KvNp4OgyT z7k1*Xtoowi>ErX{a%|ntr%%4!&R4&A^QMZrdi$5x*ZZ$rxgy}ivGe!4-6vnK-|xqv zxMb6&NinrwuYz53XGh_m-xq&w5O8wX)gtuiSu?+#!sfKIN-ZYZ3sX-|6LjK;++C(? zD8Zv*Z$Dq)P+87-o6kIoEul`CnVC=S>@02(aQgP{uJ@KG-Ho^3K3TnfA1DDnI4xn4 zAz)eXfB~e^IPHvrTz~uibs<`wfq@ej)a?KJO}ewYTUl>BRbfpXWb$U;n@Q##=!zPC=&=$^Eu&^C}*3{wvl{oib&Li{BgzM-D|$VtaBkeZFdo z0JtcbsOBa(e!svWt%WOt zmkYHYcAVp zQQ58MfoP1uyqZs*pKc`g|E!TSO5re^eYQowNlQzs!)>u*`nfrZEgR*@1r-H!Fk%Wv{=;@J6oUiFFp|K9)qG+%%JpQ3$x zCEFB}kM})gpWiL6uNEF#D!MVE<@a9mdlk)~nEUfwR6Fd0*Nflp_p9ICUH*LP!;Q(u zJN%X_Z{4~zQFGz+xT?h`5qqW6h3k4lv7xkn3uPAt=W$JolnI)mOeE7dSRjS!l0F)Mw5t` zSki?Bjweo@bc~CW+m?U7PdaZ0Bg2P>?ea;drfAyzH_N>xQmNc}a_jZD?t{(j%nU(6 zK|h|Z`tzs8XSNxy(M+8;d-~+<`*!TG;E}NqVA!obZR*sgo3DI*ZvS7>YpD=dD-$Ot zXOnjzJD<#ftKspyTcdax3?z62ufM;r(D}#T@ArSEM}~wv`K*(EZVuC$wtnf>wOetW)MI%-F*tPBtcWe3H z^z-w0SB9Kg{_$UKOSY{=-W`j7@87)1nPXYZ*4x{wp`mf$|DW^!6|}Xv_4oZ)R>#=aSH`!iRFq9-oug{n=YQqQYGENEgThBHHGjWe zPrO_GbZR);-Ea=KnwlDi=#^KqR$R>j$uJ%hRK(~ zjJ*7OrOfx&F5I}$v1Ex#hKbaQ5Urd$I|L;qCGEaT^t%1|bXxz$o=W5R{YSgS-D8$T zt!?vB`@Awc`_)MUp9|kTmtX$*#G9k>Y})6Ovx65ctg{yDX1%+sl>3LBot>P&%}1Bn zw;lv7@;=k@>C-2JygL>vu4c*DR+%JuPv5l3=$=vT)m5Q03=)|hJ$`Ih{VfO7jNkw7 zmo`IL@aCm_k?XIs=h##izukI0>G84NKOTDO>g@Mxzsnx$m%qPirkjcc58E88QZAmu z52l949lW^M{jisL`Ma1kaeHT(>#bO`=E-MmZEazhyL{4SJe-`IKVGd~&%gjGyZdA; zFJ%S)m@`M_&F$^{t*xyFGktP5_06&@R{QqmX7k_Q-J4$rYH{_yFv{^!l!@2WgKIp_GP=k5EM z25Qn-l)sB{DV4UXu`rS1y|zA{p8?cV?~}D|d%bSA-l9KE6Q@sScjE9-6W*3{^U!&@ z{M~QO_Wb#Dx`zFI{QjB7=}E_WBy0ZiurZ%HefnqbzkwWjIE^EH@O-Pn-G zoOWi0VA!vVi`|nSAL})keHN5gYuC6f_nX_*%+CMGc)q{=Uy;nrObMF`gDY94Q@m8U zxVQr1;`COy?AZ2@$1v^O9La+7cXk$kJjgEpVgJImHnuvkzwdUx|8?et74uv#PRU+3 z8LJYGzrVgd{$Km^>GU73cg_VQESC) ztG_*2e=@}g6dJ}GdwO_kem!5)YiGy&cw{@~{GcHJKzA5Z@9;Gl$6i3X^nz;K}Y{a*G?m!>mk zd_bi~zwI{(hO$aEb#-=TcD^GYA0PktWU@b(-RUDoTvSw5S^uuNn)UIl`TYlH&F>!( z4UcL3{eHiEe9cGJ`*JT|zWmb>r!`ecS-Cmh?b^!{4}X7go$IrA?68Q?5lcx=Pd?Hi z7_ljZb3e=1f4|>1CrW^7jl*rchlTxZ7#m_AJ$hCC>51pR-zO)lFHS!{@5GriNAB&d zj@B_(RXw_Vul=tV$|52n2`45ff-<*U{hz{rYy5+PCY|5=PbXpnLo*w%Q&pAKvokZB zqw{vQuCM<8@9)N{uUTj2T8lfk@f>uQuWjj-Hg{SX;-ohD;m+st4wqh!ZO^>C?BV~v z`~SDw)&BairT1ozTUeNwTfbcI^7(aAi`{x3J$-)W&hxXg+u7x71RfvjJ$zxIvtjBf zk$)!+t_odkHTUS876E|+ObTVeMWA7-fSQd=7s}Vo1P@E;>Eao7LK(MmTOQ&B>LWL? za_?G`UBcDsv@_&I$@7*qVcMWXFFa_=M>zLH5ne=XC*}`dBnYxRz=!ns9pI ztO$sS>9MQ*mGJh~))OaB3i_DW|EpOOv-8sP-P-Hq zdZnM=>1IjhGBRR28uHFtvNPn=(KhkuDc(|@E=(RO3Ovf&G^X1Gt>odkylVshl(bp1 zbSz>EB;@#;>uN7;D2Pj#(fQ(#lv+vG%z*iJwFTeaME)!G_2mr;3M%;W;-c8v$01r% z&+Bw1N{GnVws2lQ@8aYnG;7UT?n~F?40swtv>sa5>#;PJCs^b+)!q-Q`YPG*t4dhv zm2d7T^{`K|T1SqmE7~baKJWJL);*b)e8C7ua)U;4z|@P1n)Ix zW(b5i<&_`5x4F>bPExnS!T^^g!RK0bDfun`U}Z6vGf-nnpU?6+oUVt?&9&b6XmaR> z3afu7<_I`wO=X!YTKTxF{EgqehYMz(5b+9cJJ+JO=<>@6Gp6t?NRH0(RB@=?D_dB& zYQwwtFHRShsJSdG$z36|>%}DzT~V}tbd#} z+HFaIMlAEH7CplrH`A`JGaeoRj?04=tX%o@>EXV8GVW6aS}$!~==DNK*)Xv8)ho3V zPlF_QPAyn=Q%27JcwFD>7oP$(rrdCvdO@|#N%86Tz!EFgHDTf1-^;&%a^cHc0jebv zZL7aMIQ;$IK9!id0=?=lRjfMGysOn*76$Ax3*n4)(VOnPa+isdL&3glQ@m!LpVu`( zKhR2eQGkZ5*Vt*K|8?+z%)wD|R%zo%Sf`sQlaMz0l>YDWxM^2~)d`TYMB)m*># z(8<%k=WUyEcjkh(4llJjw#jTyJ1ga}H0aIU-Qu9SW>x6w4`Hv6wJ2JmwdPCocCnu|^GsHTAFwUj8B*}_Y_(cQZ0_Ng zmrE5-Ti00F>}&xkt=cl{|DN*qKPP0Cz1Ms8|JkkOt3N;PUkXY;TeugUZF#rv_q&Go zbNtj*gg8O9ub@hoEMGf&+Gb{k1f!e!bf4}iI@5R@y32q#{z2`QF_(b3vbJQR_JYf zZ_$33d27_O?{lTIN?(UL-_2v=a$QhkHd~sl*(mGTjoi7Mg@G~BQZfb-O|$pzzRQzh zq?uyGX{!4D&~9E$kdN|zG4tCrY)n4>XwzxE=Ae~F7C1Ifm^@i|TSQ>%){>;zQA&yK zJ10iiZ@iX&FwN=IipnK7=yIv*W>c_B9W_JJSwWJc)IYa)`crixL&L| zyzp3b}mcsTFMPms^XB(In`Mj0A;iaTZsGaM{-VA$Qi=(6UaO)lK+-?;uiD5-i- zQZ-@TI%j9*-Gb}GPA6>Mx!}6?E!Va_kKoDOddCBI@hsZ+^6J&AE7q(5HEsmu<@p&T z%yJ~e^kQzj+QY@gwV~!`5oiXZYOh@R-BR(i^YdiOet{+)?!Og?G}ZGvTE64q0V%Hy zQ5~_%gyQZ8X|$Z@bakqJd){I$kB*r5q)8@wW^RkpeZKa!hKSd5_YhT+%u6acx3}?r z{P=Og>Dy|j_SOD2$he?zX1={VD=X`d%k%%S%=BrSX`J3R^j>0)yq=K7Dok<(C6lrH3*?K6`nr4lVil)PifN zw&E-ytAYm%US3`d47=3sL;IZiC%}}-)U)P9uW;!`RsM#X;PDvv4;wWWU6V*t$ej7jEejAeK3&% zm5aNC7HKYw+go)o!-R=JNT{ZE;n(-~_n-YaeaaM2Z#egyyU&f8{a2nBS4Z@2z3$Vo zweNH2DzBv?eC(l4B3|K+CaP0r&FZ>xC4^y(kX6kO10FW!O`A90-edCpVY~dIO`C-J z?S5sLxQO!Be@>gO{i7(xBy;`D35OpxUi4UdKx4|fo)>BsJ9q8`gG|?II%l4-tXjNevfhlF|Gj8qIN?w`QrGSn}Zi&ydHD%AbacE&1NjeDx7Wtp1^C)eoi{^+;T0uC$+$aHisZ z`X>AJ5|h`x<((;_VG+qZH?Hw?)zQzD)u#{rjsN5>`-Dq!liQNdZzmZqTYmoUzf3FZ zAkEvERoA!M-g+>7&u0nKXPa(_DhL^AhB{4DdN6HMtbi}4?UxJSAtOeH<$iMyrO&Tr zW3Z_Fq;jwJ``xhT-w$!?A4o8Guy*^sNBgBsvqHKP743e#Q2z7#{{Lt8|4Uv-N{=3;cwDNQkd(1++Prm5A&(q(1x9dAm5h*lB+4~q$_)iW zmQyOe;SUa3s#i(Oe*gX03f4=)4Yz{C*}jA<*k@C+S7^%{TPe=j`pMZ`9>MX+j*Iv_ zE-^p#GVeItDtD}6O6;2WJ%?KNWqL*E_}RTpy?f*O+V+h*V|QfFc@y(1W6R&A4JVll zdh%;;FXmmMSG_#@@g^$;-G#4t5|SDvF79y&cJiL4;}|^o1LuDanHl#gpU?f1)3rEy zd!FvHiC#-5c+I{a5y>-WdeJ?>5Ut3DtKl(oxSl>0Ygx6%&`W->ukM zkjm8>zTxH_@$Y?06k1p+v~I3tG23kO{9`?m#)rmBRVJ`w>3D==@?Je);~!%SQGVcZrxhOBQ@oSywg*i-!bbRum|RvU3cy0 z+_>`mQU>vL%2Db2njFt31zK?}(gY1fKk8JU*KqkIXy~lRO*tz&yYRyU#}_45e_qG` z7xLaRV?of#fcW>X*DYUqZrRF{tZU7_Jnl?wKdNc&_pqXUUcl<78*VpgD=xo$-P_{1 zWuAQU+B1dBf16G}4YJtV!&CLeV8Nn8Obu@z?6}?h z_M?hg7SpsJZ_3Q&8@H`q9C9jZYt8K_A)ye1*@yWxofaPH;#=7A>hn>U=bxpV#Rzb-v4`H$Sda@Ap_7$Ptw!$h5<_Hh5{2y_?+f?Wcx_p+GEW?f<{uL4#bN`J)+U(`4-HWTee<1ftihIPmth ziP@&Py3hCP>gnxTd?DlP42H0YEm2HGJ0(s;7c5zI^;D(mX*aL0p-yj%CWw5o2q*|y z6>+}h%8K>Ny*iZa7HKcsntlDz?fm^mr)UN8VlDkE})RN&m||`Zmq!o$!^bHz!UIsHyaSo4Vz|+uVxe?YnpXx#zDT z!j#@5hgdCCipN z3mrYNN{Dl}`k}u!V)gi+6mjyfrH1fxyPa-et5%&%4>_;7P|mjI_5#ziCvyZ__WxOE_xo|}-M480At~Ps zmzM9I*>SpHx8#kSJQ2~28zm*$e!OWG6`lET$B#32^VpuBH~%zkir3O9{feS~k@qeZ zNVY9lapKM5BVFCnKc0t&q_mxV=2p9xS#9##qcyW<#aNV|yOU)7?_;~9ukYDo=4)%& z4!%=7vOVtTQQkch{j-zeBG=}~TKt*stPvUYo3Ajn;3-RYh|Ia&SEH12vke7fIrn}# zrEM^C7V~l$yBdkt*Vl^&E_zY;_3B+lhU8;k7!JJU+~{jpmcu{4`uv=ghx7M`x`&)w z5t!+?o>y*8%NCQ^3$J&ViT}!K0z@ z@vQff=IhiqZJy1{Q{;8xw;Y4x=dZ^fet2-8k&EHLzrUh(*Xw?ryw1Pje`$SD@%hj7 z)2ByYxbWb>%gbBsUhaL*$aMS6|6SX4-21~8@43U&ez;j!-A6+=wK=5HhDBAC*P?LI ztn;7W+^p)6IB4gcr}iX%+W+*vJ$sDmZf;+-igW8$GZ7J!>yO{utorv;vRA7|W@g)* zIdT@ItENp4?MObJ6%dkgtdUuqB|S}!-?6ZexlcA*&Y~?#U$O4TLX!oX*R9?9aQppP z-`mg6TYLQDW7DS8EiB>e@6SJdI&H!C-`ia`YEur2mlT4*jU8FBg6;Nae%l@qB-haG#*DfnT)h^k4UMJ+&Zu|S)gM;yX z!j!|+YATaWe=iMQ{nS9}s)5wiwQ*+M{oy}m{ za^1F{CF@qMw5kj7=dkWtx8}>&Z*ehiZl|TD9+HiUohvKEd13W*#?sO<6EmyYC&m&} zYAjV%c`sx=t=U~*$N2a3r~hwa!;0tLeR1z@`GbYmwSPQMH(9kX?DWFx+6(qb%s;jN zu7%2^G|Shom~^dPzka*pjZyRY-LLP<9ZdPQY~@MO1jDHC=MU!3zkOCg(UJAs%i0ZQ z;!awr^R>;pKh^X7`w^f0GOj^(Pl2)ay52Ws=C5A8(Ossiy_qG3fBD)dr73GJYAE08 z$XitM`|bARUteDC`2B8o;`ZAguZG8i+RtzGj=#IR`{Tt^R}D+=UY;Z*)ZE7A?%-fs z=HK!8lfdlS&Vcr^tx-o^+1DLn6E~YJZ8lq4j-QjG|6%<%)hWgy(@!(+zN@^WJ$3u; zM5CLE(|`Bz{h4lT@!GxKN6otG%LQe_z~)Jl*iJkZI;eX6n45b5_wj=1**j8A8*=AQ z5z&n@o@P9=sXWeWDNopH?yXzR=BI|~#ct1wn*ZtV`TEw)f0Uh1z55_Cv14WC}+$OY*~4H{9$e=0v| zYkmD9x_E&})Rn6@nR!$qUR#ujtPAT-UMTuXVd>p>Y>EPJF8sBg9uU@{8~LelapYn{ zqkQ2xHM*^D7#iAseK^hW%=B*cvEz~QZc3{Kqt`kJDtsc2+mXc4L_QN~82Pzdi^5)3qv#*x9GjGD> zlMd^{yNrahJPjGnD*r8*5)hr{WHx)Y{KcXxS8v{a(|%rl+gWC7t8+{4ORqbe?H?ul z_+xni9L?)_>Xfp;Kh0&#gt@Q{K%w{j@P| zJxBJJ8}~N6J@IaRi&cd5s^SY-t+lrq1FX#vCD5c`^uG8pccX`sXL3d>Q>mW zXlkzc{2-$$DwBKB`IdM4|JT+0dbwOSuSQt@mx12p|YtMU|KjxPgcb-gf{{N5D z?ssz0P7yi(FY`Jtt~mC7|Ml$=>}6?EH(%UI*|fO+f6Iz<_ikwHzi1z#=dxy={_|a4 zN||wOPi|>V>q~w8>dlMm`rA^sh+Uj|;n~^Q8*^?NN%Xp@sHrI#8VYKMt?AHM|MvFw zTNU)w%k*bhe@ z-x5m^*l~tPWj4a=>@#dY5?qH|2(>_-p zEG;ej@=8?v@=~L`X;&wPS-6Bd>F@tzB*Vx4>h*h^oJ@VW!9Oa#r^=nIY|d|{ zrR{lrAuPp6Q%6j^>Wcx#yy#sa8*bk5@W1Y?HTA=Lq3!abr$ZI%ooDwoyzt^+`1JYn z$9vW97p`2%>E0)E@csV(_g>kE=|;88v#m}#+{O!9a@eLmuYyTCd|k_J*?Xt$3m>`I z{J4;GBI$v3pYom3Hwm)QCii^L$?~|@?D4v=xO~U8!Z(vbf9v$NH1Dr0*D>21S)8Y^g z$;0(=8xj~}^u)L2-WKyMyzR0>y7AyNhD8?_{yN{%<2Lm{Q0M8RTXsaAJ^1c)Ne{1| zLcqyQ%XS{>x{}rV#;4my?c>eqiM}(K`Og+@TpZ=JI`qJ`CruY6ZoSf-vAlDg$gZzZ;ZxdugoSLL~)7X35N*m@pQ|N+JMzh1<$T);p=hl{`Kp?;rj;@dbOVf{(sw%c<6qZOSqG9`ne;2 zets_e^u!Z1(s3-g-?q)N_?gR;=@-0jUh4MZU_5MK_dm&VgKuiyOW%z61G6(qO#T_O zE?iJ-B>6kmVs3(abl>OYOFz3D)R`Y)objz)rZ08M1kTN8k40G&d7VotR8({ny>QQM zu~b;MFjuQd0;gF_Gy6j4<7*Ye<`(Hp@KR-Lvst@v-@V2bmaXR4?_RF1{W@T|+ zs@{}4ZH`kwrDN9=k)~y8oIRa9HgX4^GOf~DI>Dpibd{mq*TNgB3NB1jXDv9WX{KdT1)t7Fj6oVF-DpDlH1P|53a3zp5Ax_ysN*O4X9ey>`+WWs4qp&k|~ z-stsH^48>do_teVx;1FYQts_P<Cn>qT&KV;vr zh*xs;+WySS^j0IwS{AOQ`L=uJ8{huOY$k2}B6wx(?Iq__T2J$qygpZ#zbf(Y1@+}7 z_thtFO0BSIIIhbm&Emi`ojX9|!2e|>RSQm@l4JJp+xg>-E4G-Z{?&TX+juT7_dou6{r-E)YT9_E+xG0S`S-a?RC_^yhC%MFEekSRdc-&s zH<+3pjEV0z;O}hj_2ZwxdT#cyqnqzr%LLt!6*7rjYA~Cb`?_??vu> zI~(vMY}NYnY0`p?fqkdAjlS$S!?=0ofvnI6M+!Bo;+{2JUDa^>@PV9ZhjYpnEDYpq zZDKi*T)t6%-(|h_t5W-(PL5G*_Hj!v+x|y6c$LbEm1*e_y}dyy>boC)W6)bJ;YHzxuC6*D@7fUK zrx0H8ph$3rPfq^KIgi|Yx5}h#?mlaO_T=`+*tH^_C-ov`bG&-}WW|~kYsYDZH+0AYjrv*XA8k%7WiU)aDhqA4`%IlP}VyA?x%i^y;p1k#SQc75rc)KZk zc2|+=rAu>bq;KX}S$HE}Nj8eIMwppuEJzhU_sh!Kyx?J_eyjyeT zt#&1b>~Fp+*G?_GS~X$DlV|fS8D4zJyHahd{Lb=rj@68_VJAe5u7sHH z=l1nm@M;f_ZMErn7O(TG7wo!`r)7E}W$NK~9~gudYz%BW=5~MEg$x^o37>vyg~}Po zt@O8iR<*5%Thz;9u26;vPfurFg-y_nw?Q*}@*>t2Wt8TvxZ<$Zldtts@1tTZ6}4R# zuc)+!ocgznr%>odj?k45?}Y(I2D4{2JeTGx+s&eR_eR;J3`zOQy@47#j8yD$c^OK# z7G+#1+Y$SA&viG@ntvs++2;9b>-YW2n*ABH3V5Q|(kJhBzgNrO_fsuUYwDAE)$cM5 zdygi8R>l9{p8B2NW%1RC-|heHIs3`Q$+@|Cj!mTVxA*$}7X0tGli%XraVS=Q6PYZmp2c*^GS<<y!1eYyX2w=e&GY(Hy$f6m9B|Mq^bQwe;S-~ZLBc^~Oi_wT0p{HLeuvoF8boZ)ll|G!Ps zr^bubF50ie61QsUEu}H7l!V;$rvJx2GIm_SXGG%gXH&_UlxdbzNdT?8Lz+ zSZny>#l^)HKc7y&xII7q%j@g>e}8>F{OaoJ=(+x7WoG;S{mOpw^y$N`*W(WV`T2Qc z*40&FmtT}v{cFfcN>Y0CsL5R+mw(a2%btrf?IsJJnW*}j;YxY^soy-4zH|QU6R10M z`_b~HzTt}gPn@db zt&rQ1^ZMtCh~G({k7bB#^IN@k>(Mit-HIhQe!eH@?GoQt{bu9w4;P&If7UF&n$>*g zuF>YSvxnA1ZeFA~O~d8!8Mg1r7c#y$>Tdee%lW3PzrR|lciGLzESDDJT|Ch} zRPp+C>j^U@Z_e9#Q6e_Jdf|hl#Gk?O?;Wak#VNRcS+RQa;{5nR_Dd5Le))JTzPMo1 zCZXBp`E72C9bH{nwY0U5ioKq6^tOxf45p9sIj>&3ReR_9>X5VPomPi@G-Q01U0Ce! z&0&SIl5yB%&2P##`y8_8Osz`ZytAS>xz|lD)Ht#Iuxy!1Ts?R2wPv>x-)WYw0~&PpIDXMZ0c^ z8Os;SGPXLgP4DKEIMO2BcJTLHu4OGzpCaURc?!Me?}%Y@KF!Fg+!#HLrDm$Ws*%h4 zSkM%+{{BBg%Iaakc0_ z#nP6iI|?$gKE35>d2~QUWy3|&=-oL>FK+Nt({GhbTvBj)huh-vDFOaB(huyJUUD_d z^31aXefO>3M;x5?aJPs=Zg|eU-**4JZ%(NIW77FYCaHQCJUb%^Y7zI_{nE(W z`E**@^yD`;Htu--k3IR7^}4;B%N*wT`QMOzwRDrr^Ijh{*U(Vm{YOr;=}d3qNfzW; zs8IdyA@8Bi12@H5nC`evKH|dbqbB|3*Rz{m*=|2`eoTBebHaq_T?wZbJlxg6#eVH? zV9xi3J$qNU8~X)?yKcGn^iV4|Lql}_UeV9b&K^F{$Q&3I)diXlWoG9S@z%N6`D}&m zjiNaM2M@KEUzr);t$wf9&Gg*d><4>UH+vUM)L*)>O={oVRr}X(Z(~z8k*Yi+;;J)e zdR4N4Mqtz_w;!tF{-3uW(_c`Yz9xwC_v^T}P`FqAM#>4;d=*>(3_XH@#-S-q+M z1vq46OD+38bBfEa=b9l{sXv`z-{y{6QPx%8Ocw09BlJyZ!i4{p{}r0mCd+y)4Y^Qb zBX#Ba?PNLjHtY05kxW(5fo-?Gf0%!;*t^JSGt1V6(g8Q&o`&-5HaFXSKGi zZb`DNe)4KT*lDIPeW$sR-0C^)5;t=40@>y)I@_}E&nIu2&u5Hhm}CmI@klZ?A5@s8 z!O(EHoj>{Vv9Addg@+@#T|;|C%tFdv^m#9wz*ZsF;dY}VV$sDD56g_#ZrhPG)kfM` zQ+u^FLs;bR^Icc6Do;4~{j-ml=_6$9dQr+*s6Jm}t!u{o#aj&*-*9Yl4@l(D{m2%q zBh{;P;DlmK^dq{x8h_x>nd{)no_ALQo#k}sL!u|vWpXK$`q`GJm`86m&lxN^u&`;uoq)l2Mh zvCG3}XAM*y^%ku=+wx6yr=Mwzwrw7#vCQYxb47t1-ztBv``Wsj{V;2L&(Y$Cw>&(= z{--~X-|W3`f?Mr|N3~^|K^%$~GH%_sir6yq0^4H6rrgvs-wOPQsqp0Q6hkeI?SLvMZ=CD;(>~SkyJ^h@;j%^?FtohdI zUdf7Fout#M?CouA-s>j!zht{7urNe*TOVd==)4-X3ya(Q|E4*y)7< zTlODp$?(ef_~>ZFo(eqyNrOO18;(t2S4c2p4FSW z=ko&zyFJm}*B5tQFcw;rfB#2^b8YqZ-m9+;wQ`63yEQ>ECpxBXr=d=BpQ7`mgzdYT z&EB?3*jQ-3Fl}|}TD|_;Tj{7>^OOJo?XMXUO2e-UDra3kX)!upj;_E2}$whzn zt+-m0lD>SKX8*&(yB99mq~j&j+MnTd;$_L9#~%~U&9U5Y`|XO=s~@k=+#0naM7G#c z<64XLqukDGvl_UjO7dDR@~qjzm3-{Who60u17EPuowJ5>$NAsY?_VFBmc8e4Yu4h3 z?cqCqZa-Q+qx`mtdiI6gofX)S2n7^c?(k0jlw3Br4 zJiA{n7AJKc{Cv*({exEVIDtFyJFak)JyRD-D!tKvY3IW=k2R(QbS!Hz%ef(NMa!?} z@T&U1uj38VKK1UXOY+-2O`03D-m_bJ(WG$qFVh@e{@BpQ*;rVbVw8EpIDE>w)(o!| zTegTiefrd3rjLe>&XE@v7dvtsytX#F@Th2bhicezg&9X9R7za(Ij8jbZ`k4Dwpfal zRZUQ3QAr47?F8e2cmHdCyS}R@1^)BxH1zewy>+_eOVnICTN1o9W_cf-a<1`( zZI6r6!G+H4KhE>=@>*1XThk#FxM!iUqL+%tQXxnE=Lh-3gLmmI`fdPn|Hc|ncX=sj zs2a4~^3TuD%BN1}m?_)a%P;qzpSP8N$M<{H{Ka|u81=$S78}HQz4+=S|6Pe;E@$AP zZWp1y3dR2{Wae!+rygju!XXW&V2dm$At@z{JnP7k6h>NM;yf3lqmm4d3S#az$ z72=+JvTtAQLhkj)?B|lQ$SV5Dk#C+EX3uwRgN#G-|@=gTORxC{{Gniw8)Z; zU#{o#^Yh&r6L(n5^|^5Q^FbL0Es@4&n?pDQ4>_L5pBeGkQtIuOON)ZP8BCoz6|~Dd zZ_h`!jjn>dyR51MzN_i}b@)4#FSc)SOY;S5(Hwy*V%MD>3cUWKdGYBaNj(D|Wr;U_ z>#sX6%&2?0CQLi+{Jh>)Zt=E~zrlfljaB;Lwnv|LIVA1PzU3F8vu=U6kgld;{r}(+ zH5X3yh2^L2|1SOfeIs|}MY*5Bi%zR9Zpq5d{`lcAKYPvpFPHt5wY9k!vhRV;GkCn~ z^}55S_4msdoll=%E2bU3?#oXqO*6=+zr259oZ_(w&msU0G|E=f5(Cyy4*-=K+ ztCVei_E)~v2YbWVAADo@dc`(kcEJwDc5cV{$Coy>2C`l`xb_OywbP3)9bK}I<$!$X z#?$*ZFBZyV(wrp}wZG1GnqI6{g|EiEfTAL!eZO9k3Ta!PT`+^2z z?Ddi|InyP42hPUadN0M$BX!aC!S0QghaPf)R=oR!IjrxD{Wn*3rw3c#B2C4uQN7RS z*UK5Fo#EKA>}po@-22k`dm0ZNa#|C=e;z;g!Vs;6mtQt5t9(AU{KGlx_aElh+f+>X zF1vgZ^W8^HOP5?RXDpOb(A>3g=PnsF?gu58%XOvZtY!@2VfeaJ+VZH<6wO&evurAj zB-%0qJ-4*YwJu+@X_L_1-RAu#-tBxYwcX;K>4OF)*En097H$!jO;b}bJ9_l! zkGCJzEBHLOPzN3AF`Wr4ygBWxQ&2z8pD)hqZh+4G@S5(pW#)wX6|L=ZRURsyp#2X@ zVv95vzTfwoFZp=i(aHXHow2*iK28kP1RX6>D&WiMJJX1D=gyroOtZzly}R4JGI)8? zuP-kvzTYhm3=CA976Ce9B-7pHuJEMOPj@_FjOJ3j?}>>{^``mbkh^ z_nkg*;=t?m`}r6)+|0SLyIg->^*hTq_xH=o*Zbz0 zX<@)E?o};%i!Npe%%7mJO#&3yOOcLY!PpNozwVdjudlD!S6`JXle(6B-uX%{KPdK< z=lXGqiithCnLgh&Ffh>J%%W)$b~P4x`<|M4EZrpGvaw9<7+;;f_9mGzf;WrZufh;nqM!M|JgcKJN(hL=zP#_ zwOhd>?(cT7Q4HQGj8?Dl?R#mZ5S9dw6vPerZIzd-1PmA?$8Wgmhk=E zUAz09OM`MEzO(Yl|B@7%spfU5+%BbvSK=7&p@8f|+Y}~hDNHf<*~8Y`V@7HGN~z3)J& z`CUfOmSYN2pQ>u;+qOScKIT5<--kx|3HLVh?^^!7OT#w4{bjN8H-`V0=jm>Ulr~Iy z6LLg)veK!?8UO55%Dr8GrAmUVx*NUk$Pwu@XT9((R&QHB3B_pGwy##I;d8kCy5QTF zLJ?89!>P4;?$0i)>G-r_osPTb#mpFEt4{$&>V0qAW1N)qUKdxoyuAHMhGD_3O+2dg zB9CSTu3g`J`>oT{*3TC6{u^JB;++*$ctq7`4a1k|=X^B8a_;SsEZaTz|DWSOx&Fiz zF=}nK%9wRs`@CZMAC;cjC9y84^E53wHx;v16g-Sq^17e0_0jL#*UEnU4Ao_MM;|)> zRzA0Q!vmJOd%Jm~=9)dSv6161`%|v_?Elloj{1V%bwA{G?%wXMb9l9=t3>_VtrEr$ zZ*^R%zLWRn$NMOo4-c3poK*g;DSK}}`?R*IGc!t!+4!V{0_F1mT|CrKP1uUe^EnnajmPty&#rvS{HJA5TxtuI}!M^XB!{ z{r%Ocdrr0cY}(;tz0!i>;_WXlFF(G+m9hr=+E^?d=z6N#y&y{GFP zJ-KYl#!za9Cg?>wmXO+3W%=l|Qg@gBjs zGVCATyQrHQPwmJQvUctG+pL%)6!;=EP@wO_`K70nqyj}8%}YZsxK0V=5EGFMe7MA3 zqC!xomy1Q;ZMCTPHTkD5Ys}0x@yLAE&1Lhh;^%y;R;>z(EeJkc{{G(F;NKBCY_5S{cnsBBoD^-UzHpp9dzN8~ zC7-mkbm8M;y*;`AZXY!Xo%8Yc_xHcpW-+ge-_O^6c%oHvPF~)z2M-k7+}u>$r_Bxt zJ=)GMU-0CFAVXB_*1NmQ7w_L6|Gn0j^Wqw&#sgdIO1h6WeSd#HJ?HWF--Vx_`EJ>^ z4RoBsi;Ih^+Gl=kI;b$|WXi4omy$Lr2ymQP`Shh_Ts_ueAhLnPMuny!FA~2 zhb@uYySuv5Y?S_gddj^gPQU4(!l%!l4b9B9sXY7g>(^IpyZV1NxwXE&yoVkdeERh1 zQktdNOrH)HB>|^15fbZn@0QNnF3rr$eB$?ErG}j;Nl8p`>&tIdxdwtx%<@n%%6<0k z=Dx{OX0BSr&~WKee5=j!X^Ssvbai)^-Zq~sz{ntHQ_+xMFk{=fyzS0`B2%VMe|&bf zdFJgy4?pxMKLH)Q6}~*QJSRWjJvv&Njg9S@{Rf@LpMMs-zqfZwDO)q6si~=kzW(ti zPgIgNM!a&D?Q}^no1O0CaD82@v%5RHjU2z0mR3oxeYA=YXUyKJ(p$g2eJi_>V>aV# znv2rJEx8jto~%E$L?<>X1E)-x!f-)o^1*})ri_d}PG8nfR`*Z4leRVL;^oVe zx1D?bdEwHfsebSG*8VR0^7ZTA(3+i#_U)7V`t^VO%F@5TzG~>{wVi){cw25%=GXA` zaR;-urq$SQzYRX?>u9&Qw;ChkEy<+t@bF`A!&Zx~kKgZSTmSu?EJFduZ~0BP-x^5p zymZ>4wb-uXV7}fnjZ#t^2{0Dp7?iR zq4SOH`SKy5M?ZWpXlrjbw6oKDt(?L;{dDWRd2&5{eM}5`F*_QTEn60{@KE&jJkVh& zM$Tt6U0q!_+vNABAh8xAPtElXcF| z*Y9ytW_W9LVzRowK=)AwhPd_OSFc{Zu_aUZ+Pc{8Lx-G7%F0gt;fQ>EW~Q-+iqMKR zYg|G@Md$dbm%Y6;_13$O6+z6RA)!aRM71wmzutcA*s&{*zvo?EdLnJ}!z(L;H$<%k z?Nd8(fa(1pBB6%`5=)mZE#74z*XssaizOl=qT^7qQ&p<>P=<-#3E7w3kxCOCY~+rg znyQ`JzA2-pxA$O*(b9FiFWX(;c64}1iEUL@QaWj2)u-Vdv$Ke`xw)BPOQc$ip7^(S zceO3GlxjCx_i3EAssAUVH=SFqKi#qIgwV-_rN=+|bZB(5G&@?%^|Pt@F@dvV8cUq8 z(kY>f86v;GzjsehS2xSKpWjDFy}x22WQ%mvv4FO#mNk BHFp32 literal 0 HcmV?d00001 diff --git a/doc/graphs/lambert_wm1_errors_graph.svg b/doc/graphs/lambert_wm1_errors_graph.svg new file mode 100644 index 000000000..36924f354 --- /dev/null +++ b/doc/graphs/lambert_wm1_errors_graph.svg @@ -0,0 +1,55 @@ + + + + + + + + + + + + + + + + + + + + + + + + + +0 +0 +-0.1 +-0.2 +-0.3 + +0 +2 +4 +0 +-2 +-4 + +W-1 difference (bits) + +z + + + + +Lambert W-1 function differences from 'best' for double. + + + diff --git a/doc/graphs/lambert_wm1_prime_graph.png b/doc/graphs/lambert_wm1_prime_graph.png new file mode 100644 index 0000000000000000000000000000000000000000..0c8f2b46603b0f8771903238e56fbef08310f8fe GIT binary patch literal 16478 zcmeAS@N?(olHy`uVBq!ia0y~yU|h(+z-Y z1_lPs0*}aI1_u5_5N2FqzdVzHfkCpwHKHUqKdq!Zu_%?Hyu4g5GcUV1Ik6yBFTW^# z_B$IX1_lKNPZ!6KiaBrZmRE>e{dfH1_dKh{FJ2jKQUO^@T4p(DbeXtr3=9zwIkI}u zy=?ZQb*?Tt;VvwU5B~)?1is{0ST4e{#9Y`zy?4sz-^qDm;T|6Lv+urtUHPeH?%bO{ z-)y@1e%?&u=QE}_DYghWWjx6F6FaA;x*lVhvv3bqF;je7;0IM`FJ$vSW- zwmhDsq|zebB(3S>#G$xlA{{vzL4JOG>F4Gs+S|vMizF^z!f|t=pt9S8=g*IyoUC5z zzA@5EQ%FciLqp?&?9pYZX=z3O|9*e`@}=k9U8Nttd`bEC=H{+sPHPp{6+CXeQmrRb z9{qm5|GMl^FE=-~lP6D_{bl_9@wj}l(aafErLRK2@BR1d^$Z_1w|=?WtF^DMuRoq* zw6WsjBcr$GYHDp0CJ4mD#BlKOshOH?_2~}|RP&qDaWW<8>@3r$Vv(nRzu!-PcW0;1 z9E*viudjVP$S!|jL!$HDjq9?nt%;oBqh|N#gY(@$7fw$>p{HdpE+|gZi40oA|82$$ ziH7XDA9*)6FgEPiv19eS-!GTXFDNTpmVSO->Zu=3Ci{PS*e-u*OXg*x-1v)!4jsz4 zzD{;)*40b0PiNKr`g!(~Vwc-8J=g{{C3TS2s2$hwi$cc(_f| zLDs5dh0E*q)>ch@ef_DkXJuamBudjQ0?$%;= ze%2LBmMkfYIi+F_)ytiL zP3-Pzo72w+Eq3Ewv}lopK|;gTDsla|l#h>&n&jS^^6u{L%~@Bq>i&FmKa*zs{a&^H z+UV_UJ<|?tzhBpVG9~H3fyR>8*Vdk>oo`z`&9eAe!J{LbQf4_PIs}#1{d{X+XgJZb z_}Pcw@Ap4`{P?i#_dCv~r|GV}_Vexb`yJigi>trCYiVgQ$iAk-Cu?!1IAzdw2I z+%oU!dOWgLBAb7nYHS5*%DHKjx9g>vlCtv8U$58S+?dS%_;~;F%*)GiZf+5(AEcKo~!#rP(SIT5T`TKiEjvoDZxBULZ`SZ_TSm^xn%1U7d>#{cwX6Nry z)YtFdSNr?Ya{u|+&ti8JD9$#^J(OZ}ak;?`5bw#u8*Gu)F;NYD#KaJ+s zev@RFYhAv~wOj1X{r&UL&Ndg8mGymmtXKDTYD&t7uh-*)_t({~w$Tn>_vFXN$9HPK z-(@&6)3}|Po$tZ|M`pRYABlVR>{)ke!mL@R7P)rc*k5n&rTOaWYWLM)Ydd;-Qy(Ae zT@$xgs$p&P_NY(2GL}N&;o+cA|Mm5?Zsq@fJGjMk9$b&FXMM12c3#qr4T<5Y76lI& zq|Nh|L~qYC$-LB}>OE~k-QTLLtE-Ow{eItnvYPL@-&S2g6Q%{coVrETr0|go>x!zc zuU4*Dq4D(j^W_X*&)5IEoV7Q0cbTSx?T-h|S$}?fG=IH3S zDr{|(mX?+mD+`N8dV2cTx7+VWtu@cRWx~3m{9dKIY3{8npLTS1cCL!toObH!)vJ@v zUcVmx_5J<*H?BYJ*54PlEA{4;mBCZHySsnATD^WXy*1l9!X1Lawiiz3Q#MH|6UsrmP1C8nx{0?{E6|>+5UL1;=`&msfp%mm67sc9yA^ z=F)j}zcN`@TwNU=z0I=lQ47g($p8WgLTzS2wp+ZM@Q24!$!C9_~8-`T6|%uzmaXoysxO zo_umiO>HeGSbqKae12+>*WUmCescwEPCvix*1In+FLMPjv+-<*iu*AyW@A#TYI}Eg zH`A3~^Ls0bii*};i{D$d_37UC@87S#wKaP=6Ekz@a=*D#g1l_MUI{*R`EoGhsl$g4 zPtsRab=53=y4N)KmdWblcQ>VWg91NobEIkZH6IY3c{WW{L}bafyt`Rj-}Oiui!1<@ zq@|~Iw@0LY`|>4(onLOxyVn|ChcY-l1+|(di7k|`{}cH3{{H(#)`o_GtgNh>{{H@< z0Rah-aS<&|O-&&#E-knAR&NjTTKWIab9=6UhYugF@|$ZljemoD-492`@Y);V{|;VX z8SK9I`@L!{U0vU$%a*NDpI70;sAXk!Yg1lX*)}eI{_xV**Fw|J&kOa^oH}RDnpvjV z%bJ>-*V@T&bx+v8fB&xc`+i^9S^PZ2&#&*P^Y$(6kNf29*D+jO9j?FnjjVN9$n$e^ zgBxDm+q?VezTNM3d9$*zM%JE~9$MKwVgCI2yFMP1zB<*l?}v7a>542! zJ3A{ia{mU7pTB>vUKhK26*D{EiamR5PQQ+d5d?*r`JIC1uI}z&FU_y@|G(FB1$=#d zJzP;yaoYF0&(6*kU9f1;qBWcPWGsVbo=w}DbyaKWlpt1C)~q8Pf~Qi9R_5N`Huc5N zYwP3VfByOvw{_1NR}Bk`h+YXpr@7YUezE&%BJY;n&gI(h>rnBxH<3@@zFo`k_1o?I zXxno?KR?&~ulKIt&epDgqM}V)oScECSyuwI!`E%miQieYbXDNuHZES?ts;g?*NH5A z@E}1{QgUV4+gnSg1ihMDes5#VMgh@-8cvrC7YcoSdwaTc{+^3Px6hyN-)j=nxNP=PqZN6l}(UG3Swe)H|-s?V>P z6ty+$;nSx_Z|Cp#_3+?$eQoXIM@PFEYQEnsm$5GEIWAXyrpV&N@#F0e54Q`;%b%a7 z8@;aT&bPO>KVJ=x7nG9fTD^Mp)rZS3Wn5Um`0(MwBS();oIJTXsH<1n{L75{Q2ikP1SyRcX#>B@8J_c1yvibbVpy`u^h9@TQY<1)qM745Yvq+ zx%zA0zI}gwJnnaKae46MNz3ZhuS>rtn$3>fo+ld^7Hb31Eb-YjZ z`^ zM~@yII?%|>Xi@fNM(W)2cE5YBTnYL0{r&kPox*Fk@pE!&e%|-|+}zXi>;Ii}=C^fO zAGcTMboJL)M_*iAY+3)$ruf;JomsmN9B{a{F4lXtSuTTwRf$H!(+`_hNEG?4;8Iaj zEBf@r^W1#<^R3+C43B60y?^w`5djH_jGb>EJz{d$UG{d(uH#nL*2!kGyWe#E{a$RP zr>E!Q=Jx6D_xr_fZWuB#G3nS|;FGa95S_m_HM0EsySof?ED9g3D)w`3=R2BWH1$WN zxVn|qteM8?n<_u2IXOFb_V+K(zP^sZ#nsiY{9VkqH#eQ*;^aI%J*V*}HE@gTeYjWs zUi9aUw9PX$gO`PPoZG)Te7&5Von6>zuJc!8ULRgr|Nmb_Rn@dC`MFl5i{kcHO}pLt zzB%petk}>0zpa1Yyf%9Kr0LV$)6$k*{hu8bC6(}J|EmvoiqA*h)vNLS_p5wE<>#~q zr`l^>HEY%%KXxpxG(IOsN519*V_{)okF@!@SNlFbJ|4U|?d)o!)2+Kjy}JTbtx8@9 zJU-r^{`J+>I|YY%udIy@zumfI-@bhe)20Ok1qm^%4qu=4_*ie)>$djx$&)7sudGZ; zN}6F=td@Ok&BD07RWr_}S(U%ziP3Z_EG$$}S5G#Zz1Gfwi;K&{&rk2u#?`xyK6(AR z`(%oeq2Wfa@721k|JS$k$!?mnMPEctZrxhb$VvM8nwpvo7i;$_iSAQ7c<^BOU2!QX zu9%;@f2{8Mbx5^K-F3wz6?OH?d#lUm%$Wmf5+xt+YbcCJy16Mebl&m}tYQKJ3^AHs z!OQ)g_F2DM@yQ01_PR}_&2l`t#dJS>{>;2VWU=pTv%*hLJa28uOuo8V-@;;szy04W zr;Np)K04a1u~cXMTEEu+>&x#Hw)^gNQw^M9YiGC5Nq+l>s5RNOo*FuK*IzAFU)A=n z`Au2Y&reT}96xTHc!Hp1q%)o@hw#0vNn5jYwPL|%jBe_6KBspeRFejnCpogv&$Qk-6u_&q@kg) zVWrZR`u}y)bRv^>&Yd{%pmhG8#*-7Wc>a8?S8#b=99O}iLCqaArZu}v9*;nOmdl7Z2$Ys<|D_Befs%){`8-Q zGBZUM7D?Dvnea-R?Rk~{@6XRK@9xgNwKdzg`df~YvU29-WxTb&zb$p|mt*jmVbJ*Y z_V#eEb!TUrUtSTY{BGxSxvFn(P9EtL?(FE;U={iP)vHsFj&^hM@;+U+``x12-`{$q zOuHPL*#dW$Crgz%id-eZo7cE{q(=eIMceYvTjSY#Q zW~xd4y*U$=-KV|Y$bJ91ar(I>uH9l+RtC3wPF9O8{kKx5sku3FLjt3moSe;%2hA=n zE*JLK*GFy1NHk3e`2Fo|=A|W^-QxPo;`i6}NSUs>agHf5G4aeS)9x)>Om1z@KQCK; z=b&u)9mn6_-g^4_K0U3!e~ZYrO*i&do39RA`>5akpT_583!~-XaSug*h!^}_xA@S6 z*|WVXDlFDUZwIxu!~eRtx?bE-nB2xA>6DhH_VVRR7dJPf@^>-s_WjP&i`j9Ym0LXH z<|b9&StgE}t=-++cXyXBul)Qh?6;PN#)9bWdDHS1wQ{Y$^8YpamzS59bMo+{yu7q@ z$IhJ_^Y7bnadAl)Cb1Z&pWCx4JUk#kfZy(if}NdR%$|ygpP!!xb&K9^zklw*!Dijp z&!0aRmXPo$DfwdhKO+13I^XN-Vm*C*RqgENb#!zHiS`}J+kSo5to!%x%j@gwzuWa% zFK^$^XRqzTJY)CO%oNj&y0AK2-+TS$Nhi*pO+7V5b4%XcS@Y|Db=v>?(R{!D|J)BB z3gW8YnyUHCNZ4BE=*al)-Mfc{U#oFke|4 z{e9PYb8G9_Cr)^rp1#Z}FE5Wr&Sr-9biIj_Cp-7c+0HP{7F!#&)k)KJd){50=@Jbe ztIRVmwal}vj*5DiuxI(6y?b9?T+GfZWwJph|H=x%!)?5WQ;a6go7Zez)T>-=|NX zK$$l(GV;sI%k49b)8npko7mgWZ)jjxw0QAaD^HE3C(fT=9=$zpOYZG!uPohMTrTXb zE?*s}a^&k1reFij)+TR$ulozq>B2f$DWqqq_w*>kh3JfwI$y-52KBR-ZU`Zd=r|hYu4qok0Cu$7Z%IxwofX zUhe<-AiKOsbc>jN+?jUyx{RH3i!H^|zekn45^Fx0a_p@0v1h_gH`X;ZG3lkJKX~)V zX|mc`i9+}LS~u4p7F)Rgd`sk<3l{?Vpy~U?stIIn1q|4c;drR+qd(`^5;`fio zkAikdR$aavbmEN1@y*M^SAL&8cdlny8k=2R>We=fs{Hi%(}&OehmKxd8*+QuGL=WKUbVURUg~F<_u;uD6O*%{wdK^T z-Jfi(pXn+2^r`6Mr*9yQg+Gh1aR_ZY@Wll1}?yZPR^W4mtur}!nyRVUA>V6^|QkX02sGk50#h52XB zcvoEel5`~b{1hwyNXr~SEx)`xz0AzaAHRPWzq+FN?Ck90%KbJ$Z_KveDe6w$mDLb$ zmX~zwOJ>FIUz?Mz-U>?3xVlI1zD`s}wdVbV-DP>t-ke%YR{dS|1jtdst2oxktgo%LykZ{}6c{LsJLd+Xb-`O`L+oZRm7|A+n3 zTYL$xs`DSedUkB_W3PXyOD;V4S6lJ+YP}+_`&K(lCidSlv&jZ1%BU>FBfi^CvH# zVOT4rCcLF5BjObgsGf>F-4Rr;&HZh4=lt+qqqmdUO8k-SQXL)@HAq|C+b7>Bon|nW?vy zZ{GaTF5`y6nk%>cYhKB-u(My@lKJxc?~ligJF@Q2k}}PjlC}H8u7f`F|0Uj>_j>PP zP*d~kw$A!_Ob3qM-0AasuHj>4tL^#C%hO--&29g2{m|{ty+&^@KfRZzqNX-2^Y--k zs>Y5Ej#pP#hp&3eRMWeECqw=H)!(WOHAA~5=zjSA{rQ=h#!<$g(mM5)o`uB>MrO7t znYT}zIAN5_Zjf?ff>C~SSnKn*rxw|qFa7Y~VCt=PVQZs!q|Mfx`K`M;@9wUtmA9+k z@7?Zm`|6s=$-Ce0+wF7PEdSmfpW9Qf+kT(2Zz%_;#dM&N`Sg}t7Z;bA+n8TmUhY40 z`&QLUuF)KdEoPU5R;iS}zNW6Rg-R;*Y$}ePZ&)#xp){!Gq{@&iDT=C-Jaf{FC zN~N!_U6nnWW}0!KVWV)|0>{0V=I$>tv911=a%&5JM`!0nS=I?kA(^kPt#m8aS+%}YBwtMIh$_9<0&4!+7d+9mqt=H~WqZ*L1=7yI+$arw^ve)Uzs?sa!JFFo;9 zTsP{-x3{+oi;9vS9%|i^b92&_D_699)*N3KyF26lKHKN#<|coAb@fZ%yAw;lY*D)Y z{@Pk;>+*Lh=H}Boh1H9m&n;gxW!0f0RW_f`7~A}QvpFR_-MH*cgx$XfTa&K;|8m*C z^3zFmN!zLtQPnNFvAaqVKP~ZO*z@O-_fsj~#fLOngI-M%dRqMCgkb1mH{Q~RhgiRU zK5wsWZ*Sjva*15!r>9BVZ||wx3?A-zbtN!*Th7W^8>D<^oB4iyanV^+L_}lhlwS{; zGgsxd%ccZ-1#?eL(~TBc zV3uoEcRcsj5{9kW*Y!?Yi3auDz2_ROjKppk||D}-Yc5U%r@^|u|k81iRs0i zoyPb7+!wlY=g!Z^-~YPiO`bLD)Q5+MXWCY8J1mnl%eq_-G3@{l zt`n9Exr+Y$D13EgC3C~_6-WX#o~UWq9-1^N?rzq8gBjl`ZbGy zm{{A*oPAk8<8>o8G}u;u1NFzn^y6~AJ71q;QOLAZBr!4k*(1)?!PAYG_fOCGeLcQ@ zZlA36rA4mYr@AtP*L|JG$+`CMNnzFMxiV)vh1EZN{J1gd+1s~gKR&LC*VlAfx*_$n zm|pCzl&x$0=30R|mtVe=FflQ$d1pNP%#*ltJD(+=ontwniy+gs+cVvV3{6(abe*>gDF;n~aP#G&Bz6=>1|iX8nGTb4-lP>aew& zy8Ae<|C-Is&8@7Y)b!=cm(_g=J9bwWybP)ebz5U*WNchmShz9j*{fGxX=%%rxv*(E zE&Xsie}Cb}N3N?=fByUl^2&w{29F*;{$Ca^H_vo^?Tokb|9`OeN||orIbQeaiRZC? z`SYL8+s8jke3*Oi>FMb=cNRYnJuPjL;o#r^N@Qx5mNz%qC@VMLIc@2>t%)IT|KBnO z(2(;i^Zau?lExLkUS9HTNY54$5?c4u>g%hk-M6-8FP@^Ls>*6_pM31>lqo4p%}(9A z4#CTO5?@|gnsZ|VV|@I5uhVf;K|?^T+~RAdJ$?FAP*Bh@B0^%h|NL#c^i@?mudVem z-?(To2Or1oX5;Y}S5^ieWxaOb_U+l}^J}-A_-$SC;=sGRyCv;vEEsl|zh5?O zdw%CXfjf8aW?ouyGF0B?YT)f{xtX`Oy)}K$&CjoHU@+nC?()l<)BPE~y}fzVH}{tK z&kE!8b1B!>MCRPyb~cYoK*WB1*za#|BR4%c#dGNA&z~|@8>TOxuUE(9<$iT*cKEjZ z`+km&j0rJPlV;5DC@I-;E#{Kp!X_SBt0`;N=Z=H_(9$IdHacb83*Pft&uWtyF4c`|Fgn$L^_dn!L$6g}Ypm9Za>iLmijOYrk2 zOMM0<_`t<(k=O3;tu}x8^4PwH}85)Lrf{d^+KAS5hY`D*3z7gtw{TbI8}xwY z=f|V&sA5oYv}4z&H9w6`o;*1%U$OrBs?gOz z{@O9Jr7tctn%}RPEN5FaVd~VQ4-}mxOdoo28!0Over2^l)q9#j^|u@&W8;;ftHs{$ z`<*v4y>G4Gy!wBYa`k@-4;?yGP+tE0X8qnnXJyyNT%I^-l2cfi7=x#$r%Be8j<>hB zZ?64acG{}=*_n;6FGpo>j_-!W|()!B5%(}w`J%5Tr1LB^C4f)-u`};wY|N4 z-kyse`EKsqy?b-UMWxd@JMY*3x4mEYdu`}>FIgY2g%5-h{>wLnzU&uH-}$%Cy7Q%Z z$9MJ94;vSWXxymdnd$$+YLec;){+dZ&zz#KzZVO<;obMCFl@=1H!@ijJ0{Pb-oAPA zT0koRlwCbQO(ZC1?_-y(6Xx)=^B=yrxZn}X9Q*t~F?%>PH7Cr=TeEmd z;qUcXSDDh&R|GQe+0!FmU;kL$K;Y0J1rw21*IK3X4F1KQ*<$O|!KLErabu4C|CY0} z6MvW8*vkFwUF#B+j4K>cW+q&&bFBmp=^3so!CmTN$WL#pIW!gMDuSq(;<=NSX`NF|mil;ogCS1@nW){CET4nwz-(gaAmy&;H6)jU&cVXY& zkDtReH8)h7=iFwq|HH6;U)GjYR%I>gVim1!Y52`ro-Vj3YNC?Lsw@Bge)xFYpnhLr z$Lo954>yW0IDdB6e?y^ik7TmUx!2cte|<6R%6fe4*C(z( z*%L3r168lBX}l5fnEB4>(;2=wHyHTsne6IzU7i~I_Lf18gwK4w{eRiq`y{q+&ujIY zyC5^T;#X$G)>9Vhsx2GTTs=ZoJw4rfIGf*wp_xtcdG)=T%XQHl3l|#HSe%*7{_*37 zpU)pWVez-)Jb2I`Yf9leZGHdpAjO6vqX+tf8@c!K>7T#8y0Ld89`122%iovzWuNe&iy-a$|NYWl z?^|{A;j$u&f&(vPweKgj^?41p)jfJ| zs=rAb%{U`rQ5I5erKr^|q8OMaDQS?>gi#v^LKKB|XH7{5H@`g=V z&aBN)=+Hb5L7~)1Q&{#^NhWVw8D#Q@os-3{}of zP&7zx^QjEDYGd0gDA6Zt+;uUwT(aHe`}^y2eL6Nx>=y`3ny%-#zwVgpir{50{2t%n z>c05!@P&1A3w^I`NIZ6<)G0(gsKupIBb8_GS4;h+?49`h8h7ujg3??@G9>l%HSmJNL%M!#gr|WCkxTpDVD)zw2pTk+tG&(AlXUyv7jH`B%Q z=n;wQ5?k|fea?M9COu*1O6#ct;ggkAy1xE+Y*4Y`qw*?ofB(k@uiAKzHLQGlOLA?L zVoqmIu1?pMf`x{E5A3VmHM!%{j*o81e2XoMd-U#pzstUUKi|7|yC!og>Mr!!So5#`Oz9=MRb3uQy-T-_d`4u7`z|rqd&>^Y-~ZM|Jl;d=tI5YD3vt zL;jH4+cp#}edlsW&{I$-tn7_}-3&FqD|1~!Sk=`ZD_!rmH{11S|Hn2%t2Tj9*RBa0 zKK=Q8Y|EW{_jXP0SY?vHkaI8ROUIt4Vmk^P%atB#EaBkn_MP2xamMkUi*sFGT-czP zb2F)D*M(J61E;jC$O&p`Il6lNA>;E6?d|VWoW#w|e|&JBVI`Wk_iBbDXW-0L>EG9K zZ76vev@Q3xTTqaYaoU+3ul@xu_xt#$TfgYbi@>C$q>6t(pBHX^eDn6Ud~-dozwfN? zdba59`0Tg%@u3Bd$2ji(|Fis^%b_^S9B&N+0|9Yy@wD^vYOmH>T3Q}Ca^%8}!sKQC z^Us}|YdzB-v8ioJX!@&=iZ6kgtex6cWhQ(l&(37#w`JM6bC)n@^^*;*D}tB%ebIR2 zb%vE&?7_>IC%N_aIJ~~L_UDty{-6Qe=jZ3IzcnHB$$9%;!AHc%;OEND=h5)|1pl;UAFbky6EkCTeGjHy}h+nDmZkW{yu{$cUIPyeo8qL z`}+;Q#r*wsVW;tpm*s{FJ4F^|TNFRz`S7kQ-3-t4+P>ulPU`|ECKgIn~w z(w;wgGGXGx#GP|zO>%OqtJ4e)-|IVD!T!F)F4vCNm7je%cv@a$JYMwdSZ}Gi(ABwj z#TH&%>^}MTcH@zqOrTprYySU)wJXXn;DteK0NByUo_=V zic#T{6M{m*!Y{9`4u2_kBIVcp{DMsfndetlZm5yeiCU!}pD4KL==I~%W}H2C`(#+$ za&~z`qq}w7KL7bkUN5wsc#vgA?u*h*uC1lVPv-o!vYgr2wCa5FcGnd)Z2WR(Ua#MO z?#IW+JKt`*J;NkZ=<)IXKamS+)X7!9F+BZtvHCfqFY9(Q7MMBD$X|L~Z>y-b zf(gqa>zAhk7CgwAl)KMvo61X}C*n7*z5a5@xS&{j$8)(K`~Pq5&9uL?`M`d)A62jX zl6G(UcioHU^VU30#+WMwE=Lyb*KcWWH?I8jWc4&_YwOKvXQgaxZD(2*t9`#;Zy&tO zNAuf8A2s1~=gv)&S5Hs(Y1LJf-kKrEBfHAFb;Y?~Um9<2e%NQ-!#%H6L$^JT^Xl5@ z>FV=qKF#|6^XJcx*P`=73m2`LJfGit+JRlAyC!$MT328Hl&6c$aELtM7 zi^Fo0ZgkJYO|#9f&vm)cy!&0#>FK>qUry^EQ&{0NrA0)MeQVCl!n5rHqEG+*R@CII z`ew50Uwi9IKb2L??RM%Dp@WFD!187UWv@H$@F=x zO^Mp6>T}_#nd%T(Y)E^wFc9&XX-GyuRP#R`)yb;NY<-4~=^FXsGBe^eXu9 z!0}#fHdm+kzbmp&wPu@n3JO*Ic^!YOp@6V+lN?%?s-*uTITG91HW6n*c+*=K^XTMW96j)h(xc)!)d0TdN z{#Sm=IgKKU?3+@#OWv%oZY?O$jXtEkUP4(bCFO;ma>-<+Ck|!rr#TlMGV__i;5++J zu>VUxrIO8^N+sXkMEcFQ^DW!v!xKNV>|IOQ+mhu1hd%s#e(dO))6+nzHgzhQ)cz`Y zb#--ndpkR59mt2n{JWHI&i(vc(Nj^_3HHQyv{{urpJfb84Y`MPCS`Fp>F z1ck=NMizGV;?HNzU-zYye|u-zchuT4wmw#ImDl}!$F4l!x97QEyWG0>!a=pJfcyJu zU*6un{+&cw?)$imyHVv_itE08yM1iusq^;j?Q)mqx`mj|wvbWRx_@u)g;i7Ei8#fa zJ>k~mkWmac1>uWprn!$nX=>}SJjWii;da?p)zzR_Mo(@aD!w6*aZE^1Weeqdxxmd_LS!>3881j+PdOwNbk! za|D{0n?K%jVeNJ)S+Q4FFVFP|VV$k%1X`bX^{S}6{QRWryGu@fb6d8pl%3Dv^Rr#S z9EG*ARtFaMANu?K@U5*0(~?cg&Zl(+6ciZf@Bd>o_iaMQ^QWh$7yo{{{qdVeZa(`R zcReonu)rrteO3STIHPldf1lfbIHA1ja>uDOu!>TA;7W4c%J zZ-kVKI7B%uswylqbGuph(bdBX6g+0LHJvtY+}P66@}e(LF(x+l<9Gf8Cr_G5%?fI9 zDZRX~xiIg=)9Iz^f>Y0?bxl|yvvX&`j}0PutZig2Dlb<=!2yR7^zFe2uKMPHc7lc6wQNKwO-hu$s>W*~L+loeLLPNgK0W zy42J8p`~`yOC^<4?;kj7IxYHDRAh8)TJT z;kjSNb-!|{K*5}4swPEGJc5FQD?c1$|M>m;^6>R>dp@7Desg=ffBBZI*H<)GM2DAi zDQfji7q|I3WsdYFb+h0WHeRVCb1aKJJUkMfpPPH+*s)DXN4b=gl{xwNo}IIP|77+0 zeM&2(dNO|8&fov>){^NvXDryReSW5KP)o~SNprq!d9816m#Pbj9!%@H5Wh9!VpID3 z+G$g@!;8MXiFE6cILL4R=Rk*`@{Z^8s!NXV)(a00|MTZhK~d4AS&zSDYC0YIS5b9n zvcHt^#;#ZA)6Q{;8kg1RPh`;-i;fhlsN)5kM$a_lfJc2Hg8{Kxm2K>S#V2S%}3XLf4@cZ$=P@~ zIx;dcGP=0Be!S$ZFDNSNnv$aO?%lgx$zj@;goM7mTEBMTQt#5`f=?5TU0<}z*FD&N zzwYqm%abQ6yBk$~$p9^wIb*axf970U?!-h;TwBUjpONrPeC+n(l54qCV3=8O%eLIx z$L{T|zPY1Nxv;SC$dMxjKR=~fmA&zJes1o|OG~+9ca==M7QmUBCbgLV_DP#Yrbn7+Ji@Up#IqOvQzFQk-Dv5}S9=*4>nv;`L z(aLI;q;Z;ntgNr|OrGUF=jNL)a~C^wud+g7uE;XKR`Gk+=DJOpc2;Decw7Z&YAb3> z#zO0^*a=E1GACyk9-C3bZ_j%0-mc3Xmp05Sb^S` zb-|^n#;zVAYg$;6UsNl~9DUq>*t}TL+PhpRP%5b9&6QT}W80k-Wn5Q>UD%C0co?h`7CJQX&VPX#BjzcW=DJLoBC^n{;Kc>SW&eK1PSQJ; zeOf_R@nOfJHC_8aEd% zQTg!w`dlZDy>e9?cE5efxe9Ih;#)Rtdh`C%t0gKQK3@jOx%D($UA?rqX>IWhr7vGD z`wL4+c{w;7Fn$01^XJ1UMv-;zcE8`JHlBu^#ii9wRsHyK`TVfJO`p8ICS|v@Fi6v~ySHx`?=T1qd$lo9p%W*H=)3u~*vs*_D;SyOgKiINDw0=h5M$?0%^J zfA*G+mbV*c&J5MQ1zN~e{H*8dCdX#Bk2jM0r)K{#T;oII;Ne}8NB`>S)^{($-kkGR}2XZWaD zmA*Q%Ds**MZ2swKx_dsI(hfU)#?O!8$&*9(E{h61-?hm|(OkSwcY5p>Du41?%)XpI_X>H=_=QiqUeG#0Ds=wwyzT(k zlc!IEX5hBu-Q9KLYt*)!lQRsH88kFB6bv<6clbs#6cjgZr?TzsiAs(yZ1eZm&T#8#8AX19<1KDn?v;Q6_^meswdS28m*gBF8va&m%}h_&&4J;NO$ zwsPfzw`;9i1-3nZw>$AmhNjcDV+*?{Y~E~aXJ;3#Yd+J*#l=NHP;jAQ=uZzpp+~oN zl{UZ0xv`O1Nx5{nU~A3-Lp80SD5;9dmwt*ZZw+TZT(>*nU(H?5Bk`Vsn~X0B2`$Pf zzsK1v))=&Fa)(n;%NrlBu8Y=w9EDrIy*+r8bz9EGxh^7;lv2`{sH(VpY~wMEaz13{ zA-D-tscGE1u&~JE+%ypPlA&YAqq{Z67S@Ni48c=E__ zcu#xbr?`Y8w8^bk>f?zU$3J}KU-PMU`Euv8vqJYpE3TSb_c!5voJIIocAX>f9)g>c zckVpa5*pOfvSXi=>4J3s9}n5@ddkceQM8^kk1sFp*aj7+j@P@Nibd>;Dd#$_=6a&< z#7_l9ujTdi5nH*6ib~WAV}e@VoLK5zq~X_bX+^BGlvzuB-Nm^_3OxlkDPPib?6|c1 zYnY|V^2s10Cn~ynbX?l?RP5!P1t0+>T}4H&^~vrYUQNpGCF+GfK`n1OwzRZp*s80) zxGP=vC$L=TxC+S93ARpCeBa*#6>K7Xo?R1UC*CV`n&O+IvnEJA-RP*;0nlWV!qab?#PLMkdM8|v;x85v(%U9uk(xsUU)W-JqcOp(9@kJi%UV(z6 z$ilDV)61K}*VbH|duSsl^k>clxyR<#_ICUKEyn33>V-0(Adu-3UQ{z@?!xTwh`mwe zLdO+BLGaK*@znbA{2xEl?`q1lizr$v?S0&$vA^zbkJ6O+>#aMJL4mMo(}BCO3_&)5?Cuhj<$ZnqwckUDB^)<7mnv9CcTErwU6>tyV}oNk*Kq~c z6MiY_()*tl%n^8ceXaD7qmGV^?^M3|cTJdk;tY$qxxwlGD+HciThM6e_+u0!`wmJuLnC_`*M}+snW72ro)1ea9nh{>m@$KPV;E{r$Bu`#$3#>Fp~v)t+iy zR;tKq@Xi>uFw7Z&MH5Yf8+Wg(}PQ>ZP z^c5O6ws@9v{eHH_x?zPxV&buWfklr>UL?e5m%N;0_;>q?ic3O5P8~{DR%zXhA`4F`xvmhZ zsHzIu@5mezbGO7@&?%(h+uOw7Wp_2-Oa}F(HzYdCN!hZ=?`OCh*dieM;Mwfn?ADZJ zSG&|*JvbECE%uX5KGNdcUZTFy9&9bkt*yetoG^Cr;fh9W!}^E!d^dl_6)QRwolI1 ztE2?9_U6izFpflSC#M6qrTOIBIymlTzG-*f)^cra^zkPrCx86#;lRVq%goPV2e)*NNl!m2GP;N(qS`SB!SDt@@&%rgp68_Sv(&nU|M= zrT`hPt%*FmulBb^)fWv=GydJ3nfq#ge>%X-AK?7#g4m(Nt-0L0%Mb7U{>m@OUS^YO zidnRM?&Om#L8pqU|NZ%SH-IBR~tr@NaQwC4QM94C(3mzMQzY0;YHEVgj} zu8NOJmzViIKB+!`i;i{WCzXW@7lyrVZEGv~^yK8KKJ}Ijin+HWbQkWgNf&*Zvc3Ir z-LIGGmo8skJIyrfN{3nQt%$tk%a$2sTu^wo`@P+z`fp@kX%i@2uy~C3im8x!rR!<=5#?F_R_>t+MIAE4Fa=yIreK{GJlTBWcvqCu9M-)pB`{jjEW`+9j#O-YlSDrd=g zt$&RfS89rLa!k9v+(K>h%sYExD(9|Ke*P)dChOOuxWl_IeG?Rj$>fh!of72pH_6gb z@nP6${aCNZALQFt+w^;Cio`J4tgd;!>&$%n`PJ`sw)flp>Ns$~fx*Vc=EeQ}_6b`S zNtx%JahI<>vUdBuQ^EeWM}K~P{`1}L_gyt-E-&{lexbiu`dQ4mr$u&mN`gd;u3`&ls!hm=V_`3-Gytu)rI2&u?UFL5 z8?)o<|4s$1hX1_JviRA9XV1cpcD88PYdSfF2s=7D^2l0UDYCY_G_&B z1fHrrZ)sVf<~PT}v7JvA(vi_Ulr!!9ghf`y=QvO9j_Alry0@niRJ~SwOqw%ij=@Zy zY4aDm_rK~>cbVzo?a`5?WNkfr&6+jY_nyCftE;OVcouA#XnA@0ox68Sj|(hvIvK7G zS-wnRaC!)07;yIgvZ51LW;<~xwlo{QI`>~~tFRM?;;MW9nNz05o>^ozpND~gfx*+& K&t;ucLK6V@zGO%M literal 0 HcmV?d00001 diff --git a/doc/graphs/lambert_wm1_prime_graph.svg b/doc/graphs/lambert_wm1_prime_graph.svg new file mode 100644 index 000000000..d51dc1358 --- /dev/null +++ b/doc/graphs/lambert_wm1_prime_graph.svg @@ -0,0 +1,54 @@ + + + + + + + + + + + + + + + + + + + + + + + + + +0 +0 +-0.1 +-0.2 +-0.3 +-0.4 + +-5 +-10 +-15 +-20 + +W-1' + +z + + + + +Lambert W-1 prime function. + + + diff --git a/doc/html/index.html b/doc/html/index.html index d96d54964..05d815a8c 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -120,7 +120,7 @@ This manual is also available in

        • Last revised: July 24, 2018 at 09:41:02 GMT

        Last revised: August 01, 2018 at 14:32:39 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 6e1d88cad..8e4482444 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -24,7 +24,7 @@

        -Function Index

        +Function Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -123,15 +123,6 @@
      • -

        alpha

        -
        -
        • -

      • area

      • -

        bisection

        -
        -
        • -

      • bool

        • @@ -1351,12 +1338,12 @@
      • -

        get_from_string

        -
        +

        get_epsilon

        +
      • -

        guess

        -
        +

        get_from_string

        +
        • @@ -2948,16 +2935,6 @@

        typeid

        -
      • -

        types

        -
        -
        • U @@ -2976,10 +2953,6 @@
      • -

        unity

        -
        -
        • -

      • unreal

        • Octonion Member Functions

          • diff --git a/doc/html/indexes/s02.html b/doc/html/indexes/s02.html index 0263f8436..ea08f5316 100644 --- a/doc/html/indexes/s02.html +++ b/doc/html/indexes/s02.html @@ -24,7 +24,7 @@

        -Class Index

        +Class Index

        A B C D E F G H I L M N O P Q R S T U W

        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 3126abf2d..529969333 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -24,7 +24,7 @@

        -Typedef Index

        +Typedef Index

        A B C D E F G H I L N O P R S T U V W

        diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index c3086bcae..22493c651 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -24,7 +24,7 @@

        -Macro Index

        +Macro Index

        B F

        diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 1376c582d..7bd454b5e 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -23,7 +23,7 @@

        -Index

        +Index

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        @@ -319,15 +319,6 @@
      • -

        alpha

        -
        -
        • -

      • arcsine

        • @@ -569,7 +560,6 @@
      • -

        bisection

        -
        -
        • -

      • bool

        • @@ -1810,10 +1796,6 @@
      • -

        Conceptual Archetypes for Reals and Distributions

        -
        -
        • -

      • Conceptual Requirements for Distribution Types

      • -

        F Distribution Examples

        -
        -
        • -

      • Facets for Floating-Point Infinities and NaNs

        • -
      • -

        guess

        -
        -
        • H @@ -4833,12 +4809,11 @@
        @@ -7161,10 +7132,7 @@

      • Thread Safety

        -
        +

      • To Do

        @@ -7345,16 +7313,6 @@

        typeid

        • -
      • -

        types

        -
        -
        • U @@ -7394,10 +7352,6 @@

      • uniform_distribution

      • -

        unity

        -
        -
        • -

      • unreal

        • Octonion Member Functions

          • diff --git a/doc/html/math_toolkit/conventions.html b/doc/html/math_toolkit/conventions.html index b8015c6ae..2fba35515 100644 --- a/doc/html/math_toolkit/conventions.html +++ b/doc/html/math_toolkit/conventions.html @@ -27,7 +27,7 @@ Document Conventions

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index b89a8fdf8..427fea134 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/index.html b/doc/index.html deleted file mode 100644 index e9ea26091..000000000 --- a/doc/index.html +++ /dev/null @@ -1,23 +0,0 @@ - - - - - - - - - - - Automatic redirection failed, please go to - html/index.html -

        Copyright Daryle Walker, Hubert Holin and John Maddock 2013

        -

        Distributed under the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at www.boost.org/LICENSE_1_0.txt).

        - - - - - - - - diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 8ef648f78..255da03c1 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -83,7 +83,7 @@ You will usually need the following `#include` and `using` statements: [lambert_w_simple_examples_includes] -Some examples follow: +Some examples follow, starting with the trivial: [lambert_w_simple_examples_0] @@ -91,12 +91,12 @@ Other floating-point types can be used too, here `float`, including user defined types like __multiprecision. It is convenient to use a function like `show_value` to display all (and only) potentially significant decimal digits, including any significant trailing zeros, -(`std::numeric_limits<>::max_digits10`) for the type `T`. +(`std::numeric_limits::max_digits10`) for the type `T`. [lambert_w_simple_examples_1] -Example of an integer argument to lambert_w, -showing that an 'int' literal is correctly promoted to a `double`. +Example of an integer argument to `lambert_w0`, +showing that an `int` literal is correctly promoted to a `double`. [lambert_w_simple_examples_2] @@ -237,7 +237,7 @@ this has been used here to provide our reference values for testing. For example, we get a reference value using a high precision type, for example; - `using boost::multiprecision::cpp_bin_float_50;` + using boost::multiprecision::cpp_bin_float_50; that uses Halley iteration to refine until it is as precise as possible for this `cpp_bin_float_50` type. @@ -296,7 +296,7 @@ Provided that there is a `catch` clause, an error message (similar to that below * `z == (std::numeric_limits::max)()` returns W for the floating_point type T, (for example, for `double`, 703.22703310477018L) * `z == std::numeric_limits::infinity()` throws a `overflow_error`. -(An argument z passed as infinity probably indicates an error has already occurred, +(An argument z passed as infinity probably indicates that something has already gone wrong, but if it is desired to return infinity, this case should be handled before calling `lambert_w0`). @@ -305,13 +305,13 @@ this case should be handled before calling `lambert_w0`). The range mathematically is -1/e <= z <= 0, but numerically, * `z == -1/e` (for the type T) returns exactly -1. -* `z == 0` returns -[infin] (or the nearest equivalent if `std::has_infinity == false`). +* `z == 0` returns -[infin] (or the nearest equivalent if `std::has_infinity == false`). * `z == std::numeric_limits::min()` returns the maximum (most negative) possible value of Lambert W for the type T. [br] For example, for `double`: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 [br] and for `float`: lambert_wm1(-1.17549435e-38) = -91.8567734 [br] * `z < std::numeric_limits::min()`, means that z is zero or denormalized (if `std::numeric_limits::has_denorm_min == true`), -for example: `r = lambert_wm1(std::numeric_limits::denorm_min());` and an overflow_error exception is thrown. +for example: `r = lambert_wm1(std::numeric_limits::denorm_min());` and an overflow_error exception is thrown, and will give a message like: Error in function boost::math::lambert_wm1(): @@ -364,7 +364,7 @@ finally static-casting back to the smaller desired result type. This strategy is used by __Maple and WolframAlpha, for example, using arbitrary precision arithmetic, and some of their high-precision values are used for testing this library. This method is also used to provide __boost_test values using __multiprecision, -typically, a 50 decimal digit type like `cpp_dec_float_50` +typically, a 50 decimal digit type like `cpp_bin_float_50` `static_cast` to a `float`, `double` or `long double` type. For ['z] argument values near the singularity and near zero, other approximations may be used, @@ -377,7 +377,7 @@ In practical applications, the increased computation required is not justified and the algorithms here do not implement this. But because the Boost.Lambert_W algorithms has been tested using __multiprecision, users who require this can always easily achieve the nearest representation for the __fundamental_types -if the application justifies the very large extra computation cost. +- if the application justifies the very large extra computation cost. [h5 Evolution of this implementation] @@ -422,7 +422,7 @@ followed by Halley iteration (but is also slowest and least precise near zero an More recently, the Tosio Fukushima has developed an even faster algorithm, avoiding any transcendental function calls as these are necessarily expensive. -The current implementation is based on his algorithm +The current implementation of Lambert W-1 is based on his algorithm starting with a translation from Fukushima's FORTRAN into C++ by Darko Veberic. Many applications of the Lambert W function make many repeated evaluations for Monte Carlo methods; @@ -433,7 +433,7 @@ Fukushima improves the important observation that much of the execution time of previous iterative algorithms was spent evaluating transcendental functions, usually `exp`. He has put a lot of work into avoiding any slow transcendental functions by using lookup tables and bisection, finishing with a single Schroeder refinement, -without any check on the precision of the result (necessarily evaluating an expensive exponential). +without any check on the final precision of the result (necessarily evaluating an expensive exponential). Theoretical and practical tests confirm that Fukushima's algorithm gives Lambert W estimates with a known small error bound (several __ulp) over nearly all the range of ['z] argument. @@ -458,7 +458,7 @@ For this implementation of Lambert W0, John Maddock used the Boost.Math `minimax to devise a __rational_function for several ranges of argument z for the W0 branch of Lambert W0 function. These minimax rational approximations are combined for an algorithm that is both smaller and faster. -Sadly it has not proved __remez practical to use the same method for Lambert W-1 branch +Sadly it has not proved practical to use the same __remez method for Lambert W-1 branch and so the Fukushima algorithm is retained for this branch. An advantage of both minimax rational __remez approximations @@ -511,7 +511,7 @@ and output as C++ arrays 37 decimal digit `long double` literals using `max_digi std::cout.precision(std::numeric_limits::max_digits10); -The arrays are as const and constexpr and static as possible (for the compiler version), +The arrays are as `const` and `constexpr` and `static` as possible (for the compiler version), using BOOST_STATIC_CONSTEXPR macro. (See [@../../test/lambert_w_lookup_table_generator.cpp lambert_w_lookup_table_generator.cpp] The precision was chosen to ensure that if used as `long double` arrays, @@ -530,7 +530,7 @@ so ensuring that the value is exactly read into even 128-bit `long double` to th [h5:higher_precision Higher precision] -For types more precise than `double`, Fukushima showed that it is best to use the `double` estimate +For types more precise than `double`, Fukushima reported that it was best to use the `double` estimate as a starting point, followed by refinement using __halley iterations or other methods; our experience confirms this. @@ -571,7 +571,7 @@ and near the branch singularity at ['-1/e], some series functions are used. When argument ['z] is small and near zero, cancellation errors mean that precision is lost, so other series function variants of `lambert_w0_small_z` are used. (There is no equivalent for the W-1 branch as this only covers argument `z < -1/e`). -The cutoff used is as found by trial and error by Fukushima `abs(z) < 0.05`. +The cutoff used `abs(z) < 0.05` is as found by trial and error by Fukushima. Coefficients of the inverted series expansion of the Lambert W function around `z = 0` are computed following Fukushima using 17 terms of a Taylor series @@ -594,7 +594,7 @@ are 21 digits precision == `std::numeric_limits::max_digits10` for `long doub Specializations for `lambert_w0_small_z` are provided for `float`, `double`, `long double`, `float128` and for __multiprecision types. -The tag_type selection is based on the value `std::numeric_limits::max_digits10` +The `tag_type` selection is based on the value `std::numeric_limits::max_digits10` (and [*not] on the floating-point type T). This distinguishes between `long double` types that commonly vary between 64 and 80-bits, and also compilers that have a `float` type using 64 bits and/or `long double` using 128-bits. @@ -608,7 +608,7 @@ So must rely on `std::numeric_limits::max_digits10`.] [warning It is assumes that `max_digits10` is defined correctly or this might fail to make the correct selection. causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.] -[warning The use of `doubledouble` types is untested and may give unexpected precision.] +[warning The use of `doubledouble` higher-than-long-double precision types is untested and may give unexpected precisions.] As noted in the __lambert_w_implementation section above, it is only possible to ensure the nearest representable value by casting from a higher precision type, @@ -619,8 +619,8 @@ For multiprecision types, first several terms of the series are tabulated and ev Then our series functor is initialized "as if" it had already reached term 18, enough evaluation of built-in 64-bit double and float (and 80-bit `long double`) types. Finally the functor is called repeatedly to compute as many additional series terms -as necessary to achive the desired precision, set from `get_epsilon`. -Or terminated by `evaluation_error` on reaching the set iteration limit `max_series_iterations`. +as necessary to achive the desired precision, set from `get_epsilon` +(or terminated by `evaluation_error` on reaching the set iteration limit `max_series_iterations`). A little more than one decimal digit of precision is gained by each additional series term. This allows computation of Lambert W near zero to at least 1000 decimal digit precision, @@ -631,12 +631,12 @@ given sufficient compute time. Variants of Function `lambert_w_singularity_series` are used to handle ['z] arguments which are near to the singularity at `z = -exp(-1) = -3.6787944` where the branches W0 and W-1 join. -T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) Page 85, Table 3 -described using __Mathematica +T. Fukushima / Journal of Computational and Applied Mathematics 244 (2013) 77-89 +describes using __Mathematica InverseSeries\[Series\[sqrt\[2(p Exp\[1 + p\] + 1)\], {p,-1, 20}\]\] -to provide Table 3. +to provide his Table 3, page 85. This implementation used __Mathematica to obtain 40 series terms at 50 decimal digit precision `` @@ -648,7 +648,7 @@ These constants are computed at compile time for the full precision for any `Rea using the original rationals from Fukushima Table 3. Longer decimal digits strings are rationals pre-evaluated using __Mathematica. -Some integer constants overflow, so use largest size available, suffixed by `uLL`. +Some integer constants overflow, so largest size available is used, suffixed by `uLL`. Above the 14th term, the rationals exceed the range of `unsigned long long` and are replaced by pre-computed decimal values at least 21 digits precision == `max_digits10` for `long double`. @@ -727,31 +727,36 @@ whereas __multiprecision types may lose precision unless constructed from decima The 100-decimal digits precision pairs were then used to assess the precision of less-precise types, including __multiprecision `cpp_bin_float_quad` and `cpp_bin_float_50`. `static_cast`ing from the high precision types should give the closest representable value of the less-precise type; this is then be used to assess the precision of -the Lambert W algorithm. For __fundamental_types, the precision requirement set by the __Policy mean that the algorithm -may stop refinement after bisection, or Schroeder or Halley refinements. +the Lambert W algorithm. -With the default __Policy, that includes iterative Halley refinement, tests confirm that over nearly all the range of z arguments, +Tests using +confirm that over nearly all the range of z arguments, nearly all estimates are the nearest __representable value, a minority are within 1 __ulp and only a very few 2 ULP. +[graph lambert_w0_errors_graph] +[graph lambert_wm1_errors_graph] + For the range of z arguments over the range -0.35 to 0.5, a different algorithm is used, but the same technique of evaluating reference values using a __multiprecision `cpp_dec_float_100` was used. For extremely small z arguments, near zero, and those extremely near the singularity at the branch point, precision can be much lower, as might be expected. +See source at: [@../../example/lambert_w_simple_examples.cpp lambert_w_simple_examples.cpp] [@../../test/test_lambert_w.cpp test_lambert_w.cpp] contains routine tests using __boost_test. +[@../sf/lambert_w_errors_graph.cpp lambert_w_errors_graph.cpp] generating error graphs. [h5:quadrature_testing Testing with quadrature] A further method of testing over a wide range of argument z values was devised by Nick Thompson -(partly to test the recently added quadrature routines). +(cunningly also to test the recently written quadrature routines!). These are definite integral formulas involving the W function that are exactly known constants, for example, LambertW0(1/(z[sup2]) == [sqrt](2[pi]), see [@https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals Definite Integrals]. Some care was needed to avoid overflow and underflow as the integral function must evaluate to a finite result over the entire range. These are not routinely evaluated by the Boost testers, -but can be run by defining a macro BOOST_MATH_LAMBERT_W_INTEGRALS. +but can be run by defining a macro BOOST_MATH_LAMBERT_W0_INTEGRALS. If BOOST_MATH_TEST_MULTIPRECISION is also defined, then __multiprecision types like `cpp_bin_float_quad` are also used to test quadrature. If BOOST_MATH_TEST_FLOAT128 is defined, then `float128` is also tested. @@ -762,7 +767,7 @@ A few macros provide optional tests if #defined before BOOST_TEST_MAIN. * BOOST_MATH_TEST_MULTIPRECISION Adds test for __multiprecision types. -* BOOST_MATH_TEST_FLOAT128 Adds test using __float128 type (GCC only, needing gnu++17 and quadmath library). +* BOOST_MATH_TEST_FLOAT128 Adds test using `__float128` type (GCC only, needing -std=gnu++17 and the quadmath library libquadmath.dll). * BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined. @@ -832,7 +837,7 @@ Mathematics, 244 (2013) 77-89. Exact analytical solution for current flow through diode with series resistance. [@http://dx.doi.org/10.1049/el:20000301] -# Princeton Companion to Applied Mathmatics, +# Princeton Companion to Applied Mathematics, 'The Lambert-W function', Section 1.3: Series and Generating Functions. # Cleve Moler, Mathworks blog [@https://blogs.mathworks.com/cleve/2013/09/02/the-lambert-w-function/#bfba4e2d-e049-45a6-8285-fe8b51d69ce7 The Lambert W Function] diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp index 8fd6825e8..35c0f34cb 100644 --- a/example/lambert_w_simple_examples.cpp +++ b/example/lambert_w_simple_examples.cpp @@ -229,9 +229,9 @@ int main() double z = +1.; double r = lambert_wm1(z); std::cout << "lambert_wm1(+1.) = " << r << std::endl; - // Error in function boost::math::lambert_wm1(): + //] [/lambert_w_simple_examples_out_of_range] + // Error in function boost::math::lambert_wm1(): // Argument z = 1 is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?) -//] [/lambert_w_simple_examples_out_of_range] } } catch (std::exception& ex) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index f720b05c4..910fbb999 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -8,11 +8,12 @@ // test_lambert_w.cpp //! \brief Basic sanity tests for Lambert W function using algorithms -// informed by Thomas Luu, Darko Veberic and Tosio Fukushima. +// informed by Thomas Luu, Darko Veberic and Tosio Fukushima for W0 +// and rational polynomials by John Maddock. // #define BOOST_MATH_TEST_MULTIPRECISION // Add tests for several multiprecision types (not just built-in). // #define BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17 and quadmath library). -// #define BOOST_MATH_LAMBERT_W_INTEGRALS // Add quadrature tests that cover the whole range of the Lambert W0 function. +// #define BOOST_MATH_LAMBERT_W0_INTEGRALS // Add quadrature tests that cover the whole range of the Lambert W0 function. #ifdef BOOST_MATH_TEST_FLOAT128 #include // For float_64_t, float128_t. Must be first include! @@ -77,9 +78,9 @@ using boost::math::lambert_w0; std::string show_versions(void); -//#define BOOST_MATH_LAMBERT_W_INTEGRALS +//#define BOOST_MATH_LAMBERT_W0_INTEGRALS -#ifdef BOOST_MATH_LAMBERT_W_INTEGRALS +#ifdef BOOST_MATH_LAMBERT_W0_INTEGRALS // Added code and test for Integral of the Lambert W function: by Nick Thompson. // https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals @@ -204,7 +205,7 @@ void test_integrals() } } // template void test_integrals() -#endif // BOOST_MATH_LAMBERT_W_INTEGRALS +#endif // BOOST_MATH_LAMBERT_W0_INTEGRALS //! Build a message of information about build, architecture, address model, platform, ... std::string show_versions(void) @@ -1140,11 +1141,11 @@ BOOST_AUTO_TEST_CASE( Derivatives_of_lambert_w ) #endif // BOOST_MATH_LAMBERT_W_DERIVATIVES -#ifdef BOOST_MATH_LAMBERT_W_INTEGRALS +#ifdef BOOST_MATH_LAMBERT_W0_INTEGRALS BOOST_AUTO_TEST_CASE( integrals ) { - std::cout << "Macro BOOST_MATH_LAMBERT_W_INTEGRALS is defined." << std::endl; - BOOST_TEST_MESSAGE("\nTest Lambert W integrals."); + std::cout << "Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined." << std::endl; + BOOST_TEST_MESSAGE("\nTest Lambert W0 integrals."); try { // using statements needed to change precision policy. @@ -1244,7 +1245,7 @@ Real x; } } -#endif // BOOST_MATH_LAMBERT_W_INTEGRALS +#endif // BOOST_MATH_LAMBERT_W0_INTEGRALS /* @@ -1297,7 +1298,7 @@ Real x; Macro BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined. Test Lambert W function 1st differentials. - Macro BOOST_MATH_LAMBERT_W_INTEGRALS is defined. + Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined. Test Lambert W integrals. Integration of type float From d002d1491ac62657294f470b03c86565eb071d18 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Wed, 22 Aug 2018 19:31:22 +0100 Subject: [PATCH 55/71] LambertW: Tidy up header includes. --- include/boost/math/special_functions/lambert_w.hpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 28d3e8104..cf331f9a8 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -54,9 +54,9 @@ BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of #include #include // for log (1 + x) #include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. -#include // Link fails for pow without this, even though uses std::pow. +#include // powers with compile time exponent, used in arbitrary precision code. #include // series functor. -#include // polynomial. +//#include // polynomial. #include // evaluate_polynomial. #include #include From 5edc682dace8df9b2386de260cf1c8ff59d7d80f Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Wed, 22 Aug 2018 19:32:00 +0100 Subject: [PATCH 56/71] test_lambert_w.cpp: tidy up macro usage. --- test/test_lambert_w.cpp | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 910fbb999..c4329ac69 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -988,6 +988,7 @@ BOOST_AUTO_TEST_CASE( test_range_of_double_values ) BOOST_MATH_TEST_VALUE(RealType, -0.99999997419043196), tolerance);// diff 2.30785e-09 v 2.2204460492503131e-16 +#ifdef BOOST_MATH_TEST_MULTIPRECISION // Comparison with Wolfram N[productlog(0,-0.36787944117144228 ), 17] // Using conversion from double to higher precision cpp_bin_float_quad using boost::multiprecision::cpp_bin_float_quad; @@ -1000,7 +1001,7 @@ BOOST_AUTO_TEST_CASE( test_range_of_double_values ) lambert_w0(BOOST_MATH_TEST_VALUE(cpp_bin_float_quad, -0.36787944117144222)), BOOST_MATH_TEST_VALUE(RealType, -0.99999997649828679), tolerance);// OK - +#endif // z increasingly close to singularity. BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36)), BOOST_MATH_TEST_VALUE(RealType, -0.8060843159708177782855213616209920019974599683466713016), @@ -1231,8 +1232,10 @@ Real x; test_integrals(); test_integrals(); -#ifdef BOOST_MATH_TEST_MULTIPRECISION +#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS test_integrals(); +#endif +#ifdef BOOST_MATH_TEST_MULTIPRECISION #ifdef BOOST_MATH_TEST_FLOAT128 test_integrals(); #endif From c04b83bf154661d4c607b45e98559555b2b18200 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Wed, 22 Aug 2018 19:33:49 +0100 Subject: [PATCH 57/71] LambertW: Moved some files around, deleted dead ones. --- test/test_lambert_w0_precision_high.cpp | 364 ---------------- test/test_lambert_w0_precision_low.cpp | 394 ------------------ .../lambert_w_high_reference_values.cpp | 0 .../lambert_w_lookup_table_generator.cpp | 0 .../lambert_w_low_reference_values.cpp | 0 5 files changed, 758 deletions(-) delete mode 100644 test/test_lambert_w0_precision_high.cpp delete mode 100644 test/test_lambert_w0_precision_low.cpp rename {test => tools}/lambert_w_high_reference_values.cpp (100%) rename {test => tools}/lambert_w_lookup_table_generator.cpp (100%) rename {test => tools}/lambert_w_low_reference_values.cpp (100%) diff --git a/test/test_lambert_w0_precision_high.cpp b/test/test_lambert_w0_precision_high.cpp deleted file mode 100644 index 8616e5be1..000000000 --- a/test/test_lambert_w0_precision_high.cpp +++ /dev/null @@ -1,364 +0,0 @@ -// Copyright Paul A. Bristow 2017. - -// 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). - -// Test evaluations of Lambert W function and comparison with reference values > 0.5 computed at 100 decimal digits precision. - -// ALso used to test JM_lambert_w0 - -//#define BOOST_MATH_LAMBERT_W_TEST_OUTPUT // Define to output all values of argument z and lambert W and differences. - -#include // For float_64_t, float128_t. Must be first include! -#include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ...Fw = -#include // for BOOST_MSVC versions. -#include -#include // boost::exception -#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. -#include -#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. - -#include // boost::multiprecision::cpp_dec_float_50 -using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. -using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. - -#include -// Multiprecision types: -//test_spots(static_cast(0)); -//test_spots(static_cast(0)); -//test_spots(static_cast(0)); - -using boost::multiprecision::cpp_bin_float_double_extended; -using boost::multiprecision::cpp_bin_float_double; -using boost::multiprecision::cpp_bin_float_quad; -// #define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for (much) diagnostic output. - -#include // For lambert_w0 and _wm1 functions. - -#include "C:\Users\Paul\Desktop\lambert_w0.hpp" // JM series version 2. -// using boost::math::jm_lambert_w0; - -#include -#include -#include -using boost::lexical_cast; -#include - -#include -#include -#include -#include -#include // For std::numeric_limits. -#include -#include - -// Include 'Known good' Lambert w values using N[productlog(-0.3), 100] -// evaluated to full precision of RealType (up to 100 decimal digits). -// Checked for a few z values using WolframAlpha command: N[productlog(-0.3), 100] -#include "lambert_w_high_reference_values.ipp" - -// Optional functions to list z arguments and reference lambert w values. -template -void list_zws() -{ - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << noof_tests << " Test values of type: " << typeid(RealType).name() << std::endl; - - init_ws(); - init_zs(); - - for (size_t i = 0; i != noof_tests; i++) - { - std::cout << i << " " << zs[i] << " " << ws[i] << std::endl; - } -} // list_zws()template - - //! Test difference between 'known good' reference values (100 decimal digit precision) - //! of Lambert W and values computed for the RealType by lambert_w0 (or lambert_wm1) function. -template -float test_zws() -{ - std::cout << "Tests with type: " << typeid(RealType).name() << std::endl; - // std::cout << noof_tests << " test values computed and compared." << std::endl; - // Better to show just once at start of all tests? - std::cout << "digits10 = " << std::numeric_limits::digits10 - << ", max_digits10 = " << std::numeric_limits::max_digits10 - << std::setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() - << std::endl; - - std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits. - //init_zs(); // Test z arguments. - //init_ws(); // Lambert W reference values. - init_zws(); // Test z arguments and Lambert W reference values. - - using boost::math::lambert_w0; - using boost::math::jm_lambert_w0; - using boost::math::lambert_wm1; - using boost::math::float_distance; - - //! Biggest float distance between reference and computed Lambert W. - long long int max_distance = 0; - //! Total of all float distances for all the values tested. - long long int total_distance = 0; - // Mean distance = total_distance / noof_tests. - float mean_distance = 0.F; - - for (size_t i = 0; i != noof_tests; i++) - { - RealType z = zs[i]; - RealType w = jm_lambert_w0(z); // Only for float or double! - RealType kw = ws[i]; // 'Known good' 100 decimal digits. - - RealType fd = float_distance(w, kw); - RealType diff = (w - kw); - - long long int distance = static_cast(fd); - long long int abs_distance = abs(distance); - total_distance += abs_distance; - if (abs_distance > max_distance) - { - max_distance = abs_distance; - } - mean_distance = (float)total_distance / noof_tests; - - #ifdef BOOST_MATH_LAMBERT_W_TEST_OUTPUT - std::cout << z << " " << w << " " << ws[i] // << ", Distance = " << distance not useful for multiprecision types? - << std::setprecision(3) - << ", diff abs " << diff - << ", diff rel " << (w - kw) / kw - << ", epsilons = " << diff / std::numeric_limits::epsilon() - << std::setprecision(std::numeric_limits::max_digits10) - << std::endl; - #endif - } // for - std::streamsize precision = std::cout.precision(3); - std::cout << "max " << max_distance << ", total distance = " << total_distance << " bits, mean " << mean_distance << std::endl; - std::cout.precision(precision); - return mean_distance; -} // void test_zws() - - //! Compare a single evaluation of lambert_w0 with reference value (100 decimal digit precision). - //! \returns distance between values in bits. - //! This falls foul of conversion using multiprecision. - //! And of loss of precision using multiprecision. - //! using macro BOOST_MATH_TEST_VALUE avoids this pitfall. -template -int test_spot(RealType z) -{ - using boost::math::jm_lambert_w0; - using boost::math::lambert_w0; - using boost::math::float_distance; - - RealType lw = lambert_w0(z); - RealType rlw = static_cast(lambert_w0(z)); - - std::cout.precision(std::numeric_limits::max_digits10); // or - //std::cout.precision(std::numeric_limits::digits10); - std::cout << lw << "\n" << rlw << std::endl; - - int distance = static_cast(float_distance(rlw, lw)); - std::cout << "distance " << distance << std::endl; - return distance; -} // int test_spot(RealType z) - - //! Compare computed Lambert W(z) with 'known good' reference values. - //! Both as the same RealType. -template -int compare_spot(RealType z, RealType w) -{ - using boost::math::lambert_w0; - using boost::math::jm_lambert_w0; - using boost::math::lambert_wm1; - using boost::math::nextafter; - using boost::math::float_next; - using boost::math::float_distance; - - //init_zs(); // Test z arguments. - //init_ws(); // Lambert W reference values. - init_zws(); // Initialise both Test z arguments and Lambert_w values. - - std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; - - std::cout << "digits10 = " << std::numeric_limits::digits10 - << ", max_digits10 = " << std::numeric_limits::max_digits10 - << ", epsilon = " << std::numeric_limits::epsilon() - << std::endl; - - // std::cout.precision(std::numeric_limits::max_digits10); - std::cout.precision(std::numeric_limits::digits10); - - RealType lw = lambert_w0(z); - RealType flw = w; - - std::cout << lw << "\n" << flw << std::endl; - - int distance = static_cast(float_distance(flw, lw)); - - std::cout << "distance " << distance << std::endl; - - return distance; -} // template int compare_spot(RealType z, RealType w) - - //! THis is no longer useful? - //template - //int test_spots(RealType) - //{ - // std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; - // //std::cout.precision(std::numeric_limits::max_digits10); // or digits10? - // std::cout.precision(std::numeric_limits::digits10); - // std::size_t n = noof_tests; - // std::cout << n << " test values. " << std::endl; - // int distances = 0; - // for (std::size_t i = 0; i != n; i++) - // { - // // RealType z = BOOST_MATH_TEST_VALUE(RealType, 0.5); - // //RealType w = BOOST_MATH_TEST_VALUE(RealType, "0.351733711249195826024909300929951065171464215517111804046"); - // //RealType z = lexical_cast(zs[i]); // lexical_cast doesn't do more than double precision! - // //RealType w = lexical_cast(ws[i]); - // // So can only do this safely using macro BOOST_MATH_TEST_VALUE. - // //RealType z = BOOST_MATH_TEST_VALUE(RealType, test_zs[i]); - // //RealType w = BOOST_MATH_TEST_VALUE(RealType, test_ws[i]); - // // error Missing suffix L - // - // RealType z = zs[i]; - // RealType w = ws[i]; - // std::cout << z << " " << w << std::endl; - // distances += compare_spot(z, w); - // } - // return distances; - //} // templateint test_spots(RealType) - -int main() -{ - try - { - std::cout << "Lambert W tests,\n" - << noof_tests << - " tests comparing with 100 decimal digits precision reference values." << std::endl; - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << std::showpoint << std::endl; // Trailing zeros. - - using boost::math::constants::exp_minus_one; - - using boost::math::lambert_w0; - using boost::math::lambert_wm1; - using boost::math::nextafter; - using boost::math::float_next; - - using boost::math::policies::make_policy; - using boost::math::policies::digits10; - using boost::math::policies::policy; - - 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::throw_on_error; - - // Define a policy: - typedef policy< - domain_error, - overflow_error - > throw_policy; - - // Examples of some single tests show pitfalls using mutliprecision. - - // Single spot value test of lambert_w0(0.5). - //using boost::multiprecision::cpp_bin_float_quad; - //std::cout.precision(std::numeric_limits::max_digits10); - //cpp_bin_float_quad zq(0.5); - //std::cout << "\nLambert W (" << zq << ") = " << LambertW0(zq) << std::endl; // - // 0.351733711249195826024909300929951065171464215517111804046 expected from Wolfram (and Luu triple Halley). - // 0.3517337112491958262237012910577188474 // cpp_bin_float_quad - // 0.35173371124919584 // double - - test_spot(0.5F); // 0.351733714 - test_spot(0.5); // 0.35173371124919584 - // Multiprecision won't convert at full precision. - //test_spot(0.5); - //test_spot(0.5); - //test_spot(0.5); - - //std::cout <<"float total distances = " << test_spots(0.1f) << std::endl; - //std::cout <<"double total distances = " << test_spots(0.1) << std::endl; - //std::cout <<"cpp_bin_float_quad total distances = " << test_spots(0.1) << std::endl; - - // Compare double spot value: - compare_spot(0.5, 0.351733711249195826024909300929951065171464215517111804046); // 0.351733711249195826024909300929951 - - //cpp_bin_float_quad hq(0.5); // Care - only convert 17 decimal digits precision for double. - // but this value 0.5 is exactly representable, so exact, and so OK. - cpp_bin_float_quad hq("0.5"); // - // For multiprecision types, need to use a decimal digit string, not a floating-point literal: - cpp_bin_float_quad rhq("0.351733711249195826024909300929951065171464215517111804046"); - compare_spot(hq, rhq); // 0.351733711249195826024909300929951 and distance == 0 - // Useful to check a particular z argument. - //init_zs(); - //init_ws(); - init_zws(); - - compare_spot(zs[1], ws[1]); // -0.653694501269090 -0.653694501269089, distance = -1 - - // Simple group of test values, including near zero, and near singularity. - - // Optionally list the z arguments and reference test lambert_w values. - //list_zws(); - //list_zws(); - //list_zws(); - //list_zws(); - //list_zws(); - //list_zws<__float128>(); // OK, but fails test below. - //#ifdef BOOST_HAS_FLOAT128 - // list_zws(); - //#endif - // list_zws(); - //list_zws(); - - // Test several floating-point types: - test_zws(); - test_zws(); - - // test_zws(); expect exactly as double. - if (std::numeric_limits::digits == std::numeric_limits::digits) - { - // Emulate 80-bit long double. - test_zws(); - } - else - { // True 80-bit (or 128-bit) long double. - test_zws(); - } - test_zws(); - // test_zws(); - } - catch (std::exception& ex) - { - std::cout << ex.what() << std::endl; - } -} // int main() - - /* - Output: - - Lambert W tests, - 450 single spot tests comparing with 100 decimal digits precision reference values. - - Tests with type: float - digits10 = 6, max_digits10 = 9, epsilon = 1.19e-07 - max 1, total distance = 10 bits, mean 0.0222 - - Tests with type: double - digits10 = 15, max_digits10 = 17, epsilon = 2.22e-16 - max 1, total distance = 8 bits, mean 0.0178 - - Tests with type: class boost::multiprecision::number,0> - digits10 = 18, max_digits10 = 22, epsilon = 1.08e-19 - max 1, total distance = 109 bits, mean 0.242 - - Tests with type: class boost::multiprecision::number,0> - digits10 = 33, max_digits10 = 37, epsilon = 1.93e-34 - max 1, total distance = 135 bits, mean 0.300 - - - */ \ No newline at end of file diff --git a/test/test_lambert_w0_precision_low.cpp b/test/test_lambert_w0_precision_low.cpp deleted file mode 100644 index 299134412..000000000 --- a/test/test_lambert_w0_precision_low.cpp +++ /dev/null @@ -1,394 +0,0 @@ -// Copyright Paul A. Bristow 2017. - -// 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). - -// Test evaluations of Lambert W function and comparison with reference values computed at 100 decimal digits precision. - -// Alos uses JM version 2 comparing with PB/fukushima lambert_w0 before it is incorporated. - -//#define BOOST_MATH_LAMBERT_W_TEST_OUTPUT // Define to output all values of argument z and lambert W and differences. - -#include // For float_64_t, float128_t. Must be first include! -#include // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ...Fw = -#include // for BOOST_MSVC versions. -#include -#include // boost::exception -#include // For exp_minus_one == 3.67879441171442321595523770161460867e-01. -#include -#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. - -// Built-in/fundamental Quad 128-bit type, if available. -#ifdef BOOST_HAS_FLOAT128 -#include // Not available for MSVC. -//using boost::multiprecision::float128; -#endif - -#include // boost::multiprecision::cpp_dec_float_50 -using boost::multiprecision::cpp_dec_float_50; // 50 decimal digits type. -using boost::multiprecision::cpp_dec_float_100; // 100 decimal digits type. - -#include -using boost::multiprecision::cpp_bin_float_50; // 50 decimal digits type. - -// Multiprecision types: -//test_spots(static_cast(0)); -//test_spots(static_cast(0)); -//test_spots(static_cast(0)); - -// #define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for (much) diagnostic output. - -// For lambert_w function. -#include - -#include "C:\Users\Paul\Desktop\lambert_w0.hpp" // JM series version 2 for testing. -// using boost::math::jm_lambert_w0; - -using boost::multiprecision::cpp_bin_float_double_extended; -using boost::multiprecision::cpp_bin_float_double; -using boost::multiprecision::cpp_bin_float_quad; - -#include -#include -#include -using boost::lexical_cast; -#include - -#include -#include -#include -#include -#include // For std::numeric_limits. -#include -#include - -// Include 'Known good' Lambert w values using N[productlog(-0.3), 100] -// evaluated to full precision of RealType (up to 100 decimal digits). -// Checked for a few z values using WolframAlpha command: N[productlog(-0.3), 100] -#include "lambert_w_low_reference_values.ipp" - -// Optional functions to list z arguments and reference lambert w values. -template -void list_zws() -{ - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << noof_tests << " Test values of type: " << typeid(RealType).name() << std::endl; - - init_ws(); - init_zs(); - - for (size_t i = 0; i != noof_tests; i++) - { - std::cout << i << " " << zs[i] << " " << ws[i] << std::endl; - } -} // list_zws()template - -//! Test difference between 'known good' reference values (100 decimal digit precision) -//! of Lambert W and values computed for the RealType by lambert_w0 (or lambert_wm1) function. -template -float test_zws() -{ - std::cout << "Tests with type: " << typeid(RealType).name() << std::endl; - // std::cout << noof_tests << " test values computed and compared." << std::endl; - // Better to show just once at start of all tests? - std::cout << "digits10 = " << std::numeric_limits::digits10 - << ", max_digits10 = " << std::numeric_limits::max_digits10 - << std:: setprecision(3) << ", epsilon = " << std::numeric_limits::epsilon() - << std::endl; - - std::cout.precision(std::numeric_limits::max_digits10); // Show all possibly significant digits. - init_zs(); // Test z arguments. - init_ws(); // Lambert W reference values. - - using boost::math::lambert_w0; - using boost::math::lambert_wm1; - using boost::math::float_distance; - - //! Biggest float distance between reference and computed Lambert W. - long long int max_distance = 0; - //! Total of all float distances for all the values tested. - long long int total_distance = 0; - // Mean distance = total_distance / noof_tests. - float mean_distance = 0.F; - - for (size_t i = 0; i != noof_tests; i++) - { - RealType z = zs[i]; - RealType w = lambert_w0(z); // Only for float or double! - RealType kw = ws[i]; // 'Known good' 100 decimal digits. - - RealType fd = float_distance(w, kw); - RealType diff = (w - kw); - - long long int distance = static_cast(fd); - long long int abs_distance = abs(distance); - total_distance += abs_distance; - if (abs_distance > max_distance) - { - max_distance = abs_distance; - } - mean_distance = (float)total_distance / noof_tests; - - #ifdef BOOST_MATH_LAMBERT_W_TEST_OUTPUT - std::cout << z << " " << w << " " << ws[i] // << ", Distance = " << distance not useful for multiprecision types? - << std::setprecision(3) - << ", diff abs " << diff - << ", diff rel " << (w - kw) / kw - << ", epsilons = " << diff / std::numeric_limits::epsilon() - << std::setprecision(std::numeric_limits::max_digits10) - << std::endl; - #endif - } // for - std::streamsize precision = std::cout.precision(3); - std::cout << "max " << max_distance << ", total distance = " << total_distance << " bits, mean " << mean_distance << std::endl; - std::cout.precision(precision); - return mean_distance; -} // void test_zws() - -//! Compare a single evaluation of lambert_w0 with reference value (100 decimal digit precision). -//! \returns distance between values in bits. -//! This falls foul of conversion using multiprecision. -//! And of loss of precision using multiprecision. -//! using macro BOOST_MATH_TEST_VALUE avoids this pitfall. -template -int test_spot(RealType z) -{ - using boost::math::lambert_w0; - using boost::math::jm_lambert_w0; - using boost::math::float_distance; - - RealType lw = jm_lambert_w0(z); - RealType rlw = static_cast(lambert_w0(z)); - - std::cout.precision(std::numeric_limits::max_digits10); // or - //std::cout.precision(std::numeric_limits::digits10); - std::cout << lw << "\n" << rlw << std::endl; - - int distance = static_cast(float_distance(rlw, lw)); - std::cout << "distance " << distance << std::endl; - return distance; -} // int test_spot(RealType z) - -//! Compare computed Lambert W(z) with 'known good' reference values. -//! Both as the same RealType. -template -int compare_spot(RealType z, RealType w) -{ - // using boost::math::lambert_w0; - using boost::math::jm_lambert_w0; - using boost::math::lambert_wm1; - using boost::math::nextafter; - using boost::math::float_next; - using boost::math::float_distance; - - init_zs(); // Test z arguments. - init_ws(); // Lambert W reference values. - - std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; - - std::cout << "digits10 = " << std::numeric_limits::digits10 - << ", max_digits10 = " << std::numeric_limits::max_digits10 - << ", epsilon = " << std::numeric_limits::epsilon() - << std::endl; - - // std::cout.precision(std::numeric_limits::max_digits10); - std::cout.precision(std::numeric_limits::digits10); - - RealType lw = jm_lambert_w0(z); - RealType flw = w; - - std::cout << lw << "\n" << flw << std::endl; - - int distance = static_cast(float_distance(flw, lw)); - - std::cout << "distance " << distance << std::endl; - - return distance; -} // template int compare_spot(RealType z, RealType w) - -//! THis is no longer useful? -//template -//int test_spots(RealType) -//{ -// std::cout << std::boolalpha << "Test with type: " << typeid(RealType).name() << std::endl; -// //std::cout.precision(std::numeric_limits::max_digits10); // or digits10? -// std::cout.precision(std::numeric_limits::digits10); -// std::size_t n = noof_tests; -// std::cout << n << " test values. " << std::endl; -// int distances = 0; -// for (std::size_t i = 0; i != n; i++) -// { -// // RealType z = BOOST_MATH_TEST_VALUE(RealType, 0.5); -// //RealType w = BOOST_MATH_TEST_VALUE(RealType, "0.351733711249195826024909300929951065171464215517111804046"); -// //RealType z = lexical_cast(zs[i]); // lexical_cast doesn't do more than double precision! -// //RealType w = lexical_cast(ws[i]); -// // So can only do this safely using macro BOOST_MATH_TEST_VALUE. -// //RealType z = BOOST_MATH_TEST_VALUE(RealType, test_zs[i]); -// //RealType w = BOOST_MATH_TEST_VALUE(RealType, test_ws[i]); -// // error Missing suffix L -// -// RealType z = zs[i]; -// RealType w = ws[i]; -// std::cout << z << " " << w << std::endl; -// distances += compare_spot(z, w); -// } -// return distances; -//} // templateint test_spots(RealType) - -int main() -{ - try - { - std::cout << "Lambert W tests,\n" - << noof_tests << - " single spot tests comparing with 100 decimal digits precision reference values." << std::endl; - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << std::showpoint << std::endl; // Trailing zeros. - - using boost::math::constants::exp_minus_one; - - using boost::math::lambert_w0; - using boost::math::lambert_wm1; - using boost::math::nextafter; - using boost::math::float_next; - - using boost::math::policies::make_policy; - using boost::math::policies::digits10; - using boost::math::policies::policy; - - 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::throw_on_error; - - // Define a policy: - typedef policy< - domain_error, - overflow_error - > throw_policy; - - // Examples of some single tests show pitfalls using mutliprecision. - - // Single spot value test of lambert_w0(0.5). - //using boost::multiprecision::cpp_bin_float_quad; - //std::cout.precision(std::numeric_limits::max_digits10); - //cpp_bin_float_quad zq(0.5); - //std::cout << "\nLambert W (" << zq << ") = " << LambertW0(zq) << std::endl; // - // 0.351733711249195826024909300929951065171464215517111804046 expected from Wolfram (and Luu triple Halley). - // 0.3517337112491958262237012910577188474 // cpp_bin_float_quad - // 0.35173371124919584 // double - - test_spot(0.5F); // 0.351733714 - test_spot(0.5); // 0.35173371124919584 - // Multiprecision won't convert at full precision. - //test_spot(0.5); - //test_spot(0.5); - //test_spot(0.5); - - //std::cout <<"float total distances = " << test_spots(0.1f) << std::endl; - //std::cout <<"double total distances = " << test_spots(0.1) << std::endl; - //std::cout <<"cpp_bin_float_quad total distances = " << test_spots(0.1) << std::endl; - - // Compare double spot value: - compare_spot(0.5, 0.351733711249195826024909300929951065171464215517111804046); // 0.351733711249195826024909300929951 - - //cpp_bin_float_quad hq(0.5); // Care - only convert 17 decimal digits precision for double. - // but this value 0.5 is exactly representable, so exact, and so OK. - cpp_bin_float_quad hq("0.5"); // - // For multiprecision types, need to use a decimal digit string, not a floating-point literal: - cpp_bin_float_quad rhq("0.351733711249195826024909300929951065171464215517111804046"); - compare_spot(hq, rhq); // 0.351733711249195826024909300929951 and distance == 0 - // Useful to check a particular z argument. - init_zs(); - init_ws(); - - compare_spot(zs[1], ws[1]); // -0.653694501269090 -0.653694501269089, distance = -1 - - // Simple group of test values, including near zero, and near singularity. - - // Optionally list the z arguments and reference test lambert_w values. - //list_zws(); - //list_zws(); - //list_zws(); - //list_zws(); - //list_zws(); - //list_zws<__float128>(); // OK, but fails test below. -//#ifdef BOOST_HAS_FLOAT128 -// list_zws(); -//#endif - // list_zws(); - //list_zws(); - - // Test several floating-point types: - test_zws(); - test_zws(); - - // test_zws(); expect exactly as double. - if (std::numeric_limits::digits == std::numeric_limits::digits) - { - // Emulate 80-bit long double. - test_zws(); - } - else - { // True 80-bit (or 128-bit) long double. - test_zws(); - } - test_zws(); - // test_zws(); - } - catch (std::exception& ex) - { - std::cout << ex.what() << std::endl; - } -} // int main() - -/* -test_lambert_w0_precision_low.cpp -Generating code -235 of 3718 functions ( 6.3%) were compiled, the rest were copied from previous compilation. -0 functions were new in current compilation -618 functions had inline decision re-evaluated but remain unchanged -Finished generating code -Lambert_w_pb2_tests.vcxproj -> J:\Cpp\Misc\x64\Release\Lambert_w_pb2_tests.exe -Lambert_w_pb2_tests.vcxproj -> J:\Cpp\Misc\x64\Release\Lambert_w_pb2_tests.pdb (Full PDB) -Lambert W tests, -100 single spot tests comparing with 100 decimal digits precision reference values. - -0.351733714 -0.351733714 -distance 0 -0.35173371124919584 -0.35173371124919584 -distance 0 -Test with type: double -digits10 = 15, max_digits10 = 17, epsilon = 2.2204460492503131e-16 -0.351733711249196 -0.351733711249196 -distance 0 -Test with type: class boost::multiprecision::number,0> -digits10 = 33, max_digits10 = 37, epsilon = 1.92592994438724e-34 -0.351733711249195826024909300929951 -0.351733711249195826024909300929951 -distance 0 -Test with type: double -digits10 = 15, max_digits10 = 17, epsilon = 2.22044604925031308084726333618164e-16 --0.653694501269090 --0.653694501269089 -distance -1 - -Tests with type: float -digits10 = 6, max_digits10 = 9, epsilon = 1.19e-07 -max 2, total distance = 37 bits, mean 0.370 -Tests with type: double -digits10 = 15, max_digits10 = 17, epsilon = 2.22e-16 -max 9, total distance = 49 bits, mean 0.490 -Tests with type: class boost::multiprecision::number,0> -digits10 = 18, max_digits10 = 22, epsilon = 1.08e-19 -max 4, total distance = 47 bits, mean 0.470 -Tests with type: class boost::multiprecision::number,0> -digits10 = 33, max_digits10 = 37, epsilon = 1.93e-34 -max 4, total distance = 54 bits, mean 0.540 - -*/ \ No newline at end of file diff --git a/test/lambert_w_high_reference_values.cpp b/tools/lambert_w_high_reference_values.cpp similarity index 100% rename from test/lambert_w_high_reference_values.cpp rename to tools/lambert_w_high_reference_values.cpp diff --git a/test/lambert_w_lookup_table_generator.cpp b/tools/lambert_w_lookup_table_generator.cpp similarity index 100% rename from test/lambert_w_lookup_table_generator.cpp rename to tools/lambert_w_lookup_table_generator.cpp diff --git a/test/lambert_w_low_reference_values.cpp b/tools/lambert_w_low_reference_values.cpp similarity index 100% rename from test/lambert_w_low_reference_values.cpp rename to tools/lambert_w_low_reference_values.cpp From a1d658aed11ab01060410bad6d5886f26c6fc591 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Thu, 23 Aug 2018 10:26:17 +0100 Subject: [PATCH 58/71] LambertW: start to split tests into smaller chunks. --- test/test_lambert_w.cpp | 364 ---------------------------------------- 1 file changed, 364 deletions(-) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index c4329ac69..979682994 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -13,7 +13,6 @@ // #define BOOST_MATH_TEST_MULTIPRECISION // Add tests for several multiprecision types (not just built-in). // #define BOOST_MATH_TEST_FLOAT128 // Add test using float128 type (GCC only, needing gnu++17 and quadmath library). -// #define BOOST_MATH_LAMBERT_W0_INTEGRALS // Add quadrature tests that cover the whole range of the Lambert W0 function. #ifdef BOOST_MATH_TEST_FLOAT128 #include // For float_64_t, float128_t. Must be first include! @@ -78,135 +77,6 @@ using boost::math::lambert_w0; std::string show_versions(void); -//#define BOOST_MATH_LAMBERT_W0_INTEGRALS - -#ifdef BOOST_MATH_LAMBERT_W0_INTEGRALS - -// Added code and test for Integral of the Lambert W function: by Nick Thompson. -// https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals - -#include // for integral tests. -#include // for integral tests. -#include // for integral tests. - - using boost::math::policies::policy; - using boost::math::policies::make_policy; - -// using statements needed for changing error handling policy. -using boost::math::policies::evaluation_error; -using boost::math::policies::domain_error; -using boost::math::policies::overflow_error; -using boost::math::policies::ignore_error; -using boost::math::policies::throw_on_error; - -typedef policy< - domain_error, - overflow_error -> no_throw_policy; - -// Assumes that function has a throw policy, for example: -// NOT lambert_w0(1 / (x * x), no_throw_policy()); -// Error in function boost::math::quadrature::exp_sinh::integrate: -// The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. -// Please ensure your function evaluates to a finite number of its entire domain. -template -T debug_integration_proc(T x) -{ - T result; // warning C4701: potentially uninitialized local variable 'result' used - // T result = 0 ; // But result may not be assigned below? - try - { - // Assign function call to result in here... - if (x <= sqrt(boost::math::tools::min_value()) ) - { - result = 0; - } - else - { - result = lambert_w0(1 / (x * x)); - } - // result = lambert_w0(1 / (x * x), no_throw_policy()); // Bad idea, less helpful diagnostic message is: - // Error in function boost::math::quadrature::exp_sinh::integrate: - // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. - // Please ensure your function evaluates to a finite number of its entire domain. - - } // try - catch (const std::exception& e) - { - std::cout << "Exception " << e.what() << std::endl; - // set breakpoint here: - std::cout << "Unexpected exception thrown in integration code at abscissa (x): " << x << "." << std::endl; - if (!std::isfinite(result)) - { - // set breakpoint here: - std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; - } - if (std::isnan(result)) - { - // set breakpoint here: - std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; - } - } // catch - return result; -} // T debug_integration_proc(T x) - -template -void test_integrals() -{ - // Integral of the Lambert W function: - // https://en.wikipedia.org/wiki/Lambert_W_function - using boost::math::quadrature::tanh_sinh; - using boost::math::quadrature::exp_sinh; - // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html - using std::sqrt; - - std::cout << "Integration of type " << typeid(Real).name() << std::endl; - - Real tol = std::numeric_limits::epsilon(); - { // // Integrate for function lambert_W0(z); - tanh_sinh ts; - Real a = 0; - Real b = boost::math::constants::e(); - auto f = [](Real z)->Real - { - return lambert_w0(z); - }; - Real z = ts.integrate(f, a, b); // OK without any decltype(f) - BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::e() - 1, tol); - } - { - // Integrate for function lambert_W0(z/(z sqrt(z)). - exp_sinh es; - auto f = [](Real z)->Real - { - return lambert_w0(z)/(z * sqrt(z)); - }; - Real z = es.integrate(f); // OK - BOOST_CHECK_CLOSE_FRACTION(z, 2 * boost::math::constants::root_two_pi(), tol); - } - { - // Integrate for function lambert_W0(1/z^2). - exp_sinh es; - //const Real sqrt_min = sqrt(boost::math::tools::min_value()); // 1.08420217e-19 fo 32-bit float. - // error C3493: 'sqrt_min' cannot be implicitly captured because no default capture mode has been specified - auto f = [](Real z)->Real - { - if (z <= sqrt(boost::math::tools::min_value()) ) - { // Too small would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0 z parameter. - return static_cast(0); - } - else - { - return lambert_w0(1 / (z * z)); // warning C4756: overflow in constant arithmetic, even though cannot happen. - } - }; - Real z = es.integrate(f); - BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol); - } -} // template void test_integrals() - -#endif // BOOST_MATH_LAMBERT_W0_INTEGRALS - //! Build a message of information about build, architecture, address model, platform, ... std::string show_versions(void) { @@ -794,13 +664,6 @@ BOOST_AUTO_TEST_CASE( test_types ) std::cout << "\nBOOST_MATH_TEST_FLOAT128 NOT defined so NO float128 tests." << std::endl; #endif // #ifdef BOOST_MATH_TEST_FLOAT128 - // Fixed-point types: - // Some fail 0.1 to 1.0 ??? - // test_spots(static_cast >(0)); - // fixed_point::negatable<15,-16> has range 1.52587891e-05 to 32768, epsilon 3.05175781e-05 - - //test_spots(boost::math::concepts::real_concept(0.1)); // "real_concept" - was OK. - } // BOOST_AUTO_TEST_CASE( test_types ) @@ -1089,231 +952,4 @@ BOOST_AUTO_TEST_CASE( test_range_of_double_values ) } } // BOOST_AUTO_TEST_CASE(test_range_of_double_values) -#ifdef BOOST_MATH_LAMBERT_W_DERIVATIVES -BOOST_AUTO_TEST_CASE( Derivatives_of_lambert_w ) -{ - std::cout << "Macro BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined." << std::endl; - BOOST_TEST_MESSAGE("\nTest Lambert W function 1st differentials."); - - using boost::math::constants::exp_minus_one; - using boost::math::lambert_w0_prime; - using boost::math::lambert_wm1_prime; - - // Derivatives - // https://www.wolframalpha.com/input/?i=derivative+of+productlog(0,+x) - // d/dx(W_0(x)) = W(x)/(x W(x) + x) - // https://www.wolframalpha.com/input/?i=derivative+of+productlog(-1,+x) - // d/dx(W_(-1)(x)) = (W_(-1)(x))/(x W_(-1)(x) + x) - - // 55 decimal digit values added to allow future testing using multiprecision. - - typedef double RealType; - - int epsilons = 1; - RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. - - // derivative of productlog(-1, x) at x = -0.1 == -13.8803 - // (derivative of productlog(-1, x) ) at x = N[-0.1, 55] - but the result disappears! - // (derivative of N[productlog(-1, x), 55] ) at x = N[-0.1, 55] - - // W0 branch - BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)), - // BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218355), - BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218358355273514903396335693828167746571404), - tolerance); // 1.7491967609218358355273514903396335693828167746571404 - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, 10.)), - BOOST_MATH_TEST_VALUE(RealType, 0.063577133469345105142021311010780887641928338458371618), - tolerance); - -// W-1 branch - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.1)), - BOOST_MATH_TEST_VALUE(RealType, -13.880252213229780748699361486619519025203815492277715), - tolerance); - // Lambert W_prime -13.880252213229780748699361486619519025203815492277715, double -13.880252213229781 - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)), - BOOST_MATH_TEST_VALUE(RealType, -8.2411940564179044961885598641955579728547896392013239), - tolerance); - // Lambert W_prime -8.2411940564179044961885598641955579728547896392013239, double -8.2411940564179051 - - // Lambert W_prime 0.063577133469345105142021311010780887641928338458371618, double 0.063577133469345098 -}; // BOOST_AUTO_TEST_CASE("Derivatives of lambert_w") - -#endif // BOOST_MATH_LAMBERT_W_DERIVATIVES - -#ifdef BOOST_MATH_LAMBERT_W0_INTEGRALS -BOOST_AUTO_TEST_CASE( integrals ) -{ - std::cout << "Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined." << std::endl; - BOOST_TEST_MESSAGE("\nTest Lambert W0 integrals."); - try - { - // using statements needed to change precision policy. - using boost::math::policies::policy; - using boost::math::policies::make_policy; - using boost::math::policies::precision; - using boost::math::policies::digits2; - using boost::math::policies::digits10; - - // using statements needed for changing error handling policy. - using boost::math::policies::evaluation_error; - using boost::math::policies::domain_error; - using boost::math::policies::overflow_error; - using boost::math::policies::ignore_error; - using boost::math::policies::throw_on_error; - - typedef policy< - domain_error, - overflow_error - > no_throw_policy; - - /* - // Experiment with better diagnostics. - typedef float Real; - - Real inf = std::numeric_limits::infinity(); - Real max = (std::numeric_limits::max)(); - std::cout.precision(std::numeric_limits::max_digits10); - //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308 - std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf - std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227 - //std::cout << lambert_w0(inf) << std::endl; // inf - will throw. - std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0 - std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324 - std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308 - - // Approximate the largest lambert_w you can get for type T? - float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. - std::cout << "w max_f " << max_w_f << std::endl; // 84.2879 - Real max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. - std::cout << "w max " << max_w << std::endl; // 703.227 - - std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // - std::cout << "test integral 1/z^2" << std::endl; - std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 - std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16 - std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 - std::cout << "epsilon = " << std::numeric_limits::epsilon() << std::endl; // - std::cout << "sqrt(max) = " << sqrt(boost::math::tools::max_value() ) << std::endl; // sqrt(max) = 1.8446742974197924e+19 - std::cout << "sqrt(min) = " << sqrt(boost::math::tools::min_value() ) << std::endl; // sqrt(min) = 1.0842021724855044e-19 - - - -// Demo debug version. -Real tol = std::numeric_limits::epsilon(); -Real x; -{ - using boost::math::quadrature::exp_sinh; - exp_sinh es; - // Function to be integrated, lambert_w0(1/z^2). - - //auto f = [](Real z)->Real - //{ // Naive - no protection against underflow and subsequent divide by zero. - // return lambert_w0(1 / (z * z)); - //}; - // Diagnostic is: - // Error in function boost::math::lambert_w0: Expected a finite value but got inf - - auto f = [](Real z)->Real - { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things. - return debug_integration_proc(z); - }; - // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf. - - // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163. - // Unexpected exception thrown in integration code at abscissa (x): 3.478765835953569e-23. - x = es.integrate(f); - std::cout << "es.integrate(f) = " << x << std::endl; - BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol); - // root_two_pi(); - test_integrals(); -#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS - test_integrals(); -#endif -#ifdef BOOST_MATH_TEST_MULTIPRECISION -#ifdef BOOST_MATH_TEST_FLOAT128 - test_integrals(); -#endif - test_integrals(); -#endif // BOOST_MATH_TEST_MULTIPRECISION - } - catch (std::exception& ex) - { - std::cout << ex.what() << std::endl; - } -} - -#endif // BOOST_MATH_LAMBERT_W0_INTEGRALS - - /* - - Output: - - Running 4 test cases... - - Test Lambert W function for several types. - Program: i:\modular-boost\libs\math\test\test_lambert_w.cpp - Wed Jul 11 17:57:07 2018 - BuildInfo: - Platform Win32, 64-bit. - Compiler Microsoft Visual C++ version 14.1 - STL Dinkumware standard library version 650 - Boost version 1.68.0 - BOOST_MATH_TEST_MULTIPRECISION defined for multiprecision tests. - - - - Testing type float - Tolerance 2 * epsilon == 2.38419e-07 - Precision 6 decimal digits, max_digits10 = 9 - -exp(-1) = -0.367879450 - - Testing type double - Tolerance 2 * epsilon == 4.44089e-16 - Precision 15 decimal digits, max_digits10 = 17 - -exp(-1) = -0.36787944117144233 - - Testing type class boost::multiprecision::number,0> - Tolerance 16 * epsilon == 1.73472e-18 - Precision 18 decimal digits, max_digits10 = 22 - -exp(-1) = -0.3678794411714423215831 - - Testing type class boost::multiprecision::number,0> - Tolerance 16 * epsilon == 3.08149e-33 - Precision 33 decimal digits, max_digits10 = 37 - -exp(-1) = -0.3678794411714423215955237701614608727 - - Testing type class boost::multiprecision::number,0> - Tolerance 16 * epsilon == 8.55285e-50 - Precision 50 decimal digits, max_digits10 = 53 - -exp(-1) = -0.36787944117144232159552377016146086744581113103176804 - - BOOST_MATH_TEST_FLOAT128 NOT defined so NO float128 tests. - - Test Lambert W function type double for range of values. - Tolerance 1 * epsilon == 2.22045e-16 - (std::numeric_limits::min)() 2.2250738585072014e-308 - Macro BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined. - - Test Lambert W function 1st differentials. - Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined. - - Test Lambert W integrals. - Integration of type float - Integration of type double - Integration of type long double - Integration of type class boost::multiprecision::number,0> - - *** No errors detected - Press any key to continue . . . - - */ - - - From 10e6f0d68feb68514429876ec207bc1ecd18eb91 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Sun, 26 Aug 2018 19:51:15 +0100 Subject: [PATCH 59/71] Lambert W: Add tests near the singularity. Fix a couple of minor issues in the implementation to improve error rates. NB: errors very near the singularity are still very high - this is an intrinsic property of the function - we are solving z = w exp(w) for w, but there are actually a wide range of w values which satisfy the equation once we get very close to the singularity. --- .../math/special_functions/lambert_w.hpp | 23 +++++- test/test_lambert_w.cpp | 80 ++++++++++++++++++- 2 files changed, 98 insertions(+), 5 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index cf331f9a8..bf2731dad 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -950,6 +950,22 @@ T lambert_w0_approx(T z) //! For higher precisions, a 64-bit double approximation is computed first, //! and then refined using Halley interations. +template +inline T get_near_singularity_param(T z) +{ + const T p2 = 2 * (boost::math::constants::e() * z + 1); + const T p = sqrt(p2); + return p; +} +inline float get_near_singularity_param(float z) +{ + return static_cast(get_near_singularity_param((double)z)); +} +inline double get_near_singularity_param(double z) +{ + return static_cast(get_near_singularity_param((long double)z)); +} + // Forward declarations: //template T lambert_w0_small_z(T z, const Policy& pol); @@ -1176,9 +1192,7 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) else { // z is very close (within 0.01) of the singularity at e^-1. - const T p2 = 2 * (boost::math::constants::e() * z + 1); - const T p = sqrt(p2); - return lambert_w_singularity_series(p); + return lambert_w_singularity_series(get_near_singularity_param(z)); } } } // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit usually float. @@ -1627,7 +1641,8 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<0>&) // so use a series approximation proposed by Corless et al. const T p2 = 2 * (boost::math::constants::e() * z + 1); const T p = sqrt(p2); - return lambert_w_detail::lambert_w_singularity_series(p); + T w = lambert_w_detail::lambert_w_singularity_series(p); + return lambert_w_halley_iterate(w, z); } // Phew! If we get here we are in the normal range of the function, diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 979682994..fc9ee04b6 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -68,6 +68,13 @@ using boost::math::policies::digits10; using boost::math::lambert_wm1; using boost::math::lambert_w0; +#include "table_type.hpp" + +#ifndef SC_ +# define SC_(x) boost::lexical_cast::type>(BOOST_STRINGIZE(x)) +#endif + + #include #include #include @@ -145,6 +152,76 @@ std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION << return message.str(); } // std::string show_versions() + +template +void wolfram_test_near_singularity() +{ + // + // Spots near the singularity from http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5B-1%2Fe%2B2%5E-i,+50%5D,+N%5BLambertW%5B-1%2Fe+%2B+2%5E-i%5D,+50%5D%5D,+%7Bi,+2,+40%7D%5D + // + static const boost::array::type, 2>, 39> wolfram_test_near_singularity_data = + {{ + { { SC_(-0.11787944117144233402427744294982403516769409179688), SC_(-0.13490446826612137099065142885543349308605449591189) } },{ { SC_(-0.24287944117144233402427744294982403516769409179688), SC_(-0.34187241316000575559631565516533717918703951393828) } },{ { SC_(-0.30537944117144233402427744294982403516769409179688), SC_(-0.50704532478540670242736394530166187052909039079642) } },{ { SC_(-0.33662944117144233402427744294982403516769409179688), SC_(-0.63562321628494791544895212508757067989859372121549) } },{ { SC_(-0.35225444117144233402427744294982403516769409179688), SC_(-0.73357201771558852140844624841371893543359405991894) } },{ { SC_(-0.36006694117144233402427744294982403516769409179688), SC_(-0.80685912552602238275976720505076149562188136941981) } },{ { SC_(-0.36397319117144233402427744294982403516769409179688), SC_(-0.86091151614390373770305184939107560322835214525382) } },{ { SC_(-0.36592631617144233402427744294982403516769409179688), SC_(-0.90033567669608907987528169545609510444951296636737) } },{ { SC_(-0.36690287867144233402427744294982403516769409179688), SC_(-0.92884889586304130900291705545970353898661233095513) } },{ { SC_(-0.36739115992144233402427744294982403516769409179688), SC_(-0.94934196763921122756108351994184213101752011076782) } },{ { SC_(-0.36763530054644233402427744294982403516769409179688), SC_(-0.96400324129495105632485735566132352543383271582526) } },{ { SC_(-0.36775737085894233402427744294982403516769409179688), SC_(-0.97445736712728703357755243595334553847237474201138) } },{ { SC_(-0.36781840601519233402427744294982403516769409179688), SC_(-0.98189372378619472154195350108189165241865132390473) } },{ { SC_(-0.36784892359331733402427744294982403516769409179688), SC_(-0.98717434434269671591894280580432721487757138768109) } },{ { SC_(-0.36786418238237983402427744294982403516769409179688), SC_(-0.99091955260257317141206161906086819616043312707614) } },{ { SC_(-0.36787181177691108402427744294982403516769409179688), SC_(-0.99357346775773151586057357459040504547191256911173) } },{ { SC_(-0.36787562647417670902427744294982403516769409179688), SC_(-0.99545290640175819861266174073519228782773422561472) } },{ { SC_(-0.36787753382280952152427744294982403516769409179688), SC_(-0.99678329264937600678258333756796350065436689760936) } },{ { SC_(-0.36787848749712592777427744294982403516769409179688), SC_(-0.99772473035978895659981485126201758865515569761514) } },{ { SC_(-0.36787896433428413089927744294982403516769409179688), SC_(-0.99839078411548014765525278348680286544429555739338) } },{ { SC_(-0.36787920275286323246177744294982403516769409179688), SC_(-0.99886193379608135520603487963907992157933985302350) } },{ { SC_(-0.36787932196215278324302744294982403516769409179688), SC_(-0.99919517626703684624524893082905669989578841060892) } },{ { SC_(-0.36787938156679755863365244294982403516769409179688), SC_(-0.99943085896775657378245957087668418410735469441835) } },{ { SC_(-0.36787941136911994632896494294982403516769409179688), SC_(-0.99959753415605033951327478977234592072050509074480) } },{ { SC_(-0.36787942627028114017662119294982403516769409179688), SC_(-0.99971540249082798050505534900918173321899800190957) } },{ { SC_(-0.36787943372086173710044931794982403516769409179688), SC_(-0.99979875358003464529770521637722571161846456343102) } },{ { SC_(-0.36787943744615203556236338044982403516769409179688), SC_(-0.99985769449598686744630754715710430111838645655608) } },{ { SC_(-0.36787943930879718479332041169982403516769409179688), SC_(-0.99989937341527312969776294577792175610005161268265) } },{ { SC_(-0.36787944024011975940879892732482403516769409179688), SC_(-0.99992884556078314715423832743355922518662235135757) } },{ { SC_(-0.36787944070578104671653818513732403516769409179688), SC_(-0.99994968586433278794146581248117772412549843583586) } },{ { SC_(-0.36787944093861169037040781404357403516769409179688), SC_(-0.99996442235919152892644019456912452486892832990114) } },{ { SC_(-0.36787944105502701219734262849669903516769409179688), SC_(-0.99997484272221444495021480907850566954322542216868) } },{ { SC_(-0.36787944111323467311081003572326153516769409179688), SC_(-0.99998221107553951227244139186618591264285119372063) } },{ { SC_(-0.36787944114233850356754373933654278516769409179688), SC_(-0.99998742131038091608107093454795869661238860012568) } },{ { SC_(-0.36787944115689041879591059114318341016769409179688), SC_(-0.99999110551424805741455916942650424910940130482916) } },{ { SC_(-0.36787944116416637641009401704650372266769409179688), SC_(-0.99999371064603396347995131962984747427523504609782) } },{ { SC_(-0.36787944116780435521718572999816387891769409179688), SC_(-0.99999555275622895023796382943893319302015254415029) } },{ { SC_(-0.36787944116962334462073158647399395704269409179688), SC_(-0.99999685532777825691586263781552103878671869687024) } },{ { SC_(-0.36787944117053283932250451471190899610519409179688), SC_(-0.99999777638786151731498560321162974199505119200634) } } + }}; + T tolerance = boost::math::tools::epsilon() * 3; + if (std::numeric_limits::digits >= std::numeric_limits::digits) + tolerance *= 5e5; + T endpoint = -boost::math::constants::exp_minus_one(); + for (unsigned i = 0; i < wolfram_test_near_singularity_data.size(); ++i) + { + if (wolfram_test_near_singularity_data[i][0] <= endpoint) + break; + else + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_near_singularity_data[i][0]), wolfram_test_near_singularity_data[i][1], tolerance); + } +} + +template <> +void wolfram_test_near_singularity() +{ + // + // Spot values near the singularity with inputs truncated to float precision, + // from http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5BROUND%5B-1%2Fe%2B2%5E-i,+2%5E-23%5D,+50%5D,+N%5BLambertW%5BROUND%5B-1%2Fe+%2B+2%5E-i,+2%5E-23%5D%5D,+50%5D%5D,+%7Bi,+2,+40%7D%5D + // + static const boost::array, 39> wolfram_test_near_singularity_data = + {{ + {{ -0.11787939071655273437500000000000000000000000000000f, -0.13490440151978599948261696847702203722148729212591f }},{{ -0.24287939071655273437500000000000000000000000000000f, -0.34187230524883404685074938529655332889057132590877f }},{{ -0.30537939071655273437500000000000000000000000000000f, -0.50704515484245965628066570100405225451296978841169f }},{{ -0.33662939071655273437500000000000000000000000000000f, -0.63562295482810970976475066480034941107064440641758f }},{{ -0.35225439071655273437500000000000000000000000000000f, -0.73357162334066102207977288738307124189083069773180f }},{{ -0.36006689071655273437500000000000000000000000000000f, -0.80685854013946199386910756662972252220827924037205f }},{{ -0.36397314071655273437500000000000000000000000000000f, -0.86091065811941702413570870801021404654934249886505f }},{{ -0.36592626571655273437500000000000000000000000000000f, -0.90033443111682454984393817004965279949925483847744f }},{{ -0.36690282821655273437500000000000000000000000000000f, -0.92884710067602836873486989954484681592392882968841f }},{{ -0.36739110946655273437500000000000000000000000000000f, -0.94933939406123900376318336910404763737960907662666f }},{{ -0.36763525009155273437500000000000000000000000000000f, -0.96399956611859464483214118051190513364901860207328f }},{{ -0.36775732040405273437500000000000000000000000000000f, -0.97445213361280651797731195324654593603807971082292f }},{{ -0.36781835556030273437500000000000000000000000000000f, -0.98188628650256330812037232517657284107351472091741f }},{{ -0.36784887313842773437500000000000000000000000000000f, -0.98716379155663346207408852364078406478772014890806f }},{{ -0.36786413192749023437500000000000000000000000000000f, -0.99090459761086986284393759319956676727684106186028f }},{{ -0.36787176132202148437500000000000000000000000000000f, -0.99355229825129408828026714426677096743753950457546f }},{{ -0.36787557601928710937500000000000000000000000000000f, -0.99542297991285328482403963994064328331346049089419f }},{{ -0.36787748336791992187500000000000000000000000000000f, -0.99674107062291256263133271694520294422529881114769f }},{{ -0.36787843704223632812500000000000000000000000000000f, -0.99766536478294767461296564658785293377699068226332f }},{{ -0.36787891387939453125000000000000000000000000000000f, -0.99830783438342654552199009076049244789994050996944f }},{{ -0.36787915229797363281250000000000000000000000000000f, -0.99874733565614076859582844941545958416543067187493f }},{{ -0.36787927150726318359375000000000000000000000000000f, -0.99903989590053869025356285499889881633845057984872f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }} + }}; + float tolerance = boost::math::tools::epsilon() * 10; + float endpoint = -boost::math::constants::exp_minus_one(); + for (unsigned i = 0; i < wolfram_test_near_singularity_data.size(); ++i) + { + if (wolfram_test_near_singularity_data[i][0] <= endpoint) + break; + else + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_near_singularity_data[i][0]), wolfram_test_near_singularity_data[i][1], tolerance); + } +} + +template <> +void wolfram_test_near_singularity() +{ + // + // Spot values near the singularity with inputs truncated to double precision, + // from http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5BROUND%5B-1%2Fe%2B2%5E-i,+2%5E-23%5D,+50%5D,+N%5BLambertW%5BROUND%5B-1%2Fe+%2B+2%5E-i,+2%5E-23%5D%5D,+50%5D%5D,+%7Bi,+2,+40%7D%5D + // + static const boost::array, 39> wolfram_test_near_singularity_data = + {{ + {{ -0.11787944117144233402427744294982403516769409179688, -0.13490446826612137099065142885543349308605449591189 }},{{ -0.24287944117144233402427744294982403516769409179688, -0.34187241316000575559631565516533717918703951393828 }},{{ -0.30537944117144233402427744294982403516769409179688, -0.50704532478540670242736394530166187052909039079642 }},{{ -0.33662944117144233402427744294982403516769409179688, -0.63562321628494791544895212508757067989859372121549 }},{{ -0.35225444117144233402427744294982403516769409179688, -0.73357201771558852140844624841371893543359405991894 }},{{ -0.36006694117144233402427744294982403516769409179688, -0.80685912552602238275976720505076149562188136941981 }},{{ -0.36397319117144233402427744294982403516769409179688, -0.86091151614390373770305184939107560322835214525382 }},{{ -0.36592631617144233402427744294982403516769409179688, -0.90033567669608907987528169545609510444951296636737 }},{{ -0.36690287867144233402427744294982403516769409179688, -0.92884889586304130900291705545970353898661233095513 }},{{ -0.36739115992144233402427744294982403516769409179688, -0.94934196763921122756108351994184213101752011076782 }},{{ -0.36763530054644233402427744294982403516769409179688, -0.96400324129495105632485735566132352543383271582526 }},{{ -0.36775737085894233402427744294982403516769409179688, -0.97445736712728703357755243595334553847237474201138 }},{{ -0.36781840601519233402427744294982403516769409179688, -0.98189372378619472154195350108189165241865132390473 }},{{ -0.36784892359331733402427744294982403516769409179688, -0.98717434434269671591894280580432721487757138768109 }},{{ -0.36786418238237983402427744294982403516769409179688, -0.99091955260257317141206161906086819616043312707614 }},{{ -0.36787181177691108402427744294982403516769409179688, -0.99357346775773151586057357459040504547191256911173 }},{{ -0.36787562647417670902427744294982403516769409179688, -0.99545290640175819861266174073519228782773422561472 }},{{ -0.36787753382280952152427744294982403516769409179688, -0.99678329264937600678258333756796350065436689760936 }},{{ -0.36787848749712592777427744294982403516769409179688, -0.99772473035978895659981485126201758865515569761514 }},{{ -0.36787896433428413089927744294982403516769409179688, -0.99839078411548014765525278348680286544429555739338 }},{{ -0.36787920275286323246177744294982403516769409179688, -0.99886193379608135520603487963907992157933985302350 }},{{ -0.36787932196215278324302744294982403516769409179688, -0.99919517626703684624524893082905669989578841060892 }},{{ -0.36787938156679755863365244294982403516769409179688, -0.99943085896775657378245957087668418410735469441835 }},{{ -0.36787941136911994632896494294982403516769409179688, -0.99959753415605033951327478977234592072050509074480 }},{{ -0.36787942627028114017662119294982403516769409179688, -0.99971540249082798050505534900918173321899800190957 }},{{ -0.36787943372086173710044931794982403516769409179688, -0.99979875358003464529770521637722571161846456343102 }},{{ -0.36787943744615203556236338044982403516769409179688, -0.99985769449598686744630754715710430111838645655608 }},{{ -0.36787943930879718479332041169982403516769409179688, -0.99989937341527312969776294577792175610005161268265 }},{{ -0.36787944024011975940879892732482403516769409179688, -0.99992884556078314715423832743355922518662235135757 }},{{ -0.36787944070578104671653818513732403516769409179688, -0.99994968586433278794146581248117772412549843583586 }},{{ -0.36787944093861169037040781404357403516769409179688, -0.99996442235919152892644019456912452486892832990114 }},{{ -0.36787944105502701219734262849669903516769409179688, -0.99997484272221444495021480907850566954322542216868 }},{{ -0.36787944111323467311081003572326153516769409179688, -0.99998221107553951227244139186618591264285119372063 }},{{ -0.36787944114233850356754373933654278516769409179688, -0.99998742131038091608107093454795869661238860012568 }},{{ -0.36787944115689041879591059114318341016769409179688, -0.99999110551424805741455916942650424910940130482916 }},{{ -0.36787944116416637641009401704650372266769409179688, -0.99999371064603396347995131962984747427523504609782 }},{{ -0.36787944116780435521718572999816387891769409179688, -0.99999555275622895023796382943893319302015254415029 }},{{ -0.36787944116962334462073158647399395704269409179688, -0.99999685532777825691586263781552103878671869687024 }},{{ -0.36787944117053283932250451471190899610519409179688, -0.99999777638786151731498560321162974199505119200634 }} + }}; + double tolerance = boost::math::tools::epsilon() * 5; + if (std::numeric_limits::digits >= std::numeric_limits::digits) + tolerance *= 1e5; + double endpoint = -boost::math::constants::exp_minus_one(); + for (unsigned i = 0; i < wolfram_test_near_singularity_data.size(); ++i) + { + if (wolfram_test_near_singularity_data[i][0] <= endpoint) + break; + else + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_near_singularity_data[i][0]), wolfram_test_near_singularity_data[i][1], tolerance); + } +} + template void test_spots(RealType) { @@ -201,6 +278,8 @@ void test_spots(RealType) std::cout.setf(std::ios_base::showpoint); // show trailing significant zeros. std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl; + wolfram_test_near_singularity(); + // Test at singularity. // RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527); RealType singular_value = -exp_minus_one(); @@ -952,4 +1031,3 @@ BOOST_AUTO_TEST_CASE( test_range_of_double_values ) } } // BOOST_AUTO_TEST_CASE(test_range_of_double_values) - From 460e50a1fc55631eb30ad33371fd3a93d667aee2 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Mon, 27 Aug 2018 19:48:59 +0100 Subject: [PATCH 60/71] LambertW: Add test data for very large values. --- test/test_lambert_w.cpp | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index fc9ee04b6..e16c0930c 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -153,6 +153,34 @@ std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION << } // std::string show_versions() +template +void wolfram_test_large(const boost::mpl::true_&) +{ + // + // Spots near the singularity from http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5B-1%2Fe%2B2%5E-i,+50%5D,+N%5BLambertW%5B-1%2Fe+%2B+2%5E-i%5D,+50%5D%5D,+%7Bi,+2,+40%7D%5D + // + static const boost::array::type, 2>, 39> wolfram_test_large_data = + { { + {{ SC_(3.1415926535897932384626433832795028841971693993751e350), SC_(800.36444525326526998205084284403447902093784176640) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e400), SC_(915.35945025352715923124904626896745356022974283730) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e450), SC_(1030.3703481552571717312484086444052442055003737018) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e500), SC_(1145.3937726197879355969554296951287620979399652268) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e550), SC_(1260.4273249433458391941776841900870933799293511610) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e600), SC_(1375.4692354682341092954911299903937009237749971748) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e650), SC_(1490.5181612342761763990969379122584268166707632003) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e700), SC_(1605.5730589637597079362569020729894833435943718597) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e750), SC_(1720.6331020467166402802313799793443913873949058922) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e800), SC_(1835.6976244160526737141293452999638879204852786698) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e850), SC_(1950.7660814940759743605616247252782614446819652848) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e900), SC_(2065.8380223354646200773160641407055989098916114637) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e950), SC_(2180.9130693229593212006354812037286740424563145700) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e1000), SC_(2295.9909030845346718801238821248991904602625884450) }} + } }; + T tolerance = boost::math::tools::epsilon() * 3; + if (std::numeric_limits::digits10 > 40) + tolerance *= 3; // arbitrary precision types have lower accuracy on exp(z). + for (unsigned i = 0; i < wolfram_test_large_data.size(); ++i) + { + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_large_data[i][0]), wolfram_test_large_data[i][1], tolerance); + } +} +template +void wolfram_test_large(const boost::mpl::false_&){} + +template +void wolfram_test_large() +{ + wolfram_test_large(boost::mpl::bool_<(std::numeric_limits::max_exponent10 > 1000)>()); +} + + template void wolfram_test_near_singularity() { @@ -279,6 +307,7 @@ void test_spots(RealType) std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl; wolfram_test_near_singularity(); + wolfram_test_large(); // Test at singularity. // RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527); From 50c014abdca3fe771f6ed9eef6884732116184c7 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Tue, 28 Aug 2018 17:23:02 +0100 Subject: [PATCH 61/71] LambertW: further improvements to code coverage. --- test/test_lambert_w.cpp | 63 ++++++++++++++++++++++++++++++++++++++++- 1 file changed, 62 insertions(+), 1 deletion(-) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index e16c0930c..02b13e4dc 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -153,13 +153,71 @@ std::cout << "MINGW64 " << __MINGW32_MAJOR_VERSION << __MINGW32_MINOR_VERSION << } // std::string show_versions() +template +void wolfram_test_moderate_values() +{ + // + // Spots of moderate value http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5B-1%2Fe%2Bi,+50%5D,+N%5BLambertW%5B-1%2Fe%2Bi%5D,+50%5D%5D,+%7Bi,+1%2F8,+6,+1%2F8%7D%5D + // + static const boost::array::type, 2>, 96/2> wolfram_test_small_neg = + {{ + {{ SC_(-0.24287944117144232159552377016146086744581113103177), SC_(-0.34187241316000572901412382650748493957063539755395) }},{{ SC_(-0.11787944117144232159552377016146086744581113103177), SC_(-0.13490446826612135454875992607636577833255418182633) }},{{ SC_(0.0071205588285576784044762298385391325541888689682322), SC_(0.0070703912528860797819274709355398032954165697080076) }},{{ SC_(0.13212055882855767840447622983853913255418886896823), SC_(0.11747650174894814471295063763686399700941650918302) }},{{ SC_(0.25712055882855767840447622983853913255418886896823), SC_(0.20869089404810562424547046857454995304964242368484) }},{{ SC_(0.38212055882855767840447622983853913255418886896823), SC_(0.28683366713002653952708635029764106993377156175310) }},{{ SC_(0.50712055882855767840447622983853913255418886896823), SC_(0.35542749308004931507852679571061486656821523044053) }},{{ SC_(0.63212055882855767840447622983853913255418886896823), SC_(0.41670399881776590750659327292575356285757792776250) }},{{ SC_(0.75712055882855767840447622983853913255418886896823), SC_(0.47217430075943420437939326812963066971059146681283) }},{{ SC_(0.88212055882855767840447622983853913255418886896823), SC_(0.52291321715862065064992942239384690347359852107504) }},{{ SC_(1.0071205588285576784044762298385391325541888689682), SC_(0.56971477154593975582335630229323210831843899740884) }},{{ SC_(1.1321205588285576784044762298385391325541888689682), SC_(0.61318350578224462394572352964726524514921241969798) }},{{ SC_(1.2571205588285576784044762298385391325541888689682), SC_(0.65379115237566259933564436658873734121781110980034) }},{{ SC_(1.3821205588285576784044762298385391325541888689682), SC_(0.69191341320406026236753559968630177636780741203666) }},{{ SC_(1.5071205588285576784044762298385391325541888689682), SC_(0.72785472286747598788295903283683432537852776142064) }},{{ SC_(1.6321205588285576784044762298385391325541888689682), SC_(0.76186544538805130363636977458614856100481979440639) }},{{ SC_(1.7571205588285576784044762298385391325541888689682), SC_(0.79415413501531119849043049331889268136479923750037) }},{{ SC_(1.8821205588285576784044762298385391325541888689682), SC_(0.82489647878345700122288701550494847447982817483512) }},{{ SC_(2.0071205588285576784044762298385391325541888689682), SC_(0.85424194939386899439722948096520865643710851410970) }},{{ SC_(2.1321205588285576784044762298385391325541888689682), SC_(0.88231884173371311472940735780441644004275449741412) }},{{ SC_(2.2571205588285576784044762298385391325541888689682), SC_(0.90923814516532488963517314558961057510689871415824) }},{{ SC_(2.3821205588285576784044762298385391325541888689682), SC_(0.93509656212104191797135657485515114635876341802516) }},{{ SC_(2.5071205588285576784044762298385391325541888689682), SC_(0.95997889061117906067636869169049106690165665554172) }},{{ SC_(2.6321205588285576784044762298385391325541888689682), SC_(0.98395992590529701946948066548039809917492328184099) }},{{ SC_(2.7571205588285576784044762298385391325541888689682), SC_(1.0071059939771381126732041109492705496242899774655) }},{{ SC_(2.8821205588285576784044762298385391325541888689682), SC_(1.0294761995723706229651673877352399077168142413723) }},{{ SC_(3.0071205588285576784044762298385391325541888689682), SC_(1.0511234507020167125769191146012321442040919222298) }},{{ SC_(3.1321205588285576784044762298385391325541888689682), SC_(1.0720953062286332723365148290552887215464891915069) }},{{ SC_(3.2571205588285576784044762298385391325541888689682), SC_(1.0924346821831089228990349517861599064007594751702) }},{{ SC_(3.3821205588285576784044762298385391325541888689682), SC_(1.1121804443118533629930276674418322662764569673766) }},{{ SC_(3.5071205588285576784044762298385391325541888689682), SC_(1.1313679082795201044696522785560810652358663683706) }},{{ SC_(3.6321205588285576784044762298385391325541888689682), SC_(1.1500292643692387775614691790201052907317404963905) }},{{ SC_(3.7571205588285576784044762298385391325541888689682), SC_(1.1681939400299161555212785901786587344721733034978) }},{{ SC_(3.8821205588285576784044762298385391325541888689682), SC_(1.1858889109341735194685896928615740804115521714257) }},{{ SC_(4.0071205588285576784044762298385391325541888689682), SC_(1.2031389691267953962289622785796365085402661808452) }},{{ SC_(4.1321205588285576784044762298385391325541888689682), SC_(1.2199669552139996161903252772502362264684476580522) }},{{ SC_(4.2571205588285576784044762298385391325541888689682), SC_(1.2363939602597347325278067608637615539794532870296) }},{{ SC_(4.3821205588285576784044762298385391325541888689682), SC_(1.2524395020361026107226019920575290018966524482736) }},{{ SC_(4.5071205588285576784044762298385391325541888689682), SC_(1.2681216794607666389159742215265331040507889789444) }},{{ SC_(4.6321205588285576784044762298385391325541888689682), SC_(1.2834573083995295018572263393035905604511320189369) }},{{ SC_(4.7571205588285576784044762298385391325541888689682), SC_(1.2984620414827281167361144981111712803667945033184) }},{{ SC_(4.8821205588285576784044762298385391325541888689682), SC_(1.3131504741533499076663954559108617687274731330916) }},{{ SC_(5.0071205588285576784044762298385391325541888689682), SC_(1.3275362388125116267199919229657120782894307415376) }},{{ SC_(5.1321205588285576784044762298385391325541888689682), SC_(1.3416320886383928057123774168081846145768561516693) }},{{ SC_(5.2571205588285576784044762298385391325541888689682), SC_(1.3554499724155634924134183248962114419200302481356) }},{{ SC_(5.3821205588285576784044762298385391325541888689682), SC_(1.3690011015132087699425938733927188719869603184010) }},{{ SC_(5.5071205588285576784044762298385391325541888689682), SC_(1.3822960099853765706075495327819109601506356054327) }},{{ SC_(5.6321205588285576784044762298385391325541888689682), SC_(1.3953446086279755263512146907828727538440007615239) }} + }}; + T tolerance = boost::math::tools::epsilon() * 3; + if (std::numeric_limits::digits10 > 40) + tolerance *= 4; // arbitrary precision types have lower accuracy on exp(z). + for (unsigned i = 0; i < wolfram_test_small_neg.size(); ++i) + { + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_small_neg[i][0]), wolfram_test_small_neg[i][1], tolerance); + } +} + +template +void wolfram_test_small_pos() +{ + // + // Spots near zero and positive http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5BPi+*+10%5Ei,+50%5D,+N%5BLambertW%5BPi+*+10%5Ei%5D,+50%5D%5D,+%7Bi,+-25,+-1%7D%5D + // + static const boost::array::type, 2>, 25> wolfram_test_small_neg = + {{ + {{ SC_(3.1415926535897932384626433832795028841971693993751e-25), SC_(3.1415926535897932384626423963190627752613075159265e-25) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-24), SC_(3.1415926535897932384626335136751017948385505649306e-24) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-23), SC_(3.1415926535897932384625446872354919906109810591160e-23) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-22), SC_(3.1415926535897932384616564228393939483352864153693e-22) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-21), SC_(3.1415926535897932384527737788784135255783814177903e-21) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-20), SC_(3.1415926535897932383639473392686092980134754308784e-20) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-19), SC_(3.1415926535897932374756829431705670227788144495920e-19) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-18), SC_(3.1415926535897932285930389821901443118720934199487e-18) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-17), SC_(3.1415926535897931397665993723859213467937614455864e-17) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-16), SC_(3.1415926535897922515022032743441060948982739088029e-16) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-15), SC_(3.1415926535897833688582422939673934647266189937296e-15) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-14), SC_(3.1415926535896945424186324943442560413318839066091e-14) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-13), SC_(3.1415926535888062780225349125117696393347268403158e-13) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-12), SC_(3.1415926535799236340616005340756885831699803736331e-12) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-11), SC_(3.1415926534910971944564007385929431896486546006413e-11) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-10), SC_(3.1415926526028327988188016713407935109104110982749e-10) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-9), SC_(3.1415926437201888838826995251371676507148394412103e-9) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-8), SC_(3.1415925548937538785102994823474670579278874210259e-8) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-7), SC_(3.1415916666298182234172285804275105377159084331529e-7) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e-6), SC_(3.1415827840319013043684920305205420694740106954961e-6) }},{{ SC_(0.000031415926535897932384626433832795028841971693993751), SC_(0.000031414939621964641052828244109272729597989570861172) }},{{ SC_(0.00031415926535897932384626433832795028841971693993751), SC_(0.00031406061579842362125003023838529350597159230209458) }},{{ SC_(0.0031415926535897932384626433832795028841971693993751), SC_(0.0031317693004296877733926356188004473035977501714541) }},{{ SC_(0.031415926535897932384626433832795028841971693993751), SC_(0.030473027596269883517196555192955092247613270959259) }},{{ SC_(0.31415926535897932384626433832795028841971693993751), SC_(0.24571751376320572448656753973370462139374436325987) }} + }}; + T tolerance = boost::math::tools::epsilon() * 3; + if (std::numeric_limits::digits10 > 40) + tolerance *= 3; // arbitrary precision types have lower accuracy on exp(z). + for (unsigned i = 0; i < wolfram_test_small_neg.size(); ++i) + { + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_small_neg[i][0]), wolfram_test_small_neg[i][1], tolerance); + } +} + +template +void wolfram_test_small_neg() +{ + // + // Spots near zero and negative http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5B-Pi+*+10%5Ei,+50%5D,+N%5BLambertW%5B-Pi+*+10%5Ei%5D,+50%5D%5D,+%7Bi,+-25,+-1%7D%5D + // + static const boost::array::type, 2>, 70/2> wolfram_test_small_neg = + {{ + {{ SC_(-3.1415926535897932384626433832795028841971693993751e-25), SC_(-3.1415926535897932384626443702399429931330312828247e-25) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-24), SC_(-3.1415926535897932384626532528839039735557882339126e-24) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-23), SC_(-3.1415926535897932384627420793235137777833577489360e-23) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-22), SC_(-3.1415926535897932384636303437196118200590533135692e-22) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-21), SC_(-3.1415926535897932384725129876805922428160503997900e-21) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-20), SC_(-3.1415926535897932385613394272903964703901652508759e-20) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-19), SC_(-3.1415926535897932394496038233884387465457126495672e-19) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-18), SC_(-3.1415926535897932483322477843688615495410754197010e-18) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-17), SC_(-3.1415926535897933371586873941730937234835814431099e-17) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-16), SC_(-3.1415926535897942254230834922158298617964738845526e-16) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-15), SC_(-3.1415926535898031080670444726846311337086192655470e-15) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-14), SC_(-3.1415926535898919345066542815166327311524009447840e-14) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-13), SC_(-3.1415926535907801989027527842355365380542172227242e-13) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-12), SC_(-3.1415926535996628428637792513133580846848848572500e-12) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-11), SC_(-3.1415926536884892824781879109701525247983589696795e-11) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-10), SC_(-3.1415926545767536790366733956272068630669876574730e-10) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-9), SC_(-3.1415926634593976860614172823213018318134944055260e-9) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-8), SC_(-3.1415927522858419002979913741894684038594384671969e-8) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-7), SC_(-3.1415936405506984418084674995072645049396296346958e-7) }},{{ SC_(-3.1415926535897932384626433832795028841971693993751e-6), SC_(-3.1416025232407040026008819016148803316716797067967e-6) }},{{ SC_(-0.000031415926535897932384626433832795028841971693993751), SC_(-0.000031416913542850054076094590477471913042739704497976) }},{{ SC_(-0.00031415926535897932384626433832795028841971693993751), SC_(-0.00031425800793839694440655801311183879569843264709852) }},{{ SC_(-0.0031415926535897932384626433832795028841971693993751), SC_(-0.0031515090287677856656576839914749012339811781712486) }},{{ SC_(-0.031415926535897932384626433832795028841971693993751), SC_(-0.032452164493239992272463616095775075564894751832128) }},{{ SC_(-0.31415926535897932384626433832795028841971693993751), SC_(-0.53804834513759287053587977755877044660611017981968) }}, + {{ SC_(-0.090099009900990099009900990099009900990099009900990), SC_(-0.099527797075226962190621767732039397602197803169897)}},{{ SC_(-0.080198019801980198019801980198019801980198019801980), SC_(-0.087534530933383521242151071722737877728489741787814) }},{{ SC_(-0.070297029702970297029702970297029702970297029702970), SC_(-0.075835379000403488962496062196568904002201151736290) }},{{ SC_(-0.060396039603960396039603960396039603960396039603960), SC_(-0.064414449758822413858363348099340678962612835311800) }},{{ SC_(-0.050495049504950495049504950495049504950495049504950), SC_(-0.053257171600878093079366736202964706966166164696873) }},{{ SC_(-0.040594059405940594059405940594059405940594059405941), SC_(-0.042350146588050412657332988380168720859403591863698) }},{{ SC_(-0.030693069306930693069306930693069306930693069306931), SC_(-0.031681024260949098136757222042165581145138786336298) }},{{ SC_(-0.020792079207920792079207920792079207920792079207921), SC_(-0.021238392251213645736199359110665662967213312773617) }},{{ SC_(-0.010891089108910891089108910891089108910891089108911), SC_(-0.011011681049909946810068329378571761407667575030714) }},{{ SC_(-0.00099009900990099009900990099009900990099009900990099), SC_(-0.00099108076440319890968631186785975507712384928918616) }} + }}; + T tolerance = boost::math::tools::epsilon() * 3; + if (std::numeric_limits::digits10 > 40) + tolerance *= 3; // arbitrary precision types have lower accuracy on exp(z). + for (unsigned i = 0; i < wolfram_test_small_neg.size(); ++i) + { + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_small_neg[i][0]), wolfram_test_small_neg[i][1], tolerance); + } +} + template void wolfram_test_large(const boost::mpl::true_&) { // // Spots near the singularity from http://www.wolframalpha.com/input/?i=TABLE%5B%5BN%5B-1%2Fe%2B2%5E-i,+50%5D,+N%5BLambertW%5B-1%2Fe+%2B+2%5E-i%5D,+50%5D%5D,+%7Bi,+2,+40%7D%5D // - static const boost::array::type, 2>, 39> wolfram_test_large_data = + static const boost::array::type, 2>, 28/2> wolfram_test_large_data = { { {{ SC_(3.1415926535897932384626433832795028841971693993751e350), SC_(800.36444525326526998205084284403447902093784176640) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e400), SC_(915.35945025352715923124904626896745356022974283730) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e450), SC_(1030.3703481552571717312484086444052442055003737018) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e500), SC_(1145.3937726197879355969554296951287620979399652268) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e550), SC_(1260.4273249433458391941776841900870933799293511610) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e600), SC_(1375.4692354682341092954911299903937009237749971748) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e650), SC_(1490.5181612342761763990969379122584268166707632003) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e700), SC_(1605.5730589637597079362569020729894833435943718597) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e750), SC_(1720.6331020467166402802313799793443913873949058922) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e800), SC_(1835.6976244160526737141293452999638879204852786698) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e850), SC_(1950.7660814940759743605616247252782614446819652848) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e900), SC_(2065.8380223354646200773160641407055989098916114637) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e950), SC_(2180.9130693229593212006354812037286740424563145700) }},{{ SC_(3.1415926535897932384626433832795028841971693993751e1000), SC_(2295.9909030845346718801238821248991904602625884450) }} } }; @@ -308,6 +366,9 @@ void test_spots(RealType) wolfram_test_near_singularity(); wolfram_test_large(); + wolfram_test_small_neg(); + wolfram_test_small_pos(); + wolfram_test_moderate_values(); // Test at singularity. // RealType test_value = BOOST_MATH_TEST_VALUE(RealType, -0.36787944117144232159552377016146086744581113103176783450783680169746149574489980335714727434591964374662732527); From 45b86cf115e6159b4236aa318188dfc481ebd4fe Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Wed, 29 Aug 2018 19:34:30 +0100 Subject: [PATCH 62/71] LambertW: Fix up GCC support. Split tests into smaller units so as not to generate over-large object files. --- .../math/special_functions/lambert_w.hpp | 47 ++- test/Jamfile.v2 | 12 +- test/test_lambert_w.cpp | 202 +++++++------ test/test_lambert_w_derivative.cpp | 124 ++++++++ test/test_lambert_w_integrals_double.cpp | 266 +++++++++++++++++ test/test_lambert_w_integrals_float.cpp | 266 +++++++++++++++++ test/test_lambert_w_integrals_float128.cpp | 269 ++++++++++++++++++ test/test_lambert_w_integrals_long_double.cpp | 266 +++++++++++++++++ test/test_lambert_w_integrals_quad.cpp | 269 ++++++++++++++++++ 9 files changed, 1615 insertions(+), 106 deletions(-) create mode 100644 test/test_lambert_w_derivative.cpp create mode 100644 test/test_lambert_w_integrals_double.cpp create mode 100644 test/test_lambert_w_integrals_float.cpp create mode 100644 test/test_lambert_w_integrals_float128.cpp create mode 100644 test/test_lambert_w_integrals_long_double.cpp create mode 100644 test/test_lambert_w_integrals_quad.cpp diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index bf2731dad..7e2a8afc4 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -162,6 +162,20 @@ T maybe_reduce_to_double(const T& z, const mpl::false_&) return z; } +template +inline +double must_reduce_to_double(const T& z, const mpl::true_&) +{ + return static_cast(z); // Reduce to double precision. +} + +template +inline +double must_reduce_to_double(const T& z, const mpl::false_&) +{ // try a lexical_cast and hope for the best: + return boost::lexical_cast(z); +} + //! \brief Schroeder method, fifth-order update formula, //! \details See T. Fukushima page 80-81, and //! A. Householder, The Numerical Treatment of a Single Nonlinear Equation, @@ -173,7 +187,7 @@ T maybe_reduce_to_double(const T& z, const mpl::false_&) //! \returns Refined estimate of Lambert w. // Schroeder refinement, called unless NOT required by precision policy. -template +template inline T schroeder_update(const T w, const T y) { @@ -229,7 +243,7 @@ T schroeder_update(const T w, const T y) //! are at least 21 digits precision == max_digits10 for long double. //! Longer decimal digits strings are rationals evaluated using Wolfram. -template +template T lambert_w_singularity_series(const T p) { #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES @@ -492,10 +506,17 @@ T lambert_w0_small_z(T x, const Policy& pol) { //std::numeric_limits::max_digits10 == 36 ? 3 : // 128-bit long double. typedef boost::mpl::int_ < +#ifndef BOOST_NO_CXX11_NUMERIC_LIMITS std::numeric_limits::max_digits10 <= 9 ? 0 : // for float 32-bit. std::numeric_limits::max_digits10 <= 17 ? 1 : // for double 64-bit. std::numeric_limits::max_digits10 <= 22 ? 2 : // for 80-bit double extended. std::numeric_limits::max_digits10 < 37 ? 4 // for both 128-bit long double (3) and 128-bit quad suffix Q type (4). +#else + ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 24)) ? 0 : // for float 32-bit. + ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 53)) ? 1 : // for double 64-bit. + ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 64)) ? 2 : // for 80-bit double extended. + ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 113)) ? 4 // for both 128-bit long double (3) and 128-bit quad suffix Q type (4). +#endif : 5 // All Generic multiprecision types. > tag_type; // std::cout << "\ntag type = " << tag_type << std::endl; // error C2275: 'tag_type': illegal use of this type as an expression. @@ -953,6 +974,7 @@ T lambert_w0_approx(T z) template inline T get_near_singularity_param(T z) { + BOOST_MATH_STD_USING const T p2 = 2 * (boost::math::constants::e() * z + 1); const T p = sqrt(p2); return p; @@ -963,7 +985,7 @@ inline float get_near_singularity_param(float z) } inline double get_near_singularity_param(double z) { - return static_cast(get_near_singularity_param((long double)z)); + return static_cast(get_near_singularity_param((long double)z)); } // Forward declarations: @@ -1681,7 +1703,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) // Integral types should be promoted to double by user Lambert w functions. // If integral type provided to user function lambert_w0 or lambert_wm1, // then should already have been promoted to double. - BOOST_STATIC_ASSERT_MSG(!std::is_integral::value, + BOOST_STATIC_ASSERT_MSG(!boost::is_integral::value, "Must be floating-point or fixed type (not integer type), for example: lambert_wm1(1.), not lambert_wm1(1)!"); BOOST_MATH_STD_USING // Aid argument dependent lookup (ADL) of abs. @@ -1847,7 +1869,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) using boost::math::policies::digits2; using boost::math::policies::policy; // Compute a 50-bit precision approximate W0 in a double (no Halley refinement). - T double_approx = static_cast(lambert_wm1_imp(static_cast(z), policy >())); + T double_approx(lambert_wm1_imp(must_reduce_to_double(z, boost::is_constructible()), policy >())); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Lambert_wm1 Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl; @@ -1936,13 +1958,16 @@ T lambert_wm1_imp(const T z, const Policy& pol) // and use later Halley refinement for higher precisions. using lambert_w_lookup::halves; using lambert_w_lookup::sqrtwm1s; - lookup_t w = -static_cast(n); // Equation 25, - lookup_t y = static_cast(z * wm1es[n - 1]); // Equation 26, + + typedef typename mpl::if_c::value, lookup_t, T>::type calc_type; + + calc_type w = -static_cast(n); // Equation 25, + calc_type y = static_cast(z * wm1es[n - 1]); // Equation 26, // Perform the bisections fractional bisections for necessary precision. for (int j = 0; j < bisections; ++j) { // Equation 27. - lookup_t wj = w - halves[j]; // Subtract 1/2, 1/4, 1/8 ... - lookup_t yj = y * sqrtwm1s[j]; // Multiply by sqrt(1/e), ... + calc_type wj = w - halves[j]; // Subtract 1/2, 1/4, 1/8 ... + calc_type yj = y * sqrtwm1s[j]; // Multiply by sqrt(1/e), ... if (wj < yj) { w = wj; @@ -1994,7 +2019,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) } // lambert_w0(T z, const Policy& pol) //! Lambert W0 using default policy. - template > + template inline typename tools::promote_args::type lambert_w0(T z) @@ -2005,7 +2030,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) // Work out what precision has been selected, based on the Policy and the number type. // For the default policy version, we want the *default policy* precision for T. - typedef typename policies::precision::type precision_type; + typedef typename policies::precision >::type precision_type; // and then select the correct implementation based on that (not the type T): typedef mpl::int_< (precision_type::value == 0) || (precision_type::value > 53) ? diff --git a/test/Jamfile.v2 b/test/Jamfile.v2 index 709274e71..e22dad433 100644 --- a/test/Jamfile.v2 +++ b/test/Jamfile.v2 @@ -416,7 +416,17 @@ test-suite special_fun : [ run test_jacobi.cpp pch_light ../../test/build//boost_unit_test_framework ] [ run test_laguerre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ] - [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework ] + [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework ] + [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION=1 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] : test_lambert_w_multiprecision_1 ] + [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION=2 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] : test_lambert_w_multiprecision_2 ] + [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION=3 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] : test_lambert_w_multiprecision_3 ] + [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION=4 BOOST_MATH_TEST_FLOAT128 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] : test_lambert_w_multiprecision_4 ] + [ run test_lambert_w_integrals_float128.cpp ../../test/build//boost_unit_test_framework : : : [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : "-Bstatic -lquadmath -Bdynamic" ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] + [ run test_lambert_w_integrals_quad.cpp ../../test/build//boost_unit_test_framework : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] ] + [ run test_lambert_w_integrals_long_double.cpp ../../test/build//boost_unit_test_framework : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] + [ run test_lambert_w_integrals_double.cpp ../../test/build//boost_unit_test_framework : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] + [ run test_lambert_w_integrals_float.cpp ../../test/build//boost_unit_test_framework : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] + [ run test_lambert_w_derivative.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] ] [ run test_legendre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework : : : [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : "-Bstatic -lquadmath -Bdynamic" ] ] [ run test_ldouble_simple.cpp ../../test/build//boost_unit_test_framework ] diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 02b13e4dc..6234f6f87 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -79,7 +79,6 @@ using boost::math::lambert_w0; #include #include #include -#include #include std::string show_versions(void); @@ -298,6 +297,8 @@ void wolfram_test_near_singularity() double tolerance = boost::math::tools::epsilon() * 5; if (std::numeric_limits::digits >= std::numeric_limits::digits) tolerance *= 1e5; + else if (std::numeric_limits::digits * 2 >= std::numeric_limits::digits) + tolerance *= 5e4; double endpoint = -boost::math::constants::exp_minus_one(); for (unsigned i = 0; i < wolfram_test_near_singularity_data.size(); ++i) { @@ -358,9 +359,11 @@ void test_spots(RealType) } RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; +#ifndef BOOST_NO_CXX11_NUMERIC_LIMITS std::cout << "Precision " << std::numeric_limits::digits10 << " decimal digits, max_digits10 = " << std::numeric_limits ::max_digits10<< std::endl; // std::cout.precision(std::numeric_limits::digits10); std::cout.precision(std::numeric_limits ::max_digits10); +#endif std::cout.setf(std::ios_base::showpoint); // show trailing significant zeros. std::cout << "-exp(-1) = " << -exp_minus_one() << std::endl; @@ -765,7 +768,7 @@ void test_spots(RealType) BOOST_CHECK_THROW(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e30)), std::domain_error); // Too negative - BOOST_CHECK_THROW(lambert_wm1(-0.5), std::domain_error); + BOOST_CHECK_THROW(lambert_wm1(RealType(-0.5)), std::domain_error); // This fails for fixed_point type used for other tests because out of range? //BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e6)), @@ -796,7 +799,7 @@ BOOST_AUTO_TEST_CASE( test_types ) boost::unit_test_framework::unit_test_log.set_threshold_level(boost::unit_test_framework::log_messages); BOOST_TEST_MESSAGE("\nTest Lambert W function for several types."); BOOST_TEST_MESSAGE(show_versions()); // Full version of Boost, STL and compiler info. - +#ifndef BOOST_MATH_TEST_MULTIPRECISION // Fundamental built-in types: test_spots(0.0F); // float test_spots(0.0); // double @@ -805,12 +808,18 @@ BOOST_AUTO_TEST_CASE( test_types ) test_spots(0.0L); // long double } - #ifdef BOOST_MATH_TEST_MULTIPRECISION + #else // BOOST_MATH_TEST_MULTIPRECISION // Multiprecision types: +#if BOOST_MATH_TEST_MULTIPRECISION == 1 test_spots(static_cast(0)); +#endif +#if BOOST_MATH_TEST_MULTIPRECISION == 2 test_spots(static_cast(0)); +#endif +#if BOOST_MATH_TEST_MULTIPRECISION == 3 test_spots(static_cast(0)); - #endif // ifdef BOOST_MATH_TEST_MULTIPRECISION +#endif +#endif // ifdef BOOST_MATH_TEST_MULTIPRECISION #ifdef BOOST_MATH_TEST_FLOAT128 std::cout << "\nBOOST_MATH_TEST_FLOAT128 defined for float128 tests." << std::endl; @@ -857,8 +866,9 @@ BOOST_AUTO_TEST_CASE( test_range_of_double_values ) int epsilons = 1; RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. - std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; + std::cout << "Tolerance " << epsilons << " * epsilon == " << tolerance << std::endl; +#ifndef BOOST_MATH_TEST_MULTIPRECISION BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, 1.0e-6)), BOOST_MATH_TEST_VALUE(RealType, 9.9999900000149999733333854165586669000967020964243e-7), // Output from https://www.wolframalpha.com/input/ N[lambert_w[1e-6],50]) @@ -1020,104 +1030,108 @@ BOOST_AUTO_TEST_CASE( test_range_of_double_values ) BOOST_MATH_TEST_VALUE(RealType, -0.99999997419043196), tolerance);// diff 2.30785e-09 v 2.2204460492503131e-16 -#ifdef BOOST_MATH_TEST_MULTIPRECISION + // z increasingly close to singularity. + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36)), + BOOST_MATH_TEST_VALUE(RealType, -0.8060843159708177782855213616209920019974599683466713016), + 2 * tolerance); // -0.806084335 + + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.365)), + BOOST_MATH_TEST_VALUE(RealType, -0.8798200914159538111724840007674053239388642469453350954), + 5 * tolerance); // Note 5 * tolerance + + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.3678)), + BOOST_MATH_TEST_VALUE(RealType, -0.9793607149578284774761844434886481686055949229547379368), + 15 * tolerance); // Note 15 * tolerance when this close to singularity. + + // Just using series approximation (Fukushima switch at -0.35, but JM at 0.01 of singularity < -0.3679). + // N[productlog(-0.351), 50] = -0.72398644140937651483634596143951001600417138085814 + // N[productlog(-0.351), 55] = -0.7239864414093765148363459614395100160041713808581379727 + BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)), + BOOST_MATH_TEST_VALUE(RealType, -0.72398644140937651483634596143951001600417138085814), + 10 * tolerance); // Note was 2 * tolerance + + // Check value just not using near_singularity series approximation (and using rational polynomial instead). + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)), + BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545), + // Output from https://www.wolframalpha.com/input/ + //N[productlog(-1, -0.3), 50] = -1.7813370234216276119741702815127452608215583564545 + tolerance); + + // Using table lookup and schroeder with decreasing z to zero. + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.2)), + BOOST_MATH_TEST_VALUE(RealType, -2.5426413577735264242938061566618482901614749075294), + // N[productlog[-1, -0.2],50] -2.5426413577735264242938061566618482901614749075294 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.1)), + BOOST_MATH_TEST_VALUE(RealType, -3.5771520639572972184093919635119948804017962577931), + //N[productlog(-1, -0.1), 50] = -3.5771520639572972184093919635119948804017962577931 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.001)), + BOOST_MATH_TEST_VALUE(RealType, -9.1180064704027401212583371820468142742704349737639), + // N[productlog(-1, -0.001), 50] = -9.1180064704027401212583371820468142742704349737639 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.000001)), + BOOST_MATH_TEST_VALUE(RealType, -16.626508901372473387706432163984684996461726803805), + // N[productlog(-1, -0.000001), 50] = -16.626508901372473387706432163984684996461726803805 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-6)), + BOOST_MATH_TEST_VALUE(RealType, -16.626508901372473387706432163984684996461726803805), + // N[productlog(-1, -10 ^ -6), 50] = -16.626508901372473387706432163984684996461726803805 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.0e-26)), + BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868), + // Output from https://www.wolframalpha.com/input/ + // N[productlog(-1, -1 * 10^-26 ), 50] = -64.026509628385889681156090340691637712441162092868 + tolerance); + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2e-26)), + BOOST_MATH_TEST_VALUE(RealType, -63.322302839923597803393585145387854867226970485197), + // N[productlog[-1, -2*10^-26],50] = -63.322302839923597803393585145387854867226970485197 + tolerance * 2); + + // Smaller than lookup table, so must use approx and Halley refinements. + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-30)), + BOOST_MATH_TEST_VALUE(RealType, -73.373110313822976797067478758120874529181611813766), + // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 + tolerance); + + // std::numeric_limits::min +#ifndef BOOST_NO_CXX11_NUMERIC_LIMITS + std::cout.precision(std::numeric_limits::max_digits10); +#endif + std::cout << "(std::numeric_limits::min)() " << (std::numeric_limits::min)() << std::endl; + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2.2250738585072014e-308)), + BOOST_MATH_TEST_VALUE(RealType, -714.96865723796647086868547560654825435542227693935), + // N[productlog[-1, -2.2250738585072014e-308],50] = -714.96865723796647086868547560654825435542227693935 + tolerance); + + // For z = 0, W = -infinity + if (std::numeric_limits::has_infinity) + { + BOOST_CHECK_EQUAL(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, 0.)), + -std::numeric_limits::infinity()); + } + +#elif BOOST_MATH_TEST_MULTIPRECISION == 2 + // Comparison with Wolfram N[productlog(0,-0.36787944117144228 ), 17] // Using conversion from double to higher precision cpp_bin_float_quad using boost::multiprecision::cpp_bin_float_quad; BOOST_CHECK_CLOSE_FRACTION( // Check float_next(-exp(-1) ) lambert_w0(BOOST_MATH_TEST_VALUE(cpp_bin_float_quad, -0.36787944117144228)), - BOOST_MATH_TEST_VALUE(RealType, -0.99999998496215738), + BOOST_MATH_TEST_VALUE(cpp_bin_float_quad, -0.99999998496215738), tolerance); // OK BOOST_CHECK_CLOSE_FRACTION( // Check float_next(float_next(-exp(-1) )) lambert_w0(BOOST_MATH_TEST_VALUE(cpp_bin_float_quad, -0.36787944117144222)), - BOOST_MATH_TEST_VALUE(RealType, -0.99999997649828679), + BOOST_MATH_TEST_VALUE(cpp_bin_float_quad, -0.99999997649828679), tolerance);// OK #endif - // z increasingly close to singularity. - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.36)), - BOOST_MATH_TEST_VALUE(RealType, -0.8060843159708177782855213616209920019974599683466713016), - 2 * tolerance); // -0.806084335 - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.365)), - BOOST_MATH_TEST_VALUE(RealType, -0.8798200914159538111724840007674053239388642469453350954), - 5 * tolerance); // Note 5 * tolerance - - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.3678)), - BOOST_MATH_TEST_VALUE(RealType, -0.9793607149578284774761844434886481686055949229547379368), - 15 * tolerance); // Note 15 * tolerance when this close to singularity. - - // Just using series approximation (Fukushima switch at -0.35, but JM at 0.01 of singularity < -0.3679). - // N[productlog(-0.351), 50] = -0.72398644140937651483634596143951001600417138085814 - // N[productlog(-0.351), 55] = -0.7239864414093765148363459614395100160041713808581379727 - BOOST_CHECK_CLOSE_FRACTION(lambert_w0(BOOST_MATH_TEST_VALUE(RealType, -0.351)), - BOOST_MATH_TEST_VALUE(RealType, -0.72398644140937651483634596143951001600417138085814), - 10 * tolerance); // Note was 2 * tolerance - - // Check value just not using near_singularity series approximation (and using rational polynomial instead). - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.3)), - BOOST_MATH_TEST_VALUE(RealType, -1.7813370234216276119741702815127452608215583564545), - // Output from https://www.wolframalpha.com/input/ - //N[productlog(-1, -0.3), 50] = -1.7813370234216276119741702815127452608215583564545 - tolerance); - - // Using table lookup and schroeder with decreasing z to zero. - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.2)), - BOOST_MATH_TEST_VALUE(RealType, -2.5426413577735264242938061566618482901614749075294), - // N[productlog[-1, -0.2],50] -2.5426413577735264242938061566618482901614749075294 - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.1)), - BOOST_MATH_TEST_VALUE(RealType, -3.5771520639572972184093919635119948804017962577931), - //N[productlog(-1, -0.1), 50] = -3.5771520639572972184093919635119948804017962577931 - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.001)), - BOOST_MATH_TEST_VALUE(RealType, -9.1180064704027401212583371820468142742704349737639), - // N[productlog(-1, -0.001), 50] = -9.1180064704027401212583371820468142742704349737639 - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -0.000001)), - BOOST_MATH_TEST_VALUE(RealType, -16.626508901372473387706432163984684996461726803805), - // N[productlog(-1, -0.000001), 50] = -16.626508901372473387706432163984684996461726803805 - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-6)), - BOOST_MATH_TEST_VALUE(RealType, -16.626508901372473387706432163984684996461726803805), - // N[productlog(-1, -10 ^ -6), 50] = -16.626508901372473387706432163984684996461726803805 - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1.0e-26)), - BOOST_MATH_TEST_VALUE(RealType, -64.026509628385889681156090340691637712441162092868), - // Output from https://www.wolframalpha.com/input/ - // N[productlog(-1, -1 * 10^-26 ), 50] = -64.026509628385889681156090340691637712441162092868 - tolerance); - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2e-26)), - BOOST_MATH_TEST_VALUE(RealType, -63.322302839923597803393585145387854867226970485197), - // N[productlog[-1, -2*10^-26],50] = -63.322302839923597803393585145387854867226970485197 - tolerance *2); - - // Smaller than lookup table, so must use approx and Halley refinements. - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -1e-30)), - BOOST_MATH_TEST_VALUE(RealType, -73.373110313822976797067478758120874529181611813766), - // N[productlog(-1, -10 ^ -30), 50] = -73.373110313822976797067478758120874529181611813766 - tolerance); - - // std::numeric_limits::min - std::cout.precision(std::numeric_limits::max_digits10); - std::cout << "(std::numeric_limits::min)() " << (std::numeric_limits::min)() << std::endl; - - BOOST_CHECK_CLOSE_FRACTION(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, -2.2250738585072014e-308)), - BOOST_MATH_TEST_VALUE(RealType, -714.96865723796647086868547560654825435542227693935), - // N[productlog[-1, -2.2250738585072014e-308],50] = -714.96865723796647086868547560654825435542227693935 - tolerance); - - // For z = 0, W = -infinity - if (std::numeric_limits::has_infinity) - { - BOOST_CHECK_EQUAL(lambert_wm1(BOOST_MATH_TEST_VALUE(RealType, 0.)), - -std::numeric_limits::infinity()); - } } // BOOST_AUTO_TEST_CASE(test_range_of_double_values) diff --git a/test/test_lambert_w_derivative.cpp b/test/test_lambert_w_derivative.cpp new file mode 100644 index 000000000..aa8946efb --- /dev/null +++ b/test/test_lambert_w_derivative.cpp @@ -0,0 +1,124 @@ +// Copyright Paul A. Bristow 2016, 2017, 2018. +// Copyright John Maddock 2016. + +// 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) + +// test_lambert_w.cpp +//! \brief Basic sanity tests for Lambert W derivative. + +#ifdef BOOST_MATH_TEST_FLOAT128 +#include // For float_64_t, float128_t. Must be first include! +#endif // #ifdef #ifdef BOOST_MATH_TEST_FLOAT128 +// Needs gnu++17 for BOOST_HAS_FLOAT128 +#include // for BOOST_MSVC definition etc. +#include // for BOOST_MSVC versions. + +// Boost macros +#define BOOST_TEST_MAIN +#define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. +#include // Boost.Test +// #include // Boost.Test +#include + +#include +#include +#include + +#ifdef BOOST_MATH_TEST_MULTIPRECISION +#include // boost::multiprecision::cpp_dec_float_50 +using boost::multiprecision::cpp_dec_float_50; + +#include +using boost::multiprecision::cpp_bin_float_quad; + +#ifdef BOOST_MATH_TEST_FLOAT128 + +#ifdef BOOST_HAS_FLOAT128 +// Including this header below without float128 triggers: +// fatal error C1189: #error: "Sorry compiler is neither GCC, not Intel, don't know how to configure this header." +#include +using boost::multiprecision::float128; +#endif // ifdef BOOST_HAS_FLOAT128 +#endif // #ifdef #ifdef BOOST_MATH_TEST_FLOAT128 + +#endif // #ifdef BOOST_MATH_TEST_MULTIPRECISION + +//#include // If available. + +#include // for real_concept tests. +#include // isnan, ifinite. +#include // float_next, float_prior +using boost::math::float_next; +using boost::math::float_prior; +#include // ulp + +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include +using boost::math::policies::digits2; +using boost::math::policies::digits10; +#include // For Lambert W lambert_w function. +using boost::math::lambert_wm1; +using boost::math::lambert_w0; + +#include +#include +#include +#include +#include + +std::string show_versions(void); + +BOOST_AUTO_TEST_CASE( Derivatives_of_lambert_w ) +{ + std::cout << "Macro BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined." << std::endl; + BOOST_TEST_MESSAGE("\nTest Lambert W function 1st differentials."); + + using boost::math::constants::exp_minus_one; + using boost::math::lambert_w0_prime; + using boost::math::lambert_wm1_prime; + + // Derivatives + // https://www.wolframalpha.com/input/?i=derivative+of+productlog(0,+x) + // d/dx(W_0(x)) = W(x)/(x W(x) + x) + // https://www.wolframalpha.com/input/?i=derivative+of+productlog(-1,+x) + // d/dx(W_(-1)(x)) = (W_(-1)(x))/(x W_(-1)(x) + x) + + // 55 decimal digit values added to allow future testing using multiprecision. + + typedef double RealType; + + int epsilons = 1; + RealType tolerance = boost::math::tools::epsilon() * epsilons; // 2 eps as a fraction. + + // derivative of productlog(-1, x) at x = -0.1 == -13.8803 + // (derivative of productlog(-1, x) ) at x = N[-0.1, 55] - but the result disappears! + // (derivative of N[productlog(-1, x), 55] ) at x = N[-0.1, 55] + + // W0 branch + BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)), + // BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218355), + BOOST_MATH_TEST_VALUE(RealType, 1.7491967609218358355273514903396335693828167746571404), + tolerance); // 1.7491967609218358355273514903396335693828167746571404 + + BOOST_CHECK_CLOSE_FRACTION(lambert_w0_prime(BOOST_MATH_TEST_VALUE(RealType, 10.)), + BOOST_MATH_TEST_VALUE(RealType, 0.063577133469345105142021311010780887641928338458371618), + tolerance); + +// W-1 branch + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.1)), + BOOST_MATH_TEST_VALUE(RealType, -13.880252213229780748699361486619519025203815492277715), + tolerance); + // Lambert W_prime -13.880252213229780748699361486619519025203815492277715, double -13.880252213229781 + + BOOST_CHECK_CLOSE_FRACTION(lambert_wm1_prime(BOOST_MATH_TEST_VALUE(RealType, -0.2)), + BOOST_MATH_TEST_VALUE(RealType, -8.2411940564179044961885598641955579728547896392013239), + tolerance); + // Lambert W_prime -8.2411940564179044961885598641955579728547896392013239, double -8.2411940564179051 + + // Lambert W_prime 0.063577133469345105142021311010780887641928338458371618, double 0.063577133469345098 +}; // BOOST_AUTO_TEST_CASE("Derivatives of lambert_w") + + diff --git a/test/test_lambert_w_integrals_double.cpp b/test/test_lambert_w_integrals_double.cpp new file mode 100644 index 000000000..c286d4b94 --- /dev/null +++ b/test/test_lambert_w_integrals_double.cpp @@ -0,0 +1,266 @@ +// Copyright Paul A. Bristow 2016, 2017, 2018. +// Copyright John Maddock 2016. + +// 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) + +// test_lambert_w_integrals.cpp +//! \brief quadrature tests that cover the whole range of the Lambert W0 function. + +#include // for BOOST_MSVC definition etc. +#include // for BOOST_MSVC versions. + +// Boost macros +#define BOOST_TEST_MAIN +#define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. +#include // Boost.Test +// #include // Boost.Test +#include + +#include +#include +#include +#include // isnan, ifinite. +#include // float_next, float_prior +using boost::math::float_next; +using boost::math::float_prior; +#include // ulp + +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include +using boost::math::policies::digits2; +using boost::math::policies::digits10; +#include // For Lambert W lambert_w function. +using boost::math::lambert_wm1; +using boost::math::lambert_w0; + +#include +#include +#include +#include +#include +#include + +std::string show_versions(void); + +// Added code and test for Integral of the Lambert W function: by Nick Thompson. +// https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals + +#include // for integral tests. +#include // for integral tests. +#include // for integral tests. + + using boost::math::policies::policy; + using boost::math::policies::make_policy; + +// using statements needed for changing error handling policy. +using boost::math::policies::evaluation_error; +using boost::math::policies::domain_error; +using boost::math::policies::overflow_error; +using boost::math::policies::ignore_error; +using boost::math::policies::throw_on_error; + +typedef policy< + domain_error, + overflow_error +> no_throw_policy; + +// Assumes that function has a throw policy, for example: +// NOT lambert_w0(1 / (x * x), no_throw_policy()); +// Error in function boost::math::quadrature::exp_sinh::integrate: +// The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. +// Please ensure your function evaluates to a finite number of its entire domain. +template +T debug_integration_proc(T x) +{ + T result; // warning C4701: potentially uninitialized local variable 'result' used + // T result = 0 ; // But result may not be assigned below? + try + { + // Assign function call to result in here... + if (x <= sqrt(boost::math::tools::min_value()) ) + { + result = 0; + } + else + { + result = lambert_w0(1 / (x * x)); + } + // result = lambert_w0(1 / (x * x), no_throw_policy()); // Bad idea, less helpful diagnostic message is: + // Error in function boost::math::quadrature::exp_sinh::integrate: + // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. + // Please ensure your function evaluates to a finite number of its entire domain. + + } // try + catch (const std::exception& e) + { + std::cout << "Exception " << e.what() << std::endl; + // set breakpoint here: + std::cout << "Unexpected exception thrown in integration code at abscissa (x): " << x << "." << std::endl; + if (!std::isfinite(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + if (std::isnan(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + } // catch + return result; +} // T debug_integration_proc(T x) + +template +void test_integrals() +{ + // Integral of the Lambert W function: + // https://en.wikipedia.org/wiki/Lambert_W_function + using boost::math::quadrature::tanh_sinh; + using boost::math::quadrature::exp_sinh; + // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html + using std::sqrt; + + std::cout << "Integration of type " << typeid(Real).name() << std::endl; + + Real tol = std::numeric_limits::epsilon(); + { // // Integrate for function lambert_W0(z); + tanh_sinh ts; + Real a = 0; + Real b = boost::math::constants::e(); + auto f = [](Real z)->Real + { + return lambert_w0(z); + }; + Real z = ts.integrate(f, a, b); // OK without any decltype(f) + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::e() - 1, tol); + } + { + // Integrate for function lambert_W0(z/(z sqrt(z)). + exp_sinh es; + auto f = [](Real z)->Real + { + return lambert_w0(z)/(z * sqrt(z)); + }; + Real z = es.integrate(f); // OK + BOOST_CHECK_CLOSE_FRACTION(z, 2 * boost::math::constants::root_two_pi(), tol); + } + { + // Integrate for function lambert_W0(1/z^2). + exp_sinh es; + //const Real sqrt_min = sqrt(boost::math::tools::min_value()); // 1.08420217e-19 fo 32-bit float. + // error C3493: 'sqrt_min' cannot be implicitly captured because no default capture mode has been specified + auto f = [](Real z)->Real + { + if (z <= sqrt(boost::math::tools::min_value()) ) + { // Too small would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0 z parameter. + return static_cast(0); + } + else + { + return lambert_w0(1 / (z * z)); // warning C4756: overflow in constant arithmetic, even though cannot happen. + } + }; + Real z = es.integrate(f); + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol); + } +} // template void test_integrals() + + +BOOST_AUTO_TEST_CASE( integrals ) +{ + std::cout << "Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined." << std::endl; + BOOST_TEST_MESSAGE("\nTest Lambert W0 integrals."); + try + { + // using statements needed to change precision policy. + using boost::math::policies::policy; + using boost::math::policies::make_policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; + using boost::math::policies::digits10; + + // using statements needed for changing error handling policy. + using boost::math::policies::evaluation_error; + using boost::math::policies::domain_error; + using boost::math::policies::overflow_error; + using boost::math::policies::ignore_error; + using boost::math::policies::throw_on_error; + + typedef policy< + domain_error, + overflow_error + > no_throw_policy; + + /* + // Experiment with better diagnostics. + typedef float Real; + + Real inf = std::numeric_limits::infinity(); + Real max = (std::numeric_limits::max)(); + std::cout.precision(std::numeric_limits::max_digits10); + //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308 + std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf + std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227 + //std::cout << lambert_w0(inf) << std::endl; // inf - will throw. + std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0 + std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324 + std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308 + + // Approximate the largest lambert_w you can get for type T? + float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max_f " << max_w_f << std::endl; // 84.2879 + Real max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max " << max_w << std::endl; // 703.227 + + std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // + std::cout << "test integral 1/z^2" << std::endl; + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "epsilon = " << std::numeric_limits::epsilon() << std::endl; // + std::cout << "sqrt(max) = " << sqrt(boost::math::tools::max_value() ) << std::endl; // sqrt(max) = 1.8446742974197924e+19 + std::cout << "sqrt(min) = " << sqrt(boost::math::tools::min_value() ) << std::endl; // sqrt(min) = 1.0842021724855044e-19 + + + +// Demo debug version. +Real tol = std::numeric_limits::epsilon(); +Real x; +{ + using boost::math::quadrature::exp_sinh; + exp_sinh es; + // Function to be integrated, lambert_w0(1/z^2). + + //auto f = [](Real z)->Real + //{ // Naive - no protection against underflow and subsequent divide by zero. + // return lambert_w0(1 / (z * z)); + //}; + // Diagnostic is: + // Error in function boost::math::lambert_w0: Expected a finite value but got inf + + auto f = [](Real z)->Real + { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things. + return debug_integration_proc(z); + }; + // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf. + + // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163. + // Unexpected exception thrown in integration code at abscissa (x): 3.478765835953569e-23. + x = es.integrate(f); + std::cout << "es.integrate(f) = " << x << std::endl; + BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol); + // root_two_pi(); + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} + diff --git a/test/test_lambert_w_integrals_float.cpp b/test/test_lambert_w_integrals_float.cpp new file mode 100644 index 000000000..c7a80a1f7 --- /dev/null +++ b/test/test_lambert_w_integrals_float.cpp @@ -0,0 +1,266 @@ +// Copyright Paul A. Bristow 2016, 2017, 2018. +// Copyright John Maddock 2016. + +// 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) + +// test_lambert_w_integrals.cpp +//! \brief quadrature tests that cover the whole range of the Lambert W0 function. + +#include // for BOOST_MSVC definition etc. +#include // for BOOST_MSVC versions. + +// Boost macros +#define BOOST_TEST_MAIN +#define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. +#include // Boost.Test +// #include // Boost.Test +#include + +#include +#include +#include +#include // isnan, ifinite. +#include // float_next, float_prior +using boost::math::float_next; +using boost::math::float_prior; +#include // ulp + +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include +using boost::math::policies::digits2; +using boost::math::policies::digits10; +#include // For Lambert W lambert_w function. +using boost::math::lambert_wm1; +using boost::math::lambert_w0; + +#include +#include +#include +#include +#include +#include + +std::string show_versions(void); + +// Added code and test for Integral of the Lambert W function: by Nick Thompson. +// https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals + +#include // for integral tests. +#include // for integral tests. +#include // for integral tests. + + using boost::math::policies::policy; + using boost::math::policies::make_policy; + +// using statements needed for changing error handling policy. +using boost::math::policies::evaluation_error; +using boost::math::policies::domain_error; +using boost::math::policies::overflow_error; +using boost::math::policies::ignore_error; +using boost::math::policies::throw_on_error; + +typedef policy< + domain_error, + overflow_error +> no_throw_policy; + +// Assumes that function has a throw policy, for example: +// NOT lambert_w0(1 / (x * x), no_throw_policy()); +// Error in function boost::math::quadrature::exp_sinh::integrate: +// The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. +// Please ensure your function evaluates to a finite number of its entire domain. +template +T debug_integration_proc(T x) +{ + T result; // warning C4701: potentially uninitialized local variable 'result' used + // T result = 0 ; // But result may not be assigned below? + try + { + // Assign function call to result in here... + if (x <= sqrt(boost::math::tools::min_value()) ) + { + result = 0; + } + else + { + result = lambert_w0(1 / (x * x)); + } + // result = lambert_w0(1 / (x * x), no_throw_policy()); // Bad idea, less helpful diagnostic message is: + // Error in function boost::math::quadrature::exp_sinh::integrate: + // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. + // Please ensure your function evaluates to a finite number of its entire domain. + + } // try + catch (const std::exception& e) + { + std::cout << "Exception " << e.what() << std::endl; + // set breakpoint here: + std::cout << "Unexpected exception thrown in integration code at abscissa (x): " << x << "." << std::endl; + if (!std::isfinite(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + if (std::isnan(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + } // catch + return result; +} // T debug_integration_proc(T x) + +template +void test_integrals() +{ + // Integral of the Lambert W function: + // https://en.wikipedia.org/wiki/Lambert_W_function + using boost::math::quadrature::tanh_sinh; + using boost::math::quadrature::exp_sinh; + // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html + using std::sqrt; + + std::cout << "Integration of type " << typeid(Real).name() << std::endl; + + Real tol = std::numeric_limits::epsilon(); + { // // Integrate for function lambert_W0(z); + tanh_sinh ts; + Real a = 0; + Real b = boost::math::constants::e(); + auto f = [](Real z)->Real + { + return lambert_w0(z); + }; + Real z = ts.integrate(f, a, b); // OK without any decltype(f) + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::e() - 1, tol); + } + { + // Integrate for function lambert_W0(z/(z sqrt(z)). + exp_sinh es; + auto f = [](Real z)->Real + { + return lambert_w0(z)/(z * sqrt(z)); + }; + Real z = es.integrate(f); // OK + BOOST_CHECK_CLOSE_FRACTION(z, 2 * boost::math::constants::root_two_pi(), tol); + } + { + // Integrate for function lambert_W0(1/z^2). + exp_sinh es; + //const Real sqrt_min = sqrt(boost::math::tools::min_value()); // 1.08420217e-19 fo 32-bit float. + // error C3493: 'sqrt_min' cannot be implicitly captured because no default capture mode has been specified + auto f = [](Real z)->Real + { + if (z <= sqrt(boost::math::tools::min_value()) ) + { // Too small would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0 z parameter. + return static_cast(0); + } + else + { + return lambert_w0(1 / (z * z)); // warning C4756: overflow in constant arithmetic, even though cannot happen. + } + }; + Real z = es.integrate(f); + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol); + } +} // template void test_integrals() + + +BOOST_AUTO_TEST_CASE( integrals ) +{ + std::cout << "Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined." << std::endl; + BOOST_TEST_MESSAGE("\nTest Lambert W0 integrals."); + try + { + // using statements needed to change precision policy. + using boost::math::policies::policy; + using boost::math::policies::make_policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; + using boost::math::policies::digits10; + + // using statements needed for changing error handling policy. + using boost::math::policies::evaluation_error; + using boost::math::policies::domain_error; + using boost::math::policies::overflow_error; + using boost::math::policies::ignore_error; + using boost::math::policies::throw_on_error; + + typedef policy< + domain_error, + overflow_error + > no_throw_policy; + + /* + // Experiment with better diagnostics. + typedef float Real; + + Real inf = std::numeric_limits::infinity(); + Real max = (std::numeric_limits::max)(); + std::cout.precision(std::numeric_limits::max_digits10); + //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308 + std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf + std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227 + //std::cout << lambert_w0(inf) << std::endl; // inf - will throw. + std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0 + std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324 + std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308 + + // Approximate the largest lambert_w you can get for type T? + float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max_f " << max_w_f << std::endl; // 84.2879 + Real max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max " << max_w << std::endl; // 703.227 + + std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // + std::cout << "test integral 1/z^2" << std::endl; + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "epsilon = " << std::numeric_limits::epsilon() << std::endl; // + std::cout << "sqrt(max) = " << sqrt(boost::math::tools::max_value() ) << std::endl; // sqrt(max) = 1.8446742974197924e+19 + std::cout << "sqrt(min) = " << sqrt(boost::math::tools::min_value() ) << std::endl; // sqrt(min) = 1.0842021724855044e-19 + + + +// Demo debug version. +Real tol = std::numeric_limits::epsilon(); +Real x; +{ + using boost::math::quadrature::exp_sinh; + exp_sinh es; + // Function to be integrated, lambert_w0(1/z^2). + + //auto f = [](Real z)->Real + //{ // Naive - no protection against underflow and subsequent divide by zero. + // return lambert_w0(1 / (z * z)); + //}; + // Diagnostic is: + // Error in function boost::math::lambert_w0: Expected a finite value but got inf + + auto f = [](Real z)->Real + { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things. + return debug_integration_proc(z); + }; + // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf. + + // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163. + // Unexpected exception thrown in integration code at abscissa (x): 3.478765835953569e-23. + x = es.integrate(f); + std::cout << "es.integrate(f) = " << x << std::endl; + BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol); + // root_two_pi(); + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} + diff --git a/test/test_lambert_w_integrals_float128.cpp b/test/test_lambert_w_integrals_float128.cpp new file mode 100644 index 000000000..9db4fc199 --- /dev/null +++ b/test/test_lambert_w_integrals_float128.cpp @@ -0,0 +1,269 @@ +// Copyright Paul A. Bristow 2016, 2017, 2018. +// Copyright John Maddock 2016. + +// 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) + +// test_lambert_w_integrals.cpp +//! \brief quadrature tests that cover the whole range of the Lambert W0 function. + +#include // for BOOST_MSVC definition etc. +#include // for BOOST_MSVC versions. + +// Boost macros +#define BOOST_TEST_MAIN +#define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. +#include // Boost.Test +// #include // Boost.Test +#include + +#include +#include +#include + +#include + +#include // isnan, ifinite. +#include // float_next, float_prior +using boost::math::float_next; +using boost::math::float_prior; +#include // ulp + +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include +using boost::math::policies::digits2; +using boost::math::policies::digits10; +#include // For Lambert W lambert_w function. +using boost::math::lambert_wm1; +using boost::math::lambert_w0; + +#include +#include +#include +#include +#include +#include + +std::string show_versions(void); + +// Added code and test for Integral of the Lambert W function: by Nick Thompson. +// https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals + +#include // for integral tests. +#include // for integral tests. +#include // for integral tests. + + using boost::math::policies::policy; + using boost::math::policies::make_policy; + +// using statements needed for changing error handling policy. +using boost::math::policies::evaluation_error; +using boost::math::policies::domain_error; +using boost::math::policies::overflow_error; +using boost::math::policies::ignore_error; +using boost::math::policies::throw_on_error; + +typedef policy< + domain_error, + overflow_error +> no_throw_policy; + +// Assumes that function has a throw policy, for example: +// NOT lambert_w0(1 / (x * x), no_throw_policy()); +// Error in function boost::math::quadrature::exp_sinh::integrate: +// The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. +// Please ensure your function evaluates to a finite number of its entire domain. +template +T debug_integration_proc(T x) +{ + T result; // warning C4701: potentially uninitialized local variable 'result' used + // T result = 0 ; // But result may not be assigned below? + try + { + // Assign function call to result in here... + if (x <= sqrt(boost::math::tools::min_value()) ) + { + result = 0; + } + else + { + result = lambert_w0(1 / (x * x)); + } + // result = lambert_w0(1 / (x * x), no_throw_policy()); // Bad idea, less helpful diagnostic message is: + // Error in function boost::math::quadrature::exp_sinh::integrate: + // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. + // Please ensure your function evaluates to a finite number of its entire domain. + + } // try + catch (const std::exception& e) + { + std::cout << "Exception " << e.what() << std::endl; + // set breakpoint here: + std::cout << "Unexpected exception thrown in integration code at abscissa (x): " << x << "." << std::endl; + if (!std::isfinite(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + if (std::isnan(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + } // catch + return result; +} // T debug_integration_proc(T x) + +template +void test_integrals() +{ + // Integral of the Lambert W function: + // https://en.wikipedia.org/wiki/Lambert_W_function + using boost::math::quadrature::tanh_sinh; + using boost::math::quadrature::exp_sinh; + // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html + using std::sqrt; + + std::cout << "Integration of type " << typeid(Real).name() << std::endl; + + Real tol = std::numeric_limits::epsilon(); + { // // Integrate for function lambert_W0(z); + tanh_sinh ts; + Real a = 0; + Real b = boost::math::constants::e(); + auto f = [](Real z)->Real + { + return lambert_w0(z); + }; + Real z = ts.integrate(f, a, b); // OK without any decltype(f) + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::e() - 1, tol); + } + { + // Integrate for function lambert_W0(z/(z sqrt(z)). + exp_sinh es; + auto f = [](Real z)->Real + { + return lambert_w0(z)/(z * sqrt(z)); + }; + Real z = es.integrate(f); // OK + BOOST_CHECK_CLOSE_FRACTION(z, 2 * boost::math::constants::root_two_pi(), tol); + } + { + // Integrate for function lambert_W0(1/z^2). + exp_sinh es; + //const Real sqrt_min = sqrt(boost::math::tools::min_value()); // 1.08420217e-19 fo 32-bit float. + // error C3493: 'sqrt_min' cannot be implicitly captured because no default capture mode has been specified + auto f = [](Real z)->Real + { + if (z <= sqrt(boost::math::tools::min_value()) ) + { // Too small would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0 z parameter. + return static_cast(0); + } + else + { + return lambert_w0(1 / (z * z)); // warning C4756: overflow in constant arithmetic, even though cannot happen. + } + }; + Real z = es.integrate(f); + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol); + } +} // template void test_integrals() + + +BOOST_AUTO_TEST_CASE( integrals ) +{ + std::cout << "Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined." << std::endl; + BOOST_TEST_MESSAGE("\nTest Lambert W0 integrals."); + try + { + // using statements needed to change precision policy. + using boost::math::policies::policy; + using boost::math::policies::make_policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; + using boost::math::policies::digits10; + + // using statements needed for changing error handling policy. + using boost::math::policies::evaluation_error; + using boost::math::policies::domain_error; + using boost::math::policies::overflow_error; + using boost::math::policies::ignore_error; + using boost::math::policies::throw_on_error; + + typedef policy< + domain_error, + overflow_error + > no_throw_policy; + + /* + // Experiment with better diagnostics. + typedef float Real; + + Real inf = std::numeric_limits::infinity(); + Real max = (std::numeric_limits::max)(); + std::cout.precision(std::numeric_limits::max_digits10); + //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308 + std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf + std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227 + //std::cout << lambert_w0(inf) << std::endl; // inf - will throw. + std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0 + std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324 + std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308 + + // Approximate the largest lambert_w you can get for type T? + float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max_f " << max_w_f << std::endl; // 84.2879 + Real max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max " << max_w << std::endl; // 703.227 + + std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // + std::cout << "test integral 1/z^2" << std::endl; + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "epsilon = " << std::numeric_limits::epsilon() << std::endl; // + std::cout << "sqrt(max) = " << sqrt(boost::math::tools::max_value() ) << std::endl; // sqrt(max) = 1.8446742974197924e+19 + std::cout << "sqrt(min) = " << sqrt(boost::math::tools::min_value() ) << std::endl; // sqrt(min) = 1.0842021724855044e-19 + + + +// Demo debug version. +Real tol = std::numeric_limits::epsilon(); +Real x; +{ + using boost::math::quadrature::exp_sinh; + exp_sinh es; + // Function to be integrated, lambert_w0(1/z^2). + + //auto f = [](Real z)->Real + //{ // Naive - no protection against underflow and subsequent divide by zero. + // return lambert_w0(1 / (z * z)); + //}; + // Diagnostic is: + // Error in function boost::math::lambert_w0: Expected a finite value but got inf + + auto f = [](Real z)->Real + { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things. + return debug_integration_proc(z); + }; + // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf. + + // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163. + // Unexpected exception thrown in integration code at abscissa (x): 3.478765835953569e-23. + x = es.integrate(f); + std::cout << "es.integrate(f) = " << x << std::endl; + BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol); + // root_two_pi(); + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} + diff --git a/test/test_lambert_w_integrals_long_double.cpp b/test/test_lambert_w_integrals_long_double.cpp new file mode 100644 index 000000000..180fb330f --- /dev/null +++ b/test/test_lambert_w_integrals_long_double.cpp @@ -0,0 +1,266 @@ +// Copyright Paul A. Bristow 2016, 2017, 2018. +// Copyright John Maddock 2016. + +// 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) + +// test_lambert_w_integrals.cpp +//! \brief quadrature tests that cover the whole range of the Lambert W0 function. + +#include // for BOOST_MSVC definition etc. +#include // for BOOST_MSVC versions. + +// Boost macros +#define BOOST_TEST_MAIN +#define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. +#include // Boost.Test +// #include // Boost.Test +#include + +#include +#include +#include +#include // isnan, ifinite. +#include // float_next, float_prior +using boost::math::float_next; +using boost::math::float_prior; +#include // ulp + +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include +using boost::math::policies::digits2; +using boost::math::policies::digits10; +#include // For Lambert W lambert_w function. +using boost::math::lambert_wm1; +using boost::math::lambert_w0; + +#include +#include +#include +#include +#include +#include + +std::string show_versions(void); + +// Added code and test for Integral of the Lambert W function: by Nick Thompson. +// https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals + +#include // for integral tests. +#include // for integral tests. +#include // for integral tests. + + using boost::math::policies::policy; + using boost::math::policies::make_policy; + +// using statements needed for changing error handling policy. +using boost::math::policies::evaluation_error; +using boost::math::policies::domain_error; +using boost::math::policies::overflow_error; +using boost::math::policies::ignore_error; +using boost::math::policies::throw_on_error; + +typedef policy< + domain_error, + overflow_error +> no_throw_policy; + +// Assumes that function has a throw policy, for example: +// NOT lambert_w0(1 / (x * x), no_throw_policy()); +// Error in function boost::math::quadrature::exp_sinh::integrate: +// The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. +// Please ensure your function evaluates to a finite number of its entire domain. +template +T debug_integration_proc(T x) +{ + T result; // warning C4701: potentially uninitialized local variable 'result' used + // T result = 0 ; // But result may not be assigned below? + try + { + // Assign function call to result in here... + if (x <= sqrt(boost::math::tools::min_value()) ) + { + result = 0; + } + else + { + result = lambert_w0(1 / (x * x)); + } + // result = lambert_w0(1 / (x * x), no_throw_policy()); // Bad idea, less helpful diagnostic message is: + // Error in function boost::math::quadrature::exp_sinh::integrate: + // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. + // Please ensure your function evaluates to a finite number of its entire domain. + + } // try + catch (const std::exception& e) + { + std::cout << "Exception " << e.what() << std::endl; + // set breakpoint here: + std::cout << "Unexpected exception thrown in integration code at abscissa (x): " << x << "." << std::endl; + if (!std::isfinite(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + if (std::isnan(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + } // catch + return result; +} // T debug_integration_proc(T x) + +template +void test_integrals() +{ + // Integral of the Lambert W function: + // https://en.wikipedia.org/wiki/Lambert_W_function + using boost::math::quadrature::tanh_sinh; + using boost::math::quadrature::exp_sinh; + // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html + using std::sqrt; + + std::cout << "Integration of type " << typeid(Real).name() << std::endl; + + Real tol = std::numeric_limits::epsilon(); + { // // Integrate for function lambert_W0(z); + tanh_sinh ts; + Real a = 0; + Real b = boost::math::constants::e(); + auto f = [](Real z)->Real + { + return lambert_w0(z); + }; + Real z = ts.integrate(f, a, b); // OK without any decltype(f) + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::e() - 1, tol); + } + { + // Integrate for function lambert_W0(z/(z sqrt(z)). + exp_sinh es; + auto f = [](Real z)->Real + { + return lambert_w0(z)/(z * sqrt(z)); + }; + Real z = es.integrate(f); // OK + BOOST_CHECK_CLOSE_FRACTION(z, 2 * boost::math::constants::root_two_pi(), tol); + } + { + // Integrate for function lambert_W0(1/z^2). + exp_sinh es; + //const Real sqrt_min = sqrt(boost::math::tools::min_value()); // 1.08420217e-19 fo 32-bit float. + // error C3493: 'sqrt_min' cannot be implicitly captured because no default capture mode has been specified + auto f = [](Real z)->Real + { + if (z <= sqrt(boost::math::tools::min_value()) ) + { // Too small would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0 z parameter. + return static_cast(0); + } + else + { + return lambert_w0(1 / (z * z)); // warning C4756: overflow in constant arithmetic, even though cannot happen. + } + }; + Real z = es.integrate(f); + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol); + } +} // template void test_integrals() + + +BOOST_AUTO_TEST_CASE( integrals ) +{ + std::cout << "Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined." << std::endl; + BOOST_TEST_MESSAGE("\nTest Lambert W0 integrals."); + try + { + // using statements needed to change precision policy. + using boost::math::policies::policy; + using boost::math::policies::make_policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; + using boost::math::policies::digits10; + + // using statements needed for changing error handling policy. + using boost::math::policies::evaluation_error; + using boost::math::policies::domain_error; + using boost::math::policies::overflow_error; + using boost::math::policies::ignore_error; + using boost::math::policies::throw_on_error; + + typedef policy< + domain_error, + overflow_error + > no_throw_policy; + + /* + // Experiment with better diagnostics. + typedef float Real; + + Real inf = std::numeric_limits::infinity(); + Real max = (std::numeric_limits::max)(); + std::cout.precision(std::numeric_limits::max_digits10); + //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308 + std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf + std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227 + //std::cout << lambert_w0(inf) << std::endl; // inf - will throw. + std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0 + std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324 + std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308 + + // Approximate the largest lambert_w you can get for type T? + float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max_f " << max_w_f << std::endl; // 84.2879 + Real max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max " << max_w << std::endl; // 703.227 + + std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // + std::cout << "test integral 1/z^2" << std::endl; + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "epsilon = " << std::numeric_limits::epsilon() << std::endl; // + std::cout << "sqrt(max) = " << sqrt(boost::math::tools::max_value() ) << std::endl; // sqrt(max) = 1.8446742974197924e+19 + std::cout << "sqrt(min) = " << sqrt(boost::math::tools::min_value() ) << std::endl; // sqrt(min) = 1.0842021724855044e-19 + + + +// Demo debug version. +Real tol = std::numeric_limits::epsilon(); +Real x; +{ + using boost::math::quadrature::exp_sinh; + exp_sinh es; + // Function to be integrated, lambert_w0(1/z^2). + + //auto f = [](Real z)->Real + //{ // Naive - no protection against underflow and subsequent divide by zero. + // return lambert_w0(1 / (z * z)); + //}; + // Diagnostic is: + // Error in function boost::math::lambert_w0: Expected a finite value but got inf + + auto f = [](Real z)->Real + { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things. + return debug_integration_proc(z); + }; + // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf. + + // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163. + // Unexpected exception thrown in integration code at abscissa (x): 3.478765835953569e-23. + x = es.integrate(f); + std::cout << "es.integrate(f) = " << x << std::endl; + BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol); + // root_two_pi(); + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} + diff --git a/test/test_lambert_w_integrals_quad.cpp b/test/test_lambert_w_integrals_quad.cpp new file mode 100644 index 000000000..907b43cff --- /dev/null +++ b/test/test_lambert_w_integrals_quad.cpp @@ -0,0 +1,269 @@ +// Copyright Paul A. Bristow 2016, 2017, 2018. +// Copyright John Maddock 2016. + +// 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) + +// test_lambert_w_integrals.cpp +//! \brief quadrature tests that cover the whole range of the Lambert W0 function. + +#include // for BOOST_MSVC definition etc. +#include // for BOOST_MSVC versions. + +// Boost macros +#define BOOST_TEST_MAIN +#define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. +#include // Boost.Test +// #include // Boost.Test +#include + +#include +#include +#include +#include +using boost::multiprecision::cpp_bin_float_quad; + +#include // isnan, ifinite. +#include // float_next, float_prior +using boost::math::float_next; +using boost::math::float_prior; +#include // ulp + +#include // for create_test_value and macro BOOST_MATH_TEST_VALUE. +#include +using boost::math::policies::digits2; +using boost::math::policies::digits10; +#include // For Lambert W lambert_w function. +using boost::math::lambert_wm1; +using boost::math::lambert_w0; + +#include +#include +#include +#include +#include +#include + +std::string show_versions(void); + +// Added code and test for Integral of the Lambert W function: by Nick Thompson. +// https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals + +#include // for integral tests. +#include // for integral tests. +#include // for integral tests. + + using boost::math::policies::policy; + using boost::math::policies::make_policy; + +// using statements needed for changing error handling policy. +using boost::math::policies::evaluation_error; +using boost::math::policies::domain_error; +using boost::math::policies::overflow_error; +using boost::math::policies::ignore_error; +using boost::math::policies::throw_on_error; + +typedef policy< + domain_error, + overflow_error +> no_throw_policy; + +// Assumes that function has a throw policy, for example: +// NOT lambert_w0(1 / (x * x), no_throw_policy()); +// Error in function boost::math::quadrature::exp_sinh::integrate: +// The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. +// Please ensure your function evaluates to a finite number of its entire domain. +template +T debug_integration_proc(T x) +{ + T result; // warning C4701: potentially uninitialized local variable 'result' used + // T result = 0 ; // But result may not be assigned below? + try + { + // Assign function call to result in here... + if (x <= sqrt(boost::math::tools::min_value()) ) + { + result = 0; + } + else + { + result = lambert_w0(1 / (x * x)); + } + // result = lambert_w0(1 / (x * x), no_throw_policy()); // Bad idea, less helpful diagnostic message is: + // Error in function boost::math::quadrature::exp_sinh::integrate: + // The exp_sinh quadrature evaluated your function at a singular point and resulted in inf. + // Please ensure your function evaluates to a finite number of its entire domain. + + } // try + catch (const std::exception& e) + { + std::cout << "Exception " << e.what() << std::endl; + // set breakpoint here: + std::cout << "Unexpected exception thrown in integration code at abscissa (x): " << x << "." << std::endl; + if (!std::isfinite(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + if (std::isnan(result)) + { + // set breakpoint here: + std::cout << "Unexpected non-finite result in integration code at abscissa (x): " << x << "." << std::endl; + } + } // catch + return result; +} // T debug_integration_proc(T x) + +template +void test_integrals() +{ + // Integral of the Lambert W function: + // https://en.wikipedia.org/wiki/Lambert_W_function + using boost::math::quadrature::tanh_sinh; + using boost::math::quadrature::exp_sinh; + // file:///I:/modular-boost/libs/math/doc/html/math_toolkit/quadrature/double_exponential/de_tanh_sinh.html + using std::sqrt; + + std::cout << "Integration of type " << typeid(Real).name() << std::endl; + + Real tol = std::numeric_limits::epsilon(); + { // // Integrate for function lambert_W0(z); + tanh_sinh ts; + Real a = 0; + Real b = boost::math::constants::e(); + auto f = [](Real z)->Real + { + return lambert_w0(z); + }; + Real z = ts.integrate(f, a, b); // OK without any decltype(f) + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::e() - 1, tol); + } + { + // Integrate for function lambert_W0(z/(z sqrt(z)). + exp_sinh es; + auto f = [](Real z)->Real + { + return lambert_w0(z)/(z * sqrt(z)); + }; + Real z = es.integrate(f); // OK + BOOST_CHECK_CLOSE_FRACTION(z, 2 * boost::math::constants::root_two_pi(), tol); + } + { + // Integrate for function lambert_W0(1/z^2). + exp_sinh es; + //const Real sqrt_min = sqrt(boost::math::tools::min_value()); // 1.08420217e-19 fo 32-bit float. + // error C3493: 'sqrt_min' cannot be implicitly captured because no default capture mode has been specified + auto f = [](Real z)->Real + { + if (z <= sqrt(boost::math::tools::min_value()) ) + { // Too small would underflow z * z and divide by zero to overflow 1/z^2 for lambert_w0 z parameter. + return static_cast(0); + } + else + { + return lambert_w0(1 / (z * z)); // warning C4756: overflow in constant arithmetic, even though cannot happen. + } + }; + Real z = es.integrate(f); + BOOST_CHECK_CLOSE_FRACTION(z, boost::math::constants::root_two_pi(), tol); + } +} // template void test_integrals() + + +BOOST_AUTO_TEST_CASE( integrals ) +{ + std::cout << "Macro BOOST_MATH_LAMBERT_W0_INTEGRALS is defined." << std::endl; + BOOST_TEST_MESSAGE("\nTest Lambert W0 integrals."); + try + { + // using statements needed to change precision policy. + using boost::math::policies::policy; + using boost::math::policies::make_policy; + using boost::math::policies::precision; + using boost::math::policies::digits2; + using boost::math::policies::digits10; + + // using statements needed for changing error handling policy. + using boost::math::policies::evaluation_error; + using boost::math::policies::domain_error; + using boost::math::policies::overflow_error; + using boost::math::policies::ignore_error; + using boost::math::policies::throw_on_error; + + typedef policy< + domain_error, + overflow_error + > no_throw_policy; + + /* + // Experiment with better diagnostics. + typedef float Real; + + Real inf = std::numeric_limits::infinity(); + Real max = (std::numeric_limits::max)(); + std::cout.precision(std::numeric_limits::max_digits10); + //std::cout << "lambert_w0(inf) = " << lambert_w0(inf) << std::endl; // lambert_w0(inf) = 1.79769e+308 + std::cout << "lambert_w0(inf, throw_policy()) = " << lambert_w0(inf, no_throw_policy()) << std::endl; // inf + std::cout << "lambert_w0(max) = " << lambert_w0(max) << std::endl; // lambert_w0(max) = 703.227 + //std::cout << lambert_w0(inf) << std::endl; // inf - will throw. + std::cout << "lambert_w0(0) = " << lambert_w0(0.) << std::endl; // 0 + std::cout << "lambert_w0(std::numeric_limits::denorm_min()) = " << lambert_w0(std::numeric_limits::denorm_min()) << std::endl; // 4.94066e-324 + std::cout << "lambert_w0(std::numeric_limits::min()) = " << lambert_w0((std::numeric_limits::min)()) << std::endl; // 2.22507e-308 + + // Approximate the largest lambert_w you can get for type T? + float max_w_f = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max_f " << max_w_f << std::endl; // 84.2879 + Real max_w = boost::math::lambert_w_detail::lambert_w0_approx((std::numeric_limits::max)()); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. + std::cout << "w max " << max_w << std::endl; // 703.227 + + std::cout << "lambert_w0(7.2416706213544837e-163) = " << lambert_w0(7.2416706213544837e-163) << std::endl; // + std::cout << "test integral 1/z^2" << std::endl; + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1e-10, policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "ULP = " << boost::math::ulp(1., policy >()) << std::endl; // ULP = 2.2204460492503131e-16 + std::cout << "epsilon = " << std::numeric_limits::epsilon() << std::endl; // + std::cout << "sqrt(max) = " << sqrt(boost::math::tools::max_value() ) << std::endl; // sqrt(max) = 1.8446742974197924e+19 + std::cout << "sqrt(min) = " << sqrt(boost::math::tools::min_value() ) << std::endl; // sqrt(min) = 1.0842021724855044e-19 + + + +// Demo debug version. +Real tol = std::numeric_limits::epsilon(); +Real x; +{ + using boost::math::quadrature::exp_sinh; + exp_sinh es; + // Function to be integrated, lambert_w0(1/z^2). + + //auto f = [](Real z)->Real + //{ // Naive - no protection against underflow and subsequent divide by zero. + // return lambert_w0(1 / (z * z)); + //}; + // Diagnostic is: + // Error in function boost::math::lambert_w0: Expected a finite value but got inf + + auto f = [](Real z)->Real + { // Debug with diagnostics for underflow and subsequent divide by zero and other bad things. + return debug_integration_proc(z); + }; + // Exception Error in function boost::math::lambert_w0: Expected a finite value but got inf. + + // Unexpected exception thrown in integration code at abscissa: 7.2416706213544837e-163. + // Unexpected exception thrown in integration code at abscissa (x): 3.478765835953569e-23. + x = es.integrate(f); + std::cout << "es.integrate(f) = " << x << std::endl; + BOOST_CHECK_CLOSE_FRACTION(x, boost::math::constants::root_two_pi(), tol); + // root_two_pi(); + } + catch (std::exception& ex) + { + std::cout << ex.what() << std::endl; + } +} + From 3abd04ce50aacda5a0e50ddc59441e75d280a1e3 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Thu, 30 Aug 2018 08:57:35 +0100 Subject: [PATCH 63/71] LambertW: Hook up concept checks, and fix failures. --- include/boost/math/special_functions.hpp | 1 + .../math/special_functions/lambert_w.hpp | 37 ++++++++++++++----- .../boost/math/special_functions/math_fwd.hpp | 27 ++++++++++++++ include/boost/math/tools/test_value.hpp | 9 +---- test/compile_test/instantiate.hpp | 18 +++++++++ 5 files changed, 74 insertions(+), 18 deletions(-) diff --git a/include/boost/math/special_functions.hpp b/include/boost/math/special_functions.hpp index 367701c2a..8623539ae 100644 --- a/include/boost/math/special_functions.hpp +++ b/include/boost/math/special_functions.hpp @@ -69,5 +69,6 @@ #include #include #include +#include #endif // BOOST_MATH_SPECIAL_FUNCTIONS_HPP diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 7e2a8afc4..b6489ef47 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -96,6 +96,7 @@ namespace lambert_w_detail { template inline T lambert_w_halley_step(T w_est, const T z) { + BOOST_MATH_STD_USING T e = exp(w_est); w_est -= 2 * (w_est + 1) * (e * w_est - z) / (z * (w_est + 2) + e * (w_est * (w_est + 2) + 2)); return w_est; @@ -113,6 +114,7 @@ template inline T lambert_w_halley_iterate(T w_est, const T z) { + BOOST_MATH_STD_USING static const T max_diff = boost::math::tools::root_epsilon() * fabs(w_est); T w_new = lambert_w_halley_step(w_est, z); @@ -950,6 +952,7 @@ template inline T lambert_w0_approx(T z) { + BOOST_MATH_STD_USING T lz = log(z); T llz = log(lz); T w = lz - llz + (llz / lz); // Corless equation 4.19, page 349, and Chapeau-Blondeau equation 20, page 2162. @@ -1711,14 +1714,14 @@ T lambert_wm1_imp(const T z, const Policy& pol) const char* function = "boost::math::lambert_wm1()"; // Used for error messages. // Check for edge and corner cases first: - if (boost::math::isnan(z)) + if ((boost::math::isnan)(z)) { return policies::raise_domain_error(function, "Argument z is NaN!", z, pol); } // isnan - if (boost::math::isinf(z)) + if ((boost::math::isinf)(z)) { return policies::raise_domain_error(function, "Argument z is infinite!", @@ -1738,7 +1741,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) } if (std::numeric_limits::has_denorm) { // All real types except arbitrary precision. - if (!boost::math::isnormal(z)) + if (!(boost::math::isnormal)(z)) { // Almost zero - might also just return infinity like z == 0 or max_value? return policies::raise_overflow_error(function, "Argument z = %1% is denormalized! (must be z > (std::numeric_limits::min)() or z == 0)", @@ -2066,9 +2069,9 @@ T lambert_wm1_imp(const T z, const Policy& pol) } // lambert_wm1(T z) // First derivative of Lambert W0 and W-1. - template - typename tools::promote_args::type - lambert_w0_prime(T z) + template + inline typename tools::promote_args::type + lambert_w0_prime(T z, const Policy& pol) { typedef typename tools::promote_args::type result_type; using std::numeric_limits; @@ -2083,7 +2086,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) return numeric_limits::infinity(); } // if z < -1/e, we'll let lambert_w0 do the error handling: - result_type w = lambert_w0(result_type(z)); + result_type w = lambert_w0(result_type(z), pol); // If w ~ -1, then presumably this can get inaccurate. // Is there an accurate way to evaluate 1 + W(-1/e + eps)? // Yes: This is discussed in the Princeton Companion to Applied Mathematics, @@ -2095,8 +2098,15 @@ T lambert_wm1_imp(const T z, const Policy& pol) } // lambert_w0_prime(T z) template - typename tools::promote_args::type - lambert_wm1_prime(T z) + inline typename tools::promote_args::type + lambert_w0_prime(T z) + { + return lambert_w0_prime(z, policies::policy<>()); + } + + template + inline typename tools::promote_args::type + lambert_wm1_prime(T z, const Policy& pol) { using std::numeric_limits; typedef typename tools::promote_args::type result_type; @@ -2110,10 +2120,17 @@ T lambert_wm1_imp(const T z, const Policy& pol) return -numeric_limits::infinity(); } - result_type w = lambert_wm1(z); + result_type w = lambert_wm1(z, pol); return w/(z*(1+w)); } // lambert_wm1_prime(T z) + template + inline typename tools::promote_args::type + lambert_wm1_prime(T z) + { + return lambert_wm1_prime(z, policies::policy<>()); + } + }} //boost::math namespaces #endif // #ifdef BOOST_MATH_SF_LAMBERT_W_HPP diff --git a/include/boost/math/special_functions/math_fwd.hpp b/include/boost/math/special_functions/math_fwd.hpp index 9becef9f6..05fe7fca0 100644 --- a/include/boost/math/special_functions/math_fwd.hpp +++ b/include/boost/math/special_functions/math_fwd.hpp @@ -1061,6 +1061,27 @@ namespace boost const unsigned number_of_bernoullis_b2n, OutputIterator out_it); + // Lambert W: + template + typename boost::math::tools::promote_args::type lambert_w0(T z, const Policy& pol); + template + typename boost::math::tools::promote_args::type lambert_w0(T z); + template + typename boost::math::tools::promote_args::type lambert_wm1(T z, const Policy& pol); + template + typename boost::math::tools::promote_args::type lambert_wm1(T z); + template + typename boost::math::tools::promote_args::type lambert_w0_prime(T z, const Policy& pol); + template + typename boost::math::tools::promote_args::type lambert_w0_prime(T z); + template + typename boost::math::tools::promote_args::type lambert_wm1_prime(T z, const Policy& pol); + template + typename boost::math::tools::promote_args::type lambert_wm1_prime(T z); + + + + } // namespace math } // namespace boost @@ -1606,6 +1627,12 @@ template \ OutputIterator tangent_t2n(int start_index, unsigned number_of_bernoullis_b2n, OutputIterator out_it)\ { return boost::math::tangent_t2n(start_index, number_of_bernoullis_b2n, out_it, Policy()); }\ \ + template inline typename boost::math::tools::promote_args::type lambert_w0(T z) { return boost::math::lambert_w0(z, Policy()); }\ + template inline typename boost::math::tools::promote_args::type lambert_wm1(T z) { return boost::math::lambert_w0(z, Policy()); }\ + template inline typename boost::math::tools::promote_args::type lambert_w0_prime(T z) { return boost::math::lambert_w0(z, Policy()); }\ + template inline typename boost::math::tools::promote_args::type lambert_wm1_prime(T z) { return boost::math::lambert_w0(z, Policy()); }\ + \ + diff --git a/include/boost/math/tools/test_value.hpp b/include/boost/math/tools/test_value.hpp index e9feb6281..e597f2ad4 100644 --- a/include/boost/math/tools/test_value.hpp +++ b/include/boost/math/tools/test_value.hpp @@ -31,13 +31,6 @@ #include #include -// Built-in/fundamental GCC float128 or Intel Quad 128-bit type, if available. -#ifdef BOOST_HAS_FLOAT128 -#include // Not available for MSVC. -// sets BOOST_MP_USE_FLOAT128 for GCC -using boost::multiprecision::float128; -#endif //# __GNUC__ and NOT _MSC_VER - #ifdef BOOST_MATH_INSTRUMENT_CREATE_TEST_VALUE // global int create_type(0); must be defined before including this file. #endif @@ -45,7 +38,7 @@ using boost::multiprecision::float128; #ifdef BOOST_HAS_FLOAT128 typedef __float128 largest_float; #define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##Q -#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS std::numeric_limits::digits +#define BOOST_MATH_TEST_LARGEST_FLOAT_DIGITS 113 #else typedef long double largest_float; #define BOOST_MATH_TEST_LARGEST_FLOAT_SUFFIX(x) x##L diff --git a/test/compile_test/instantiate.hpp b/test/compile_test/instantiate.hpp index cdb0f1e87..044c721b8 100644 --- a/test/compile_test/instantiate.hpp +++ b/test/compile_test/instantiate.hpp @@ -300,6 +300,9 @@ void instantiate(RealType) boost::math::cyl_bessel_j_zero(v1, i, i, oi); boost::math::cyl_neumann_zero(v1, i); boost::math::cyl_neumann_zero(v1, i, i, oi); + boost::math::lambert_w0(v1); + boost::math::lambert_wm1(v1); + boost::math::lambert_w0_prime(v1); #ifdef TEST_COMPLEX boost::math::cyl_hankel_1(v1, v2); boost::math::cyl_hankel_1(i, v2); @@ -496,6 +499,9 @@ void instantiate(RealType) boost::math::cyl_bessel_j_zero(v1 * 1, i, i, oi); boost::math::cyl_neumann_zero(v1 * 1, i); boost::math::cyl_neumann_zero(v1 * 1, i, i, oi); + boost::math::lambert_w0(v1 * 1); + boost::math::lambert_wm1(v1 * 1); + boost::math::lambert_w0_prime(v1 * 1); #ifdef TEST_COMPLEX boost::math::cyl_hankel_1(v1, v2); boost::math::cyl_hankel_1(i, v2); @@ -672,6 +678,9 @@ void instantiate(RealType) boost::math::cyl_bessel_j_zero(v1, i, i, oi, pol); boost::math::cyl_neumann_zero(v1, i, pol); boost::math::cyl_neumann_zero(v1, i, i, oi, pol); + boost::math::lambert_w0(v1, pol); + boost::math::lambert_wm1(v1, pol); + boost::math::lambert_w0_prime(v1, pol); #ifdef TEST_COMPLEX boost::math::cyl_hankel_1(v1, v2, pol); boost::math::cyl_hankel_1(i, v2, pol); @@ -868,6 +877,9 @@ void instantiate(RealType) test::cyl_bessel_j_zero(v1, i, i, oi); test::cyl_neumann_zero(v1, i); test::cyl_neumann_zero(v1, i, i, oi); + test::lambert_w0(v1); + test::lambert_wm1(v1); + test::lambert_w0_prime(v1); #ifdef TEST_COMPLEX test::cyl_hankel_1(v1, v2); test::cyl_hankel_1(i, v2); @@ -1240,6 +1252,9 @@ void instantiate_mixed(RealType) boost::math::sph_neumann_prime(i, i, pol); boost::math::owens_t(fr, dr, pol); boost::math::owens_t(i, s, pol); + boost::math::lambert_w0(i, pol); + boost::math::lambert_wm1(i, pol); + boost::math::lambert_w0_prime(i, pol); #endif #ifdef TEST_GROUP_8 test::tgamma(i); @@ -1383,6 +1398,9 @@ void instantiate_mixed(RealType) test::airy_bi_prime(i); test::owens_t(fr, dr); test::owens_t(i, s); + boost::math::lambert_w0(i); + boost::math::lambert_wm1(i); + boost::math::lambert_w0_prime(i); #endif #endif } From 364952fd8a663bd43a96045734423a945ba47e1e Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Thu, 30 Aug 2018 18:21:28 +0100 Subject: [PATCH 64/71] LambertW: pedantic changes to docs. [CI SKIP] --- doc/html/index.html | 2 +- doc/html/indexes/s01.html | 285 ++++--- doc/html/indexes/s02.html | 106 ++- doc/html/indexes/s03.html | 58 +- doc/html/indexes/s04.html | 16 +- doc/html/indexes/s05.html | 800 ++++++++++-------- doc/html/math_toolkit/conventions.html | 6 +- doc/html/math_toolkit/navigation.html | 6 +- doc/html/math_toolkit/result_type.html | 6 +- .../root_comparison/cbrt_comparison.html | 6 +- .../root_comparison/root_n_comparison.html | 3 +- doc/sf/lambert_w.qbk | 65 +- example/lambert_w_diode.cpp | 13 +- example/lambert_w_simple_examples.cpp | 12 +- .../math/special_functions/lambert_w.hpp | 18 +- 15 files changed, 818 insertions(+), 584 deletions(-) diff --git a/doc/html/index.html b/doc/html/index.html index f7cb4076c..4f6cfd12d 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -122,7 +122,7 @@ This manual is also available in

        • Last revised: August 20, 2018 at 18:25:34 GMT

        Last revised: August 30, 2018 at 17:17:24 GMT
        diff --git a/doc/html/indexes/s01.html b/doc/html/indexes/s01.html index 8e4482444..99773cfbf 100644 --- a/doc/html/indexes/s01.html +++ b/doc/html/indexes/s01.html @@ -3,10 +3,10 @@ Function Index - - - - + + + + @@ -24,11 +24,18 @@

        -Function Index

        -

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        +Function Index
        +

        1 2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        -2 +1 +
        +
        +
        +2
        -4 +4
        -A +A
        -B +B
        -C +C
        -D +D
        -E +E
        @@ -832,7 +875,7 @@

      • C99 and TR1 C Functions Overview

      • Elliptic Integrals of the Second Kind - Legendre Form

      • Error Logs For Error Rate Tables

        • -

      • Error rates for ellint_2 (complete)

        • +

      • Error rates for ellint_2 (complete)

      • TR1 C Functions Quick Reference

        • @@ -860,7 +903,7 @@

      • Elliptic Integral D - Legendre Form

      • Elliptic Integrals of the Third Kind - Legendre Form

      • Error Logs For Error Rate Tables

        • -

      • Error rates for ellint_3 (complete)

        • +

      • Error rates for ellint_3 (complete)

      • TR1 C Functions Quick Reference

        • @@ -909,7 +952,7 @@

      • epsilon

        -
        +

      • epsilon_difference

        @@ -1044,6 +1087,10 @@
      • +

        expint_as_fraction

        +
        +
        • +

      • expm1

        • -F +F
      • +

        finite_difference_derivative

        +
        +
        • +

      • float

        • @@ -1153,7 +1204,7 @@
      • @@ -1250,6 +1301,7 @@
        • -G +G
        • @@ -1347,12 +1399,12 @@
        -H +H
        -I +I
        -J +J
        • @@ -1668,13 +1733,13 @@
        -K +K
        -L +L
        -M +M
        • @@ -2107,19 +2172,20 @@
        -N +N
        -O +O
        -P +P
        -Q +Q
        -R +R
        -S +S
        -T +T
        -U +U
        • @@ -2967,6 +3046,10 @@
      • +

        update_target_error

        +
        +
        • +

      • user_denorm_error

        • -V +V
        -W +W
        -
        -X +X

        • x

          @@ -3087,14 +3179,14 @@
        -Y +Y
        -Z +Z

        -Class Index

        -

        A B C D E F G H I L M N O P Q R S T U W

        +Class Index
        +

        A B C D E F G H I L M N O P Q R S T U W

        -A +A
        -B +B
        -C +C
        -D +D
        -E +E
        -F +F
        -G +G
        -H +H
        -I +I
        -L +L
        -M +M
        -N +N
        -O +O

        • octonion

          @@ -209,7 +236,7 @@
        -P +P
        -Q +Q

        • quaternion

          @@ -235,32 +262,32 @@
        -R +R
        -S +S
        -T +T
        -U +U
        -W +W
        diff --git a/doc/html/indexes/s03.html b/doc/html/indexes/s03.html index 529969333..caeec333b 100644 --- a/doc/html/indexes/s03.html +++ b/doc/html/indexes/s03.html @@ -3,9 +3,9 @@ Typedef Index - - - + + + @@ -24,11 +24,11 @@

        -Typedef Index

        -

        A B C D E F G H I L N O P R S T U V W

        +Typedef Index
        +

        A B C D E F G H I L N O P R S T U V W

        -A +A
        • @@ -41,7 +41,7 @@
        -B +B
        • @@ -58,7 +58,7 @@
        -C +C
        • @@ -77,7 +77,7 @@
        -D +D
        • @@ -102,7 +102,7 @@
        -E +E
        • @@ -119,7 +119,7 @@
        -F +F
        • @@ -150,7 +150,7 @@
        -G +G
        • @@ -167,7 +167,7 @@
        -H +H
        • @@ -180,7 +180,7 @@
        -I +I
        • @@ -197,7 +197,7 @@
        -L +L
        • @@ -218,7 +218,7 @@
        -N +N
        • @@ -255,14 +255,14 @@
        -O +O
        -P +P
        • @@ -325,7 +325,7 @@
        -R +R
        • @@ -338,24 +338,30 @@
        -S +S
        -
        -T +T
        -U +U
        • @@ -368,7 +374,7 @@
        -V +V

        • value_type

          @@ -419,7 +425,7 @@
        -W +W

        • weibull

          diff --git a/doc/html/indexes/s04.html b/doc/html/indexes/s04.html index 22493c651..5a772e760 100644 --- a/doc/html/indexes/s04.html +++ b/doc/html/indexes/s04.html @@ -3,9 +3,9 @@ Macro Index - - - + + + @@ -24,11 +24,11 @@

        -Macro Index

        -

        B F

        +Macro Index
        +

        B F

        -B +B
        • @@ -220,7 +220,7 @@

        • BOOST_MATH_NO_ATOMIC_INT

          -
          +

        • BOOST_MATH_NO_DEDUCED_FUNCTION_POINTERS

          @@ -315,7 +315,7 @@
        -F +F
        • diff --git a/doc/html/indexes/s05.html b/doc/html/indexes/s05.html index 7bd454b5e..ec6060b24 100644 --- a/doc/html/indexes/s05.html +++ b/doc/html/indexes/s05.html @@ -3,9 +3,9 @@ Index - - - + + + @@ -23,11 +23,18 @@

        -Index

        -

        2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        +Index
        +

        1 2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

        -2 +1 +
        +
        +
        +2
        -4 +4
        -A +A
        -B +B
        -C +C
        • @@ -1462,6 +1470,10 @@
      • +

        cancel

        +
        +
        • +

      • case

      • @@ -1556,34 +1568,6 @@

      • Bessel Functions of the First and Second Kinds

      • Beta

      • Error Functions

        • -

      • Error Logs For Error Rate Tables

        • -

      • Error rates for beta

        • -

      • Error rates for cbrt

        • -

      • Error rates for cyl_bessel_i

        • -

      • Error rates for cyl_bessel_i (integer orders)

        • -

      • Error rates for cyl_bessel_j

        • -

      • Error rates for cyl_bessel_j (integer orders)

        • -

      • Error rates for cyl_bessel_k (integer orders)

        • -

      • Error rates for cyl_neumann (integer orders)

        • -

      • Error rates for digamma

        • -

      • Error rates for ellint_1

        • -

      • Error rates for ellint_2

        • -

      • Error rates for erf

        • -

      • Error rates for erfc

        • -

      • Error rates for expint (Ei)

        • -

      • Error rates for expm1

        • -

      • Error rates for gamma_p

        • -

      • Error rates for gamma_q

        • -

      • Error rates for ibeta

        • -

      • Error rates for ibetac_inv

        • -

      • Error rates for ibeta_inv

        • -

      • Error rates for jacobi_cn

        • -

      • Error rates for jacobi_dn

        • -

      • Error rates for jacobi_sn

        • -

      • Error rates for lgamma

        • -

      • Error rates for log1p

        • -

      • Error rates for tgamma

        • -

      • Error rates for zeta

      • FAQs

      • Frequently Asked Questions FAQ

      • Incomplete Beta Functions

        • @@ -1610,6 +1594,48 @@
      • +

        Chebyshev Polynomials

        +
        +
        • +
      • +

        chebyshev_clenshaw_recurrence

        +
        +
        • +
      • +

        chebyshev_next

        +
        +
        • +
      • +

        chebyshev_t

        +
        +
        • +
      • +

        chebyshev_transform

        +
        +
        • +
      • +

        chebyshev_t_prime

        +
        +
        • +
      • +

        chebyshev_u

        +
        +
        • +

      • checked_narrowing_cast

        • @@ -1641,27 +1667,23 @@

      • chi_squared_distribution

      • -

        close

        -
        -
        • -

      • Comparing Different Compilers

      • Comparison of Cube Root Finding Algorithms

      • Comparison of Elliptic Integral Root Finding Algoritghms

        -
        +

      • Comparison of Nth-root Finding Algorithms

        -
        +

      • Comparison with C, R, FORTRAN-style Free Functions

        @@ -1713,14 +1735,25 @@
      • +

        complex

        +
        +
        • +
      • +

        complex_step_derivative

        +
        +
        • +

      • compute

      • Computing the Fifth Root

      • @@ -1864,18 +1897,18 @@

      • constants

        • +
      • +

        Cost of Finite-Difference Numerical Differentiation

        +
        +

      • cos_pi

      • Credits and Acknowledgements

        @@ -1998,19 +2045,19 @@

      • Cubic B-spline interpolation

      • cubic_b_spline

        -
        +

      • Cyclic Hankel Functions

        @@ -2167,7 +2214,7 @@

        cyl_neumann_prime

      • @@ -2176,7 +2223,7 @@
        • -D +D
        -E +E
        @@ -2407,7 +2454,7 @@

      • C99 and TR1 C Functions Overview

      • Elliptic Integrals of the Second Kind - Legendre Form

      • Error Logs For Error Rate Tables

        • -

      • Error rates for ellint_2 (complete)

        • +

      • Error rates for ellint_2 (complete)

      • TR1 C Functions Quick Reference

        • @@ -2435,7 +2482,7 @@

      • Elliptic Integral D - Legendre Form

      • Elliptic Integrals of the Third Kind - Legendre Form

      • Error Logs For Error Rate Tables

        • -

      • Error rates for ellint_3 (complete)

        • +

      • Error rates for ellint_3 (complete)

      • TR1 C Functions Quick Reference

        • @@ -2539,7 +2586,7 @@

      • epsilon

        -
        +

      • epsilon_difference

        @@ -2547,19 +2594,19 @@

      • eps_tolerance

        -
        +

      • equal_ceil

        -
        +

      • equal_floor

        -
        +

      • equal_nearest_integer

        -
        +

      • erf

        @@ -2674,7 +2721,6 @@

      • Error Logs For Error Rate Tables

        • -F +F
      • +

        finite_difference_derivative

        +
        +
        • +

      • fisher_f

        • -G +G
        -H +H
        -I +I
        -J +J
        • @@ -4707,13 +4768,13 @@
        -K +K
        -L +L
        -M +M
        -N +N
        -O +O
        -P +P
        -Q +Q
        -R +R
        -S +S
        -T +T
        -U +U
        • @@ -7366,8 +7483,15 @@
      • +

        update_target_error

        +
        +
        • +

      • upper_incomplete_gamma_fract

        -
        +

      • Use in non-template code

        @@ -7463,7 +7587,7 @@

      • Using C++11 Lambda's

        -
        +

      • Using e_float Library

        @@ -7516,14 +7640,14 @@
        • -V +V
        -W +W
        -X +X

        • x

          @@ -7654,14 +7785,14 @@
        -Y +Y
        -Z +Z

        - +

        This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/navigation.html b/doc/html/math_toolkit/navigation.html index 427fea134..941717454 100644 --- a/doc/html/math_toolkit/navigation.html +++ b/doc/html/math_toolkit/navigation.html @@ -3,8 +3,8 @@ Navigation - - + + @@ -27,7 +27,7 @@ Navigation

        - +

        Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/result_type.html b/doc/html/math_toolkit/result_type.html index c375e7430..63884ee25 100644 --- a/doc/html/math_toolkit/result_type.html +++ b/doc/html/math_toolkit/result_type.html @@ -3,8 +3,8 @@ Calculation of the Type of the Result - - + + @@ -40,7 +40,7 @@ floating-point arguments. But that leaves the question:

        -
        +

        "Given a special function with N arguments of types T1, T2, T3 ... TN, then what type is the result?" diff --git a/doc/html/math_toolkit/root_comparison/cbrt_comparison.html b/doc/html/math_toolkit/root_comparison/cbrt_comparison.html index be1e5e25c..8a2fc6c62 100644 --- a/doc/html/math_toolkit/root_comparison/cbrt_comparison.html +++ b/doc/html/math_toolkit/root_comparison/cbrt_comparison.html @@ -29,7 +29,7 @@

        In the table below, the cube root of 28 was computed for three fundamental - types floating-point types, and one Boost.Multiprecision + (built-in) types floating-point types, and one Boost.Multiprecision type cpp_bin_float using 50 decimal digit precision, using four algorithms.

        @@ -202,8 +202,8 @@
      • For fundamental - types, there was little to choose between the three derivative - methods, but for cpp_bin_float, + (built-in) types, there was little to choose between the three + derivative methods, but for cpp_bin_float, Newton-Raphson iteration was twice as fast. Note that the cube-root is an extreme test case as the cost of calling the functor is so cheap that the runtimes are largely diff --git a/doc/html/math_toolkit/root_comparison/root_n_comparison.html b/doc/html/math_toolkit/root_comparison/root_n_comparison.html index ee2f365c7..fbcd8a101 100644 --- a/doc/html/math_toolkit/root_comparison/root_n_comparison.html +++ b/doc/html/math_toolkit/root_comparison/root_n_comparison.html @@ -5202,7 +5202,8 @@
      • Perhaps surprisingly, there is little difference between the various algorithms for fundamental - types floating-point types. Using the first derivatives (Newton-Raphson iteration) + (built-in) types floating-point types. Using the first derivatives + (Newton-Raphson iteration) is usually the best, but while the improvement over the no-derivative TOMS Algorithm 748: enclosing zeros of continuous functions is considerable diff --git a/doc/sf/lambert_w.qbk b/doc/sf/lambert_w.qbk index 255da03c1..c390df87b 100644 --- a/doc/sf/lambert_w.qbk +++ b/doc/sf/lambert_w.qbk @@ -9,22 +9,22 @@ namespace boost { namespace math { template - ``__sf_result`` lambert_w0(T z); // W0 branch, default policy. - + ``__sf_result`` lambert_w0(T z); // W0 branch, default policy. template - ``__sf_result`` lambert_w0_prime(T z); // W0 branch 1st derivative. + ``__sf_result`` lambert_wm1(T z); // W-1 branch, default policy. + template + ``__sf_result`` lambert_w0_prime(T z); // W0 branch 1st derivative. + template + ``__sf_result`` lambert_wm1_prime(T z); // W-1 branch 1st derivative. template - ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy. - - template - ``__sf_result`` lambert_wm1(T z); // W-1 branch, default policy. - - template - ``__sf_result`` lambert_wm1_prime(T z); // W-1 branch 1st derivative. - + ``__sf_result`` lambert_w0(T z, const ``__Policy``&); // W0 with policy. template - ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy. + ``__sf_result`` lambert_wm1(T z, const ``__Policy``&); // W-1 with policy. + template + ``__sf_result`` lambert_w0_prime(T z, const ``__Policy``&); // W0 derivative with policy. + template + ``__sf_result`` lambert_wm1_prime(T z, const ``__Policy``&); // W-1 derivative with policy. } // namespace boost } // namespace math @@ -274,7 +274,7 @@ with this output: The distribution of differences from 'best' are shown in these graphs comparing `double` precision evaluations with reference 'best' z50 evaluations using `cpp_bin_float_50` type reduced to `double` with `static_cast::max_digi This distinguishes between `long double` types that commonly vary between 64 and 80-bits, and also compilers that have a `float` type using 64 bits and/or `long double` using 128-bits. -[note One cannot switch tag_type on `std::numeric_limits<>::max()` -because comparison values may overflow the compiler limit. -Nor can we switch on `std::numeric_limits::max_exponent10()` -because both 80-bit and 128-bit floating-point types use 11 bits for exponent. -So must rely on `std::numeric_limits::max_digits10`.] - -[warning It is assumes that `max_digits10` is defined correctly or this might fail to make the correct selection. -causing very small differences in computing lambert_w that would be very difficult to detect and diagnose.] - -[warning The use of `doubledouble` higher-than-long-double precision types is untested and may give unexpected precisions.] - As noted in the __lambert_w_implementation section above, it is only possible to ensure the nearest representable value by casting from a higher precision type, computed at very, very much greater cost. @@ -755,24 +744,6 @@ for example, LambertW0(1/(z[sup2]) == [sqrt](2[pi]), see [@https://en.wikipedia.org/wiki/Lambert_W_function#Definite_integrals Definite Integrals]. Some care was needed to avoid overflow and underflow as the integral function must evaluate to a finite result over the entire range. -These are not routinely evaluated by the Boost testers, -but can be run by defining a macro BOOST_MATH_LAMBERT_W0_INTEGRALS. -If BOOST_MATH_TEST_MULTIPRECISION is also defined, -then __multiprecision types like `cpp_bin_float_quad` are also used to test quadrature. -If BOOST_MATH_TEST_FLOAT128 is defined, then `float128` is also tested. - -[h5:test_macros Testing Macros] - -A few macros provide optional tests if #defined before BOOST_TEST_MAIN. - -* BOOST_MATH_TEST_MULTIPRECISION Adds test for __multiprecision types. - -* BOOST_MATH_TEST_FLOAT128 Adds test using `__float128` type (GCC only, needing -std=gnu++17 and the quadmath library libquadmath.dll). - -* BOOST_MATH_LAMBERT_W_DERIVATIVES to test 1st derivatives is defined. - -* BOOST_MATH_LAMBERT_W_INTEGRALS Adds quadrature tests that cover the whole range of the Lambert W0 function. - [h5 Other implementations] The Lambert W has also been discussed in a [@http://lists.boost.org/Archives/boost/2016/09/230819.php Boost thread]. diff --git a/example/lambert_w_diode.cpp b/example/lambert_w_diode.cpp index 0ccd4c1f6..a62506850 100644 --- a/example/lambert_w_diode.cpp +++ b/example/lambert_w_diode.cpp @@ -121,15 +121,16 @@ int main() double x = 0.01; //std::cout << "Lambert W (" << x << ") = " << lambert_w(x) << std::endl; // 0.00990147 - double nu = 1.0; // Assumed ideal. - double vt = v_thermal(25); // v thermal, Shockley equation, expect about 25 mV at room temperature. - double boltzmann_k = 1.38e-23; // joules/kelvin + double nu = 1.0; // Assumed ideal. + double vt = v_thermal(25); // v thermal, Shockley equation, expect about 25 mV at room temperature. + double boltzmann_k = 1.38e-23; // joules/kelvin double temp = 273 + 25; - double charge_q = 1.6e-19; // column + double charge_q = 1.6e-19; // column vt = boltzmann_k * temp / charge_q; - std::cout << "V thermal " << vt << std::endl; // V thermal 0.0257025 = 25 mV + std::cout << "V thermal " + << vt << std::endl; // V thermal 0.0257025 = 25 mV double rsat = 0.; - double isat = 25.e-15; // 25 fA; + double isat = 25.e-15; // 25 fA; std::cout << "Isat = " << isat << std::endl; double re = 0.3; // Estimated from slope of straight section of graph (equation 6). diff --git a/example/lambert_w_simple_examples.cpp b/example/lambert_w_simple_examples.cpp index 35c0f34cb..9e32b4971 100644 --- a/example/lambert_w_simple_examples.cpp +++ b/example/lambert_w_simple_examples.cpp @@ -104,12 +104,12 @@ int main() //[lambert_w_simple_examples_1 float z = 10.F; float r; - r = lambert_w0(z); // Default policy digits10 = 7, digits2 = 24 + r = lambert_w0(z); // Default policy digits10 = 7, digits2 = 24 std::cout << "lambert_w0("; show_value(z); std::cout << ") = "; show_value(r); - std::cout << std::endl; // lambert_w0(10.0000000) = 1.74552798 + std::cout << std::endl; // lambert_w0(10.0000000) = 1.74552798 //] //[/lambert_w_simple_examples_1] } { @@ -117,12 +117,12 @@ int main() // showing that an integer is correctly promoted to a double. //[lambert_w_simple_examples_2 std::cout.precision(std::numeric_limits::max_digits10); - double r = lambert_w0(10); // Pass an int argument "10" that should be promoted to double argument. - std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406994 + double r = lambert_w0(10); // Pass an int argument "10" that should be promoted to double argument. + std::cout << "lambert_w0(10) = " << r << std::endl; // lambert_w0(10) = 1.7455280027406994 double rp = lambert_w0(10); std::cout << "lambert_w0(10) = " << rp << std::endl; // lambert_w0(10) = 1.7455280027406994 - auto rr = lambert_w0(10); // C++11 needed. + auto rr = lambert_w0(10); // C++11 needed. std::cout << "lambert_w0(10) = " << rr << std::endl; // lambert_w0(10) = 1.7455280027406994 too, showing that rr has been promoted to double. //] //[/lambert_w_simple_examples_2] @@ -180,7 +180,7 @@ int main() { // Using multiprecision types to get multiprecision precision right! //[lambert_w_simple_examples_4b - cpp_dec_float_50 z("0.9"); // Construct from decimal digit string. + cpp_dec_float_50 z("0.9"); // Construct from decimal digit string. cpp_dec_float_50 r; r = lambert_w0(z); std::cout << "lambert_w0("; diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index b6489ef47..594992883 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -34,15 +34,15 @@ Some macros that will show some (or much) diagnostic values if #defined. //[boost_math_instrument_lambert_w_macros // #define-able macros -BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION // Precision. -BOOST_MATH_INSTRUMENT_LAMBERT_WM1 // W1 branch diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_WM1_HALLEY // Halley refinement diagnostics only for W-1 branch. -BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26 -BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table. -BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. -BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. -BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. +BOOST_MATH_INSTRUMENT_LAMBERT_W_HALLEY // Halley refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_PRECISION // Precision. +BOOST_MATH_INSTRUMENT_LAMBERT_WM1 // W1 branch diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_WM1_HALLEY // Halley refinement diagnostics only for W-1 branch. +BOOST_MATH_INSTRUMENT_LAMBERT_WM1_TINY // K > 64, z > -1.0264389699511303e-26 +BOOST_MATH_INSTRUMENT_LAMBERT_WM1_LOOKUP // Show results from W-1 lookup table. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SCHROEDER // Schroeder refinement diagnostics. +BOOST_MATH_INSTRUMENT_LAMBERT_W_TERMS // Number of terms used for near-singularity series. +BOOST_MATH_INSTRUMENT_LAMBERT_W_SINGULARITY_SERIES // Show evaluation of series near branch singularity. BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES BOOST_MATH_INSTRUMENT_LAMBERT_W_SMALL_Z_SERIES_ITERATIONS // Show evaluation of series for small z. //] [/boost_math_instrument_lambert_w_macros] From 3104f3ad7955a4bc9423867c1c1990d20492af5d Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Thu, 30 Aug 2018 18:47:40 +0100 Subject: [PATCH 65/71] LambertW: Fix for types with no numeric_limits. Configuration fix for __float128 support. --- include/boost/math/special_functions/lambert_w.hpp | 10 ++++++---- test/Jamfile.v2 | 2 +- test/test_lambert_w_integrals_float128.cpp | 7 +++++++ 3 files changed, 14 insertions(+), 5 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 594992883..41a731e33 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -508,16 +508,18 @@ T lambert_w0_small_z(T x, const Policy& pol) { //std::numeric_limits::max_digits10 == 36 ? 3 : // 128-bit long double. typedef boost::mpl::int_ < + std::numeric_limits::is_specialized == 0 ? 5 : #ifndef BOOST_NO_CXX11_NUMERIC_LIMITS std::numeric_limits::max_digits10 <= 9 ? 0 : // for float 32-bit. std::numeric_limits::max_digits10 <= 17 ? 1 : // for double 64-bit. std::numeric_limits::max_digits10 <= 22 ? 2 : // for 80-bit double extended. std::numeric_limits::max_digits10 < 37 ? 4 // for both 128-bit long double (3) and 128-bit quad suffix Q type (4). #else - ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 24)) ? 0 : // for float 32-bit. - ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 53)) ? 1 : // for double 64-bit. - ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 64)) ? 2 : // for 80-bit double extended. - ((std::numeric_limits::radix == 2) && (std::numeric_limits::digits <= 113)) ? 4 // for both 128-bit long double (3) and 128-bit quad suffix Q type (4). + std::numeric_limits::radix != 2 ? 5 : + std::numeric_limits::digits <= 24 ? 0 : // for float 32-bit. + std::numeric_limits::digits <= 53 ? 1 : // for double 64-bit. + std::numeric_limits::digits <= 64 ? 2 : // for 80-bit double extended. + std::numeric_limits::digits <= 113 ? 4 // for both 128-bit long double (3) and 128-bit quad suffix Q type (4). #endif : 5 // All Generic multiprecision types. > tag_type; diff --git a/test/Jamfile.v2 b/test/Jamfile.v2 index 732dd52a8..3ec90c4a9 100644 --- a/test/Jamfile.v2 +++ b/test/Jamfile.v2 @@ -428,7 +428,7 @@ test-suite special_fun : [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION=2 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] : test_lambert_w_multiprecision_2 ] [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION=3 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] : test_lambert_w_multiprecision_3 ] [ run test_lambert_w.cpp ../../test/build//boost_unit_test_framework : : : BOOST_MATH_TEST_MULTIPRECISION=4 BOOST_MATH_TEST_FLOAT128 [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] : test_lambert_w_multiprecision_4 ] - [ run test_lambert_w_integrals_float128.cpp ../../test/build//boost_unit_test_framework : : : [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : "-Bstatic -lquadmath -Bdynamic" ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] + [ run test_lambert_w_integrals_float128.cpp ../../test/build//boost_unit_test_framework : : : [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : "-Bstatic -lquadmath -Bdynamic" : no ] [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] [ run test_lambert_w_integrals_quad.cpp ../../test/build//boost_unit_test_framework : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] [ check-target-builds ../config//has_float128 "GCC libquadmath and __float128 support" : BOOST_MATH_TEST_FLOAT128 "-Bstatic -lquadmath -Bdynamic" ] ] [ run test_lambert_w_integrals_long_double.cpp ../../test/build//boost_unit_test_framework : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] [ run test_lambert_w_integrals_double.cpp ../../test/build//boost_unit_test_framework : : : [ requires cxx11_auto_declarations cxx11_lambdas cxx11_smart_ptr cxx11_unified_initialization_syntax sfinae_expr ] ] diff --git a/test/test_lambert_w_integrals_float128.cpp b/test/test_lambert_w_integrals_float128.cpp index 9db4fc199..44f19a382 100644 --- a/test/test_lambert_w_integrals_float128.cpp +++ b/test/test_lambert_w_integrals_float128.cpp @@ -12,6 +12,8 @@ #include // for BOOST_MSVC definition etc. #include // for BOOST_MSVC versions. +#ifdef BOOST_HAS_FLOAT128 + // Boost macros #define BOOST_TEST_MAIN #define BOOST_LIB_DIAGNOSTIC "on" // Report library file details. @@ -267,3 +269,8 @@ Real x; } } +#else + +int main() { return 0; } + +#endif From 424eeffdd34f5535e3cbb2b5fc24892b05bf06ac Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Thu, 30 Aug 2018 19:16:14 +0100 Subject: [PATCH 66/71] LambertW: Add max_digits10 to numeric_limits specialization in std_real_concept_check.cpp. --- test/compile_test/std_real_concept_check.cpp | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/test/compile_test/std_real_concept_check.cpp b/test/compile_test/std_real_concept_check.cpp index a83297a79..20638e375 100644 --- a/test/compile_test/std_real_concept_check.cpp +++ b/test/compile_test/std_real_concept_check.cpp @@ -48,6 +48,7 @@ struct numeric_limits static boost::math::concepts::std_real_concept max NULL_MACRO() throw(); static const int digits = 24; static const int digits10 = 6; + static const int max_digits10 = 9; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; @@ -86,6 +87,7 @@ struct numeric_limits static boost::math::concepts::std_real_concept max NULL_MACRO() throw(); static const int digits = 53; static const int digits10 = 15; + static const int max_digits10 = 17; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; @@ -124,6 +126,7 @@ struct numeric_limits static boost::math::concepts::std_real_concept max NULL_MACRO() throw(); static const int digits = 64; static const int digits10 = 18; + static const int max_digits10 = 22; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; @@ -162,6 +165,7 @@ struct numeric_limits static boost::math::concepts::std_real_concept max NULL_MACRO() throw(); static const int digits = 113; static const int digits10 = 33; + static const int max_digits10 = 37; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; From 982d82b2b524c61835d260d732930560ce933885 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Thu, 30 Aug 2018 19:48:27 +0100 Subject: [PATCH 67/71] LambertW: Hook up real_concept tests and fix resulting errors. --- .../math/special_functions/lambert_w.hpp | 12 +++---- test/test_lambert_w.cpp | 31 ++++++++++++------- 2 files changed, 26 insertions(+), 17 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index 41a731e33..d5c5fb81b 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -1757,7 +1757,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) "Argument z = %1% is out of range (z <= 0) for Lambert W-1 branch! (Try Lambert W0 branch?)", z, pol); } - if (z > -(std::numeric_limits::min)()) + if (z > -boost::math::tools::min_value()) { // z is denormalized, so cannot be computed. // -std::numeric_limits::min() is smallest for type T, // for example, for double: lambert_wm1(-2.2250738585072014e-308) = -714.96865723796634 @@ -1786,7 +1786,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) if (p2 > 0) { T w_series = lambert_w_singularity_series(T(-sqrt(p2))); - if (std::numeric_limits::digits > 53) + if (boost::math::tools::digits() > 53) { // Multiprecision, so try a Halley refinement. w_series = lambert_w_detail::lambert_w_halley_iterate(w_series, z); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN @@ -1864,7 +1864,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) } // Z too small so use approximation and Halley. // Else Use a lookup table to find the nearest integer part of Lambert W-1 as starting point for Bisection. - if (std::numeric_limits::digits > 53) + if (boost::math::tools::digits() > 53) { // T is more precise than 64-bit double (or long double, or ?), // so compute an approximate value using only one Schroeder refinement, // (avoiding any double-precision Halley refinement from policy double_digits2<50> 53 - 3 = 50 @@ -1874,7 +1874,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) using boost::math::policies::digits2; using boost::math::policies::policy; // Compute a 50-bit precision approximate W0 in a double (no Halley refinement). - T double_approx(lambert_wm1_imp(must_reduce_to_double(z, boost::is_constructible()), policy >())); + T double_approx(static_cast(lambert_wm1_imp(must_reduce_to_double(z, boost::is_constructible()), policy >()))); #ifdef BOOST_MATH_INSTRUMENT_LAMBERT_WM1_NOT_BUILTIN std::streamsize saved_precision = std::cout.precision(std::numeric_limits::max_digits10); std::cout << "Lambert_wm1 Argument Type " << typeid(T).name() << " approximation double = " << double_approx << std::endl; @@ -2085,7 +2085,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) // Of course on the real line, it's just undefined. if (z == - boost::math::constants::exp_minus_one()) { - return numeric_limits::infinity(); + return numeric_limits::has_infinity ? numeric_limits::infinity() : boost::math::tools::max_value(); } // if z < -1/e, we'll let lambert_w0 do the error handling: result_type w = lambert_w0(result_type(z), pol); @@ -2119,7 +2119,7 @@ T lambert_wm1_imp(const T z, const Policy& pol) //if (z == - boost::math::constants::exp_minus_one()) if (z == 0 || z == - boost::math::constants::exp_minus_one()) { - return -numeric_limits::infinity(); + return numeric_limits::has_infinity ? -numeric_limits::infinity() : -boost::math::tools::max_value(); } result_type w = lambert_wm1(z, pol); diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index 6234f6f87..e2f281a1f 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -39,6 +39,8 @@ using boost::multiprecision::cpp_dec_float_50; #include using boost::multiprecision::cpp_bin_float_quad; +#include + #ifdef BOOST_MATH_TEST_FLOAT128 #ifdef BOOST_HAS_FLOAT128 @@ -167,7 +169,7 @@ void wolfram_test_moderate_values() tolerance *= 4; // arbitrary precision types have lower accuracy on exp(z). for (unsigned i = 0; i < wolfram_test_small_neg.size(); ++i) { - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_small_neg[i][0]), wolfram_test_small_neg[i][1], tolerance); + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(T(wolfram_test_small_neg[i][0])), T(wolfram_test_small_neg[i][1]), tolerance); } } @@ -186,7 +188,7 @@ void wolfram_test_small_pos() tolerance *= 3; // arbitrary precision types have lower accuracy on exp(z). for (unsigned i = 0; i < wolfram_test_small_neg.size(); ++i) { - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_small_neg[i][0]), wolfram_test_small_neg[i][1], tolerance); + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(T(wolfram_test_small_neg[i][0])), T(wolfram_test_small_neg[i][1]), tolerance); } } @@ -206,7 +208,7 @@ void wolfram_test_small_neg() tolerance *= 3; // arbitrary precision types have lower accuracy on exp(z). for (unsigned i = 0; i < wolfram_test_small_neg.size(); ++i) { - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_small_neg[i][0]), wolfram_test_small_neg[i][1], tolerance); + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(T(wolfram_test_small_neg[i][0])), T(wolfram_test_small_neg[i][1]), tolerance); } } @@ -225,7 +227,7 @@ void wolfram_test_large(const boost::mpl::true_&) tolerance *= 3; // arbitrary precision types have lower accuracy on exp(z). for (unsigned i = 0; i < wolfram_test_large_data.size(); ++i) { - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_large_data[i][0]), wolfram_test_large_data[i][1], tolerance); + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(T(wolfram_test_large_data[i][0])), T(wolfram_test_large_data[i][1]), tolerance); } } template @@ -249,7 +251,7 @@ void wolfram_test_near_singularity() { { SC_(-0.11787944117144233402427744294982403516769409179688), SC_(-0.13490446826612137099065142885543349308605449591189) } },{ { SC_(-0.24287944117144233402427744294982403516769409179688), SC_(-0.34187241316000575559631565516533717918703951393828) } },{ { SC_(-0.30537944117144233402427744294982403516769409179688), SC_(-0.50704532478540670242736394530166187052909039079642) } },{ { SC_(-0.33662944117144233402427744294982403516769409179688), SC_(-0.63562321628494791544895212508757067989859372121549) } },{ { SC_(-0.35225444117144233402427744294982403516769409179688), SC_(-0.73357201771558852140844624841371893543359405991894) } },{ { SC_(-0.36006694117144233402427744294982403516769409179688), SC_(-0.80685912552602238275976720505076149562188136941981) } },{ { SC_(-0.36397319117144233402427744294982403516769409179688), SC_(-0.86091151614390373770305184939107560322835214525382) } },{ { SC_(-0.36592631617144233402427744294982403516769409179688), SC_(-0.90033567669608907987528169545609510444951296636737) } },{ { SC_(-0.36690287867144233402427744294982403516769409179688), SC_(-0.92884889586304130900291705545970353898661233095513) } },{ { SC_(-0.36739115992144233402427744294982403516769409179688), SC_(-0.94934196763921122756108351994184213101752011076782) } },{ { SC_(-0.36763530054644233402427744294982403516769409179688), SC_(-0.96400324129495105632485735566132352543383271582526) } },{ { SC_(-0.36775737085894233402427744294982403516769409179688), SC_(-0.97445736712728703357755243595334553847237474201138) } },{ { SC_(-0.36781840601519233402427744294982403516769409179688), SC_(-0.98189372378619472154195350108189165241865132390473) } },{ { SC_(-0.36784892359331733402427744294982403516769409179688), SC_(-0.98717434434269671591894280580432721487757138768109) } },{ { SC_(-0.36786418238237983402427744294982403516769409179688), SC_(-0.99091955260257317141206161906086819616043312707614) } },{ { SC_(-0.36787181177691108402427744294982403516769409179688), SC_(-0.99357346775773151586057357459040504547191256911173) } },{ { SC_(-0.36787562647417670902427744294982403516769409179688), SC_(-0.99545290640175819861266174073519228782773422561472) } },{ { SC_(-0.36787753382280952152427744294982403516769409179688), SC_(-0.99678329264937600678258333756796350065436689760936) } },{ { SC_(-0.36787848749712592777427744294982403516769409179688), SC_(-0.99772473035978895659981485126201758865515569761514) } },{ { SC_(-0.36787896433428413089927744294982403516769409179688), SC_(-0.99839078411548014765525278348680286544429555739338) } },{ { SC_(-0.36787920275286323246177744294982403516769409179688), SC_(-0.99886193379608135520603487963907992157933985302350) } },{ { SC_(-0.36787932196215278324302744294982403516769409179688), SC_(-0.99919517626703684624524893082905669989578841060892) } },{ { SC_(-0.36787938156679755863365244294982403516769409179688), SC_(-0.99943085896775657378245957087668418410735469441835) } },{ { SC_(-0.36787941136911994632896494294982403516769409179688), SC_(-0.99959753415605033951327478977234592072050509074480) } },{ { SC_(-0.36787942627028114017662119294982403516769409179688), SC_(-0.99971540249082798050505534900918173321899800190957) } },{ { SC_(-0.36787943372086173710044931794982403516769409179688), SC_(-0.99979875358003464529770521637722571161846456343102) } },{ { SC_(-0.36787943744615203556236338044982403516769409179688), SC_(-0.99985769449598686744630754715710430111838645655608) } },{ { SC_(-0.36787943930879718479332041169982403516769409179688), SC_(-0.99989937341527312969776294577792175610005161268265) } },{ { SC_(-0.36787944024011975940879892732482403516769409179688), SC_(-0.99992884556078314715423832743355922518662235135757) } },{ { SC_(-0.36787944070578104671653818513732403516769409179688), SC_(-0.99994968586433278794146581248117772412549843583586) } },{ { SC_(-0.36787944093861169037040781404357403516769409179688), SC_(-0.99996442235919152892644019456912452486892832990114) } },{ { SC_(-0.36787944105502701219734262849669903516769409179688), SC_(-0.99997484272221444495021480907850566954322542216868) } },{ { SC_(-0.36787944111323467311081003572326153516769409179688), SC_(-0.99998221107553951227244139186618591264285119372063) } },{ { SC_(-0.36787944114233850356754373933654278516769409179688), SC_(-0.99998742131038091608107093454795869661238860012568) } },{ { SC_(-0.36787944115689041879591059114318341016769409179688), SC_(-0.99999110551424805741455916942650424910940130482916) } },{ { SC_(-0.36787944116416637641009401704650372266769409179688), SC_(-0.99999371064603396347995131962984747427523504609782) } },{ { SC_(-0.36787944116780435521718572999816387891769409179688), SC_(-0.99999555275622895023796382943893319302015254415029) } },{ { SC_(-0.36787944116962334462073158647399395704269409179688), SC_(-0.99999685532777825691586263781552103878671869687024) } },{ { SC_(-0.36787944117053283932250451471190899610519409179688), SC_(-0.99999777638786151731498560321162974199505119200634) } } }}; T tolerance = boost::math::tools::epsilon() * 3; - if (std::numeric_limits::digits >= std::numeric_limits::digits) + if (boost::math::tools::epsilon() <= boost::math::tools::epsilon()) tolerance *= 5e5; T endpoint = -boost::math::constants::exp_minus_one(); for (unsigned i = 0; i < wolfram_test_near_singularity_data.size(); ++i) @@ -257,7 +259,7 @@ void wolfram_test_near_singularity() if (wolfram_test_near_singularity_data[i][0] <= endpoint) break; else - BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(wolfram_test_near_singularity_data[i][0]), wolfram_test_near_singularity_data[i][1], tolerance); + BOOST_CHECK_CLOSE_FRACTION(boost::math::lambert_w0(T(wolfram_test_near_singularity_data[i][0])), T(wolfram_test_near_singularity_data[i][1]), tolerance); } } @@ -336,11 +338,14 @@ void test_spots(RealType) #ifndef BOOST_NO_EXCEPTIONS BOOST_CHECK_THROW(lambert_w0(-1.), std::domain_error); BOOST_CHECK_THROW(lambert_wm1(-1.), std::domain_error); - BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. - //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy()), std::numeric_limits::quiet_NaN()); // Should be NaN. - // Fails as NaN != NaN by definition. - BOOST_CHECK(boost::math::isnan(lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy()))); - //BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::infinity(), ignore_all_policy()), std::numeric_limits::has_quiet_NaN) + { + BOOST_CHECK_THROW(lambert_w0(std::numeric_limits::quiet_NaN()), std::domain_error); // Would be NaN. + //BOOST_CHECK_EQUAL(lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy()), std::numeric_limits::quiet_NaN()); // Should be NaN. + // Fails as NaN != NaN by definition. + BOOST_CHECK(boost::math::isnan(lambert_w0(std::numeric_limits::quiet_NaN(), ignore_all_policy()))); + //BOOST_MATH_CHECK_EQUAL(boost::math::lambert_w0(std::numeric_limits::infinity(), ignore_all_policy()), std::numeric_limits(std::numeric_limits::infinity()), std::domain_error); // Was if infinity should throw, now infinity. BOOST_CHECK_THROW(lambert_w0(-static_cast(0.4)), std::domain_error); // Would be complex. @@ -803,11 +808,15 @@ BOOST_AUTO_TEST_CASE( test_types ) // Fundamental built-in types: test_spots(0.0F); // float test_spots(0.0); // double +#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS if (sizeof(long double) > sizeof(double)) { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). test_spots(0.0L); // long double } + test_spots(boost::math::concepts::real_concept(0)); +#endif + #else // BOOST_MATH_TEST_MULTIPRECISION // Multiprecision types: #if BOOST_MATH_TEST_MULTIPRECISION == 1 From 8004239d234ab2a5197c15f46d8a5e8690251382 Mon Sep 17 00:00:00 2001 From: Nick Thompson Date: Fri, 31 Aug 2018 09:37:00 +0800 Subject: [PATCH 68/71] [CI SKIP] Fix build error by explicitly changing float128 to boost::multiprecision::float128 --- test/test_lambert_w_integrals_float128.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/test/test_lambert_w_integrals_float128.cpp b/test/test_lambert_w_integrals_float128.cpp index 44f19a382..1010b138d 100644 --- a/test/test_lambert_w_integrals_float128.cpp +++ b/test/test_lambert_w_integrals_float128.cpp @@ -261,7 +261,7 @@ Real x; } */ - test_integrals(); + test_integrals(); } catch (std::exception& ex) { From 02c7df005d6914803ab0b2f5409066f8be16e6a1 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Fri, 31 Aug 2018 09:56:03 +0100 Subject: [PATCH 69/71] LambertW: Fix more CI failures: Add fallback for 128-bit lambertW implementation. Disable real_concept tests for msvc-12 and earlier as the compiler can't cope. --- include/boost/math/special_functions/lambert_w.hpp | 9 +++++++++ test/test_lambert_w.cpp | 4 +++- 2 files changed, 12 insertions(+), 1 deletion(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index d5c5fb81b..b026dfca4 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -775,6 +775,15 @@ T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<4> const&) return result; } // T lambert_w0_small_z(const T z, boost::mpl::int_<4> const&) float128 + +#else + +template +inline T lambert_w0_small_z(const T z, boost::mpl::int_<4> const&) +{ + return lambert_w0_small_z(z, boost::mpl::int_<5>()); +} + #endif // BOOST_HAS_FLOAT128 //! Series functor to compute series term using pow and factorial. diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index e2f281a1f..cc0bb4763 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -813,8 +813,10 @@ BOOST_AUTO_TEST_CASE( test_types ) { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). test_spots(0.0L); // long double } - +#if !BOOST_WORKAROUND(BOOST_MSVC, < 1900) + // msvc-12 and earlier can't cope with all the function scope statics, disable for now. test_spots(boost::math::concepts::real_concept(0)); +#endif #endif #else // BOOST_MATH_TEST_MULTIPRECISION From 79871fe747bc69c459975513c84516c5b80db76b Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Fri, 31 Aug 2018 19:53:34 +0100 Subject: [PATCH 70/71] LambertW: CI fixes. Fix definition of lambert_w0_small_z_series_term. Move rational approximations into smaller functions to try and keep msvc happy. --- .../math/special_functions/lambert_w.hpp | 1134 +++++++++-------- test/test_lambert_w.cpp | 3 - 2 files changed, 581 insertions(+), 556 deletions(-) diff --git a/include/boost/math/special_functions/lambert_w.hpp b/include/boost/math/special_functions/lambert_w.hpp index b026dfca4..435a703f3 100644 --- a/include/boost/math/special_functions/lambert_w.hpp +++ b/include/boost/math/special_functions/lambert_w.hpp @@ -778,10 +778,10 @@ T lambert_w0_small_z(const T z, const Policy&, boost::mpl::int_<4> const&) #else -template -inline T lambert_w0_small_z(const T z, boost::mpl::int_<4> const&) +template +inline T lambert_w0_small_z(const T z, const Policy& pol, boost::mpl::int_<4> const&) { - return lambert_w0_small_z(z, boost::mpl::int_<5>()); + return lambert_w0_small_z(z, pol, boost::mpl::int_<5>()); } #endif // BOOST_HAS_FLOAT128 @@ -1012,6 +1012,208 @@ inline double get_near_singularity_param(double z) //template //T lambert_w0_imp(T w, const Policy& pol, const mpl::int_<2>&); // 80-bit long double. +template +T lambert_w_positive_rational_float(T z) +{ + BOOST_MATH_STD_USING + if (z < 2) + { + if (z < 0.5) + { // 0.05 < z < 0.5 + // Maximum Deviation Found: 2.993e-08 + // Expected Error Term : 2.993e-08 + // Maximum Relative Change in Control Points : 7.555e-04 Y offset : -8.196592331e-01 + static const T Y = 8.196592331e-01f; + static const T P[] = { + 1.803388345e-01f, + -4.820256838e-01f, + -1.068349741e+00f, + -3.506624319e-02f, + }; + static const T Q[] = { + 1.000000000e+00f, + 2.871703469e+00f, + 1.690949264e+00f, + }; + return z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z)); + } + else + { // 0.5 < z < 2 + // Max error in interpolated form: 1.018e-08 + static const T Y = 5.503368378e-01f; + static const T P[] = { + 4.493332766e-01f, + 2.543432707e-01f, + -4.808788799e-01f, + -1.244425316e-01f, + }; + static const T Q[] = { + 1.000000000e+00f, + 2.780661241e+00f, + 1.830840318e+00f, + 2.407221031e-01f, + }; + return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); + } + } + else if (z < 6) + { + // 2 < z < 6 + // Max error in interpolated form: 2.944e-08 + static const T Y = 1.162393570e+00f; + static const T P[] = { + -1.144183394e+00f, + -4.712732855e-01f, + 1.563162512e-01f, + 1.434010911e-02f, + }; + static const T Q[] = { + 1.000000000e+00f, + 1.192626340e+00f, + 2.295580708e-01f, + 5.477869455e-03f, + }; + return Y + boost::math::tools::evaluate_rational(P, Q, z); + } + else if (z < 18) + { + // 6 < z < 18 + // Max error in interpolated form: 5.893e-08 + static const T Y = 1.809371948e+00f; + static const T P[] = { + -1.689291769e+00f, + -3.337812742e-01f, + 3.151434873e-02f, + 1.134178734e-03f, + }; + static const T Q[] = { + 1.000000000e+00f, + 5.716915685e-01f, + 4.489521292e-02f, + 4.076716763e-04f, + }; + return Y + boost::math::tools::evaluate_rational(P, Q, z); + } + else if (z < 9897.12905874) // 2.8 < log(z) < 9.2 + { + // Max error in interpolated form: 1.771e-08 + static const T Y = -1.402973175e+00f; + static const T P[] = { + 1.966174312e+00f, + 2.350864728e-01f, + -5.098074353e-02f, + -1.054818339e-02f, + }; + static const T Q[] = { + 1.000000000e+00f, + 4.388208264e-01f, + 8.316639634e-02f, + 3.397187918e-03f, + -1.321489743e-05f, + }; + T log_w = log(z); + return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w); + } + else if (z < 7.896296e+13) // 9.2 < log(z) <= 32 + { + // Max error in interpolated form: 5.821e-08 + static const T Y = -2.735729218e+00f; + static const T P[] = { + 3.424903470e+00f, + 7.525631787e-02f, + -1.427309584e-02f, + -1.435974178e-05f, + }; + static const T Q[] = { + 1.000000000e+00f, + 2.514005579e-01f, + 6.118994652e-03f, + -1.357889535e-05f, + 7.312865624e-08f, + }; + T log_w = log(z); + return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w); + } + else // 32 < log(z) < 100 + { + // Max error in interpolated form: 1.491e-08 + static const T Y = -4.012863159e+00f; + static const T P[] = { + 4.431629226e+00f, + 2.756690487e-01f, + -2.992956930e-03f, + -4.912259384e-05f, + }; + static const T Q[] = { + 1.000000000e+00f, + 2.015434591e-01f, + 4.949426142e-03f, + 1.609659944e-05f, + -5.111523436e-09f, + }; + T log_w = log(z); + return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w); + } +} + +template +T lambert_w_negative_rational_float(T z, const Policy& pol) +{ + BOOST_MATH_STD_USING + if (z > -0.27) + { + if (z < -0.051) + { + // -0.27 < z < -0.051 + // Max error in interpolated form: 5.080e-08 + static const T Y = 1.255809784e+00f; + static const T P[] = { + -2.558083412e-01f, + -2.306524098e+00f, + -5.630887033e+00f, + -3.803974556e+00f, + }; + static const T Q[] = { + 1.000000000e+00f, + 5.107680783e+00f, + 7.914062868e+00f, + 3.501498501e+00f, + }; + return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); + } + else + { + // Very small z so use a series function. + return lambert_w0_small_z(z, pol); + } + } + else if (z > -0.3578794411714423215955237701) + { // Very close to branch singularity. + // Max error in interpolated form: 5.269e-08 + static const T Y = 1.220928431e-01f; + static const T P[] = { + -1.221787446e-01f, + -6.816155875e+00f, + 7.144582035e+01f, + 1.128444390e+03f, + }; + static const T Q[] = { + 1.000000000e+00f, + 6.480326790e+01f, + 1.869145243e+02f, + -1.361804274e+03f, + 1.117826726e+03f, + }; + T d = z + 0.367879441171442321595523770161460867445811f; + return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d)); + } + else + { + // z is very close (within 0.01) of the singularity at e^-1. + return lambert_w_singularity_series(get_near_singularity_param(z)); + } +} + //! Lambert_w0 @b 'float' implementation, selected when T is 32-bit precision. template inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) @@ -1029,209 +1231,387 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) } if (z >= 0.05) // Fukushima switch point. - // if (z >= 0.045) // 34 terms makes 128-bit 'exact' below 0.045. - { // Normal ranges using several rational polynomials. - if (z < 2) - { - if (z < 0.5) - { // 0.05 < z < 0.5 - // Maximum Deviation Found: 2.993e-08 - // Expected Error Term : 2.993e-08 - // Maximum Relative Change in Control Points : 7.555e-04 Y offset : -8.196592331e-01 - static const T Y = 8.196592331e-01f; - static const T P[] = { - 1.803388345e-01f, - -4.820256838e-01f, - -1.068349741e+00f, - -3.506624319e-02f, - }; - static const T Q[] = { - 1.000000000e+00f, - 2.871703469e+00f, - 1.690949264e+00f, - }; - return z * (Y + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z)); - } - else - { // 0.5 < z < 2 - // Max error in interpolated form: 1.018e-08 - static const T Y = 5.503368378e-01f; - static const T P[] = { - 4.493332766e-01f, - 2.543432707e-01f, - -4.808788799e-01f, - -1.244425316e-01f, - }; - static const T Q[] = { - 1.000000000e+00f, - 2.780661241e+00f, - 1.830840318e+00f, - 2.407221031e-01f, - }; - return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); - } - } - else if (z < 6) - { - // 2 < z < 6 - // Max error in interpolated form: 2.944e-08 - static const T Y = 1.162393570e+00f; - static const T P[] = { - -1.144183394e+00f, - -4.712732855e-01f, - 1.563162512e-01f, - 1.434010911e-02f, - }; - static const T Q[] = { - 1.000000000e+00f, - 1.192626340e+00f, - 2.295580708e-01f, - 5.477869455e-03f, - }; - return Y + boost::math::tools::evaluate_rational(P, Q, z); - } - else if (z < 18) - { - // 6 < z < 18 - // Max error in interpolated form: 5.893e-08 - static const T Y = 1.809371948e+00f; - static const T P[] = { - -1.689291769e+00f, - -3.337812742e-01f, - 3.151434873e-02f, - 1.134178734e-03f, - }; - static const T Q[] = { - 1.000000000e+00f, - 5.716915685e-01f, - 4.489521292e-02f, - 4.076716763e-04f, - }; - return Y + boost::math::tools::evaluate_rational(P, Q, z); - } - else if (z < 9897.12905874) // 2.8 < log(z) < 9.2 - { - // Max error in interpolated form: 1.771e-08 - static const T Y = -1.402973175e+00f; - static const T P[] = { - 1.966174312e+00f, - 2.350864728e-01f, - -5.098074353e-02f, - -1.054818339e-02f, - }; - static const T Q[] = { - 1.000000000e+00f, - 4.388208264e-01f, - 8.316639634e-02f, - 3.397187918e-03f, - -1.321489743e-05f, - }; - T log_w = log(z); - return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w); - } - else if (z < 7.896296e+13) // 9.2 < log(z) <= 32 - { - // Max error in interpolated form: 5.821e-08 - static const T Y = -2.735729218e+00f; - static const T P[] = { - 3.424903470e+00f, - 7.525631787e-02f, - -1.427309584e-02f, - -1.435974178e-05f, - }; - static const T Q[] = { - 1.000000000e+00f, - 2.514005579e-01f, - 6.118994652e-03f, - -1.357889535e-05f, - 7.312865624e-08f, - }; - T log_w = log(z); - return log_w + Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w); - } - else // 32 < log(z) < 100 - { - // Max error in interpolated form: 1.491e-08 - static const T Y = -4.012863159e+00f; - static const T P[] = { - 4.431629226e+00f, - 2.756690487e-01f, - -2.992956930e-03f, - -4.912259384e-05f, - }; - static const T Q[] = { - 1.000000000e+00f, - 2.015434591e-01f, - 4.949426142e-03f, - 1.609659944e-05f, - -5.111523436e-09f, - }; - T log_w = log(z); - return log_w+ Y + boost::math::tools::evaluate_polynomial(P, log_w) / boost::math::tools::evaluate_polynomial(Q, log_w); - } + // if (z >= 0.045) // 34 terms makes 128-bit 'exact' below 0.045. + { // Normal ranges using several rational polynomials. + return lambert_w_positive_rational_float(z); + } + else if (z <= -0.3678794411714423215955237701614608674458111310f) + { + if (z < -0.3678794411714423215955237701614608674458111310f) + return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol); + return -1; } else // z < 0.05 { - if (z > -0.27) + return lambert_w_negative_rational_float(z, pol); + } +} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit usually float. + +template +T lambert_w_positive_rational_double(T z) +{ + BOOST_MATH_STD_USING + if (z < 2) + { + if (z < 0.5) { - if (z < -0.051) - { - // -0.27 < z < -0.051 - // Max error in interpolated form: 5.080e-08 - static const T Y = 1.255809784e+00f; - static const T P[] = { - -2.558083412e-01f, - -2.306524098e+00f, - -5.630887033e+00f, - -3.803974556e+00f, - }; - static const T Q[] = { - 1.000000000e+00f, - 5.107680783e+00f, - 7.914062868e+00f, - 3.501498501e+00f, - }; - return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); - } - else - { - // Very small z so use a series function. - return lambert_w0_small_z(z, pol); - } - } - else if (z > -0.3578794411714423215955237701) - { // Very close to branch singularity. - // Max error in interpolated form: 5.269e-08 - static const T Y = 1.220928431e-01f; + // Max error in interpolated form: 2.255e-17 + static const T offset = 8.19659233093261719e-01; static const T P[] = { - -1.221787446e-01f, - -6.816155875e+00f, - 7.144582035e+01f, - 1.128444390e+03f, + 1.80340766906685177e-01, + 3.28178241493119307e-01, + -2.19153620687139706e+00, + -7.24750929074563990e+00, + -7.28395876262524204e+00, + -2.57417169492512916e+00, + -2.31606948888704503e-01 }; static const T Q[] = { - 1.000000000e+00f, - 6.480326790e+01f, - 1.869145243e+02f, - -1.361804274e+03f, - 1.117826726e+03f, + 1.00000000000000000e+00, + 7.36482529307436604e+00, + 2.03686007856430677e+01, + 2.62864592096657307e+01, + 1.59742041380858333e+01, + 4.03760534788374589e+00, + 2.91327346750475362e-01 }; - T d = z + 0.367879441171442321595523770161460867445811f; - return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d)); - } - else if (z <= -0.3678794411714423215955237701614608674458111310f) - { - if (z < -0.3678794411714423215955237701614608674458111310f) - return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol); - return -1; + return z * (offset + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z)); } else { - // z is very close (within 0.01) of the singularity at e^-1. - return lambert_w_singularity_series(get_near_singularity_param(z)); + // Max error in interpolated form: 3.806e-18 + static const T offset = 5.50335884094238281e-01; + static const T P[] = { + 4.49664083944098322e-01, + 1.90417666196776909e+00, + 1.99951368798255994e+00, + -6.91217310299270265e-01, + -1.88533935998617058e+00, + -7.96743968047750836e-01, + -1.02891726031055254e-01, + -3.09156013592636568e-03 + }; + static const T Q[] = { + 1.00000000000000000e+00, + 6.45854489419584014e+00, + 1.54739232422116048e+01, + 1.72606164253337843e+01, + 9.29427055609544096e+00, + 2.29040824649748117e+00, + 2.21610620995418981e-01, + 5.70597669908194213e-03 + }; + return z * (offset + boost::math::tools::evaluate_rational(P, Q, z)); } } -} // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<1>&) for 32-bit usually float. + else if (z < 6) + { + // 2 < z < 6 + // Max error in interpolated form: 1.216e-17 + static const T Y = 1.16239356994628906e+00; + static const T P[] = { + -1.16230494982099475e+00, + -3.38528144432561136e+00, + -2.55653717293161565e+00, + -3.06755172989214189e-01, + 1.73149743765268289e-01, + 3.76906042860014206e-02, + 1.84552217624706666e-03, + 1.69434126904822116e-05, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 3.77187616711220819e+00, + 4.58799960260143701e+00, + 2.24101228462292447e+00, + 4.54794195426212385e-01, + 3.60761772095963982e-02, + 9.25176499518388571e-04, + 4.43611344705509378e-06, + }; + return Y + boost::math::tools::evaluate_rational(P, Q, z); + } + else if (z < 18) + { + // 6 < z < 18 + // Max error in interpolated form: 1.985e-19 + static const T offset = 1.80937194824218750e+00; + static const T P[] = + { + -1.80690935424793635e+00, + -3.66995929380314602e+00, + -1.93842957940149781e+00, + -2.94269984375794040e-01, + 1.81224710627677778e-03, + 2.48166798603547447e-03, + 1.15806592415397245e-04, + 1.43105573216815533e-06, + 3.47281483428369604e-09 + }; + static const T Q[] = { + 1.00000000000000000e+00, + 2.57319080723908597e+00, + 1.96724528442680658e+00, + 5.84501352882650722e-01, + 7.37152837939206240e-02, + 3.97368430940416778e-03, + 8.54941838187085088e-05, + 6.05713225608426678e-07, + 8.17517283816615732e-10 + }; + return offset + boost::math::tools::evaluate_rational(P, Q, z); + } + else if (z < 9897.12905874) // 2.8 < log(z) < 9.2 + { + // Max error in interpolated form: 1.195e-18 + static const T Y = -1.40297317504882812e+00; + static const T P[] = { + 1.97011826279311924e+00, + 1.05639945701546704e+00, + 3.33434529073196304e-01, + 3.34619153200386816e-02, + -5.36238353781326675e-03, + -2.43901294871308604e-03, + -2.13762095619085404e-04, + -4.85531936495542274e-06, + -2.02473518491905386e-08, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 8.60107275833921618e-01, + 4.10420467985504373e-01, + 1.18444884081994841e-01, + 2.16966505556021046e-02, + 2.24529766630769097e-03, + 9.82045090226437614e-05, + 1.36363515125489502e-06, + 3.44200749053237945e-09, + }; + T log_w = log(z); + return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); + } + else if (z < 7.896296e+13) // 9.2 < log(z) <= 32 + { + // Max error in interpolated form: 6.529e-18 + static const T Y = -2.73572921752929688e+00; + static const T P[] = { + 3.30547638424076217e+00, + 1.64050071277550167e+00, + 4.57149576470736039e-01, + 4.03821227745424840e-02, + -4.99664976882514362e-04, + -1.28527893803052956e-04, + -2.95470325373338738e-06, + -1.76662025550202762e-08, + -1.98721972463709290e-11, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 6.91472559412458759e-01, + 2.48154578891676774e-01, + 4.60893578284335263e-02, + 3.60207838982301946e-03, + 1.13001153242430471e-04, + 1.33690948263488455e-06, + 4.97253225968548872e-09, + 3.39460723731970550e-12, + }; + T log_w = log(z); + return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); + } + else if (z < 2.6881171e+43) // 32 < log(z) < 100 + { + // Max error in interpolated form: 2.015e-18 + static const T Y = -4.01286315917968750e+00; + static const T P[] = { + 5.07714858354309672e+00, + -3.32994414518701458e+00, + -8.61170416909864451e-01, + -4.01139705309486142e-02, + -1.85374201771834585e-04, + 1.08824145844270666e-05, + 1.17216905810452396e-07, + 2.97998248101385990e-10, + 1.42294856434176682e-13, + }; + static const T Q[] = { + 1.00000000000000000e+00, + -4.85840770639861485e-01, + -3.18714850604827580e-01, + -3.20966129264610534e-02, + -1.06276178044267895e-03, + -1.33597828642644955e-05, + -6.27900905346219472e-08, + -9.35271498075378319e-11, + -2.60648331090076845e-14, + }; + T log_w = log(z); + return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); + } + else // 100 < log(z) < 710 + { + // Max error in interpolated form: 5.277e-18 + static const T Y = -5.70115661621093750e+00; + static const T P[] = { + 6.42275660145116698e+00, + 1.33047964073367945e+00, + 6.72008923401652816e-02, + 1.16444069958125895e-03, + 7.06966760237470501e-06, + 5.48974896149039165e-09, + -7.00379652018853621e-11, + -1.89247635913659556e-13, + -1.55898770790170598e-16, + -4.06109208815303157e-20, + -2.21552699006496737e-24, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 3.34498588416632854e-01, + 2.51519862456384983e-02, + 6.81223810622416254e-04, + 7.94450897106903537e-06, + 4.30675039872881342e-08, + 1.10667669458467617e-10, + 1.31012240694192289e-13, + 6.53282047177727125e-17, + 1.11775518708172009e-20, + 3.78250395617836059e-25, + }; + T log_w = log(z); + return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); + } +} + +template +T lambert_w_negative_rational_double(T z, const Policy& pol) +{ + BOOST_MATH_STD_USING + if (z > -0.1) + { + if (z < -0.051) + { + // -0.1 < z < -0.051 + // Maximum Deviation Found: 4.402e-22 + // Expected Error Term : 4.240e-22 + // Maximum Relative Change in Control Points : 4.115e-03 + static const T Y = 1.08633995056152344e+00; + static const T P[] = { + -8.63399505615014331e-02, + -1.64303871814816464e+00, + -7.71247913918273738e+00, + -1.41014495545382454e+01, + -1.02269079949257616e+01, + -2.17236002836306691e+00, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 7.44775406945739243e+00, + 2.04392643087266541e+01, + 2.51001961077774193e+01, + 1.31256080849023319e+01, + 2.11640324843601588e+00, + }; + return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); + } + else + { + // Very small z > 0.051: + return lambert_w0_small_z(z, pol); + } + } + else if (z > -0.2) + { + // -0.2 < z < -0.1 + // Maximum Deviation Found: 2.898e-20 + // Expected Error Term : 2.873e-20 + // Maximum Relative Change in Control Points : 3.779e-04 + static const T Y = 1.20359611511230469e+00; + static const T P[] = { + -2.03596115108465635e-01, + -2.95029082937201859e+00, + -1.54287922188671648e+01, + -3.81185809571116965e+01, + -4.66384358235575985e+01, + -2.59282069989642468e+01, + -4.70140451266553279e+00, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 9.57921436074599929e+00, + 3.60988119290234377e+01, + 6.73977699505546007e+01, + 6.41104992068148823e+01, + 2.82060127225153607e+01, + 4.10677610657724330e+00, + }; + return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); + } + else if (z > -0.3178794411714423215955237) + { + // Max error in interpolated form: 6.996e-18 + static const T Y = 3.49680423736572266e-01; + static const T P[] = { + -3.49729841718749014e-01, + -6.28207407760709028e+01, + -2.57226178029669171e+03, + -2.50271008623093747e+04, + 1.11949239154711388e+05, + 1.85684566607844318e+06, + 4.80802490427638643e+06, + 2.76624752134636406e+06, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 1.82717661215113000e+02, + 8.00121119810280100e+03, + 1.06073266717010129e+05, + 3.22848993926057721e+05, + -8.05684814514171256e+05, + -2.59223192927265737e+06, + -5.61719645211570871e+05, + 6.27765369292636844e+04, + }; + T d = z + 0.367879441171442321595523770161460867445811; + return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d)); + } + else if (z > -0.3578794411714423215955237701) + { + // Max error in interpolated form: 1.404e-17 + static const T Y = 5.00126481056213379e-02; + static const T P[] = { + -5.00173570682372162e-02, + -4.44242461870072044e+01, + -9.51185533619946042e+03, + -5.88605699015429386e+05, + -1.90760843597427751e+06, + 5.79797663818311404e+08, + 1.11383352508459134e+10, + 5.67791253678716467e+10, + 6.32694500716584572e+10, + }; + static const T Q[] = { + 1.00000000000000000e+00, + 9.08910517489981551e+02, + 2.10170163753340133e+05, + 1.67858612416470327e+07, + 4.90435561733227953e+08, + 4.54978142622939917e+09, + 2.87716585708739168e+09, + -4.59414247951143131e+10, + -1.72845216404874299e+10, + }; + T d = z + 0.36787944117144232159552377016146086744581113103176804; + return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d)); + } + else + { // z is very close (within 0.01) of the singularity at -e^-1, + // so use a series expansion from R. M. Corless et al. + const T p2 = 2 * (boost::math::constants::e() * z + 1); + const T p = sqrt(p2); + return lambert_w_detail::lambert_w_singularity_series(p); + } +} //! Lambert_w0 @b 'double' implementation, selected when T is 64-bit precision. template @@ -1258,371 +1638,19 @@ inline T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&) if (z >= 0.05) { - if (z < 2) + return lambert_w_positive_rational_double(z); + } + else if (z <= -0.36787944117144232159552377016146086744581113103176804) // Precision is max_digits10(cpp_bin_float_50). + { + if (z < -0.36787944117144232159552377016146086744581113103176804) { - if (z < 0.5) - { - // Max error in interpolated form: 2.255e-17 - static const T offset = 8.19659233093261719e-01; - static const T P[] = { - 1.80340766906685177e-01, - 3.28178241493119307e-01, - -2.19153620687139706e+00, - -7.24750929074563990e+00, - -7.28395876262524204e+00, - -2.57417169492512916e+00, - -2.31606948888704503e-01 - }; - static const T Q[] = { - 1.00000000000000000e+00, - 7.36482529307436604e+00, - 2.03686007856430677e+01, - 2.62864592096657307e+01, - 1.59742041380858333e+01, - 4.03760534788374589e+00, - 2.91327346750475362e-01 - }; - return z * (offset + boost::math::tools::evaluate_polynomial(P, z) / boost::math::tools::evaluate_polynomial(Q, z)); - } - else - { - // Max error in interpolated form: 3.806e-18 - static const T offset = 5.50335884094238281e-01; - static const T P[] = { - 4.49664083944098322e-01, - 1.90417666196776909e+00, - 1.99951368798255994e+00, - -6.91217310299270265e-01, - -1.88533935998617058e+00, - -7.96743968047750836e-01, - -1.02891726031055254e-01, - -3.09156013592636568e-03 - }; - static const T Q[] = { - 1.00000000000000000e+00, - 6.45854489419584014e+00, - 1.54739232422116048e+01, - 1.72606164253337843e+01, - 9.29427055609544096e+00, - 2.29040824649748117e+00, - 2.21610620995418981e-01, - 5.70597669908194213e-03 - }; - return z * (offset + boost::math::tools::evaluate_rational(P, Q, z)); - } - } - else if (z < 6) - { - // 2 < z < 6 - // Max error in interpolated form: 1.216e-17 - static const T Y = 1.16239356994628906e+00; - static const T P[] = { - -1.16230494982099475e+00, - -3.38528144432561136e+00, - -2.55653717293161565e+00, - -3.06755172989214189e-01, - 1.73149743765268289e-01, - 3.76906042860014206e-02, - 1.84552217624706666e-03, - 1.69434126904822116e-05, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 3.77187616711220819e+00, - 4.58799960260143701e+00, - 2.24101228462292447e+00, - 4.54794195426212385e-01, - 3.60761772095963982e-02, - 9.25176499518388571e-04, - 4.43611344705509378e-06, - }; - return Y + boost::math::tools::evaluate_rational(P, Q, z); - } - else if (z < 18) - { - // 6 < z < 18 - // Max error in interpolated form: 1.985e-19 - static const T offset = 1.80937194824218750e+00; - static const T P[] = - { - -1.80690935424793635e+00, - -3.66995929380314602e+00, - -1.93842957940149781e+00, - -2.94269984375794040e-01, - 1.81224710627677778e-03, - 2.48166798603547447e-03, - 1.15806592415397245e-04, - 1.43105573216815533e-06, - 3.47281483428369604e-09 - }; - static const T Q[] = { - 1.00000000000000000e+00, - 2.57319080723908597e+00, - 1.96724528442680658e+00, - 5.84501352882650722e-01, - 7.37152837939206240e-02, - 3.97368430940416778e-03, - 8.54941838187085088e-05, - 6.05713225608426678e-07, - 8.17517283816615732e-10 - }; - return offset + boost::math::tools::evaluate_rational(P, Q, z); - } - else if (z < 9897.12905874) // 2.8 < log(z) < 9.2 - { - // Max error in interpolated form: 1.195e-18 - static const T Y = -1.40297317504882812e+00; - static const T P[] = { - 1.97011826279311924e+00, - 1.05639945701546704e+00, - 3.33434529073196304e-01, - 3.34619153200386816e-02, - -5.36238353781326675e-03, - -2.43901294871308604e-03, - -2.13762095619085404e-04, - -4.85531936495542274e-06, - -2.02473518491905386e-08, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 8.60107275833921618e-01, - 4.10420467985504373e-01, - 1.18444884081994841e-01, - 2.16966505556021046e-02, - 2.24529766630769097e-03, - 9.82045090226437614e-05, - 1.36363515125489502e-06, - 3.44200749053237945e-09, - }; - T log_w = log(z); - return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); - } - else if (z < 7.896296e+13) // 9.2 < log(z) <= 32 - { - // Max error in interpolated form: 6.529e-18 - static const T Y = -2.73572921752929688e+00; - static const T P[] = { - 3.30547638424076217e+00, - 1.64050071277550167e+00, - 4.57149576470736039e-01, - 4.03821227745424840e-02, - -4.99664976882514362e-04, - -1.28527893803052956e-04, - -2.95470325373338738e-06, - -1.76662025550202762e-08, - -1.98721972463709290e-11, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 6.91472559412458759e-01, - 2.48154578891676774e-01, - 4.60893578284335263e-02, - 3.60207838982301946e-03, - 1.13001153242430471e-04, - 1.33690948263488455e-06, - 4.97253225968548872e-09, - 3.39460723731970550e-12, - }; - T log_w = log(z); - return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); - } - else if (z < 2.6881171e+43) // 32 < log(z) < 100 - { - // Max error in interpolated form: 2.015e-18 - static const T Y = -4.01286315917968750e+00; - static const T P[] = { - 5.07714858354309672e+00, - -3.32994414518701458e+00, - -8.61170416909864451e-01, - -4.01139705309486142e-02, - -1.85374201771834585e-04, - 1.08824145844270666e-05, - 1.17216905810452396e-07, - 2.97998248101385990e-10, - 1.42294856434176682e-13, - }; - static const T Q[] = { - 1.00000000000000000e+00, - -4.85840770639861485e-01, - -3.18714850604827580e-01, - -3.20966129264610534e-02, - -1.06276178044267895e-03, - -1.33597828642644955e-05, - -6.27900905346219472e-08, - -9.35271498075378319e-11, - -2.60648331090076845e-14, - }; - T log_w = log(z); - return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); - } - else // 100 < log(z) < 710 - { - // Max error in interpolated form: 5.277e-18 - static const T Y = -5.70115661621093750e+00; - static const T P[] = { - 6.42275660145116698e+00, - 1.33047964073367945e+00, - 6.72008923401652816e-02, - 1.16444069958125895e-03, - 7.06966760237470501e-06, - 5.48974896149039165e-09, - -7.00379652018853621e-11, - -1.89247635913659556e-13, - -1.55898770790170598e-16, - -4.06109208815303157e-20, - -2.21552699006496737e-24, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 3.34498588416632854e-01, - 2.51519862456384983e-02, - 6.81223810622416254e-04, - 7.94450897106903537e-06, - 4.30675039872881342e-08, - 1.10667669458467617e-10, - 1.31012240694192289e-13, - 6.53282047177727125e-17, - 1.11775518708172009e-20, - 3.78250395617836059e-25, - }; - T log_w = log(z); - return log_w + Y + boost::math::tools::evaluate_rational(P, Q, log_w); + return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol); } + return -1; } else { - if (z > -0.1) - { - if (z < -0.051) - { - // -0.1 < z < -0.051 - // Maximum Deviation Found: 4.402e-22 - // Expected Error Term : 4.240e-22 - // Maximum Relative Change in Control Points : 4.115e-03 - static const T Y = 1.08633995056152344e+00; - static const T P[] = { - -8.63399505615014331e-02, - -1.64303871814816464e+00, - -7.71247913918273738e+00, - -1.41014495545382454e+01, - -1.02269079949257616e+01, - -2.17236002836306691e+00, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 7.44775406945739243e+00, - 2.04392643087266541e+01, - 2.51001961077774193e+01, - 1.31256080849023319e+01, - 2.11640324843601588e+00, - }; - return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); - } - else - { - // Very small z > 0.051: - return lambert_w0_small_z(z, pol); - } - } - else if (z > -0.2) - { - // -0.2 < z < -0.1 - // Maximum Deviation Found: 2.898e-20 - // Expected Error Term : 2.873e-20 - // Maximum Relative Change in Control Points : 3.779e-04 - static const T Y = 1.20359611511230469e+00; - static const T P[] = { - -2.03596115108465635e-01, - -2.95029082937201859e+00, - -1.54287922188671648e+01, - -3.81185809571116965e+01, - -4.66384358235575985e+01, - -2.59282069989642468e+01, - -4.70140451266553279e+00, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 9.57921436074599929e+00, - 3.60988119290234377e+01, - 6.73977699505546007e+01, - 6.41104992068148823e+01, - 2.82060127225153607e+01, - 4.10677610657724330e+00, - }; - return z * (Y + boost::math::tools::evaluate_rational(P, Q, z)); - } - else if (z > -0.3178794411714423215955237) - { - // Max error in interpolated form: 6.996e-18 - static const T Y = 3.49680423736572266e-01; - static const T P[] = { - -3.49729841718749014e-01, - -6.28207407760709028e+01, - -2.57226178029669171e+03, - -2.50271008623093747e+04, - 1.11949239154711388e+05, - 1.85684566607844318e+06, - 4.80802490427638643e+06, - 2.76624752134636406e+06, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 1.82717661215113000e+02, - 8.00121119810280100e+03, - 1.06073266717010129e+05, - 3.22848993926057721e+05, - -8.05684814514171256e+05, - -2.59223192927265737e+06, - -5.61719645211570871e+05, - 6.27765369292636844e+04, - }; - T d = z + 0.367879441171442321595523770161460867445811; - return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d)); - } - else if (z > -0.3578794411714423215955237701) - { - // Max error in interpolated form: 1.404e-17 - static const T Y = 5.00126481056213379e-02; - static const T P[] = { - -5.00173570682372162e-02, - -4.44242461870072044e+01, - -9.51185533619946042e+03, - -5.88605699015429386e+05, - -1.90760843597427751e+06, - 5.79797663818311404e+08, - 1.11383352508459134e+10, - 5.67791253678716467e+10, - 6.32694500716584572e+10, - }; - static const T Q[] = { - 1.00000000000000000e+00, - 9.08910517489981551e+02, - 2.10170163753340133e+05, - 1.67858612416470327e+07, - 4.90435561733227953e+08, - 4.54978142622939917e+09, - 2.87716585708739168e+09, - -4.59414247951143131e+10, - -1.72845216404874299e+10, - }; - T d = z + 0.36787944117144232159552377016146086744581113103176804; - return -d / (Y + boost::math::tools::evaluate_polynomial(P, d) / boost::math::tools::evaluate_polynomial(Q, d)); - } - else if (z <= -0.36787944117144232159552377016146086744581113103176804) // Precision is max_digits10(cpp_bin_float_50). - { - if (z < -0.36787944117144232159552377016146086744581113103176804) - { - return boost::math::policies::raise_domain_error(function, "Expected z >= -e^-1 (-0.367879...) but got %1%.", z, pol); - } - return -1; - } - else - { // z is very close (within 0.01) of the singularity at -e^-1, - // so use a series expansion from R. M. Corless et al. - const T p2 = 2 * (boost::math::constants::e() * z + 1); - const T p = sqrt(p2); - return lambert_w_detail::lambert_w_singularity_series(p); - } + return lambert_w_negative_rational_double(z, pol); } } // T lambert_w0_imp(T z, const Policy& pol, const mpl::int_<2>&) 64-bit precision, usually double. diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index cc0bb4763..fee3e3d1e 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -813,10 +813,7 @@ BOOST_AUTO_TEST_CASE( test_types ) { // Avoid pointless re-testing if double and long double are identical (for example, MSVC). test_spots(0.0L); // long double } -#if !BOOST_WORKAROUND(BOOST_MSVC, < 1900) - // msvc-12 and earlier can't cope with all the function scope statics, disable for now. test_spots(boost::math::concepts::real_concept(0)); -#endif #endif #else // BOOST_MATH_TEST_MULTIPRECISION From 3b7cbe6be69534c60e111f3675ec819d7257d3e0 Mon Sep 17 00:00:00 2001 From: jzmaddock Date: Sat, 1 Sep 2018 18:46:33 +0100 Subject: [PATCH 71/71] CI fixes: adjust lambertW expected error rates. --- test/test_lambert_w.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/test/test_lambert_w.cpp b/test/test_lambert_w.cpp index fee3e3d1e..b8a0502e6 100644 --- a/test/test_lambert_w.cpp +++ b/test/test_lambert_w.cpp @@ -274,7 +274,7 @@ void wolfram_test_near_singularity() {{ {{ -0.11787939071655273437500000000000000000000000000000f, -0.13490440151978599948261696847702203722148729212591f }},{{ -0.24287939071655273437500000000000000000000000000000f, -0.34187230524883404685074938529655332889057132590877f }},{{ -0.30537939071655273437500000000000000000000000000000f, -0.50704515484245965628066570100405225451296978841169f }},{{ -0.33662939071655273437500000000000000000000000000000f, -0.63562295482810970976475066480034941107064440641758f }},{{ -0.35225439071655273437500000000000000000000000000000f, -0.73357162334066102207977288738307124189083069773180f }},{{ -0.36006689071655273437500000000000000000000000000000f, -0.80685854013946199386910756662972252220827924037205f }},{{ -0.36397314071655273437500000000000000000000000000000f, -0.86091065811941702413570870801021404654934249886505f }},{{ -0.36592626571655273437500000000000000000000000000000f, -0.90033443111682454984393817004965279949925483847744f }},{{ -0.36690282821655273437500000000000000000000000000000f, -0.92884710067602836873486989954484681592392882968841f }},{{ -0.36739110946655273437500000000000000000000000000000f, -0.94933939406123900376318336910404763737960907662666f }},{{ -0.36763525009155273437500000000000000000000000000000f, -0.96399956611859464483214118051190513364901860207328f }},{{ -0.36775732040405273437500000000000000000000000000000f, -0.97445213361280651797731195324654593603807971082292f }},{{ -0.36781835556030273437500000000000000000000000000000f, -0.98188628650256330812037232517657284107351472091741f }},{{ -0.36784887313842773437500000000000000000000000000000f, -0.98716379155663346207408852364078406478772014890806f }},{{ -0.36786413192749023437500000000000000000000000000000f, -0.99090459761086986284393759319956676727684106186028f }},{{ -0.36787176132202148437500000000000000000000000000000f, -0.99355229825129408828026714426677096743753950457546f }},{{ -0.36787557601928710937500000000000000000000000000000f, -0.99542297991285328482403963994064328331346049089419f }},{{ -0.36787748336791992187500000000000000000000000000000f, -0.99674107062291256263133271694520294422529881114769f }},{{ -0.36787843704223632812500000000000000000000000000000f, -0.99766536478294767461296564658785293377699068226332f }},{{ -0.36787891387939453125000000000000000000000000000000f, -0.99830783438342654552199009076049244789994050996944f }},{{ -0.36787915229797363281250000000000000000000000000000f, -0.99874733565614076859582844941545958416543067187493f }},{{ -0.36787927150726318359375000000000000000000000000000f, -0.99903989590053869025356285499889881633845057984872f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }},{{ -0.36787939071655273437500000000000000000000000000000f, -0.99947635367299698033494423493356278945921228277354f }} }}; - float tolerance = boost::math::tools::epsilon() * 10; + float tolerance = boost::math::tools::epsilon() * 16; float endpoint = -boost::math::constants::exp_minus_one(); for (unsigned i = 0; i < wolfram_test_near_singularity_data.size(); ++i) {