# Gauss-Seidel method

(redirected from Gauss seidel)

## Gauss-Seidel method

[¦gau̇s ′zīd·əl ‚meth·əd]
(mathematics)
Mentioned in ?
References in periodicals archive ?
Some numerical methods such Alternating Group Explicit (AGE) [4], Successive Over Relaxation (SOR), Gauss Seidel (GS), Red Black Gauss Seidel (GSRB) and Jacobi (JB) methods are investigated to select the superior method for solving the curing model.
Table 1: The comparison of numerical results based on some numerical methods Numerical Analysis AGE Gauss Seidel SOR Red-Black Execution time 0.
Kohno, "Adaptive Gauss Seidel method for linear systems," International Journal of Computer Mathematics, vol.
First, we have to assume initial guess to start the Gauss Seidel Method.
1 PROGRAM % This function applies N iterations of Gauss Seidel method to the system of non-linear equations Ax = b % x0 is intial value tol =0.
One of the best method is Gauss Seidel for solving non-linear systems of equations.
After that we have to choose initial guess to start Gauss Seidel method then substitute the solution in the above equation and use the most recent value.
Advantageously, Gauss Seidel method is very effective concerning computer storage and time requirements.
The results shown by [11] proved that the Successive Over-Relaxation method is faster than the Gauss Seidel and Jacobi methods because of its performance, Number of iterations required to converge and level of accuracy.

Site: Follow: Share:
Open / Close