Jenkins–Traub algorithm
The Jenkins–Traub algorithm for polynomial zeros is a fast globally convergent iterative polynomial root-finding method published in 1970 by and Joseph F. Traub. They gave two variants, one for general polynomials with complex coefficients, commonly known as the "CPOLY" algorithm, and a more complicated variant for the special case of polynomials with real coefficients, commonly known as the "RPOLY" algorithm. The latter is "practically a standard in black-box polynomial root-finders". This article describes the complex variant. Given a polynomial P,
- Comment
- enThe Jenkins–Traub algorithm for polynomial zeros is a fast globally convergent iterative polynomial root-finding method published in 1970 by and Joseph F. Traub. They gave two variants, one for general polynomials with complex coefficients, commonly known as the "CPOLY" algorithm, and a more complicated variant for the special case of polynomials with real coefficients, commonly known as the "RPOLY" algorithm. The latter is "practically a standard in black-box polynomial root-finders". This article describes the complex variant. Given a polynomial P,
- Has abstract
- enThe Jenkins–Traub algorithm for polynomial zeros is a fast globally convergent iterative polynomial root-finding method published in 1970 by and Joseph F. Traub. They gave two variants, one for general polynomials with complex coefficients, commonly known as the "CPOLY" algorithm, and a more complicated variant for the special case of polynomials with real coefficients, commonly known as the "RPOLY" algorithm. The latter is "practically a standard in black-box polynomial root-finders". This article describes the complex variant. Given a polynomial P, with complex coefficients it computes approximations to the n zeros of P(z), one at a time in roughly increasing order of magnitude. After each root is computed, its linear factor is removed from the polynomial. Using this deflation guarantees that each root is computed only once and that all roots are found. The real variant follows the same pattern, but computes two roots at a time, either two real roots or a pair of conjugate complex roots. By avoiding complex arithmetic, the real variant can be faster (by a factor of 4) than the complex variant. The Jenkins–Traub algorithm has stimulated considerable research on theory and software for methods of this type.
- Is primary topic of
- Jenkins–Traub algorithm
- Label
- enJenkins–Traub algorithm
- Link from a Wikipage to an external page
- linkinghub.elsevier.com/retrieve/pii/0024379571900358
- www.jstor.org/stable/2949376
- portal.acm.org/citation.cfm%3Fid=355643&coll=ACM&dl=ACM
- portal.acm.org/citation.cfm%3Fid=361262&coll=portal&dl=ACM
- github.com/sweeneychris/RpolyPlusPlus
- www.hvks.com/Numerical/winsolve.html
- Link from a Wikipage to another Wikipage
- Category:Numerical analysis
- Category:Root-finding algorithms
- Companion matrix
- Golden ratio
- Horner scheme
- Inverse power iteration
- James H. Wilkinson
- Joseph F. Traub
- Joseph F Traub
- Michael A. Jenkins
- Newton's method
- Newton–Raphson iteration
- Philip Rabinowitz (mathematician)
- Polynomial
- Rate of convergence
- Rational functions
- Root-finding algorithms
- Ruffini rule
- SameAs
- 4oFwL
- m.02vq0xw
- Q6177639
- Subject
- Category:Numerical analysis
- Category:Root-finding algorithms
- WasDerivedFrom
- Jenkins–Traub algorithm?oldid=1058459263&ns=0
- WikiPageLength
- 18630
- Wikipage page ID
- 12106314
- Wikipage revision ID
- 1058459263
- WikiPageUsesTemplate
- Template:Reflist
- Template:Root-finding algorithms
- Template:Who