Question: PART I. JACOBI METHOD Using the C ++ programming language, implement an algorithm that executes the Jacobi iterative method. The algorithm must execute the following:

PART I. JACOBI METHOD Using the C ++ programming language, implement an algorithm that executes the Jacobi iterative method. The algorithm must execute the following: 1. Ask the user for the size of the square linear system (number of equations equal to the number of variables) to solve (greater than or equal to 2). 2. Ask the user for the coefficients of the linear system. 3. Verify if the system satisfies the property of being strictly dominant. a) If the system does not satisfy you, display a warning message and ask the user if they want to enter new values for the coefficients. b) If the system satisfies it, continue with the following steps. 4. Solicite al usuario el nivel de precisin (dcimas, centsimas, milsimas, etc.) en la solucin que se obtendr. 5. Ejecute el mtodo iterativo de Jacobi. a) Ejecute el mtodo hasta obtener soluciones sucesivas que satisfagan la condicin

PART I. JACOBI METHOD Using the C ++ programming language, implement an

donde algorithm that executes the Jacobi iterative method. The algorithm must execute the denota el valor obtenido de la variable following: 1. Ask the user for the size of the square linear en el nmero de iteracin j y system (number of equations equal to the number of variables) to solve representa el nivel de presin deseado.

6. Implemente las soluciones aproximadas en la pantalla.

7. Obtenga la solucin exacta del sistema y visualcela junto con los valores de la ltima iteracin 8. Grafique el comportamiento de las dos primeras variables del sistema

PARTE II. MTODO GAUSS-SEIDEL Modificar la parte 5 del algoritmo Jacobi para implementar el mtodo Gauss-Seidel

max {\m*+1 2||}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!