The basins of Newton's method on z³ = 1
basins is one function. Everything below came out of it during this
build, at parameters taken from the essays rather than invented for this page — so a figure
here is the same figure a reader meets in an essay, and if the generator changes, this page
changes with it.
At its defaults
What it checks while it draws
Collected by running the family and recording what it asserted, not written here. The count is how many separate times the claim was put to the test while these drawings were made.
- a point beside root 1 runs to root 1 ×3
- each root cubes to one ×1
- the iteration cap is a whole number between 8 and 200 ×1
- the sample count is a whole number between 60 and 700 ×1
- the span is between 0.02 and 6 ×1
- with no imaginary part left over ×1
Where it is called
Changing this generator changes every figure on this list. That is what makes the list worth publishing rather than keeping in a check script.
A map that shrinks everything
One extra hypothesis — that every distance is shortened by at least a fixed factor — turns the existence of a fixed point into its uniqueness, an algorithm for finding it, and a bound on the error after any number of steps.
DynamicsWhere 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.