OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity
af5e6b48b4
TheAlgorithms-C/da/d4a/bisection__method_8c.html
github-actions d7864c1602 Documentation for a537cf3645
2023-04-05 22:09:53 +00:00

415 lines
26 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: numerical_methods/bisection_method.c File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('da/d4a/bisection__method_8c.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#define-members">Macros</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">bisection_method.c File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>In mathematics, the <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">Bisection Method</a> is a root-finding method that applies to any continuous function for which one knows two values with opposite signs.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;assert.h&gt;</code><br />
<code>#include &lt;math.h&gt;</code><br />
<code>#include &lt;stdio.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for bisection_method.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dd8/bisection__method_8c__incl.svg" width="254" height="124"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:a002b2f4894492820fe708b1b7e7c5e70"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d4a/bisection__method_8c.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>&#160;&#160;&#160;0.0001</td></tr>
<tr class="memdesc:a002b2f4894492820fe708b1b7e7c5e70"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <br /></td></tr>
<tr class="separator:a002b2f4894492820fe708b1b7e7c5e70"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5de5d183f9a6a8d53316f743e1ca6dc2"><td class="memItemLeft" align="right" valign="top"><a id="a5de5d183f9a6a8d53316f743e1ca6dc2" name="a5de5d183f9a6a8d53316f743e1ca6dc2"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><b>NMAX</b>&#160;&#160;&#160;50</td></tr>
<tr class="separator:a5de5d183f9a6a8d53316f743e1ca6dc2"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a858396a5abdb7865e71cf803fdcb37ae"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d4a/bisection__method_8c.html#a858396a5abdb7865e71cf803fdcb37ae">sign</a> (double a, double b)</td></tr>
<tr class="memdesc:a858396a5abdb7865e71cf803fdcb37ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check if two input values have the same sign (the property of being positive or negative) <br /></td></tr>
<tr class="separator:a858396a5abdb7865e71cf803fdcb37ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aba60904b56a5dce7e291d2f7d62e9782"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d4a/bisection__method_8c.html#aba60904b56a5dce7e291d2f7d62e9782">func</a> (double x)</td></tr>
<tr class="memdesc:aba60904b56a5dce7e291d2f7d62e9782"><td class="mdescLeft">&#160;</td><td class="mdescRight">Continuous function for which we want to find the root. <br /></td></tr>
<tr class="separator:aba60904b56a5dce7e291d2f7d62e9782"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2cc3091aa922139350e918ba04164421"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d4a/bisection__method_8c.html#a2cc3091aa922139350e918ba04164421">bisection</a> (double x_left, double x_right, double tolerance)</td></tr>
<tr class="memdesc:a2cc3091aa922139350e918ba04164421"><td class="mdescLeft">&#160;</td><td class="mdescRight">Root-finding method for a continuous function given two values with opposite signs. <br /></td></tr>
<tr class="separator:a2cc3091aa922139350e918ba04164421"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d4a/bisection__method_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d4a/bisection__method_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>In mathematics, the <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">Bisection Method</a> is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. </p>
<p>The method consists of repeatedly bisecting the interval defined by the two values and then selecting the subinterval in which the function changes sign, and therefore must contain a root. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/aybarsnazlica" target="_blank">Aybars Nazlica</a> </dd></dl>
</div><h2 class="groupheader">Macro Definition Documentation</h2>
<a id="a002b2f4894492820fe708b1b7e7c5e70" name="a002b2f4894492820fe708b1b7e7c5e70"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a002b2f4894492820fe708b1b7e7c5e70">&#9670;&#160;</a></span>EPSILON</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define EPSILON&#160;&#160;&#160;0.0001</td>
</tr>
</table>
</div><div class="memdoc">
<p>for assert </p>
<p>for fabs for IO operations </p>
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a2cc3091aa922139350e918ba04164421" name="a2cc3091aa922139350e918ba04164421"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2cc3091aa922139350e918ba04164421">&#9670;&#160;</a></span>bisection()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double bisection </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>x_left</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>x_right</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>tolerance</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Root-finding method for a continuous function given two values with opposite signs. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x_left</td><td>Lower endpoint value of the interval </td></tr>
<tr><td class="paramname">x_right</td><td>Upper endpoint value of the interval </td></tr>
<tr><td class="paramname">tolerance</td><td>Error threshold </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>root of the function</code> if bisection method succeed within the maximum number of iterations </dd>
<dd>
<code>-1</code> if bisection method fails </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 59</span>{</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">int</span> n = 1; <span class="comment">// step counter</span></div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordtype">double</span> middle; <span class="comment">// midpoint</span></div>
<div class="line"><span class="lineno"> 62</span> </div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">while</span> (n &lt;= NMAX)</div>
<div class="line"><span class="lineno"> 64</span> {</div>
<div class="line"><span class="lineno"> 65</span> middle = (x_left + x_right) / 2; <span class="comment">// bisect the interval</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/ddd/remote__command__exec__udp__client_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce">error</a> = middle - x_left;</div>
<div class="line"><span class="lineno"> 67</span> </div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">if</span> (fabs(<a class="code hl_function" href="../../da/d4a/bisection__method_8c.html#aba60904b56a5dce7e291d2f7d62e9782">func</a>(middle)) &lt; <a class="code hl_define" href="../../da/d4a/bisection__method_8c.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> || <a class="code hl_function" href="../../d9/ddd/remote__command__exec__udp__client_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce">error</a> &lt; tolerance)</div>
<div class="line"><span class="lineno"> 69</span> {</div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">return</span> middle;</div>
<div class="line"><span class="lineno"> 71</span> }</div>
<div class="line"><span class="lineno"> 72</span> </div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../da/d4a/bisection__method_8c.html#a858396a5abdb7865e71cf803fdcb37ae">sign</a>(<a class="code hl_function" href="../../da/d4a/bisection__method_8c.html#aba60904b56a5dce7e291d2f7d62e9782">func</a>(middle), <a class="code hl_function" href="../../da/d4a/bisection__method_8c.html#aba60904b56a5dce7e291d2f7d62e9782">func</a>(x_left)) &gt; 0.0)</div>
<div class="line"><span class="lineno"> 74</span> {</div>
<div class="line"><span class="lineno"> 75</span> x_left = middle; <span class="comment">// new lower endpoint</span></div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 78</span> {</div>
<div class="line"><span class="lineno"> 79</span> x_right = middle; <span class="comment">// new upper endpoint</span></div>
<div class="line"><span class="lineno"> 80</span> }</div>
<div class="line"><span class="lineno"> 81</span> </div>
<div class="line"><span class="lineno"> 82</span> n++; <span class="comment">// increase step counter</span></div>
<div class="line"><span class="lineno"> 83</span> }</div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">return</span> -1; <span class="comment">// method failed (maximum number of steps exceeded)</span></div>
<div class="line"><span class="lineno"> 85</span>}</div>
<div class="ttc" id="abisection__method_8c_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../da/d4a/bisection__method_8c.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition:</b> bisection_method.c:21</div></div>
<div class="ttc" id="abisection__method_8c_html_a858396a5abdb7865e71cf803fdcb37ae"><div class="ttname"><a href="../../da/d4a/bisection__method_8c.html#a858396a5abdb7865e71cf803fdcb37ae">sign</a></div><div class="ttdeci">double sign(double a, double b)</div><div class="ttdoc">Function to check if two input values have the same sign (the property of being positive or negative)</div><div class="ttdef"><b>Definition:</b> bisection_method.c:32</div></div>
<div class="ttc" id="abisection__method_8c_html_aba60904b56a5dce7e291d2f7d62e9782"><div class="ttname"><a href="../../da/d4a/bisection__method_8c.html#aba60904b56a5dce7e291d2f7d62e9782">func</a></div><div class="ttdeci">double func(double x)</div><div class="ttdoc">Continuous function for which we want to find the root.</div><div class="ttdef"><b>Definition:</b> bisection_method.c:43</div></div>
<div class="ttc" id="aremote__command__exec__udp__client_8c_html_a7e15c8e2885871839fc2b820dfbdb4ce"><div class="ttname"><a href="../../d9/ddd/remote__command__exec__udp__client_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce">error</a></div><div class="ttdeci">void error()</div><div class="ttdoc">Utility function used to print an error message to stderr.</div><div class="ttdef"><b>Definition:</b> remote_command_exec_udp_client.c:37</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4a/bisection__method_8c_a2cc3091aa922139350e918ba04164421_cgraph.svg" width="182" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aba60904b56a5dce7e291d2f7d62e9782" name="aba60904b56a5dce7e291d2f7d62e9782"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aba60904b56a5dce7e291d2f7d62e9782">&#9670;&#160;</a></span>func()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double func </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>x</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Continuous function for which we want to find the root. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x</td><td>Real input variable </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The evaluation result of the function using the input value </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 44</span>{</div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">return</span> x * x * x + 2.0 * x - 10.0; <span class="comment">// f(x) = x**3 + 2x - 10</span></div>
<div class="line"><span class="lineno"> 46</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 108</span>{</div>
<div class="line"><span class="lineno"> 109</span> <a class="code hl_function" href="../../da/d4a/bisection__method_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 111</span>}</div>
<div class="ttc" id="abisection__method_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/d4a/bisection__method_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> bisection_method.c:91</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4a/bisection__method_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="372" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a858396a5abdb7865e71cf803fdcb37ae" name="a858396a5abdb7865e71cf803fdcb37ae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a858396a5abdb7865e71cf803fdcb37ae">&#9670;&#160;</a></span>sign()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double sign </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>b</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to check if two input values have the same sign (the property of being positive or negative) </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>Input value </td></tr>
<tr><td class="paramname">b</td><td>Input value </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>1.0 if the input values have the same sign, </dd>
<dd>
-1.0 if the input values have different signs </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 33</span>{</div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">return</span> (a &gt; 0 &amp;&amp; b &gt; 0) + (a &lt; 0 &amp;&amp; b &lt; 0) - (a &gt; 0 &amp;&amp; b &lt; 0) -</div>
<div class="line"><span class="lineno"> 35</span> (a &lt; 0 &amp;&amp; b &gt; 0);</div>
<div class="line"><span class="lineno"> 36</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 92</span>{</div>
<div class="line"><span class="lineno"> 93</span> <span class="comment">/* Compares root value that is found by the bisection method within a given</span></div>
<div class="line"><span class="lineno"> 94</span><span class="comment"> * floating point error*/</span></div>
<div class="line"><span class="lineno"> 95</span> assert(fabs(<a class="code hl_function" href="../../da/d4a/bisection__method_8c.html#a2cc3091aa922139350e918ba04164421">bisection</a>(1.0, 2.0, 0.0001) - 1.847473) &lt;</div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_define" href="../../da/d4a/bisection__method_8c.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>); <span class="comment">// the algorithm works as expected</span></div>
<div class="line"><span class="lineno"> 97</span> assert(fabs(<a class="code hl_function" href="../../da/d4a/bisection__method_8c.html#a2cc3091aa922139350e918ba04164421">bisection</a>(100.0, 250.0, 0.0001) - 249.999928) &lt;</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_define" href="../../da/d4a/bisection__method_8c.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>); <span class="comment">// the algorithm works as expected</span></div>
<div class="line"><span class="lineno"> 99</span> </div>
<div class="line"><span class="lineno"> 100</span> printf(<span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 101</span>}</div>
<div class="ttc" id="abisection__method_8c_html_a2cc3091aa922139350e918ba04164421"><div class="ttname"><a href="../../da/d4a/bisection__method_8c.html#a2cc3091aa922139350e918ba04164421">bisection</a></div><div class="ttdeci">double bisection(double x_left, double x_right, double tolerance)</div><div class="ttdoc">Root-finding method for a continuous function given two values with opposite signs.</div><div class="ttdef"><b>Definition:</b> bisection_method.c:58</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4a/bisection__method_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="274" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../da/d4a/bisection__method_8c.html">bisection_method.c</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink