Changes

In [https://en.wikipedia.org/wiki/Computational_mathematics computational mathematics], an [https://en.wikipedia.org/wiki/Iterative_method iterative algorithm] or method is a procedure that generates [https://en.wikipedia.org/wiki/Integer_sequence integer], [https://en.wikipedia.org/wiki/Fixed-point_arithmetic fixed point], or [[Float|floating point]] sequences and calculates [https://en.wikipedia.org/wiki/Series_%28mathematics%29 Series]. Iterative algorithms are used to approximate [https://en.wikipedia.org/wiki/Nonlinear_system nonlinear equations] <ref>[http://www5.wittenberg.edu/academics/computerscience/facultystaff/shelburne.html [Mathematician#BJShelburne|Brian J. Shelburne]] ('''1999'''). ''[https://studylib.net/doc/7921512/zuse-s-z3-square-root-algorithm Zuse's Z3 Square Root Algorithm]''. [http://www4.wittenberg.edu/academics/mathcomp/bjsdir/ZuseZ3Talk.pdf pdf] » [[Konrad Zuse]]</ref> and to solve certain optimization problems. An iterative method is called convergent if the corresponding sequence converges for given initial approximations.