Code 2: Gauss-Seidel method used for calculating the global linear system.

Furthermore, the choice of the Gauss-Seidel method is due to its simplicity of implementation; however, this proposal could be adapted to other methods of solving linear systems, as, for example, the method of conjugate gradients when the formulation is done via LSFEM (Least Squares Finite Element Method).

For the solution of the system of linear equations obtained from the fourth order compact scheme, if we use classical iterative methods like Jacobi and

Gauss-Seidel method this will slow the convergence due to large linear system.

Inspired by the advantage of

Gauss-Seidel method against Jacobi method for linear equations, the dynamic differential evolution (DDE) [14] was developed.

1992; Rajcic, 1988) programs have been created in C++ programming language for

Gauss-Seidel method, Fast-Decoupled method and Newton-Rapson method of Solution of Nonlinear Algebraic Equations.

4962 which resembles the smoothing rate by a

Gauss-Seidel method for a Poisson's equation [2].

Gauss-Seidel method [21] is an iterative method used to solve linear systems of equations.

1 we show the behaviour, for the LANPRO problems, of some block two-stage methods on both multiprocessors using as inner procedure the

Gauss-Seidel method and performing at each block a fixed number of inner iterations (q(l, j) = q, 1 [less than or equal to] j [less than or equal to] # Proc.

This author has adapted the Richardson, Jacobi, and the

Gauss-Seidel methods to choose the splitting matrix and obtained that the homotopy series converged rapidly for a large sparse system with a small spectral radius.

Jacobi and

gauss-seidel methods for nonlinear network problems.

Extrapolated accelerated

Gauss-Seidel Methods, Int.

The family of

Gauss-Seidel methods consists of one-pass Picard iterations for each equation (P1), and full Newton-Raphson or Picard iteration for each equation (NR or P).