# The Algorithm for Newton’s Method for Solving Systems of Two Nonlinear Equations

We will now look at the algorithm for Newton’s method for solving systems of two nonlinear equations.

Let $\left\{\begin{matrix} f(x, y) = 0\\ g(x, y) = 0 \end{matrix}\right.$ be a nonlinear system of equations and assume that a solution $(\alpha, \beta)$ exists. Obtain an initial approximation $(x_0, y_0)$ near $(\alpha, \beta)$. Set a maximum number of iterations, and prescribed accuracy $\epsilon$.

For each $k = 0, 1, 2, …$ up to the maximum number of iterations prescribed:

**Step 1:** Solve the linear system below for $\begin{bmatrix} \delta_{x, k}\\ \delta_{y, k} \end{bmatrix}$:

(1)

**Step 2:** Obtain the successive approximations with the following formula:

(2)

**Step 3:** Check the accuracy require below:

(3)

If the accuracy is achieved, then stop the iterations. If the accuracy is not achieved, then continue to obtain successive iterations until the maximum number of iterations allowed is obtained. If the maximum number of iterations allowed is obtained and the accuracy is not achieved, then print out a failure message.