This document discusses iterative methods for solving systems of equations, including the Jacobi and Gauss-Seidel methods. The Jacobi method solves systems of equations by iteratively updating the estimates of the unknown variables. The Gauss-Seidel method similarly iteratively solves systems but updates the estimates sequentially from left to right. Examples applying both methods to solve systems are provided.

1. SOLUTION OF EQUATIONS FOR ITERATIVOS METHODS Jeannie Castaño 2053298

2. JACOBI A iterative method is a method that progressively it calculates approaches to the solution of a problem. To difference of the direct methods, in which the process should be finished to have the answer, in the iterative methods you can suspend the process to the i finish of an iteration and an approach is obtained to the solution. For example the method of Newton-Raphson

4. The Jacobi method de is the iterative method to solve system of equations simple ma and it is applied alone to square systems, that is to say to systems with as many equations as incognito. The following steps should be continued: First the equation de recurrence is determined. Of the equation i and the incognito iclears. In notation matricial is written: where x is the vector of incognito It takes an approach for the solutions and to this it is designated for 3. You itera in the cycle that changes the approach

5. Leaving of x=1, y=2 applies two iterations of the Jacobi method to solve the system:

6. This Di it is used as unemployment approach in the iterations until Di it is smaller than certain given value. Being Di:

7. GAUSS-SEIDEL Given a square system of n linear equations with unknown x: Where:

8. GAUSS-SEIDEL Then A can be decomposed into a lower triangular component L*, and a strictly upper triangular component U: The system of linear equations may be rewritten as:

9. GAUSS-SEIDEL The Gauss–Seidel method is an iterative technique that solves the left hand side of this expression for x, using previous value for x on the right hand side. Analytically, this may be written as: However, by taking advantage of the triangular form of L*, the elements of x(k+1) can be computed sequentially using forward substitution:

10. To solve the following exercise for the method of Gauss-Seidel with an initial value of (0,0,0). Use three iterations 1ra iteration

11. 2da iteration 3ra iteration

12. GAUSS-SEIDEL RELAXATION To solve the previous exercise for the gauss method for relaxation. .Use two iterations Replacing with the initial values (0,0,0)

13. 1ra iteration

14. 2da iteration

15. BIBLIOGRAFIA http://es.wikipedia.org/wiki/M%C3%A9todo_iterativo http://search.conduit.com/Results.aspx?q=METODOS+ITERATIVOS&meta=all&hl=es&gl=co&SearchSourceOrigin=13&SelfSearch=1&ctid=CT2247187 http://en.wikipedia.org/wiki/Gauss%E2%80%93Seidel_method