mirror of
https://github.com/saitohirga/WSJT-X.git
synced 2025-10-31 04:50:34 -04:00
139 lines
8.8 KiB
HTML
139 lines
8.8 KiB
HTML
|
<html>
|
||
|
|
<head>
|
||
|
|
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
||
|
|
<title>Root finding</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.5.1">
|
||
|
|
<link rel="up" href="../rooting.html" title="Chapter 12. Tools: Root Finding & Minimization Algorithms, Polynomial Arithmetic & Evaluation">
|
||
|
|
<link rel="prev" href="../rooting.html" title="Chapter 12. Tools: Root Finding & Minimization Algorithms, Polynomial Arithmetic & Evaluation">
|
||
|
|
<link rel="next" href="roots/roots_noderiv.html" title="Root Finding Without Derivatives">
|
||
|
|
</head>
|
||
|
|
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
||
|
|
<table cellpadding="2" width="100%"><tr>
|
||
|
|
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
|
||
|
|
<td align="center"><a href="../../../../../index.html">Home</a></td>
|
||
|
|
<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
|
||
|
|
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
||
|
|
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
||
|
|
<td align="center"><a href="../../../../../more/index.htm">More</a></td>
|
||
|
|
</tr></table>
|
||
|
|
<hr>
|
||
|
|
<div class="spirit-nav">
|
||
|
|
<a accesskey="p" href="../rooting.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rooting.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="roots/roots_noderiv.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
|
||
|
|
</div>
|
||
|
|
<div class="section">
|
||
|
|
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
|
||
|
|
<a name="math_toolkit.roots"></a><a class="link" href="roots.html" title="Root finding">Root finding</a>
|
||
|
|
</h2></div></div></div>
|
||
|
|
<div class="toc"><dl class="toc">
|
||
|
|
<dt><span class="section"><a href="roots/roots_noderiv.html">Root Finding Without
|
||
|
|
Derivatives</a></span></dt>
|
||
|
|
<dd><dl>
|
||
|
|
<dt><span class="section"><a href="roots/roots_noderiv/bisect.html">Bisection</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/roots_noderiv/bracket_solve.html">Bracket
|
||
|
|
and Solve Root</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/roots_noderiv/TOMS748.html">Algorithm
|
||
|
|
TOMS 748: Alefeld, Potra and Shi: Enclosing zeros of continuous functions</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/roots_noderiv/brent.html">Brent-Decker
|
||
|
|
Algorithm</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/roots_noderiv/root_termination.html">Termination
|
||
|
|
Condition Functors</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/roots_noderiv/implementation.html">Implementation</a></span></dt>
|
||
|
|
</dl></dd>
|
||
|
|
<dt><span class="section"><a href="roots/roots_deriv.html">Root Finding With Derivatives:
|
||
|
|
Newton-Raphson, Halley & Schröder</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_finding_examples.html">Examples of
|
||
|
|
Root-Finding (with and without derivatives)</a></span></dt>
|
||
|
|
<dd><dl>
|
||
|
|
<dt><span class="section"><a href="roots/root_finding_examples/cbrt_eg.html">Finding
|
||
|
|
the Cubed Root With and Without Derivatives</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_finding_examples/lambda.html">Using
|
||
|
|
C++11 Lambda's</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_finding_examples/5th_root_eg.html">Computing
|
||
|
|
the Fifth Root</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_finding_examples/multiprecision_root.html">Root-finding
|
||
|
|
using Boost.Multiprecision</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_finding_examples/nth_root.html">Generalizing
|
||
|
|
to Compute the nth root</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_finding_examples/elliptic_eg.html">A
|
||
|
|
More complex example - Inverting the Elliptic Integrals</a></span></dt>
|
||
|
|
</dl></dd>
|
||
|
|
<dt><span class="section"><a href="roots/bad_guess.html">The Effect of a Poor Initial
|
||
|
|
Guess</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/bad_roots.html">Examples Where Root Finding
|
||
|
|
Goes Wrong</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/brent_minima.html">Locating Function Minima
|
||
|
|
using Brent's algorithm</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_comparison.html">Comparison of Root
|
||
|
|
Finding Algorithms</a></span></dt>
|
||
|
|
<dd><dl>
|
||
|
|
<dt><span class="section"><a href="roots/root_comparison/cbrt_comparison.html">Comparison
|
||
|
|
of Cube Root Finding Algorithms</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_comparison/root_n_comparison.html">Comparison
|
||
|
|
of Nth-root Finding Algorithms</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/root_comparison/elliptic_comparison.html">Comparison
|
||
|
|
of Elliptic Integral Root Finding Algoritghms</a></span></dt>
|
||
|
|
</dl></dd>
|
||
|
|
<dt><span class="section"><a href="roots/polynomials.html">Polynomials</a></span></dt>
|
||
|
|
<dt><span class="section"><a href="roots/rational.html">Polynomial and Rational
|
||
|
|
Function Evaluation</a></span></dt>
|
||
|
|
</dl></div>
|
||
|
|
<p>
|
||
|
|
Several tools are provided to aid finding minima and roots of functions.
|
||
|
|
</p>
|
||
|
|
<p>
|
||
|
|
Some <a class="link" href="roots/roots_noderiv.html" title="Root Finding Without Derivatives">root-finding without
|
||
|
|
derivatives</a> methods are <a class="link" href="roots/roots_noderiv/bisect.html" title="Bisection">bisection</a>,
|
||
|
|
<a class="link" href="roots/roots_noderiv/bracket_solve.html" title="Bracket and Solve Root">bracket and
|
||
|
|
solve</a>, including use of <a class="link" href="roots/roots_noderiv/TOMS748.html" title="Algorithm TOMS 748: Alefeld, Potra and Shi: Enclosing zeros of continuous functions">TOMS
|
||
|
|
748 algorithm</a>.
|
||
|
|
</p>
|
||
|
|
<p>
|
||
|
|
For <a class="link" href="roots/roots_deriv.html" title="Root Finding With Derivatives: Newton-Raphson, Halley & Schröder">root-finding with derivatives</a>
|
||
|
|
the methods of <a class="link" href="roots/roots_deriv.html#math_toolkit.roots.roots_deriv.newton">Newton-Raphson
|
||
|
|
iteration</a>, <a class="link" href="roots/roots_deriv.html#math_toolkit.roots.roots_deriv.halley">Halley</a>,
|
||
|
|
and <a class="link" href="roots/roots_deriv.html#math_toolkit.roots.roots_deriv.schroder">Schröder</a>
|
||
|
|
are implemented.
|
||
|
|
</p>
|
||
|
|
<p>
|
||
|
|
For locating minima of a function, a <a class="link" href="roots/brent_minima.html#math_toolkit.roots.brent_minima.example">Brent
|
||
|
|
minima finding example</a> is provided.
|
||
|
|
</p>
|
||
|
|
<p>
|
||
|
|
There are several fully-worked <a class="link" href="roots/root_finding_examples.html" title="Examples of Root-Finding (with and without derivatives)">root-finding
|
||
|
|
examples</a>, including:
|
||
|
|
</p>
|
||
|
|
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
|
||
|
|
<li class="listitem">
|
||
|
|
<a class="link" href="roots/root_finding_examples/cbrt_eg.html#math_toolkit.roots.root_finding_examples.cbrt_eg.cbrt_no_derivatives">root-finding
|
||
|
|
without derivatives</a>
|
||
|
|
</li>
|
||
|
|
<li class="listitem">
|
||
|
|
<a class="link" href="roots/root_finding_examples/cbrt_eg.html#math_toolkit.roots.root_finding_examples.cbrt_eg.cbrt_1st_derivative">root-finding
|
||
|
|
with 1st derivatives</a>
|
||
|
|
</li>
|
||
|
|
<li class="listitem">
|
||
|
|
<a class="link" href="roots/root_finding_examples/cbrt_eg.html#math_toolkit.roots.root_finding_examples.cbrt_eg.cbrt_2_derivatives">root-finding
|
||
|
|
with 1st and 2nd derivatives</a>
|
||
|
|
</li>
|
||
|
|
</ul></div>
|
||
|
|
</div>
|
||
|
|
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
||
|
|
<td align="left"></td>
|
||
|
|
<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012-2014 Nikhar Agrawal,
|
||
|
|
Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, Hubert
|
||
|
|
Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Johan Råde, Gautam Sewani,
|
||
|
|
Benjamin Sobotta, Thijs van den Berg, Daryle Walker and Xiaogang Zhang<p>
|
||
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||
|
|
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
||
|
|
</p>
|
||
|
|
</div></td>
|
||
|
|
</tr></table>
|
||
|
|
<hr>
|
||
|
|
<div class="spirit-nav">
|
||
|
|
<a accesskey="p" href="../rooting.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rooting.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="roots/roots_noderiv.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
|
||
|
|
</div>
|
||
|
|
</body>
|
||
|
|
</html>
|