Splitting circle method
In mathematics, the splitting circle method is a numerical algorithm for the numerical factorization of a polynomial and, ultimately, for finding its complex roots. It was introduced by Arnold Schönhage in his 1982 paper The fundamental theorem of algebra in terms of computational complexity (Technical report, Mathematisches Institut der Universität Tübingen). A revised algorithm was presented by Victor Pan in 1998. An implementation was provided by in 1996 for the Magma and PARI/GP computer algebra systems.
- Comment
- enIn mathematics, the splitting circle method is a numerical algorithm for the numerical factorization of a polynomial and, ultimately, for finding its complex roots. It was introduced by Arnold Schönhage in his 1982 paper The fundamental theorem of algebra in terms of computational complexity (Technical report, Mathematisches Institut der Universität Tübingen). A revised algorithm was presented by Victor Pan in 1998. An implementation was provided by in 1996 for the Magma and PARI/GP computer algebra systems.
- Has abstract
- enIn mathematics, the splitting circle method is a numerical algorithm for the numerical factorization of a polynomial and, ultimately, for finding its complex roots. It was introduced by Arnold Schönhage in his 1982 paper The fundamental theorem of algebra in terms of computational complexity (Technical report, Mathematisches Institut der Universität Tübingen). A revised algorithm was presented by Victor Pan in 1998. An implementation was provided by in 1996 for the Magma and PARI/GP computer algebra systems.
- Hypernym
- Algorithm
- Is primary topic of
- Splitting circle method
- Label
- enSplitting circle method
- Link from a Wikipage to an external page
- magma.maths.usyd.edu.au/magma/handbook/text/223%232021
- www.informatik.uni-bonn.de/~schoe/fdthmrep.ps.gz
- comet.lehman.cuny.edu/vpan/pdf/JSCOptimal.pdf
- algo.inria.fr/seminars/sem97-98/pan.html
- www.labma.ufrj.br/~gregorio/papers.php%23splittin%7Cdoi=10.1016/S0898-1221(96)00233-7
- algo.inria.fr/gourdon/thesis.html
- Link from a Wikipage to another Wikipage
- Arnold Schönhage
- Category:Root-finding algorithms
- Complex analysis
- Complex number
- Descartes' rule of signs
- Elementary symmetric polynomial
- Extended Euclidean algorithm
- Fast Fourier transform
- Formal power series
- GP
- Graeffe's method
- Magma computer algebra system
- Mathematics
- Newton's identities
- Newton's method
- Numerical analysis
- Padé approximant
- Polynomial
- Residue theorem
- Root of a function
- Rouché theorem
- Victor Pan
- Xavier Gourdon
- SameAs
- Jdgf
- m.09v846
- Méthode du cercle de séparation
- Q1269645
- Splitting circle method
- Trennkreisverfahren
- Subject
- Category:Root-finding algorithms
- WasDerivedFrom
- Splitting circle method?oldid=967772410&ns=0
- WikiPageLength
- 11331
- Wikipage page ID
- 3683888
- Wikipage revision ID
- 967772410
- WikiPageUsesTemplate
- Template:Cite book
- Template:Cite journal