Coarse-Graining Approach: Resource Requirements
Memory
- for each level, store n sub-blocks
- for simulation of length T = nkDt requires k ? n stored values
compare to nk values for direct method
Computation
- each level j requires update (summing n terms) every 1/nj steps
- total
-
-
-
- scales linearly with length of total correlation time
compare to T2 or T ln(T) for other methods