1<html> 2<head> 3<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 4<title>Implementation</title> 5<link rel="stylesheet" href="../../math.css" type="text/css"> 6<meta name="generator" content="DocBook XSL Stylesheets V1.79.1"> 7<link rel="home" href="../../index.html" title="Math Toolkit 2.12.0"> 8<link rel="up" href="../roots_noderiv.html" title="Root Finding Without Derivatives"> 9<link rel="prev" href="root_termination.html" title="Termination Condition Functors"> 10<link rel="next" href="../roots_deriv.html" title="Root Finding With Derivatives: Newton-Raphson, Halley & Schröder"> 11</head> 12<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> 13<table cellpadding="2" width="100%"><tr> 14<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> 15<td align="center"><a href="../../../../../../index.html">Home</a></td> 16<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> 17<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> 18<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> 19<td align="center"><a href="../../../../../../more/index.htm">More</a></td> 20</tr></table> 21<hr> 22<div class="spirit-nav"> 23<a accesskey="p" href="root_termination.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../roots_noderiv.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_deriv.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> 24</div> 25<div class="section"> 26<div class="titlepage"><div><div><h3 class="title"> 27<a name="math_toolkit.roots_noderiv.implementation"></a><a class="link" href="implementation.html" title="Implementation">Implementation</a> 28</h3></div></div></div> 29<p> 30 The implementation of the bisection algorithm is extremely straightforward 31 and not detailed here. 32 </p> 33<p> 34 <a href="http://portal.acm.org/citation.cfm?id=210111" target="_top">TOMS Algorithm 35 748: enclosing zeros of continuous functions</a> is described in detail 36 in: 37 </p> 38<p> 39 <span class="emphasis"><em>Algorithm 748: Enclosing Zeros of Continuous Functions, G. E. Alefeld, 40 F. A. Potra and Yixun Shi, ACM Transactions on Mathematica1 Software, Vol. 41 21. No. 3. September 1995. Pages 327-344.</em></span> 42 </p> 43<p> 44 The implementation here is a faithful translation of this paper into C++. 45 </p> 46</div> 47<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 48<td align="left"></td> 49<td align="right"><div class="copyright-footer">Copyright © 2006-2019 Nikhar 50 Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos, 51 Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Matthew Pulver, Johan 52 Råde, Gautam Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg, 53 Daryle Walker and Xiaogang Zhang<p> 54 Distributed under the Boost Software License, Version 1.0. (See accompanying 55 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>) 56 </p> 57</div></td> 58</tr></table> 59<hr> 60<div class="spirit-nav"> 61<a accesskey="p" href="root_termination.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../roots_noderiv.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_deriv.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> 62</div> 63</body> 64</html> 65
