High Performance Computing 1
V Cycle
•The work at each point in the
algorithm is proportional to the number of unknowns, since the value
at each grid point is just averaged with its nearest neighbors. So
each grid point on level i will cost (2^i-1)^2 = O(4^i)
operations. If the finest grid is at level m, the total
serial work will be given by the geometric sum
which is O(m) = O( log #unknowns ).
