Metraipolis › archive › dc_0d4e80be7afc
Aberth method — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Aberth_method
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-07T07:03:20.126Z
- SHA-256 of the archived text
2299ba9edadb3cbd342f692289ce0b16d6766984ce889f0a6681ac1c906bc465- Stable URL of this page
https://metraipolis.com/documento/dc_0d4e80be7afc
How to cite
Aberth method — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Aberth_method (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0d4e80be7afc (Metraipolis archive dc_0d4e80be7afc, sha256 2299ba9edadb3cbd342f692289ce0b16d6766984ce889f0a6681ac1c906bc465)
BibTeX
@misc{dc0d4e80be7afc,
title = {Aberth method — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Aberth_method},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0d4e80be7afc; sha256 2299ba9edadb3cbd342f692289ce0b16d6766984ce889f0a6681ac1c906bc465},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Aberth_method. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Aberth method, or Aberth–Ehrlich method or Ehrlich–Aberth method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots of a univariate polynomial. Locally, this method converges cubically (when all roots are simple), an improvement over the Durand–Kerner method, another algorithm for approximating all roots at once, which converges quadratically. (However, both algorithms converge linearly at multiple zeros.) The Ehrlich--Aberth method is not generally convergent: there is an open subset of the space of polynomials of any degree 7 or greater, and an open set of initial vectors, for which the iteration converges to an attracting periodic orbit, rather than to a vector of roots . However, the known set of such initial conditions is exceedingly small (less than 10-127 with respect to a unit cube), so in practice non-convergence is hard to observe by chance (except for symmetric initial conditions). This method is used in MPSolve, which is the reference software for approximating all roots of a polynomial to an arbitrary precision. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «Aberth method» — https://en.wikipedia.org/wiki/Aberth_method Wikidata Q4667181: «root-finding algorithm made in 1967 to compute all roots of univariate polynomials» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4667181 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Aberth_method?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 1383750333, consultata il 2026-11-07T06:59:14.949Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d54ec754aa0799e0b45f10d2f09dfc8c142f0a34644dace0ca67d24261ec7d28