Gauss Seidel

In numerical linear algebra, the Gauss–Seidel method.

In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite. It was only mentioned in a private letter from Gauss to his student Gerling in 1823.[1] A publication was not delivered before 1874 by Seidel.

More information (https://en.wikipedia.org/wiki/Gauss%E2%80%93Seidel_method).

This application solve square systems (maximum 20x20).

1) Choose the system order.

2) Fill the array by clicking the 'Matrix Values' button. The grid 'Matrix Equation' fill each row of the equation with its constant.

3) Click the 'Run' button to calculate

The button 'Example' illustrates how the application works.