Scribd
Upload
40 views

Newton-Raphson Method To Solve Systems of Non-Linear Equations

The document discusses using the Newton-Raphson method to solve systems of nonlinear equations by evaluating the Jacobian matrix and iteratively finding better approximations until convergence criteria are met. It outlines the theory behind the Newton-Raphson method and defines the Jacobian. An algorithm and MATLAB code are presented but no results are shown.

Uploaded by

ishaq2628
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
40 views

Newton-Raphson Method To Solve Systems of Non-Linear Equations

The document discusses using the Newton-Raphson method to solve systems of nonlinear equations by evaluating the Jacobian matrix and iteratively finding better approximations until convergence criteria are met. It outlines the theory behind the Newton-Raphson method and defines the Jacobian. An algorithm and MATLAB code are presented but no results are shown.

Uploaded by

ishaq2628
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

1.

Theory

Solving systems of non-linear equations Consider the solution to a system of n non-linear equations in n unknowns given by:

The system can be written in a single expression using vectors, i.e..

where the vector x contains the independent variables, and the vector f contains the functions fi(x):
Newton-Raphson method to solve systems of non-linear equations:

A Newton-Raphson method for solving the system of linear equations requires the evaluation of a matrix, known as the Jacobian of the system, which is defined as:

If x = x0 (a vector) represents the first guess for the solution, successive approximations to the solution are obtained from

A convergence criterion for the solution of a system of non-linear equation could be, for example, that the maximum of the absolute values of the functions fi(xn) is smaller than acertain tolerance , i.e.,

Another possibility for convergence is that the magnitude of the vector f(xn) be smaller than the tolerance, i.e.,

We can also use as convergence criteria the difference between consecutive values of the solution, i.e.,

or,

The main complication with using Newton-Raphson to solve a system of non-linear equations is having to define all the functions n, included in the Jacobian. As the

number of equations and unknowns, n, increases, so does the number of elements in the Jacobian, .

2. Algorithm

1- Read f(x1) , f(x2) 2- Find Jacobin 3- Calculate x(i+1)=x(i)+J^-1[y-f(x)] 4- Check for convergence criteria |x(i-1)-x(i)|< 5- If yes print the output otherwise increment the counter i and go to step 3

3. Program code (MATLAB)

4. Results

You might also like