This preview shows page 1. Sign up to view the full content.
Unformatted text preview: as follows:
Ⱥ2 7 − 11Ⱥ Ⱥ x1 Ⱥ Ⱥ 6 Ⱥ
(A) Ⱥ1 2 1 Ⱥ Ⱥ x2 Ⱥ = Ⱥ− 5Ⱥ
Ⱥ
Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ
Ⱥ7 5 2 Ⱥ Ⱥ x3 Ⱥ Ⱥ 17 Ⱥ
Ⱥ
Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ
(B) Ⱥ7 5 2 Ⱥ Ⱥ x1 Ⱥ Ⱥ 17 Ⱥ
Ⱥ1 2 1 Ⱥ Ⱥ x Ⱥ = Ⱥ− 5Ⱥ
Ⱥ
Ⱥ Ⱥ 2 Ⱥ Ⱥ Ⱥ
Ⱥ2 7 − 11Ⱥ Ⱥ x3 Ⱥ Ⱥ 6 Ⱥ
Ⱥ
Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ (C) Ⱥ7 5 2 Ⱥ Ⱥ x1 Ⱥ Ⱥ 6 Ⱥ
Ⱥ1 2 1 Ⱥ Ⱥ x Ⱥ = Ⱥ− 5Ⱥ
Ⱥ
Ⱥ Ⱥ 2 Ⱥ Ⱥ Ⱥ
Ⱥ2 7 − 11Ⱥ Ⱥ x3 Ⱥ Ⱥ 17 Ⱥ
Ⱥ
Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ (D) The equations cannot be rewritten in a form to ensure convergence. 14. The algorithm for the GaussSeidel Method to solve [A] [X] = [C] is given as
follows for using nmax iterations. The initial value of [X] is stored in [X].
(A) Sub Seidel(n, a, x, rhs, nmax)
For k = 1 To nmax
For i = 1 To n
For j = 1 To n
If (i <> j) Then
Sum = Sum + a(i, j) * x(j)
endif
Next j
x(i) = (rhs(i) ...
View
Full
Document
This note was uploaded on 08/30/2011 for the course BUSN 1003 taught by Professor Carr,r during the Spring '08 term at Arkansas State.
 Spring '08
 Carr,R
 Business

Click to edit the document details