Jacobi Iteration Method Algorithm
In numerical analysis, Jacobi method is iterative approach for finding the numerical solution of diagonally dominant system of linear equations.
This article covers complete algorithm for solving system of linear equations (diagonally dominant form) using Jacobi Iteration Method.
1. Start 2. Arrange given system of linear equations in diagonally dominant form 3. Read tolerable error (e) 4. Convert the first equation in terms of first variable, second equation in terms of second variable and so on. 5. Set initial guesses for x0, y0, z0 and so on 6. Substitute value of x0, y0, z0 ... from step 5 in equation obtained in step 4 to calculate new values x1, y1, z1 and so on 7. If| x0 - x1| > e and | y0 - y1| > e and | z0 - z1| > e and so on then goto step 9 8. Set x0=x1, y0=y1, z0=z1 and so on and goto step 6 9. Print value of x1, y1, z1 and so on 10. Stop