Solution of equations for methods iterativos
-
Upload
duban-castro -
Category
Documents
-
view
993 -
download
0
Transcript of Solution of equations for methods iterativos
- 1. SOLUTION OF EQUATIONS FOR ITERATIVOS METHODS
BY:DUBAN CASTRO FLOREZ
NUMERICS METHODS IN ENGINEERING
2010
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
NUMERICS METHODS
3. NUMERICS METHODS
4. NUMERICS METHODS
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 equationi
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. NUMERICS METHODS
Leaving of x=1, y=2 applies two iterations of the Jacobi method to
solve the system:
6. NUMERICS METHODS
This Di it is used as unemployment approach in the iterations until
Di it is smaller than certain given value.
Being Di:
7. NUMERICS METHODS
GAUSS-SEIDEL
Given a square system of n linear equations with unknown x:
Where:
8. NUMERICS METHODS
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. NUMERICS METHODS
GAUSS-SEIDEL
The GaussSeidel 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
NUMERICS METHODS
- 1ra iteration