A new efficient algorithm based on the decomposition of strong and weak interactions among scatterers is proposed. The weak interactions, which account for the majority of the required CPU time and memory, are calculated using a canonical grid with a translation addition theorem. This facilitates the use of FFT and results in an N log N‐type efficiency for CPU and O(N) for memory.
No takes yet. Share an insight, caveat, or question.
Chan et al. (1995) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: