Metraipolis › archive › dc_32a5ff2e199c

Jenkins–Traub algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Jenkins%E2%80%93Traub_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T14:26:00.734Z
SHA-256 of the archived text
2020fab65250dee2f37fb19585f183f69ca51d8b67d7675447d143d8bfbce972
Stable URL of this page
https://metraipolis.com/documento/dc_32a5ff2e199c

How to cite

Jenkins–Traub algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Jenkins%E2%80%93Traub_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_32a5ff2e199c (Metraipolis archive dc_32a5ff2e199c, sha256 2020fab65250dee2f37fb19585f183f69ca51d8b67d7675447d143d8bfbce972)
BibTeX
@misc{dc32a5ff2e199c,
  title = {Jenkins–Traub algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Jenkins%E2%80%93Traub_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_32a5ff2e199c; sha256 2020fab65250dee2f37fb19585f183f69ca51d8b67d7675447d143d8bfbce972},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Jenkins%E2%80%93Traub_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Jenkins–Traub algorithm for polynomial zeros is a fast globally convergent iterative polynomial root-finding method published in 1970 by Michael A. Jenkins 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, P ( z ) = ∑ i = 0 n a i z n − i , a 0 = 1 , a n ≠ 0 {\displaystyle P(z)=\sum _{i=0}^{n}a_{i}z^{n-i},\quad a_{0}=1,\quad a_{n}\neq 0} with complex coefficients it computes approximations to the n zeros α 1 , α 2 , … , α n {\displaystyle \alpha _{1},\alpha _{2},\dots ,\alpha _{n}} 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.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»).
Fonte: Wikipedia in inglese, voce «Jenkins–Traub algorithm» — https://en.wikipedia.org/wiki/Jenkins%E2%80%93Traub_algorithm
Wikidata Q6177639 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q6177639
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Jenkins%E2%80%93Traub_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375333817, consultata il 2026-10-07T14:07:16.024Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 87ffed0612f457d8670aa441d89a10bdda4accdeb2a93a2ed90aeeed8e922dd9