X(k+ 1)=g(xk) is obtained by a certain iterative formula. If ek = | xk-x * |, where

X* is the root of f (x) = 0. Ek is a measure of the distance between the iterative sequence {xk} and the true solution, and ek = 0 indicates that the true solution has been obtained. ?

F(x) satisfies certain conditions, then {xk} converges to x* twice, which is roughly

Ek is about e (k- 1) 2, which is a fast convergence method.

Because you think, for example, e 1=0. 1, then e2 is about 0.0 1 and e3 is about 10 (-4).

E4 is about 10 (-8), e5 is about 10 (- 16), and an effective number of the solution can be obtained only by several iterations.

The approximate solution of 16 bit converges quickly.

Newton iterative formula:

K = (g+g power)/N. Newton iteration method, also known as Newton-Laveson method, was proposed by Newton method17th century, and was used to approximately solve equations in real number field and complex number field.

Real number is a general term for rational number and irrational number. Mathematically, a real number is defined as the number corresponding to a point on the number axis. Real numbers can be intuitively regarded as one-to-one correspondence between finite decimals and infinite decimals, and between real numbers and points on the number axis. But the whole of real numbers can't be described only by enumeration. Real and imaginary numbers * * * make up a complex number.