The Durand-Kerner method, also called the Weierstrass method, is a simultaneous root-finding algorithm for all the roots
of a monic polynomial of polynomial degree
. From pairwise distinct approximations
, ...,
, it updates every approximation
using the old values:
The update is Newton's method applied to the coefficient equations obtained by matching to
. To see this, write the correction to
as
and expand
to first order in the corrections.
At
, all first-order terms except
vanish. Equating that term to
gives the update.
For simple roots and sufficiently close initial approximations, the method converges quadratically (Aberth 1973). For general initial values, it can fail to converge to the roots (Reinke et al. 2023).