Last revised: September 02, 2018 at 07:28:45 GMT
Last revised: October 07, 2018 at 08:18:47 GMT
1 2 4 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
ln
- -location
more
- -msg
prime
required
- -riemann_zeta
A B C D E F G H I L M N O P Q R S T U W
A B C D E F G H I L N O P R S T U V W
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
ln
- -Locating Function Minima using Brent's algorithm
more
- -More complex example - Inverting the Elliptic Integrals
prime
required
- -Riemann Zeta Function
Setting the Maximum Interval Halvings and Memory Requirements
- +set_zero
@@ -7580,10 +7550,7 @@Using Boost.Multiprecision
- +Using C++11 Lambda's
diff --git a/doc/html/math_toolkit/barycentric.html b/doc/html/math_toolkit/barycentric.html index 37c3aadc6..f9f61560d 100644 --- a/doc/html/math_toolkit/barycentric.html +++ b/doc/html/math_toolkit/barycentric.html @@ -42,6 +42,8 @@ barycentric_rational(const Real* const x, const Real* const y, size_t n, size_t approximation_order = 3); Real operator()(Real x) const; + + Real prime(Real x) const; }; }} @@ -78,6 +80,11 @@double x = 2.3; double y = interpolant(x);+
+ and to evaluate its derivative use +
+double y = interpolant.prime(x); +
Although this algorithm is robust, it can surprise you. The main way this occurs is if the sample spacing at the endpoints is much larger than the spacing in @@ -87,7 +94,9 @@
The reference used for implementation of this algorithm is Barycentric - rational interpolation with no poles and a high rate of interpolation. + rational interpolation with no poles and a high rate of interpolation, + and the evaluation of the derivative is given by Some + New Aspects of Rational Interpolation.
- The function to minimise: a function object (functor) that should be - smooth over the range [min, max], with no maxima + The function to minimise: a function object (or C++ lambda) that should + be smooth over the range [min, max], with no maxima occurring in that interval.
This documentation aims to use of the following naming and formatting conventions. diff --git a/doc/html/math_toolkit/history1.html b/doc/html/math_toolkit/history1.html index fb6884eb5..da0fdba80 100644 --- a/doc/html/math_toolkit/history1.html +++ b/doc/html/math_toolkit/history1.html @@ -27,19 +27,69 @@ History and What's New
- Currently open bug reports can be viewed here. + Currently open bug reports can be viewed here.
- All bug reports including closed ones can be viewed here. + All bug reports including closed ones can be viewed here + and here.
erf(NaN).
+ See #141.
+ real
+ function in the global namespace. See PR131.
+ sinc approximations
+ and add better tests.
+ - Currently open bug reports can be viewed here. + Currently open bug reports can be viewed here.
- All bug reports including closed ones can be viewed here. + All bug reports including closed ones can be viewed here + and here.
erf(NaN).
+ See #141.
+ real
+ function in the global namespace. See PR131.
+ sinc approximations
+ and add better tests.
+ Boost.Math documentation is provided in both HTML and PDF formats. diff --git a/doc/html/math_toolkit/roots_deriv.html b/doc/html/math_toolkit/roots_deriv.html index 3c800181a..0b26a17ee 100644 --- a/doc/html/math_toolkit/roots_deriv.html +++ b/doc/html/math_toolkit/roots_deriv.html @@ -86,8 +86,8 @@
- Type F must be a callable function object that accepts one parameter - and returns a std::pair, + Type F must be a callable function object (or C++ lambda) that accepts + one parameter and returns a std::pair, std::tuple, boost::tuple or boost::fusion::tuple:
diff --git a/doc/html/math_toolkit/roots_noderiv/TOMS748.html b/doc/html/math_toolkit/roots_noderiv/TOMS748.html index 5486611d1..97111fba7 100644 --- a/doc/html/math_toolkit/roots_noderiv/TOMS748.html +++ b/doc/html/math_toolkit/roots_noderiv/TOMS748.html @@ -101,10 +101,10 @@
- A unary functor that is the function whose root is to be solved. f(x) - need not be uniformly increasing or decreasing on x - and may have multiple roots. However, the bounds given must bracket - a single root. + A unary functor (or C++ lambda) that is the function whose root is + to be solved. f(x) need not be uniformly increasing or decreasing on + x and may have multiple roots. However, the bounds + given must bracket a single root.
@@ -127,10 +127,10 @@
- A binary functor that determines the termination condition for the - search for the root. tol is passed the current - brackets at each step, when it returns true, then the current brackets - are returned as the result. See also predefined + A binary functor (or C++ lambda) that determines the termination condition + for the search for the root. tol is passed the + current brackets at each step, when it returns true, then the current + brackets are returned as the result. See also predefined termination functors.
- A unary functor which is the function f(x) whose - root is to be found. + A unary functor (or C++ lambda) which is the function f(x) + whose root is to be found.
@@ -85,9 +85,9 @@
- A binary functor that specifies the termination condition: the function - will return the current brackets enclosing the root when tol(min, - max) becomes true. See also predefined + A binary functor (or C++ lambda) that specifies the termination condition: + the function will return the current brackets enclosing the root when + tol(min, max) becomes true. See also predefined termination functors.
- A unary functor that is the function whose root is to be solved. f(x) - must be uniformly increasing or decreasing on x. + A unary functor (or C++ lambda) that is the function whose root is + to be solved. f(x) must be uniformly increasing + or decreasing on x.
@@ -116,10 +117,10 @@
- A binary functor that determines the termination condition for the - search for the root. tol is passed the current - brackets at each step, when it returns true then the current brackets - are returned as the pair result. See also predefined + A binary functor (or C++ lambda) that determines the termination condition + for the search for the root. tol is passed the + current brackets at each step, when it returns true then the current + brackets are returned as the pair result. See also predefined termination functors.