Volume 5, Issue 1
Comparison and Improvement of the Computational Efficiencies of Two FFT-based Iterative Solution Methods for the Scalar Multiple-scattering Equation

Kristopher T. Kim

DOI:

Commun. Comput. Phys., 5 (2009), pp. 108-125.

Published online: 2009-05

Preview Full PDF 335 739
Export citation
  • Abstract

We consider two existing FFT-based fast-convolution iterativesolution techniques for the scalar T-matrix multiple-scattering equation [1]. The use of the FFT operation requires field values be expressed on a regular Cartesian grid and the two techniques differ in how to go about achieving this. The first technique [6,7] uses the nondiagonal translation operator [1,9] of the spherical multipole field, while the second method [11] uses the diagonal translation operator of Rokhlin [10]. Because of its use of the non-diagonal translator, the first technique has been thought to require a greater number of spatial convolutions than the second technique. We establish that the first method requires only half as many convolution operations as the second method for a comparable numerical accuracy and demonstrate, based on an actual CPU time comparison, thatit canthereforeperformiterations fasterthanthe secondmethod. We then consider the respective symmetry relations of the non-diagonal and diagonal translators and discuss a memory-reduction procedure for both FFT-based methods. In this procedure, we need to store only the minimum sets of near-field and far-field translation operators and generate missing elements on the fly using the symmetry relations. We show that the relative cost of generating the missing elements becomes smaller as the number of scatterers increases. 

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • References
  • Hide All
    View All

@Article{CiCP-5-108, author = {Kristopher T. Kim}, title = {Comparison and Improvement of the Computational Efficiencies of Two FFT-based Iterative Solution Methods for the Scalar Multiple-scattering Equation}, journal = {Communications in Computational Physics}, year = {2009}, volume = {5}, number = {1}, pages = {108--125}, abstract = {

We consider two existing FFT-based fast-convolution iterativesolution techniques for the scalar T-matrix multiple-scattering equation [1]. The use of the FFT operation requires field values be expressed on a regular Cartesian grid and the two techniques differ in how to go about achieving this. The first technique [6,7] uses the nondiagonal translation operator [1,9] of the spherical multipole field, while the second method [11] uses the diagonal translation operator of Rokhlin [10]. Because of its use of the non-diagonal translator, the first technique has been thought to require a greater number of spatial convolutions than the second technique. We establish that the first method requires only half as many convolution operations as the second method for a comparable numerical accuracy and demonstrate, based on an actual CPU time comparison, thatit canthereforeperformiterations fasterthanthe secondmethod. We then consider the respective symmetry relations of the non-diagonal and diagonal translators and discuss a memory-reduction procedure for both FFT-based methods. In this procedure, we need to store only the minimum sets of near-field and far-field translation operators and generate missing elements on the fly using the symmetry relations. We show that the relative cost of generating the missing elements becomes smaller as the number of scatterers increases. 

}, issn = {1991-7120}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/cicp/7726.html} }
Copy to clipboard
The citation has been copied to your clipboard