Root finding
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Where Newton's method goes instead
An algorithm designed to find roots, run from every starting point at once. Three roots, three basins, and a boundary at which all three are arbitrarily close — so a rule with no randomness in it has starting points whose answer cannot be predicted.
What the coefficients already know
Finding the roots of a polynomial is hard and often impossible in closed form. Reading off their sum, their product and how many of them are real is none of those things — those numbers are sitting in the coefficients, and no root-finding is required to get at them.
Named alongside it
The objects these essays reach for when they reach for this one.
Complex numbersBasin of attractionCoefficientConvergenceDegreeDerivativeDiscriminantFactorisationFractalIterationNewtons methodPolynomial