Universidad Autónoma de Querétaro
Facultad de Ingeniería
“Gauss and Gauss-Seidel”
| | Nieves Fonseca Ricardo
Mentado Camacho Félix
Navarro Escamilla Erandy
Péloquin Blancas María José
Rubio Miranda Ana Luisa
Many real life problems give us several simultaneous linear equations to solve. And we have to find a common solution for each of them. There are several techniques to use. Instead of using methods that provide a solution to a set of linear equations after a finite number of steps, we can use a series of algorithms with fewer steps, but its accuracy depends on the number of times it is applied (also known as iterative methods). For large systems they may be a lot faster than direct methods. We will expand on two important methods to find numerical solutions to linear systems of equations. There will be an introduction to each method, besides detailed explanations on each of them. Normally each process is long, so they are ideal for programming.
Iterative, algorithm, linear equation, convergence.
Understand the concepts of iterative methods, and convergence, besides the difference and usefulness between direct and iterative methods. To give a clear and understandable idea of Gauss
and Gauss-Seidel methods to solve systems of linear equations, and show how to apply them.
An iterative method is one that computes approximations in a progressive way of the solution of a mathematical problem. The same improvement process is repeated on the approximate solution until a solution closer to the real value is obtained. Differently than a direct method, which entails finishing the process to get an answer, on an iterative one the process can be stopped when an iteration is finished to get an approximation to the solution. Advantages and disadvantages
The bad thing about iterative methods is that they...
Please join StudyMode to read the full document