Skip to main content
. Author manuscript; available in PMC: 2013 Dec 28.
Published in final edited form as: SIAM J Sci Comput. 2013 Jul 9;35(4):10.1137/120892386. doi: 10.1137/120892386

Fig. 4.2.

Fig. 4.2

Time taken by each of the algorithms in Section 4. (A) Time requirements of the algorithms from Recipe 1 as a function of the number of rotations at fixed degree L = 25. Note that in Recipe 1 we search over three rotational degrees of freedom. (B) Time requirements of the algorithms from Recipe 2 as a function of the number of rotations at fixed degree L = 25. Note that in Recipe 2 we search over five rotational degrees of freedom. (B) Time requirements of the algorithms from Recipe 1 as a function of the maximum degree of the series expansion L at a fixed number of 30.000 rotations. (D) Time requirements of the T-Matrix computation as a function of the maximum degree of the series expansion L for the direct computation and the speedup.