Chapter 11
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
1
Gauss-Seidel
• Iterative or approximate methods provide an
alternative to the elimination methods. The
Gauss-Seidel method is the most commonly
used iterative method.
• The system [A]{X}={B} is reshaped by solving
the first equation for x1, the second equation
for x2, and the third for x3, …and nth equation
for xn. For conciseness, we will limit ourselves
to a 3x3 set of equations.
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
2
b1  a12 x2  a13 x3
x1 
a11
b2  a21 x1  a23 x3
x2 
a22
b3  a31 x1  a32 x2
x1 
a33
•Now we can start the solution process by choosing
guesses for the x’s. A simple way to obtain initial
guesses is to assume that they are zero. These zeros
can be substituted into x1equation to calculate a new
x1=b1/a11.
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
3
• New x1 is substituted to calculate x2 and x3. The
procedure is repeated until the convergence criterion
is satisfied:
 a ,i
xij  xij 1

100%   s
j
xi
For all i, where j and j-1 are the present and previous
iterations.
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
4
Fig. 11.4
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
5
Convergence Criterion for GaussSeidel Method
• The Gauss-Seidel method has two fundamental
problems as any iterative method:
– It is sometimes nonconvergent, and
– If it converges, converges very slowly.
• Recalling that sufficient conditions for convergence
of two linear equations, u(x,y) and v(x,y) are
u u

1
x y
v v

1
x y
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
6
• Similarly, in case of two simultaneous equations,
the Gauss-Seidel algorithm can be expressed as
b1 a12
u ( x1 , x2 ) 

x2
a11 a11
b2 a21
v( x1 , x2 ) 

x1
a22 a22
u
0
x1
u
a12

x2
a11
v
a
  21
x1
a22
v
0
x2
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
7
• Substitution into convergence criterion of two linear
equations yield:
a12
1
a11
a21
1
a22
• In other words, the absolute values of the slopes
must be less than unity for convergence:
a11  a12
a22  a21
For n equations :
n
aii   ai , j
by Lale Yurttas, Texas
A&M University
j 1
11
jChapter
i
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
8
Figure 11.5
by Lale Yurttas, Texas
A&M University
Chapter 11
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
9