Example: loop given earlier

Before transformation we had two dependences:

1.

Distance: (1,0), direction: (<,.)

2.

Distance: (0,1), direction: (.,<)

After transformation by matrix ${\bf U}=\left[ \begin{array}{cc} 1 & 1 \\ 0 & 1 \end{array} \right]$ (i.e. skewing of inner loop by outer) we get:

1.

Distance: (1,1), direction: (<,<)

2.

Distance: (0,1), direction: (.,<)