High Performance Computing 1
1D in detail
•Projection and prolongation are
easier in 1D, and it is easier to get a sense of the algorithmic
details.
•Consider
P(i), the problem on a 1D grid with 2^i+1 points, with the
middle 2^i-1 being the unknowns.