diff --git a/doc/sf_and_dist/html/index.html b/doc/sf_and_dist/html/index.html index 8ad0bfd5f..a6057022a 100644 --- a/doc/sf_and_dist/html/index.html +++ b/doc/sf_and_dist/html/index.html @@ -1,6 +1,6 @@
- +Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow, - Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani +
Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow, + Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and Thijs van den Berg
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -488,7 +488,7 @@Last revised: October 21, 2009 at 14:25:43 GMT |
+Last revised: January 27, 2010 at 12:23:42 GMT |
| - | Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
+ Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
and Thijs van den Berg Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html b/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html index 3a6abe24d..9ecc00801 100644 --- a/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html +++ b/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html @@ -1,6 +1,6 @@ - +- + Implemention philosophy@@ -85,7 +85,7 @@ These could still provide sufficient accuracy for some speed-critical applications.- + Accuracy and Representation of Test Values@@ -130,7 +130,7 @@ binary value).- + Tolerance of Tests@@ -156,7 +156,7 @@ first that the suffix L is present, and then that the tolerance is big enough.- + Handling Unsuitable Arguments@@ -242,7 +242,7 @@ |
| - | Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
+ Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
and Thijs van den Berg
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html b/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html index a1384b304..25bdae3bb 100644 --- a/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html +++ b/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html @@ -1,6 +1,6 @@ - +- + Motivation@@ -98,7 +98,7 @@ functions divided by large powers into single (simpler) expressions. - + The Approximation@@ -160,7 +160,7 @@ |
Table 53. Optimal choices for N and g when computing with +
Table 53. Optimal choices for N and g when computing with guard digits (source: Pugh)
| - | Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
+ Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
and Thijs van den Berg
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html b/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html index 5d02ae374..b2475164d 100644 --- a/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html +++ b/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html @@ -1,6 +1,6 @@ - +- + General references@@ -91,7 +91,7 @@ Library (version 2), Walter E. Brown
-
+
Calculators*
that we found (and used to cross-check - as far as their widely-varying accuracy
allowed).
@@ -101,7 +101,7 @@
Binomial Probability Distribution Calculator.
|
| - | Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
+ Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
and Thijs van den Berg
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html b/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html index 144257eb4..a57c201f9 100644 --- a/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html +++ b/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html @@ -1,6 +1,6 @@ - +
- + The Impossibility of Zero Error@@ -109,8 +109,8 @@
- + Remez Step 1@@ -205,7 +205,7 @@ to 5.6x10-4.- + Remez Step 2@@ -234,7 +234,7 @@ In our example we perform multi-point exchange.- + Iteration
@@ -250,7 +250,7 @@
- + Rational Approximations@@ -299,7 +299,7 @@ number of terms overall.- + Practical Considerations@@ -407,7 +407,7 @@ desired minimax solution (5x10-4).- + Remez Method Checklist@@ -461,7 +461,7 @@- + References@@ -527,8 +527,8 @@
|