Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Splitting circle method
open-in-new
<p>In <a href="/facts/Mathematics/pxTouaz4">mathematics</a>, the splitting circle method is a <a href="/facts/Numerical_analysis/QT9cYa9z">numerical algorithm</a> for the numerical factorization of a <a href="/facts/Polynomial/Lzak8VVx">polynomial</a> and, ultimately, for finding its <a href="/facts/Complex_number/2w7mqI7e">complex</a> <a href="/facts/Root_of_a_function/mlK3dhoT">roots</a>. It was introduced by <a href="/facts/Arnold_Sch%C3%B6nhage/t3LukeNN">Arnold Schönhage</a> in his 1982 paper <i>The fundamental theorem of algebra in terms of computational complexity</i> (Technical report, Mathematisches Institut der Universität Tübingen). A revised algorithm was presented by <a href="/facts/Victor_Pan/Eb9w9CIu">Victor Pan</a> in 1998. An implementation was provided by Xavier Gourdon in 1996 for the <a href="/facts/Magma_computer_algebra_system/0kJ0CyPo">Magma</a> and <a href="/facts/PARI/GP/JhTL8ysP">PARI/GP</a> computer algebra systems. </p>