Imported Upstream version 1.72.0

[platform/upstream/boost.git] / libs / math / doc / html / math_toolkit / roots_deriv.html

diff --git a/libs/math/doc/html/math_toolkit/roots_deriv.html b/libs/math/doc/html/math_toolkit/roots_deriv.html
index 92bed1a..1cd1005 100644 (file)
--- a/libs/math/doc/html/math_toolkit/roots_deriv.html
+++ b/libs/math/doc/html/math_toolkit/roots_deriv.html
@@ -4,8 +4,8 @@
 <title>Root Finding With Derivatives: Newton-Raphson, Halley &amp; Schr&#246;der</title>
 <link rel="stylesheet" href="../math.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
-<link rel="home" href="../index.html" title="Math Toolkit 2.10.0">
-<link rel="up" href="../root_finding.html" title="Chapter&#160;9.&#160;Root Finding &amp; Minimization Algorithms">
+<link rel="home" href="../index.html" title="Math Toolkit 2.11.0">
+<link rel="up" href="../root_finding.html" title="Chapter&#160;10.&#160;Root Finding &amp; Minimization Algorithms">
 <link rel="prev" href="roots_noderiv/implementation.html" title="Implementation">
 <link rel="next" href="root_finding_examples.html" title="Examples of Root-Finding (with and without derivatives)">
 </head>
@@ -164,6 +164,11 @@
           than zero.
         </li>
 <li class="listitem">
+          The functions will raise an <a class="link" href="error_handling.html#math_toolkit.error_handling.evaluation_error">evaluation_error</a>
+          if arguments <code class="computeroutput"><span class="identifier">min</span></code> and <code class="computeroutput"><span class="identifier">max</span></code> are the wrong way around or if they
+          converge to a local minima.
+        </li>
+<li class="listitem">
           If the derivative at the current best guess for the result is infinite
           (or very close to being infinite) then these functions may terminate prematurely.
           A large first derivative leads to a very small next step, triggering the
@@ -228,11 +233,12 @@
       Given an initial guess <span class="emphasis"><em>x0</em></span> the subsequent values are computed
       using:
     </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        <span class="inlinemediaobject"><img src="../../equations/roots1.svg"></span>
+
+      </p></blockquote></div>
 <p>
-      <span class="inlinemediaobject"><img src="../../equations/roots1.svg"></span>
-    </p>
-<p>
-      Out of bounds steps revert to <a class="link" href="roots_noderiv/bisect.html" title="Bisection">bisection</a>
+      Out-of-bounds steps revert to <a class="link" href="roots_noderiv/bisect.html" title="Bisection">bisection</a>
       of the current bounds.
     </p>
 <p>
@@ -247,9 +253,10 @@
       Given an initial guess <span class="emphasis"><em>x0</em></span> the subsequent values are computed
       using:
     </p>
-<p>
-      <span class="inlinemediaobject"><img src="../../equations/roots2.svg"></span>
-    </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        <span class="inlinemediaobject"><img src="../../equations/roots2.svg"></span>
+
+      </p></blockquote></div>
 <p>
       Over-compensation by the second derivative (one which would proceed in the
       wrong direction) causes the method to revert to a Newton-Raphson step.
@@ -268,9 +275,10 @@
 <p>
       Given an initial guess x0 the subsequent values are computed using:
     </p>
-<p>
-      <span class="inlinemediaobject"><img src="../../equations/roots3.svg"></span>
-    </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        <span class="inlinemediaobject"><img src="../../equations/roots3.svg"></span>
+
+      </p></blockquote></div>
 <p>
       Over-compensation by the second derivative (one which would proceed in the
       wrong direction) causes the method to revert to a Newton-Raphson step. Likewise