PETE 603

Lecture Session #27

Tuesday, 7/27/10

A3 Ordering

27.2

13

28

14

29

15

30

25

10

26

11

27

12

22

23

24

19

20

21

16

17

18

This ordering is also known as red/black or

checkerboard ordering.

27.3

A3 Incidence Matrix

D P
1 1
P D
2 2

Where D are diagonal matrices

and P are 4-diagonal matrices
(for 2D).

D4 Ordering

27.4

22

10

27

14

30

18

23

11

28

15

19

24

12

29

16

20

25

13

17

21

26

D4 ordering follows alternate diagonals.

27.5

D4 Incidence Matrix

D P
1 1
P D
2 2

Where D are diagonal

matrices, and P are 4-diagonal
matrices.

27.6

A3 and D4 Orderings
The A3 and D4 orderings of the grid blocks partitions the matrix
equation, Ax = y, as follows:

D1 P1
P D
2
2

x1 y1
x y
2 2

For A3, elimination of the submatrix P2, forms the upper triangular
submatrix D2.
For D4, during elimination of submatrix P2, coefficients are added to
submatrix D2 (shown as circles on Dalton and Mattax, Fig 6.7).
Elimination on the modified D2 is done to form the upper triangular
submatrix D2.

27.7

A3 and D4 Orderings
Afterwards, we have:

D1 P1
0 D '

x1 y1
x y'
2 2

The second equation gives:

x 2 D'21y'2
and back substitution gives:

x1 D1'1 y1 P1 D2'1 y2' D1'1 y1 P1 x2

27.8

A3 and D4 Comparison
D4 is usually more efficient than A3.
D4 also more complicated to program
and has larger computer memory
requirement, so A3 sometimes is
preferred to D4.

Direct/Iterative Methods

27.9

For direct methods

Computer time increases rapidly with the number of
unknowns [(n) to (n)3]
Roundoff error increases with the number of unknowns

CPU
Iterative

Time
Direct

Number of Unknowns