txt

adammaj1 · adammaj1 · commit 9441e36ffafc · 2021-01-09T18:31:56.000+01:00
diff --git a/README.md b/README.md
@@ -5,7 +5,7 @@ determine numerically the cycles of a polynomial Julia set
 # algorithm
 
 ## find critical points
-first find the critical points via classical Newton using a set of equidistant starting points at a square the size 3 times the Lagrangian estimate for the location of the roots of f'(z) (usually a total of 1024 points). 
+first find [the critical points](https://en.wikipedia.org/wiki/Critical_point_(mathematics)) via [classical Newton methid](https://en.wikibooks.org/wiki/Fractals/Mathematics/Newton_method) using a set of [equidistant starting points](https://gitlab.com/adammajewski/periodic-points-of-complex-quadratic-polynomial-using-newton-method) (  at a square the size 3 times [the Lagrangian estimate for the location of the roots of](https://en.wikipedia.org/wiki/Geometrical_properties_of_polynomial_roots#Lagrange's_and_Cauchy's_bounds) f'(z) (usually a total of 1024 points). 
 
 ## compute the critical orbits
 Then I construct the orbit of those using double precision (or sometimes float128), but without rounding control, for usually 25 000 iterations (escaping is tested using an escape radius either manually set or computed via the Douady estimate). 
@@ -36,7 +36,7 @@ g++ main.cpp -lm -Wall
 * [prm](https://github.com/raboehm/prm) - Find polynomial roots with multiplicities using mpmath by Bob Boehm
 
 # credits
-* basic stuff is the (modified) universal set of Newton starting points due to Sutherland
+* basic stuff is the (modified) universal set of Newton starting points due to [Sutherland](http://pi.math.cornell.edu/~hubbard/NewtonInventiones.pdf)
 * [marcm200](https://github.com/marcm200) ( most of the code) 
 
 
