Skip to main content
. 2018 Aug 7;81(1):670–685. doi: 10.1002/mrm.27371

Figure 6.

Figure 6

Computation time for 20 Bregman iterations and different problem sizes. (A) Using the preconditioner, the total computation time for the PCG part in 20 Bregman iterations is reduced by more than a factor of 4.5 for all studied problem sizes. (B) The computation time for 20 Bregman iterations of the entire algorithm also includes the Bregman update steps, so that the total speedup factor is approximately 2.5 for the considered problem sizes. (C) The two methods converge to the same solution, plotted here for R = 4 and a reconstruction matrix size 256 × 256.