Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

No Downloads

Total views

1,308

On SlideShare

0

From Embeds

0

Number of Embeds

11

Shares

0

Downloads

35

Comments

0

Likes

1

No embeds

No notes for slide

- 1. SOLUTION OF EQUATIONS FOR ITERATIVOS METHODS<br />BY:DUBAN CASTRO FLOREZ <br />NUMERICS METHODS IN ENGINEERING<br />2010<br />
- 2. JACOBI<br />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.<br />For example the method of Newton-Raphson<br />NUMERICS METHODS<br />
- 3. NUMERICS METHODS<br />
- 4. NUMERICS METHODS<br />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.<br />The following steps should be continued: <br />First the equation de recurrence is determined. Of the equation i and the incognito iclears. In notation matricial is written: <br /> where x is the vector of incognito <br />It takes an approach for the solutions and to this it is designated for <br />3. You itera in the cycle that changes the approach<br />
- 5. NUMERICS METHODS<br />Leaving of x=1, y=2 applies two iterations of the Jacobi method to solve the system:<br />
- 6. NUMERICS METHODS<br />This Di it is used as unemployment approach in the iterations until Di it is smaller than certain given value.<br />Being Di:<br />
- 7. NUMERICS METHODS<br />GAUSS-SEIDEL<br />Given a square system of n linear equations with unknown x:<br />Where:<br />
- 8. NUMERICS METHODS<br />GAUSS-SEIDEL<br />Then A can be decomposed into a lower triangular component L*, and a strictly upper triangular component U:<br />The system of linear equations may be rewritten as:<br />
- 9. NUMERICS METHODS<br />GAUSS-SEIDEL<br />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:<br />However, by taking advantage of the triangular form of L*, the elements of x(k+1) can be computed sequentially using forward substitution:<br />
- 10. To solve the following exercise for the method of Gauss-Seidel with an initial value of (0,0,0). Use three iterations<br />NUMERICS METHODS<br /><ul><li>1ra iteration</li></li></ul><li><ul><li>2da iteration</li></ul>NUMERICS METHODS<br /><ul><li>3ra iteration</li></li></ul><li>NUMERICS METHODS<br />GAUSS-SEIDEL RELAXATION<br />To solve the previous exercise for the gauss method for relaxation. .Use two iterations<br />Replacing with the initial values (0,0,0)<br />
- 11. <ul><li>1ra iteration</li></ul>NUMERICS METHODS<br />
- 12. <ul><li>2da iteration</li></ul>NUMERICS METHODS<br />
- 13. BIBLIOGRAFIA<br /><ul><li>http://en.wikipedia.org/wiki/Gauss%E2%80%93Seidel_method
- 14. http://es.wikipedia.org/wiki/M%C3%A9todo_iterativo
- 15. http://search.conduit.com/Results.aspx?q=METODOS+ITERATIVOS&meta=all&hl=es&gl=co&SearchSourceOrigin=13&SelfSearch=1&ctid=CT2247187</li></ul>NUMERICS METHODS<br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment