backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0c22356706

Browse Source
This commit is contained in:
github-actions
2020-10-30 11:37:21 +00:00
parent 1033b1c367
commit 008ae67aed
208 changed files with 4970 additions and 4621 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
da/df2/durand__kerner__roots_8cpp.html
View File

@@ -146,7 +146,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>main</b> (int argc, ch
<div class="textblock"><p>Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method">Durand Kerner algorithm</a> </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala">Krishna Vedala</a></dd></dl>
<p>Test the algorithm online: <a href="https://gist.github.com/kvedala/27f1b0b6502af935f6917673ec43bcd7">https://gist.github.com/kvedala/27f1b0b6502af935f6917673ec43bcd7</a></p>
<p>Try the highly unstable Wilkinson's polynomial: </p><div class="fragment"><div class="line">./numerical_methods/durand_kerner_roots 1 -210 20615 -1256850 53327946</div>
<p>Try the highly unstable Wilkinson's polynomial: </p><div class="fragment"><div class="line">./<a class="code" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a>/durand_kerner_roots 1 -210 20615 -1256850 53327946</div>
<div class="line">-1672280820 40171771630 -756111184500 11310276995381 -135585182899530</div>
<div class="line">1307535010540395 -10142299865511450 63030812099294896 -311333643161390640</div>
<div class="line">1206647803780373360 -3599979517947607200 8037811822645051776</div>
@@ -552,6 +552,7 @@ Here is the call graph for this function:</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a024b8bc4755863315456d573a6732377"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">check_termination</a></div><div class="ttdeci">bool check_termination(long double delta)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:91</div></div>
<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for io operations</div></div>
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a3bada3e58ad8d1b00918db2ffe83a740"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740">complex_str</a></div><div class="ttdeci">const char * complex_str(const std::complex&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:76</div></div>
<div class="ttc" id="adurand__kerner__roots_8cpp_html_ac38b9cfd2a39d856e0feba3b5d241ded"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#ac38b9cfd2a39d856e0feba3b5d241ded">durand_kerner_algo</a></div><div class="ttdeci">std::pair&lt; uint32_t, double &gt; durand_kerner_algo(const std::valarray&lt; double &gt; &amp;coeffs, std::valarray&lt; std::complex&lt; double &gt;&gt; *roots, bool write_log=false)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:109</div></div>